Cluster A.V - Constitutional Principles of the Kernel
Preface node
heading:cluster-a-v-constitutional-principles-of-the-kernel:21368
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-side carrier, publication face, diagram, dashboard, card, model output, PublicationUnit, rendering, 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
Consequence-Guided Ontological Problem Solving
Type: Architectural (A) Status: Stable Normativity: Normative
Use this when
Use this pattern when a clear or apparently clear engineering claim produces the wrong action, identity, dependence, obtaining, responsibility, or projection consequence, and a typed or constructive distinction may repair it. One grounded counterexample or one direct-owner invariant can trigger the work; you do not need two polished alternative ontologies before starting.
The first useful move is to state the affected engineering result and the smallest defeated or disputed claim, then enter the first diagnostic locus that can change that result. Stop as soon as an admitted working account determines the next move truthfully.
Not this pattern when. If the blocker is missing observation or evidence, return to the domain or evidence owner. If wording alone hides the distinction, use C.2.P or E.10. If the problem is a material premise conflict between FPF methods, use A.7.2. If a missing distinction must become durable FPF ontology, exit to E.24/E.24.UK, A.8, and A.11 rather than admitting it here.
The primary reader is a domain engineer or ontology analyst responsible for the affected use. This pattern is a U.MethodDescription; a named admitted U.System under the current engineering or analysis role assignment performs the dated ontology-analysis U.Work. The reader, performer, method episteme, work, and returned engineering result remain separate.
Problem frame
A maintenance sentence can be lexically clear and still merge two relation occurrences across removal and reinstallation. A responsibility claim can name the right role word while ignoring whether an assignment relation ever began. A graph or logical type can look exact while omitting the construction that changes the action. In these situations, a glossary is too little and an exhaustive ontology exercise is too much.
The governed concern is the smallest ontology-analysis application that changes one declared engineering use, result, or guarantee. The ordinary product is a repaired statement, method choice, action, direct-owner return, or explicit blocker—not an ontology artifact by default.
Problem
Ontology work often starts from available vocabulary rather than a failed consequence. That encourages blanket constructive replay, premature kind admission, and durable records even when direct kinds and relations already decide the next action. The opposite failure treats clear words as sufficient and leaves a category error inside work, evidence, role, state, capability, relation, or representation claims.
The practical question is not “How much ontology can we recover?” It is “Which distinction changes the engineering move at the required guarantee, and what is the cheapest truthful return?”
Forces
Solution
Inherit the complete application contract
This A.7.1 description narrows the method claims stated by C.19.2 for consequence-guided ontology analysis. When applying A.7.1, retain the declared use, problem-facing result, claimed guarantee, horizon, useful threshold, separation among method, reader, performer, Work, and result, positive stop, and reopen rule. This is description-level claim reuse; it adds no relation occurrence between the described Methods.
The normal short path uses the already selected A.7.1 analysis method as its one current apparatus. It begins from one exact engineering subject and that subject's current direct owner; subject and owner are inputs and constraints, not apparatus candidates. Use C.18 only when the team must generate or reframe alternative analysis methods, models, formalisms, or other direct-kind apparatuses for the same declared use. Use C.11 only when two or more already-available apparatuses are eligible for that same use and guarantee, making a real local-choice question current. After selection, A.15.2 owns planning and A.15.1 owns dated work; C.24 enters only for tool-call enactment planning.
Start from the defeated consequence
Name five things in ordinary domain language:
- the affected engineering result and its required guarantee;
- the smallest claim whose current reading fails or is disputed;
- the observed consequence failure, direct-owner invariant, or grounded counterexample;
- at least one candidate correction or a request to recover one; and
- the action that must remain blocked until the distinction is settled.
One defeated reading is enough. Recovering or constructing an alternative can be part of the work.
Enter one of four diagnostic loci
The four loci are a named diagnostic set; they are not a mandatory sequence.
- Domain inquiry. Ask whether the relevant behaviors, interventions, evidence, and consequences are known. If not, return domain, measurement, or evidence work without ontology invention.
- Wording use. Ask whether one term or sentence obscures distinct claims. Use
C.2.PorE.10only when wording precision is the live blocker. - Working typed account. Test whether direct kinds, participant positions, relation direction, temporal qualification, evidence relation, and occurrence identity suffice for the use. Reuse the relation, role, state, capability, method, work, and evidence owners already in FPF.
- Subject-specific constructive ground. Return to the exact subject construction only when action, identity, dependence, obtaining, constitution, or decision-changing CT2R loss differs across constructions. Use the direct relation-occurrence, role-assignment, holon-recognition, work-occurrence, state/capability, or structural-construction owner. Do not default to
C.13or a generic constructive calculus.
Perform only consequence-changing ontology work
- Select the first locus capable of resolving the delta.
- Have the admitted system perform the required domain, wording, typing, evidence, or construction work.
- Use exact
A.7.CPclaim IDs throughClaimUsedAsReasoningBasisRelation@Contextonly when those claims are load-bearing in the work. Do not traverse the compact by default. - Preserve direct evidence, currentness, source-use, kind-admission, and subject-construction owners.
- Return the repaired result immediately when the next action is truthful at the declared guarantee.
The method result uses one of these closed local dispositions in its result episteme: repairedEngineeringStatement, methodChoice, actionSelected, noOntologyIntervention, returnToDirectOwner, or unresolvedWithBlocker. These are method-result dispositions, not new U-kinds. Each names the affected use, practical result or blocked claim, and stop/reopen condition.
Decide whether the working account is enough
A working account is sufficient when admitted direct kinds and relations determine the next move and plausible constructional alternatives do not change the result or guarantee. Stop without declaring the alternatives false. Do not create an occurrence ledger, evidence apparatus, publication package, or ontology record whose distinctions cannot change the use.
Create a durable ontology result only when reuse, dispute, high consequence, automation, or cross-pattern change makes persistence valuable. If the work exposes a missing distinction that must persist, send the candidate to its admission owner and return after admission.
Reopen and teach without premature structure admission
Reopen on a consequential counterexample, changed guarantee, failed use, projection loss, changed occurrence identity, or a newly admitted direct-owner distinction. Reopen only the affected engineering and ontology decisions.
A short domain/wording/typed-account/constructive-ground presentation may be kept as a ProvisionalUnfoldingDemonstrationDescription@Context. It is a teaching episteme, not an admitted CGUS, method, plan, work occurrence, or result. A reusable structure requires the full A.22.CGUS admission coordinates.
Archetypal Grounding
Support occurrence repair. A maintenance claim says bearing B1 continued supporting shaft S1 after removal and reinstallation. The direct relation identity rule defeats that reading before a second ontology is written. The A.7.1 analysis method is already selected, while the current support-relation owner constrains the disputed claim; neither the bearing/shaft subject nor that owner is an apparatus candidate, so the work creates no option set. Ontology-analysis work uses A7CP-01 and A7CP-10, recovers two support occurrences, repairs the warranty and incident-attribution claim, and returns it to maintenance. No new relation kind or U-kind is created.
Missing telemetry non-use. A team cannot determine pump state because telemetry was never collected. State kinds, evidence relations, and candidate actions are already clear. The result is returnToDirectOwner for measurement and evidence work with the blocked state claim; no premise-use occurrence or ontology artifact is minted.
Construction-changing case. A maintenance set uses “part” for both MemberOf and ComponentOf. Removal action differs only in the structural construction case. The work returns the disputed item to C.13, repairs the direct maintenance claim, and leaves unrelated set membership unchanged.
Bias-Annotation
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: engineering uses in which ontology may change a practical result.
Ontology-display bias favors elaborate category systems even when direct owners already decide the case. Lexical bias treats clear wording as proof of sound ontology. Evidence bias converts unresolved reliance into a third world state. The mitigation is a defeated consequence, first-capable locus, direct-owner return, and positive stop.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
The pattern gives ontology work a practical exit. It can repair a consequence-changing conflation, return to the real blocker, or stop at an adequate working account without pretending the rest of ontology is false. The cost is naming the defeated claim and the work/result boundary. The benefit is less speculative ontology and more reliable engineering action.
Rationale
Ontology effort should scale with changed consequence, not with available vocabulary. A direct-owner invariant or grounded counterexample provides a better start than a universal checklist because it exposes why the current account fails. Four loci preserve the common places where repair occurs without forcing an order. The description-level narrowing of C.19.2 carries the economics, work separation, and truthful one-apparatus path instead of duplicating them loosely.
Repair only the ontology that changes the engineering move.
SoTA-Echoing
These sources change the working method and its cases. They do not license a fixed explication ladder, exhaustive ontology traversal, or replacement of domain evidence by conceptual work.
Relations
- Description-level specialization: A.7.1 narrows the method claims stated by
C.19.2. On the ordinary one-apparatus path, the already selected A.7.1 analysis method is the direct-kind apparatus; the engineering subject and its direct owner remain inputs and constraints. A.7.1 retains the declared use, problem-facing result, claimed guarantee, horizon, useful threshold, separation among reader, performer, Work, and result, stop, and reopen. It retainsC.18andC.11candidate and choice behavior only for alternative analysis methods, models, formalisms, or other applicable apparatuses eligible for the same use and guarantee. This wording adds no relation occurrence between the described Methods and asserts neitherU.SubkindOfnor a world relation. - Consumes: exact
A.7.CPclaim epistemes throughClaimUsedAsReasoningBasisRelation@Contextonly when the ontology-analysis work relies on them. - Coordinates with:
A.7.2when a material cross-pattern premise conflict is current; neither method is the other's parent or premise owner. - Returns to: direct relation, role, holon, state, capability, method, work, evidence, temporal, structural, and domain owners for the claim being repaired.
- Escalates durable ontology to:
E.24/E.24.UK,A.8, andA.11; it does not admit U-kinds or relations itself. - Preserves: current
A.7Strict Distinction andA.22.CGUSadmission law.
A.7.1:End
FPF Ontology-Premise Reconciliation
Type: Architectural (A) Status: Stable Normativity: Normative
Use this when
Use this pattern when two or more dated applications of current FPF methods or patterns yield ontology-claim or decision epistemes whose claims or practical consequences cannot jointly support the same receiving claim or consequence in the same scope. Trace each result to the exact pattern or method clauses, premises, and accepted source-use occurrences that the application actually used; a difference between texts alone is not a conflict. One material contradiction is enough; recurrent conflict is not required.
The first useful move is to name the smallest receiving ontology claim and, for each dated application, the result claim or decision, the practical consequence it would support, and the exact clause, premise, or source use on which it relied. If the result claims or consequences differ by scope, stop with a context split instead of forcing agreement.
Not this pattern when. A vocabulary difference, unlike source function, or different subject with no shared practical consequence is not a premise conflict. Use A.7.1 for one engineering ontology defect, C.2.P/E.10 for wording use, direct evidence or formal owners for missing warrant, and source-currentness owners for stale editions.
The primary reader is an FPF maintainer, architecture steward, or pattern author responsible for a material cross-pattern contradiction. This pattern is a U.MethodDescription; an admitted U.System performs dated reconciliation U.Work under a distinct current U.RoleAssignment for an FPF author or maintainer role. The pattern episteme, reader, performing system, assignment, work, source uses, and returned FPF decision remain distinct.
Problem frame
Neighboring FPF pattern and method epistemes can state different premises about existence, constitution, identity, dependence, obtaining, representation, agency, or formal projection. A dated application of a role-method clause may yield a decision claim that assignment work or a policy-valid instituting act must occur before responsibility obtains, while an application of a relation-method clause may yield a claim that a signed chart constitutes that same assignment. Both texts may be internally clear, yet the application results select different responsible systems for one maintenance action.
The governed concern is one bounded reconciliation of exact FPF receiving claims and their practical consequences. The ordinary result can be compatibility, separation, non-composition, no-conflict stop, or unresolved escalation. Convergence is not mandatory.
Problem
A premise catalogue does not repair dated applications whose result claims conflict. Prestige ranking of sources can hide the receiving claim, while broad foundation rewriting can damage unrelated pattern decisions. Conversely, treating different source functions as automatically incomparable can leave a real same-claim contradiction unresolved.
Reconciliation must recover what each work occurrence actually used, what source content bore on the receiving claim, which direct owners decide evidence and currentness, and which smallest FPF decision must reopen.
Forces
Solution
Recover the exact conflict
- Name the smallest disputed receiving ontology claim and its current edition.
- For each dated application, name its resulting ontology-claim or decision episteme, the practical consequence the receiving use would take from it, and the exact method clause, premise, or source-use occurrence on which the work relied.
- Recover the exact FPF claim epistemes, dated application-work occurrences, direct kinds and relations,
A.7.CPreasoning-basis occurrences, source-use occurrences, scope, and currentness. - Test whether the result claims support incompatible answers to the same receiving claim or practical consequence in the same scope. If not, return
noConflictStoporcontextSplit. - Compare exact source content through direct evidence, formal-semantics, domain, scope, and currentness owners. Do not rank source labels.
- Translate candidate distinctions into FPF objects and constructive consequences. Test them against subject evidence and only the
A7CP-*claims used by the reconciliation work. - Reopen the smallest FPF decision set, preserve unaffected direct-owner decisions, and repair the method clause or direct-owner decision that caused the dated applications to yield incompatible results. Run enough of the affected application again to obtain a checked result; do not stop at rewriting a premise list.
- Return one declared result with affected use, stop, and reopen condition.
Use one closed reconciliation result set
The result episteme uses exactly one local disposition:
reconciledCompatibility— repaired clauses and checked application results now support compatible use for the named claim and scope;contextSplit— the claims or constructions are valid only in different named contexts or scopes;doNotCompose— both may remain current, but their outputs must not be combined for the named use;unresolvedEscalation— evidence or decision authority is insufficient, with the exact blocked use and receiving owner named;noConflictStop— the apparent conflict disappears after claim, consequence, or scope recovery.
These are reconciliation-result dispositions, not new U-kinds. Compatible co-use is demonstrated only when warranted. A current conflict does not have to end in one winner.
Record claim-relative source use
OntologyClaimSourceUseRelation@Context records how one dated ontology-decision or reconciliation work occurrence actually consumes one source episteme for one receiving ontology claim. It is local to this use and does not create a universal source-authority relation.
The source participant is the exact source episteme and edition consumed. The receiving participant is the exact ontology-claim episteme and edition being formulated, constrained, tested, interpreted, compared, or traced. The work participant is the dated ontology-decision U.Work: its already admitted holder U.System performs that work under an exact current U.RoleAssignment. When an F.6 performedBy(W, RA) attribution is cited, RA.HolderSystemSlot must resolve to that same system; the assignment neither supplies the system nor performs the work.
The minimal occurrence needs only those three exact participants, useFunction, sourceUseScope, and the derived maximal continuous interval during which the named work actually consumes content from that source episteme for that receiving claim. Citation, access, bibliography membership, prestige, publication status, or co-location alone is insufficient. If the work consumes only a separately identified claim or content episteme inside the source, sourceContentSliceRef names that slice; it does not duplicate the source participant under a bundle alias. Changing a source or receiving-claim edition, work occurrence, function, scope, or demonstrated actual-use interval identifies another occurrence. A changed optional qualifier identifies another occurrence only when it changes the content or direct use predicate; a later review record alone does not.
Add modelUseStructureRef only when one independently selected BoundedModelUseStructure changes interpretation of this use. Add source-content kind, currentness-result, landed-decision, evidence-use, disposition, blocked-overread, or receiving-claim-change references only when the reconciliation work actually asserts or consumes that item under its direct owner. A recorded unresolved disposition needs no fabricated blocked-overread episteme; unchanged is recorded only when the work actually reaches that result, while absence of a change disposition remains no claim.
Identify source-use conflict without ranking traditions
OntologySourceUseConflictFinding@Context <: U.Episteme cites two or more exact source-use occurrences and states a conflict only when their content bears on the same receiving claim or same practical consequence in the same scope and their conclusions cannot jointly hold.
Different use functions are neither automatically comparable nor automatically insulated. Compare their exact content through direct evidence, formal-semantics, domain, scope, and currentness owners. A finding can support adoption, adaptation, rejection, context split, non-composition, or unresolved return only with the exact counterexample, contradiction, proof consequence, or evidence relation that warrants it. “Stronger source” without claim-specific grounds is not a resolution.
Stop and reopen
Stop with noConflictStop when the shared claim or consequence disappears after recovery. Stop with contextSplit or doNotCompose when that boundary truthfully protects the use. Stop unresolved only with the exact missing evidence or decision owner and blocked use.
Reopen when a source or receiving-claim edition changes, currentness changes, new domain or formal evidence bears on the same claim, a blocked overread becomes relevant, a landed decision changes, or later dated applications of repaired clauses yield incompatible same-scope consequences. Reopen only affected source-use, application-result, and receiving decisions.
Archetypal Grounding
Compatible repair. One dated application of a role-method clause yields a decision claim that assignment work or a policy-valid instituting act constitutes a responsibility-bearing U.RoleAssignment. Another dated application of a neighboring relation-method clause yields a claim that a signed organization chart is sufficient to make the same assignment occurrence obtain. The two result claims select different responsible systems for one maintenance action. Reconciliation work recovers both result claims, their method clauses, source uses, and reasoning-basis uses of A7CP-01, A7CP-03, A7CP-05, and A7CP-06. It repairs the relation clause so the chart is evidence for an assignment assertion rather than constitution of the assignment, then checks the affected application result. The result is reconciledCompatibility; unrelated evidence and publication law stays unchanged.
Context split. One dated application uses a pattern's ComponentOf clause to classify a pump assembly; another uses a MemberOf clause to classify a maintenance-candidate set. Both result claims say “part”, but their subjects, receiving claims, constructions, and consequences differ. The result is contextSplit; neither source clause nor application result defeats the other.
Non-convergence. Two dated method applications yield incompatible same-scope dependence claims, but available evidence and formal consequences warrant neither correction. The result is doNotCompose for the affected assurance use or unresolvedEscalation with exact result claims, missing evidence or decision owner, and reopen condition. Familiarity or institutional status cannot manufacture convergence.
Bias-Annotation
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: material cross-pattern ontology-premise conflicts in FPF.
The dominant biases are prestige hierarchy, forced convergence, and formal-shape authority. The mitigations are claim-relative source-use occurrences, same-claim/same-consequence tests, direct evidence/currentness owners, a smallest-decision repair, and truthful context-split/non-composition outcomes.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
FPF gains a way to repair foundation conflicts without a total source hierarchy or an omnibus ontology pattern. The method can prove compatible co-use, preserve scoped pluralism, block composition, or return unresolved with an accountable reopen. The cost is exact source/receiving/work and currentness recovery; that cost is paid only for material conflicts.
Rationale
The receiving claim supplies the adjudication question. This keeps source kind, currentness, evidence use, local use function, disposition, and claim change orthogonal. Repairing the smallest method decision preserves corpus stability, while non-convergence outcomes prevent a neat vocabulary from overruling absent evidence.
Repair the smallest foundation conflict; do not manufacture one foundation.
SoTA-Echoing
Each row changes a source-use or comparison boundary in the Solution and cases. No row grants total authority to a source family, and a newer publication alone does not reopen unrelated FPF decisions.
Relations
- Coordinates with:
A.7.1.A.7.2is neither its parent nor child; it handles material cross-pattern premise conflict and can return repaired direct-owner decisions to it. - Consumes: exact claim contents from
A.7.CPthrough actualClaimUsedAsReasoningBasisRelation@Contextoccurrences; it does not copy or own the compact. Pattern and method epistemes supply clauses or declared premises, while dated application work and its result claims supply the reconciliation inputs. - Defines:
OntologyClaimSourceUseRelation@ContextandOntologySourceUseConflictFinding@Contextfor bounded ontology-decision and reconciliation source use only. - Coordinates with:
A.10for evidence use,G.11for currentness,C.29and direct formal patterns for formal semantics,C.2.1/E.17for source epistemes and publications, and subject patterns for the receiving ontology claim. - Preserves: current landed FPF decisions as default internal basis while allowing grounded, claim-specific reopen. It does not replace
E.9.DAreview or DRR discharge. - Does not define: a universal source-authority kind, source role, prestige ranking, evidence relation, publication relation, or source-currentness relation.
A.7.2:End
Constructive-Premise Compact and Reasoning-Basis Use
Type: Architectural (A) Status: Stable Normativity: Normative
Use this when
Use this pattern when reasoning, ontology analysis, choice, or reconciliation actually relies on a broad constructive claim and another person must be able to recover which claim, exact receiving claim or result, posture, scope, work occurrence, and interval carried that reliance.
The first useful move is to name the dated reasoning work, each exact claim-bearing result or receiving decision it is forming, the exact A7CP-* claim IDs used for that result, and whether each use is an adoptedPremise or conditionalAssumption. Leave the other compact claims latent.
Not this pattern when. Citation, publication, shared vocabulary, ordinary A.7 category-error repair, source currentness, or a domain/evidence problem that uses no compact claim in reasoning creates no relation occurrence. This support pattern is not a method, performer, work plan, catalogue-reading episode, or problem-facing result.
The primary reader is an author or reviewer who must make one load-bearing constructive premise use recoverable. The governed object is one ClaimUsedAsReasoningBasisRelation@Context occurrence and the exact compact claim content it cites.
Problem frame
Dated work applying an FPF method can rely on broad claims such as “a publication does not create world-side obtaining” or “a method episteme does not perform work”. A method episteme may separately state or cite one of those claims as a declared premise or branch condition under its own episteme/declaration owner. ClaimUsedAsReasoningBasisRelation@Context instead records only the claim on which one actual inference, comparison, or choice in dated work relies. Copying the claim into every method makes it drift; leaving the dated reliance implicit hides whether a particular result used an adopted premise, a conditional branch, or no common claim at all.
The compact publishes twelve stable claim contents once. A method description can declare an intrinsic premise or a branch condition under its own episteme/declaration owner; a dated application records only the compact claims actually used in its reasoning. Ordinary work therefore does not acquire a foundation checklist.
Problem
Three conflations make premise use unreliable:
- claim content is confused with the posture in which one work occurrence uses it;
- citation or co-location is confused with actual reliance in reasoning; and
- a support owner is treated as a method that performs or governs the consuming work.
The result is either hidden premises or a copied catalogue that becomes a second ontology authority. Both failures obscure occurrence identity and reopen behavior.
Forces
Solution
Publish the compact once
The compact carries these stable claim contents:
A7CP-01 Existence and obtaining. World-side obtaining is not created by a claim, database row, predicate, or publication merely representing it.A7CP-02 Constructive settlement. When identity, constitution, dependence, or obtaining changes a consequence, name the construction or direct governing relation that grounds it; a reconstructible trace is not itself the world construction.A7CP-03 Constitution and social objects. Constituting acts, admitted systems, and the relations they institute remain distinct from descriptions of those acts and relations.A7CP-04 Epistemic openness and fallibility. Evidence and reliance may remain unresolved without turning unresolved evidence into a third world-side obtaining mode.A7CP-05 Representation boundary. Descriptions, logical forms, database rows, graphs, and publications represent or carry claims under exact relations; their form does not prove the represented ontic.A7CP-06 Agency and work attribution. A method episteme describes a way of working; an admitted system under a role assignment performs dated work and produces results.A7CP-07 Kind discipline. Use direct existing kinds and local admission before proposing a universal kind, root relation, or role-like surrogate.A7CP-08 Scoped pluralism. Different source traditions or apparatuses may be useful for different receiving claims; compatibility is tested by consequences, not achieved through prestige hierarchy.A7CP-09 Structure and wholeness. A description of structure is not the structure; not every construction is mereology, andC.13remains the owner of constructional mereology only.A7CP-10 Time, identity, and currentness. World-side temporal qualification, occurrence identity, claim/publication currentness, and source supersession are separate questions.A7CP-11 Direct-owner separation. Capability, state, architecture, role, method, work, evidence, permission, and relation families retain their direct owners even when an ontology method diagnoses a conflict among them.A7CP-12 Formal projection non-reversal. CT2R and formalization may preserve, collapse, or omit structure. Logical validity or representation form does not reverse-infer a unique world construction.
The twelve IDs form a stable closed compact in this pattern. They are not steps, completeness criteria for every ontology use, or twelve intrinsic premise kinds.
Record actual reasoning-basis use
Premise and assumption name postures of exact claim use, not disjoint claim kinds.
BasisClaimSlot is the exact claim-bearing episteme and exact compact claim ID used. ReasoningWorkSlot is the dated reasoning, choice, ontology-analysis, or reconciliation U.Work that relies on it. ReceivingReasoningResultSlot is the exact claim, comparison, decision, or other claim-bearing result episteme whose content that work forms or revises using the basis claim. If the practical result is world-side, use the exact governed result claim that bears on it; the world-side object retains its direct owner. The already admitted holder U.System performs the work under an exact current U.RoleAssignment; when F.6 performedBy(W, RA) attribution is cited, RA.HolderSystemSlot must resolve to that same system. The assignment neither supplies the system nor performs the work. Claim episteme, work occurrence, use posture, receiving result, and any world-side result remain distinct; the words “premise” and “assumption” are not relation participants.
The relation obtains during the maximal continuous interval in which the named work actually relies on the exact basis claim to form or revise the exact receiving result. Access, citation, publication, co-location, or use of the claim elsewhere in the same work is insufficient. reasoningUseScope appears only when this premise use is narrower than or otherwise differs from the receiving result's declared claim scope; modelUseStructureRef appears only when an independently selected BoundedModelUseStructure changes interpretation. Source currentness, evidence, publication, work method, and the receiving result's own governance remain with their owners.
One occurrence is identified by the exact basis-claim edition and ID, reasoning-work occurrence, receiving-result edition, posture, optional narrower use scope, and maximal continuous reliance interval. If one work uses the same basis claim for two independent results, record two relation occurrences that share the work participant but name different receiving results; do not duplicate the work. A change to any identity value ends or splits only the affected result-specific occurrence.
Keep posture and transition explicit
adoptedPremise means the named work presently uses the basis claim as accepted support for the exact receiving result. conditionalAssumption means the work uses it for that result only in a narrower model, scenario, proof, or branch with an explicit test, defeater, or reopen condition. Every conditional assumption actually used can function as a premise inside that bounded subargument; not every adopted premise is conditional. Neither posture changes the basis-claim episteme's intrinsic kind.
The same claim can have different postures in different work or for different receiving results of one work. A posture transition creates a later occurrence only for the exact receiving result on that relation edge. Reopen that result and its dependents; another result of the same work remains closed when its separate premise-use occurrence and posture did not change.
Use the cheapest truthful path
- Name the exact reasoning work and each exact receiving claim, decision, comparison, or other claim-bearing result it is forming.
- For each receiving result, cite only the compact IDs that are load-bearing.
- Record one relation occurrence per exact basis claim, receiving result, posture, and continuous reliance interval; reuse the same work reference across independent results.
- Name a narrower
U.ClaimScopeor selectedBoundedModelUseStructureonly when it changes this premise use. - Keep evidence, currentness, source use, kind admission, subject construction, work method, and result governance with their direct owners.
- Stop when every load-bearing receiving result points to its exact premise-use occurrences. Do not inspect unused compact entries.
Archetypal Grounding
Relation-occurrence repair. Ontology-analysis work splits one support relation into two occurrences after removal and reinstallation and returns SupportOccurrenceRepairDecision-17. That result relies on A7CP-01 and A7CP-10, so two reasoning-basis occurrences name the same work and receiving result but different basis claims. The other ten claims stay latent.
Role/chart reconciliation. Reconciliation work returns AssignmentConstitutionDecision-42, which distinguishes assignment constitution from a chart that evidences the assignment. Four result-specific relation occurrences connect that decision to A7CP-01, A7CP-03, A7CP-05, and A7CP-06. Source-use and evidence relations stay under their direct owners.
Same-work selective reopen. SupportRepairWork-19 returns both WarrantyClaimRepair-19 and IncidentAttributionRepair-19. Each has its own relation occurrence to A7CP-10. The warranty result uses that claim as an adopted premise; the incident result uses it as a conditional assumption while a removal timestamp is disputed. Evidence that settles that timestamp changes the posture only on the incident-result edge, so IncidentAttributionRepair-19 reopens while the unchanged warranty-result edge leaves WarrantyClaimRepair-19 closed.
No compact use. Missing telemetry blocks a state claim while the relevant state and evidence distinctions are already clear. Work returns to measurement/evidence. No compact claim is load-bearing, so no reasoning-basis occurrence is created.
Bias-Annotation
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: cross-pattern constructive premise support and actual reasoning-basis use.
The main biases are foundation maximalism, premise-kind inflation, and trace-by-citation. The mitigation is one compact owner, exact claim IDs, two context-local postures, actual work participation, and a non-use rule that keeps ordinary reasoning cheap.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
The compact makes broad constructive reliance recoverable without enlarging current A.7 or creating copied foundation variants. Ordinary users pay nothing unless a claim is actually load-bearing. The cost is precise claim/work/posture identity in consequential reasoning; the benefit is stable content ownership and bounded reopen.
Rationale
Claim content and reasoning posture vary on different axes. Publishing the content once and recording use through a direct relation prevents both hidden premises and premise-kind inflation. Work participation makes the relation ontologically honest: an episteme can be used by reasoning work but cannot reason or act by itself.
Use only the premise the work actually relies on.
SoTA-Echoing
The current-practice implication is practical: exact claim use and direct-owner boundaries matter more than a large premise catalogue. The worked cases demonstrate when two, four, or zero compact claims are used.
Relations
- Defines: the twelve
A7CP-*constructive claim contents andClaimUsedAsReasoningBasisRelation@Context, whose direct result-specific edge states that dated reasoning work used one exact basis claim to form or revise one exact receiving result episteme. - Is consumed by: dated work applying
A.7.1orA.7.2, which cites exact compact claims and exposes relation occurrences only for load-bearing actual reliance. The A.7.1 and A.7.2 method epistemes may separately declare premises or branch conditions under their exact episteme/declaration owner; neither method description is made a participant ofClaimUsedAsReasoningBasisRelation@Context. - Coordinates with: current
A.7for its existing strict distinctions without broadening its EntityOfConcern, first move, Solution, or cases. - Preserves direct ownership in:
A.10andG.11for evidence/currentness,E.24/E.24.UKfor ontology admission, subject construction patterns for constructive settlement, andA.7.2for ontology source-use relations. - Does not define: a premise method, source authority, evidence relation, work plan, performer kind, common realism checklist, or universal foundation ontology.
A.7.CP:End
Universal Core Principle
Type: Kernel admission discipline pattern Status: Stable Normativity: Normative unless a section is explicitly informative
Use This When
Use this pattern when a candidate durable U-kind is proposed as a kernel-level universal primitive rather than as a local concept, C.3 U.Kind, direct subject-pattern value, Concept-Set row, slot, relation, record, publication form, or dependent durable value.
What goes wrong if missed. A local domain noun enters the kernel as if it were universal, or a genuinely universal primitive is rejected because its domain projections use different words.
What this buys. Kernel admission becomes a falsifiable cross-domain claim: the candidate must keep the same abstract contribution across diverse domain families while losses and local differences stay visible.
Typical moments:
- a candidate U-kind is proposed because several domains use similar words;
- a local subject value starts being treated as universal because it is useful in one field;
E.24.UKadmits a durable U-kind candidate, and the remaining question is whether it belongs in the universal core;- source or draft type wording claims kernel-level status and must be recovered into current U-kind governance.
Primary EntityOfConcern. The EntityOfConcern is the universal-core admission claim for one candidate U-kind.
First useful move. Apply E.24.UK first. If the candidate survives as a durable U-kind and claims kernel-level status, test whether it makes the same abstract contribution in at least three foundationally different domain families.
Not this pattern when.
- If the issue is C.3 typed claim quantification, use
C.3andC.3.1. - If the issue is whether the public
U.*spelling should survive at all, useE.24.UK. - If the candidate can be expressed by composition, dependent value, slot relation, or direct subject pattern, use
A.11and the direct pattern before A.8.
Problem Frame
FPF needs some universal primitives. It also needs to avoid turning a field's favorite vocabulary into the kernel. A word that works in software, finance, biology, or physics may still be local. A kernel-level U-kind must survive contact with different foundational domains without changing what kind of work it does in the model.
When source wording uses kind force for this admission question, recover it as kernel-level U-kind admission: E.24.UK decides durable U-kind admission basis, and A.8 tests universal-core claim force.
Problem
Without A.8:
- Parochial drift. A local domain concept enters the kernel and later cracks outside its home domain.
- Kernel bloat. Near-universal values accumulate because each domain asks for its own core noun.
- False universality. Search frequency, source prestige, or familiar spelling replaces cross-domain evidence.
- C.3 confusion. A context-local
U.Kindis mistaken for a universal FPF U-kind.
Forces
Solution
Use the three-domain falsification test only after E.24.UK has admitted the candidate as a durable U-kind candidate.
The candidate passes A.8 only when all four conditions hold:
- Distinct domain families. At least three projections come from foundationally different domain families.
- Same abstract contribution. Each projection shows the same kernel contribution, not merely a similar word.
- Non-trivial diversity. Each projection adds a non-trivial signal or bridge evidence not subsumed by the other two.
- Recorded losses. Differences, losses, and bridge risks are visible enough that readers can tell what is shared and what is local.
Use this compact record:
Three records are the minimum evidence. They are not an analogy. They are a falsification attempt: if one projection changes the candidate's abstract contribution, the candidate is not universal in the proposed form.
Archetypal Grounding - Diversity Evidence
For busy readers: one idea, three worlds. A candidate that cannot keep the same abstract contribution across three different domain families should stay local, dependent, or subject-pattern governed.
These rows are grounding examples, not automatic admissions. The projection record still needs an E.24.UK basis and must state losses and bridge risks.
When diversity evidence is load-bearing, record domain-family coverage, non-trivial difference, and bridge evidence. Quality-diversity telemetry such as Diversity_P or IlluminationSummary can support the projection record only through its governing C.17, C.19, or direct pattern; it is not a standalone gate.
Bias-Annotation
A.8 intentionally biases against kernel growth by name familiarity. This is useful because every admitted universal primitive raises the cost of FPF reasoning. The counter-bias is the three-domain falsification test: do not reject a candidate merely because domains spell it differently when the same abstract contribution is visible and losses are recorded.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
A passed A.8 test strengthens the case for kernel placement but does not bypass E.24.UK, A.11 parsimony, or direct pattern ownership. A failed test is still useful: it tells the project where to keep the candidate local, dependent, or subject-pattern governed. The cost is evidence work across at least three domain families.
Rationale
Universal core primitives are expensive because every downstream pattern can rely on them. A.8 therefore treats universality as a claim about repeated abstract contribution across different foundational domains, not as a claim about lexical frequency, popularity, or early convenience.
SoTA-Echoing
The pattern adapts three current practice lines. Ontology engineering distinguishes upper-level commitments from domain ontology terms; A.8 turns that distinction into a falsification test for FPF U-kinds. Cross-domain modeling practice uses multiple heterogeneous cases to test whether a construct travels; A.8 records those projections with losses rather than treating analogy as proof. Quality-diversity practice helps surface non-trivial diversity, but A.8 keeps telemetry as evidence for projection records, not as an admission gate.
Relations
- Builds on:
E.24.UK,A.11,C.3,C.3.1,F.8, andF.18. - Coordinates with: Concept-Set and bridge patterns when domain-family projections require cross-context naming or translation.
- Does not replace:
E.24.UKfor U-kind admission,A.11for parsimony, orC.3for typed claim quantification.
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-provenance 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-provenance 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.
Evidence-provenance entries with carrier identity and currentness fields
When an episteme composition, publication, compilation, dashboard, generated explanation, or assurance use substantively relies on a carrier-backed source episteme publication, evidence carrier, dashboard row, generated explanation, or assurance record, the evidence-provenance path SHALL keep an evidence-provenance entry with carrier identity fields and source-currentness relation fields: carrier ref, source U.Episteme ref or source U.EpistemePublication ref when a source publication carries the claim, evidence episteme ref or evidence record ref when the evidence is project-side, carrier kind, version or edition when relevant, date or relevance window, source-currentness relation or currentness window, 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-provenance 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 an evidence-provenance entry with carrier identity and source-currentness fields 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 evidence-provenance entries used for carrier identity or source-currentness.
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-provenance paths
Use this subsection when an authority-looking case is being used as evidence for a reliance claim. The A.10 evidence-provenance path is claim-bound: it evidences one named claim or effect for one named work occurrence or reliance use, not "authority" in general. This subsection does not change the A.10 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-provenance 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-provenance path is incomplete, A.10 reports evidence-provenance completeness 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.
Missing source-relation 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 relation, role-assignment source relation, status register entry, boundary claim relation, or source-currentness relation. The A.10 result should name the missing source relation or missing source-bearing record and blocked use rather than making the relying actor reconstruct a relation they cannot issue or verify.
Repeated missing-source-relation indicator. If the same visible carrier family repeatedly returns stale, contested, missing-source-relation, or no-currentness A.10 results, record a source-relation repair action: instrument the source relation, expose the carrier field that carries the source-bearing relation, expose decision-log refs, add currentness checks and status checks, preserve claim-bound source relations 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-provenance 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 relation 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-provenance 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 U.EpistemePublication refs, source relation refs, status, currentness, claim-bound source relations, credential view, model documentation, data documentation, or provenance and attestation label.
Contestability and redress relation: when an evidence-provenance path or source-currentness relation 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 assignment, status relation maintainer, freshness relation, revocation relation, privacy-minimized evidence ref, safe interim disposition, and review or redress relation. A disputed display remains contested until the source-order relation or currentness relation 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-provenance path and evidence-use classification that A.15, A.6, B.3, A.21 gate-decision source relations, A.20 constraint-validity source relations, A.2.9 speech-act source relations, A.2.8 commitment source relations, A.15.1 work-occurrence source relations, or another governingPatternRef or authoritySourceRef named by value may consume.
Local evidence-use classifier and RelianceDisposition for source-bearing carrier or display reliance
Use this subsection when a visible carrier, publication face, source U.EpistemePublication ref, source relation ref, or display is being treated as evidence for a claim, act, work occurrence, gate, release, review claim, assurance use, or problem-side P2W use. The first A.10 action 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 action: 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 carrier or display that merely appears source-bearing.
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-provenance 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 carrier or display looks official, quantitative, generated, credentialed, or safety-related.
Common wrong first classification: a visible carrier, source U.EpistemePublication ref, source relation ref, or display is approval, permission, safety, or readiness. First honest entry: recover the A.10 evidence-provenance 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 disposition 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-provenance path or governing source relation changes.
For A.10 use, RelianceDisposition is a local disposition over the evidence-provenance 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 relation, changed source U.EpistemePublication, changed evidence carrier, 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-provenance 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-provenance 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-provenance path micro-examples:
What changes in practice: an evidence-provenance 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
Bias-Annotation
A.10 corrects evidence-presentation bias: a visible carrier, dashboard tile, credential view, model card, generated explanation, provenance mark, or attestation can look like evidence, approval, permission, assurance, or work authority before the claim-bound evidence relation is actually present. The repair is not to collect more impressive paperwork. Recover the bounded evidence-provenance graph relation for the named claim or effect: carrier or source, evidence-producing or evidence-interpreting work occurrence, role assignment when current, method trace or work trace when relevant, time window, currentness relation, rival explanation, and bounded evidence use.
The second bias is graph-kind drift. A path in the evidence-provenance graph is a mathematical relation inside the evidence description; it is not a route of action, a part-whole edge, a method sequence, a gate passage, or a permission trail. When the current claim is about those neighboring relations, A.10 supplies evidence for them and returns authority to the governing pattern.
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.
Common Anti-Patterns and How to Avoid Them
- Carrier as truth. A cited document, dashboard cell, credential display, generated answer, or provenance label is treated as the claim being true without the evidence relation and currentness window.
- Evidence as permission. A strong evidence-provenance path is overread as authorization, gate passage, commitment, release, or performed work.
- Provenance as part-whole. Provenance edges are used to build holarchies, or part-whole edges are used as evidence.
- Method description as work trace. The method episteme says what would count as good work, but the actual work occurrence, carrier relation, or source relation is absent.
- Self-evidence. The target claim, its display, or its producing work is allowed to evidence itself without a separated evidence-producing or evidence-interpreting work occurrence and relying context.
- Full dossier by default. A source-finding or low-stakes reliance case is expanded into every possible evidence field instead of the minimum field set that decides the current bounded use.
Consequences
Rationale
Evidence use becomes reviewable only when the relied-on claim, evidence carrier, source U.EpistemePublication ref or source relation, evidence-producing or evidence-interpreting work, source-currentness relation, time window, rival explanation, and bounded relying context are separate. A.10 therefore makes the evidence relation available to assurance, gate, role, status, work, publication, causal-use, and source-use patterns without letting the evidence relation itself become approval, permission, work occurrence, or truth.
SoTA-Echoing
- 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 evidence-provenance entry with carrier identity and source-currentness fields 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 register entry as the authoritative record or relation 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 record or relation, not automatically the governing record or relation 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-register recoverability, and claim-bound attribution as evidence-provenance-path invariants, adapts credential practice, provenance practice, attestation practice, model documentation, data documentation, register-backed status display, and generated-explanation practice as FPF inputs for role-assignment or status-related source relations and carrier relations, 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 the 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 Structure and Relation Grounding where current dependency-structure 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-provenance 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 evidence-role or status-role source 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-provenance paths for the source relations or governing pattern refs consumed by those neighboring patterns; 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 an evidence-provenance entry with carrier identity and source-currentness fields;
- a release-context source register becomes a context-adapted evidence-provenance entry 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, theU.MethodDescriptionref or method-description source publication ref, 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 entry or context-adapted evidence-provenance 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-provenance 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-provenance 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
Type: Kernel parsimony and admission discipline pattern Status: Stable Normativity: Normative unless a section is explicitly informative
Use This When
Use this pattern when FPF work proposes a new U-kind, core relation, dependent durable value, or public structural name and the current question is whether existing ontology can express the claim without creating a new kind.
Typical moments:
- a new U-kind seems useful after
E.24.UK; - a proposed root kind may actually be a dependent value, slot, relation, record, publication form, lens, local frame, or C.3
U.Kind; - two candidates overlap strongly;
- a name is convenient but the ontology may already be expressible through existing patterns.
Primary EntityOfConcern. The EntityOfConcern is the parsimony claim for one candidate ontology addition.
First useful move. Recover the candidate with E.24.UK or the direct governing pattern, then ask what current FPF values, slots, relations, and patterns can already express.
What goes wrong if missed. FPF grows duplicate kinds for slot positions, local names, publication forms, mathematical lenses, and records. Later patterns then argue over words instead of recovering the EntityOfConcern, relation, slot, and admissible claim.
What this buys. A small ontology can still express rich project situations: the pattern either admits a new durable value with a boundary, or shows exactly which existing kind, slot, relation, record, publication form, lens, or direct pattern already carries the claim.
Not this pattern when. Not this pattern when the current question is only a local display name, publication title, naming taste, or ordinary glossary cleanup. Use the relevant Part F naming pattern unless the name is being asked to carry durable ontology.
Problem Frame
FPF needs enough primitives to be useful, but every new primitive creates learning cost, bridge cost, and future repair cost. Ontological parsimony is not anti-growth. It is the rule that FPF adds a new kind only when composition, reuse, dependent-value settlement, and direct governing patterns cannot express the action-facing claim without material loss.
When source or draft wording proposes a candidate durable value in U.* form, treat that as an admission claim. A.11 is therefore applied after E.24.UK recovers the governed object and before naming patterns choose a public label.
Problem
A useful project word, slot-position label, publication form, diagram element, mathematical lens, or repeated source term can start acting like a durable FPF kind before the governed object and direct governing pattern are recovered. The problem is to decide whether the candidate preserves an action-facing distinction that composition cannot carry, or whether it should remain a local name, slot value, relation, record, publication form, or lens-use claim.
Forces
Solution
Use four gates before admitting the new ontology addition:
Use this compact record:
Possible dispositions:
- retain as root U-kind;
- retain as dependent durable value under a root settlement;
- apply C.3 typed reasoning;
- express as slot, relation, record, publication form, lens, local frame, or direct governed value;
- keep as source wording or local name.
Archetypal Grounding - Maintenance
A retained addition also needs a reopen condition. Reopen or lower the admission when usage collapses, overlap with an existing value is discovered, composition becomes adequate, the boundary becomes fuzzy, or the name starts hiding a slot, relation, record, publication form, lens, or local frame. This is maintenance discipline, not a fixed calendar ritual.
Bias-Annotation
A.11 corrects kind-inflation bias. A useful word, field name, record label, or diagram element can start behaving like a universal kind because it appears often, feels important, or has prestige in a source tradition. The repair is ontological: recover the governed object and try expression through existing U-kinds, slots, relations, dependent values, records, publication forms, lenses, and direct governing patterns before admitting a new durable value.
It also corrects false-parsimony bias. A compact ontology is not achieved by refusing every new value. If composition hides a reviewable distinction or blocks an action-facing claim, parsimony admits the new value and states its boundary, overlap, and reopen condition.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
- Slot label becomes kind. A system in a role, transformer, source-maintenance, carrier, or boundary slot is renamed as if the slot label created a new universal kind.
- Publication form becomes ontology. A card, record, view, dashboard, figure, or report title is treated as the governed object instead of the episteme, relation, or carrier it publishes.
- Mathematical lens becomes object. A graph, tuple, algebra, metric, coordinate, or threshold is admitted as an ontology object without naming the EntityOfConcern and lens-use claim.
- Local project name becomes kernel vocabulary. A useful project label is promoted to durable FPF vocabulary before composition and direct-pattern expression are tried.
- Overlap is ignored. A candidate is admitted even though an existing pattern already carries the same claim with clearer boundaries.
- Parsimony as refusal. A new value is rejected because "fewer kinds is better" even though existing composition loses a distinction users need to claim, compare, repair, stop, or rely on.
Consequences
Rationale
Ontological parsimony preserves FPF's ability to handle many domains without turning every local distinction into a root object. The pattern follows the same discipline used by E.24.UK: recover the governed object first, then decide whether a new durable value is needed. Slots, relations, dependent values, records, publication forms, and mathematical lenses are expressive resources; they are not failures to mint a kind.
The practical criterion is not abstract minimalism. A candidate earns admission only when users gain a claim, comparison, repair, stop condition, reliance condition, or boundary they cannot recover by composition without material loss. That keeps parsimony tied to FPF's work-facing purpose rather than to a taste for small vocabularies.
SoTA-Echoing
Current ontology-engineering practice favors modularity, reuse, explicit competency questions, and controlled admission of new terms over unchecked class growth. A.11 adapts that practice to FPF: the admission question is not merely "can a class be defined?" but whether the candidate changes admissible claims, boundaries, or work-facing use inside the FPF pattern system.
Constructional-ontology and BORO-like source lines add a second discipline: identity, construction, dependency, and part-whole distinctions must be recovered before a convenient term becomes a kind. FPF keeps that source discipline without importing a classical top-level taxonomy as-is; U-kinds remain tied to accepted ontics, slot discipline, and action-facing pattern use.
Relations
- Builds on:
E.24.UK,A.8,C.3,F.8,F.18, and direct subject patterns. - Coordinates with:
E.24.CDfor candidate detection andE.24.PUBwhen a publication form or structural name created the admission claim. - Does not replace: universal-core testing in
A.8, typed claim quantification inC.3, or naming discipline in Part F.
A.11:End
Acting-Side Externalization and Reflexive Split
Type: Part A architectural ontology pattern Status: Stable Normativity: Normative unless a section is explicitly informative
Use This When
Use this pattern when a source says that something changes, repairs, configures, updates, verifies, teaches, controls, or improves itself, or when the acting side of a change is hidden behind a passive or self-action sentence.
Typical moments:
- "the robot calibrates itself";
- "the model updates itself";
- "the document refreshes its own cross-references";
- "the organization corrected itself";
- "the system verifies that its own change succeeded";
- "the lathe makes the workpiece, therefore the workpiece is part of the lathe during manufacturing".
First useful move. Separate the changed holon from the acting system or candidate acting system. Then use the direct owner for the current claim: A.3.4 for bounded transformation, A.15 and A.15.1 for method and work, A.2.1 and A.2.7 for role assignment and role relations, A.10 for evidence, and A.1, A.14, or C.13 for holon and part-whole claims.
What goes wrong if missed. A system becomes its own cause, a document acts, a controller and controlled part collapse into one object, evidence becomes self-certifying, and a system that changes another holon is mistaken for that holon's super-holon.
What this buys. Self-action wording becomes a reviewable relation among a changed holon, an acting system in role, method or work claims when current, boundary-crossing relation when current, and evidence when current.
Not this pattern when.
- If the current question is whether a bounded change occurred, use
A.3.4. - If the current question is whether work was performed or succeeded, use
A.15andA.15.1. - If the current question is the role assignment or role relation, use
A.2.1andA.2.7. - If the current question is evidence independence or source use, use
A.10and the evidence or source-use owners. - If the current question is part-whole admission, use
A.1,A.14, andC.13.
Problem Frame
A.12 keeps a causality-facing modeling discipline without creating a second transformation ontology.
The pattern does not say that every change is already established, that work succeeded, that the acting system is a special U.Transformer kind, or that boundary wording creates a durable boundary object. It says only this: when a claim depends on a change, the acting side and the changed holon must be recoverable as distinct slot fillers for that claim. When ordinary language says "self-", split the larger holon into acting and changed positions before using transformation, method, work, evidence, or part-whole patterns.
Problem
Without A.12:
- Self-action hides the acting side. "The system changed itself" does not say which system in role changed which holon under which conditions.
- Transformation and work collapse. A bounded transformation, a method, a work occurrence, and evidence of success are treated as the same claim.
- Epistemes become agents. A document, model, source record, report, or theory is said to update, decide, authorize, or verify itself.
- Reflexive systems become single blocks. A regulator and regulated part are hidden inside one block, so failure analysis and architecture work lose the internal relation that mattered.
- Transformation becomes containment. A system changing another holon is treated as that holon's containing whole.
- Evidence becomes self-certifying. The acting system's own output is treated as sufficient evidence for the success or safety of its work.
Forces
Solution
Use A.12 as a thin acting-side pattern.
Acting-Side Externalization
For a change-bearing claim, recover this relation frame before relying on self-action wording:
The acting system and the changed holon are distinct slot fillers for the current change-bearing claim. They may be parts of a larger holon, and they may be tightly coupled, but the acting position is not the changed position for that claim.
ActingSideExternalization@Context is a relation frame, not a U-kind, acting-system kind, record that acts, or evidence that change occurred. It names which direct owner governs each neighboring claim.
Use:
[A.3.4](/generated/patterns/A.3.4)whentransformationRefbecomes current;[A.15](/generated/patterns/A.15)and[A.15.1](/generated/patterns/A.15.1)when method, work plan, work occurrence, or work success becomes current;[A.2.1](/generated/patterns/A.2.1)and[A.2.7](/generated/patterns/A.2.7)when role assignment or role relation becomes current;[A.10](/generated/patterns/A.10)when evidence or source independence becomes current;[A.1](/generated/patterns/A.1),[A.14](/generated/patterns/A.14), and[C.13](/generated/patterns/C.13)when holon identity, part-whole, or constructive grounding becomes current.
Reflexive Split
For "self-" claims, do not accept the self-action wording directly. Recover a larger holon and at least two distinct positions inside it:
The split is a modeling move, not a claim that the two positions are always permanent physical modules. They can be stable subsystems, temporal phases, organizational assignments, software components, or another directly governed structure. If the split relies on parthood, use A.14 and C.13. If it relies on role assignment, use A.2.1 and A.2.7. If it relies on temporal phases, use the temporal owner.
The minimal rule is:
for the current change-bearing claim.
Episteme And Publication Cases
An episteme does not act by itself. If a source says "the document updates itself", recover the acting system in role and the object that changed:
- a publication file or representation changed;
- a source record changed;
- an episteme slot relation changed;
- a claim relation, reference relation, or publication-use relation changed.
Use C.2.1, E.17, E.17.2, source-use, publication-use, and evidence owners for the episteme or publication side. A.12 only prevents the sentence from assigning agency to the episteme.
No Super-Holon Inference
A system changing another holon does not become that holon's super-holon. Manufacturing, teaching, measurement, repair, control, telemetry, or source use can be boundary-crossing, transformation, work, evidence, or publication-use relations without being part-whole relations.
Use part-whole owners only when parthood is independently admitted.
No Self-Evidence Shortcut
A.12 separates the acting side; it does not make the acting side's own output sufficient evidence for success, safety, adequacy, or authorization.
When evidence matters, use A.10 or the direct evidence and assurance owner. The evidence relation may use an observer system, measurement setup, independent source, audit record, or accepted stronger relation. A.12 only blocks the overread that acting and evidence are the same by default.
Archetypal Grounding (Worked Cases)
Bias-Annotation
Document Cross-Reference Update
Source wording: "the document updates its cross-references."
Recovered A.12 use:
The document does not act. If the changed object is a publication form, use publication owners. If the changed object is a claim-bearing episteme relation, use episteme owners.
Lathe And Workpiece
Source wording: "the lathe makes the workpiece, so the workpiece belongs to the lathe during manufacturing."
Recovered A.12 use:
The lathe can transform the workpiece without being the workpiece's super-holon. Use part-whole owners only if the workpiece is independently admitted as part of a containing holon.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- Self-action claims become inspectable without denying real internal regulation.
- A.12 stays thin and does not duplicate transformation, method, work, role, evidence, or part-whole ontics.
- Epistemes and publications stop acting by wording.
- Internal control loops, build scripts, and automated changes become easier to audit.
- Manufacturing, teaching, measurement, repair, and control examples no longer imply holonic containment by default.
Costs:
- Compact "self-" sentences need unpacking before use.
- Some diagrams need one more internal distinction between acting and changed positions.
- Evidence cannot be accepted merely because the acting system produced a success message.
Rationale
Engineering and scientific models need a recoverable acting side for changes. Control, cybernetics, constructor-theory-style transformation talk, software automation, and assurance practice all penalize models where the same undivided object is cause, changed object, method, work occurrence, and evidence source.
FPF keeps that discipline without overbuilding A.12. The transformation ontic lives in A.3.4; method and work live in A.15 and A.15.1; role assignment lives in A.2.1 and A.2.7; evidence lives in A.10; part-whole admission lives in A.1, A.14, and C.13. A.12 only supplies the acting-side split needed before those owners can be used cleanly.
SoTA-Echoing
Relations
- Builds on:
A.1for holon and system admission,A.2.1for role assignment,A.2.7for role relation structure, andA.3.4for bounded transformation. - Coordinates with:
A.10for evidence,A.14andC.13for part-whole claims,A.15andA.15.1for method and work,C.2.1andE.17for episteme and publication cases, andB.2.5for supervisor-subholon feedback relation. - Does not own: transformation occurrence evidence, work success, evidence independence, part-whole admission, MHT declaration, or the architecture of the larger holon.
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@Context role value and the principle of acting-side externalization.
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 agency-characteristic profile, 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 root agent kind alongside
U.SystemandU.Epistemewould violate Ontological Parsimony (C-5) and create conflicts with the dynamic nature of roles. A system might act agentively in one context and as 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 agential participation 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: Agential participation as contextual role assignment
An ordinary-language "agent" in FPF is not a fundamental type. When the term is admitted, it is a convenience term (a Register 1 / Register 2 label) for a specific Contextual Role Assignment (U.RoleAssignment):
AgentialParticipation ≍ U.RoleAssignment(holderRef: U.System, roleRef: AgentialRole@Context, boundedContextRef: U.BoundedContext)
This means the acting holder is a U.System that currently bears AgentialRole@Context within a specific U.BoundedContext.
- No root Agent kind: To be clear, FPF does not add a base kind for "agent" beside
U.SystemandU.Episteme. This avoids type inflation and preserves the dynamic nature of roles. - Epistemes Cannot Hold Work-Facing Agential Roles: As the
holderRefmust name aU.System, this definition constitutionally forbidsU.Epistemes from being acting holders, preventing the "episteme-as-actor" category error. - Canonical Syntax: The technical notation is
System#AgentialRole:Context.
The AgentialRole and its Specializations
AgentialRole@Context: This is the abstract role value for goal-directed action within a context. It is not a separate root kind.- Specialized Roles: More specific behavioral role values like
TransformerRole@ContextandObserverRole@ContextspecializeAgentialRole@Context. They describe what kind of agential action is being performed at a given moment.- A system holding
TransformerRole@Contextis currently modifying another holon. - A system holding
ObserverRole@Contextis currently gathering information. This creates a clean role-value hierarchy: aTransformerRole@Contextassignment is agential, but an agential assignment is not always transformational; it could be observing, planning, or idle.
- A system holding
Measuring Agency: The Agency Characteristic Profile and the Spectrum
Agency is not a binary switch; it is a multi-dimensional spectrum of capabilities. FPF models this using C.9 Agency Characteristic Profile, a characterization pattern that attaches a set of measurable properties to a U.RoleAssignment.
The agency-characteristic profile is grounded in contemporary research (e.g., Active Inference, Basal Cognition) and includes the following key characteristics. Each is measured for a specific holder system 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 holder'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 holder 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 U-kind. 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-characteristic 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 profile into an intuitive autonomy grade.
Crucial Distinction: The agency-characteristic profile is the normative evidence. The Grade is a pedagogical shortcut. A holder cannot claim an Agency Grade without having a corresponding, auditable characteristic profile to back it up.
Archetypal Grounding
The universal pattern of agency, defined as a Contextual Role Assignment and measured by the agency-characteristic profile, 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 acting holder.
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 actions by a role-assignment holder such as the DevOps team, but it is never an acting holder 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-characteristic profile provides a direct, practical implementation of these ideas.
- Ontologically Sound: By defining agential participation 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 underlying agency-characteristic profile provides the detailed, auditable data needed for formal assurance and risk management. This duality satisfies both Didactic Primacy (P-2) and Pragmatic Utility (P-7).
In essence, this pattern does not invent a new theory of agency. It distills and operationalizes the emerging scientific consensus, packaging it into a rigorous, falsifiable, and practical tool for the FPF ecosystem.
Relations
- Builds on:
A.1 Holonic Foundation: Establishes that 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: Work by an acting holder is modeled using the external transformer principle.
- Coordinates with:
B.2 Meta-Holon Transition (MHT): A significant jump in the agency-characteristic profile of a collective can trigger an MHT.B.3 Trust & Assurance Calculus: The agency-characteristic profile provides crucial inputs for assessing the reliability and safety of an autonomous system.D.2 Multilevel Ethics For System-Holon Work: The Agency Grade is used to determine the moral-responsibility posture and accountability assigned to a system.
- Instantiates:
C.9 Agency Characteristic Profile, which provides the formal definitions for the characteristics (BMC, PH, etc.).
A.13:End
Advanced Mereology: Components, Portions, Aspects & Phases
Type: Kernel mereology and part-whole relation discipline pattern Status: Stable
At a glance. Use A.14 when a part-whole claim must distinguish component, member, portion, aspect, or phase before downstream architecture, work, assurance, or U-kind admission relies on that claim.
Use this when. Use this pattern when a text says that something is part of something else, a collection member, some amount of the same stuff, an aspect of one holon, or the same holon during a time interval, and a wrong relation kind would change identity, aggregation, responsibility, evidence, or structural grounding.
What goes wrong if missed. Teams count members as components, portions as components, aspects as separate wholes, or phases as separate objects; constructive traces and Working-Model relation claims then ground the wrong EntityOfConcern.
What this buys. One human-facing mereology catalogue that lets B.3.5 and C.13 ground structural claims without inventing a new public relation vocabulary.
Not this pattern when. Not this pattern when the current question is only a constructive trace (C.13), Working-Model assurance grounding (B.3.5), meta-holon transition (B.2), temporal dynamics without a phase-of claim, or a general U-kind admission question (E.24.UK).
Problem frame - why an advanced mereology?
FPF’s holonic modelling relies on part–whole relations to build structural and conceptual holarchies for admitted holons such as systems, epistemes, work occurrences, bounded contexts, disciplines, and methods. But U.Holon is not a synonym for every bounded object. U.Role is a governed root U-kind, not an admitted holon kind. U.Method is a non-agentive holon kind, but submethod assembly is owned by method-composition patterns, not by A.14 structural component mereology. Role relation structures, method relation structures, method descriptions, work plans, and work occurrences enter A.14 only through their direct governing patterns and admitted carriers. 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 role values outside holon mereology and keep method values outside A.14 structural component mereology, while allowing method holarchy through method owners such as A.3.1 and B.1.5. Describing epistemes such as U.MethodDescription and U.WorkPlan use ordinary episteme parthood and versioning like any other U.Episteme. It also clarifies how MemberOf fits: membership and collection-as-whole grounding start with A.14, C.13, and B.3.5 as appropriate; acting collective systems require U.System admission plus role, method, work, and evidence owners; whole reidentification uses B.2 only when existing-whole explanations fail.
Publication note (Working-Model first). Read A.14 together with E.14 Human-Centric Working-Model and B.3.5 CT2R-LOG: publish the direct relation claim in the Working-Model layer and, when assurance is sought for a structural claim, link that assertion downward to one current C.2.1 construction-trace episteme in the Compose-CAL Γ_m sum, set, or slice form. The trace reports exact participants, direct relation occurrences, the applicable construction rule, and identity or reidentification conditions. It creates none of them; order and time remain outside mereology.
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 role values in holon mereology; no method values in structural component mereology.
U.Roleis not an admitted holon kind.U.Methodis a method holon, but its submethod assembly is governed by method-composition owners, not by A.14ComponentOfor structuralpartOf. AU.MethodDescriptionis an Episteme and may be versioned or structured;U.Workoccurrences may have work-occurrence parts under A.15.1; neither case replaces method holarchy. - MemberOf stays, but collection identity and acting-collective claims use direct owners.
MemberOfremains available to state exact collection-membership occurrences. After the collection, its identity rule, and those memberships are independently grounded,Γ_m.setmay narrate their construction account and B.3.5 may link that account when publication assurance is current. Neither the gathering narrative nor its trace creates a membership. An acting collective system usesU.Systemadmission plus role, method, work, and evidence owners. Whole reidentification uses B.2 only when existing-whole explanations fail.
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)
- A structural relation claim published in the Working-Model layer SHALL, when assurance is required, link through
tv:groundedByto one current C.2.1 construction-trace episteme in theΓ_m.sum | Γ_m.set | Γ_m.sliceform (see B.3.5 and C.13). The direct relation pattern decides whether the occurrence obtains and how it is identified; the candidate's direct identity or reidentification rule decides continuity. The trace only reports that basis. - PhaseOf is temporal parthood; it SHALL NOT be grounded through
Γ_m. Its assurance follows identity-through-time criteria (CC-PHA-1..3) andΓ_timeordering (B.1.4). - MemberOf remains non-mereological (CC-MEM-2). A
settrace is truthful only after one exact collection, its identity rule, and the exact direct membership occurrences are grounded; no ComponentOf inference follows.
Two quick identity tests apply before relying on a trace. The same listed constituents can form a different whole when their direct assembly relations or rule differ. Conversely, a permitted constituent replacement can preserve the same whole. An equal input list, a repeated trace, or validationMode=axiomatic decides neither case.
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
Bias-Annotation
A.14 corrects parthood bias: ordinary words such as part, member, phase, aspect, section, version, module, function, role, and ingredient can all sound like "part of" while naming different relation kinds. The repair is not a larger part tree. Recover the EntityOfConcern and choose the relation kind: component, constituent, portion, phase, member, role assignment, method description, work occurrence, evidence relation, or transformation relation.
It also corrects representation bias. A BoM row, figure, graph edge, table row, document section, dashboard item, or architecture view may publish a part-whole claim, but the publication form is not the part-whole relation itself. The live A.14 claim is about the relation between holons, epistemes, carriers, portions, phases, or collection members, with mathematical or publication descriptions kept in their own slots.
Conformance Checklist - type guards
Global firewall and scope
PortionOf guards
PhaseOf guards
Grounding and validation (normative)
Note. Property names and trace semantics are defined in the CT2R‑LOG / Compose‑CAL.
MemberOf minimal semantics (non‑mereological)
CT2R‑LOG handshake (Working‑Model → Assurance)
Relation-use 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 A.14 merely because ordinary speech names a thing. Use the role, method, work, or evidence owner. If it is about the carrier episteme (pages/sections/versions of an SOP/algorithm/spec), or about a dated work occurrence with recovered work-part relation, A.14 may participate through that admitted carrier.
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) and B.3.5 when assurance grounding is current. If you need collective action, first admit an acting collective U.System, then use the role, method, work, and evidence owners.
Quick spot-tests.
Interplay with Γ‑flavours (how these relations behave under aggregation)
Common Anti-Patterns and How to Avoid Them
- Member as component. A person, team, document, or object belongs to a collection and is then counted as if it were structurally integrated into the whole.
- Role as part. A system plays a role, and the role label is placed inside a part tree.
- Method as part. A method value, recipe, or algorithm is treated as a component instead of using method, method-description, work, or transformation owners.
- Portion without measure. Some amount of fuel, data, time, or text is named as a portion without a measure kind, unit, and additivity condition.
- Phase as replacement. A version or time slice is treated as a new component when the carrier identity continues, or as the same phase when the identity criteria fail.
- Diagram or trace as relation. A visual breakdown, graph, table, construction trace, or
validationModeis used as proof that parthood obtains or that the whole has one fixed identity. Recover the direct relation occurrence and the candidate's identity or reidentification rule first; use the publication and trace only as inspectable accounts.
Pedagogy aids (non-normative)
Two‑minute checklist for practitioners
- Do I see "process", "procedure", "policy", or "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.
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.
Rationale
A.14 exists because part-whole words carry identity, aggregation, measure, time, and assurance commitments. The pattern keeps those commitments in the relation kind instead of letting everyday nouns, diagrams, or breakdown tables decide ontology. Component, constituent, portion, phase, and member claims can then support holon, episteme, architecture, and evidence work without smuggling role, method, work, or publication claims into mereology.
SoTA-Echoing
- 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 practice 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.
Relations
- Builds on:
A.1,A.7,B.1,B.2,C.13, andB.3.5for holon identity, strict distinction, gamma-flavour separation, meta-holon transition, constructive grounding, and Working-Model assurance. - Coordinates with:
A.15,A.15.1,A.3.1,A.3.2, andA.3.4when the source wording is about role assignment, method, work, or transformation rather than parthood. - Used by: architecture, description, evidence, and U-kind admission patterns when their structural claim depends on a clean parthood relation.
A.14:End
Role–Method–Work Alignment
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, holder U.Capability instance, any capability statement or currentness assessment relied on, capability-fit checks, and performed 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 performed work occurrence, and the team keeps arguing over encountered "process" wording without separating recipe, plan, capability, and executed work.
First output. One explicit separation of U.Role, U.Method, U.MethodDescription, U.WorkPlan, U.Work as the admitted kind, one dated Work occurrence admitted under that kind, and any separate assertion or description about it, plus the shortest traceable chain that already exists from U.RoleAssignment through the governing U.Method and its methodDescriptionRef or U.MethodDescription reference to the intended U.WorkPlan or actual Work occurrence, or an explicit source-relation gap that blocks admission of the claim.
Working enactment-alignment sequence. Role, method, plan, and work confusion -> separate the role, holder, role-taxonomy episteme, effective reference scheme, method description, intended U.WorkPlan, U.Work kind, actual dated Work occurrence, and any record about it -> 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 work-family use -> 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-relation chain begins to carry or justify a work claim or reliance claim.
Working alignment applications.
- Name the role, holder, exact role-taxonomy episteme, and effective reference scheme under repair.
- Name the method or method description that is meant to govern the work.
- Name the intended
U.WorkPlan, or identify the actual dated Work occurrence admitted underU.Workand keep any assertion or record about it separate. - Choose the next governed use: 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 a reliance appearance such as a display, credential view, copied approval, generated explanation, publication face, or cue is being used by appearance for a work claim or reliance claim before the governing pattern position is named, apply
A.15.4work-relevant appearance-based reliance repair to that claim; keepA.15only for the separation amongU.Role,U.Method,U.MethodDescription,U.WorkPlan,U.Workas the admitted kind, each actual Work individual admitted under it, and every separate episteme about such an occurrence.
Action-pattern protection. This pattern is not about classifying encountered publications, displays, or cues. It keeps role, method, plan, holder U.Capability instance, separately governed capability-support records and relations, capability-fit checks, and performed work distinct so the acting engineer-manager can choose the next admissible work-family or reliance use. Work-relevant appearance-based reliance repair is handled by the related A.15.4 cluster member.
Minimum sufficient governed use. Choose the minimum sufficient governed use, recover only the project-side FPF kind and reference named by value needed for that use, and do not raise the claim beyond that recovered relation, source, or admissible-use boundary.
Recovered governing-reference sufficiency 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-family claim under repair, proceed inside that recovered scope and window. If not, narrow scope, run a bounded reversible probe, find the missing source relation, or create only the smallest A.15.4 repair request, decision-request record, prospective work-plan entry, missing-source-relation note, or missing-source admission block needed for the next governed use.
Ordinary use. If the team only needs to separate role, method, plan, holder U.Capability instance, capability-fit checks, and performed work for orientation or planning, one separation sentence or small working card is enough.
Reliance-bearing use. Use the fuller alignment frame when a reliance appearance is about to guide planned work, performed work, role attribution, role-state attribution, release reliance, disputed responsibility, or use under another role taxonomy or reference scheme. Use A.15.4 when the issue under repair is whether that appearance exposes the project-side FPF kind and reference named by value required for that work claim or reliance claim.
Stop condition. Stop once the separation changes no next admissible work-family use or reliance use and blocks no concrete overclaim about role, role-state, method, plan, work, approval, evidence, or release.
Admissible-use examples.
Alignment frame in plain terms. One alignment frame that keeps U.Role, U.Method, U.MethodDescription, U.WorkPlan, U.Work as the admitted kind, one actual Work individual admitted under it, and any episteme about that occurrence distinct, while exact performedUnderAssignment and enactsMethod relations connect the occurrence to its U.RoleAssignment and U.Method; the admitted holder system is the actual performer under the assignment. This is not a single work occurrence, checklist, language-style repair pattern, or mere cue note.
First admissible work-family use in plain terms. Keep role value, holder assignment, semantic method, method-description reference, intended work plan, and dated performed work distinct while making the chain between them inspectable enough for enactment, audit, and source-relation recovery.
What goes wrong if missed. Teams collapse role, recipe, plan, capability, and performed work occurrence into one fuzzy "process" label from project material, then mistake documentation for execution, capability for evidence, schedule for occurrence, or a narrower briefing for the relation 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 work-entry readiness or full-kit preparation (A.15.5), 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 appearance-based reliance repair for a display, credential view, copied approval, generated explanation, publication face, or similar reliance appearance (A.15.4).
Related project records and governing patterns. A.15.1 governs dated Work occurrences admitted under U.Work and the boundary to separate assertions or records about them; A.15.2 governs schedule or baseline planning records, A.15.3 slot-filling plan items, A.15.4 work-relevant appearance-based reliance repair, A.15.5 work-entry readiness and full-kit preparation, 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 separately represented here as U.MethodDescription epistemes, U.WorkPlan epistemes, and world-side Work individuals admitted under U.Work together with their exact role and method relations. 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 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 need one executed occurrence rather than the alignment frame, recover the dated Work occurrence under A.15.1 and create or cite a separate assertion or record only when that episteme is also needed; if a reliance appearance 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, A.15.4 repair note, wording repair, assurance claim, or encountered "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), which role a holder is assigned under an exact role-taxonomy episteme and effective reference scheme (U.Role and U.RoleAssignment), how work is done (U.Method and U.MethodDescription), which holder U.Capability instance is relied on (A.2.2), which statement, evidence relation, or currentness assessment supports that reliance, which separate capability-fit, threshold, gate, or admission check is applied when fit is current, what work is intended (U.WorkPlan), which world-side dated Work occurrence happened (an individual admitted under U.Work), and which separate assertion or record describes it. Confusing these distinctions is a primary source of design flaws, budget overruns, and failed projects. Teams argue over encountered "process" wording without clarifying whether the FPF object under repair is a U.Method, a U.MethodDescription, a holder U.Capability instance, a statement about that instance, a separate capability-fit condition, a U.WorkPlan, an actual Work occurrence, or an episteme about that occurrence.
This pattern provides the canonical role-method-work enactment alignment in FPF. It applies the Strict Distinction Principle (A.7) to the passage from holder-in-role assignment and selected method to intended U.WorkPlan, an actual Work occurrence admitted under U.Work, and any separate episteme about it, 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 enactment-facing
U.Rolevalues andU.RoleAssignmentas the typed assignment relation with exactly four generic participants: holderU.System,U.Role, exact role-taxonomy episteme, and effectiveU.ReferenceScheme. The actual assignment extent is the maximal continuous interval over which that relation obtains; declared windows and justification or source claims remain assertion or description content. - A.15.2 and A.15.1: Separate
U.WorkPlanintent from actual dated Work occurrences admitted underU.Work, and separate both from assertions or records that designate them. - A.3.1 and A.3.2: Separate
U.MethodfromU.MethodDescription, so recipes, algorithms, procedures, and encountered "process" wording 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 relations, source relations, publication relations, 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 connecting holder-in-role assignment, recovered method, method-description reference, holder U.Capability instances when relied on, separate capability statements or currentness assessments when those are used, separate capability-fit conditions when current, intended work plan, actual dated resource-consuming Work occurrences admitted under U.Work, and separate epistemes about them.
To keep plan-occurrence separation explicit, this pattern references A.15.2 U.WorkPlan for schedules and calendars and A.15.1 for admission under U.Work and identification of dated Work individuals. Ambiguous terms in project material, such as "process", "workflow", "activity", and "schedule", are handled by E.10 and E.10.ARCH: recover the object under wording repair first, then assign the wording to U.Method, U.MethodDescription, U.WorkPlan, the U.Work kind or one Work individual admitted under it, 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 object or kind being claimed: U.Method, U.MethodDescription, U.WorkPlan, one Work individual admitted under U.Work or the kind itself when kind-level classification is current, or a neighboring governed value such as U.Transformation, U.Dynamics, evidence relation, gate relation, source relation, 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-Alignment: An instance of work is logged without a clear link back to the exact role assignment, recovered method, method-description reference, and capability-fit or admission condition that made it admissible, making the work unauditable and its results impossible to reproduce.
- Ambiguous "process" or "activity" wording: 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), one Work individual admitted underU.Work(performed occurrence), or another direct governing pattern.
Forces
Solution
Method and work governing-pattern cue.
When encountered "process", "algorithm", "solver", "workflow", "procedure", or similar wording points to changing, producing, selecting, deriving, controlling, or maintaining an EntityOfConcern, use E.10.ARCH:3.1 to recover the object under wording repair 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 relation, gate relation, source relation, 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 the exact governed method relation structure 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 semantic method, method-description reference, holder-in-role assignment, holder U.Capability instances when relied on, separate capability statements or currentness assessments when those are used, separate capability-fit conditions when current, intended work plan, and dated performed work. The work-facing assignment relation is 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) Role, Method, Description, Capability, And Plan Values:
U.Role: A work-facing role value interpreted through one exact role-taxonomy episteme and effectiveU.ReferenceScheme. Expected contribution, responsibility, permission, commitment, obligation, capability-fit, and admission conditions are neighboring relations governed by their direct patterns; the role value is not the holder, assignment occurrence, method, capability, work plan, or work occurrence.U.Method: The run-independent semantic way of doing a kind of transformation or enactment. It is not a dated performance or its description.U.MethodDescription: AU.Epistemedescribing aU.Method; it may be expressed in an SOP, algorithm, proof, recipe, or other method-description publication.U.Capability: TheA.2.2admitted dependent durable U-kind for holder-dependent capability instances. A concrete instance is aU.Systemholder's ability to perform a work family or produce a result class within a declared envelope, measure set, qualification window, and currentness condition. ACapabilityStatement, evidence relation, source-use relation, or currentness assessment may support relying on that instance; a capability-fit condition may test it. The capability instance is not the method, method description, support record, fit predicate, work plan, or work occurrence.U.WorkPlan: AU.Epistemedeclaring designators and constraints for possible future Work occurrences, including windows, dependencies, intended performers by role, and budgets. A future Work occurrence does not yet exist merely because a plan refers to it - see A.15.2.
B) The Assignment Relation:
U.RoleAssignment: The typed assignment relation for enactment-facing roles. Its generic signature has exactly four participant slots: holderU.System, assignedU.Role, exact role-taxonomy episteme, and effectiveU.ReferenceScheme. Its actual occurrence extent is derived as the maximal continuous interval over which those participants stand in the assignment relation. A declared assignment window, rationale, source, or selectedBoundedModelUseStructurebelongs to the receiving assertion, description, or use; none is an optional generic participant.
C) Performed Occurrence:
U.Work: The admitted kind for concrete dated work-occurrence holons. One Work individual is a world-side, resource-consuming enactment of aU.Methodby a holder under aU.RoleAssignment; it has its own temporal extent and stands in actual performer, method, containing-system, affected-referent, binding, and resource-use relations when they obtain. Capability-fit checks are evaluated against the holder for that occurrence. AnymethodDescriptionRef, log, ticket, assertion, description, or performed-work record is a separateU.Epistemethat may designate the occurrence and state those relations; it is not the occurrence. The assignment occurrence has its own actual extent, derived separately from uninterrupted obtaining.
Work individual and description boundary
U.Work is the admitted kind for dated work-occurrence holons. One Work individual is a world-side occurrence that stands in actual performedUnderAssignment, enactsMethod, temporal, executedWithin, affected-referent, binding, and resource-use relations when those relations obtain. The actual performer is the admitted U.System that fills the covering assignment's HolderSystemSlot; the assignment is the ground under which that system performed the Work. An assertion, description, log, ticket, or other record about that occurrence is a separate U.Episteme: it may designate the Work individual and state those relations, but it is neither the occurrence nor a Work individual.
Do not add a universal primaryTarget field, a local kind field, or an Operational/Communicative/Epistemic enumeration to the occurrence. Recover the exact affected-referent, transformation, speech-act or commitment effect, episteme-handling, production, delivery, acceptance, or other relation through its direct governing pattern. The words operational, communicative, and epistemic may remain use cues; they do not define local Work subkinds by enumeration.
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.Capabilityinstance. They have this skill even when they are not cooking, while a certificate or review about the skill is a separate support record. RestaurantRoles-2026supplies the vocabulary forChefRole, andRestaurant-A-Role-Schemeis the effective reference scheme. The restaurant rulebook is a separate episteme that may declare capability or work-admission conditions before cooking work is admitted; it is not a participant of the generic role assignment.- The actual act of making a souffle on Tuesday evening is one Work occurrence admitted under
U.Work. Its exact temporal relation and separately obtaining resource-use relations connect that occurrence to the 25-minute extent, eggs, butter, and consumed gas when those facts obtain. A kitchen log that states them is a separate episteme.
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 alignment uses precise relations only where they obtain. The diagram keeps the four generic U.RoleAssignment participants visible, keeps method description, capability fit, and work occurrence outside that assignment signature, and shows the derived actual-performer cue from F.6 on the single performed-work attribution edge rather than as a second relation. It presents method-description status as A.3.2 membership of the episteme, not as another edge.
- Capability-fit condition: A method description, work plan, or separately governed work-admission assertion may state that the holder under a
U.RoleAssignmentmust satisfy a capability threshold or envelope for a method or work claim. The fit condition tests the holder'sU.Capabilityinstance and may cite declared capability measures,U.Characteristicvalues, Q-Bundle slots, or architecture-characteristic criteria rows. The role value does not own the capability, the support record does not become the capability, and the fit condition is not a second capability kind. - A.3.2 membership for a method-description episteme: One already identified
U.Episteme Dis aU.MethodDescriptionwhen its exactEntityOfConcernresolves toM : U.Methodand at least one substantive claim says howMis done. Saying thatDdescribesMis shorthand for that constitution-and-membership result, not another binary description relation. This keeps the run-independent way of doing distinct from the description and any publication that exposes it. enactsMethod(W : U.Work, M : U.Method): One exact Work occurrenceWadmitted underU.Workstands inenactsMethodto methodMadmitted underU.Method. A separateperformedUnderAssignmentrelation connectsWto its role-assignment occurrence when that attribution obtains; the admitted system in the assignment'sHolderSystemSlotis the actual performer. Capability-fit checks are evaluated against that holder for the occurrence; theU.MethodDescriptionremains a separate episteme, and any admitted source remains under its separate source-use relation.performedUnderAssignment(W : U.Work, RA : U.RoleAssignment):[F.6](/generated/patterns/F.6)owns this direct attribution relation, its obtaining and occurrence-identity rule, the derived actual-performer projection, and the deprecated-alias boundary; A.15 consumes that owner here. For one exact Work occurrenceWand covering assignment occurrenceRA, read the actual performer as admitted systemH = actualPerformerSystem(W, RA) = RA.HolderSystemSlot, and use the relation only whenHperformedWunderRA. The assignment is the ground, not the actor; its four fixed participants keep the holder system, role value, role-taxonomy episteme, and effective reference scheme recoverable. A performed-work record may state this attribution but constitutes neither occurrence nor the relation. ExistingperformedBy(W, RA)claims may be read only through the F.6 compatibility boundary after resolvingH; do not author new claims with that spelling.
The assignment occurrence has the maximal continuous extent over which its four-participant relation obtains. A planned or asserted interval does not create that actual extent. A selected BoundedModelUseStructure, when it changes interpretation, is named in the receiving assertion or use. Only a genuinely structure-dependent relation species may require that structure as an identity-bearing participant, under its own direct pattern and stronger obtaining and identity law.
For a performed occurrence, this alignment lets the reader trace one Work individual admitted under U.Work through exact enactsMethod and performedUnderAssignment relations to the U.Method it enacts and the exact U.RoleAssignment under which its admitted holder system performed it; a separate assertion may cite the U.MethodDescription used to identify or constrain that method. It does not turn the assignment, role taxonomy, reference scheme, method description, capability fit, plan, or evidence into the performer or the work itself.
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 work-family use, 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 alignment use 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-family use or reliance use: 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, an actual Work occurrence admitted under U.Work, an execution-evidence relation, an evidence-provenance relation, or a 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 relation or evidence-provenance relation by value.
Boundary to A.15.4 Work-Relevant Appearance-Based Reliance Repair
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-relation chain is being used by appearance for a work claim, reliance claim, role-assignment currentness claim, role-state currentness claim, source-currentness claim, approval, authorization, gate passage, evidence, engineering justification, release reliance, or a claim about an actual Work occurrence.
A.15 itself keeps the kernel separation: U.Role, holder, role-taxonomy episteme, effective reference scheme, U.Method, U.MethodDescription, U.WorkPlan, U.Work as the admitted kind, one actual dated Work occurrence, any separate episteme about it, and the U.RoleAssignment chain between them. The appearance-based reliance repair recovers the project-side FPF kind and reference named by value before the reliance appearance can carry the work claim, reliance claim, or effect claim being made; that repair belongs to A.15.4 unless a direct governing pattern is already recoverable.
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.
Method-Work Unfolding Linkage
Use MethodWorkUnfoldingLinkage@Context only when a constraint-governed unfolding structure depends on a method and work relation that must stay inspectable across A.3 and A.15-family records. The linkage is a dependent relation record owned by this role-method-work alignment family; it is not a root U-kind, not a method, not work, not work authorization, and not evidence or gate passage.
capabilityFitConditionRefs[] points to A.2.2 capability-fit conditions for the method or work use. It is not a vague ability bucket, not a q-bundle by name, and not a measured characteristic unless [C.25](/generated/patterns/C.25), [C.16](/generated/patterns/C.16), or a characteristic or evaluation pattern is current.
When a CGUS, P2W, P2S, improvement-loop, or transformation-flow slice cites methodWorkLinkageRef?, the ref means only that this method and work relation needs to remain visible while the direct claims still keep their own authority. If a single direct claim is current, use its direct owner instead: U.Method or U.MethodDescription under A.3, work planning under [A.15.2](/generated/patterns/A.15.2), work-entry readiness under [A.15.5](/generated/patterns/A.15.5), an actual dated Work occurrence under [A.15.1](/generated/patterns/A.15.1), evidence under [A.10](/generated/patterns/A.10), assurance under [B.3](/generated/patterns/B.3), and gate under [A.20](/generated/patterns/A.20) or [A.21](/generated/patterns/A.21).
Boundary to A.15.5 Work-Entry Readiness
Use A.15.5 when the current question is whether intended work is ready enough to enter a work boundary. A.15 keeps the role-method-work separation; A.15.5 carries WorkEntryReadiness@Context, FullKitCondition, commitment disposition, resource-readiness refs, WIP or flow-policy refs, planned-baseline refs, and launch-gate refs when they are current.
Readiness is not performed work, not evidence sufficiency, and not gate passage by itself. A readiness-looking briefing, dashboard, source bundle, or P2W record may cue A.15.5, but the readiness relation is admitted only when the target work plan or plan item, missing inputs, preparation work if performed, planned baseline, and stop or degraded-use condition can be named.
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:
The welding and peer-review cases share one enactment alignment without sharing a domain ontology. Each has a holder U.System, a role interpreted by an exact role-taxonomy episteme and effective reference scheme, a four-participant U.RoleAssignment, a run-independent U.Method, a separate U.MethodDescription, a holder capability when reliance on it is current, and a dated Work occurrence admitted under U.Work. A selected model-use structure appears only in the receiving interpretation use that needs it. This is enough to compare the alignment while preserving different local structures; any classification beyond U.Work remains with its direct owner.
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 relations 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 relation.
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, an actual Work occurrence admitted under U.Work, a separate 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 actual Work occurrence exists.
This publication may guide method inspection and work-planning preparation under A.15. A conforming use keeps selected method, U.WorkPlan, actual dated Work occurrence, separate assertion or record about it, work-result record, and result measurement distinct. If the publication is used for evidence, provenance, engineering justification, gate or constraint decision, physical medium, 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 an A.15.4 repair request, decision-request record for the next decision, prospective work-plan entry, or explicit missing-source-relation 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 admitted source material, or an episteme publication exposing that source material, 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, state that project choice or plan through its governed episteme. If an actual Work occurrence is later claimed, ground that world-side individual independently under A.15.1; a separately governed assertion or performed-work record may designate it but does not become the occurrence. If the scenario is used for evidence, gate, or engineering-justification reliance, first recover the project evidence relation, gate or constraint decision, or engineering-justification record named by value under A.10, A.20, A.21, or B.3; otherwise record only an A.15.4 repair request, decision-request record, prospective work-plan entry, or missing-source-relation note.
Bias-Annotation
Lenses tested: Gov, Arch, Onto and Epist, Prag, Did. Scope: Universal for role-method-work enactment alignment 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,U.Workas the admitted kind, actual Work occurrences, and epistemes about them distinct; state performed values and resource use only through obtaining relations involving the Work occurrence. - Architectural bias (Arch): modelers may pull roles, capability instances, fit predicates, or capability support records into structural part hierarchies because those diagrams are already present.
Mitigation: preserve the role as a value interpreted through an exact role taxonomy and effective scheme,
U.Capabilityas theA.2.2admitted capability instance, capability statements and currentness assessments as separately governed support relations, capability-fit as a separate checking or admission condition over that instance, and all of them outside structural part decomposition. - Epistemic bias (Onto and Epist): a documented recipe or schedule can be mistaken for proof of execution.
Mitigation: require the traceability chain from the actual Work occurrence through
U.RoleAssignmentandU.Method, and keep theU.MethodDescriptionand performed-work record as separate epistemes. - Pragmatic bias (Prag): teams may keep using one overloaded "process" word because it feels faster.
Mitigation: resolve "workflow", "schedule", and "what happened" wording through
U.Method,U.MethodDescription,U.WorkPlan, theU.Workkind when kind-level classification is current, or one exact Work individual admitted under it. - 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.Role,U.Capability, capability-support records or relations, or capability-fit predicates inside structuralpartOfdecomposition; keep role interpretation under its role taxonomy and effective scheme, capability as theA.2.2admitted capability instance, support records or relations under their own governing patterns, and fit predicates as admission checks. - Recipe-as-evidence. A
U.MethodDescriptionor SOP may identify or constrain a method; a separate assertion or performed-work record may designate a dated Work occurrence, but the record is not the occurrence and cannot substitute for its world-side basis. - Plan-as-performed-work. Do not let schedules, calendars, or intended assignments stand in for performed execution; use
U.WorkPlanfor intent, identify the actual Work occurrence independently underU.Work, and state its performed values through obtaining relations. - Capability-as-work. Do not treat possession of a capability instance, a statement about it, or a passing fit predicate 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 steps they permit. When an approval is itself performed work, identify one separate Work individual admitted under
U.Workand recover the exact speech-act or instituted-effect relation independently; the approval occurrence is not the later operational occurrence. - Process soup. Do not leave "process", "workflow", or "activity" uninterpreted in FPF-governed passages; resolve the wording cue to
U.Method,U.MethodDescription,U.WorkPlan, theU.Workkind, or one Work individual admitted under it. - Briefing-as-execution-cue. A lighter review note, rollout summary, or redacted operations note may orient work; use
A.15.4appearance-based reliance repair or the direct governing pattern for 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 uses 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. - Reliance appearance as work-relevance cue. A dashboard tile, credential display, copied approval, generated explanation, provenance label, command-like cue, or composed source-relation chain is only a reliance appearance until
A.15.4recovers the project-side kind and reference named by value required 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 Work individuals admitted underU.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,U.Workas the admitted kind, one actual dated Work occurrence, or a separate episteme about it. FPF adds the exact holder and four-participant role assignment, holderU.Capabilityinstance when capability reliance is current, any separate capability statement or currentness assessment used for that reliance, any separate capability-fit condition over that capability instance when work admission is current, enactedU.Method, and separateU.MethodDescriptionthat make the occurrence inspectable. - Pragmatism and Practice: The framework is deeply pragmatic. The distinctions it makes between a
MethodDescription, a capability instance, and a Work individual admitted underU.Workare precisely the ones that matter in project management, compliance, and debugging. When a failure occurs, a manager needs to know whether the recipe was wrong, the holder lacked the required capability, or this particular Work occurrence departed from the method. 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-Echoing: 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, U.Work as the admitted kind, actual Work individuals admitted under it, and separate epistemes about them, and rejects the shortcut where one undifferentiated "process" label carries all meanings.
Claim 2. Best-known current accountability practice keeps the exact holder and assignment 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 performed-work 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 holder attribution through U.RoleAssignment, adapts it to exact role-taxonomy and reference-scheme semantics, and rejects anonymous work logs and role-as-part modeling.
Claim 3. Best-known current approval and execution practice treats a communicative gate act and the operational act it permits as distinct Work occurrences with distinct obtaining effect relations, not as two label-defined U.Work subkinds.
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, an approval Work occurrence and a deployment or welding Work occurrence are distinct individuals admitted under the same U.Work kind and connected to different exact effect relations. This pattern adopts that split, adapts it through separately grounded Work individuals and their direct relations, and rejects both the collapse of approval into the permitted operation and the invention of communicative versus operational Work subkinds by label.
Local claim. The FPF-governed SoTA claim for this pattern is practical and narrow: role-method-work 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 performed occurrence 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
-
Architecture method/work boundary:
C.32.P2SandC.32.PADmay cite method descriptions, pattern-use refs, responsibility-bearing role assignments, readiness exits, and expected structure effects as architecturing or decision-output duties.C.32.ADRmay publish those refs. A.15 still governs method, method description, work plan, work-entry readiness, performed work, and performed-work attribution claims. -
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,A.15.3for slot-filling plan items,A.15.5for work-entry readiness, andF.6as the direct owner ofperformedUnderAssignmentand the derivedactualPerformerSystem(W, RA)cue. -
Coordinates with:
A.15.4for work-relevant appearance-based reliance repair;A.15.5for full-kit preparation and work-entry readiness;E.10andE.10.ARCHfor wording 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;C.32.P2Sfor architecturing flow refs to method, work plan, readiness, and performed work; 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 appearance-based reliance repairs 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 choices:
- Name the role, method, and work result before naming any distributed state.
- State which exact Work occurrences admitted under
U.Workand which separateC.2.1assertions about that work, work traces, work-event records, observations, reports, or metrics 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 relation orB.3assurance claim relation 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, an actual Work occurrence admitted underU.Workfor execution, a separate work-result record for a result claim, and anA.15.4appearance-based reliance repair reference when a reliance appearance is being used as reason for work or reliance before the governing pattern slot or relation is named. 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 or work-entry readiness relation, this family carries the split among selected method, U.WorkPlan, SlotFillingsPlanItem, WorkEntryReadiness@Context, an actual Work occurrence admitted under U.Work, and separate 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. A.15.5 may cite WorkPlan and SlotFillingsPlanItem baselines when readiness is the current relation. 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 or readiness record.
P2W Performed-Work Relation
When E.18.1 reaches performed work, this family keeps U.Work as the admitted kind and identifies one exact dated Work occurrence under it. WorkEnactment is not a second kind and should not be used as a pseudo-object between a plan and the occurrence.
A performed-work record is a separate U.Episteme that may cite a U.WorkPlan, planned baseline, and the exact Work occurrence. It may state actual launch bindings, performed values, substitutions, variance, telemetry, outputs, outcome claims, and result-record references only by citing their independently obtaining relations; none is stored in or constituted by the Work occurrence. Comparator, transport, PrincipleFrame, U.Signature(profile=FormalSubstrate), evidence, assurance, and gate relations remain separately governed.
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 actual Work occurrence admitted under 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, role-taxonomy episteme, effective reference scheme, method, method description, work plan, work-entry readiness relation, performed work occurrence, or capability check cannot be named at the granularity required by the next work-family use. A weaker but admissible result is a separation note, missing-source-relation note, A.15.4 repair request, decision-request record for the next decision, prospective work-plan entry, or A.15.5 readiness-gap note.
Repair the local alignment frame when a subsequent source shows that the role assignment, method description, work-plan baseline, performed-work occurrence, capability threshold, role-state currentness record, or source-currentness window was wrong for the claimed use. 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 relation changed, and do not treat an A.15.4 repair request as carrying a non-A.15 claim.
Refresh the A.15 use before relying on it under a new role taxonomy, effective reference scheme, selected model-use structure, role assignment, method family, work plan, execution window, result measurement, or evidence, assurance, gate, appearance-based reliance repair, 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 as the admitted kind when the current claim concerns one performed Work individual: a world-side dated occurrence performed by one or more admitted holder U.Systems under exact obtaining U.RoleAssignments. The systems perform the work; the assignments are the separately obtaining role-holding relations under which the attribution is valid. The occurrence has an actual temporal extent, enacts an exact method, and is executed within an exact containing system. State a binding, resource-use fact, or direct work-to-referent relation only when it actually obtains and the receiving use needs it; an assertion, description, log, or record about the occurrence is a separate U.Episteme and does not store fields in the occurrence. When the reader asks what the work returned, changed, produced, transferred, or caused someone to accept, use the concrete three-question route in §4.6 instead of adding an output or outcome field to Work.
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 admitted kind; one Work individual is the world-side occurrence. A separate assertion or description episteme may designate that occurrence and its obtaining relations, while surrounding records may constrain, evidence, schedule, publish, or judge it; none becomes the occurrence by being published.
First useful object. One independently identified world-side dated Work occurrence admitted under U.Work. When the receiving use needs an assertion or description, keep that object as a separate U.Episteme: let it designate the occurrence and state the admitted holder U.System that actually performed it, the exact obtaining U.RoleAssignment under which that system performed it, and, when explicit attribution identity is consumed, the F.6 attribution relation linking the Work occurrence to that assignment. State actual enactsMethod -> U.Method, temporal extent, and executedWithin -> U.System. Add a direct work-to-referent relation, binding, or resource-use relation only when it actually obtains and the receiving claim uses it. If the next sentence reports a result, change, production, delivery, or judgment, use the matching §4.6 row; do not make it a Work field.
First-use checks.
- Name the candidate occurrence and the work-facing claim that depends on it.
- Recover every admitted
U.Systemthat actually performed the occurrence and the exact obtainingU.RoleAssignmentunder which each system performed it; then recover the enactedU.Method, temporal extent, and accountable or containingU.System. Add only the concrete bindings, performed resource-use facts, and direct work-to-referent relations that actually obtain and matter to the receiving use. Route any claimed result, change, production, delivery, evidence use, or judgment through the one matching §4.6 row. - Decide whether the encountered record, trace, item, or display designates a Work individual admitted under
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 anA.15.4appearance-based reliance repair case. - For composite, repeated, interrupted, or overlapping occurrences, declare each work-part relation and the naming threshold. Before using totals, recover the exact
B.1.4temporal aggregation orB.1.6work-resource aggregation and its policy. Do not name a work part when a temporal relation, evidence slice, telemetry segment, or missing-source-relation note is the actual object needed. - If the required occurrence references cannot be recovered, lower the claim to a missing-source-relation note, work-evidence note, plan note, publication-use note, declarative-representation note, or
A.15.4repair request; do not backdate work.
Ordinary use. For a simple occurrence, one readable assertion naming the actual performer system, the covering assignment under which it performed, enacted method, temporal extent, and containing system is enough. Add a binding, used resource, or work-to-referent fact only when the assertion relies on that obtaining relation.
Work-versus-transformation probe. Use the coarsest branch that the current facts support.
- Change without Work:
LunarTideRise-2026-07-27may be identified under A.3.4 as a transformation of the exact water body over the stated interval. Without an independently admitted performerU.System, its coveringU.RoleAssignment, an enactedU.Method, and F.6 work attribution, it is not a Work occurrence. A causal explanation of the tide supplies none of those agency facts. - Self-directed Work: in the rehabilitation case, the current model admits
MotorControlRightArmSystem-7 : U.SystemandPerson-7 : U.System; A.14ComponentOf(MotorControlRightArmSystem-7, Person-7)andComponentOf(LeftArm-7, Person-7)obtain, so the mover and the affected limb are distinct parts of one person.MotorControlRightArmSystem-7performsLeftArmStretchWork-7from2026-07-27T07:30:00+03:00to2026-07-27T07:35:00+03:00underSelfCarePerformerAssignment-7; F.6performedUnderAssignmentobtains, the Work enactsAssistedLeftArmStretchMethod-E1, andexecutedWithin -> Person-7obtains. Clinic relation specificationClinicRehabRelations@Clinic-E1declaresRehabWorkStretchesLimb@Clinic-E1(work, limb, interval), and the case facts make it obtain for that Work,LeftArm-7, and the five-minute interval. Separately, A.6.1 applicationAssistedStretchApplication-7binds its declaredAffectedLimbArgumenttoLeftArm-7. The first fact relates the Work to the limb; the second fills an operation argument. Neither is a primitive self-relation, and this case-specific decomposition is not a required anatomy for every self-directed action.
These branches test admitted facts, not human resemblance. A non-human or molecular-scale system can perform Work when its own system admission, covering assignment, enacted method, extent, containing system, and attribution obtain; unfamiliar agency is not a reason to reject it.
Reliance-bearing use. Add only the exact neighboring claims on which cost, quality, audit, evidence, conformance, gate, release, measurement, model use, or aggregation currently depends; do not turn them into fields of the work occurrence.
Stop condition. Stop once the occurrence is either recoverable as one Work individual admitted under 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 identity whose actual performer systems, covering assignments, enacted method, temporal extent, and containing system remain inspectable, together with any actually obtaining work-to-referent, binding, and resource-use relations used by the claim. A practitioner can then report a result or consequence through the concrete §4.6 branch without turning it into Work identity.
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 declaration-local SlotFillingsPlanItem content inside an A.15.3-governed WorkPlan, only work-entry readiness or full-kit preparation before work entry (A.15.5), only a visible cue that needs A.15.4 appearance-based reliance repair before reliance, 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), how in principle the work is done (the exact U.Method), and which claim-bearing episteme, if one is selected, describes that method (U.MethodDescription), we still need a precise concept for what happened as performed work in real time and space.
Every Work individual has actual performer-system, covering-assignment, enacted-method, temporal, and containing-system facts. It stands in a direct work-to-referent, binding, or resource-use relation only when that relation obtains world-side; none is a field stored in the occurrence. A separate assertion or description may designate that individual and state the relations, but the episteme neither creates the relations nor becomes the Work occurrence.
Problem (what breaks without a clean notion of Work)
- Plan and occurrence 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 represented as fields or booked to methods or roles instead of being stated through separately obtaining resource-use relations involving exact Work individuals; costing and sustainability measures drift.
- Mereology muddle. Teams hand-wave over work parts, retries, overlaps, or long-running episodes; roll-ups double-count or miss work.
Forces (what the definition must balance)
Solution — admit accountable dated Work occurrences under U.Work
Definition and occurrence identity
U.Work is the admitted U-kind for dated 4D occurrence holons. One Work individual is one independently identified world-side dated performed occurrence with its own governed temporal extent. The actual performer is an admitted U.System. For every performer, recover the exact obtaining U.RoleAssignment whose HolderSystemSlot resolves to that system, whose role interpretation is current, and whose occurrence covers the work or the exact attributed work part. The system acts; the assignment is the world-side relation under which the attribution holds, and it neither acts nor enacts a method.
The canonical F.6 relation performedUnderAssignment(W, RA) attributes one exact Work occurrence to one exact assignment occurrence. For an obtaining attribution, its actual-performer projection is S = RA.HolderSystemSlot; the relation obtains only when admitted system S actually performed W under RA and RA covers the attributed extent. In practitioner prose name both objects: S performed W under RA. The legacy spelling performedBy(W, RA) is a deprecated compatibility alias only; do not author new claims with it, and never say that RA performed W.
An exact enactsMethod relation connects the Work individual to an exact U.Method, and one exact executedWithin relation names its containing U.System. Direct work-to-referent, binding, and performed resource-use relations are recovered independently only when they obtain and the current claim needs them. An occurrence designator permits reference but does not identify work by label, ticket, trace, record, or storage convention; an assertion or description about the occurrence is a separate U.Episteme.
The actual enactsMethod relation obtains between the Work occurrence and the exact U.Method; it is not a field of either participant. An exact U.MethodDescription may be cited when its claims identify, constrain, or justify that method for the receiving use; the description is not enacted and its fields do not become actual work bindings. A selected model-use structure likewise enters only through the exact receiving relation whose interpretation it changes.
Call a selected method description, continuity policy, or criterion an edition only when an exact C.2.1 EpistemeEditionRelation connects it to the earlier episteme and obtains. Otherwise name the selected episteme, or say that one episteme is a non-continuing replacement for another.
If the receiving sentence says that a referent changed, identify one exact U.Transformation independently under A.3.4. If a declared domain predicate relates exact Work W and transformation T, name that predicate, its participant order, and the facts that make it obtain. If no one direct predicate suffices but a one-case compound claim does, use A.6.RCD disposition 2 only when the substrate-admitted constructor, governed base predicates, actual participants, and case facts are recoverable; the result is C.2.1 claim content, not a relation kind or occurrence. Otherwise retain W and T separately and return missing-governor[work-to-change], or A.6.RCD's missing-substrate result when the proposed constructor itself has no current semantics. Shared time, referent, or wording connects neither object. A morphism, delta expression, state-plane trace, pre-state, or post-state may represent or support the neighboring change claim; none is a Work field or identity discriminator.
Memory aid: Work = “how it went this time” (dated, resourced, accountable).
Core occurrence references and neighboring links
When a separate assertion or description episteme describes one Work occurrence, recover the following content at the granularity required by the current use. Each item names an occurrence designator, a world-side relation or temporal fact, or a reference to another episteme; the list is not a slot or field schema for the Work individual:
- Occurrence and extent — one occurrence designator plus exact start and end, or an explicitly open end for in-flight work; add location only when the work claim depends on it.
- Performer system and assignment — name each admitted holder
U.Systemthat actually performed the occurrence and the exact obtainingU.RoleAssignmentunder which it performed. Verify that the assignment'sHolderSystemSlotresolves to that same system and recover its role value, role-taxonomy episteme, effective reference scheme, obtaining condition, and extent under A.2.1. When explicit F.6 attribution identity is used,performedUnderAssignment(W, RA)citesRAas the assignment ground; the actual performer remains its holder system. - Enacted method — actual
enactsMethod -> U.Method. CitemethodDescriptionRef -> U.MethodDescriptiononly when the receiving claim depends on that exact description episteme; the description is not enacted. - Containing system —
executedWithin -> U.System; if ordinary speech says subsystem, name thatU.Systemand its exact part relation to the larger holon. - Work-to-referent relation used by the claim — name the declared domain predicate, its participant order, and the actual Work and referent participants only when that predicate obtains and the receiving claim uses it. "Work on X", shared timing, a record mention, or a convenient
affectedfield establishes no such relation. If the use needs the relation but no predicate governs it, keep the Work and referent and returnmissing-governor[work-to-referent]. An obtaining work-to-referent fact does not by itself assert change, production, delivery, or acceptance. - Actual participation and bindings — for an operation argument or result, name one identified A.6.1 application and its exact declaration-local binding. For another participant, parameter, supplied constituent, premise, or reference use, name the declared subject predicate, participant order, and actual values. If the required route is absent, name the missing relation or binding in the
missing-governorresult rather than asserting it. A MethodDescription field, plan row, type-compatible value, or log token establishes none of them. - Performed resource use — name the declared resource-use predicate and its actual Work, resource, amount, unit, and extent participants at the boundary needed by costing or sustainability use. If no predicate governs the needed use, return
missing-governor[resource-use]; do not infer use from colocation, timing, or a plan estimate. - Continuity policy for an unresolved segmentation — when a named identity, episode, retry, resumption, or aggregation use has more than one defensible segmentation, cite
workContinuityPolicyRefto the exact C.2.1 episteme whose claims state the branch criterion and tolerances for that use, and interpret those claims under its effectiveU.ReferenceScheme. If the criterion or its applicability cannot be recovered, leave that segmentation unresolved. The episteme is aU.MethodDescriptiononly if it independently satisfies A.3.2's method-description criterion. A simple uninterrupted occurrence needs no continuity-policy reference; the policy supports a judgment about the occurrence and neither constitutes nor rewrites it. - Work mereology and temporal relations — exact parent, part, predecessor, successor, overlap, retry, or resumption relations only when their predicates obtain.
- Actual change and production claims — identify each actual transformation independently under A.3.4; connect it to Work only through a declared domain predicate with its exact Work and transformation participants or a filled A.6.RCD disposition-2 claim with recoverable constructor, base predicates, participants, and case facts. Otherwise return
missing-governor[work-to-change]. Keep the current A.15.PROD production-work, entity-identity-inception, and production-completion claims separate. None follows from work identity or parthood. - Evaluation and downstream claims — use the one matching §4.6 row for evaluation work and result, evidence use, delivery or transfer, and acceptance; omit every row that is not current.
- Evidence, publication, and model use — cite only the exact evidence-use, publication-use, currentness, claim-scope, reference-plane, bridge, or selected model-use relation needed by the receiving claim.
Clear distinctions (the four‑slot grammar in action)
Publication-use boundary for U.Work
A publication about one Work occurrence projects an already declared assertion or description episteme; it does not create the world-side occurrence, add performed-occurrence facts, or make a plan, source reconstruction, dashboard, publication face, or carrier count as performed work.
Preparation is classifiable as one Work individual under U.Work only after it actually occurs and the actual performer U.System, its covering U.RoleAssignment and F.6 attribution when explicit, the exact enactsMethod, temporal extent, and executedWithin relation obtain independently. Add a work-to-referent, binding, or resource-use fact only through its own obtaining relation when the receiving preparation claim needs it. The readiness relation that asks whether intended work is ready enough to enter a work boundary is WorkEntryReadiness@Context under A.15.5; a readiness label, full-kit checklist, or launch-looking cue is not a performed occurrence.
Crossing visibility for work publications
When a work publication relies on another selected method-description episteme, name that episteme and the relation the publication actually uses; do not infer an edition from a version label or later date. For a semantic crossing, name the two F.17 sense cells and test the F.9 Bridge predicate profile, then state the proposed action, direction, rule, and tolerated loss in a separate C.2.1 bounded-use claim. For a reference-scheme, claim-scope, model-use, reference-plane, unit, or publication change, cite the direct relation that the publication actually uses. A.10 or B.3 owns reliance on the bounded-use claim and any penalty; none of these facts changes the Work occurrence's identity.
A planned, gate-selected, or launch-labelled value becomes actual only when a named direct predicate with its actual participants obtains, or when an exact A.6.1 operation-application binding connects one identified application to that value. If neither the predicate nor the binding is present, keep the value planned and return missing-governor[actual-use]. Do not back-fill a plan or infer an actual binding from shared wording. Pre-state and post-state references remain with an independently governed transformation or comparison claim; bracketing the Work interval does not bind them to the occurrence.
Route a result or consequence without folding it into Work
Start with the ordinary sentence the reader needs, then select exactly one row for each separate claim. An absent row stays absent; the table is not a result record to fill.
Three-question result check. (1) Did the work occur? Name W and its performer, assignment, method, time, and containing system. (2) What separate result or consequence is claimed? Name the exact returned value, entity, change, production claim, or transfer and use its row above. (3) Who judged or accepted what, by which criterion and evidence? Name the evaluation work, result, evidence relation, and acceptance relation separately. If the reader needs only the first or first two answers, stop there.
Work mereology (how occurrences form holarchies)
Work identity is occurrence-grounded and 4D. Start from the actual performance history: work-entry and end events, occupied spatiotemporal extent, performer systems and assignments, enacted method, containing system, any direct work-to-referent relations, actual bindings, resource use, and exact work-part or temporal relations. A distinct actual work-entry after an established completion or termination identifies a later occurrence; a proper work part and its parent are distinct individuals; independently grounded concurrent performances are distinct. A record, trace, policy episteme, or later judgment creates none of them. A continuity policy is needed only when a named use must decide how to group that already existing history across an interruption, resumption, mode or method switch, performer replacement, referent or binding change, or composite boundary.
Parts and wholes of Work (occurrence facts)
- Temporal-part (
TemporalPartOf_work). A proper time-slice relation over one selected Work occurrence or work phase. The selected part is grounded by parent work identity plus interval and, when needed, a named aspect such as resource use, telemetry, SLA coverage, or interval-local evidence. A temporal part is useful for monitoring, utilization, lead time, and interval-local evidence. It has no independent method-switch identity by that fact. - Episode-part (
EpisodeOf_work). A named, event-bounded fragment selected inside one parent Work occurrence because a named use needs that fragment. Entry, resumption, mode switch, switch-to-method, interruption, switch-away, completion, or a declared pause may supply the candidate boundary. The direct episode predicate also cites an exactworkContinuityPolicyRefonly when the use needs that policy to decide whether the fragment remains under the parent; timestamps or an episode-looking label alone establish no episode relation.
workContinuityPolicyRef designates the exact C.2.1 episteme whose claims state the named use, boundary events, tolerated variation, and branch criterion. Interpret those claims under that episteme's effective U.ReferenceScheme. Add a U.ClaimScope, temporal qualification window, or model-use structure only when changing it changes the segmentation assertion; otherwise omit it. The policy episteme classifies the already existing history for that use. A later or competing policy episteme can support another identity or segmentation assertion. Call it an edition only when an exact C.2.1 EpistemeEditionRelation obtains between the exact earlier and later epistemes; without that relation it is a non-continuing replacement. Either way, the policy neither becomes a U.MethodDescription by policy form nor changes the occurrence, its parts, or their actual facts.
- Operational-part (
OperationalPartOf_work). A work-part occurrence that may enact a factor of a recoveredU.Method, for example, an incision occurrence within an appendectomy occurrence, possibly overlapping with others in time. If a method-description reference is used, it identifies, describes, constrains, or evidences that method factor; the referencedU.MethodDescriptionis not enacted. If noU.Methodfactor is recovered, keep the material as the work part, evidence segment, telemetry segment, mechanism material, system-component behavior, or missing-source-relation note that was actually identified; do not infer a method factor from its label. - Concurrent work parts (derived use-side reading; no fourth parthood relation). First state each exact work-part relation to the same parent and then state the independently governed interval
overlapsfact. If a claim also says that the parts were coordinated, name its declared coordination predicate and actual participants. Shared parentage and overlap do not by themselves establish coordination, andConcurrentPartOf_workis not introduced as a primitive work-part relation.
Naming threshold. Do not mint a durable public U-kind, durable named work object, or separate work occurrence for every interval, telemetry segment, pause, or episode-looking wording. Use a derivative part relation unless the downstream use needs a named work part with its own resources, evidence, KPI, acceptance, repair, aggregation, cross-context reliance, or source-relation return use. Otherwise keep the temporal relation, evidence slice, telemetry segment, method-description constituent, missing-source-relation note, or other concrete neighboring object that the task actually needs.
Didactic rule: Method composition is not proof of Work decomposition, and Work decomposition is not proof of method composition. A temporal work part may enact the same whole method during a slice. An episode may continue one method or mode, span several operational parts, repeat the same method fragment, or be split by evidence policy without changing method identity. An operational part may correspond to a method factor only when that factor is recovered as U.Method.
Quick choice test.
- Ask "which interval or aspect of the parent work do I need?" If that is enough, use
TemporalPartOf_work. - Ask "does this named use need an event-bounded fragment of the parent?" If yes, recover the candidate boundary events. Cite
workContinuityPolicyRefonly when interruption, resumption, switch, replacement, or pause leaves the grouping ambiguous for that use; then useEpisodeOf_workonly when its direct predicate is satisfied. - Ask "which performed sub-occurrence has its own actual performer system, covering assignment, temporal extent, enacted method, affected referent, bindings, resource use, or aggregation role?" If that is current, use
OperationalPartOf_workor another declared work-part relation. A neighboring evaluation or effect claim does not establish work parthood by itself. - Ask "which way-of-doing part is being composed?" If the answer needs preconditions, effects, interface, and whole-method relation, recover a
U.Methodsubmethod underA.3.1andB.1.5; do not make the work part itself carry the method identity.
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 later Work occurrence that starts after the earlier occurrence ended and re-attempts the same named objective or enacted Method under the exact predicate of the retry relation. Similar wording or revised bindings alone do not establish the link.resumptionOf— an event-bounded episode or later Work occurrence that continues after interruption. Cite a continuity policy only when the named use must decide whether the later performance remains under the same parent or is a distinct occurrence linked to the earlier one.
These relations are occurrence facts, not method-design assumptions.
Work-occurrence relations used by Part B roll-ups
A.15.1 supplies the identity of each independently identified Work occurrence or Work part and makes its exact temporal and performed resource-use relations recoverable. It does not itself return a temporal aggregate or resource ledger.
- Temporal coverage. When a receiving use needs utilization, elapsed time, phase coverage, or another roll-up over Work intervals, open
B.1.4. Its recoveredContextTemporalAggregation@Context, coverage and non-overlap conditions, aggregation policy, and optionalGamma_timenotation govern union, hull, or another admitted temporal aggregate. The work intervals remain A.15.1 facts. - Resource aggregation. When a receiving use needs a total over materials, energy, time, money, tool wear, or another performed resource value, open
B.1.6. Its recoveredWorkResourceAggregation@Context, typed resource-accounting basis, evidence refs, overlap or deduplication policy, ledger, aggregation rule, and optionalGamma_worknotation govern the aggregate. Each contributing performed resource-use relation obtains separately with its exact Work occurrence as a participant; any ledger or assertion about that relation is a separate episteme.
Manager's tip: cite the exact B.1.4 or B.1.6 aggregation result and policy beside the KPI. A Work-part list, shared parent, or operator spelling supplies neither the aggregate nor its policy.
Identity and reidentification of Work
Two descriptions, assertions, records, or traces resolve to the same Work occurrence only when they designate the same actual world-side performance history, not merely the same name, policy label, similar policy content, or later date. First compare the direct facts at the selected grain:
- the same actual work-entry or start and compatible occupied spatiotemporal extent;
- the same performance history, with each performer system, covering assignment, enacted method, and containing system, plus every actually obtaining work-to-referent, binding, and resource-use fact used by the identity claim, placed at the interval where it obtains;
- compatible work-part and temporal relations; and
- no fact that already identifies distinct individuals: a proper part versus its parent, independently grounded concurrent performances, or a later work-entry after the first occurrence's established completion or termination.
A corrected or later description of the same actual start, open end, or completed end can refine the assertion without changing the occurrence. A change of performer, assignment, method, referent, binding, resource use, or containing system during an otherwise unended performance history is an actual change to state explicitly; that change alone neither splits nor preserves the Work occurrence.
When a named receiving use must decide whether an interruption, resumption, method or mode switch, performer replacement, retune, rework, referent or binding change, or composite boundary stays inside one parent, cite the exact continuity-policy episteme, its effective reference scheme, applicable scope and window, and the branch criterion it applies to those facts. The selected policy can support one identity or segmentation assertion for that use. A later or competing policy episteme may support another assertion; call it a later edition only when the exact C.2.1 EpistemeEditionRelation obtains, and otherwise treat it as a non-continuing replacement. Neither branch retroactively changes what occurred.
Interruptions, retries, resumptions, and description changes
- Established end and later entry: identify a later Work occurrence when the first occurrence has actually completed or terminated and another work-entry occurs. A larger composite Work may contain both only through explicit work-part relations.
- Retry: identify the later Work occurrence independently and add
retryOfonly when that relation's own predicate connects it to the ended attempt. - Ambiguous interruption or resumption: preserve the actual boundary events and facts. If a named use must decide same-parent versus separate-occurrence grouping, apply its exact
workContinuityPolicyRef; without that criterion, return an unresolved segmentation rather than making the policy implicit. - Performer, assignment, method, referent, binding, retune, or mode change: state the actual change where it occurs. Split or retain the parent only when the direct facts already decide the boundary or a policy current to the named identity, episode, retry, resumption, or aggregation use supplies the criterion.
- Method-description episteme change: record the newly selected description episteme separately. That selection neither splits nor preserves Work by itself; only an accompanying actual occurrence change enters the boundary judgment. Call the two descriptions editions only when their exact C.2.1
EpistemeEditionRelationobtains. - Rework: identify the later performance independently. Relate it as another occurrence, episode, or operational part only after the applicable direct predicate and any genuinely needed boundary policy are satisfied. Keep causal attribution with the governing causal-use pattern.
Plans, costs, quality statistics, telemetry evidence, and method-reliance claims may depend on whether the selected history is a temporal part, event-bounded episode, operational part, or later occurrence. Name a continuity-policy episteme, effective reference scheme, scope, and qualification window only when that distinction is actually current. Otherwise retain the direct occurrence facts and stop; do not add policy apparatus to a simple uninterrupted case.
Work mereology does not compose effects or transformations
A parent Work can have exact work parts without having one composite effect or composite transformation. Any temporal aggregate uses B.1.4; any performed-resource aggregate uses B.1.6; each names its own concern, policy, evidence, and result. Identify every actual transformation independently under A.3.4. Connect one to Work only through a named domain predicate and exact participants, or a C.2.1 local compound claim under A.6.RCD disposition 2 with its constructor, governed bases, participants, and case facts recoverable; otherwise return missing-governor[work-to-change].
Work parthood, method parthood, temporal inclusion, a common affected referent, a list of changed characteristics, or adjacent plan items establishes neither transformation parthood nor a composite transformation. If a production or effect claim needs transformation composition, name the declared composition predicate, its participants, and the facts that make it obtain. If none is available, retain the exact Work and independently identified transformations and return missing-governor[transformation-composition]. A.15.PROD may still recover any independent production-work, entity-inception, or completion claim that does not depend on that missing composition.
Archetypal grounding (parallel domains)
Each case below is presented as readable content of a separate assertion or description episteme. Arrow notation abbreviates independently obtaining world-side relations involving the named Work individual; methodDescriptionRef and continuity-policy references cite separate epistemes. The bullet layout declares no slots or fields on the Work individual.
Surgical case (overlap and episodes)
- Top work occurrence:
Appendectomy_Case_2025-08-10T0905_1142. - Actual method and containing system:
enactsMethod -> Appendectomy@Hospital-2025;executedWithin -> SurgicalService_A. - Patient and administered dose: project relation specification
MED-ADM-2026, owned byClinicalAdministrationRelations@Hospital-8472, declaresClinicalWorkAdministersDoseToPatient(dose, patient, clinicalWork, interval). The stipulated administration facts make it obtain forMedicineDose_8472,Patient_8472,Appendectomy_Case_2025-08-10T0905_1142, and the surgery interval. This relation establishes only that administration claim. The case names no admitted predicates for theatre, consumables, or staff-time resource use, so those optional claims returnmissing-governor[SURGERY-RESOURCE-USE]and do not enter Work identity. methodDescriptionRef:Appendectomy_v5.- Performer system and assignment: admitted system
OR_Team_Aperforms this occurrence under exactOR_Team_A_SurgicalTeamAssignment_2025-08-10 : U.RoleAssignment, whose role value isSurgicalTeamRole, role-taxonomy episteme isHospitalRoles-2025, effective reference scheme isHospital-Operating-Scheme-2025, and obtaining extent covers the surgery interval. The team system acts; the assignment does not. - Operational parts:
Incision(09:15–09:22),Exploration(overlaps with monitoring),Closure(11:10–11:35). - Episode: a brief power dip occurs from 10:02 to 10:07. The named surgery-continuity use applies
HospitalWorkContinuityPolicy_2025, a C.2.1 policy episteme interpreted underHospital-Operating-Scheme-2025; its stated pause-and-resumption criterion keeps both event-bounded fragments under the same parent Work. The power dip alone would not decide that grouping. - B.1.4 temporal roll-up:
SurgeryORUtilizationAggregation-8472uses union underORUtilizationUnionPolicy-2025;SurgeryPatientLeadTimeAggregation-8472uses hull underPatientLeadTimeHullPolicy-2025. Both consume the named surgery and part intervals; neither supplies a resource-use or acceptance relation. - B.1.6 resource roll-up: no positive aggregate is asserted in this fixture because the direct theatre-, consumables-, and staff-time resource-use predicates are absent. Preserve the Work and the administration relation and return
missing-governor[SURGERY-RESOURCE-USE]; open B.1.6 only after the project declares those predicates and supplies their actual participants and facts.
ETL pipeline (parallelism and retries)
- Top work occurrence:
ETL_Nightly_2025-08-11T01:00-01:47. - Actual method and containing system:
enactsMethod -> Nightly_ETL_Load@DataOps-2025;executedWithin -> DataPlatform_Prod. - Dataset participation; resource stop: relation specification
ETL-DATA-REL-2025, owned byETLDataUseRelations@WarehousePlatform, declaresSourceDatasetParticipatesInETLWork(dataset, work, extent)andDestinationDatasetParticipatesInETLWork(dataset, work, extent). The stipulated job facts make the first obtain forRawOrders_2025-08-11,ETL_Nightly_2025-08-11T01:00-01:47, and its extent, and the second forWarehouseOrders_2025-08-11with the same Work and extent. Neither predicate means later analytics use or dataset transformation. The case names no direct cluster-time or storage-use predicate, so those optional claims returnmissing-governor[ETL-RESOURCE-USE]. - Actual change, no connection yet: A.3.4 identifies
WarehouseOrders_LoadTransformation_2025-08-11as the bounded change of the exact dated warehouse partition across 01:00–01:47 under the declared source-snapshot and partition-write conditions. Before that boundary the partition lacksAcceptedOrdersRowSet_2025-08-11; after it, the project data-state relation to that row set obtains. This fixture declares neither a direct W-to-T predicate nor a complete A.6.RCD disposition-2 claim with a constructor, governed base predicates, participants, and case facts, so it returnsmissing-governor[ETL-WORK-TO-CHANGE]. Keep the Work, transformation, and dataset-participation facts; shared time, destination label, and post-state do not connect W to T. - Performer system and assignment: admitted system
ETL_Runtimeperforms this occurrence under exactETL_Runtime_TransformerAssignment_2025-08-11 : U.RoleAssignment, whose role value isTransformerRole, role-taxonomy episteme isDataOpsRoles-2025, effective reference scheme isDataOps-Execution-Scheme-2025, and obtaining extent covers the ETL interval. The runtime system acts; the assignment does not. - Parallel parts:
Extract_A‖Extract_B;Transformstarts when either completes (overlap). - Retry:
WarehouseWritefailed at 01:36; retried with batch size ↓ — new Work linked viaretryOf. - B.1.4 temporal roll-up:
ETLSLACoverageAggregation-2025uses hull underETLSLAHullPolicy-2025;ETLClusterUtilizationAggregation-2025uses union underETLClusterUnionPolicy-2025. They consume the named Work-part intervals and do not establish dataset participation, resource use, or change. - B.1.6 resource roll-up: no compute or storage aggregate is asserted until the ETL project declares cluster-time and storage-use predicates and supplies the exact Work, resource, value, unit, and extent participants. Until then return
missing-governor[ETL-RESOURCE-USE]; the two dataset-participation relations remain valid.
Thermodynamic cycle (work through a state-plane trace)
- Run:
Carnot_Cycle_Run_2025-08-09T1300_1306. - Actual method and containing system:
enactsMethod -> Carnot_Cycle_Operation@ThermoLab;executedWithin -> LabRig_7. - Referent and energy-use stop: this fixture supplies no admitted predicate relating the run to
WorkingFluidCharge_7and no direct predicate for electrical-energy use throughHeaterBank_7orChiller_7. Keep the grounded Work occurrence and returnmissing-governor[THERMO-REFERENT-AND-ENERGY-USE]for those optional claims. A state-plane trace, shared interval, or equipment label cannot fill the missing predicates. methodDescriptionRef:Carnot_Cycle_Specwith Dynamics model.- Performer system and assignment: admitted system
LabRig_7performs this occurrence under exactLabRig_7_TransformerAssignment_2025-08-09 : U.RoleAssignment, whose role value isTransformerRole, role-taxonomy episteme isThermoLabRoles-v2, effective reference scheme isThermoLab-Experiment-Scheme, and obtaining extent covers the laboratory-work interval. The rig system acts; the assignment does not. - Work identity: this uninterrupted six-minute run is identified from its actual entry, extent, performer system, covering assignment and F.6 attribution when explicit, enacted method, and containing system. No continuity-policy reference is needed because no interruption or competing segmentation is current. The optional referent and energy-use claims remain at
missing-governor[THERMO-REFERENT-AND-ENERGY-USE]. The thermodynamic state-plane trace separately describes or evidences actual change; it is not a Work field, control relation, or instruction sequence. - Part B roll-ups: no B.1.4 temporal aggregate is asserted in this fixture. A later roll-up must name this Work ref, the aggregation concern, window, coverage and non-overlap conditions, and the exact policy selecting union, hull, or another admitted result; the run interval alone is insufficient. B.1.6 cannot aggregate energy use until the missing direct energy-use predicate and participants are supplied. Any thermodynamic transformation remains independently grounded under A.3.4 and needs its own named W-to-T route before connection to this Work.
Claim handling (episodes versus monitoring slices)
- Top work occurrence:
ClaimHandling_Case_8142_2026-06-03. - Actual method and containing system:
enactsMethod -> ClaimHandling@InsuranceOps-2026;executedWithin -> ClaimsOperations_A. - Claim and resource stop: this fixture names
Claim_8142, handler-time intervals, andClaimsPlatform_A, but supplies no admitted Work-to-claim, handler-time-use, or case-system-time-use predicate. Keep the grounded claim-handling Work and returnmissing-governor[CLAIM-REFERENT-AND-RESOURCE-USE]for those optional relations. Callback and monitoring records remain neighboring evidence or telemetry, not occurrence constituents. methodDescriptionRef:Claims_Method_v7.- Performer system and assignment: admitted system
ClaimsTeam_Aperforms this occurrence under exactClaimsTeam_A_HandlerAssignment_2026-06-03 : U.RoleAssignment, whose role value isClaimsHandlerRole, role-taxonomy episteme isInsuranceOpsRoles-2026, effective reference scheme isClaims-Handling-Scheme-2026, and obtaining extent covers the claims-work interval. The team system acts; the assignment does not. - Episode policy: the named claims-handling continuity use applies
ClaimsWorkContinuityPolicy_v7, a C.2.1 policy episteme interpreted underClaims-Handling-Scheme-2026. Its stated under-one-hour callback criterion supports assertionClaimsSegmentation-v7-8142:InitialReview_09:00-09:42andResumedResolution_10:11-10:38are twoEpisodeOf_workfragments under the same parent. - Nearest non-continuing replacement: competing episteme
ClaimsWorkContinuityPolicy_15min-Alt, interpreted under the same reference scheme, states a fifteen-minute callback threshold. Applied to the same 29-minute gap, it supports assertionClaimsSegmentation-15min-8142that the resumed performance is a later Work occurrence rather than an episode under the first parent. NoEpistemeEditionRelationbetween the exact v7 and 15-minute policy epistemes is established, so the second is a non-continuing replacement, not an edition. Either assertion may govern its named receiving use; switching the selected policy changes the use-local segmentation judgment, not either interval's actual history. Only if C.2.1's historical-continuation predicate is separately satisfied may the later policy be called an edition. - Temporal monitoring slice:
MonitoringSlice_09:15-09:20isTemporalPartOf_workfor queue-latency evidence. It is not a new work occurrence and not an episode unless downstream reliance needs a named part with its own evidence, KPI, acceptance, repair, or aggregation role. - Method relation: under
ClaimsSegmentation-v7-8142, both episodes enact the same claim-handling method; underClaimsSegmentation-15min-8142, each of the two Work occurrences enacts that method. The segmentation choice changes neither enactment fact. The five-minute slice does not prove a submethod.
Internal-combustion engine (cycle parts without human-only boundary language)
- Top work occurrence:
EngineRun_Cell7_2026-06-03T1300_1330. - Actual method and containing system:
enactsMethod -> FourStrokeEngineOperation@TestBench-2026;executedWithin -> Engine_Cell7. - Engine and resource stop: this fixture supplies no admitted Work-to-engine, fuel-use, or ignition-energy-use predicate for
EngineUnderTest_7,FuelBatch_F7, and the 13:00–13:30 run. Keep the grounded engine-cell Work and returnmissing-governor[ENGINE-REFERENT-AND-RESOURCE-USE]; a test-bench label or shared interval establishes none of those optional relations. methodDescriptionRef:FourStrokeOperationSpec_v4.- Performer system and assignment: admitted system
Engine_Cell7performs this occurrence under exactEngine_Cell7_OperationAssignment_2026-06-03 : U.RoleAssignment, whose role value isEngineOperationRole, role-taxonomy episteme isEngineCellRoles-2026, effective reference scheme isTestBench-Operating-Scheme-2026, and obtaining extent covers the engine-run interval. The engine-cell system acts; the assignment does not. - Episodes: when diagnosis or utilization needs event-bounded fragments,
EngineRunEpisodePolicy_2026, a C.2.1 policy episteme underTestBench-Operating-Scheme-2026, states which start, stop, mode-change, fuel, ignition, or diagnostic events bound anEpisodeOf_work. Without that named use and branch criterion, the events remain direct history and do not mint episode objects. - Temporal parts: crank-angle intervals or one-second telemetry windows are
TemporalPartOf_workunless an exact receiving use requires a named work part for resource, evidence, KPI, acceptance, repair, or aggregation. - Method factors: intake, compression, combustion-expansion, and exhaust are method factors only if recovered as
U.Methodsubmethods with method-level preconditions, effects, interfaces, and whole-method relation. Actual strokes are work parts or temporal parts of engine work, not submethods by label.
Detector radio receiver (component behavior, method factor, work part)
- Top work occurrence:
ReceiverReception_Rx42_2026-06-03T2115_2120. - Actual method and containing system:
enactsMethod -> EnvelopeDetection@RadioLab-2026;executedWithin -> Receiver_Rx42. - Signal and resource stop: this fixture supplies no admitted Work-to-signal, receiver-channel-time-use, or electrical-energy-use predicate for
RF_TestSignal_42_2115,Rx42_Channel_1, and the 21:15–21:20 reception. Keep the grounded receiver Work and returnmissing-governor[RECEIVER-REFERENT-AND-RESOURCE-USE]; waveform and telemetry traces remain representations or evidence. methodDescriptionRef:EnvelopeDetectionMethod_v2.- Performer system and assignment: admitted system
Receiver_Rx42performs this occurrence under exactReceiver_Rx42_DetectorAssignment_2026-06-03 : U.RoleAssignment, whose role value isDetectorReceiverRole, role-taxonomy episteme isRadioLabRoles-2026, effective reference scheme isRadioLab-Reception-Scheme-2026, and obtaining extent covers the reception interval. The receiver system acts; the assignment does not. - Episodes: when signal-quality or diagnostic use needs event-bounded fragments,
ReceiverReceptionEpisodePolicy_2026, a C.2.1 policy episteme underRadioLab-Reception-Scheme-2026, states whether retune, on/off, interruption, or diagnostic-mode events bound anEpisodeOf_work. A trace timestamp or retune label without that current branch criterion remains history, not an episode relation. - Temporal parts: a one-second reception slice is
TemporalPartOf_workfor signal-quality evidence or telemetry aggregation. It is not a new occurrence merely because it appears in a trace. - Method and mechanism split: tuning, rectification, smoothing, and acoustic output may be recovered as method factors, system-component behaviors, mechanism material, evidence traces, or operational work parts depending on the current claim. A detector component or waveform segment does not become a submethod or a work part by label.
Classification work without result collapse
Pump37_RecognitionWork_2026-07-20T1015_1022 is one Work individual admitted under U.Work, with temporal extent 10:15–10:22. Admitted system RecognitionEvaluator_A performs it under Pump37_EvaluatorAssignment_2026-07-20 : U.RoleAssignment; exact F.6 performedUnderAssignment, enactsMethod(Pump37_RecognitionWork_2026-07-20T1015_1022, HolonRecognitionEvaluation@FPF), and executedWithin(Pump37_RecognitionWork_2026-07-20T1015_1022, FPF_Recognition_Service_A) obtain. A.6.1 application Pump37_RecognitionApplication_2026-07-20T1017 has obtaining candidateArgument -> Pump_37 and judgmentResult -> unknown bindings, so the candidate participation and returned value need no generic affected-referent or Work-result relation. This fixture supplies no admitted evaluator-time or runner-compute resource-use predicate; return missing-governor[PUMP37-RESOURCE-USE] for those optional claims without lowering the Work or application bindings.
The returned unknown value remains the A.6.1 result binding. No U.Transformation of Pump_37 or of a classification record is asserted. This evaluation Work remains admitted from its performer system, covering assignment, enacted method, extent, and containing system; the application binding is a separate obtaining fact, and the absent optional resource-use predicates do not lower the Work. No pre-state, post-state, or delta is needed. Candidate-side criterion satisfaction remains under A.1; evidence and assurance remain neighboring relations; and any materialized classification assertion or evaluation-result episteme remains under C.2.1. None is the Work occurrence or an intrinsic Work result field.
Filled result route: build, verify, transfer, accept
ReleaseBinary12_BuildWork_2026-07-21T0900_0912 : U.Work is performed by BuildRunner_A : U.System under BuildRunnerAssignment_2026-07-21 : U.RoleAssignment, enacts ReproducibleBuild@BuildOps-v12, runs from 09:00 to 09:12, and is executed within BuildService_A. Those facts establish the Work occurrence. The rows below add only the result and consequence claims that are current in this case.
The readable report is therefore: the build Work occurred; a different entity was returned and produced; BuildWorkPopulatedStore-12 states the positive local W-to-T claim; separate verification Work returned a verdict supported by evidence; and ArtifactTransferToStaging_12 transferred the entity. Acceptance remains at missing-governor[STAGING-ACCEPTANCE]. Removing any non-current row does not alter the identity of the build Work.
Bias-Annotation
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: The occurrence head is universal. Temporal semantics use the declared temporal reference. A simple uninterrupted occurrence needs no continuity-policy episteme; identity, episode, retry, resumption, or aggregation claims cite
workContinuityPolicyRefand its effectiveU.ReferenceSchemeonly when the named use must resolve an ambiguous boundary. Add claim scope, a qualification window, model-use structure, evidence use, or source-currentness assessment only when changing that neighboring fact would change the receiving assertion or reliance; otherwise omit it. - Rationale: Gives FPF a clean, actionable notion of occurrence with admitted performer
U.Systems acting under exact obtainingU.RoleAssignments and with actualenactsMethodrelations, so that costing, quality, and audit rest on independently identified work occurrences rather than plans, recipes, assignments made to act, or a generic role-enactment fact.
Conformance Checklist (admission checks)
CC-A15.1-1 (Strict distinction).
U.Work is the admitted kind for dated performed Work occurrences. Each Work individual is world-side; it is not a U.Method (semantic way), U.MethodDescription (description), U.Role or U.RoleAssignment (assignment), U.WorkPlan (plan or schedule), or assertion, record, log, or publication about work.
CC-A15.1-2 (Required occurrence basis).
A conforming assertion or description about a Work individual designates one world-side occurrence admitted under U.Work and makes each actual performer U.System, the exact obtaining U.RoleAssignment under which that system performed, any explicit F.6 performedUnderAssignment(W, RA) attribution, actual enactsMethod -> U.Method, temporal extent, and executedWithin -> U.System recoverable. It also names every declared work-to-referent, subject-participation, or resource-use predicate used by the receiving claim, together with its participant order and actual participant values, or gives the exact A.6.1 binding for an identified operation application. When a needed predicate or binding is absent, it returns the corresponding missing-governor result instead of inventing a positive relation. Cite methodDescriptionRef -> U.MethodDescription only when the receiving claim depends on that exact description episteme. The episteme designates these independently obtaining objects and relations; it does not turn them into occurrence fields or make the assignment act.
CC-A15.1-3 (Time window).
A conforming assertion or description about one Work occurrence designates a world-side individual with a closed temporal extent [t_start, t_end], or an explicitly open end while the occurrence is in flight. The episteme states or designates that extent and, where relevant, location or asset; neither an interval field nor the presence of the record creates the occurrence.
CC-A15.1-4 (Interpretation and policy basis).
A load-bearing work claim names direct occurrence facts first. It cites workContinuityPolicyRef, its effective U.ReferenceScheme, and applicable scope or qualification window only when a named identity, episode, retry, resumption, or aggregation use must resolve an ambiguous segmentation. Any selected method-description episteme, aggregation-policy episteme, selected model-use structure, acceptance criterion, evaluation work, result episteme, and evidence use remains a neighboring claim rather than a work-identity field.
If two local senses must be related, F.9 receives two exact SchemeSenseCell endpoints and one BridgePredicateProfile; a Bridge is positive only when that profile's predicate obtains. State the proposed comparison, substitution, translation, or publication separately in a C.2.1 bounded-use claim, with its action, direction, correspondence rule, and tolerated loss. A.10 or B.3 owns reliance on that claim. A different reference scheme, role assignment, selected description episteme, or model-use structure alone establishes none of these facts.
CC-A15.1-4b (No mandatory state-plane or delta).
A Work claim needs no StatePlaneRef, pre-state, post-state, or delta merely to establish occurrence identity. If the receiving claim says that a referent changed, A.3.4 identifies the transformation and its state or boundary facts. Connect it to Work only through a declared domain predicate with exact W and T participants, or one C.2.1 local compound claim under A.6.RCD disposition 2 with a recoverable constructor, governed base predicates, actual participants, and case facts; otherwise return missing-governor[work-to-change].
CC-A15.1-5 (RoleAssignment interval coverage).
Every U.RoleAssignment cited by an obtaining F.6 performedUnderAssignment(W, RA) attribution has as its holder the exact admitted U.System stated to perform the work and covers the work interval or exact performed part attributed to that system. If the holder differs or the assignment does not cover the extent, keep the Work occurrence, performer claim, and assignment claim separate: repair or reject the attribution, or establish a retroactive assignment only under the exact A.2.1 rule that admits it.
CC-A15.1-6 (Actual participant and operation binding).
For an operation argument or result, name one identified A.6.1 application and its exact declaration-local binding. For any other actual parameter, participant, premise, constituent, reference use, resource, or work-to-referent claim, name the declared subject predicate, participant order, and actual participant values. If the required route is absent, name the missing relation or binding in the missing-governor result and do not assert it. A MethodDescription declaration, default, A.15.3 planned filling, gate selection, compatible ValueKind, or stored token establishes no actual binding.
CC-A15.1-7 (Capability check).
Any capability threshold relied on for a Work occurrence is the declared bound in the selected method-side claim and is tested by a named A.2.2 capability-fit predicate against each performer system's capability instance for the work interval or declared checkpoints. Name that predicate, the capability instance, threshold, work need, and result. If the fit predicate is absent, return missing-governor[capability-fit] and assert neither fit nor failed fit. A U.Method or U.MethodDescription may cite or describe the threshold but creates neither capability nor fit. State a failed fit in its evaluation-result episteme or direct characteristic/evaluation relation, never as an intrinsic work outcome.
CC-A15.1-8 (Acceptance criteria).
An acceptance claim names the selected criterion episteme or comparator specification, its applicable scope and window, the evaluation or acceptance work that applied it, its returned value or result episteme, and the declared acceptance predicate with all actual participants. If the claim relies on historical continuity with an earlier criterion episteme, name the exact C.2.1 EpistemeEditionRelation; a version label alone is not enough. If no acceptance predicate governs the claim, return missing-governor[acceptance]. Success class, quality measurement, comparison result, and acceptance verdict remain distinct; no verdict is an intrinsic field of the Work occurrence or a condition of U.Work membership.
CC-A15.1-9 (Resource honesty).
Performed resource-use facts (energy, materials, machine-time, money, tool wear) are attributed through declared predicates that name the particular Work, resource, amount, unit, and extent participants, not to U.Method, U.MethodDescription, U.Role, or U.Capability. If no predicate governs the needed use, return missing-governor[resource-use]; estimates remain in method descriptions or plans. Any aggregate ledger, unit conversion, allocation, or overlap and deduplication result belongs to B.1.6 and cites the contributing Work occurrences and resource-use facts.
CC-A15.1-10 (Mereology declared).
When exact work-part relations obtain among Work individuals, declare each relation: temporal-part, episode-part, operational-part, or another relation with its own predicate. Ambiguous mixtures lower aggregation and identity claims. A TemporalPartOf_work claim names parent work identity plus interval or aspect; an EpisodeOf_work claim names the parent, candidate boundary events, and named use, adding workContinuityPolicyRef only when those facts leave the grouping ambiguous for that use; an OperationalPartOf_work claim names the occurrence-side part and any recovered method factor separately. Concurrency adds a separate interval overlaps fact. If the reader also claims coordination, name its declared predicate and actual participants; overlap alone does not establish it.
CC-A15.1-11 (Temporal coverage selection).
For a temporal roll-up, B.1.4 names the exact Work refs, aggregation concern, time window, coverage and non-overlap conditions, and policy selecting union, convex hull, or another admitted result. A.15.1 supplies the occurrence intervals but does not own the aggregate.
CC-A15.1-12 (Resource aggregation).
For a resource roll-up, B.1.6 names the exact Work refs, typed resource basis, units, evidence, delimitation and time window, overlap or deduplication policy, ledger, and aggregation rule. A.15.1 supplies performed resource-use facts but does not own the aggregate ledger.
CC-A15.1-13 (Identity and retries).
A distinct actual work-entry after an established completion or termination identifies a later Work occurrence; a proper work part and its parent and independently grounded concurrent performances are also distinct individuals. Add retryOf, resumptionOf, or EpisodeOf_work only when its own predicate holds. An interruption, performer or assignment replacement, method or mode switch, retune, rework, affected-referent change, or binding change is stated as direct history and neither splits nor preserves the parent by itself. Cite workContinuityPolicyRef only when a named use needs a branch criterion for that ambiguity. A changed MethodDescription or another policy episteme alone revises at most the dependent description or segmentation judgment. Call the policy an edition only when an exact C.2.1 EpistemeEditionRelation obtains; a non-continuing replacement can support a different judgment without rewriting the occurrence.
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-locality evaluation).
A work occurrence keeps one identity when several receiving uses evaluate it. Each use names its own effective reference scheme, claim scope, criterion, qualification window, evaluation work, and result episteme. When two local senses must be related, test the exact F.9 Bridge, then state the proposed comparison or substitution, direction, rule, and tolerated loss in a separate bounded-use claim and check reliance under A.10 or B.3. A shared work name, record, or Bridge carries no acceptance across uses.
CC-A15.1-16 (Method-description changes do not decide Work identity).
If the selected MethodDescription episteme changes during the occurrence, state the description-selection or override claim separately. That selection change alone neither splits nor preserves Work. When an accompanying actual performer-system, covering-assignment, enacted-method, binding, affected-referent, mode, or extent change creates a boundary question for a named use, apply that use's exact continuity-policy criterion. A later or competing policy episteme may support another judgment; it is a later edition only when its exact C.2.1 EpistemeEditionRelation to the earlier policy obtains. Otherwise it is a non-continuing replacement. Neither changes the occurrence.
CC-A15.1-17 (Distributed performers).
If multiple admitted U.Systems jointly perform the same top-level work occurrence, name every system, its exact obtaining covering U.RoleAssignment, and every explicit F.6 attribution; verify that each assignment's holder is that system and that its obtaining extent covers the attributed work. If the use instead needs a parent work with child occurrences, give every child its actual performer system, covering assignment, and work-part relation. A lead, accountability, or coordination claim remains separate and cannot substitute one designated assignment for the actual performer set.
CC-A15.1-18 (Logs are evidence, not work by themselves). Logs and telemetry support a claim about work only through an exact evidence-use relation that identifies the Work occurrence, actual performer system and covering assignment, enacted method, temporal extent, and containing system, plus any selected method-description episteme, work-to-referent relation, binding, resource-use fact, policy, or qualification value on which the receiving claim relies.
CC-A15.1-19 (Affected referent and work scope).
Each assertion or description about a Work occurrence designates the exact Work individual and states a direct work-to-referent relation only when the receiving use needs one. That relation must obtain independently; naming the referent in the episteme establishes neither actual change, production, delivery, acceptance, nor a universal affected relation. When the receiving use needs no such relation, omit it without lowering the Work occurrence.
CC-A15.1-20 (Actual change stays neighboring).
When the receiving claim needs actual change, identify an exact U.Transformation under A.3.4. Connect it to Work only through a declared domain predicate with exact W and T participants, or one C.2.1 local compound claim under A.6.RCD disposition 2 with a recoverable constructor, governed base predicates, actual participants, and case facts; otherwise retain both objects and return missing-governor[work-to-change]. Work can occur without a current transformation claim, and a no-op, evaluation, inspection, communication, or record-handling occurrence is not forced into a delta schema. The inverse also holds: a transformation does not become Work unless an admitted performer system, covering assignment, enacted method, temporal extent, containing system, and F.6 attribution obtain independently. Apply the paired first-use probe to natural change and self-directed action; do not invent an assignment for a causal participant, reject a non-human performer by resemblance, or collapse internal performer and affected positions into a primitive self-relation.
CC-A15.1-21 (Record handling remains Work without automatic transformation).
Copying, formatting, evaluating, or publishing records can be performed by Work individuals admitted under U.Work when the actual performer system, covering assignment, actual enacted method, extent, and containing system are grounded. State an affected referent, binding, or resource-use fact only through its independently obtaining relation when the receiving claim uses it. Identify any actual record or dataset transformation separately under A.3.4; a label, output record, or post-state picture does not establish it.
CC-A15.1-22 (Executed-within declaration).
Each Work occurrence stands in one exact executedWithin -> U.System relation, which an assertion or description about the occurrence may state. When the accountable system is a subsystem in ordinary speech, name the system and its exact part relation to the larger holon. When that system differs from the affected referent, keep both identities separate. If the receiving claim relates the Work to the referent or to a transformation, name that declared predicate, its participants, and the facts that make it obtain; otherwise assert no connection merely from containment or shared timing.
CC-A15.1-23 (No transformation composition from Work mereology).
Exact Work parts support only their declared work-part facts and provide inputs to separately recovered B.1.4 or B.1.6 aggregation claims. They establish neither component transformations, transformation parthood, a composite transformation, nor a parent effect. Recover each actual transformation independently; when a production or effect claim needs unavailable transformation composition, return missing-governor[transformation-composition].
CC-A15.1-24 (No new claims on publication views).
MVPK views about Work project the declared assertion or description of the Work occurrence; 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 cite exact B.1.4 temporal-aggregation or B.1.6 work-resource-aggregation results and policies when showing aggregates. They do not encode aggregation semantics in prose or imply defaults. Optional Gamma notation lives with its recovered Part B aggregation claim; the view carries only pinned references needed by the publication use.
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-occurrence comparison presented on a publication view about Work 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 publication view about Work pin ComparatorSet.edition, comparator-spec edition, and, where conversions occur, TransportRegistry.edition with the selected transport policy ids. When two local senses must be related, cite the exact obtaining F.9 Bridge only as the correspondence premise, state the proposed bounded reuse in a separate C.2.1 claim, and check reliance under A.10 or B.3. A selected reference-plane change remains with CHR and its direct relation; the Bridge transfers neither reuse nor a plane value. 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.
CC-A15.1-30 (Part naming parsimony). Do not create a durable named work part for every interval, telemetry segment, pause, event-log row, engine stroke label, detector component, or encountered wording. Name a work part only when downstream use needs its own resources, evidence, KPI, acceptance, repair, aggregation, cross-context reliance, or source-relation return use. Otherwise lower to a temporal relation, evidence slice, telemetry segment, method-description constituent, missing-source-relation note, or another direct neighboring object.
CC-A15.1-31 (Method and work granularity are coupled but not isomorphic).
A work part may enact a recovered submethod, but the correspondence is not automatic. A temporal work part usually enacts the same whole method during a slice. An episode records continuity under one method or mode and may span several operational parts, repeat the same method fragment, or be split by evidence policy without changing method identity. An operational work part corresponds to a method factor only when that factor is recovered as U.Method under A.3.1 and B.1.5; otherwise keep it as the work part, method-description node, evidence segment, mechanism material, or system-component behavior actually identified.
Work-to-aggregation interface
A.15.1 makes the occurrence-side inputs recoverable without storing them in the occurrence: a separate assertion or description episteme designates exact Work individuals or work parts and states their temporal extents and the separately obtaining resource-use relations selected for aggregation. B.1.4 identifies the temporal-aggregation claim and result; B.1.6 identifies the resource-aggregation claim, ledger, and result. Neither becomes a Work field.
Temporal aggregation return
For utilization, lead time, cycle time, phase coverage, or another temporal roll-up, use B.1.4. Name the exact work refs, carrier or aggregation concern, time window, coverage and non-overlap conditions, aggregation policy, and admissible use there. Union, convex hull, and optional Gamma_time notation are properties of that recovered temporal aggregation, not fields or identity invariants of a Work occurrence.
When the exact B.1.4 result selects the Work-interval profile, retain these use-specific choices:
- Union of intervals for utilization or availability: preserve every covered instant and do not count overlap twice.
- Convex hull
[min t_start, max t_end]for lead time or cycle time: preserve elapsed span from first start to last end, including gaps. - Declared algebraic behavior: for either exact set-based policy, duplicate input is idempotent, input order is irrelevant, and adding intervals cannot shrink the union or hull. If another policy lacks those properties, name it rather than borrowing the union/hull result.
Never switch union and hull silently between KPIs. The formulas above profile a recovered B.1.4 aggregation over Work intervals; the selected B.1.4 claim, not A.15.1, states the temporal result.
Resource aggregation return
For a total or ledger over performed resource-use facts, use B.1.6. Name the exact work refs, typed resource-accounting basis, units, measurement or evidence refs, holon delimitation, time window, overlap or deduplication policy, aggregation rule, and admissible use there. Additivity, allocation, traceability, the aggregate ledger, and optional Gamma_work notation belong to that recovered resource-aggregation claim, not to Work-occurrence identity.
Filled heterogeneous BuildOps route. Published case-local specification BuildOpsResourceUseRelations-v12 declares BuildWorkUsesResource@BuildOps-v12(work, resource, amount, unit, extent) with participant order <work, resource, amount, unit, extent>. Its test requires the named Work actually to occupy or consume the named resource during that extent, with the amount measured in the named unit. Separate case facts state that ReleaseBinary12_BuildWork_2026-07-21T0900_0912 occupied BuildPoolCPU_A for 24 runner-core-minute during 09:00-09:12, and consumed 0.84 kWh of GridElectricity_BuildZone3 within BuildService_A_Delimitation-v12 during the same extent. Those facts make relation occurrences BuildRunUsedCPU_12 and BuildRunUsedElectricity_12 obtain with those exact participant tuples. BuildRunnerAllocationEvidence_12 and BuildZone3EnergyMeasurement_12 support the facts; neither record is the resource use, and neither relation is a field of the Work.
B.1.6 result BuildResourceAggregation_12 : WorkResourceAggregation@Context names concern Build12MeasuredResourceUse, bounded context BuildOps-v12, that exact Work, and the two relation occurrences. It uses typed basis BuildComputeAndElectricityBasis-v12, measures BuildRunnerCoreMinuteMeasure_12 and BuildZone3KWhMeasure_12, evidence refs BuildRunnerAllocationEvidence_12 and BuildZone3EnergyMeasurement_12, holon delimitation BuildService_A_Delimitation-v12, and window 09:00-09:12. Policy BuildResourceRelationDedup-v12 counts each exact relation occurrence once across repeated evidence or a parent/child view. Rule BuildTypedResourceVectorSum-v12 adds only entries of the same resource type and unit. Ledger BuildResourceLedger_12 contributes <BuildRunUsedCPU_12, 24 runner-core-minute> and <BuildRunUsedElectricity_12, 0.84 kWh> and returns Build12MeasuredResourceVector = <24 runner-core-minute, 0.84 kWh> without summing or converting its unlike components. Its admissible use is the measured resource-disclosure input for Build 12; it proves no Work identity, production result, efficiency, cost, sustainability verdict, or acceptance.
When an exact B.1.6 aggregation must allocate shared or overlapping resource use, retain these non-default policy examples:
- Parent attribution: book a declared shared fixed value once at the parent and independently measured variable values at children.
- Pro rata by wall time: divide a declared shared value by relative durations only when that driver is admissible for the resource basis.
- Driver based: allocate by a measured driver such as CPU share, weight, or priority and state the exact allocation rule that uses it.
Whichever policy is selected, add only disjoint or explicitly deduplicated values and keep every aggregate figure traceable to its contributing Work refs and evidence. A policy label alone establishes neither allocation nor ledger value.
A Work publication or KPI may cite either result through the exact E.17 publication-use relation that projects it. It may not recreate an unselected operator, infer an aggregate from parthood, or turn an aggregation record into a Work occurrence.
Work-claim interpretation checks
When another decision relies on a work occurrence, perform three quick checks:
- Method-description interpretation. Does
methodDescriptionRefresolve to the selectedU.MethodDescriptionepisteme under the effectiveU.ReferenceSchemeused by the receiving claim? If the claim also says this is an edition of an earlier description, does the exact C.2.1EpistemeEditionRelationobtain? If two local senses must be related, test an F.9 Bridge and state the bounded use separately rather than treating the reference change as a Bridge. - Performer and assignment coverage. Is the exact admitted
U.Systemnamed as performer the holder of everyU.RoleAssignmentcited by an obtaining F.6performedUnderAssignment(W, RA)attribution, and does each assignment's obtaining extent cover the occurrence or exact performed part attributed to that system? If not, keep the Work occurrence, performer claim, and defective assignment or attribution claim separate until A.2.1 and F.6 admit or repair them. - Evaluation boundary. Has separately performed evaluation or acceptance work applied the selected criterion episteme to the independently obtaining relations involving the Work occurrence, changed subject, measurement results, or delivered entity that the criterion actually requires? If not, no acceptance verdict follows. If yes, keep the evaluation work, result episteme, verdict content, evidence, and acceptance relation separate. Claim edition continuity only when the exact C.2.1 relation obtains.
These checks tell the reader which description, assignment, criterion, evaluation, and relation to cite. They neither create one judgment-context object nor make acceptance part of work identity.
Common Anti-Patterns and How to Avoid Them
- "The log is the performed occurrence." Dumping telemetry without occurrence references (actual performer system, covering assignment, enacted method, time window, and containing system, plus any selected method-description episteme, work-to-referent relation, binding, resource-use fact, or evidence-use relation on which the claim relies) -> Not Work. Recover the Work occurrence and relate the log as evidence.
- Record-handling-as-transformation. ETL, copying, formatting, evaluation, or publication work is treated as proof that a record or dataset changed -> Keep the grounded Work occurrence, but assert actual change only after A.3.4 identifies the transformation and a declared domain predicate with the exact Work and transformation participants obtains; otherwise return
missing-governor[work-to-change]. - Silent cross-locality acceptance. "Ops accepted it, so audit accepts it." -> Name each receiving criterion, evaluation work, and result episteme. Assert acceptance only through that use's declared predicate and actual participants; otherwise return
missing-governor[acceptance]. If the criteria use different local senses, test the F.9 Bridge, state the proposed cross-local comparison or substitution in a separate bounded-use claim, and check reliance; the Bridge itself transfers no acceptance. - Description-change-as-occurrence-change. Selecting another MethodDescription episteme is treated as automatically splitting or preserving Work -> State the description-selection change separately. Only when an accompanying actual history change creates an identity question for a named use should its continuity-policy criterion be applied; the policy revises the judgment, not the occurrence. Call the descriptions editions only when their exact C.2.1 relation obtains.
- Budget on the method. Charging costs to Method or Role -> Attribute performed resource use only through exact relations involving Work individuals; 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.
- Slice-as-episode. A monitoring interval, telemetry window, crank-angle segment, or one-second reception trace is called an episode only because it has timestamps -> Use
TemporalPartOf_work, an evidence relation, or a telemetry relation unless actual boundary events and the direct episode predicate establish an event-bounded fragment for a named use; add a continuity policy only if those facts leave its grouping ambiguous. - Episode-as-new-work by habit. A pause, retune, or interruption is always recorded as either a new occurrence or the same one -> Preserve the boundary events first. Apply exact
workContinuityPolicyRefonly when a named use must decide the grouping; otherwise return unresolved segmentation rather than forcing either answer. - Method-factor-as-work-part by label. A step, stroke, receiver component, graph node, or method-description section is treated as a work part or submethod by name -> Recover the current object:
U.Methodfactor,U.MethodDescriptionconstituent,TemporalPartOf_work,OperationalPartOf_work, evidence segment, mechanism material, system-component behavior, or missing-source-relation note. - Granularity inflation. Every interval or trace row receives a durable work-part name -> Name the work part only when a current resource, evidence, KPI, acceptance, repair, aggregation, cross-context reliance, or source-relation return use hangs on it.
- Union-hull confusion. Changing KPI coverage silently between reports -> recover the exact
B.1.4temporal aggregation and cite its policy per KPI. - Double-count in overlaps. Summing child and parent resource facts as one ledger -> recover the
B.1.6aggregation claim and apply its exact overlap or deduplication policy.
Existing work-log repair applications
- Recover occurrence assertions. For existing logs, identify the independently grounded Work occurrence and write an assertion or description that cites its designator, each actual performer system, the covering assignment and any explicit F.6 attribution, actual
enactsMethod, extent, and containing system. Add optionalmethodDescriptionRefand only those independently obtaining work-to-referent, binding, and resource-use relations on which the receiving claim relies. Do not create Work by creating a record. - Recover the work-judgment basis. Name the direct occurrence facts first. Add exact
workContinuityPolicyRef, effective reference scheme, scope, or qualification window only when the identity, episode, retry, resumption, or aggregation judgment has more than one defensible branch. Keep any selected MethodDescription episteme, aggregation policy, criterion, and evidence-use relation outside the Work. - Record a continuity policy only for an actual ambiguity. Cite exact
workContinuityPolicyRefand its named use when an interruption, resumption, replacement, switch, or composite boundary could support more than one segmentation. If direct facts already close a simple uninterrupted case, omit the policy. - Separate slice, episode, and operational part. Use interval/aspect for
TemporalPartOf_work, event-bounded continuity forEpisodeOf_work, and recovered occurrence-side part plus any separately recovered method factor forOperationalPartOf_work. - Name only useful work parts. If no named resource, evidence, KPI, acceptance, repair, aggregation, cross-context reliance, or source-relation return claim depends on the candidate part, keep it as a relation, evidence slice, or telemetry slice.
- Return temporal roll-up to B.1.4. Cite the exact temporal aggregation and its union, hull, coverage, and non-overlap policy in the KPI rather than recreating it on Work.
- Return resource roll-up to B.1.6. Recover the typed resource ledger, evidence basis, allocation, and overlap or deduplication policy there; each contributing performed resource-use relation remains independently obtaining with an exact Work occurrence as a participant.
- Pull plans out. Keep calendars and planned fillings in exact
U.WorkPlancontent; establish performed values only through direct relations in which the Work occurrence participates and through exact A.6.1 bindings. - Bind actual values directly. For an operation argument or result, name the identified A.6.1 application and its exact binding. For any other participant or parameter, name the declared subject predicate, participant order, and actual values; return the matching missing-governor result when that predicate is absent. Retain MethodDescription defaults and WorkPlan choices as non-actual neighbors.
Consequences
Rationale
U.Work is retained as the admitted kind for dated Work occurrences because performer system, role assignment, method, method description, work plan, affected entity, actual change, evaluation-result episteme, delivered entity, and downstream effect are different FPF objects. One Work individual is the world-side occurrence; each actual performer is an admitted U.System acting under an exact obtaining U.RoleAssignment, and an assertion or description about the work is a separate episteme. The same wording in a source episteme, publication occurrence, method description, or work plan can point to several of these objects, but performed-work claims need occurrence grounding, temporal bounds, actual performer system, covering assignment, enacted method, and containing system rather than a convenient method, assignment, plan, affected-object, or delta label. Add direct work-to-referent, binding, resource-use, or change facts only when their own relations obtain. This keeps work mereology, resource aggregation, and P2W carry-through grounded in what happened.
SoTA-Echoing
SoTA alignment rule. A source tradition counts here only when it preserves the local separations: U.Work is the admitted kind; one Work individual is a world-side dated occurrence; each actual performer is an admitted U.System; the exact obtaining U.RoleAssignment states the role under which that system performs; and an assertion or description about the occurrence is a separate U.Episteme. The occurrence has exact method, temporal, and containing-system relations; work-to-referent, binding, and resource-use relations are added only when they independently obtain. Neighboring change, evaluation, evidence, production, delivery, and acceptance claims remain separate. Historical occurrence modeling is used as lineage only when a current practice still needs those distinctions.
Relations
- Builds on: A.1 Holonic Foundation; U.System; A.2
U.Role; A.2.1U.RoleAssignment; A.2.2U.Capability; A.3.1U.Method; A.3.2U.MethodDescription; C.2.1 for episteme edition and effectiveU.ReferenceScheme; A.2.6 for claim scope; and C.27.TA for temporal qualification. A.1.1 enters only when a separately identifiedBoundedModelUseStructurechanges the receiving work claim. - Coordinates with: A.15 for Role-Method-Work alignment; A.6.1 and the exact direct relation patterns for actual bindings and participants; A.3.4 for independently identified actual transformations; A.15.PROD for local production-work, entity-identity-inception, and production-completion claims; B.1.4 for temporal aggregation and optional
Gamma_time; B.1.6 for work-resource aggregation, ledger discipline, and optionalGamma_work;E.10andE.10.ARCHfor work-wording recovery;A.10,B.3,E.17, andA.15.4for evidence, assurance, publication-use, or appearance-based reliance repair;A.15.5for readiness before performed work; andC.32.P2Sfor carry-through. A permission, gate, result, production, delivery, or acceptance claim remains independent of Work identity. - Informs: reporting and KPI patterns; assurance and evidence patterns that use Work as the reference occurrence; and scheduling patterns that compare exact
U.WorkPlanclaims with independently identified Work occurrences admitted underU.Work.
Didactic quick cards
- What is Work? How it went this time → dated, resourced, accountable.
- Separation aid: Who performs? System. Under which held role? RoleAssignment. Can? Capability. How? Method. Which account of the method? MethodDescription. Did it happen? Work.
- Three-question result check: Did the work occur? What separate result or consequence is claimed? Who judged or accepted what, by which criterion and evidence? Use §4.6 and stop after the last question the receiving use actually asks.
- Roll-ups: A.15.1 supplies exact Work refs, intervals, parts, and performed resource-use facts; cite
B.1.4for temporal aggregates andB.1.6for resource ledgers, each with its declared policy. - Episodes vs retries: record end, interruption, resumption, and later work-entry facts first; add a continuity policy only when a named use still has more than one defensible grouping.
- Resource honesty: relate performed resource use to exact Work individuals through separately obtaining resource-use relations; route any result or consequence through the one matching §4.6 row.
P2W Performed-Work Use Relation
When E.18.1 reaches performed work, identify one Work individual admitted under U.Work, then recover each actual performer U.System, the exact obtaining U.RoleAssignment under which it performed and any explicit F.6 attribution, plus the separately obtaining enacted-method, temporal, and containing-system relations. Add only the actual operation binding, resource use, or work-to-referent relation on which the receiving sentence relies. When P2W continues into a result or consequence claim, select the matching §4.6 row, name the object and facts that row requires, and stop at its stated non-inference or missing-governor result.
A Work occurrence may be designated by an episteme that also cites a U.WorkPlan, exact A.15.3 planned-filling claim, or prior readiness claim as a baseline. For an operation argument or result, cite one identified A.6.1 application and its exact binding. For another participant, premise, resource use, or work-to-referent claim, name the declared predicate, participant order, and actual values; if that predicate is absent, return the corresponding missing-governor result. Do not copy a result or consequence into Work; follow the concrete §4.6 route.
Lowering, Repair, and Refresh Conditions
Lower a candidate assertion that an individual is Work admitted under U.Work when the occurrence designator, actual performer system, covering assignment and any explicit F.6 attribution, actual enacted method, temporal extent, or executedWithin relation cannot be recovered. If the receiving claim additionally relies on a work-to-referent or resource-use relation, lower that dependent claim when its declared predicate, participants, or obtaining facts cannot be recovered. If it relies on an operation argument or result, lower that dependent claim when the identified A.6.1 application or exact binding is absent. Do not lower the Work occurrence merely because an unneeded affected referent or delta is absent. Require a continuity-policy basis only when an identity, episode, retry, resumption, or aggregation claim actually depends on ambiguous segmentation. Lower a candidate work-part claim when the downstream use does not need a named work part or when the candidate is only an interval, event-log row, telemetry segment, method-description constituent, component behavior, mechanism material, or wording cue. The acceptable lowered object is the exact temporal relation, plan episteme, readiness-gap claim, evidence episteme, telemetry slice, method-description reference, unresolved-segmentation note, missing-relation blocker, A.15.4 repair request, or direct neighboring object, not a backdated Work occurrence or gratuitous work part.
Repair the work assertion or description when a subsequent source changes the resolved temporal extent, actual performer system, covering assignment or F.6 attribution, actual enacted method, selected method-description reference, direct binding, resource-use claim, work-to-referent relation, containing system, or work-part relation. Reidentify only when the direct A.15.1 boundary rules decide the change or the selected policy's branch criterion applies to a named ambiguous use. When the selected continuity-policy episteme changes, repair the dependent identity, episode, retry, resumption, or aggregation judgment and cite the newly selected exact episteme. Call it a changed edition only when the exact C.2.1 EpistemeEditionRelation obtains; otherwise record a non-continuing replacement. Neither route rewrites the Work occurrence or its actual history. Repair a result or consequence through the matching §4.6 row rather than editing Work.
Refresh before cross-context model use, aggregation, comparison, measurement, acceptance, 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 about performed work, use the direct pattern for that object or relation and retain a Work-occurrence reference only when the receiving claim actually depends on that occurrence.
A.15.1:End
U.WorkPlan
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
At a glance. Use U.WorkPlan when one exact episteme carries substantive claims for coordinating possible future performed work over a horizon through PlanItem content: intended method, planned window, performer and role conditions, capability-fit requirements, resource budgets, dependencies, commitments, acceptance targets, and a baseline for later comparison. C.2.1 keeps the episteme identity through one already identified present EntityOfConcern. A designator for merely possible future performance remains claim content; it neither designates a dated Work occurrence admitted under U.Work nor becomes another entity merely because it is planned.
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 may be an episteme about intended work but is being treated as a method, method description, performed work, evidence, approval, gate result, publication cue, query-plan representation, or database query-optimizer representation. A system may use U.WorkPlan only when it can state the plan's substantive claims, the existing thing those claims concern, the scheme used to interpret them, and the possible future performance named in the plan content. The episteme itself neither acts nor makes work happen.
First useful object. One exact U.WorkPlan episteme with one present EntityOfConcern, one effective reference scheme, one horizon, and at least one PlanItem content component. For ordinary coordination, that component names the possible future performance or repeated-work subject, target U.Method, planned window, intended performer or role condition, and the resource, dependency, commitment, target, or baseline the current coordination needs. A later fulfilment or variance question is not required for membership or first use; open it only when a receiver asks about one independently identified Work occurrence.
First-use checks.
- Ask what already existing thing the plan coordinates work for, then identify that one present
U.Entityas C.2.1's EntityOfConcern. It may be an exact system, asset, or promise-content episteme. Use the plan episteme itself only when its claims are expressly about its own coordination commitments. Keep a possible future performance, repeated-work family, or proposed group as a plan-content designator. If several existing things have no independently identified joint subject, split the claims or lower the cue; do not use a merely possible Work occurrence as if it already existed. - State the coordination facts the team will act on now: target method, any method-description episteme the plan actually cites, horizon and window, intended performer or role condition, capability threshold, resources, dependencies, commitments, acceptance target, baseline, and effective reference scheme. Call the cited description an edition only when the C.2.1
EpistemeEditionRelationpredicate obtains. If the team plans one particular future participant or operation value and will later compare that choice with actual participation, use A.15.3 only after an exact declaration member defines both its reusable meaning and its later actual-use predicate. Otherwise keep the choice as ordinary plan content; if typed reuse is required but that member or predicate is absent, returnmissing-governor. For an expected effect, name the intended subject and target under the pattern that defines them rather than adding a generic result field. - Ask what claim the schedule-like source actually carries. Intended-work coordination opens
U.WorkPlan; a way of doing or its instructions opens A.3.1 or A.3.2; a dated performance opens A.15.1; a reusable planned declaration member opens A.15.3. Readiness, evidence, a gate result, appearance-based reliance repair, publication use, a forecast or dynamics model, and a declarative representation stay with their named patterns. A ticket, diagram, row, or file is only a cue or representation until one of those claims is stated. - For ordinary coordination, declare only the
PlanItemorganization, constraints, resources, dependencies, commitments, targets, and baseline needed to coordinate the intended work now. Stop this route once the plan is usable at that granularity. Do not choose a future fulfilment or variance policy, A.6.RCD disposition, or relation kind merely to make the plan coordinate work. - Only when a receiver later asks whether one exact Work occurrence fulfilled, deviated from, or remained outside one exact plan item, identify that Work independently under A.15.1 and open section 4.5. Select the smallest A.6.RCD disposition: a one-case local compound assertion for one case; a reusable predicate-definition episteme for repeated semantics that need no occurrence identity; relation-kind admission only for a receiver that genuinely consumes distinct relation occurrences. Unavailable case facts return
missing-information; absent predicate, policy, or relation authority returnsmissing-governor. Neither stop creates a negative claim or universal fulfilment/variance relation.
Ordinary use. For simple coordination, one PlanItem inside one exact U.WorkPlan is enough. For example, a plan about existing Lathe-7, interpreted under FabMaintenanceScheme-E2, can set horizon 2026-07-27, item inspect-spindle, method SpindleInspectionMethod-E2, window 08:00–09:00, intended MaintenanceTechnician role, a one-hour machine reservation, dependency lockout complete, and baseline normal vibration. The team can coordinate tomorrow's rota and reservation from that content and stop. No future Work occurrence, fulfilment policy, variance rule, or relation kind is needed until a receiver asks the later comparison question in step 5.
Reliance-bearing use. Use fuller WorkPlan claim content 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 a system can coordinate the intended work at the needed granularity. If step 3 identifies another claim, use that pattern and make no WorkPlan claim. If no pattern states the predicate needed for a later fulfilment, variance, or occurrence-facing relation, stop only that stronger use; the plan and any local comparison whose predicate and supporting facts can be stated remain usable.
What goes wrong if missed. Teams treat calendars, tickets, reservations, or rollout notes as if work already happened; identify a possible future performance as an existing Work occurrence; let the plan episteme act; or treat a plan as method, evidence, gate result, approval, or publication authority.
What this buys. One identifiable intended-work episteme whose present subject, horizon, windows, intended performer and role conditions, capability-fit requirements, constraints, budgets, dependencies, commitments, acceptance targets, baseline, and later comparisons with independently identified Work occurrences remain inspectable.
Not this pattern when. Not this pattern when the current claim is a dated performed work occurrence (A.15.1), A.15.3 declaration-local planned-filling content, work-entry readiness or full-kit condition (A.15.5), a reliance appearance being used before the governing pattern or relation is recovered (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), a non-agentive forecast or dynamics model (A.3.3), or a declarative representation overread as a work-control or method claim (C.2.P.DR).
Context (plain‑language motivation)
Intended operations are coordinated in time. Even with suitable roles, abilities, and methods, no intended performance begins merely because it is forecast or described: a system must decide when and by whom possible future work is intended, 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 (an individual admitted under
U.Work), or - the state-change model (that is
U.Dynamics).
U.WorkPlan is that missing intended-work episteme.
Problem (what breaks without WorkPlan)
- “Workflow = schedule” conflation. Flowcharts or code are used as calendars; resource clashes and SLA misses follow.
- Plan and occurrence 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, membership, and identity
U.WorkPlan is a same-individual dependent kind under U.Episteme. C.2.1 first identifies exact episteme P by:
A.15.2 recognizes that same P as U.WorkPlan when its ClaimGraph substantively declares coordination of possible future performed work over one exact horizon through at least one PlanItem and, when it contains several items, their plan-content organization. The intended-performance designator may denote one proposed future performance, a named repeated-work family, or one bounded proposed group. It remains claim content: planning it neither asserts the existence of a dated Work occurrence nor makes a merely possible performance into C.2.1's already identified EntityOfConcern.
The present EntityOfConcern is the already identified existing entity that the plan's claims are about: for example, a system, asset, or promise-content episteme for which work is being coordinated. When the plan claims are expressly about their own coordination commitments, C.2.1's reflexive option permits P itself. When the claims concern several entities jointly, C.2.1 still requires one independently identified joint EntityOfConcern; otherwise split the claim content rather than filling the position with a list of unrelated or merely possible referents.
The stable positive membership condition is substantive intended-work content. At least one PlanItem must name its intended-performance designator, intended method or method family, planned window or entry condition, intended performer or role condition, and enough constraints, resources, dependencies, commitments, targets, or baseline to make one coordination decision—for example, reserve a machine, order two items, staff a window, or set the target to be checked later. A calendar picture, ticket title, publication, approval cue, method description, forecast, or list of dates that supplies no such intended-work claims does not gain U.WorkPlan membership by format.
The dependent kind supplies no second identity rule. Changing exact ClaimGraph content, the present EntityOfConcern, or the effective U.ReferenceScheme identifies another episteme under C.2.1. An explicit EpistemeEditionRelation may preserve historical continuity only when its own predicate obtains. Changing only a file path, carrier, layout, publication occurrence, ticket key, or version label leaves identity unchanged when the three C.2.1 discriminators are preserved.
Planned methods, possible-performance designators, performer designations, role conditions, windows, desired fillings, capability-fit requirements, resource budgets, dependencies, commitments, acceptance targets, and expected effects are claim content or separately governed planned claims. They establish no dated work occurrence, obtaining U.RoleAssignment, capability-fit result, actual participant, resource use, transformation, result value, result episteme, produced entity, delivery, acceptance verdict, or downstream outcome.
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 content
A PlanItem is a declaration-local content component in one exact U.WorkPlan, not a U-kind, future or performed work occurrence, method part, assignment, relation occurrence, or result record. Its designator is interpreted inside that exact plan episteme. A receiving episteme may refer to the content component, but the designator or reference does not make its intended claims actual.
Choose only the claims the team will use to coordinate the intended work. The list is an open recognition palette, not a record schema or a kind defined by enumeration. When one row mentions a neighboring relation, state its own participants and predicate rather than treating the row or reference as proof that it obtains:
- Target method and description use — the
U.Methodintended for enactment and, only when one plan claim relies on a particularU.MethodDescriptionepisteme, that episteme and the relying instruction, constraint, or justification claim. Call the description an edition only when the C.2.1EpistemeEditionRelationpredicate obtains. The description neither identifies the method, constrains or justifies it by itself, nor becomes the enacted object. - Planned window or entry condition — earliest start, latest finish, timebox, recurrence, blackout period, or another exact intended temporal condition.
- Intended performer and role conditions — intended holder designation,
U.Rolevalue, role-admission conditions, and, when already obtaining, an exactU.RoleAssignmentintended to cover later work. A proposed holder-role tuple is not an obtaining assignment. - Capability requirement — an exact A.2.2 threshold or
CapabilityFitConditionneeded for work admission. Cite an existing capability claim only when the plan relies on it. The plan neither createsU.Capabilitynor evaluates fit for the later work interval. - Resource budgets and reservations — intended energy, materials, machine windows, money, and exact reservation claims. A planned budget is neither a performed resource-use fact nor a B.1.6 aggregate ledger result.
- Dependencies and commitments — state the source item or commitment, the affected target item, and the condition that blocks, orders, overlaps, or excludes the planned work. A cited gate, approval, source-currentness, or promise claim keeps its own predicate; the citation establishes neither gate passage, approval, promise fulfilment, nor world-side ordering.
- Acceptance targets — name the criterion and target value or window that a later evaluation will test. The target is not the evaluation or acceptance verdict.
- Location, affected-subject, and asset constraints — where a proposed performance is intended to occur and which existing referent it is intended to concern, without asserting actual participation or change.
- Desired planned bindings — use A.15.3 only when the plan intentionally fills one exact participant, argument, or result member already declared by A.6.5, A.6.1, or another pattern that states both the member meaning and its later actual-use predicate. A.15.2/A.15.3 state the intended choice; the declaration states what later counts as actual use. Without that member, keep an ordinary plan choice when typed reuse is unnecessary, or return
missing-governorwhen it is necessary. - Expected effect, result, or delivery target — write the planned sentence with its intended subject and target: for example, the machine state sought, measurement window to be met, entity to be produced, or publication or delivery to be completed. Use the pattern that defines that effect. The broad words
output,result,outcome,deliverable, orhandoffdo not name one plan field or universal kind.
A method description may describe generic participant meanings and intended effects, but it supplies no planned filling by itself. A desired filling remains planned; an expected result or effect remains expected. Neither establishes a dated Work occurrence admitted under U.Work, actual participant, operation application, actual change, returned value, result episteme, produced entity, acceptance verdict, delivery occurrence, or downstream outcome.
Didactic guardrail: No log, telemetry value, performed-work fact, actual participant, or actual result belongs in WorkPlan identity-bearing claims merely because the plan later receives a comparison. Step logic and solver internals remain with the exact Method, MethodDescription, Mechanism, or representation pattern.
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 the text actually states intended work, a horizon or window, performer or role conditions, and enough constraints, resources, dependencies, targets, or baseline to coordinate it. Otherwise use the pattern for the method, instructions, dated Work, evidence, gate, publication use, or representation actually claimed.
Plan mereology (composition of plans ≠ composition of methods or work occurrences)
Keep three separations crystal-clear:
- Method composition admits a composite
U.Methodonly when A.3.1/B.1.5 supplies the submethods, whole-forming relations, and whole-level commitments. - Work organization starts with exact A.15.1 work-part relations. Temporal overlap is an independently governed interval fact under B.1.4, and coordination is a separate direct claim when it obtains. Shared parentage or overlap creates neither a
ConcurrentPartOf_workprimitive nor coordination. - Plan-content organization arranges declaration-local
PlanItemcomponents inside the exact ClaimGraph for coordination. It is epistemic organization, not world-side work or method mereology.
Common plan-content claim families include:
- precedence or dependency constraints naming exact source and target item designators, start or finish conditions, and any prerequisite or gate condition;
- overlap or exclusivity constraints naming the exact scheduling policy and the windows it permits or excludes;
- refinement claims stating which intended-performance designator is preserved and exactly which window, constraint, target, or budget is tightened; and
- alternative claims stating the alternatives and the independently governed condition used to choose among them.
Start with the readable plan constraint—for example, “item B starts only after clearance claim C for item A is current.” Keep that claim inside the WorkPlan ClaimGraph and name the two item designators, the condition, scope, and qualification. A graph edge, row order, or repeated spelling creates no world-side ordering, assignment, resource use, work parthood, or relation kind. If several plans reuse the same parameterized rule, A.6.RCD may supply a predicate-definition episteme. Open relation-kind admission only when a named receiver must distinguish occurrences of that relation; then E.24/E.24.UK and the standalone direct pattern must supply obtaining and identity before A.6.REL is used. If the rule, its source predicates, or occurrence identity cannot be stated, return the corresponding A.6.RCD blocker rather than minting Precedes_pl, MutuallyExclusive_pl, Refines_pl, or another pseudo-kind here.
Didactic rule: A PlanItem does not force an identical work shape. A later one-case comparison with an independently identified Work occurrence remains a separate local plan-use assertion unless an admitted direct relation has actually been supplied.
How WorkPlan meets Work
Ask one concrete question first: “Did Work W satisfy plan item I under policy F?” Identify W under A.15.1, then name exact WorkPlan episteme P, declaration-local item I, and policy episteme F. Check only the independently obtaining facts that F requires—for example, enacted Method, required assignments, and Work extent in the hospital case below. Put the answer in a separate C.2.1 assertion whose EntityOfConcern is P. The assertion neither changes P nor admits a WorkPlanFulfilmentRelation kind.
A positive answer requires every fact in F's positive criterion. State a negative answer only when F contains an applicable failure or closure criterion and the case facts satisfy it. Missing occurrence facts return missing-information; an absent predicate or policy authority returns missing-governor. Neither stop is a negative claim. The assertion keeps W, P, I, F, polarity, and the supporting facts explicit; a matching label, window, ticket, record link, or policy name closes nothing. Several Work occurrences may satisfy different parts of I, or one consolidated Work may satisfy several items, only when F states that mapping. Unplanned Work remains valid Work; a separate assertion may classify it as unplanned for one named variance or improvement use.
If a receiving practice repeatedly needs the same parameterized fulfilment rule but consumes no relation-occurrence identity, use A.6.RCD disposition 3 to publish one predicate-definition episteme with one truthful exact EntityOfConcern, participant meanings, derivation, applicability, polarity, dependencies, and currentness; it is not a RelationSignature or relation kind. Only when a named receiver also needs distinguishable fulfilment occurrences may A.6.RCD return a relation-kind candidate for E.24/E.24.UK admission, a standalone direct subject settlement, and later A.6.REL discipline. Until those requirements are met, return the exact blocker only for the stronger use; do not infer partlessness, deny the local assertion or reusable predicate semantics, or add a universal fulfils edge.
A variance question is handled in the same economy. Use a separate local comparison assertion unless the measurement, evaluation, acceptance, resource, or temporal pattern already states the exact comparison. Name one planned value in exact P and I, one independently established actual value, the comparison method, scale, qualification window, and result. Do not make variance an intrinsic field of a Work occurrence, enter it into P's identity-bearing claim content, or rewrite the plan. Common comparison questions include:
- schedule variance: actual Work extent against the planned window, using the exact temporal comparison and any B.1.4 aggregate needed by the receiving KPI;
- resource or cost variance: exact A.15.1 performed resource-use facts or a B.1.6 aggregate result against the planned budget;
- method variance: actual
enactsMethodagainst the intended method, including an exact substitution claim when the comparison asserts substitution; - description-selection variance: the method-description episteme cited by a named assertion about a Work occurrence or by a separately governed instruction-use claim, compared with the description reference planned earlier; call either object an edition only when the C.2.1
EpistemeEditionRelationpredicate obtains, and do not treat that episteme as enacted; - acceptance-target variance: a separately governed measurement, evaluation, or acceptance verdict against the planned target; and
- assignment variance: every exact performed-work
U.RoleAssignmentagainst the intended holder and role claims.
Manager's view: A plan that cannot support one exact later local fulfilment or variance question is only a calendar picture for that use, not yet a reliance-bearing WorkPlan.
What a good WorkPlan states (review checklist)
Use this as a human-facing recognition palette, not a rigid schema or a definition by enumeration:
- Present EntityOfConcern, horizon, and cadence (for example, the current service system and “W36 surgeries” or “daily ETL”), with possible future performances kept as plan-content designators.
PlanItemcontent components with intended-performance designator, target Method, the selected method-description episteme when one plan claim relies on it, planned windows, and dependencies.- Intended holder and role conditions, any already obtaining assignment reference, and exact A.2.2 capability threshold or fit condition; a proposed tuple or threshold is not an assignment or fit result.
- Safety envelopes, constraints, and other admissibility conditions for planned work.
- Resource budgets and exact reservation claims on assets.
- Acceptance targets with their direct criteria and intended qualification windows.
- Cross-context interpretation boundary: before copying a planned value, target, or verdict into another context, pin both effective reference schemes and resolve the two F.17
SchemeSenseCellvalues. F.9 says only whether their Bridge obtains. A separate C.2.1 claim says whether this exact reuse is acceptable in this direction, under this correspondence rule and tolerated loss; A.10 governs ordinary evidence reliance and B.3 governs assurance-bearing reliance. A negative use claim leaves the Bridge true but stops the reuse; a non-passing reliance result stops or narrows it. Establish any value conversion, target comparison, commitment, acceptance, verdict reuse, plan coordination, or Work claim separately under the pattern that defines it. - Baseline when the receiving comparison needs one. If this plan is being related to another exact plan episteme and
EpistemeEditionRelationactually obtains, name both epistemes and add the change note that makes their attributed difference inspectable. A first plan and a non-continuing replacement carry no such relation; a revision label or change note alone does not create it. - Policy pointers to A.15.1 work continuity, B.1.4 temporal aggregation, B.1.6 resource aggregation, and any exact local comparison policy needed by the receiving KPI.
- Exception question stating how ad hoc or emergency Work will be handled by a local plan-use assertion; use one reusable predicate-definition episteme only for repeated semantics, and require an admitted direct relation kind before claiming fulfilment or exception occurrences.
Archetypal grounding (parallel domains)
Hospital OR day plan (shift rota + cases)
- WorkPlan:
OR_DayPlan_2025-08-12-E3 : U.WorkPlanis one C.2.1 episteme. Its presentEntityOfConcernis exact existing systemOR-Service-System-12 : U.System; its effective reference scheme isHospitalORPlanningScheme-E4; its horizon is2025-08-12T00:00:00+03:00/2025-08-13T00:00:00+03:00. Proposed case performances remain ClaimGraph designators and are not dated Work occurrences. - One
PlanItem:Case_1_Appendectomycoordinates proposed performancePlannedAppendectomy-Case1through the following exact content.
- Later Work: A.15.1 independently identifies
AppendectomyWork-2025-08-12-Case1 : U.WorkwithworkContinuityPolicyRef = SingleProcedureFromAnesthesiaStartToHandover-E1and temporal extent2025-08-12T09:04:00+03:00/2025-08-12T10:21:00+03:00. F.6performedUnderAssignmentobtains forRA-Surgeon-DrK-2025-08-12andRA-Anesthetist-DrM-2025-08-12; A.15.1enactsMethodobtains forLaparoscopicAppendectomyMethod-E2; B.1.4 supplies the exact within-window comparison. The plan created none of those facts. - Named one-case policy:
ORCase1FulfilmentPolicy-E2is one exact C.2.1 episteme about exact plan epistemeOR_DayPlan_2025-08-12-E3, interpreted underHospitalORPlanningScheme-E4. Its ClaimGraph is limited to itemCase_1_Appendectomyand states positive polarity only when the identified Work enacts the target Method, both requiredperformedUnderAssignmentrelations obtain, and its extent lies inside the planned window. It uses only those four facts for this local conclusion, does not travel to another plan episteme, and admits no fulfilment relation kind. - Visible result: C.2.1 assertion episteme
OR-DayPlan-Case1-Fulfilment-Assertion-E1hasOR_DayPlan_2025-08-12-E3as its exactEntityOfConcern; its ClaimGraph namesAppendectomyWork-2025-08-12-Case1, itemCase_1_Appendectomy, policyORCase1FulfilmentPolicy-E2, the four supporting facts, and positive polarity. The result says that this Work satisfies this plan item under that policy. It does not rewrite the plan and does not assert a universal relation. - Nearest false shortcut: a theatre log row carrying key
Case_1_Appendectomyand start time09:04establishes neitherperformedUnderAssignmentnorenactsMethod. Without those independently obtaining facts the local conclusion returnsmissing-information; matching labels and times produce neither negative polarity nor fulfilment. - Edition boundary:
OR_DayPlan_2025-08-12-E3is the first plan episteme used for this day, so this case has noEpistemeEditionRelationand needs no change note. If planners later change its ClaimGraph but establish no edition predicate, C.2.1 identifies a new, non-continuing plan episteme. Reusing the day-plan label or adding aRev-4note cannot turn that replacement into a continuation; a later policy must name whichever exact plan it judges.
Fab maintenance weekend (asset reservations)
- WorkPlan:
Fab_Maintenance_W36is interpreted underFabMaintenancePlanningScheme-E3, has horizon[2025-09-06T00:00Z, 2025-09-08T00:00Z), and concerns already identifiedFab-Production-System-4 : U.System.Tool_42andTool_13remain exact assets named by the PlanItems; they are not an unproved joint EntityOfConcern. PlanItemcontent:Tool_42 chamber cleanunderChamberCleanMethod-E2;Tool_13 calibrationunderToolCalibrationMethod-E1; the ClaimGraph carries an exact exclusivity constraint with production windows under the named scheduling policy, not a reusableMutuallyExclusive_plrelation kind.- Reservations: nitrogen, DI water, metrology window.
- Later local assertion: The exact chamber-cleaning Work occurrence is identified independently as an individual admitted under
U.Work.FabChamberCleanPlanUsePolicy-E1asks whether that Work enactedChamberCleanMethod-E2, stayed inside the planned window, and kept nitrogen use within the reserved amount. A.15.1, B.1.4, and B.1.6 establish those three facts. In this transfer probe they all obtain, so a separate C.2.1 assertion about the plan states positive fulfilment, early completion, and nitrogen underrun. A shared item label or reservation row supplies none of those facts.
Data-center rollout (multi-context plan)
- WorkPlan:
DC_Rollout_Phase-2is interpreted underDCOperationsPlanningScheme-E5, has horizon[2025-09-01T00:00Z, 2025-09-15T00:00Z), and concerns already identifiedService-A-Operations-System : U.System. The Security Audit scheme remains a separate interpretation source used only through the branch below. - Interpretation boundary: Operations uses
DCOperationsPlanningScheme-E5; Security Audit usesSecurityAuditScheme-E4. Their acceptance criteria remain separate; apply the branch in checklist item 7 before proposing any cross-context reuse. - Bridge premise: exact F.17 cells
OperationsReadyCell-E3andSecurityAuditPassedCell-E2participate in F.9 BridgeOpsAuditReadinessOverlapBridge-E1underOpsAuditPartialOverlapProfile-E1. The Bridge obtains aspartial-overlap: both senses exclude a known blocking security defect, while Operations readiness also requires rollback rehearsal and live monitoring and the audit sense applies its own security criteria. - Rejected verdict transfer: C.2.1 claim
AuditPassAsOperationsReadyUse-E1proposes copyingGateDecision=passfrom A.21 gateSecurityAuditGate-E2into A.15.5WorkEntryReadiness@Context, from the audit cell to the Operations cell, by identity transfer and with zero tolerance for omitted readiness conditions. The claim is negative because the two senses do not align on rollback rehearsal or monitoring readiness. A.10 evidence-provenance pathOpsAuditTransferEvidencePath-E1hasRelianceDisposition=passfor that negative claim, so the team retains the A.21 audit decision and evaluates Operations readiness separately under A.15.5. The obtaining Bridge remains true. A narrower plan use may cite the audit decision as one readiness input; it still cannot transfer the verdict. PlanItemcontent:Deploy Service A,Pen-test A; exact dependency and window claims name their predicates and conditions inside the plan ClaimGraph.- Later local assertions: Exact deployment and audit Work occurrences are identified independently as individuals admitted under
U.Work. Separate operations and audit evaluations apply their own targets and produce separately governed verdicts; plan-use assertions state exact local fulfilment and per-context comparison without adding those actual facts to the plan content or creating one cross-context fulfilment relation.
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, a non-agentive forecast, dynamics, evidence, assurance, publication use, appearance-based reliance repair, or declarative representation, apply the direct pattern for that claim.
- Scope declaration: Domain-general where a system is actually coordinating possible future performed work. A tide table, weather forecast, simulation schedule, or predicted natural trajectory is not a WorkPlan unless its claim content also coordinates a system's intended Work. Interpret the plan through its effective
U.ReferenceSchemeand, when the use needs a bounded claim set or model-applicability question, the exactU.ClaimScopeandModelApplicabilityRelationgoverned by A.2.6 and A.1.1. An already identifiedBoundedModelUseStructureenters only when a separate receiving claim or use relation states how that structure changes this plan use and its direct predicate obtains; otherwise omit the structure rather than inventing a context field. Ordinary project, domain, or context wording stays Plain and creates no container or identity field. For cross-context sense reuse, apply checklist item 7. - Rationale: Planning and scheduling become a first-class episteme that systems can use to coordinate intended methods, performer and role conditions, and possible future work without turning the episteme into an actor or the proposal into an occurrence.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
- Future-work-as-entity. Do not use a possible future performance or PlanItem designator as C.2.1's already identified EntityOfConcern or as a dated Work occurrence; keep it in plan claim content until an exact direct entity or occurrence exists.
- Plan-as-actual. Do not treat a Gantt bar, Kanban ticket, shift rota, or calendar booking as performed work; create or cite an exact Work occurrence admitted under
U.Workonly when A.15.1's occurrence basis is present. - Workflow-as-schedule. Do not treat a method description or flowchart as a plan; make a
U.WorkPlanonly when the claims state a present subject, intended-performance designator, horizon, window, constraints, performer or role conditions, and baseline. - Assignment-or-capability-by-plan. Do not treat an intended holder, role, threshold, or capability reference as an obtaining
U.RoleAssignment, capability instance, or fit result for later Work; apply A.2.1/A.2.2 at the exact interval and use. - Budget-as-cost. Do not book planned budgets as performed resource use; establish performed facts on exact A.15.1 Work and any aggregate ledger or allocation under B.1.6.
- Plan-shape overreach. Do not force performed Work to match plan decomposition, infer non-fulfilment from a missing link or unavailable facts, or mint a fulfilment relation from a local comparison. Stop at a positive or governed-negative local compound assertion when it suffices; use a predicate-definition episteme for repeated semantics without occurrence identity; open relation-kind admission only for a named occurrence-facing need.
- Context-bridge overreach. Do not bridge contexts as wholes or use F.9 to convert planned values, commitments, criteria, or verdicts. F.9 relates exact
SchemeSenseCellvalues; apply checklist item 7 for the separate use claim and reliance result before any cross-context plan use. - Evidence-note-as-claim. Do not treat evidence-reference notes, gate-preparation notes, or source-currentness requests as evidence, gate passage, assurance, or release authorization.
- Readiness-or-gate-as-permission. A ready result reports entry conditions and an A.21 gate decision governs its declared crossing; neither institutes permission or performed Work. Recover an exact current A.2.8.PER grant when permission is required.
- Description-as-planned-filling. Do not turn a method-description word such as input or output into a planned slot. Use A.15.3 only when one exact declaration member already states what the value means and what later counts as actual use. Otherwise keep the choice as ordinary plan content or return
missing-governorwhen typed reuse is required. - Expected-as-actual. Do not treat a desired filling, expected effect, output, result, outcome, deliverable, or handoff as an actual participant, change, returned value, produced entity, delivery, acceptance, or downstream effect.
Consequences
SoTA Alignment
Relations
- Builds on: C.2.1 for episteme identity and local assertion identity;
A.15for Role-Method-Work alignment;A.15.1for independently identified performed Work occurrences admitted underU.Work; A.2.1 forU.RoleAssignment; A.2.2 for capability instances, thresholds, and fit conditions; A.3.1 forU.Method; and A.3.2 forU.MethodDescription. - Coordinates with: A.15.3 for planned filling against exact governed declarations; A.6.1 for operation argument and result declarations; A.6.5 for RelationSignature participant declarations; A.6.RCD for the existing-direct/local-compound/reusable-predicate/relation-kind economy; E.24/E.24.UK for any later kind admission; A.6.REL only after an admitted direct or derived relation needs occurrence discipline; A.15.4 for work-relevant appearance-based reliance repair; A.15.5 for work-entry readiness; B.1.4 for temporal aggregation; B.1.6 for performed-resource aggregation; A.10 for evidence-provenance relations; B.3 for assurance; A.20 and A.21 for gates and constraint decisions; C.32.P2S for architecturing-flow references to intended work; E.17 for publication-use questions; and F.9 only for exact cross-context
SchemeSenseCellcorrespondence, with any proposed use and reliance routed through checklist item 7. - Used by: P2W carry-through when principle-to-work reasoning reaches WorkPlanning, and P2S carry-through when architecture-selected structures require intended-work epistemes. Both uses keep present plan subject, possible future performance, readiness, performed Work, actual use, evidence, gate, comparison, result, and downstream effect separately governed.
P2W WorkPlanning use
When E.18.1 reaches WorkPlanning, one exact U.WorkPlan retains its present EntityOfConcern and states possible future performed work over an exact horizon through PlanItem content: intended-performance designators, windows, methods, performer and role conditions, capability requirements, constraints, budgets, dependencies, commitments, targets, evidence-reference notes, and source-currentness requests. If the plan chooses a value for a reusable declaration member, use A.15.3; if it states an expected effect, name the intended subject and target under the pattern that defines that effect.
When the P2W use also needs a readiness question, the WorkPlan may supply target PlanItems, planned preparation tasks, reservations, and planned baselines. A.15.5 carries the WorkEntryReadiness@Context relation that judges full-kit condition, commitment disposition, resource readiness, WIP or flow policy, and any launch-gate references the readiness claim actually cites.
If the same P2W source material also claims performed work, an actual launch value or participant, evidence, gate passage, result, measurement, publication use, appearance-based reliance repair, or refresh, state that claim outside the WorkPlan under the pattern that defines it. The WorkPlan establishes none of them.
Launch-value and actual-use boundary for P2W
For P2W use, U.WorkPlan may state intended holder and role claims, planned values, exact A.15.3 fillings, constraints, reservations, commitments, and evidence-reference notes. A.15.5 WorkEntryReadiness@Context reports whether its stated entry conditions hold. An A.21 GateDecision selects, narrows, blocks, or passes its declared crossing under the exact GateProfile. Neither result institutes permission. If entry also requires permission, name the exact current A.2.8.PER GrantedPermissionRelation@Context for its beneficiary, action, scope, and window; without that grant, make no authorization claim. The plan, readiness result, gate decision, and permission grant make no planned value actual and create no Work occurrence.
At performed-work entry, identify one exact Work occurrence as an individual admitted under U.Work by A.15.1. For an actual relation participant or another world-side value, name the direct relation and its obtaining predicate. For an operation argument or returned result, use A.6.1 only after the exact application and its declaration-local binding predicate obtain. Keep the gate decision, plan claim, Work occurrence, actual-use relation, provenance, change, result episteme, production, delivery, acceptance, and downstream effect separate.
Lowering, repair, and refresh conditions
Lower a candidate U.WorkPlan claim when the reader cannot identify one present EntityOfConcern, the effective U.ReferenceScheme, the horizon, one substantive PlanItem, or its intended-performance designator well enough to coordinate the intended work. Split the claim content when several existing subjects have no one jointly identified EntityOfConcern. The acceptable lowered object is a planning cue, schedule or forecast representation, method-description note, missing-source-relation note, A.15.4 repair request, publication-use cue, readiness-gap note for A.15.5, or evidence-reference note, not a conforming WorkPlan.
When intended method, window, performer or role condition, capability requirement, resource budget, dependency, commitment, acceptance target, baseline, plan-content claim, local comparison policy, or exception policy changes, repair the exact ClaimGraph. If claim content, present EntityOfConcern, or effective reference scheme changes, C.2.1 identifies another episteme. Then ask separately whether EpistemeEditionRelation obtains between the two exact epistemes and name it only when it does. With no earlier plan episteme in scope, the result is a first plan. When another plan episteme is present but the edition predicate does not obtain, the result is a non-continuing replacement. A changed file, carrier, layout, publication, ticket key, revision label, or change note alone establishes neither reidentification nor continuity.
Do not rewrite an independently identified Work occurrence when only the plan changes, and do not make a revised plan evidence that Work occurred. Repair an actual participant, resource use, change, result, production, delivery, acceptance, evidence, or downstream effect under the pattern that defines that claim. When a one-case local fulfilment or variance assertion is no longer enough, use A.6.RCD disposition 3 if repeated predicate semantics are sufficient. Only when a named receiver needs distinguishable relation occurrences does kind admission open; if no truthful occurrence settlement or governing pattern is available, preserve the plan, local assertions, and reusable definition and return missing-governor for that stronger use.
Refresh the selected plan episteme before relying on it for cross-context coordination, budget reservation, release or gate preparation, work-entry readiness, evidence-reference use, performed-work entry, result measurement, or P2W carry-through. If the proposed reuse crosses the two named reference schemes, resolve both SchemeSenseCell values and test whether their exact F.9 Bridge obtains. Then apply checklist item 7 to the proposed use and its reliance result, and re-establish each value, criterion, commitment, or verdict mapping under the pattern that defines that claim. If the refreshed use claims readiness, performed work, actual participation, evidence, assurance, gate passage, result, publication use, representation, or appearance-based reliance repair, use that claim's governing pattern and retain only the intended-work claims here.
A.15.2:End
SlotFillingsPlanItem
Tech-name:
SlotFillingsPlanItemPlain-name: planned-filling plan item Short code:SFPIType: WorkPlanning pattern Status: Stable Normativity: Normative unless explicitly marked informative Placement: Part A -> A.15 work family Builds on:C.2.1episteme identity,A.15.2 U.WorkPlan,A.6.5relation-declaration SlotSpec discipline,A.6.1operation declarations, and the pattern that defines any other target member Used by: plans that must remember a chosen future relation participant, operation argument, expected result, or another value tied to an already declared member before work begins One-line purpose: record inside oneU.WorkPlanwhich value is intended for one already declared member; the declaration defines how later actual use is judged, while A.15.3 records only the intention and makes nothing actual.
At a glance. Use SlotFillingsPlanItem when a plan must preserve a concrete choice before work begins—for example, Robot_8_Ref as the planned holder in a future role assignment or Pump_37_Ref as the planned candidate in a recognition operation. Point to the declaration member that already defines that position, record the planned value and conditions, and later compare them with what actually happened without rewriting the plan. A field name, compatible type, method phrase, form position, or plan label is not such a declaration.
Use this when. Use this pattern only when the choice points to a member already defined in a RelationSignature, an A.6.1 OperationDeclaration, or another declaration whose own pattern states both the member's meaning and the rule for its later actual use. If the plan merely says use this method, reserve this resource, or meet this threshold without reusing such a member, keep ordinary A.15.2 plan content. A planned row establishes no dated work, relation participant, operation application, returned value, change, delivery, or outcome.
First useful object. One PlanItem inside an identified U.WorkPlan with at least one row that names the intended future use, declaration edition, declaration-local member, planned value or designation, and the conditions under which that choice applies. The row follows the member's designation rule and semantic cardinality; it does not redefine either.
Working use order.
- Identify the
U.WorkPlanedition and the future performance being planned. Keep the WorkPlan's already identified present EntityOfConcern unchanged. - Open the declaration that will be used later and choose one member it actually defines. Verify that the declaration's own pattern states both what that member means and what must hold for actual use.
- Record the declaration edition, its local member designator, and the planned value or designation. Do not substitute a description, record, form field, or matching label.
- Apply the member's ValueKind, designation rule, and semantic cardinality. Add conditions and edition pins only when they can change which planned value is effective. State prohibitions, exclusions, and completeness as separate plan claims; omission is not prohibition.
- When the later use occurs, identify the dated work and each actual participant or binding independently. Compare actual with planned under a stated comparison policy; preserve the cited plan instead of backfilling it.
Ordinary use. One row is enough: declaration edition, member designator, planned value or designation, and the condition under which it is intended. The declaration's own pattern must already define the member and its later actual-use rule.
Reliance-bearing use. Add concrete reference kinds, declaration or value edition pins, alternative-selection conditions, target-declared cardinality, and a later comparison policy only when coordination, replay, audit, or work-entry preparation would change without them.
Stop condition. Finish with one of three results. (1) The row resolves to an existing declaration member, and the planned value meets its ValueKind, designation, cardinality, and condition rules. (2) No reusable member is needed, so the choice stays ordinary A.15.2 plan content. (3) Typed reuse is needed but the member, its meaning, its actual-use rule, or the pattern that defines them is missing; return missing-governor for that planned use. Do not invent a SlotSpec, wrapper declaration, generic field, or actual-use relation here.
What goes wrong if missed. A plan silently turns method prose or a schema field into a slot, treats type compatibility as planned or actual participation, treats omission or an empty filler as a prohibition, or later edits the baseline to match what happened.
What this buys. The team can later say what it intended, what actually happened, and whether the two differ, while the declaration, plan, work, and actual participation remain separate objects.
Not this pattern when. Use the declaration's own pattern (A.6.5, A.6.1, or another declared-member owner) when defining the member; use A.15.2 for ordinary intended work without a planned filling; use A.15.1 for dated work; and use the applicable pattern for actual relation participation, operation bindings, methods, evidence, assurance, gates, acceptance, results, publication, or representation.
Context
A work plan may need more precision than use this method or perform this task. An inspection plan may need to remember that Robot_8_Ref is intended for HolderSystemSlot in a cited RoleAssignmentRelationSignature edition. A recognition plan may need to remember that Pump_37_Ref is intended for the declaration-local candidate argument.
The declaration already owns the participant, argument, or result meaning. The WorkPlan owns the intention. A.15.3 joins them only as plan content. It neither changes the declaration nor makes the planned value participate.
Problem
Without this boundary, five failures recur:
- Generic slot creation. Any description field named input, output, role, result, or parameter is treated as a SlotSpec.
- Declaration-family collapse. RelationSignature SlotSpecs and operation arguments or results are placed in one undifferentiated slot schema.
- Plan-as-actual inference. A planned value is treated as an obtaining relation participant or actual operation binding.
- Description-as-declaration inference. A
U.MethodDescriptionthat mentions an input or effect is treated as if it declared a reusable participant locus. - Baseline rewrite. Performed values are copied back into the plan, erasing substitution and variance.
Forces
Solution
What the plan item is—and is not
SlotFillingsPlanItem is a content form inside one U.WorkPlan ClaimGraph. It is not a U-kind, dependent durable kind, U.Relation occurrence, ontic SlotRelation, independent record, or second slot ontology. Its item and row designators have meaning only within that WorkPlan episteme.
C.2.1 and A.15.2 identify the WorkPlan episteme. Changing an identity-bearing row creates different WorkPlan claim content and therefore another WorkPlan episteme. The two are historical editions only if an EpistemeEditionRelation predicate obtains between them; a shared file, label, carrier, or revision order does not supply that continuity. A reference may point to the WorkPlan and this content component, but it gives the PlanItem no separate identity or edition rule.
A planned-filling claim says: for this intended future performance and under these conditions, use this value or designation for this declared member. A.15.2 and A.15.3 state that intention. The member's own pattern still defines what the participant, argument, or result means and what must hold for its later actual use.
The phrase planned filling does not mean that a declaration is filled, a relation obtains, an application occurs, or a value is actually bound. The row is plan content and needs no relation kind of its own. A later claim that the plan was fulfilled, missed, or changed belongs to A.15.2, A.6.RCD, or the applicable comparison pattern.
A planned-filling row states a positive intention. To prohibit or exclude a value, require its absence, or claim the list is complete, write a separate constraint or negative plan claim with its own applicability and polarity rule. Omission, an empty filler, and a negated reference do not express those claims.
Use only members that a declaration already defines
Each row points to one member in one declaration edition selected for the intended future use. First choose what is being planned; then open the pattern that defines that member and the rule for its actual use:
A U.MethodDescription is not a target merely because it mentions inputs, effects, parameters, bounds, or acceptance conditions. Nor does a suite description, kit description, table, schema, card, checklist, interface form, or database field expose an A.6.5 SlotSpec unless a cited RelationSignature actually contains that SlotSpec. Operation arguments and results stay in A.6.1 declarations; planning them does not turn them into A.6.5 SlotSpecs.
One item may contain several rows when they serve the same intended performance, baseline policy, and rule for revising the plan. Each row still resolves to its own declared member. Split the item when those three controls differ. The WorkPlan's present EntityOfConcern remains its C.2.1 identity discriminator; a merely possible future performance does not replace it.
State one planned-filling row
A conforming item contains or resolves these values:
This block represents WorkPlan claim content; it is not an ontic record schema or a second authority for rows. targetMemberFamily is an open local dispatch vocabulary, not a public kind or closed inventory. For an operation argument or result, targetOperationDesignator is required so the member resolves inside the cited mechanism edition; it stays absent for relation SlotSpecs. The memberDefinitionPattern field points to the pattern that defines the member and its actual-use predicate. A.15.3 still states only the plan's intention.
Read the designation rule from the selected member instead of copying it into the plan. An A.6.5 member uses its refMode; an A.6.1 member uses its bindingDesignationRule. A ByRef value must use the concrete reference kind required there and resolve to the declared ValueKind. A generic Ref, SpecRef, stored token, or merely compatible value does not pass.
Use the selected member's semantic cardinality. For a single-valued member, conditions and a resolution rule must make at most one planned value effective for one intended use. Alternatives need conditions and a rule that selects among them; row order supplies neither priority nor exclusivity. A multivalued member keeps the declaration's set, sequence, multiset, repetition, and ordering semantics. If the declaration and cited policy do not decide the needed cardinality, return missing-governor for the member cardinality or selection policy.
Omitting a row says only that this WorkPlan does not rely on that filling. It does not say the value or later participant is absent. Prohibition, exclusion, required absence, and closed-world completeness remain separate plan claims with their own applicability and polarity rules.
intendedPerformanceDesignator names the future use being planned; it does not make a future Work occurrence or entity exist. The enclosing WorkPlan keeps its already identified present EntityOfConcern under C.2.1 and A.15.2.
Add time, location, capability, readiness, gate, evidence, source-currentness, bridge, or publication conditions only when changing one would change whether the planned value applies or which value is selected. Cite the separate claims that establish those conditions. planningConditions points to them; it creates none of them and is not a generic condition bundle.
When a baseline or comparison policy selects a planned value or judges a later match, identify its concrete kind, defining pattern, edition, applicability, and reference scheme. A generic PolicyRef or shared label supplies no policy. Pin a declaration or edition-bearing value only when another resolution would change the planned meaning, and make the target reference and pin agree.
Plan a future relation participant
For a RelationSignature row:
- open the relation pattern and its obtaining predicate;
- choose the
RelationSignatureedition the plan will use; - choose its declaration-local SlotSpec and
SlotKind; - check the planned designation against the SlotSpec's
ValueKindandrefMode; - apply the declaration's semantic cardinality and participant constraints; and
- record the row as a positive intended designation.
The row does not fill the SlotSpec. The SlotSpec remains reusable declaration content. The planned designation does not become the actual participant, and the direct relation does not obtain until its direct predicate is satisfied for independently identified participants.
Plan a future operation argument or result
Open the cited A.6.1 mechanism edition, choose its operationDesignator, then choose the argumentDesignator or resultDesignator. Apply that declaration's ValueKind, bindingDesignationRule, binding predicate, semantic cardinality, and the plan's stated conditions.
The row plans a value; it is not an application or binding. An actual argument binding needs an identified application whose argument-binding predicate holds. An actual result binding additionally needs that application to return the value under the declared result meaning. Type compatibility, an expected result, a method phrase, a ticket value, or a matching token establishes neither binding.
Compare later use without changing the plan
When work actually occurs, identify W : U.Work under A.15.1. Independently establish each relation participant through its obtaining predicate and each operation argument or result through the A.6.1 application-binding predicate. A matching plan row, label, type, or value establishes none of those facts.
If the team must state whether actual use matched the plan, name the comparison policy and the independently established actual facts. A one-off comparison may use A.6.RCD disposition 2 for a local compound assertion. Repeated parameterized comparisons may use disposition 3 for a predicate-definition episteme. Do not admit a comparison relation kind unless a later calculation or decision must refer to repeated comparison occurrences as such; then name that use and follow relation-kind admission. None of these comparisons changes the WorkPlan or creates a universal planned-to-actual relation.
An unplanned participant is still actual when its own predicate holds. To say that a planned value was missing, excluded, or substituted, apply the comparison policy's closure or negative criterion to the case facts. An absent log, unresolved reference, or unavailable fact yields missing-information, not a negative use or variance result; absent authority yields missing-governor.
Preserve revisions and replay
Pin a declaration edition or edition-bearing planned value only when choosing another one could change the planned meaning. Latest, a mutable alias, a publication face, or an untyped policy label is not a reproducible reference.
If the selected declaration member changes before use, revise the WorkPlan claim content. An identity-bearing change creates another WorkPlan episteme; assert historical continuity only when EpistemeEditionRelation obtains. Preserve the earlier WorkPlan reference already cited by work or another actual use, and state substitution or variance separately. A carrier or representation change alone does not reidentify the plan while the C.2.1 discriminators stay fixed.
A card, table, view, index, or generated summary may show selected WorkPlan content under its publication-use pattern. It is read-only: it may not add planned rows, defaults, declaration meanings, cardinality, conditions, or baseline rules.
Archetypal Grounding
Planned holder designation against the admitted role-assignment declaration
An inspection team plans a later role assignment and chooses Robot_8_Ref as the holder system. Plan result: one row points to the cited RoleAssignmentRelationSignature edition and its HolderSystemSlot; Robot_8_Ref : U.EntityRef resolves to admitted Robot_8 : U.System. A.2.1 defines the assignment predicate and occurrence identity, while A.6.5 defines the declaration-local SlotKind, ValueKind, and reference mode.
The row establishes neither a U.RoleAssignment nor actual participation. Later, an affirmative assignment assertion is available only when all four participants are designated and the A.2.1 predicate holds continuously for them. A type-compatible planned holder can therefore remain the baseline while that predicate either fails under a stated negative criterion or cannot yet be resolved.
Blocked near-miss: Bearing_C isPartOf Pump_P cannot supply a relation row. A.6.5:5.2 keeps PartHolonSlot and WholeHolonSlot hypothetical until a part-relation pattern defines their meanings, predicate, applicability, and occurrence identity. Return missing-governor: planned part-relation participant designation for <Bearing_C, Pump_P> or keep the choice as ordinary A.15.2 plan content; do not present the sketch as an admitted RelationSignature.
Planned argument and expected result against A.6.1
A team plans one Pump #37 recognition evaluation. It expects the application to use Pump #37 as candidate and return true if the cited criterion, construction facts, reidentification rule, interpretation basis, and required fastening-relation fact are available and determine satisfaction. The condition reference records that expectation; it makes none of those claims true. Pump37-Classification-Plan-E1_Ref identifies the WorkPlan, HolonRecognitionMechanism-E1_Ref identifies the cited A.6.1:5.7 mechanism edition, and Pump37-ExpectedTrue-Conditions-E1_Ref identifies the separate condition claims.
The WorkPlan carries this copyable planning content:
In that operation declaration, candidate accepts exactly one U.Entity through a U.EntityRef; recognitionJudgment returns exactly one carried-by-value member of RecognitionJudgmentValue = {true, false, unknown}. The rows cite those rules instead of redeclaring them.
Later, A.6.1 identifies Pump37RecognitionApplication-2026-07-21T100000Z. The application binds Pump #37 as candidate, but a required fastening-relation fact is unavailable, so it returns unknown. Comparison result: the plan expected true under its cited conditions; the actual application returned unknown because one availability condition failed. An A.6.RCD disposition-2 local compound assertion may state that comparison from the preserved plan edition, application, result binding, and failed condition. It neither rewrites a row nor admits a universal planned-to-actual relation.
The plan rows themselves identify no application, bind no candidate, return no result, prove no A.1 criterion, create no result episteme, and warrant no claim. Those later facts remain with A.6.1, A.1, C.2.1, and the applicable evidence or assurance patterns.
Hardware-acceptance pseudo-slots rejected
A hardware acceptance method says to use a calibrated instrument, selected reference plane, calibration record or certificate, and threshold. That sentence describes a method; it declares no A.6.5 SlotSpecs. Keep those choices as ordinary A.15.2 plan content, each under the pattern that defines the plane, calibration or evidence reference, and threshold.
Open A.15.3 only when an A.6.1 declaration, a RelationSignature SlotSpec, or another declared member already defines both the position and its actual-use rule. Otherwise return missing-governor for typed reuse; do not wrap the method description or fixture card in a fictitious slot-bearing declaration. Measurement, evidence sufficiency, readiness, acceptance, and actual instrument use remain separate.
Edition-sensitive selector or archive planning
A selector or archive plan may need to preserve a comparator, descriptor definition, distance definition, evidence policy, or another edition-sensitive choice. A suite description, archive card, or generated view does not make those labels declaration members.
If a cited declaration exposes an A.6.1 argument or result, a RelationSignature SlotSpec, or another member whose defining pattern supplies its meaning, actual-use predicate, and cardinality, record one A.15.3 row per chosen member and pin only editions that affect the plan. Otherwise keep the choice as ordinary A.15.2 content or return missing-governor for typed reuse. The later application, dated work, archive or selection result, evidence path, publication, and variance remain separate; the card is a read-only view.
Scope Declaration and Rationale
Scope. A.15.3 records only positive planned designations against declared members inside one WorkPlan. It does not define declarations, prohibitions, negative constraints, work identity, actual participation, applications, comparison results, evidence, readiness, gates, production, delivery, acceptance, publication, or downstream effects.
Rationale. The practitioner gets a reusable planned baseline without another U-kind or universal slot relation. Each declaration family keeps its own member meanings and actual-use rules; A.15.3 adds only the planned choice.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
Planning needs a way to preserve intended values without turning every planning field into ontology. Existing RelationSignature SlotSpecs, A.6.1 operation declarations, and other declarations already define reusable member meanings and actual-use predicates. A.15.3 records only the intended use of those members inside one WorkPlan.
The split is concrete: the declaration pattern defines the member and actual-use rule; A.6.5 or A.6.1 defines its declaration form; the WorkPlan remains one C.2.1 episteme whose A.15.2/A.15.3 content records the intention; and later Work, applications, relation occurrences, results, and comparisons are identified separately. A row cites these objects for planning but constitutes none of them.
SoTA-Echoing
Relations
- Builds upon: C.2.1 and A.15.2 for WorkPlan identity, present EntityOfConcern, intended-performance designators, and intended-work content; A.6.5 for SlotSpecs inside
RelationSignatureeditions; A.6.1 for operation argument and result declarations; and the pattern that defines any other admissible declaration member. - Coordinates with: A.15.1 for dated Work; relation patterns for actual participants; A.6.1 for applications and bindings; A.6.RCD for local fulfilment or variance claims when no comparison relation is already defined; A.15.5 for work-entry readiness; and the evidence, gate, evaluation, result, production, delivery, acceptance, publication, and currentness patterns when those claims are made.
- Does not replace: a declaration, method or method description, WorkPlan, dated Work, actual participant or binding, constraint or negative plan claim, comparison result, result episteme, evidence, gate, production, or publication object.
P2W planned-filling use
When P2W reaches intended work and a planned value reuses a declaration member admitted by 4.1, carry the WorkPlan, intended-performance designator, declaration edition, member designator, defining pattern, planned value, and each condition or pin whose change would alter the effective planned value or later comparison. The declaration pattern defines the member and actual-use rule; A.15.2 and A.15.3 state the intention. P2W creates neither the declaration, plan claim, participant, nor application binding.
If no reusable member is needed, carry ordinary A.15.2 plan content. If typed planned use is needed but the member, its meaning, its actual-use predicate, or its defining pattern is absent, carry missing-governor for that intended use. A planned-filling row does not carry performed work, readiness, evidence, gate, result, measurement, publication, delivery, acceptance, exclusion, or completeness claims. Preserve each separately—for example, A.15.1 identifies performed Work and A.15.5 decides work-entry readiness.
Lowering, repair, and refresh conditions
Use ordinary A.15.2 plan content when no reusable declaration member is needed. When typed use is needed, return missing-governor if the intended-performance designator, declaration edition, member designator, designation rule, cardinality, actual-use predicate, or defining pattern is missing; an operation argument or result also requires its operation designator. Do not replace that blocker with a generic slot-bearing description.
State prohibitions, exclusions, required absence, and completeness under their plan-constraint or negative-claim patterns instead of using omission or an empty filler. A later missing-filler, substitution, or variance result needs a comparison policy whose closure or negative criterion applies to the case facts.
Revise the WorkPlan ClaimGraph when the target member, planned value, intended-performance designator, condition, or relied-on declaration edition changes. If a C.2.1 identity discriminator changes, identify another WorkPlan episteme and relate it to the earlier one only when EpistemeEditionRelation obtains. Preserve the earlier WorkPlan reference already cited by work or another actual use. Refresh only a declaration, reference resolution, policy, or WorkPlan episteme whose changed resolution would alter the later decision; re-evaluate an actual-use change under its relation predicate or A.6.1 application predicate.
A.15.3:End
Work-Relevant Appearance-Based Reliance Repair
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
At a glance. Use A.15.4 when a dashboard tile, credential view, copied approval, generated explanation, publication face, API response, source pointer, or weak indication is about to justify one exact work or reliance use, but that use's governing prerequisite is not yet recoverable. Name the attempted use first. Then add one RequiredPositionEntries row for each independently required direct object; a one-position repair has one row, while a use with several prerequisites keeps them in separate rows. Each row names its direct owner, direct-object kind, native project-side reference, required posture or currentness, and dependency on the attempted use. The repair record does not turn appearances or prerequisite rows into a new umbrella kind.
Use this when. Use this pattern when an acting user is ready to plan, start, continue, stop, or rely because a visible or copied appearance looks approved, current, safe, evidenced, delegated, released, or ready, but one exact attempted use still lacks one or more governing positions. Record every independently required position as its own RequiredPositionEntries row; do not place several patterns, kinds, or project refs into one field.
First output. One compact A.15.4 local repair record:
RequiredPositionEntries is a local row set, not a new record kind, prerequisite U-kind, or generic U.EntityRef list. Every ProjectSideObjectRef uses the native reference form of its DirectOwnerPatternRef; heterogeneous prerequisites remain separate rows.
First repair use in practice. Name what the encountered display, publication face, copied text, credential view, API response, pointer, or indication may safely do now: keep attention oriented, help find the direct owner in the §3 governing-position lookup (including its permission and authority branch when that is the live claim), preserve a weak indication through [A.16.1](/generated/patterns/A.16.1), support planning only through a U.WorkPlan, proceed inside a recovered relation, or block only the unsupported work or reliance claim.
What goes wrong if missed. The reliance appearance starts acting as if it already proves approval, gate passage, evidence, assurance, performed work, currentness, or release authorization. Work then proceeds or stops while the governing pattern position that should carry the claim is missing, stale, revoked, or contradicted.
Primary EntityOfConcern in plain terms. One local repair relation for one exact attempted work or reliance use. It connects the reliance appearance and that attempted use to the smallest set of independently governed prerequisite entries, plus the safe current use and blocked appearance overread. The entries point to existing direct objects; they are not one new umbrella object.
First repair checks.
- Name the reliance appearance's actual kind and publication position without treating its appearance as the governing pattern position or source relation itself.
- Decide the live working moment: early attention to preserve, intended work to plan, reliance on already-performed work or a decision, or another operative relation for action now.
- Fill
WorkOrRelianceUseKindandWorkOrRelianceUseRef: the use being justified can be intended work, reliance on a claim, reliance on a performed-work occurrence, a work-relevant P2W claim, or a P2W chain position. - Create one
RequiredPositionEntriesrow for each independently required direct object. This typed row set is the sole prerequisite set: a claim, instituted effect, gate decision, role assignment, evidence/currentness relation, plan, or other prerequisite each receives its own row. If permission or authority is current, first choose its exact object in the §3 branch, then fill the row's direct owner, direct-object kind, native project-side ref, required posture/currentness, and dependency on the attempted use. Never put comma-separated patterns, kinds, or refs into one field. - Follow dependencies through those direct objects. For permission or authority, use the dependency stated by the selected §3 row. An instituting act, enduring grant, conflict finding, gate decision, and work plan remain separate prerequisites; none substitutes for another row or inherits another row's posture.
- Before allowing the attempted work or reliance, open every prerequisite through its typed reference. Check that the referenced relation actually obtains or the referenced result has the posture its owner requires; that it is current and covers this beneficiary, action, target, scope, and time window; and that any evidence or source relation required for this reliance is present. When a relevant permission/norm conflict exists, give its exact
PermissionNormConflictFinding@Contexta separate row: anunresolvedor norm-selecting disposition blocks this use but does not make the grant cease to obtain. When policy separately requires an A.21 gate or A.15.5 work-entry-readiness relation, give each its own row and require a current passing or ready result. Naming a record is only the first recovery step. If any check fails, keepAllowedUseNowat the safe narrowed use.
Not this pattern when. Stay in A.15 when the question under repair is only U.Role, holder, context, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation. Stay in [A.15.2](/generated/patterns/A.15.2) for WorkPlan construction, [A.15.3](/generated/patterns/A.15.3) for planned slot-filling baselines, and [A.15.5](/generated/patterns/A.15.5) when the question is full-kit condition or work-entry readiness rather than a reliance appearance being used as a reason for work or reliance. Stay in [A.16.1](/generated/patterns/A.16.1) and [C.2.4](/generated/patterns/C.2.4) when the honest current value is pre-articulation cue preservation and articulation level. Stay in [C.16.Q](/generated/patterns/C.16.Q) when dynamic-quality or evaluative wording is the current claim. Stay in [A.6.A](/generated/patterns/A.6.A) when the current claim is action invitation. Stay in E.17 when the question under repair is only publication-face exposure or multi-view publication. When the direct evidence, gate, constraint, boundary, permission/authority, work, or other claim is already known, use the owner selected by the §3 lookup instead of A.15.4.
What this buys. The acting engineer-manager can keep work moving without trusting appearances: use the reliance appearance 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-relation chains often look ready for work or reliance before the record or relation that carries the claim is visible. The practical problem is to decide what an engineer-manager may do now without turning appearance into approval or permission, gate passage, evidence, assurance, performed work, role-assignment currentness, role-state or credential-status currentness, or release authorization.
Plain recognition line. Let the dashboard tile, credential view, copied approval, generated explanation, publication face, API response, or pointer lead to the governing pattern position that must be checked. Do not let the reliance appearance become the relation, slot filler, or project-side reference that authorizes work or reliance.
Reliance-appearance and claim/effect-position discipline. In this pattern, source is not a generic kind. The governing value for the attempted use is the direct object selected by its owner: an actual relation occurrence, owner-defined decision/finding/status result, plan, Work occurrence, or claim about that object. A project record may be a U.Episteme that names the direct object, and a publication relation may expose that record; neither the record nor its display makes the direct object obtain. If no typed reference and owner-defined test can be recovered, keep the appearance at orientation, source-finding, cue-pack preservation, repair request, or bounded-probe use.
Ontological unpacking of the local repair relation. A.15.4 does not introduce U.Source, U.RequiredValue, WorkReliancePremise, a generic cue head, or a generic visible-thing kind. It governs one dependent repair relation among already-governed values:
RelianceAppearanceRefnames the dashboard tile, credential view, copied wording, generated explanation, publication face, carrier, display, API wording, source-finding pointer, or low-articulation indication whose appearance is tempting the work or reliance use. Its actual kind is named separately inRelianceAppearanceKind, so the record can distinguish an episteme, episteme publication, publication face, carrier, display, copied wording, generated explanation, API wording, source-finding pointer, or low-articulation indication without making them one kind. If the live value is a preserve-worthy early cue, useU.PreArticulationCuePackunderA.16.1.WorkOrRelianceUseKindandWorkOrRelianceUseRefname the use being justified: intended work, reliance on a claim, reliance on performed work, a work-relevant P2W claim, or a P2W chain position. These fields select the current branch; they do not create a durable kind.RequiredPositionEntriesis the sole prerequisite set and contains one row per independently required direct object. Every row statesDirectOwnerPatternRef,DirectObjectKind, the owner's nativeProjectSideObjectRef,RequiredPostureOrCurrentness, andDependencyOnAttemptedUse. One row may point to a required claim, another to an instituting speech act, grant, conflict finding, gate decision, assignment, evidence/currentness relation, plan, or other direct object; the row set creates none of them and never turns a claim into an instituted effect.AllowedUseNowstates what use remains admissible after repair, such as orientation, source-finding, bounded reversible probe, narrowed reliance, or proceed-inside-recovered-relation.AppearanceOverreadBlockednames the false use that the reliance appearance would create by appearance, for example treating a dashboard color as gate passage or a copied approval as a current speech act.RecoveryOrStopConditionnames the first failed prerequisite and what must change. Before reopening, follow every typed ref and verify that the relation obtains or the result passes its owner-defined criterion, is current, covers the attempted beneficiary/action/target/scope/window, and has the evidence or source relation required for this reliance. When a relevant conflict exists, its separatePermissionNormConflictFinding@Contextrow must carry a current owner-defined disposition; anunresolvedor norm-selecting result blocks the affected use without changing grant currentness. A named or complete-looking record is not enough.
Here evidence relation, attestation relation, and currentness relation mean A.10 evidence-provenance, attestation, or currentness relations named by value. They are not work-procedure elements and do not carry authorization by their wording.
Problem - 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 a reliance appearance begins to justify a work claim or reliance claim and the team needs to recover the governing pattern position and project-side reference that carry that claim or effect. If the governing pattern and project-side reference are already known, use them directly and keep A.15.4 as the bounded repair relation.
Forces
Solution - Work-Relevant Appearance-Based Reliance Repair
Core stress-case rule
Ordinary local repair record. In ordinary use, do not build a full evidence, currentness, or provenance dossier. The first useful record is:
RelianceAppearanceRef; RelianceAppearanceKind; WorkOrRelianceUseKind; WorkOrRelianceUseRef; RequiredPositionEntries; AllowedUseNow; AppearanceOverreadBlocked; RecoveryOrStopCondition
The reliance appearance may be a tile, credential view, approval-looking memo, generated explanation, copied review, provenance mark, API wording, functional-description publication, or composed source-relation chain. The pattern asks whether every direct object required by the attempted use resolves and meets its owner-defined posture and currentness conditions, not merely whether a project-side reference is named or the reliance appearance is impressive, fluent, easy to inspect, or visually salient.
Conditional governing pattern and position field set. Use the fuller fields below only when the attempted use is release-, safety-, compliance-, gate-, or other high-impact reliance, or when any RequiredPositionEntries row identifies role assignment, credential status, role state, assurance, contested/external/cross-context reliance, currentness, revocation, generated or copied source relation, or another prerequisite whose owner requires those details. Select the depth from the attempted use and typed rows, not from a parallel claim/effect field. These fields are local repair aids, not a new record kind.
Start with the A.15.4 first repair checks above when the reliance appearance is being used as a reason for intended work, reliance, or a work-relevant claim. If the direct question is already known, use the §3 lookup and go straight to its owner; permission or authority uses the single branch there. Use A.15.4 only when the governing pattern position and project-side reference must still be recovered before role assignment, method, plan, work, work result, result measurement, or another work or reliance claim can proceed.
When a reliance appearance seems to authorize work or reliance. Use A.15.4 when a publication, display, credential view, wording, or explanation looks like permission, prohibition, readiness, or evidence for intended work or reliance. This is a recognition moment, not a new kind. The repair question remains: what does the user intend to do next, what claim or effect would make that intended work or reliance admissible, and which governing pattern position and project-side reference are required for it?
Here "authority-looking case" is only a recognition phrase for the encountered situation. The record, relation, slot filler, or project-side reference that authorizes, forbids, records, or carries the required relation is named by value under its FPF pattern. Use E.17:5.1c for the shared meanings of orientation use, reliance use, 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 governing pattern position and project-side reference that carry the required claim, effect, work occurrence, or currentness value; keep the U.Episteme or U.EpistemePublication distinct from publication form, MVPK face, publication carrier, rendering, and source-finding cue; choose the minimum sufficient recovered use; and do not raise the claim beyond the recovered relation, source relation, or recovered use boundary. If a project record names a governing relation, follow its typed ref to the direct owner and test obtaining, required result posture, currentness, scope, and evidence for this attempted use; the record's statement does not make the relation obtain.
Positive repaired disposition. First name the attempted use and open each prerequisite through its typed ref. The appearance may guide that use beyond orientation only after every referenced relation actually obtains or result passes its owner-defined criterion, is current, covers this beneficiary/action/target/scope/window, and has the evidence or source relation required for this reliance. When a relevant permission/norm conflict exists, its separate finding row must be current and settled for this use; an unresolved or norm-selecting disposition blocks the use without rewriting grant currentness. Then write what may happen next. The first failed row keeps only that unsupported work or reliance use blocked.
Reliance dispositions by recovered governing pattern relation:
A small A.15.4 local repair record 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 governing pattern position is incomplete, choose one relation-governed A.15.4 disposition after naming the work or reliance use and the exact direct objects it requires in RequiredPositionEntries; pick the lightest disposition that preserves practical work and recoverability:
- Use the reliance appearance only for orientation or source-finding.
- Reopen the source
U.Epistemefor the current claim, theU.EpistemePublicationthat exposes the claim-bound source relation, register entry, governing record, or governing relation, or refresh source-currentness, credential-status, role-state, context-state, or another currentness relation. - Narrow the acting holder, work-performing system, agent,
RoleAssignmentRefwhen current, requested operation or work class, affected work target, affected resource, affected claim, context, and effective window until the recovered record or relation really covers the recovered use. - Run a bounded reversible probe under an explicit
U.WorkPlanwhen no external-impact reliance is being made. - Ask the holder, work-performing system, maintainer, verifier, issuer, or project role holder identified by the relevant
RoleAssignmentRefor governing relation to expose or repair the missing direct object named in thatRequiredPositionEntriesrow. Keep any additional missing gate, evidence, assignment, state, currentness, or boundary object in its own row. - Repair the
U.WorkPlan,U.MethodDescription, dashboard label, source-relation 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 the required relation.
Repair assignment rule
Missing record or relation repair assignment. If the required governing record or relation is unavailable to the acting user, assign only prospective repair work, request work, decision work, work-plan work, or source-relation gap work to the holder, work-performing system, maintainer, verifier, or project role holder identified by the relevant RoleAssignmentRef or governing pattern relation for the missing relation. The acting user records the blocked work claim or reliance claim, the missing relation, and the safe narrowed use now.
Reliance-appearance kind check. First name the actual kind of the reliance appearance: episteme, episteme publication, publication form, carrier, rendering, dashboard tile, credential view, generated/copied wording, or source-finding cue. If it exposes a typed ref, follow that ref to the direct owner and test the owner's obtaining or result criterion. If it exposes only a face, carrier, wording, or record entry, use it for orientation/source-finding until the direct object and evidence/currentness relation are recovered.
Source-relation guard. Release urgency, delegated-claim urgency, compliance concern, 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 relation, currentness relation, scope, and window.
Governing-position lookup table
Governing patterns by required direct-object 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. Permission and authority branch — use only when that is the live claim. Do not route from approved, authorized, allowed, may, or the look of a permit. Ask what is true now and choose one row.
A gate or readiness result remains an additional A.21 or A.15.5 prerequisite; it creates none of these objects. If the issue is only wording, classify it through A.6 or the single permission-word branch in A.6.B. If only a permit, badge, message, record, or tile is visible, stay at orientation/source-finding until one row above can be supported.
- role-assignment, role-state, credential-status, or context-state reliance: cite
A.2.1,U.RoleAssignment, a state-changingU.SpeechAct, a governing context-state record, a credential proof or credential-status result underA.10, or anA.21GateDecisionwhen the state is gate-governed. - boundary, policy, API, schema, "allowed", "authorized", "approved", "recommended", or "guaranteed" wording: split the statement through
A.6orA.6.B. When its live job is permission or authority, return to the branch above; the displayed word does not choose the object. - 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. - Flow constraint-validity witness: cite
A.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 relation, currentness relation, and relation-governed or blocked use. - assurance, safety, compliance, trust, release confidence, or
R,F,G, orCLincrease: applyB.3and name the typed assurance claim plus its limitations and reopen condition. If the wordreadynames full-kit or work-entry readiness, useA.15.5; if it names a gate decision, useA.21. - 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: use the permission and authority branch above and choose by the plain question it answers now, never by the displayed word.
Recovered governing pattern outputs for A.15.4 closure:
High-impact work or reliance - especially external-impact, irreversible, release-bearing, role-assignment-bearing, role-state-claim-bearing, credential-status-claim-bearing, gate-bearing, compliance-bearing, safety-bearing, delegated, contested, or assurance-bearing claim or effect - may guide work only for the acting holder, work-performing system, or agent, the RoleAssignmentRef when role-conditioned capacity or attribution is current, the 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-side source relation, evidence relation, gate decision, or assurance claim is recoverable. Cue-only, source-finding, learning, and bounded reversible probes stay lightweight and do not require a full evidence, currentness, or provenance dossier.
Quick dispositions:
Archetypal Grounding - 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 relation and currentness relation, it may carry bounded gate-passage reliance for that release scope and window. A claim that deployment happened still requires a dated A.15.1 work occurrence plus the evidence or provenance relation needed for the relying context. If the gate reference 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-position fields for the gate decision, evidence relation, and currentness relation.
Approval memo green-tile case:
An approval memo may carry an approval claim when it exposes the A.2.9 SpeechActRef, acting holder, work-performing system, or agent, RoleAssignmentRef when role-conditioned authority is claimed, affected release scope or work target, judgement context, time, window, publication-carrier refs, evidence refs, and instituted effect being claimed. That carries only the bounded approval use governed by A.2.9. 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 plus any A.10 evidence relation required for the relying context.
Credential-status and role-state green-tile case:
A credential, credential-status, or role-state response is a publication of a claim-bearing register entry, not the status or relation itself. It may serve as authoritative source only when the named register rule identifies the exact entry, issuer, subject/holder binding, relying context, freshness/window, authorized entry-producing Work, and exact direct effect for which that Work is constitutive. The selected direct owner still decides whether that relation obtains or finding is warranted, and A.10 carries the evidence/currentness use. The response never supplies release, Work occurrence, gate passage, permission/authority, or evaluation result merely by being present.
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 pattern position, governing pattern, and project-side reference 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 credential-status or role-state: a visible state label 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 pattern position for the claim or effect, acting holder, work-performing system, or agent, RoleAssignmentRef when role-conditioned capacity or attribution is current, affected work target or claim, context, window, missing or stale source U.Episteme for the current claim, U.EpistemePublication exposing the claim-bound source relation, register entry, or project-side reference; governing FPF relation and, when role-conditioned repair responsibility is current, the RoleAssignmentRef identifying the holder or project role holder responsible for exposing or repairing that missing value, plausible overread, safe disposition used now, and upstream repair work for the source U.Episteme, dashboard, explanation, credential view, boundary wording, publication face, or publication carrier.
Contestability and redress relation: when an authority-looking case affects person or team role-state, credential-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 relation or claim, the holder, maintainer, verifier, or project role holder identified by the relevant RoleAssignmentRef for refreshing or correcting that relation or record, the evidence relation or state-currentness relation to reopen, the safe interim disposition, and the time and window for review.
Lintable overread cues:
Stress cases for practice:
Archetypal Grounding - High-Impact Reliance-Repair 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.
Named-but-revoked grant near-miss. Suppose B17-InterventionGrant and its complete-looking record are present, but policy-valid B17-GrantRevocation took effect before the intervention window. The B17-GRANT entry then fails RequiredPostureOrCurrentness because the grant no longer obtains. A current protocol, plan, GateDecision=pass, readiness result, and green tile do not repair that failure: AllowedUseNow remains source-finding and prerequisite repair, and the intervention stays blocked.
Bias-Annotation
A.15.4 corrects appearance-based reliance. A publication face, dashboard tile, credential view, generated explanation, copied approval, provenance mark, schema wording, or API response can look ready for work before the governing pattern position and project-side FPF reference are named. The pattern keeps the reliance appearance separate from the source relation or other governing relation that carries the claim.
It also corrects over-repair bias. Not every reliance appearance being used as a reason for work or reliance needs a full dossier. The local repair record names the reliance appearance, attempted use, sole typed prerequisite set, allowed current use, blocked appearance overread, and recovery or stop condition at the smallest useful depth selected from that use and those rows.
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-relation 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 pattern position for the requested claim or effect. If that value is missing, lower only the unsupported reliance.
Consequences
Rationale
A.15.4 exists because work often first meets a source expression, source U.Episteme, source U.EpistemePublication, source-bearing relation, or composed source-relation chain through a display, publication face, generated explanation, copied statement, credential view, dashboard tile, schema wording, or API wording before the governing pattern position and project-side reference are visible. The pattern protects work momentum and recoverability together: it lets the practitioner use the reliance appearance for orientation or bounded source-finding, while preventing that appearance from becoming approval, evidence, assurance, gate passage, performed work, release authorization, role-assignment currentness, role-state currentness, or credential-status currentness by appearance.
The pattern is deliberately a local repair relation, not a new authority relation. Once the direct evidence, gate, assurance, role/state, work, publication, boundary, or permission/authority object selected in §3 is recovered, its direct pattern carries it.
SoTA-Echoing
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 cited identity, provenance, policy, and change sources supply currentness, credential-status, role-state, provenance, and change-practice checks. They do not turn a credential, provenance label, attestation, policy response, register excerpt, or dashboard display into work, gate passage, permission/authority, assurance, release, or another project relation. Recover the direct owner through §3 before relying.
The nearest recovery references are the worked dashboard case, the permission and authority branch in §3, CC-A15.4-1, CC-A15.4-2, and the direct evidence, assurance, gate, and work owners named in the governing-position lookup. If a SoTA row cannot be recovered through those local checks, do not let its citation stand in for the local A.15.4 rule.
Relations
- Cluster relation:
A.15.4is a cluster member underA.15for work-relevant appearance-based reliance repair; 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 vocabulary;E.17.EFPfor explanation faithfulness/source-finding;A.16.0for source transfer;A.6,A.6.B, andA.6.Cfor boundary wording;A.10for evidence/currentness;B.3for assurance;A.15.5for work-entry readiness;A.20for constraint validity;A.21for gate decisions;A.2.1for role/state relations;A.15.1for dated Work; andA.2.8,A.2.8.PER, andA.2.9only through the single permission and authority branch in §3. - E.10 and E.10.MOVE relation-selection rule: When source-relation, permission/authority, readiness, role/state, green-tile, generated/copy, provenance, dashboard, or move-like wording is being used as a reason for work or reliance,
E.10.MOVEfirst repairs hidden work-entry/readiness wording andE.10.ARCHassigns the direct evidence, assurance, readiness, gate, constraint, boundary, role/state, work, publication, transfer, or explanation question. Permission/authority uses the single §3 branch.A.15.4starts only while the needed governing position is still hidden by the reliance appearance. - A.15 boundary relation: use
A.15directly when the remaining question under repair is role, method, plan, and work alignment rather than a reliance appearance being used as a reason for work or reliance.
C.29 mathematical-lens use relation
If a mathematical lens appears in work-relevant appearance-based reliance repair, use
C.29only to state why the lens helps expose or bound a reliance appearance 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 reliance appearance, governing pattern position named by value, return or reopen condition, reliance relation, and whether that appearance can guide work under a recovered 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 a reliance appearance such as publication, dashboard, generated explanation, copied statement, provenance mark, schema wording, API wording, or composed source-relation chain is about to justify result-related work or reliance by appearance. No generic WorkResult kind is admitted.
Recover the governing pattern position and project-side reference 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 relation, assurance claim, parity relation, refresh relation, or role-assignment enactability claim. If the governing pattern or relation is missing, use the reliance appearance only for orientation or source-finding and block only the unsupported result-related work or reliance.
Lowering, Repair, and Refresh Conditions
Lower an A.15.4 use when the attempted work or reliance claim, governing pattern position, relying context/window, or one required evidence, gate, assurance, role/state, work, publication, boundary, or permission/authority object selected in §3 cannot be recovered. The lowered use is orientation, source-finding, contested use, bounded reversible probe, repair request, or blocked unsupported claim.
Repair the local A.15.4 record when its appearance, source currentness, revocation, source order, dashboard/credential publication, copied/generated source relation, boundary wording, or work-result cue changes. Repair the recovered value through its direct evidence, assurance, gate, constraint, role/state, work, publication, boundary, or §3 permission/authority owner; A.15.4 does not absorb that owner's repair.
Refresh before allowing the reliance appearance to guide release, safety, compliance, delegated role-assignment or role-state, contested source relation, cross-context reuse, work-result reliance, external-impact reliance, or irreversible work. Stop the refresh at the smallest changed governing pattern value or source relation: reliance appearance, source U.Episteme for the current claim, U.EpistemePublication exposing the claim-bound source relation, governing pattern position, source-currentness relation, role-state record, credential-status record, context-state record, revocation record, gate relation, evidence relation, assurance relation, copied-source relation, generated-source relation, or work-governed relation.
A.15.4:End
Work-Entry Readiness and Full-Kit Preparation
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
At a glance. A.15.5 governs WorkEntryReadiness@Context: the planning and gate-facing relation that says whether intended work is ready enough to enter a work boundary. It uses full-kit preparation, commitment, resource readiness, flow policy, planned slot-filling baselines, and gate refs without treating readiness as performed work.
Use this when. Use this pattern when a team is about to commit, release, launch, or admit intended work and needs to know whether the needed inputs, currentness refs, publication refs, resources, planned fillers, constraints, and gate conditions are ready enough for that work entry.
Primary EntityOfConcern. One WorkEntryReadiness@Context relation for one intended work item, target work plan, PlanItem, or work-boundary concern in one bounded context.
First output. One WorkEntryReadiness@Context record with its FullKitCondition, commitment disposition, prospective direct permission inputs (a current grant occurrence, non-prohibition finding, or permission-conflict finding), and any retrospective exercise/non-violation ref only through PriorWorkEvidenceRefs for a different exact already-dated work occurrence or an explicitly post-launch recheck whose target work is already actual; plus resource-readiness, WIP or flow-policy, planned-baseline, gate, and stop or degraded-use refs when current.
Not this pattern when. Use A.15.2 for the work plan itself, A.15.3 for planned slot fillers, A.15.1 for dated performed work, A.21 for gate decisions, A.15.4 only when a reliance appearance is already being used as a reason for work or reliance before the governing pattern slot, relation, or project-side reference is named, B.1.6 for resource aggregation after work, E.18 for transformation-flow structure, and E.18.1 for P2W carry-through from accepted problem-side material.
Problem Frame
Teams often say that work is "ready", "full-kitted", "committed", "green", "released", or "good to start." Those words can point to different FPF values: an intended WorkPlan, a PlanItem baseline, a performed preparation activity, a gate decision, a source-currentness relation, resource availability, or resulting performed work.
A.15.5 gives the readiness relation one place without importing a management framework object as an FPF kind. Readiness is pre-work-entry unless a recheck after launch or post-launch variance claim is explicitly current. A readiness relation may cite preparation work, but it is not that preparation work and not the target performed work.
Problem
Without a separate work-entry readiness relation:
- Full-kit preparation becomes an attractive umbrella for planning, source relations, gate passage, and performed work.
- A green tile or ready label is treated as a
GateDecision. - A
SlotFillingsPlanItembaseline is overread as evidence that the planned values were actually prepared or used. - Resource readiness is confused with resource consumption.
- A committed item becomes "done" by position in a board, not by dated
U.Work.
Forces
Solution
Represent readiness as WorkEntryReadiness@Context, a dependent relation under the A.15 family and A.21 boundary.
E.24.UK settlement: this pattern does not introduce a root U.Readiness, root U.Move, imported TameFlow MOVE kind, or independent readiness ontic. The selected relation is a context readiness relation over existing values: U.WorkPlan, PlanItem, SlotFillingsPlanItem, intended work kind, target EntityOfConcern, commitment disposition, resource-readiness refs, gate refs, evidence refs, and performed U.Work only when that work has occurred. FullKitCondition is a condition inside this readiness relation, not a separate root kind.
WorkEntryReadiness@Context
The record is filled according to the current readiness claim. It is not a demand to fill every slot. It is a checklist of concerns that must not be forgotten when those concerns are live.
FullKitCondition
Use FullKitCondition when the readiness question depends on what must be known, prepared, reserved, gathered, communicated, or pinned before work entry.
Full-kit preparation can include gathering information, coordinating roles, producing a missing source U.Episteme or source U.EpistemePublication, reserving a resource, pinning a planned filler, or creating shared understanding. Those activities are U.Work only when actually performed. The readiness record cites them; it does not become them.
Boundary with planned fillers and appearance-based reliance. A missing planned value in FullKitCondition stays with [A.15.3](/generated/patterns/A.15.3) as a planned slot-filling baseline or with the direct governing pattern when an evidence, currentness, publication, gate, or assurance relation is already known. Use [A.15.4](/generated/patterns/A.15.4) only when a reliance appearance, such as a dashboard label, copied approval, publication face, or credential view, is being used as the reason to treat the readiness or work-reliance claim as carried before that governing pattern slot or relation has been recovered.
Commitment and Launch Boundary
CommitmentDisposition states the work-entry stance, such as notReady, readyWithKnownGaps, readyForProbe, readyForCommitment, committed, blocked, or requiresGateDecision.
Use A.2.8.PER when a pre-entry readiness check requires a current granted-permission occurrence, non-prohibition finding, or permission-conflict finding. PermissionExerciseRelation@Context and NonViolationFinding@Context require already dated actual work: cite either through PriorWorkEvidenceRefs only for a different exact work occurrence, or in an explicitly marked post-launch recheck only after the target work is actual; the latter is not evidence that the target was ready before entry. Prior exercise or non-violation proves none of a current grant, current capability, future exercise, future non-violation, readiness, gate passage, or target-work performance. Readiness does not institute permission, exercise it, resolve conflict, or turn non-prohibition into a grant; an unresolved current conflict blocks or degrades reliance according to A.2.8.PER. Use A.21 only when a current OperationalGate(profile) consumes declared checks and publishes a GateDecision. A readiness badge, green tile, full-kit label, or commitment board position is not gate passage unless A.21 fields are recoverable; gate passage creates none of the permission objects.
Relation to A.15 Family
Relation to P2W and Pattern Use
When E.18.1 carries accepted problem-side material to a readiness question, E.18.1 names that carry-through relation and cites A.15.5 for the readiness result. When a user needs to know which pattern to use before readiness is current, use E.11.PUR.
Archetypal Grounding - Worked Slices
Fixture Deformation Work
Situation: a cooling-fixture team plans a deformation test. The ProblemCard is accepted, P2W has carried a heat-flow distinction into a work-planning question, and the team asks whether the test is ready to start.
The readiness result blocks target work entry. It does not say the lab test occurred.
Documentation Repair Probe
Situation: an assisting agent can run a reversible documentation probe to find source-currentness gaps.
Use WorkEntryReadiness@Context only for the readiness of the probe or repair work. If the probe is actually run, record the probe as U.Work under A.15.1 and then recheck readiness for the target repair.
Release Screen
Situation: a release dashboard shows a green readiness badge.
If the current claim is "the release gate passed", use A.21 and recover OperationalGate(profile), declared checks, aggregate, GateDecision, DecisionLogRef, scope, currentness, and window. If those fields are not recoverable, the display may be a reliance appearance for A.15.4, an evidence question, or a readiness indication. It is not gate passage by appearance.
Bias-Annotation
- Ready-label bias. A green tile, ready label, release screen, or commitment board position can look stronger than the recoverable claim. Recover whether the current object is readiness, appearance-based reliance repair under
A.15.4, gate decision, work authorization, or performed work. - Full-kit umbrella bias. Full-kit preparation is useful, but it can hide planned baselines, performed preparation work, resource readiness, source currentness, and target work. Keep each current value in its governing pattern.
- Baseline-as-actuals bias. Planned fillers and readiness references do not prove launch values, performed values, variance, or results.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Benefits:
- Teams can inspect work-entry readiness without flattening plan, preparation, gate, resource, and performed-work claims.
- TameFlow full-kitting contributes useful criteria without importing TameFlow
MOVEas an FPF kind. - Gate and work evidence remain auditable because readiness only cites them when they are current.
Costs:
- Some "ready" claims become incomplete until the target work, missing inputs, and stop condition are named.
- A full-kit record may expose preparation work that needs its own plan, currentness, evidence, publication, and resource records.
Rationale
The readiness question is practical and recurrent: should this intended work enter the work boundary now? FPF already has the kinds needed to answer that question, but without a small readiness relation the same words pull in too many objects at once.
WorkEntryReadiness@Context is deliberately dependent. It preserves U.WorkPlan, SlotFillingsPlanItem, U.Work, A.21 gate decisions, B.1.6 resource relations, and A.15.4 appearance-based reliance repair while giving the practitioner one inspectable pre-work-entry record. A readiness record may cite an A.15.4 repair result; it does not turn every missing input into a source problem.
SoTA-Echoing
Relations
- Builds on:
A.15,A.15.1,A.15.2,A.15.3,A.15.4,A.21,B.1.6,E.18,E.18.1, andE.24; consumes currentA.2.8.PERgrant/non-prohibition/conflict refs as prospective inputs, and exercise/non-violation refs only as evidence about different dated work or in an explicit post-launch recheck after target work is actual. - Coordinates with:
E.11.PURfor recommended pattern use before readiness is selected,E.10.MOVEfor readiness wording repair,C.32.P2Swhen readiness prepares work that realizes architecture-selected structures, andA.3.4.Pwhen workflow or process wording is primarily transformation-situation wording. - Does not replace: target
U.WorkPlan,SlotFillingsPlanItem,U.Work,GateDecision,A.15.4local repair relation, resource aggregation, or transformation-flow structure.
A.15.5:End
Production Work, Entity-Identity Inception, and Production Completion Recovery
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
Plain name. Separate production work, when this exact entity first exists, and when production was completed.
At a glance. Production wording often compresses three questions: is this dated Work the whole production Work or only a declared part; when did changes attributed to that Work first make the applicable identity rule true so this entity began to exist; and when did the actual state satisfy the applicable production-completion criterion? This pattern answers each question with a separate local compound relation-bearing claim. It introduces no universal production relation or production-work kind. Call one specification or criterion an edition of another only when their exact C.2.1 EpistemeEditionRelation obtains.
Plain claim-record gloss. A local compound relation-bearing claim is one checkable statement for one selected question, built from already governed facts. It is neither an omnibus production record nor a new relation kind. Whole production work, first existence, and completion therefore remain three separate claims even when they cite overlapping facts.
Problem Frame
Use this when. Practitioners SHOULD use this pattern when work is said to have made, produced, built, assembled, grown, generated, finished, or completed something and the receiving decision needs to know which exact production question is true. They SHOULD prefer it when one work occurrence is nested in larger work, several work parts act concurrently, an entity becomes identifiable before all work ends, or completion is being confused with delivery, acceptance, release, publication, or availability.
Primary EntityOfConcern by selected branch. Production wording is the umbrella. Each application narrows to one exact local claim whose C.2.1 EntityOfConcern is exact currentWork for production-work participation, exact producedEntity after inception for entity-identity inception, or exact productionWork for production completion. When more than one branch is current, each branch retains its own claim episteme and EntityOfConcern; one manufactured union concern is inadmissible.
Primary working reader. A practitioner or modeler responsible for settling one of these production, identity, or completion questions for a current engineering, manufacturing, construction, lifecycle, audit, or scientific use before relying on delivery, acceptance, release, publication, or availability.
Primary viewpoint. The practitioner SHOULD recover the smallest receiver-relevant claim: select one branch, identify its exact EntityOfConcern, and stop when that branch is decided or its exact blocker is known. This pattern is not a form to fill in.
First useful move. The practitioner SHOULD first ask which answer the receiving action or decision needs now:
- Is this dated Work the whole production Work for this use, or a declared proper part of it?
- Which identity rule applies to the candidate, and at what boundary did changes attributed to this Work first make that rule true so this entity began to exist?
- Which completion criterion applies to this production Work, and at what boundary did the actual state satisfy it?
The practitioner MUST NOT answer one question with evidence for another.
What goes wrong if missed. Any work-caused change is called production; an entity is treated as existing before its identity rule first holds; a finishing operation is mistaken for entity creation; a plan, log, post-state picture, or first observation is treated as the change-producing link; and later delivery or acceptance silently rewrites historical completion.
What this buys. Teams can attribute production work at the right work boundary, state when one entity first exists, and preserve historical completion without inventing a universal relation kind. Narrow and larger production readings can coexist through exact work-part relations. Identity, completion, rework, delivery, acceptance, release, publication, and availability remain independently inspectable.
Cross-domain recognition test. These three non-exhaustive recognition situations show that the same three production questions remain separate across heterogeneous practice:
So-what adoption test. Would replacing the separate branch answers by one broad production sentence change what the receiver may rely on, schedule, audit, accept, release, or reopen? If yes, the practitioner SHOULD apply this recovery. If only one already-governed neighboring claim is current, the practitioner SHOULD use its direct pattern instead.
Not this pattern when. Practitioners SHOULD use A.15.1 directly when the only question is what work occurred; A.3.4 when the only question is what actually changed; A.3.1 when the only question is the reusable way of doing; the direct identity pattern when only entity identity is current; or the direct evaluation, delivery, acceptance, release, publication, availability, evidence, or assurance pattern when only that neighboring claim is current. This pattern coordinates those objects only for a selected production-recovery question.
No-mint disposition. Authors and modelers MUST NOT introduce U.ProductionWork as a U-kind. They MUST NOT introduce WorkProducesEntityRelation, EntityIdentityInceptionByWorkRelation, ProductionWorkRelation, or ProductionCompletionRelation as universal relation kinds. The default result is one local C.2.1 claim episteme per selected question under A.6.RCD disposition 2. Repeated use of the same predicate with the same participant meanings in one subject practice may justify one reusable predicate-definition episteme in that practice's owning pattern. Consider a derived relation-kind candidate only when a named later action must refer again to the same obtaining relation occurrence rather than merely reuse the predicate; A.6.RCD and later admission govern that continuation.
Problem
Production speech crosses several ontological boundaries. Exact dated work is an occurrence. An actual transformation is the bounded change of a referent. An identity-specification episteme states when a candidate counts as the entity in question; a named applicability predicate or a filled local claim under A.6.RCD disposition 2 must apply that episteme to the candidate basis, subject context, and boundary. Another specification episteme is a continuing edition only when an exact C.2.1 EpistemeEditionRelation obtains; a similar label, later date, or changed rule does not establish that lineage. Entity-identity inception is the first boundary at which the exact applicable specification's rule becomes true. Production completion is satisfaction of an exact applicable completion-criterion episteme by a subject state at a boundary of exact production work. A measurement or evaluation result is a separately governed value or episteme about its exact concern; it is neither the produced entity nor production completion itself.
These boundaries often differ. A ship can first exist while outfitting continues. A car can already exist before a required nut is fastened. A finished product can later be damaged, delivered, rejected, repaired, republished, or made unavailable. One broad production predicate hides those differences and also hides the exact missing governor when attribution cannot be established.
Forces
Solution
The practitioner MUST choose one of the three production questions, name the Work and the affected referent, candidate basis, or produced entity involved, and gather only the facts that decide that question. The practitioner MUST state each answer as a separate local compound relation-bearing claim and MUST stop or return an exact blocker when a required predicate, criterion, applicability rule, boundary fact, work granularity, or transformation-composition rule is missing. If another person, tool, or later decision must reuse the answer, publish that one claim as a C.2.1 episteme.
Core and branch cut. The common recovery core is receiver-first question selection, exact-object recovery, closure through declared predicates or one local claim selected under A.6.RCD disposition 2, and a deliberate stop. The production-work, entity-identity-inception, and production-completion branches add only their own EntityOfConcern, criterion or boundary, and branch-specific base. One branch neither inherits facts from another nor turns the common method into an omnibus production object. Work identity, transformation identity, subject identity, evidence, assurance, delivery, acceptance, release, publication, and availability remain with their governing patterns.
Split the three questions before recovering evidence
The three claims may cite overlapping facts. They remain different claims because they answer different receiving questions and can have different boundaries, criteria, and truthful C.2.1 EntityOfConcern values.
Recover the smallest exact base
The practitioner MUST use only objects needed by the selected branch:
A method description, work plan, objective, commitment, product specification, evaluation result, or publication enters only when a named predicate or filled local claim connects it to the selected Work, entity, or claim and omitting that connection would change the named action or decision. Otherwise keep it separate. None is constitutive of every production occurrence.
Select one production-work branch
Whole-work branch. currentWork = productionWork is admissible only when that exact dated Work enacts productionMethod; the method states its intended production effect; a named applicability claim applies the method to this case's inputs and conditions; the named work-to-change predicates obtain for the exact Work and transformations; and the identity or completion criterion that decides the selected question is named and applicable. A familiar broader production label establishes no parent work.
Proper-part branch. Exact currentWork is admissible as a proper part of exact productionWork only when OperationalPartOf_work or another exact A.15.1 work-part relation with fitting occurrence semantics obtains. Interval overlap or concurrency is asserted separately and establishes neither parthood nor coordination. The containing Work must likewise enact the production method; the method must state its intended production effect; a named applicability claim must apply it to the containing case; the named work-to-change predicates must obtain; and the identity or completion criterion that decides the selected question must be named and applicable. A shared label, project membership, common referent, temporal containment, overlap, or adjacency in a plan establishes no work parthood.
The two branches can support different bounded uses. A nut-fastening occurrence can be the whole production work for a narrowly bounded finishing operation and also a proper part of a larger car-production occurrence, provided each local claim names its exact extent, criterion, and work relation. productionWork is a relation-defined reading of one Work occurrence admitted under U.Work, not an intrinsic kind.
Ground actual effects without inventing transformation composition
The practitioner MUST first recover every actual transformation independently through A.3.4: changed referent, exact extent or formal boundary, boundary conditions, actual before/during/after facts, and continuity or reidentification rule. The practitioner MUST then name the declared domain predicate for each exact Work-to-transformation pair, state its participant order, and show the case facts that make it obtain. If no one direct predicate suffices, use a local compound claim selected under A.6.RCD disposition 2 only when its constructor, governed base predicates, actual participants, and case facts are recoverable. If neither route is present, keep the Work and transformation separately and return missing-governor[work-to-change]. Temporal overlap, a common changed referent, a delta expression, a log record, or a post-state picture does not establish the link.
One transformation identified at the resolution needed by the production claim establishes neither presence nor absence of finer transformation parts. Work parts, method parts, samples, temporal subdivisions, concurrent changes, and flow representations do not establish transformation parts or a composite transformation.
If the selected production claim uses only independently identified transformations, continue without a composition claim. If it asserts positive composite-transformation identity, transformation parthood, or transformation holonhood and no accepted governor supplies that basis, return the exact missing-governor blocker. Composite identityClosingWork under A.15.1 does not cure that blocker and does not imply an isomorphic composite transformation.
Recover entity-identity inception
Definition: A15PROD-D1 (Entity-identity inception). Entity-identity inception is the boundary at which exact producedEntity first satisfies the identity rule stated by exact productIdentitySpecification and a named applicability predicate or filled local claim applies that specification to the candidate basis, subject context, and boundary. Plain: when this exact entity first exists. inceptionBoundary is a case-local boundary designator, not a second technical term, claim kind, or relation kind.
For this branch, the practitioner MUST complete all five steps:
- recover exact
productIdentitySpecificationas one C.2.1 predicate-definition episteme in the subject pattern that states the identity rule. Before inception, the governed question remains about exact work, method, actual effects, that specification episteme, and its candidate basis; no futureproducedEntityparticipant exists; - recover the named applicability predicate or filled local claim that applies that specification episteme to the exact candidate basis, subject context, and candidate
inceptionBoundary, together with the exact actual effects of exact work and the declared links by which those effects bear on that rule; - find the earliest exact
inceptionBoundaryat which the rule in that applicable specification episteme becomes true and designate the resulting exactproducedEntityonly on the after-side of that boundary; the pre-inception candidate basis remains distinct from that entity; - identify exact
identityClosingWork, using the one closing work occurrence when it exists or, for jointly necessary concurrent or nested work parts, their exact composite work under A.15.1 and its declared work-part relations; and - publish a positive local inception claim only after exact
producedEntityexists and the claim names exactproductIdentitySpecification, its named applicability predicate or filled local claim, exactidentityClosingWork, exactinceptionBoundary, and all declared work-to-change and change-to-identity predicates or compound bases.
A published local inception claim MUST be indexed by the exact specification episteme and applicability basis used at inceptionBoundary. A later specification episteme does not silently rewrite that earlier claim. If an exact C.2.1 EpistemeEditionRelation connects the two specifications, the lineage can trigger refresh of a current dependent use, but the later specification still needs its own applicability basis at the boundary being judged. Without that relation, treat the later object as a non-continuing replacement and evaluate it independently. Changed applicability yields either a separately qualified claim under its new exact basis or an exact blocker; it does not move the earlier indexed boundary.
A delta expression, method description, work plan, log, post-state image, identity-rule episteme, or first observation establishes none of those links by itself. Absence of recoverable work granularity for identityClosingWork yields a work-granularity blocker. Several incomparable minimal work composites yield several local inception claims; narrative simplicity supplies no rule for selecting only one.
Regulated-identification boundary. A persistent identifier is not an inception criterion. A current subject practice that allocates an identifier at build or registration while keeping allocation separate from entity status supplies designation and continuity only. First existence requires a separately applicable subject-identity rule; its absence yields the exact identity-governor blocker. An assigned number does not make the candidate basis the after-side entity.
Recover historically indexed production completion
A production-completion claim designates:
- exact
productionWork; - exact
completionBoundaryinside or at the end of that occurrence; - exact
productionCompletionCriterionepisteme applicable to that occurrence at that boundary; - the named applicability predicate or filled local claim that applies that criterion episteme to the production Work and boundary; and
- the actual boundary-state facts and the criterion predicate they satisfy at that boundary.
Completion is historical. Later damage, loss, destruction, delivery, rejection, acceptance, release, publication, or unavailability does not erase an earlier true completion claim. A later or replacement criterion episteme does not rewrite the earlier claim, whether or not an exact C.2.1 EpistemeEditionRelation connects it to the criterion used then. Rework or later production work that satisfies an applicable criterion at a later boundary receives a separate local completion claim.
Entity-identity inception and production completion remain separate claims even when they share a boundary. The identity-specification episteme says when this exact entity first exists only together with the named applicability predicate or local claim that selects its candidate basis, subject context, and boundary; the completion-criterion episteme says when the separately applicable production requirement was satisfied. A later evaluation-result episteme may support either assertion under a direct evidence-use relation, but it creates neither the boundary nor the subject state.
Past work, entity-identity inception, and production completion remain addressable after later destruction or evidence decay. A later assertion carries its own evidence currentness and reliance status. The produced entity, measurement or evaluation result, delivered entity, acceptance verdict, release, publication, availability, and downstream effect remain separately governed objects and claims.
Practice-specific completion criteria stay local. In current NASA systems-engineering practice, product implementation or integration, verification, validation, and product transition are distinct processes; a local completion claim therefore names the exact tailored product-layer criterion and does not substitute transition or delivery for verification or validation. In current Scrum practice, the applicable Definition of Done is a product-specific quality-state criterion and an Increment is born when a Product Backlog item first meets it; Sprint Review and release remain separate. These practice answers can supply an exact criterion or boundary only in their own applicability context. They supply neither the exact A.15.1 work occurrence nor a cross-domain universal completion rule.
Publish local claims, not an omnibus relation
The default A.6.RCD disposition is local compound relation-bearing claim. For an ordinary positive answer, the practitioner MUST:
- name the receiving action or decision, state what it must decide, and select one production question;
- recover the exact participants, direct predicates, applicability facts, and boundary facts needed by that question;
- state the smallest readable conjunction of those governed facts and the one answer it supports, or return the exact missing-information, missing-governor, criterion, applicability, work-granularity, or boundary-state blocker; and
- keep any durable answer in one truthful C.2.1 episteme with exact claim content, one exact
EntityOfConcern, and an effectiveU.ReferenceScheme, then stop without introducing a relation kind, relation signature, or relation occurrence.
This ordinary positive branch does not require the practitioner to name a substrate document, constructor, hidden-witness policy, polarity algebra, or ordered-boundary operator. It requires the governed facts and a readable answer. Open author-side semantic replay only when A.6.RCD:4.2 requires a substrate pin—nontrivial, interoperability-facing, proof-bearing, high-consequence, or reusable use—or when the current negative claim or first-satisfying-boundary claim actually depends on negation, witness, ordering, or earliest-boundary semantics.
Branch constructor semantics for the triggered replay. These are branch-local claim constructors, not a universal production algebra:
For DPF or FPF authoring and every other pin-triggering use, the responsible author or modeler MUST name the exact selected substrate and edition and replay its constructor inputs, output claim, applicability, hidden witnesses, polarity law, and temporal policy. A negative or earliest-boundary claim MUST recover the specific negation, witness, ordering, or selection semantics it consumes even when no broader replay is needed. If no current substrate supplies semantics that the claim actually requires, return the exact missing-substrate blocker. A.15.PROD supplies no fallback operator.
For an ordinary positive result, the truthful EntityOfConcern is usually exact currentWork for production-work participation, exact producedEntity for entity-identity inception, and exact productionWork for production completion. A modeler MUST split claim content that cannot truthfully concern one exact entity and MUST NOT manufacture a union concern from work, method, transformations, criteria, evidence, and receivers.
Repeated use within one subject practice may justify one predicate-definition episteme in the pattern that owns those participant meanings. Consider a subject-specific derived relation kind only when a named later action must also refer again to the same obtaining relation occurrence. The subject definition must then state obtaining, applicability, base dependencies, recurrence, and occurrence identity. A.6.RCD governs that continuation; A.15.PROD admits no such kind by itself.
Separate recognition from assurance
Recognition branch for ordinary work. The practitioner SHOULD ask only three questions:
- Which is current: did this Work count as production work, when did this exact entity first exist, or when was production completed?
- What happened, to which existing referent or pre-inception candidate basis, and at what boundary? If first existence is current, which entity exists only after that boundary? Name only the Work or work part, method, transformations, identity rule or completion criterion, declared predicates, applicability, and boundary facts needed to decide that question.
- What one readable answer do those facts support, and what should the receiver do next? If one deciding fact or governor is absent, return its exact blocker instead of opening the other production questions.
A positive local answer can stop at that readable conjunction. It does not require substrate vocabulary. Open only the specific semantic replay needed when the answer is negative, when first existence requires an ordered earliest-boundary judgment, or when A.6.RCD:4.2 triggers a substrate pin. The practitioner MUST stop when the local answer is readable and grounded and MUST NOT fill the rest of this pattern as a record.
Assurance branch for authors and high-consequence use. Authors and high-consequence users MUST additionally replay the exact work identity and part relations; the actual enactsMethod relation; method applicability and intended production effect; every work-to-change and change-to-identity predicate; every criterion-applicability and boundary-state satisfaction fact; the exact identity-specification and completion-criterion epistemes; the named applicability predicate or filled local claim for each episteme at its claimed boundary; any separately current C.2.1 EpistemeEditionRelation; positive and discriminating cases; C.2.1 identity; evidence-use relations; and the explicit transformation-composition non-inference. DPF and FPF authors MUST record the selected substrate and edition when A.6.RCD:4.2 requires a pin, and MUST expose direct base predicates, applicability, hidden participants, polarity law, boundary domain and ordering, witness policy, and any earliest-boundary rule used by the claim. Assurance may warrant reliance on the claim; it does not constitute work, change, entity inception, or completion.
Assurance scope by use. A modeler whose declaration or model carries one local claim MUST check exact claim content, one truthful EntityOfConcern, reference scheme, participants, declared predicates, polarity, and boundary indexing. A practitioner or conformance reviewer MUST verify that the three-question first move reaches either one grounded local answer or one exact blocker and then stops. A pattern author or reviewer MUST also replay the worked and discriminating cases, neighbor-authority boundaries, checklist, and no-mint disposition. None of these assurance uses widens the recognition claim or adds a world-side production fact.
Run the recovery sequence and stop deliberately
Ordinary sequence. The practitioner MUST stop at the first grounded answer or exact blocker:
- name the receiving action or decision and select one production question; if several are current, handle them one at a time as separate claims;
- recover only the exact Work, work-part, method, affected-referent, transformation, identity-specification or completion-criterion, applicability, and boundary facts needed by the selected question;
- select the whole-work or proper-part branch when production-work participation is current;
- state one readable conjunction and its positive answer, or return the exact blocker naming the missing fact, governor, applicability basis, criterion, work granularity, or boundary state; and
- if another person, tool, or later decision must reuse the answer, publish it as one local C.2.1 claim episteme; otherwise keep the readable answer local, then stop. Open delivery, acceptance, release, publication, availability, result, evidence, assurance, or relation-kind questions only when the named action or decision asks one of them; none follows from the production answer.
Triggered author replay. Continue beyond the ordinary sequence only for an A.6.RCD:4.2 pin-triggering use or when a negative or earliest-boundary answer consumes additional semantics:
- name the branch-local constructor and, when a pin is required, the exact substrate and edition; expose only the constructor inputs, applicability, hidden-participant or witness policy, polarity law, boundary domain and ordering, and temporal rule that can change this answer;
- for entity inception, verify the ordered candidate-boundary domain and earliest-satisfying rule; for a negative claim, verify the applicable negation law; for completion, keep the claim indexed by its criterion, applicability basis, and boundary;
- if one required operator or substrate is unavailable, return the exact missing-substrate blocker rather than lowering the absence to a negative production answer; and
- stop after the author replay returns the same ordinary answer or blocker.
Pattern NameCard
This NameCard names the recovery pattern, not a relation kind. It uses F.18's expanded identity-bearing form with a direct local-sense claim because no separately recoverable F.17 SenseCell is current for this local naming settlement:
Archetypal Grounding
Car 42 and the required nut
In this case, Car 42 already satisfies its identity rule before NutFasteningWork-42. A.3.4 identifies Car42FastenerAttachmentTransformation, the change in the fastener, torque, and attachment facts that occurred during the dated fastening Work. That transformation concerns the same continuing car; it does not bring Car 42 into existence.
For a narrowly bounded finishing use, NutFasteningWork-42 can be the whole productionWork when its fastening method is applicable, case-local predicate FasteningWorkChangedAttachment@Car42(work, transformation) obtains for that Work and Car42FastenerAttachmentTransformation, and the completion-criterion episteme applies at the fastening boundary. For the broader factory use, the same occurrence can be a proper operational part of CarProductionWork-42 under an exact A.15.1 part relation. First satisfaction of the applicable completion criterion at the fastening boundary yields a local completion claim; prior completion instead classifies the Work as later rework, repair, or maintenance. The verb fasten and the presence of a car decide none of these claims.
Cold-practitioner replay. Ask only whether NutFasteningWork-42 completed the narrowly bounded finishing work. In this fixture the fastening Work occurred under the applicable method, the method was meant to make the required attachment, FasteningWorkChangedAttachment@Car42(NutFasteningWork-42, Car42FastenerAttachmentTransformation) obtains, and the car satisfied the finishing criterion at the fastening boundary. The readable answer is: this Work completed the required fastening for this finishing use at that boundary; it did not bring Car 42 into existence. If the fixture instead supplies only a torque result and temporal overlap but no declaration or obtaining fact for that predicate, return missing-governor[CAR42-FASTENING-WORK-TO-CHANGE] and stop. The practitioner needs no constructor or substrate vocabulary for either result.
Author-side replay of the same result. Car 42 predicate-definition episteme Car42FasteningPredicates-v1 declares FasteningWorkChangedAttachment@Car42(work, transformation) with participant order <work, transformation>; the stipulated Work and transformation facts make the named call obtain. Exact local assertion-substrate edition Car42-Claims-v2 then defines typed conjunction over the named work identity, method enactment, applicability, affected referent, work-to-change predicate, criterion, and whole-work or proper-part claim. The narrow positive case closes because every conjunct applies to that receiving use. In the discriminating failure, the same edition receives only a torque result and temporal overlap but no work-to-change predicate; conjunction semantics cannot manufacture the missing conjunct, so the branch returns the same exact missing-governor blocker rather than a negative production claim. Car42-Claims-v2 is a case-local substrate-edition designator, not a new FPF kind, relation kind, or required universal language.
Incomplete but identifiable Ship 27
In this case, exact ship-identity specification episteme SHIP-ID-2 states the hull-closure rule. Local applicability claim ShipIdentitySpecApplies-2 applies it to exact candidate hull basis Ship27-HullBasis, exact yard context Yard-27, and the ordered candidate boundaries ending at inceptionBoundary. Exact hull-assembly work can close that specification's rule at inceptionBoundary while outfitting, software installation, trials, and commissioning continue. The resulting inception claim concerns when Ship 27 first exists and remains indexed by SHIP-ID-2 and ShipIdentitySpecApplies-2.
Continuing edition and lineage-aware refresh. Yard identity-governance system YardIdentityGovernanceSystem performs exact revision Work ShipIdentityRuleRevisionWork-2R under obtaining role assignment ShipIdentityRuleReviserAssignment-2R; that Work enacts ShipIdentityRuleRevisionMethod. C.2.P recovers the source expression hull assembly closes Ship 27 identity in SHIP-ID-2. Case-local source-use predicate usesAsRevisionSource(work, sourceEpisteme) is declared, and its case facts make usesAsRevisionSource(ShipIdentityRuleRevisionWork-2R, SHIP-ID-2) obtain. SHIP-ID-2R has a separately recovered C.2.1 identity and ClaimContent hull assembly plus installed propulsion closes Ship 27 identity. The enacted method treats this exact source use and claim-content replacement as a superseding revision within the maintained ship-identity specification line. Those performer, method, source-use, and content-change facts satisfy C.2.1's historical-continuation predicate. Relation occurrence ShipIdentitySpecEdition-2-to-2R : EpistemeEditionRelation therefore obtains with exact participants <SHIP-ID-2, SHIP-ID-2R>; the work and its basis do not become relation participants. A receiving use that follows this lineage refreshes to SHIP-ID-2R, then re-evaluates that exact episteme's applicability at the boundary it now judges. The relation preserves the revision lineage; it carries forward neither the old applicability fact nor a new inception boundary, and it does not rewrite the claim already indexed by SHIP-ID-2.
Non-continuing replacement. SHIP-ID-3 is another exact specification episteme, but this fixture establishes no EpistemeEditionRelation from SHIP-ID-2 or SHIP-ID-2R to it. A later date, similar ship terminology, and use by the same yard do not make it an edition. A use selecting SHIP-ID-3 must establish its applicability independently and publish a separately qualified claim or exact blocker; lineage-based refresh cannot substitute it for either earlier specification. Thus the continuing edition reopens dependent current uses through the named lineage, while the non-continuing replacement opens a new applicability question without altering earlier claims.
Exact author-side substrate edition YardIdentityHistory-v3 defines time-indexed conjunction over the named work, applicability, actual-effect, work-to-change, change-to-identity, and identity-satisfaction claims plus earliest selection over its declared ordered candidate-boundary domain. The positive replay returns exact boundary tI because SHIP-ID-2 is false at every earlier candidate boundary and true at tI; exact work and transformation witnesses remain named. In the discriminating failure, a snapshot substrate can conjoin facts at tI but supplies no ordered boundary domain or earliest-selection law. That substrate cannot establish inception even if a later image satisfies the rule, so the branch returns the exact missing-substrate blocker rather than treating first observation as first existence. The example adds no universal earliest operator or arbitrary minimal-work selection.
An IMO ship identification number may designate Ship 27 and remain stable across later flag, name, ownership, or type changes. The current IMO integrated scheme nevertheless states that number allocation does not define ship status. The number therefore supports regulated designation and continuity only; it neither supplies SHIP-ID-2 nor proves inceptionBoundary. If the receiving use cannot recover a separate applicable ship-identity rule, the inception branch returns the exact identity-governor blocker.
A larger exact production-work occurrence contains the identity-closing work and later work through declared A.15.1 part relations. Production completion occurs only when Ship 27's actual state satisfies the applicable completion criterion at completionBoundary. Delivery, class acceptance, and operational release remain separate. The sentence the yard produced Ship 27 is admissible only after the writer names the intended Work occurrence or extent and says whether the claim concerns Work participation, first existence, or completion.
Nested and concurrent attribution
Factory work may contain project work, subassembly work, identityClosingWork, and completion-closing work. Every selected work-part relation remains explicit. Jointly necessary concurrent work parts use exact composite work under A.15.1. Two incomparable minimal work composites yield two local inception claims, each indexed by its exact identity-specification episteme and applicability basis. Nested or concurrent attribution creates no additional inception occurrence, and none of those work compositions establishes transformation composition. The identity-specification and completion-criterion epistemes remain cited by the local claims; each applicability basis remains its named predicate or filled local claim; and any C.2.1 edition relation between such epistemes is separate. None is a work participant.
Pressure adjustment without entity inception
A dated pressure-adjustment Work occurrence may enact an exact pressure-adjustment method, while A.3.4 independently identifies a pressure transformation. Open a positive Work-to-change claim only when the subject practice supplies a named predicate with Work and transformation participant positions and the case facts make that predicate obtain; otherwise keep the two occurrences separate and return missing-governor[pressure-work-to-change]. If the affected vessel or process already exists and no production-completion criterion is current, even the positive route closes as work plus actual change, not as production work, entity inception, or completion.
PumpSkid assembly before PumpSkid identity
Mounting, wiring, fluid-connection, and whole-configuration changes may each be independently identified under A.3.4, and exact work parts may be grounded under A.15.1. The PumpSkid inception claim may proceed only when a named applicability predicate or filled local claim applies the exact PumpSkid identity-specification episteme to the candidate configuration and boundary, and named Work-to-change and change-to-identity predicates obtain for the actual participants and case facts. A missing applicability or link returns its exact blocker. A claim that additionally requires positive composite-transformation identity or transformation parthood stops at missing-governor[transformation-composition]; Work or method decomposition supplies no proof of transformation decomposition.
Completion persists after later destruction
In this case, exact production work satisfied criterion episteme PC-3 at boundary tC, and a later accident destroyed the product. Exact author-side substrate edition CompletionHistory-v1 defines boundary-indexed conjunction over production-work identity, applicability of PC-3, and the governed subject-state facts at tC; it does not apply an earliest operator. The positive replay therefore retains the historical completion claim at tC, while the destruction is a later transformation. In the discriminating failure, an unindexed current-state predicate or later completion certificate supplies no satisfiedAt(tC) constructor semantics. That substrate returns the exact missing-substrate blocker for the historical claim rather than moving completion to the certificate or current state. Current evidence, availability, replacement work, acceptance status, and insurance decisions remain separately governed.
Non-agentive biological synthesis
A spontaneous reaction or biological growth process may be independently grounded as one or more actual transformations under A.3.4. The transformed biological, chemical, or physical referent may itself be a U.System; that fact neither makes it the performer nor supplies production work. If no exact performing System holds the performer position in an obtaining U.RoleAssignment and is grounded as enacting an applicable method in one dated Work occurrence admitted under U.Work, A.15.PROD opens no production-through-work claim. Retain the transformed referent and transformations. Evaluate entity identity only with the biological practice's named identity predicate; if no such predicate is available, return the exact identity-governor blocker. Batch B17, a sample label, first observation, or process record supplies none of the performer-side basis, work identity, or production attribution.
If an exact performing System holds the performer position in an obtaining role assignment, enacts a method in dated Work, and a named applicability claim applies that method to this biological case, the relevant A.15.PROD branch may open. Entity-identity inception still needs the applicable identity-specification episteme plus named Work-to-change and change-to-identity predicates or filled local claims; production completion still needs its applicable criterion episteme, boundary, and criterion-satisfaction facts. The same observed growth can therefore support an actual-change claim while the production-work claim remains blocked; the transformed referent remains present in either result and is not erased when the performer-side basis is absent.
Scrum Increment before review or release
In this case, the current Scrum Guide and one exact organizational Definition of Done episteme govern a software-product use. When exact Product Backlog item PBI-84 first satisfies that applicable Definition of Done at boundary tD, exact Increment-I84 is born under that practice; work that does not meet the Definition of Done is not part of the Increment. Multiple Increments may exist before Sprint Review, and the review is not a release gate.
A.15.PROD may therefore use the exact applicable Definition of Done episteme as the branch-specific identity and completion criterion at tD, while keeping Sprint Review, delivery, and release separate. The guide does not identify the exact A.15.1 Work occurrence, performer-side basis, actual effects, or work-to-change links. Missing independently obtaining relations involving the Work occurrence, that criterion episteme, or its applicability to PBI-84 yields the corresponding work, criterion, applicability, or boundary blocker rather than a production inference from a Sprint, ticket, review, or release label.
ReleaseBinary 12: complete build-to-inception replay
BuildOps asks one question: when did exact ReleaseBinary_12 first exist? Verification, transfer, release, deployment, publication, and availability are not part of this answer. The fixture uses one affected referent and one transformation; it does not hide an unnamed effect chain.
Ordinary replay. The runner performed the named Work under the applicable build method. The named work-to-change predicate connects that Work to the store-population transformation; the named change-to-identity predicate says that this transformation made the applicable binary-identity rule become true first at 09:11. The readable answer is: ReleaseBinary_12 first exists at 09:11 through this build Work; decide completion and later uses separately.
Nearest failing variant. Keep every fact above, including the result binding, store transformation, work-to-change predicate, identity specification, applicability, ordered boundaries, and the state that satisfies the identity rule at 09:11, but remove only the declaration and obtaining fact for StorePopulationClosedBinaryIdentity@BuildOps-v12. The exact result is missing-governor[RELEASE-BINARY-CHANGE-TO-IDENTITY] for <ArtifactStorePopulationTransformation_12, ReleaseBinaryIdentitySpec_v12, BuildOutputBasis_12, 09:11, ReleaseBinary_12>. A timestamp, completed write, or builtBinary binding cannot replace that missing change-to-identity predicate.
Author-side replay of the same result. Case substrate ReleaseBinaryInceptionClaims-v1 defines a time-indexed conjunction over the named Work, performer basis, method applicability, the performed storeWrite application fact (not the later result binding), affected referent, transformation, work-to-change predicate, identity specification, applicability claim, and change-to-identity predicate. Its declared ordered boundary domain is 09:00-09:12 and its earliest-satisfying rule returns 09:11, so the positive replay yields ReleaseBinary12InceptionClaim. In the failing variant the same constructor lacks exactly the change-to-identity conjunct and returns missing-governor[RELEASE-BINARY-CHANGE-TO-IDENTITY], exactly as the ordinary replay does. These case-local predicates and this substrate introduce no universal production, work-to-change, or change-to-identity relation kind.
Bias-Annotation
Scope limitation and five-lens coverage. These annotations cover the three production-recovery branches and their named neighboring claims; they do not classify production language outside a current A.15.PROD use. Gov covers criterion, applicability, and historical-authority errors; Arch covers branch, neighbor-owner, and omnibus-relation errors; Onto/Epist covers work, change, entity, claim, record, and publication distinctions; Prag covers receiver-first selection, useful stops, and exact blockers; and Did covers the familiar verbs, visible final steps, labels, and records that make the overreads plausible.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
In the selected cases and declared receiving uses, no need for a universal production relation kind has been demonstrated. Each current question closes through declared predicates, the case facts that make them obtain, and one branch-local claim or exact blocker. This is a bounded current parsimony result, not proof that every production relation is reducible or that no irreducible production-relation fact can occur in another subject practice. The bases vary across manufacturing, construction, biology, software, formal work, and epistemic production; local compound claims preserve those subject differences and expose a missing predicate instead of hiding it behind a broad relation name.
A later subject practice reopens A.6.RCD when several named claims reuse the same participant meanings or when a named later action must refer again to the same obtaining relation occurrence. Repeated predicate use alone stops at a reusable predicate-definition episteme. A derived-kind candidate additionally states obtaining, applicability, base dependencies, recurrence, and stable relation-occurrence identity. A primitive candidate additionally requires failed lossless derivation, one action-facing distinction lost by every accepted derivation, and independent receiving uses. A.15.PROD records the present no-mint disposition but neither forbids nor pre-admits a later subject-specific derived or primitive relation kind.
The three-question split also preserves time correctly. Work may begin before an entity exists and continue after it first exists. Completion may occur at inception or later. Delivery, acceptance, release, publication, and availability may occur later still. Keeping each boundary and criterion separate gives practitioners useful historical claims without treating every neighboring event as part of production identity.
SoTA-Echoing
Current Scrum, maritime-identification, and NASA systems-engineering practice supplies three narrower operational answers for identity or completion boundaries. Manufacturing-information, product-information lifecycle, event-log, constructional-ontology, and provenance sources remain useful comparators with different and explicitly limited roles. None of these traditions supplies one universal production ontology or a cross-domain answer to every A.15.PROD branch.
FPF synthesis scope. The three-claim decomposition is an FPF-scoped architectural hypothesis for receiver-specific production recovery, not a claim that the cited traditions share one production ontology. The SoTA-bearing rows below govern only their named practice branches. No current primary source in the reviewed set answers the cross-domain A.15.PROD:4.3 question of when exact Work is the whole production Work or its proper part; that branch remains a bounded FPF hypothesis built from A.15.1 Work identity and the case's declared work-part, method-applicability, Work-to-change, identity-applicability, and completion predicates or filled local claims. A subject domain that demonstrates a different best-known answer, failed lossless derivation with an exact action-facing loss, direct obtaining and applicability laws, independent receiving uses, recurrence, and stable relation-occurrence identity reopens the affected branch and A.6.RCD continuation.
The practical source-use result is visible in the Solution, checklist, and cases: Scrum supplies a Definition-of-Done boundary without review/release collapse; NASA systems engineering supplies a tailored realization criterion without transition/delivery collapse; and IMO supplies stable designation without status/inception collapse. The remaining comparators constrain information and evidence overreads. None supplies the still-hypothetical cross-domain whole/proper-part production-work answer.
Relations
- Builds on:
A.15.1for exact work identity, work parts, concurrency, and continuity;A.3.1for production method, intended effect, and applicability;A.3.4for independently identified actual transformations and the transformation-composition stop;C.2.1for local claim and predicate-definition epistemes; andA.6.RCDfor disposition, derivation, blocker, and any subject-specific continuation. - Coordinates with:
A.1and the subject-specific pattern that states the candidate's identity rule and applicability;A.15.2for plans that remain distinct from work;A.15.6for project and process wording recovery;G.11when a pinned base definition, substrate edition, or applicability settlement changes; and the declared work-to-change, characteristic-state, evaluation, evidence, assurance, completion-criterion, delivery, acceptance, release, publication, availability, and refresh predicates or patterns selected by the current case. - Informs: production attribution, manufacturing and construction histories, biological and informational entity inception, rework analysis, product-lifecycle records, completion audits, and P2W or P2S continuation when the receiving action or decision asks one of the three recovered questions.
Lowering, Repair, and Refresh Conditions
An ordinary production-work claim lowers when exact Work identity, enacted method, method applicability, intended production effect, affected referent, work-part relation, named Work-to-change predicate or filled local claim, shared applicability, or the deciding receiver criterion is missing. An inception claim lowers when its exact identity specification, named applicability predicate or filled local claim, identity-closing Work, actual effects, named Work-to-change and change-to-identity predicates or compound bases, or exact after-side entity cannot be recovered; a claim that this is the first satisfying boundary additionally needs an ordered candidate-boundary domain and earliest-satisfying rule. A completion claim lowers when production Work, applicable criterion, its named applicability predicate or filled local claim, boundary, actual boundary-state facts, or criterion-satisfaction predicate is missing. An ordinary positive claim does not lower merely because no substrate document is materialized. A negative claim needs the selected substrate's applicable negation law, and a pin-triggering or earliest-boundary use needs the constructor, witness, polarity, or time semantics it actually consumes; absence of those required semantics yields the exact missing-substrate blocker. Punctuation, a project, plan, label, result record, log, certificate, or publication supplies no substitute.
A maintainer MUST repair only the affected local claim when later information changes work identity or parthood, a direct work-to-change fact, the exact identity-specification episteme or its applicability basis, the exact completion-criterion episteme or applicability relation, a boundary state, a relied-on base-predicate edition, or the selected substrate edition or constructor semantics. An earlier inception or completion claim remains indexed by the exact specification or criterion episteme and applicability basis used at its boundary. An obtaining C.2.1 EpistemeEditionRelation can trigger lineage-aware refresh of current dependent uses but does not rewrite that claim; a non-continuing replacement opens a new independent applicability question. A later transformation, delivery, acceptance, release, publication, or availability claim does not by itself repair or invalidate an earlier production claim.
A relying practitioner MUST refresh an earlier claim after a change to its exact identity-specification episteme or direct applicability basis, completion-criterion episteme or applicability relation, any relied-on C.2.1 EpistemeEditionRelation, relied-on base-predicate edition, selected substrate edition, constructor semantics, witness or hidden-participant policy, polarity law, temporal policy, work-continuity policy, evidence basis, reference scheme, claim scope, or receiving use. Follow an obtaining edition relation only to discover the continuing later episteme, then re-evaluate that episteme's applicability for the current use. Treat a replacement without that relation as a new identity and do not carry forward lineage or applicability. Refresh claim currentness and reliance separately from the historically indexed occurrence, exact specification or criterion episteme, applicability, and boundary facts.
A maintainer MUST reopen source binding only for the branch whose practice answer changed: a changed Scrum Definition-of-Done rule reopens the software-Increment branch; a changed NASA realization, verification, validation, or transition rule reopens the affected systems-engineering completion use; and a changed IMO identification rule reopens regulated ship designation and continuity, not a generic entity-inception claim. A new source that actually answers cross-domain whole/proper-part production-work attribution reopens section 4.3 and the FPF synthesis hypothesis. A changed comparator reopens only the information, evidence, analogy, or lineage boundary it supports unless a direct subject rule also changes.
A.15.PROD: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 language-state move without pretending that one downstream governing pattern has already taken over.
First output. A small typed language-state 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 language-state move is reopen, backoff, respecify, or 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 transfer responsibility 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 responsibility-transfer 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.
In this pattern, move is a local term for a typed language-state publication transition over governed U.Episteme publication forms. It is not a general project move, pattern-use recommendation, work-entry readiness relation, performed work, or work plan. When source prose uses move-like wording outside this local language-state scope, restore the project concern through E.10.MOVE and then use E.11.PUR, A.15.5, A.15.1, A.15.2, or the direct governing pattern named by value.
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 responsibility transfer 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 work-boundary crossing or responsibility transfer 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 transfer, bridge entry, or 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 and 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 responsibility-transfer 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, andE.10.MOVEwhen move-like source wording is not a local A.16 language-state publication transition. - 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 does not justify retyping 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 responsibility-transfer 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 transfer; - 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 responsibility transfer 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 responsibility transfer 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 responsibility transfer 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 chain 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 hidden-lineage laundering
If an endpoint claim depends on prior move publications that are not visible anywhere in the publication chain, reviewers should assume hidden-lineage 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.
Use this when. Use this pattern when a local language-state move is no longer enough because the history of governed U.Episteme publications, branches, retirements, losses, or responsibility transfers must be visible as one reviewable account.
What goes wrong if missed. Readers treat a sequence of cue packs, routed cue sets, endpoint-bound publications, and responsibility transfers as one magically moving publication; forks, losses, authority changes, and work-requiring crossings become implicit.
What this buys. One optional trajectory account that records lineage, position claims, move kinds, publication forms, losses, and next governing responsibility without wrapping every local A.16 move in heavy history machinery.
Problem frame
In engineering, inquiry, operator, and management practice, teams sometimes need more than a local move note. When branch structure, supersession, retirement, responsibility transfer, 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 responsibility transfer 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?
E.24.UK settlement
U.LanguageStateMoveTrajectory is retained as a dependent durable trajectory-account U-kind under the language-state settlement, not as a root U-kind. Its filled trajectory-account instances are values whose identity depends on the governed U.Episteme publication lineage, the declared U.CharacteristicSpace from C.2.2a, and the lineage relation set that makes the account reviewable. The public name is therefore admissible only with this dependence relation; ordinary local histories, route notes, and publication forms do not become U.LanguageStateMoveTrajectory by resemblance.
Ontological subject and slot groups
In this cluster, keep six slot groups 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 responsibility-transfer 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.
Here route names an A.16 move-family label or a typed upstream publication-form cue. It is not an action route, work sequence, workflow, or transformation-flow path.
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, responsibility transfer, 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 transfer 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 responsibility-transfer 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 a non-endpoint position.
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 transfer
A trajectory does not need to terminate in order to be useful. What matters is a visible docking milestone or responsibility transfer 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 responsibility transfer.
After such a responsibility transfer, 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 work-boundary crossing or responsibility transfer 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.
The word move remains inherited from A.16 and means a typed language-state publication transition. A.16.0 does not generalize it into project action, work-entry readiness, pattern-use recommendation, performed work, work plan, workflow, or transformation-flow path. If source wording uses move-like language outside the language-state trajectory account, restore the concern through E.10.MOVE before selecting E.11.PUR, A.15.5, the A.15 work family, or another direct governing pattern.
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 responsibility-transfer 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 condition.CC-A.16.0-7Work-requiringformalizeoroperationalizesteps SHALL expose the relevant work-boundary crossing or responsibility transfer 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 and form collapse. Treat governing patterns as if they were publication forms. Repair by naming the pattern-governed form and the governing pattern separately.
- Form and face collapse. Treat seam publications as if they minted a second MVPK face family. Repair by naming form and face separately.
- Multi-route and 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 responsibility transfers 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 responsibility-transfer 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 responsibility transfers 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, andE.10.MOVEwhen move-like wording is not a language-state trajectory-account claim. - 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 responsibility-transfer conditions.
Operator trajectory with retirement
An operator alert note about a service disturbance may move:
notice -> stabilize -> route -> projection -> operationalize
If later evidence no longer supports one route, 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.
Practitioner check
A practitioner 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 work-boundary crossing or responsibility transfer 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 responsibility transfer 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.
Use this when. Use this pattern when the first honest publication is a preserve-worthy cue nucleus that should remain visible before it becomes a claim, selected route, method, work record, anomaly statement, or endpoint-governed publication.
What goes wrong if missed. Early cues either vanish, become vague "signals", or get promoted too soon into route decisions, claims, evaluations, methods, invitations, or work records.
What this buys. One admissible preservation form for low-articulation but meaningful cue content, with enough witness, anchor, and route-candidate discipline for later successor publication without pretending the endpoint already exists.
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, 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 claim, or premature reliance-possibility claim.
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.
E.24.UK settlement
U.PreArticulationCuePack is retained as a dependent durable publication-form value under the U.Episteme and language-state publication settlement, not as a root U-kind. Its governed identity is the preservable cue-pack form for pre-threshold episteme content. A cue, trace, witness, anchor, route hint, carrier, or local note does not become this value merely because it appears inside a pack.
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 provide anchor material for 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 B.4.1 route publication 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 Practitioner Checks
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?
Practitioner check
A practitioner 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 or signal language
Source prose often says merely "there is a signal" or "something suggests possible work". 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, this pattern no longer governs the publication by itself; open the pattern that owns the later claim.
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 corroborate or enrich 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 successor-publication consequences. Practitioners 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 successor-publication consequences are published explicitly.
Worked Cue Complexes and Practitioner 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.
Practitioner test for under-specified packs
A practitioner 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.
Practitioner test for covert endpoint capture
A practitioner 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 carry into B.4.1 route publication 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.
Practitioner Check Matrix and Migration Tests
A practitioner 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
B.4.1route publication will be distorted.
Migration from loose 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.2 KD-CAL and the A.19/C.16 characterization stack; 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 A.19 CharacteristicSpace, A.19.CHR, and C.16 MM-CHR, which carry measurable property templates and 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)
Type: Kernel characteristic-space and dynamics-typing pattern Status: Stable
Use this when. Use this pattern when the current object is the declared CharacteristicSpace itself: characteristics, scales, value sets, coordinate slots, optional overlays, comparability boundaries, normalization boundaries, missingness, and the U.Dynamics.stateSpace hook.
What goes wrong if missed. Teams compare raw numbers from different scales, treat dashboards or scores as the space, hide thresholds inside state labels, smuggle method sequences into checklists, or give consumer patterns their own private space kinds.
What this buys. One declared space that makes state, threshold, comparability, normalization, and dynamics-typing claims inspectable without turning A.19 into a scoring, dashboard, evidence, gate, or evaluation pattern.
Problem frame - 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 admissibility gates for numeric operations. A.19 may cite those patterns, but it does not govern their mechanism vocabulary.
Reader orientation sequence 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; - admissibility 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.
E.24.UK settlement. U.CharacteristicSpace is retained as the root durable value for a declared multi-characteristic space. Its slots bind U.Characteristic values to scale/value-set declarations under A.17 and A.18; optional overlays, topology, metric or distance structures, normalization boundaries, comparability boundaries, and missingness semantics are dependent declarations over the space, not separate U-kinds by label. C.16 measurement values may cite the space, but a score table, dashboard, evaluation result, or dynamics law is not the characteristic 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 declared
U.CharacteristicSpacevalue as a finite product of slot value sets (per A.18), -
the slot construct for each factor (a pairing of a Characteristic with a chosen Scale),
-
minimal structural overlays (optional order, topology, metric hooks) that downstream patterns may attach to a space, and
-
the hook
U.Dynamics.stateSpace : CharacteristicSpace– i.e. the requirement that any dynamics model declare a CharacteristicSpace for its state space (typing only).
A.19 does not introduce any new measurement aspects, composite metrics, or normalization semantics (governed by A.19.UNM, with evidence 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-state relation (
RoleStateRelation@BoundedContext, A.2.5) 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 role-state relations. In FPF, formal state certification is done via checklists in
RoleStateRelation@BoundedContext(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.
-
Role-state-relation integration – how formal state certification (via checklists in
RoleStateRelation@BoundedContext) 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), call it a RoleCharacteristicSpace: the state space used by that role-state relation within that bounded context. Individual states of a role belong toRoleStateRelation@BoundedContext, and a StateAssertion is a certified claim that at a given time window, the holon’s RoleCharacteristicSpace 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 a RoleStateRelation@BoundedContext 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 RoleCharacteristicSpace 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 characteristic-space predicates, 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).
-
Predicate band inclusion: If states are defined by satisfying declared predicate bands (e.g. State Y means declared coordinates stay above specific levels), then we might say x ≼coord y if x satisfies every predicate 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 satisfies those predicates.
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.
Characteristic-space predicate settlement: a threshold is not a Characteristic and not a measured value by itself. It is a predicate over one or more declared coordinates in a CharacteristicSpace, with polarity, comparison operator, cut value or band, window when current, normalization or bridge relation when cross-space, and the neighboring pattern that uses the predicate. The predicate may be a single coordinate cut, band or region membership, a conjunction or disjunction over coordinates, a dominance or non-dominated-set condition under a declared order overlay, a lexicographic rule, or a scalarized rule only when a scalarization policy is explicitly governed. Role-state, gate, acceptance, assurance, release, selection, improvement-loop, and decision patterns may consume such predicates; A.19 supplies only the characteristic-space side.
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 RoleCharacteristicSpace of (Role, Context B) to the RoleCharacteristicSpace 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.
Archetypal Grounding
System state. A pump readiness state uses temperature, vibration, pressure, and calibration-window coordinates. A.19 declares the space, slot basis, scale bindings, threshold predicates, window, and normalization references. Gate permission, work enactment, and evidence remain with their neighboring patterns.
Episteme evaluation. A method-description review uses clarity, evidence recoverability, source currentness, and relation precision coordinates. A.19 supplies the declared characteristic space; the evaluation pattern owns the stop condition, rating interpretation, and improvement decision.
Cross-context comparison. A built-asset team wants to compare readiness in two contexts with different measurement conventions. A.19 requires a declared bridge or normalization relation before coordinatewise comparison; the bridge and assurance implications stay with their governing patterns.
Bias-Annotation
A.19 corrects feature-vector bias: a list of numbers, labels, or dashboard fields is not yet a CharacteristicSpace. The space exists only when each slot binds a U.Characteristic to a scale and value set with declared meaning, comparability, missingness, and optional overlays.
It also corrects consumer-pattern bias. A gate, evaluation, selector, assurance, dashboard, or portfolio may use a declared space, but that use does not create another space kind. The consumer pattern owns its predicate, score, decision, assurance, or publication use; A.19 owns only the characteristic-space side.
Conformance Checklist (normative) — CC‑A19
Formality references and operational segregation (normative). A.19 aligns with C.2.3 Unified Formality Characteristic (F). Use F directly instead of tier labels such as T0, T1, and T2, 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 method sequence 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.
Common Anti-Patterns and How to Avoid Them
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 = method sequence.” ✗ 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.
- Use boundary: 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.
Consequences
Rationale
A characteristic space is the minimal object that keeps multi-characteristic claims from becoming loose feature lists. The pattern binds each characteristic to a scale and value set, then lets neighboring patterns consume the declared space for state predicates, thresholds, comparisons, gates, evaluations, assurance, dashboards, and dynamics models.
The separation matters because thresholds, scores, dashboards, and decisions are not the space. They are predicates, computations, publications, or consumer claims over a declared space. A.19 keeps the coordinate ontology stable while allowing different consumers to state their own admissible use and evidence obligations.
SoTA-Echoing
Measurement and evaluation practice requires explicit variable definitions, scales, units, value ranges, missingness treatment, normalization, and comparability before multi-criteria comparison is meaningful. A.19 adapts that discipline to FPF by treating the characteristic space as the declared ontic object and by moving scoring, indicator choice, normalization, and assurance use to their governing patterns.
Dynamical-systems and state-space practice supplies the useful hook: a dynamics model needs a declared state space, but the state space does not itself define the law, time base, observation model, or intervention. FPF keeps that boundary so that characteristic-space declarations can be reused across system, episteme, evaluation, and architecture work without smuggling consumer semantics into the space.
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-use basis and currentness
A.19 is primarily internal-kernel doctrine, not an external SoTA-import pattern. The accepted FPF basis for U.CharacteristicSpace is the chain of 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 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.
Relations - 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
Use this pattern when. Use this pattern 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.
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 admissibility and scale lawfulness. 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, evaluator, 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 action, or belong to another exact evaluation.
- Split compound coordinates. If a coordinate mixes two repair actions, 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-pattern relations. Name the FPF pattern that governs evidence, assurance, gate, work, decision, publication, naming, quality-bundle, measurement, OEE/NQD, or mathematical-lens claims when the coordinate depends on them. This is a declarative relation after the coordinate, value, and evidence content; write it as "claim C is governed by pattern P", not as routing or package-placement prose.
- 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 admissibility, scale lawfulness, or characteristic-space admissibility.
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.
Archetypal Grounding
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.
Bias-Annotation
A.19.ECS corrects score-first bias. Teams often begin improvement by choosing convenient scores, visible dashboards, or familiar criteria. The pattern starts instead from evaluated object kind, declared use, contrast cases, characteristic slots, scale bindings, value meanings, evidence basis, missingness, protected trade-offs, and stop conditions.
It also corrects evaluation-reuse bias. A reusable evaluation is useful only when it fits the object kind and use. If the existing evaluation already fits, use it; if it does not, construct or repair the evaluation characteristic space before starting an improvement loop.
Conformance checklist
Common Anti-Patterns and How to Avoid Them
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.
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 evaluator 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.
SoTA-Echoing
Relations
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 relation. 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 SourceUseRelation = 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 use or action 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.PresentationCarrieror another carrier relation.
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; admissibility 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. Folding admissibility and semantics are 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 evidence-provenance anchors or A.2.4 evidence-use relation slots 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: evidence-use validation of an admission requires CN‑frame acceptance; Assurance pulls CL from any Bridge used.
Worked mini-schemas (entity/relational mixtures across CN‑frames, informative)
To illustrate how CharacteristicSpace is used in practice, below are simplified schema snippets for three typical CN‑frames: an Operations view (run-time state and action gating), an Assurance view (evidence and cross-context comparison), and an Alignment view (design-time consistency across contexts). These examples mix entity-based and relational Characteristics and demonstrate how normalization and bridge references may appear in a model.
Didactic-only note (no data governance). The “schema/table” shapes below are purely explanatory: they show which references must be cite-able for audit and reproducibility. They are not storage requirements, do not prescribe file formats, and do not define the semantics of NormalizationMethod* tokens (see A.19.UNM / C.16).
Operations CN‑frame — Run-time gating & enactment
Entity graph view:
Holder (System) ── playsRoleOf ──> Role@Context ── has ──> RCS (slots…) RSG (Role@Context) ── lists ──> State (◉ status) Checklist (of State) ── testedBy ──> Evaluation ── yields ──> StateAssertion Work ── performedBy ──> RoleAssignment Work ── isExecutionOf ──> MethodDescription
In the above, a Holder (a system instance) plays a Role in some Context, which has an attached RCS (a set of slots defining its characteristic space). That Role’s RSG lists various possible State entries (each state could be, e.g., Ready, Waiting, Degraded, etc.). Each State has a Checklist which is tested by an Evaluation process, resulting in a StateAssertion (pass/fail) at runtime. Meanwhile, Work instances (concrete operations) are performed by the RoleAssignment and correspond to some MethodDescription (procedure). The “gate” for Work is that a StateAssertion for an enactable state must exist.
Relational stub: (illustrating how information might be recorded)
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 LOG‑CAL and C.16/A.19 characterization stack. Units, scales, and measurement templates come from C.16, A.17, A.18, and A.19; 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; admissibility/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(admissibility 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 admissibility constraints.
In the current corpus, many G patterns interleave:
- universal CHR admissibility 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),
- admissibility 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, admissibility gate, and Transport discipline (CN-Spec + CG-Spec + Transport), with membership by declared mechanism intension.
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 / admissibility (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 admissibility and order lawfulness
- 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 admissibility 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 admissibility 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 admissibility 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 admissibility gate that own comparability, normalization, indicatorization policy, and numeric admissibility. 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 admissibility 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 admissibility 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 admissibility 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 admissibility 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 admissibility 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)GovernedValueDomain: 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 admissibility. - 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 admissibility 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.
- Lawfulness 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 inadmissibility (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; scale lawfulness 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 admissibility 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) an admissibility 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, admissibility, 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. - GovernedValueDomain:
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 admissibility/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 admissibility 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 admissibility 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 admissibility-first: it produces score measures from admitted profiles while remaining constrained by the admissibility 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 admissibility 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 admissibility 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 admissibility constraints and effective policies (editions, evidence rules, crossings) are not explicit and not recorded.
Forces
-
Admissibility discipline vs operational pressure. Scoring is where "just compute a number" pressure is strongest, but admissibility 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),
- an admissibility‑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 lawfulness.
-
Purpose: SCP‑first scoring: produce score measures from admitted profiles without violating CSLC / scale lawfulness.
-
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. - GovernedValueDomain:
U.Measure. - SliceSet:
U.ContextSliceSet. - ExtentRule: scoring ranges over admitted (indicator/NCV) profiles in the active context slice, routed by
CN‑Spec.comparabilityand admissibility‑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; admissibility‑first, no hidden scalarization):
- SCP+CSLC lawfulness: 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 lawfulness: any numeric transform used to produce
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing admissibility/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 admissibility/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 admissibility‑gated scoring:
- Input: “an admitted profile of measures, in this context slice, plus CN-Spec governance card and CG-Spec admissibility 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 admissibility 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 admissibility 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 admissibility 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
Scoreadmissibility‑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 admissibility rules inside a scoring method description instead of citing
CGSpecSlot.SCP. Avoid by keeping admissibility 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, admissibility‑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 admissibility 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:
- Admissibility 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, admissibility‑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 admissibility 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 lawfulness 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 admissibility.
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/admissibility).
- 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 admissibility, (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 lawfulness (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 admissibility-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) an admissibility 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 admissibility/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). - GovernedValueDomain:
U.Measure. - SliceSet:
U.ContextSliceSet. - ExtentRule: aggregation ranges over admitted measure sets in the active context slice (admission routed by
CNSpecSlot.acceptance); admissibility 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 admissibility:
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 admissibility/evidence):
FoldEligibility_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires: (i)CGSpecSlotprovides the admissibility 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 admissibility 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:
- Admissibility: 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)?
- Admissibility: 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, admissibility-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; admissibility 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 Source: FPF, CHR mechanism-governing patterns Modified: 2026‑01‑20
Governing-pattern note: 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 field set 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. Other descriptions of CPM citeA.19.CPM:4.1rather than restating SlotIndex, OperationAlgebra, LawSet, AdmissibilityConditions, Applicability, Transport, time policy, plane regime, or audit content.
At a glance (didactic, informative)
CPM is the CHR comparison kernel: it compares two admitted profiles under an explicit, admissibility‑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 admissibility frame?" It does not answer: "Which one should we pick?" (selection) nor "What is the score?" (scoring).
Use this when. Use CPM when the current project question is comparison under one declared comparator, not scoring, folding, selection, publication, or work authorization.
What this buys. The practitioner gets a comparison relation that can be audited and later consumed by selection without turning partial order, incomparability, missing evidence, or scale limits into a hidden scalar winner.
First output. Write or cite one ComparisonResultSlot carrying the relation or poset tokens, comparator ref, admissibility frame, and evidence and currentness pins needed for replay.
Manager quick checklist (before you trust a comparison):
-
Comparator is explicit: do we have a
ComparatorSpecRef, and is it admitted byCG‑Spec.ComparatorSet? -
Admissibility is declared: do we cite
CG‑Spec(andSCPwhen numeric ops exist) and treat violations asdegrade|abstain? -
Evidence is not faked: are missing or unknown inputs treated as
degrade|abstainunder the effective MinimalEvidence policy (never aspass)? -
Partiality is preserved: are we willing to accept incomparability and 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 or poset tokens (not a single scalar, and not an embedded selection decision). -
Planned slot fillings: concrete
ComparatorSpecRef.editionand any policy ids are planned fillers only under theA.15.3planned slot-filling ontic and are carried bySlotFillingsPlanItemrows (A.15.3 +A.19.CHR:4.7.2). CPM's kernel does not fill project-specific slots; executions record the effective refs and pins inAudit. -
Reproducible comparisons: for parity and benchmark style runs that require a stable run package plus report record (editions, windows, parity pins), use
G.9(Parity and 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 or aggregate (
ULSAM); - does not select (“pick best”) — that is
SelectorMechanism.
- does not normalize (
-
Core safety commitments: admissibility 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 or totalization. -
Where method details live: in editions of
ComparatorSpecand their SoTA wiring (Part G packs and extensions), not inside CPM’s kernel semantics. -
Quick rule of thumb: if you need numbers, that’s
USCM; if you need a selection or 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 or totalization, require tri‑state guards, and enforce admissibility declarations for numeric operations. Comparison must therefore be described as:
- a mechanism (in the
U.Mechanism.Intensionsense, perA.6.1and 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 admissibility is gated byCG-Specrather than re-invented locally).
Within suite protocols, CPM appears as the explicit compare stage: it consumes admitted left and right profiles (scores and folded measures when those upstream stages are present) and produces an admissible, 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.
- Inadmissible arithmetic: comparing across measures using operations that are not scale-admissible (CSLC‑violating) or not admitted by the declared admissibility 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 or 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 references, or penalty discipline, producing misleading outcomes that ignore transport costs and reference plane constraints.
CPM exists to make the comparison act explicit, admissibility‑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 admissibility, explicit comparator choice, and explicit handling of incomparability and unknown evidence.
- 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 field sets must remain stable and wiring‑friendly.
- Auditability vs speed-of-discussion: teams want fast decisions; FPF requires audit pins and explicit edition and policy references for reproducibility.
- Cross‑context reasoning vs transport discipline: comparisons across contexts are valuable, but they require bridge‑only crossings and explicit penalty assignment, 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 admissibility is declared and gated (
CG-Spec.ComparatorSet, andCG-Spec.SCPwhen numeric operations are involved; scale admissibility via CSLC). - Results are set‑valued relation or poset tokens; partial orders remain partial; no silent scalarization or totalization.
- Admissibility is tri‑state and fail‑closed on missing admissibility and 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 admissible comparison:
Compare(...) → ComparisonResultSlotplus a tri‑stateCompareEligibilityguard; - a stable SlotKind field set (by suite lexicon tokens) that downstream selection and Part‑G wiring can rely on without SlotKind drift;
- an admissibility and evidence responsibility split: admissibility is gated by
CG-Spec(and CSLC), while admission and comparability relations are cited fromCN-Spec; - a minimal audit-pin requirement: what pins and editions MUST be recorded to make a comparison replay‑grade;
- explicit planned slot-filling separation:
SlotFillingsPlanItemrows carry planned edition and policy fillers; CPM records effective refs and pins inAudit.
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 publishGateDecisionorDecisionLogrecords (gate‑only), and does not embed selection. It emitsAuditpins and a tri‑state guard only (per suite obligations).- Planned slot fillings: this intension does not fill project-specific slots for editions, policy ids, bridge ids, or similar pins. Planned fillers live in
SlotFillingsPlanItemrows (A.15.3 +A.19.CHR:4.7.2); executions record effective refs and pins inAudit.
- Planned slot fillings: this intension does not fill project-specific slots for editions, policy ids, bridge ids, or similar pins. Planned fillers live in
-
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 field set (by lexicon tokens), and (iii) the explicit set‑valued output commitment (no silent scalarization or totalization). -
Tell. Lawful comparison producing set‑valued parity or poset outcomes (not a single scalar).
-
Purpose: admissible comparison producing set‑valued parity or 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 and admission declarations),A.19.CHR:4.2.1 (CHR SlotKind Lexicon). -
SubjectBlock:
- SubjectKind:
Comparison. - GovernedValueDomain: CHR-typed measures in a CG-Frame (see
CG-Spec.ComparatorSet). - SliceSet:
U.ContextSliceSet. - ExtentRule: comparison ranges over admitted left and right profiles under the active context slice, using a declared comparator from
CG‑Spec.ComparatorSet. - ResultKind?:
U.Set(relation or poset token set; set‑valued by default).
- SubjectKind:
-
SlotIndex (derived projection from
SlotSpecsand 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 or 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(admissibility gate; citeG.0). - Set‑valued semantics:
ComparisonResultSlotis set‑valued (parity or poset tokens); partial orders remain partial — no silent totalization or scalarization. - CSLC+SCP admissibility: any numeric ops implied by the comparator MUST be admissible under
CGSpecSlot.SCPand CSLC-admissible (citeG.0+A.18). - Unknown is not coerced: missing or unknown evidence MUST NOT be mapped to a comparison outcome; use tri‑state guards.
- No hidden thresholds or 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 or alignment internally. If
CNSpecSlot.comparabilitydeclares normalization‑based invariants for comparison,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 admissibility and 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-admissible for the effective measure scales, (iii) both profiles are admitted and 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 invariant and 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 or unknown or fails the effective MinimalEvidence gate.
-
Applicability:
- Intended to be used as the CHR stage
compare: it may follow indicatorization or 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 admissibility and evidence declarations are present via
CGSpecSlot(fail‑closed otherwise). - When used inside the CHR suite, stage ordering and optionality are 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, and ReferencePlane only; penalties are assigned 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 or downstream-handling policy ids (e.g., a SoS‑LOG branch id) when such policies are in scope. - If
CNSpecSlot.comparabilitydeclares normalization‑based invariants for comparison, 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 or degraded because normalization admissibility is missing. - SHOULD record: a stable description of
ComparisonResultSlotand any Bridge, CL, and ReferencePlane ids whenTransportwas used.
- MUST record:
Interpretation notes — informative
- Set‑valued output is the default, not a loophole. “Set‑valued” means CPM preserves incomparability, ties, and 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.comparabilitydeclares normalization‑based invariants for comparison, that dependence must be represented explicitly via the suite protocol and, where needed, 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 or 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 admissibility and evidence declarations"
- 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 and comparability declarations) and a declaredCG‑Specthat lists admissible 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 or 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 assignment (
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 or 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 or 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 or 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 publication and telemetry outside suite closure. -
Anti‑pattern: “SlotKind drift.” Symptom: renaming or re‑purposing
LeftProfileSlot,RightProfileSlot,ComparatorSpecSlot, orComparisonResultSlotacross 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 or pattern prose. Avoid: put edition and policy fillers only in
SlotFillingsPlanItemrows; keep CPM refs-only and record effective refs and pins inAudit. -
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 and acceptance policies; pin editions; audit.
-
Anti‑pattern: “Unknown coerces to outcome.” Symptom: missing evidence treated as equal, zero, or 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, and ReferencePlane discipline. Avoid: use transport mechanisms and crossing pins; assign penalties 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, admissibility declarations, 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 which comparisons are admissible, and under what scale or 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).
- Single governing pattern: keeping one governing pattern eliminates near-duplicate comparison descriptions 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.
Concrete comparator-family SoTA packages are cited through their current Part G pack or claim sheet when one governs the use. CPM's kernel semantics remain unchanged.
Relations
Builds on and 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(planned slot-filling ontic andSlotFillingsPlanItemrows; CPM remains refs-only with respect to planned slot filling)A.19.CN(CN-Spec comparability plus acceptance and admission declarations)G.0(CG‑Spec:ComparatorSet,SCP,MinimalEvidence, CL and ReferencePlane framing)A.18(CSLC scale admissibility)E.10(lexical and 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 named patterns in the 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 and benchmark harness),G.10and PTM (publication and 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 Source: FPF, CHR mechanism-governing patterns Modified: 2026‑01‑20
Governing-pattern note: 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. Other descriptions of SelectorMechanism citeA.19.SelectorMechanism:4.1rather than restating SlotIndex, OperationAlgebra, LawSet, Admissibility, Applicability, Transport, PlaneRegime, time policy, or Audit content.
At a glance — didactic, informative
- What it is: a universal set-returning selection kernel: it takes candidates, admissible 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.
- Use this when: the current project question is selection from admitted candidates under explicit criteria after comparison has already been made or cited.
- What this buys: the practitioner gets a selected set, specialist escalation, abstain, or other explicit escalation result whose singleton behavior, ordering, and policy basis are explicit.
- First output: write or cite one
SelectionSlotwith candidate set, comparison-result refs, criteria, admissibility frame, context, and selected-set result. - 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.5andsuite_protocols; suite membership is a set inA.19.CHR:4.2). - Inputs (conceptual):
CandidateSetSlot+ComparisonResultSlot(admissible relation or 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-admissible inputs.
- Planned slot fillings: concrete edition and policy pins (e.g.,
TaskSignatureRef@edition(…),CGSpecRef@edition(…), evidence overrides) are planned fillers under theA.15.3planned slot-filling ontic and are carried bySlotFillingsPlanItemrows (A.15.3+A.19.CHR:4.7.2); executions only record effective refs and pins inAudit. - Transformation-flow use: when used as a node type in
E.18, project-specific selector-instance refs and pin refs are planned fillers inSlotFillingsPlanItemrows; this pattern governs the intension that those instances cite. - Failure mode: tri‑state guard (
pass|degrade|abstain); missing or 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 admissible 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 admissible comparison outcomes without collapsing them into a hidden scalar,
- apply explicit criteria and policy references, 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 yielding 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 admissible 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 references 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.
-
Planned slot filling and gate and guard separation. Planned fillers and pins live in
SlotFillingsPlanItemrows. Selection must not mutate into a gate pattern: noGateDecisionor 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 field set (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 admissibility or evidence,
- an audit minimum that records effective editions and policy references.
Method semantics and SoTA algorithm families do not live inside the kernel: they connect via G.2 SoTA packs and wiring modules, and via admissible specializations ⊑ and ⊑⁺ 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 boundary: slots, operations, laws, guards, and audit. It does not bind project-specific planned pins, and it does not emit GateDecision or 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-reference artifact when used),G.5 (selector conformance and default selection policy),G.0 (CG‑Spec admissibility and evidence gates),A.19.CHR:4.2.1 (CHR SlotKind Lexicon). -
SubjectBlock:
- SubjectKind:
Selection. - GovernedValueDomain: candidate set plus admissible comparison-outcome relation token set.
- SliceSet:
U.ContextSliceSet. - ExtentRule: selection ranges over admitted candidates in the active context slice, constrained by explicit criteria and policies and by admissible 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 or poset tokens), refMode = ByValue⟩.CriteriaSlot : ⟨ValueKind = U.Set (selection criteria or clauses, including explicit tie‑breakers; **acceptance thresholds are not criteria** and remain governed by the cited acceptance declarations and applied only viaSelectEligibility), refMode = ByValue⟩.TaskSignatureSlot? : ⟨ValueKind = TaskSignature, refMode = TaskSignatureRef⟩optional; when present, SHOULD be the single policy-default slot or ref for selector defaults (e.g.,PortfolioModeor dominance regime), but it does not replaceCNSpecSlotorCGSpecSlotgoverning 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 or constants: a conformant publication MUST NOT smuggle thresholds, weights, dominance rules, or tie‑breakers. Selection‑level commitments MUST be explicit in
CriteriaSlotand, where needed, in explicit policy defaults exposed throughTaskSignatureSlot. Admissibility and 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 or partial when it is set‑valued or 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 evaluate the selection with tri‑state guards (no unknown coercion). Any candidate‑level ineligibility handling MUST be explicit (criteria and upstream outputs when used) and auditable (no silent dropping); the kernel MUST NOT invent new evidence thresholds. - No competing defaults:
PortfolioModeand dominance defaults (when relevant) MUST be sourced from their declared governing patterns (typically throughTaskSignatureSlotand the selector conformance or default rules inG.5when used), and MUST NOT be re‑declared inside the kernel.
- Set‑returning by default: a conformant
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing admissibility 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 (viaCriteriaSlotandTaskSignatureSlotwhen used), (iii) admissibility and acceptance gates (CNSpecSlot.acceptance, evidence) do not fail, and (iv)CNSpecSlotandCGSpecSlotare coherent for the comparison tokens being consumed (no mixed CN-Spec and CG-Spec pairings).- If
MinimalEvidenceSlotis absent,SelectEligibilityMUST evaluate evidence againstCGSpecSlot.MinimalEvidenceby explicit rule, and missing or unknown evidence MUST NOT yieldpass. degradeis permitted only when an explicit, auditable failure behavior exists (policy‑bound), e.g., “exclude ineligible candidates” or “sandboxed probe only”;abstainis used when selection cannot proceed admissibly under the declared criteria and policies.
-
Applicability:
- Intended as the last stage of CHR selection after admissible comparison, producing a selected-set-valued result.
- Cross‑context selection is allowed only via explicit Transport (Bridge, CL, and ReferencePlane) and cannot bypass CG‑Spec admissibility.
-
Transport: declarative‑only: no embedded CL, Φ, or Ψ tables and no new transport edges; crossings are via cited Bridge, CL, and ReferencePlane declarations; penalties are assigned 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 are assigned 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 policy-relevant selector defaults (e.g.,
PortfolioModeor dominance regime) when they are not fully determined by a referencedTaskSignatureRefor an explicit selector policy reference; the point is auditability, not re‑declaring defaults. - SHOULD record: any Bridge, CL, and ReferencePlane ids when
Transportwas used.
- 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 an admissible scoring or comparator choice, not invented inside selection. -
Threshold discipline (acceptance ≠ selection). Acceptance and admission thresholds are not selection criteria: they live in
AcceptanceClauses,TaskSignature, orGateProfilerecords 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 references), 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.
-
Planned slot filling is preserved. Planned fillers for
TaskSignatureRef@edition,CGSpecRef@edition, evidence policy overrides, and other pins live inSlotFillingsPlanItemrows. 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 relation 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 admissible comparison on declared indicators and evidence gates. -
TaskSignatureSlotis present and is the single policy-default slot or ref:PortfolioModeand dominance regime,- budgeting and 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 admissibility.
- Governance bias. Bias toward explicit criteria and policy-reference 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
degradeorabstainearly. 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 publication or reporting 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 and trade-offs
- Selected-set results can require explicit downstream handling when a single decision is needed.
- Strict evidence discipline increases early
degradeorabstainuntil 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 admissible 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 admissibility and evidence discipline at the decision boundary without smuggling heuristics.
- Organizational clarity: it makes defaults and thresholds discussable, reviewable, and maintainable as explicit policy references.
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 admissible 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.
Concrete selector-family SoTA packages are cited through their current Part G pack or claim sheet when one governs the use. They connect through CriteriaSlot and TaskSignatureSlot references while kernel semantics remain unchanged.
SoTA alignment map (normative)
Notes per row (1–2 sentences; why to adopt, adapt, or reject):
- Selected-set-as-output (QD framing): adopt the decision framing (declared selected set as a first-class result) while keeping concrete QD or 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 and 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 and criteria (and, when needed, admissible specializations
⊑and⊑⁺) with explicit edition pins and transfer and validity rules in planned baseline, not by mutatingSelect. - Reject or 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 admissibility and 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‑Specadmissibility and evidence declarations.A.19.CNforCN‑Specgovernance card used as an explicit input.C.22forTaskSignatureas a policy-reference artifact when used.A.6.5for slot discipline (SlotIndex as projection; SlotKind invariance).A.15.3+A.19.CHR:4.7.2for the planned slot-filling ontic andSlotFillingsPlanItemrows carrying edition and policy pins (cited as planned slot fillings, 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 are planned fillers inSlotFillingsPlanItemrows, and effective pins appear inAudit.
-
Coordinates with
CPMand other admissible comparison stages as producers ofComparisonResultSlot.ULSAMand other admissible aggregation stages that must remain explicit rather than hidden inside selection.E.20governing-pattern discipline andF.18naming or alias handling when a source term needs a bridge.
A.19.SelectorMechanism:End
Flow Constraint Validity — Eulerian
Type: Architectural (A) Status: Stable Normativity: Normative for flow valuations used by
E.18TransformationFlowStructureunder the Eulerian operational interpretation.
Tech-name. FlowConstraintValidity for transformation-flow valuations
Plain-name. Flow constraint validity (Eulerian interpretation)
E.24.UK settlement. A.20 does not admit U.Flow or U.Flow.ConstraintValidity as durable U-kinds. It governs the non-U constraint-validity relation for E.18 transformation-flow valuations. U.Transfer remains the single relation kind selected by E.18; FlowConstraintValidity is a pattern-local technical label for the step-local CV claim, status, and witness discipline.
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 current question 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 action 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 CV output. 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 action 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 current question. 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 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 current question.
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 E.18 transformation-flow valuations: 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
Flow-valuation scope. A.20 leaves step kinds abstract; CV and GateFit separation applies to any declared E.18 transformation-flow valuation 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 neighboring 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 relation 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 - Constraint-validity checks
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 guidance it tests; if no such Solution guidance 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.
Common Anti-Patterns and How to Avoid Them
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 relation 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 current question is whether a gate-decision relation publishes a GateProfile-bound GateDecision from declared GateChecks, folds, pins, and rationale.
First useful gate use. 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 current bounded gate use. 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 gate use. If there is only a guard, dashboard cue, explanation, full-kit-looking label, 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. If the current question is whether intended work has full-kit or work-entry readiness without a gate-decision relation, use A.15.5.
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, full-kit label, 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, evidence question, or work-entry-readiness question; the evidence claim is governed by A.10, the CV result by A.20, the work-entry-readiness relation by A.15.5, 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, work-entry-readiness, and assurance claims do not belong to A.21 unless they are declared gate checks consumed under the current GateProfile; their evidence, readiness, and assurance relations remain with A.10, A.15.5, and B.3. Plain wording remains ordinary unless it changes bounded use, source relation, evidence, gate, readiness, 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.
Agent-loop anti-case: a monitor retries twice, escalates to a supervisor, and the harness dashboard turns green. That sequence may be performed work, telemetry, a transformation-flow path, or evidence for a later check, but it is not GateDecision=pass unless a current OperationalGate(profile) consumes declared GateCheckRefs and publishes GateDecision plus DecisionLogRef. If the gate-decision relation is intended but missing, repair it by recovering the A.21 gate-decision relation; otherwise the result remains a cue for A.15, E.18, G.9, or evidence work, not an A.21 gate passage.
Same problem, different current question. For a gate-bearing transformation-flow problem, use E.18 for transformation-flow structure, graph value, path relation, 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 question is full-kit condition or work-entry readiness before work entry, use A.15.5 unless an actual gate-decision relation is current. 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 a durable U-kind, 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 the decision value 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 display label for the
GateProfile=LiteGateProfile value. Treat this as a label 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 relation is present. Before applying any row, name the Solution relation it tests; if no such practitioner use 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.
Common Anti-Patterns and How to Avoid Them
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 provenance and VSA attestation specification line): 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, full-kit labels, release screens, conformance labels, safety-envelope notes, CV results, and gate-looking explanations do not become gate passage, release authorization, deontic permission, safety acceptance, work-entry readiness, 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, evidence question, or readiness 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.15.5 →separates→ work-entry readiness from gate decision. Full-kit and work-entry readiness labels may be cited by A.21 only when they are declared GateChecks under a current
GateProfile; otherwiseWorkEntryReadiness@Contextremains governed by A.15.5. - 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: an organization among exact constituents and obtaining relations, selected to expose a relation class, applied constraint, invariant, variation class, preserved arrangement, or lost arrangement that changes the next engineering or reasoning action.
The first A.22 question is not “which diagram or record shows the structure?” It is “which organization is selected for this named use?” Recover that organization in this order:
- identify every constituent independently under its direct governing pattern;
- recover the exact relation occurrences among those constituents that actually obtain under their direct predicates;
- state the exact constraints applied to those constituents and relations, plus the named selection-use frame that says what question or action this organization serves;
- name the resulting selected organization and the admissible action or stop that follows.
When the use makes a load-bearing claim that a structure was selected, also recover the selecting system, its method-governed dated selection work, and the exact direct participant relations or A.6.1 bindings used by that work. Those neighboring facts support the selection judgment; they do not enter U.Structure identity. If the judgment must persist, identify a separate C.2.1 result episteme whose claim content designates the selected structure.
The first useful move is small:
StructureQuestionCard@Project is a project-side triage aid for this selected-structure use. 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.
Here @Project is a compatibility and retrieval cue, not a type or relation assertion. It identifies neither a project entity nor a composite project U.Work, and it establishes no context, authority, viewpoint, or parthood. When this card is used in relation to one actual project, name that exact composite U.Work and the direct relation by which the current structure-selection work, decision, description, or other governed object concerns it. Otherwise no project-work reference is implied. The same rule applies to ArchitectureStructureKindTriage@Project below.
Stop at this card when it makes the next structure use 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 publication, source-use record, 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-basis or lens reliance only when it is being claimed, add a StructureUseReturnCondition 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-description relation, source-use relation, evidence relation, 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 organization selected from independently identified constituents and exact obtaining relation occurrences under applied constraints for one named use frame.
The constituents keep their own identities and kinds. Every selected relation occurrence must already obtain and retain identity under its direct governing pattern. A.22 neither creates those participants nor makes their relations obtain. An exact system or practitioner selects their organization; A.22 supplies the identity and boundary rule for that selected organization.
The applied constraints are the exact constraint claims used in the selection judgment, not the identity of the document, table, rule card, or constraint episteme that carries them. The named use frame states the question being answered, the admissible action, and the non-admissible overread. A generic phrase such as “current use” or “appropriate structure” is not a use frame.
A system may perform dated structure-selection work by an exact method and may create a result episteme about the selected structure. The system acts; the pattern, constraints, graph, result, and structure do not. The method, work, A.6.1 binding or direct participation relation, decision, and C.2.1 result episteme are neighboring objects. None constitutes or reidentifies the structure.
A diagram, graph, table, model, description, view, or publication may designate, represent, or describe the selected organization and its already identified constituents. Its form does not establish a constituent's identity, make a relation obtain, or select a structure. Use C.29, C.2.1, E.17.0, and the exact publication or source-use patterns for those neighboring claims.
Base U.Structure Identity and Selection
For a selected structure S, recover four identity discriminators:
Base U.Structure identity has no ambient context field. A bounded-context label, U.ContextSlice, U.ClaimScope, project record, description, view, graph, table, or publication is not automatically an additional discriminator. If an exact scope is referenced by an applied constraint, that constraint contributes through the third discriminator. If a model-use structure is independently selected as a constituent of another structure, it contributes through the first discriminator.
The first discriminator is an exact plurality, not a graph node set created by notation. A separately useful C.13 collection may designate the same constituents, but collection membership neither proves parthood nor replaces their direct identities. The second discriminator contains the exact relation occurrences chosen for this organization; a relation name, edge label, tuple position, or adjacency row is insufficient. The third contains the semantic constraints actually applied; changing only the rationale, formatting, or publication of an unchanged constraint claim does not change this discriminator. The fourth names the use question and its admissible action or stop.
Two references resolve to the same U.Structure when all four discriminators resolve to the same values. A changed designator, selecting system, method, work occurrence, result episteme, description, graph, representation scheme, view, or publication leaves the structure unchanged when the four discriminators remain unchanged. Replacing a constituent, a selected relation occurrence, an applied constraint, or the named use frame can identify another structure. If a relation occurrence itself may have been reidentified, apply its direct relation pattern before reapplying A.22.
If the constituents or obtaining relations cannot be recovered, stop at the exact description or representation and return the missing-governor or missing-grounding question. If the constraints or named use frame are absent, the material may show an arrangement, but it does not yet support the claimed selected U.Structure.
The following two compact records are recovery aids, not new ontic kinds. In SelectedStructureBasis, the selected structure, constituents, selected obtaining relations, applied constraints, and use frame state identity; the preserved/lost and action/stop rows state the use-return boundary rather than adding identity fields.
StructureSelectionUse records how a system performed the selection and reached the judgment. SelectedStructureBasis records the four identity discriminators plus the use-return boundary. Do not copy the system, work, method, result episteme, or decision into the structure basis. A U.ClaimScope, effective U.ReferenceScheme, or model-use structure that merely qualifies a claim about either record does not enter base identity. A scope referenced by an applied constraint or a model-use structure selected as a constituent enters only through that already declared discriminator.
A.22 structure-aspect names such as functional, mereological, modular, transformation-flow, control, semantic, causal, dynamical, algebraic, topological, geometric, or coarse-grained remain cues for which relations and constraints to recover. They do not identify a structure without the four discriminators. C.30.ASV ArchitectureStructureKindRef values remain architecture-local classifiers; a matching label does not imply identity.
Compact auxiliary boundary
Use description, publication, source-use, evidence, work, gate, decision, release, architecture-description, and mathematical-lens patterns when those claims are being made. The A.22 application contains the selected-structure portion and the structure-use return condition that protects that structure use; neighboring claims remain with their governing patterns. 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.
Constraint-governed unfolding structure
Use A.22.CGUS when the current A.22 structure is an organization among several governed loci and constraints: admitted starting records, already-current starting structures, relation signatures, constraints, invariants, guarded transitions, preserved and lost structure, admissible next forms, and conditions for stop, return, split, or currentness refresh. This structure specialization is still U.Structure; it is not a route, workflow, method, work plan, performed work, decision, evidence relation, gate, architecture description, or publication.
Open A.22.CGUS only when the candidate has several loci and cross-locus constraints. A route card, table, graph, README entry, narrative, slide, or happy-path example may describe or demonstrate the unfolding structure, but it is not the structure itself.
Bounded And Cross-Context Model-Use Structure Specializations
BoundedModelUseStructure is a U.Structure selected over one exact model episteme, exact admitted model-use holons, the obtaining model-applicability, actual model-use, and model-expression-coherence occurrences governed by A.1.1, exact applied constraint claims used by the selection judgment, and one named bounded-model-use frame. Its A.22 identity uses exactly those constituents, selected occurrences, exact constraint claims, and frame. A claim scope, membership outcome, boundary display, or carrier is not an applied constraint by itself; a constraint claim may instead state a proposition about that scope or its A.2.6 membership predicate. No boundary crossing participates in that identity. Continuity across model editions additionally requires the exact C.2.1 episteme-edition relation and declared A.1.1 continuity rule. It is not a holon, description, view, or endpoint manufactured by a later crossing.
CrossContextRelationStructure is a conditional specialization of a different already identified U.Structure. Membership requires exact independently governed obtaining crossing occurrences selected among several bounded model-use structures, applied constraints, and one named crossing-analysis use, with all four A.22 base discriminators established. Until a compatible direct crossing governor supplies those occurrences, a Context Map can describe only a proposed crossing organization and no positive CrossContextRelationStructure member is asserted. The selecting system and its work remain separate. Sharing a participant does not merge structures, and overlap does not prove parthood.
Pending local name settlement. The following F.18 NameCard is local to A.22 while the positive crossing-occurrence basis is unavailable. It does not create the structures, crossing relations, mapping method, or view.
This pending card has no UnifiedTermRowRef. Until its refresh condition is met, CrossContextRelationStructure is an A.22-local provisional designator only; other Core hosts must cite the descriptive A.22 conditional cross-structure rule rather than consume that label as public vocabulary.
DDD Context Mapping names a repeatable U.Method. A.15.2 governs intended mapping work; A.15.1 identifies each exact dated mapping Work individual admitted under U.Work, the performer system and obtaining role assignment, and the exact enactsMethod relation. C.2.1 independently identifies the candidate episteme called a Context Map. While exact independently governed crossing occurrences or the four A.22 base discriminators are missing, its EntityOfConcern is the proposed or described crossing organization, not an exact CrossContextRelationStructure. Only after both conditions are met may a corresponding C.2.1 episteme designate the exact structure. Either episteme is additionally a U.View only when exact EpistemeViewpointConformanceRelation(E, P) obtains under E.17.0. Any C.29 representation, rendering, publication occurrence, form, and carrier remain separate under their direct patterns. Thus method, work, proposal, selected structure, candidate episteme, dependent view membership, representation, and publication stay distinct while the external source terms remain retrievable.
Transformation-flow structure network profile
Use E.18.NET when one engineering use selects two or more independently identified transformation-flow structures, or nested networks of them, together with exact obtaining relations across their boundaries. Apply the four A.22 discriminators directly: the exact TFS or nested-network members are the constituents; the exact cross-member relation occurrences retain their direct governors; the exact applied endpoint, boundary-exposure, and acyclic direct-member constraints are selected under E.18.NET; and the named network-use frame states the practical question or action and the forbidden overread. Record the return condition separately; it reopens selection when a member, relation, constraint, or use-frame value changes and is not a fifth identity discriminator. The result is one dependent, non-agentive U.Structure specialization. E.18.NET owns the network's detailed identity, reference, recursion, local-state, and conformance rules; A.22 does not copy those fields.
Selecting a constituent in the first discriminator does not create a separately re-identifiable membership occurrence. A member row, graph edge, containment picture, or shared label proves neither membership nor another relation. If a receiving use genuinely needs a world-side membership relation, recover its participants, obtaining and identity under a direct relation governor; otherwise use the exact constituent discriminator and do not mint a generic membership edge.
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 kind, name the relation record by value, and name the governing pattern:
If no reliance relation kind can be selected, keep the wording as a source-finding note, recognition cue, 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, source-use, 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 relation, 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 an existing U.Episteme governed by C.2.1 and qualified for describing use under E.10.D2. Every record whose name ends in View@Context here remains that same episteme and has U.View membership only when E.17.0 conformance to an exact viewpoint episteme obtains. A.6.3 governs only an optional source-to-receiving construction. 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.
Structure-use return
StructureUseReturnCondition 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 structure-use 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 a hidden selected-structure, source-basis, source-description, evidence, lens, simulation, extraction, or representation 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
Maintenance-isolation structure selection. A planner needs to choose which relations matter when isolating a pump skid for maintenance.
Pump37_MaintenanceIsolationStructure is identified by the exact constituents, exact selected obtaining occurrences, applied isolation constraints, and maintenance-isolation use frame. SelectionWork_2026-07-25, the enacted method, and any C.2.1 episteme that records the judgment remain separate. A graph can represent the same organization under C.29; an edge in that graph neither makes its relation obtain nor replaces the exact relation occurrence. A near miss is a visually identical graph assembled from labels when one connection has not been established: it is a representation candidate, not the selected structure claimed above.
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 structure use 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 codebase or publication, extraction method, preserved structure, lost structure, validation boundary, and structure-use 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 repair action; it is not a required project control form and not a substitute for the card, note, view, relation, or repair guidance above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
FPF needs one general selected-structure ontic because many useful claims depend on organization before they depend on a specific architecture, mathematical, measurement, or publication pattern. The selected structure is dependent and non-agentive. Claims about it are carried by separate epistemes and views: it can be described, sourced, compared, coarsened, extracted, or used by architecture, but it does not act, select, carry claim content, 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 structure-use return records are used only when the next use would otherwise hide loss, source-basis dependence, or non-structure claim kind.
The reason to keep C.30 separate is architectural clarity. Architecture is selected structure for an exact described holon and architecture 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: A.1, C.13, C.2.1, A.6.REL, A.6.0, A.6.5, A.3.1, A.6.1, A.15.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: A.1.1, A.2.6, A.22.CGUS, 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, E.18.NET, E.18.3, A.10, G.6, B.3, A.20, A.21, C.28, A.15, C.11, C.16, C.25, G.5, C.33, C.34, and C.35 when architecture-specific structure-capture, preservation, or discovery adequacy claim kinds are being made.
Queue 7b relation note: C.33, C.34, and C.35 govern architecture-specific capture, preservation, and discovery adequacy over selected structures. A.22 keeps the general selected-structure portion; it does not decide architecture use, candidate admission, measurement, evidence, assurance, or decision authority for those adequacy claims.
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
Constraint-Governed Unfolding Structure
Type: A.22 specialization of
U.StructureStatus: Stable Normativity: Normative unless explicitly marked informative
Use This When
Use this when a team has a P2S flow card, a P2W carry-through note, an abductive prompt path, an improvement cycle, a narrative ordering, a typing-grounding trace, or a README first-entry seed, and the visible form helps but also misleads. It looks like a route, loop, chain, table, graph, or story, while the useful engineering question is not "which sequence should everyone follow?" but "which admitted records, current structures, typed positions, relation instances, constraints, and guards make each continuation admissible or inadmissible?"
When that is the live question, name the object as ConstraintGovernedUnfoldingStructure@Context: an A.22-governed U.Structure whose SlotSpec-grounded positions, relation signatures, exact referenced values, cross-position constraints, invariants, guarded transitions, preserved structures, C.33 adequacy notes, direct governing-pattern exits, admissible next-form kinds, and use boundaries jointly constrain more than one continuation.
Use CGUS only after the candidate structure has more than one typed position and the relations or constraints among those positions affect admissible continuations. A single recommendation, diagram, slogan, pattern list, or document section is not enough.
Problem Frame
FPF often needs to explain how several admitted records, current structures, typed positions, and relations jointly constrain several admissible next forms without turning that explanation into a workflow. A problem card, G.2 source pack, architecture concern, candidate set, evaluation result, cue publication, and current U.Structure can participate through exact governed relations in pattern-use recommendations, candidate structures, rival hypotheses, evidence work, repair proposals, reader-facing narratives, or structure-use return conditions. The point is the recoverable constraint structure, including relation signatures, guards, preserved structures, C.33 loss notes, and direct governing-pattern exits, not a one-input-one-output conversion.
These structures can be architecture-facing, reasoning-facing, narrative-facing, improvement-facing, typing-grounding-facing, evidence-facing, currentness-facing, or first-use-facing. They share one structural need: typed positions are connected by relations and constrained together, so admissible continuations are recoverable only while the relevant structures, C.33 adequacy notes, guards, exits, and governing-pattern boundaries remain visible.
Problem
The problem is that a constraint-governed unfolding structure becomes unrecoverable when one route-shaped or loop-shaped description stands in for it.
First, the structure's typed positions, exact relations, constraints, preserved structures, C.33 adequacy notes, stop boundary, and direct governing patterns disappear behind decorative prose. Words such as "flow", "move", "unfold", "loop", or "route" remain, but no reader can recover what constrains a continuation.
Second, one demonstration of the structure becomes a fake workflow. A teaching sequence, diagram, README entry, prompt example, or happy path is treated as the order of real project work. Method, work plan, performed work, evidence, gate, decision, publication, and architecture claims then become unsupported inferences from displayed order.
Forces
Solution
Select ConstraintGovernedUnfoldingStructure@Context <: U.Structure as a thin A.22 specialization of U.Structure for constraint-governed unfolding across typed positions and exact governed relations.
A constraint-governed unfolding structure is a U.Structure whose typed positions, relation signatures, referenced relation values, constraints, invariants, guarded transitions, preserved structures, C.33 adequacy notes, and governing-pattern exits jointly constrain admissible next forms. It states how admitted starting records and already-current structures participate through exact relations. It makes no displayed-order claim about real work and fixes no cardinality of starting records, starting structures, or resulting records.
Do not read "unfolding" as a chain by default. The unfolding structure may be branching, merging, cyclic, partially ordered, or graph-shaped, and it may leave several alternative next forms live at once. Before the wider structure passes the admission test, a linear chain, seminar order, prompt path, or happy path remains a ProvisionalUnfoldingDemonstrationDescription@Context. After admission, a presentation of one traversal may be a DemonstrativeUnfoldingSlice@Context whose EntityOfConcern is that admitted CGUS.
Constraint-governed unfolding structure
The declared substrate is the structure being unfolded, not a topic label or container. specializedStructureRef is present only when one narrower U.Structure record is current, such as an E.18.3 transformation-flow specialization. That narrower record may point back through its unfoldingStructureRef; the reciprocal references state one generic-to-narrower specialization relation and do not create two unrelated unfolding structures. Accepted starting records and accepted starting structures remain different: a record may describe, publish, or evaluate a structure without becoming that structure. Every referenced entity retains its exact kind and direct governing pattern.
Dependent position, reference, and boundary relations
The two ...KindValue declarations are local closed enumerations, not U-kinds. Position filling ref and kind are both present or both absent. A relation signature is present when the referenced value is a relation. Every boundary names its governing pattern; only return names a conditional receiver.
StructuralInformationAdequacyNote@Context under C.33 carries captured, expected-but-uncaptured, lost, and hidden structure for a declared use. CGUS does not mint parallel loss or hiddenness fields. A use boundary is not permission, gate passage, evidence, assurance, or currentness refresh by itself.
Admission test
A readable chain is not sufficient for admission. Use CGUS only when the current structure recovers all of the following:
Branches or joins that are current remain visible. A cycle shown as "return to the start" is not thereby a chain. One slice may be linear because attention needs one path; the wider structure remains graph-shaped when its relations are graph-shaped.
Provisional demonstrations, admitted-structure descriptions, and demonstrative slices
A presentation may help discover positions and relations before any CGUS exists. Keep that pre-admission object as a C.2.1-conformant episteme about the actual subject-domain object, question, or proposed continuation set:
This local declaration form is an episteme, not a structure slice and not a new root kind. Its C.2.1 identity comes from its exact EntityOfConcern, DescriptionContext, optional grounding holon, ClaimGraph, reference scheme, and edition. entityOfConcernRef names the subject that the explanation is currently about; it may not point to a not-yet-admitted CGUS. Candidate positions and relation descriptions are claims to investigate, not admitted ConstraintGovernedUnfoldingPosition@Context values or relation-reference epistemes, and they make no world-side relation instance obtain. At least one unresolved admission coordinate remains present while the description is provisional.
Once every coordinate in 4.2 is recoverable and the wider ConstraintGovernedUnfoldingStructure@Context is admitted, describe that structure without selecting a traversal through it by creating this C.2.1-conformant episteme:
Its EntityOfConcern is the admitted CGUS. Its ClaimGraph may describe branches, joins, cycles, partial orders, positions, relations, constraints, and admissible next forms without choosing one route through them. Carrier, diagram form, table layout, or publication location does not determine its identity. A new edition is required when the described CGUS edition, DescriptionContext, applicable grounding, ClaimGraph, reference scheme, preserved-structure account, adequacy account, declared use, or return boundary changes.
When one presentation selects a traversal or ordering through that admitted structure, create a different post-admission episteme:
The transition does not retype the provisional episteme or any subject-domain result. The admitted slice cites the provisional description only as its derivation basis, names the already-admitted CGUS as EntityOfConcern, and replaces candidate position and relation descriptions with exact admitted structure positions and relation references. Its edition changes when that CGUS edition, included positions, omitted-structure account, traversal or ordering rule, alternatives, use boundary, ClaimGraph, or reference scheme changes; carrier or rendering change alone does not. If admission later fails, the provisional explanation may remain useful under its declared use while the slice claim is withdrawn.
The local mode and presentation-form values are enumerations, not CharacteristicSpaces or U-kinds. Presentation form says how the episteme is rendered; it is not a carrier kind. Add an E.17 publication relation only when publication is current.
The top-level transformation-flow locator families are mutually exclusive. For a one-TFS demonstration, transformationFlowStructureRef, pathSliceId, and designRunTag are all present and networkDemonstrationLocator is absent; their existing meaning is unchanged. For a network demonstration, all three top-level one-TFS fields are absent and one networkDemonstrationLocator is present. A generic CGUS slice that asserts no transformation-flow provenance may leave both families absent. No slice may mix a partial one-TFS triple with either family.
The network locator does not admit new structure. Its transformationFlowStructureNetworkRef resolves to one independently identified, selected E.18.NET-conforming network. Every member path resolves through that network's exact direct members and ends in the TFS named by its leaf position. When networkPositionRef is a FlowPositionRef, the row's final member is the TFS named by that ref. When it is an ExposedFlowPositionRef, that ref's network, complete member path, and leaf position must equal this locator's network, this row's member path, and the resolved leaf position. A mismatch leaves the mapping out of the slice. Every admittedIncludedPositionRef is the same exact position already present both in this slice's includedStructurePositionRefs[] and in the admitted E.18.3 structure's transformationPositionRefs[]. The mapping rows locate that admitted list; they do not create a second raw or unadmitted position list.
Every selected cross-flow mapping preserves one already obtaining relation. First resolve networkCrossFlowRelationRowRef by value and require its named current E.18.NET record edition to describe this locator's exact transformationFlowStructureNetworkRef; then require exactly one row to match the occurrence and complete ordered endpoint-binding identity. A different network, zero matches, or several matches leaves the mapping out of the slice. Then resolve the cited TransformationFlowRelationReference@Context separately. The row and that episteme must agree on exact occurrence, relation kind, direct governor, signature, endpoint order, and endpoint position bindings. The relation-reference episteme must already occur in an applicable admitted E.18.3 relation-reference field. A raw occurrence ref, diagram edge, unresolved locator, or network-record row alone is not admitted into the slice.
The complete one-TFS triple may recur only inside memberLocalFlowLocatorRows[], where it locates one exact leaf-TFS position binding. It never becomes the network slice's top-level locator. A network slice has no network-global FlowValuation, pathSliceId, or DesignRunTag; each path slice and tag remains recoverable from one exact member-local row.
Positive case. A four-level build-the-builder demonstration follows a finite member path to one already admitted leaf position, maps it to the same included CGUS/E.18.3 position, cites an admitted exact cross-flow relation reference, and keeps the leaf path slice and tag in one member-local row. Near miss. A graph that supplies only raw positions or an edge label, mixes the top-level triple with the network locator, duplicates the included-position list, or assigns one tag to the network remains provisional or returns the exact admission blocker.
Demonstrated pattern-use rows
When a local pattern mantra is admitted as a DemonstrativeUnfoldingSlice@Context, mantra move is bounded Plain wording for one DemonstratedPatternUseRow@Context inside that slice. The row consumes A.6.5 SlotSpec discipline, but A.6.5 does not govern the row's identity. The row is not a root U-kind, an operation, or a work occurrence. It shows one result-bearing conditional continuation. A short repeatable formula that only recalls one pattern's Solution may still be a useful local mantra without containing such rows and without becoming a CGUS.
In publicTemplate mode, exactly the public candidate, question, result, and continuation positions are filled; the project positions are absent. In projectCandidate mode, exactly the project candidate, question, expectation, and continuation positions are filled; the public positions are absent. Applicability, recommendation, WorkPlan, and Work refs appear only when those values already exist.
The result-flow position is always present. An unresolved direct-pattern choice opens a separate nested pattern-selection slice. That slice returns a candidate, finding, or recommendation used by the enclosing row; it does not become the enclosing result-producing structure.
Pre-execution slot-filling scaffold
A provisional demonstration can hold attention on visible candidate positions before execution and before CGUS admission. Each visible position initially points to a subject-domain object, question, or proposed continuation and states which A.22.CGUS admission coordinate remains unresolved. It does not yet point to an admitted ConstraintGovernedUnfoldingPosition@Context.
Fill the scaffold in small passes. First name the visible candidate positions. Then recover the exact objects, kinds, relation signatures, constraints, invariants, guards, preserved structures, C.33 notes, next-form kinds, and stop or return conditions that would satisfy 4.2. Keep every unresolved coordinate explicit in the provisional description. Only after the wider structure is admitted may a separate demonstrative slice replace candidate descriptions with exact structure-position and relation refs.
Minimal first use. Write three visible candidate positions such as candidate, evaluate, and repair; describe the proposed relation that would make repair conditional on an evaluation result; and show both accept candidate and repair candidate as possible continuations. Keep this as a ProvisionalUnfoldingDemonstrationDescription@Context while the exact position kinds, relation instance, guard, preserved structure, or use boundary remains unresolved. It already helps a team hold the branch in attention without asserting the wider CGUS.
After CGUS admission, create a separate DemonstrativeUnfoldingSlice@Context, cite the provisional description as derivation basis, and map only the recovered candidate material to exact admitted positions and relations. The scaffold helps design the wider graph; neither provisional nor admitted presentation asserts project work order or authorizes work.
Bounded names and bridge
Mantra is broader Plain didactic wording for a short repeatable formulation that keeps a local pattern's Solution in attention. The word alone does not recover one universal FPF kind. A.6.P, for example, can publish a local RPR mantra that recalls its repair order without claiming a wider unfolding structure.
Other patterns may keep an established local name such as mnemonic, watchword, or heuristic when that name better tells their readers what the aid does. A.19's common-space comparison mnemonic, A.15.1's CAC mnemonic, and E.8's seven-step heuristic need not be renamed mantra. Conversely, an acronym, title mnemonic, or retrieval label is not a local mantra merely because it is memorable. These are Plain didactic choices interpreted from the local Solution and reader use, not rival FPF kinds.
This pattern governs only the narrower case in which a local mantra presents admissible conditional continuations through a named wider constraint-governed unfolding structure. In that case, mantra may name the admitted DemonstrativeUnfoldingSlice@Context, and mantra move may name one DemonstratedPatternUseRow@Context inside it. Neither label grants method, plan, order, authority, work, or teaching-medium identity.
Ordinary bounded use
In public FPF explanation, call the admitted slice a demonstrative walkthrough. In the bounded seminar context recorded below, mantra is the shorter repeatable name for that same demonstrative episteme. One mantra move is a DemonstratedPatternUseRow@Context: it names the direct pattern, its Solution, the expected result, and the condition for continuing. Outside this admitted CGUS-demonstrative use, interpret a local mantra from the pattern's own Solution and context rather than forcing it into DemonstrativeUnfoldingSlice@Context.
Naming settlement and bounded reuse
The F.18 cards below record the selected names for the governed A.22.CGUS values. The separate LocalSenseBasisRelation@Context values support the exact local-sense claims. The F.9 Bridge states only the semantic relation between the two exact F.17 cells. A separate ordinary C.2.1 assertion says whether that Bridge is suitable for the named seminar-to-public naming use, and A.10 separately governs reliance on that assertion. The cards carry none of the use direction, correspondence rule, loss tolerance, polarity, reliance, permission, or publication occurrence. PublicRowStatus=current and each UnifiedTermRowRef cite a separate current F.17 row; neither the card nor its inputs create that row. None adds a step to CGUS application.
The two expressions for the demonstrative slice and the local expression for its demonstrated row resolve through exact F.17 coordinates:
F.17:5.1 governs these scheme-based cells and basis relations, including their SlotKinds, value and reference kinds, direction, dependence, obtaining condition, and identity. The retained @Context suffix names lineage-compatible bounded local use; it introduces no context participant or U.BoundedContext slot.
SeminarExpression.FPFPracticalUse.2026-07-11 names the seminar-content episteme. The publication occurrence that makes one edition available and the .pptx and extracted Markdown carriers remain separate. The public basis relation instead uses the current A.22.CGUS pattern episteme as its basis and narrows that basis to the ordinary-use publication unit.
The cross-scheme relation and the row's named use are different objects:
The Bridge is Narrower-than because the seminar sense adds repetition and attentional use. That relation orientation grants no use. The separate affirmative claim states the exact SeminarTeaching-to-FPFPublic naming use, direction, rule, and tolerance; the A.10 relation and RelianceDisposition=pass support reliance only on that claim. The B.3 branch is absent because no assurance claim is made and this bounded reversible naming use stays below its material-reliance threshold; a later threshold would require B.3's first-claim decision and would not create a positive claim. Neither the NameCards, Bridge, claim, card, nor passing disposition authorizes publication, makes an E.17/E.24.PUB publication occurrence obtain, or proves that publication Work occurred.
The Bridge governs only these two senses of the CGUS-demonstrative value, not every local pattern mantra, and it does not establish the independently governed value identity. The seminar-content episteme supplies the teaching problem and local-sense basis; its publication occurrence and carriers do not. Current English dictionary evidence bears on the lexical choice but does not establish the Bridge or the bounded-use claim by itself. F.18 and reader-use evidence decide the names. A changed NameCard reopens naming without silently changing either sense. A changed SenseCell address, basis-episteme edition, or cited publication unit reopens the corresponding LocalSenseBasisRelation@Context; a changed supported-sense claim or use boundary opens another LocalSenseBasisRelationDescription@Context edition. A changed Bridge endpoint or profile reopens the relation, while a changed proposed use, rule, tolerance, evidence, or reliance reopens only its separately governed claim or reliance object.
Direct Governing Pattern Exits
CGUS carries the unfolding structure. It does not absorb stronger claims.
Use the word refresh only when a currentness, telemetry, edition, decay, or slice-local refresh claim is actually current. Otherwise use plain return, stop, split, or repair wording and name the direct governing pattern.
Direct Governing-Pattern Dependent Records
Some CGUS uses need dependent records that keep adjacent method, work, evidence, architecture, description, or publication claims inspectable. A.22.CGUS does not define those record schemas. Reliance on a stronger claim is admitted only when the corresponding CGUS field names its direct governing pattern.
For method and work linkage, use MethodWorkUnfoldingLinkage@Context, governed by A.15, only when a named receiving use relies on that relation remaining inspectable across method, method description, role assignment, capability-fit condition, work plan, readiness, performed work, evidence, assurance, or gate positions. If only one method, work-plan, readiness, performed-work, evidence, assurance, or gate claim is current, use that direct governing record instead.
For architecture use, use the C.32.P2S-owned ArchitectureUnfoldingStructureUse@Project only when a named unfolding structure is being used as architecture-relevant structure in problem-to-structure architecturing. If the current claim is only grounded architecture, structural view, architecture description, decision, ADR-like projection, measurement, eval, or performed realization work, use the direct pattern for that claim.
In ArchitectureUnfoldingStructureUse@Project and ArchitectureDecisionRelation@Project, @Project is a compatibility and retrieval cue only. It establishes no project entity, composite-work identity, context, authority, or parthood. When the current use is genuinely local to one actual project, C.32.P2S or C.32.PAD must name the exact composite U.Work and the direct relation that connects the unfolding-structure use or architecture decision to that work. A.22.CGUS neither infers nor owns that project-work relation.
This keeps A.22.CGUS thin: it governs the constraint-governed unfolding structure and its safe next-use boundary, while A.15, C.30, C.32, evidence, gate, publication, and domain patterns govern the adjacent records that carry stronger claims.
Promoted Core Family Cue Examples
The FPF core may promote a few short family cues when a cue helps readers recover a familiar governing pattern and a common blocked overread. This is an example device, not a maintained list of all CGUS families.
For example, UF.P2S can be useful when an architecture-facing question moves from problem pressure to candidate, selected, expected, or actual structures. The cue points the reader toward C.32.P2S and warns that a P2S card is not itself the architecture decision, architecture description, ADR, or realization work.
For example, UF.IMP can be useful when an object version, evaluation frame, candidate repairs, and re-evaluation are current. The cue points toward E.23 and warns that a retry loop or prompt loop is not quality improvement by shape.
For example, UF.REFRESH can be useful when a G.11 source-currentness relation, telemetry, evidence decay, or edition shift is current. The cue points toward G.11 and warns that a stale reference set is not current authority.
If no promoted cue helps, omit the cue. Do not invent a core UF.* cue merely to make a CGUS use look governed. DPFs and project-local frameworks may carry their own local cue examples when useful, but the governing claim still comes from the local governing-pattern map and the relevant pattern bodies.
Replay and change localization
Replay one CGUS use from its bounded context, unfolded structure, subject EntityOfConcern and kind, current position fillings, exact referenced relation instances, constraints, invariants, guards, preserved structures, C.33 adequacy notes, admissible next-form kinds, and use boundaries. For each selected continuation, recover the relations and guards that admit it and the direct pattern governing any stronger claim. A demonstrative slice is replayable only as one declared presentation of that wider structure.
Localize a change before reopening wider work. A changed relation instance reopens that reference and its dependent guards or continuations. Changed omitted structure reopens the affected C.33 adequacy note and any slice relying on it. A changed presentation changes the demonstrative slice without changing the CGUS unless it reveals missing or false structure. A freshness, edition, telemetry, or decay change is handled by its exact G.11 relation. A changed method, work, evidence, architecture, publication, or formal claim returns to the direct governing pattern for that claim. Rebuild the wider CGUS only when its structure identity, position set, relation structure, constraints, or declared use boundary has changed.
Worked Slices
Architecture P2S slice. A team starts with architecture-relevant problem pressure. The unfolding structure may relate problem pressure, unknown structures, candidate structures, architecture characteristics, one ProjectArchitectureDecision@Context governed by C.32.PAD, realization-work linkage, actual-structure feedback, and return conditions. The P2S flow card can describe those relations, but the decision relation remains governed by C.32.PAD, architecture descriptions by C.30.AD, and planned or performed work by the A.15 family.
Abductive search slice. An inquiry starts from an abductive prompt and a cue set selected for the search. The unfolding structure may relate rival hypotheses, plausibility constraints, hypothesis-generation positions, evidence-return relations, and downstream tests. The structure is not evidence; evidence appears only when an evidence pattern governs the claim.
Improvement-loop slice. A pattern version has an evaluation frame and current evaluation result. The unfolding structure may relate E.22 CandidateImprovementProposalRow@Context values, protected tradeoffs, scale-qualified E.23 ExpectedEvaluationResultChange@Context predictions, one ImprovementLoopDecisionValue, and re-evaluation. The loop is not improvement by shape; E.23 governs repeated improvement only after the object version, evaluation frame, proposal rows, expected result changes, loop decision, and stop or return boundaries are recoverable.
First-entry seed slice. A README entry says "develop or review architecture." That line may seed an entry unfolding among problem-side records, candidate first governed records, likely governing-pattern returns, and next readable outputs. The README line is a seed description, not the project's unfolding structure and not a universal FPF route.
Field-filled scaffold slice. A team has a visible card sequence "problem pressure -> candidate options -> eval -> repair." At first this is a ProvisionalUnfoldingDemonstrationDescription@Context about the cooling-design question and proposed continuations. After every admission coordinate below is recoverable, the team may admit the wider CGUS and create a separate demonstrative slice over it:
The same visible chain helps planning because each position asks for a slot. It does not make the project follow that order and does not authorize work.
Local relation repair slice. Later EvaluationResult@thermal-margin-v2 becomes the current result for the same cooling candidate. Keep the candidate set, structure positions, service-access constraint, maintainable-cooling-path invariant, and return boundaries. Replace only the referenced CandidateEvaluatedByResult relation instance, then re-evaluate RepairAdmissionGuard under its direct governing pattern. If the new result does not satisfy the guard, remove repair candidate from the admissible next forms and update the demonstrative slice that showed that branch; the unrelated accept candidate continuation remains live. A changed result therefore repairs one relation and its dependent guard before it changes a wider graph.
Schema-completion proxy failure. A team counts filled CGUS fields and adds weakly used references until the completion count rises. Update effort then grows, practitioners stop repairing changed relation instances, and wrong next-form choices increase. The count describes field population only; it does not establish recoverability, currentness, or practical value. Remove references without a receiving use, evaluate whether practitioners recover the correct live alternatives and smallest repair, and use [E.13](/generated/patterns/E.13) when field completion is substituting for those outcomes.
Reference-currentness slice. A SoTA pack relies on telemetry and admitted publication editions that can decay. CGUS may relate the current reference set, edition-shift relations, decay triggers, possible deprecation or reship records, and a return boundary. The structure is not the currentness claim; [G.11](/generated/patterns/G.11) governs freshness, telemetry, decay, deprecation, reship, and no-change claims.
Physical-modeling slice. A team models a physical system or another governed EntityOfConcern whose behavior depends on component relations, conservation-like constraints, operating modes, calibration data, and analysis goals. CGUS may relate the model structure, admitted measured data, mode-change relations, compiler boundary, solver boundary, surrogate-substitution relation, and returns to calibration or model-discovery work. In a digital-twin case, the physical entity, digital model, measured-data history, simulation outputs, services, and bidirectional correspondence relations keep their exact kinds and direct governing patterns. A simulation run, generated code, exchange package, AI-assisted model edit, calibration result, and digital-twin publication are separately governed results. Acausal modeling is useful here because it shows that relations and constraints can be stated before a calculation direction is chosen; [C.29](/generated/patterns/C.29), [G.11](/generated/patterns/G.11), [E.23](/generated/patterns/E.23), evidence patterns, and domain DPF patterns govern stronger mathematical, currentness, evaluation, evidence, or domain-validity claims.
Formal-expression boundary slice. A team expresses part of the cooling CGUS as a DCR graph or constraint-solver model to check whether the repair candidate branch is reachable under RepairAdmissionGuard. The expression preserves selected positions, dependency relations, and the guard. It loses direct governing-pattern exits, C.33 adequacy notes, and any relation not encoded in the chosen formalism. Record that preservation and loss under [C.29](/generated/patterns/C.29), use the output only for the declared reachability question, and return to CGUS before selecting the next form. Satisfiability or reachability does not establish that the expression is the CGUS, prescribe performed-work order, prove architecture adequacy, or authorize work.
Method-to-work linkage slice. A method description is admitted because it may realize a governed structure change or change set. CGUS may organize the method relation, work-plan seed, readiness condition, expected structure effect, evidence or gate linkage, and stop condition. It does not authorize work. The method, plan, work-entry readiness, performed work, evidence, assurance, and gate claims remain with A.3, A.15, A.10, B.3, A.20, and A.21.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns And Repairs
Consequences
CGUS gives FPF a way to preserve route-shaped usefulness without turning route-shaped artifacts into workflows. A practitioner can see admitted starting records, current starting structures, constraints, possible next forms, alternatives, and return conditions while still knowing which direct pattern governs method, work, evidence, gate, decision, architecture, publication, refresh, or mathematical use.
The cost is extra kind discipline. CGUS admission depends on named typed positions, exact relation references, cross-position constraints, preserved structures, C.33 adequacy notes where the presentation omits relevant structure, non-admissible overreads, and direct pattern exits. If that is too heavy, the right result is a compact provisional demonstration description; an admitted demonstrative slice becomes available only after the wider CGUS exists.
Rationale
The selected design is a thin A.22 specialization of U.Structure because the recurring object is real but not a new root ontology. Constraint-based process modeling, case-management practice, artifact-centric modeling, acausal modeling, architecture-description practice, and FPF's own pattern use all separate a constraint-bearing structure from a performed trace, work order, view, publication, solver run, or example path. FPF adopts that separation as a constraint-governed unfolding structure and refuses to import one universal process calculus.
Physical modeling makes the same distinction concrete. In acausal modeling, component relations, quantities conserved across connections, and mode conditions can be declared before the model is compiled and solved in one chosen direction. The FPF import is only the general architecture of the move: structure and constraints first; derived calculation, demonstration, calibration, publication, or work use later under direct governing patterns.
CGUS is deliberately close to A.22. It is a U.Structure over a declared substrate in a bounded context. Descriptions, views, graph renderings, route cards, README entries, and examples help humans use it; they do not become it.
SoTA-Echoing
As of 2026-07-11, OCPQ supplies the current research comparator for typed multi-object constraint queries, while Modelica 3.7 and Dyad 3.1.0 supply the current engineering comparator for relation-first acausal models separated from analyses and execution artifacts. The older CMMN, Declare, DCR, and artifact-centric rows provide lineage and known distinctions, not present-day authority by age or official status. These sources changed 4.2 by requiring graph-shaped and many-to-many recovery, 4.3 by separating a demonstration from the wider structure, and the physical-modeling slice by separating reusable relations from analysis and execution. Reopen these adoptions when a newer object-centric constraint method changes the treatment of objects or relations, when the modeling languages change component-relation or analysis separation, or when use evidence shows that the imported distinction no longer prevents chain or execution-artifact overread.
Relations
Specializes: the A.22 use of U.Structure when the selected structure is ConstraintGovernedUnfoldingStructure@Context and its typed positions, exact referenced relations, cross-position constraints, preserved structures, C.33 adequacy notes, admissible next-form kinds, and direct governing-pattern exits are current.
Specialized by: E.18.3 for transformation-flow unfolding structures, including admitted positions and relation-reference epistemes cited by a network demonstration locator; and by local blocks in E.18.1, C.32.P2S, B.5.2, A.6.3.NAR, E.23, C.13, B.3.5, and C.3 when their admission tests pass.
Coordinates with: E.18 for the complete one-TFS locator triple, E.18.NET for one selected E.18.NET-conforming TFS network and member paths, E.11 for public practical-use card expansions, ordinary walkthroughs, and admitted CGUS-demonstrative walkthroughs, E.10.MOVE and C.2.P.DR for lexical and declarative-representation repair, C.18, C.19, and G.5 for archive, front, live-pool, and selected-set claims, G.11 for currentness and refresh claims, and E.17 for publication of provisional descriptions or admitted demonstrative slices.
Does not replace: A.3.1, A.3.2, A.15, A.10, B.3, A.20, A.21, C.30, C.32.PAD, C.32.ADR, C.29, G.11, or any direct governing pattern for stronger claims.
A.22.CGUS:End
Last Updated: 2026-07-28 — upstream FPF commit 17edd955 (github.com/ailev/FPF)