Part B — Trans-disciplinary Reasoning Cluster

Preface node heading:part-b-trans-disciplinary-reasoning-cluster:31121

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

Holon Aggregation and Part-Whole Construction

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a project needs to say how several admitted objects are considered as a whole, or when a whole-level claim depends on parts, membership, component structure, constructional grounding, or a selected aggregation rule.

Typical moments:

  • a product, plant, dataset, paper, model family, organization, fleet, batch, or research program is discussed as a whole;
  • a dashboard rolls part measurements into a whole-level characteristic;
  • a team says that a method, role, graph, or algebra "decomposes" something and may be smuggling part-whole claims;
  • a collection needs whole-level characteristics without becoming an acting collective system;
  • an aggregation claim is being used for architecture, assurance, evidence, or MHT reasoning.

First useful move. Recover the claim kind before choosing notation: part-whole construction, membership, collection-as-whole grounding, role relation structure, method relation structure, work occurrence holarchy, selected architecture structure, or mathematical description.

What goes wrong if missed. Γ, graph, algebra, decomposition, factor, component, step, phase, and collection wording become one universal composition language. Roles and methods become parts; work occurrence evidence is inferred from method structure; a graph is mistaken for the structure; a collection becomes an acting whole by label.

What this buys. B.1 gives one doorway into part-whole construction while keeping its neighbors clean: A.14 owns relation vocabulary, C.13 owns constructional grounding, B.3.5 owns Working-Model assurance grounding, A.15.1 owns work-occurrence holarchy, and C.29 owns mathematical-lens use.

Not this pattern when.

  • If the question is the local relation word, use A.14.
  • If the question is constructive part-whole grounding, use C.13.
  • If the question is assurance grounding for a working model, use B.3.5.
  • If the question is role or method relation structure, use the role or method owner and C.29 when a mathematical lens is relied on for the current claim.
  • If the question is performed-work occurrence parts, use A.15.1.
  • If the question is whole reidentification or emergence-family wording, use B.2 or B.2.P.

Problem Frame

B.1 is not a universal algebra pattern. It is the holonic construction doorway for part-whole and collection-as-whole claims.

The older Γ material remains useful only after the ontology-side claim has been recovered. Γ, graph, algebra, tuple, matrix, embedding, and neural representation can express or check a selected structure; they do not decide by spelling that the current object is a holon, that the relation is parthood, or that a role, method, step, or work occurrence is a part of a holon.

Problem

Without B.1:

  1. Mereology and notation collapse. A graph or algebra is treated as the part-whole structure itself.
  2. Roles and methods become parts. Role factors, method parameters, guards, steps, and compositions are read as holonic parts because the same word "decomposition" appears.
  3. Work occurrence is inferred from plan. A method decomposition or schedule is treated as evidence that performed work had those parts.
  4. Collections become acting systems. A set, list, batch, fleet, or community receives agency, responsibility, or capability without A.1 and role-method-work admission.
  5. Emergence becomes rhetoric. A whole-level gain is explained by "synergy" or "more than the sum" without checking existing-whole explanations or B.2 whole reidentification.

Forces

ForceTension
Part-whole usefulness vs ontology explosionFPF needs whole-level reasoning without minting a U-kind for every composed expression.
Constructional grounding vs math convenienceAlgebra and graphs can make checks precise, but only after the ontology-side object and relation are selected.
Collection value vs false collective agencyCollections can have useful whole-level characteristics without becoming acting systems.
Method planning vs performed workA method can guide expected decomposition; work occurrence parts require actual occurrence identity, timing, and evidence.
Emergence recognition vs ordinary repairSome whole-level gains require B.2; many are explained inside the existing whole by ordinary part, method, measurement, or architecture repair.

Solution

Use B.1 as a discriminator and construction frame.

Holon Aggregation Claim Frame

When part-whole construction is current, recover:

HolonAggregationClaim@Context:
  candidateWholeRef: U.Holon
  candidatePartRefs:
  boundedContextRef:
  identityOrRecognitionRule:
  partRelationRefs:
  constructionBasisRef?
  selectedStructureRef?
  wholeLevelCharacteristicRefs?
  assuranceGroundingRef?
  neighboringNonPartRelationRefs?
  mathLensOrRepresentationRef?

This is a claim frame, not a U-kind and not an acting record. It says what must be named before the aggregation claim is relied on.

Use:

  • [A.14](/generated/patterns/A.14) for ComponentOf, ConstituentOf, PortionOf, PhaseOf, MemberOf, aspect, and related vocabulary;
  • [C.13](/generated/patterns/C.13) for constructional grounding such as sum, set, slice, or another accepted construction;
  • [B.3.5](/generated/patterns/B.3.5) when a working model relies on the part-whole claim for assurance or evidence;
  • [C.16](/generated/patterns/C.16) when the current output is a whole-level characteristic;
  • [A.1](/generated/patterns/A.1) and [A.15](/generated/patterns/A.15) when the whole is claimed to be an acting collective system.

Didactic Firewall

Source claimOntology-side recoveryDirect owner
"This object is made of these parts."Part-whole construction over admitted holons.A.1, A.14, C.13, B.3.5 when assurance is current.
"These members form a collection."Membership or collection-as-whole grounding; no ComponentOf inference.A.14, C.13, C.16 for whole-level characteristic.
"This role is combined from role factors."Role relation structure or role naming; not holonic parthood by default.A.2.7, role patterns, C.29 if mathematical lens is selected.
"This method has steps, parameters, guards, or variants."Method relation structure, method family, method description, or work plan; not performed work by default.A.15, method owners, C.29 if mathematical lens is selected.
"This run contained episodes or concurrent sub-runs."Work occurrence holarchy with timing, evidence, occurrence identity, and work-part relation.A.15.1, temporal owner, evidence owner.
"This graph or algebraic notation represents the structure."Mathematical or representation description of a selected structure.C.29, A.22, architecture or description owner.
"The whole shows emergence."Existing-whole explanation first; B.2 only when the whole itself must be reidentified.B.2, B.2.P, or the direct characteristic, measurement, architecture, capability, or work owner.

Work Occurrence Holarchy

Performed work is different from structural composition.

A work occurrence can have temporal parts, episode parts, operational parts, concurrent sub-runs, retries, resource roll-ups, and effect composition. That is a work-occurrence holarchy governed by A.15.1, not evidence that the method or role expression is a holonic part-whole structure.

Use A.15.1 when the claim needs occurrence identity, temporal coverage, Gamma_time, Gamma_work, episode policy, overlap policy, resource aggregation, or performed-work evidence.

Mathematical And Representation Apparatus

Use Γ, graph, algebra, tuple, matrix, embedding, or neural representation only after the object under concern and selected relation are named.

Acceptable uses:

  • a mathematical lens for a selected structure;
  • a constructional expression for a part-whole claim already admitted by A.14 and C.13;
  • a representation of dependency relations;
  • a checking apparatus for invariants or conservative bounds.

Blocked uses:

  • graph wording as parthood admission;
  • algebraic factorization as role, method, or work parthood admission;
  • source notation as a new U-kind;
  • one fold rule as a universal replacement for the direct owner.

Existing-Whole Before MHT

Before declaring B.2 whole reidentification, ask whether the whole-level gain can be explained inside the existing whole:

  • better parts;
  • corrected part relation;
  • improved measurement;
  • role or method relation repair;
  • work occurrence evidence repair;
  • functional or architecture selected-structure repair;
  • source, publication, or representation correction.

Use B.2 only when the whole itself must be reidentified.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Apparatus as ontologyGraph, algebra, tuple, matrix, embedding, or Gamma notation decides the object kind by spelling.Recover the holon, relation, selected structure, and mathematical-lens use separately.
Decomposition as parthoodRole factors, method steps, phases, or work episodes are treated as holonic parts by label.Use the direct owner for role, method, temporal, work, or part-whole claims.
Collection as acting wholeA set, list, batch, fleet, or community receives agency or responsibility by plural naming.Recover collection grounding, whole-level characteristic, or acting collective system under direct owners.
Emergence rhetoric"More than the sum" replaces existing-whole explanation.Test measurement, architecture, role, method, work, and evidence explanations before B.2 whole reidentification.

Evidence Corpus

A corpus can be a collection-as-whole under MemberOf and C.13 set construction. Its whole-level characteristics may include coverage, source freshness, bias exposure, or evidential diversity.

The corpus does not become an acting system. A review board, script, or research team may be an acting system in role. The corpus may be an episteme or publication-side object under direct owners.

Method With Steps

A machining method has ordered steps and parameters. Those steps are method relation or method-description material. They do not prove that a performed machining run occurred, nor that the run had the same parts.

If the current claim is the method structure, use method owners and C.29 when algebra is selected. If the current claim is the actual run, use A.15.1.

Bias-Annotation

Bias riskFailureMitigation
Apparatus as ontologyGraph, algebra, tuple, matrix, embedding, or Gamma notation decides the object kind by spelling.Recover the holon, relation, selected structure, and mathematical-lens use separately.
Decomposition as parthoodRole factors, method steps, phases, or work episodes are treated as holonic parts by label.Use the direct owner for role, method, temporal, work, or part-whole claims.
Collection as acting wholeA set, list, batch, fleet, or community receives agency or responsibility by plural naming.Recover collection grounding, whole-level characteristic, or acting collective system under direct owners.
Emergence rhetoric"More than the sum" replaces existing-whole explanation.Test measurement, architecture, role, method, work, and evidence explanations before B.2 whole reidentification.

Conformance Checklist

CheckRequirement
CC-B1-1The current claim identifies whether it is part-whole, membership, collection-as-whole, role relation, method relation, work occurrence holarchy, selected structure, or mathematical description.
CC-B1-2Part-whole claims name admitted holons, bounded context, identity or recognition rule, part relation, and constructional owner.
CC-B1-3A.14 and C.13 remain direct owners for relation vocabulary and constructive grounding.
CC-B1-4Role and method relation structures are not treated as holonic parts merely because a label, graph, algebra, or naming convention composes them.
CC-B1-5Performed work occurrence parts return to A.15.1.
CC-B1-6Mathematical and representation apparatus is named as lens or expression, not as ontology by spelling.
CC-B1-7B.2 is used only when the whole itself must be reidentified after existing-whole explanations fail.
CC-B1-8No generic U.Boundary, U.Interaction, U.Level, U.Emergence, or U.Frustration is introduced by aggregation wording.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Gamma as head ontologyΓ is treated as the thing that makes all wholes.Recover the ontology-side claim first; use Γ only as constructional or mathematical apparatus when selected.
Graph as structureA diagram or graph is treated as the part-whole structure.Name the selected structure and relation owner; keep the graph as representation or math lens.
Method as workA method decomposition is used as evidence that work occurred.Use A.15.1 for performed-work occurrence and evidence.
Collection as acting wholeA list or pool decides, acts, or bears responsibility.Recover membership, collection-as-whole, whole-level characteristic, or acting collective system under direct owners.
Emergence by narrative"More than the sum" replaces existing-whole analysis.Check existing-whole explanations before B.2.

Consequences

Positive consequences:

  • B.1 can still use useful aggregation apparatus without letting apparatus choose the ontology.
  • Holonic part-whole claims become reviewable.
  • Role, method, work, math-lens, and publication descriptions stop leaking into mereology.
  • B.2 has a cleaner entry condition: whole reidentification, not ordinary improvement rhetoric.

Costs:

  • Users must identify the claim kind before choosing a notation.
  • Some Gamma-heavy examples require a direct owner before the notation is used: work occurrence evidence uses A.15.1, work-resource aggregation uses B.1.6, mathematical-lens reliance uses C.29, and whole reidentification first uses B.2.P and then B.2 when the problem remains current.
  • Work occurrence analysis requires evidence and timing, not just a method plan.

Rationale

The practical force of B.1 is conservative. Whole-level reasoning is useful, but it must be grounded in accepted part-whole relations, constructional discipline, and direct pattern ownership. This lets FPF speak across physical systems, epistemes, work occurrences, bounded contexts, disciplines, and collections without growing a new type for every composed expression.

Mathematical apparatus remains available. It becomes more useful after the governed object is known: graph for dependency representation, algebra for selected composition rules, tuple for slot relation expression, matrix or embedding for analysis, and C.29 when a mathematical lens is relied on for the current claim.

SoTA-Echoing

Source familyCurrent lesson for B.1FPF decision
Constructional ontology and applied ontology practiceWhole identity, dependency, and construction need explicit grounding rather than unrestricted composition.B.1 requires A.14 relation vocabulary and C.13 constructional grounding before part-whole claims are relied on.
Systems engineering and digital engineering practiceWhole-level characteristics and architecture views need traceable part relations and selected structures.B.1 separates part-whole construction from selected-structure descriptions, dashboards, and mathematical representations.
Method and process-modeling traditionsPlans, procedures, and performed occurrences are often conflated.Method relation structure remains with method owners; performed-work holarchy remains with A.15.1.
Emergence and holonic systems practiceGenuine whole-level novelty must be distinguished from measurement, architecture, role, method, or work repair.B.2 owns whole reidentification after existing-whole explanations are tested.

Relations

  • Builds on: A.1 for holon admission, A.14 for relation vocabulary, C.13 for constructional grounding, and B.3.5 for Working-Model assurance grounding.
  • Coordinates with: A.15 and A.15.1 for method and work, A.22 and C.30 for selected structure and architecture, C.16 for whole-level characteristics, C.29 for mathematical lenses, and B.2 for whole reidentification.
  • Refined by: B.1.1, B.1.2, B.1.4, and B.1.6 for selected dependency, system aggregation, contextual-temporal aggregation, and work-resource aggregation cases.

B.1:End

Dependency Structure and Relation Grounding

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when an aggregation, architecture, assurance, or construction claim depends on how candidate parts, members, phases, portions, or external relations depend on each other.

Typical moments:

  • a dependency diagram is used to justify a whole-level claim;
  • a graph mixes parthood, mapping, order, time, resource, and boundary-crossing relations;
  • a project needs to know whether a relation is part-whole, dependence, representation, influence, source use, publication use, or evidence relation;
  • a selected dependency structure will be expressed with a graph, table, matrix, or another mathematical or representation lens.

First useful move. Name the dependency relation under concern before choosing graph notation. Then decide whether the relation is part-whole, boundary crossing, order, temporal phase, resource relation, mapping, evidence, publication use, source use, or another directly governed relation.

What goes wrong if missed. A graph becomes the ontology; an edge named "depends on" carries many relation kinds at once; external influence becomes parthood; order and time are encoded as structure; and mathematical checks look precise while the relation being checked remains unclear.

What this buys. B.1.1 lets dependency material bear on B.1 aggregation without letting graph notation decide relation kinds.

Not this pattern when.

  • If the current relation word is a mereology question, use A.14.
  • If the current part-whole claim needs constructional grounding, use C.13.
  • If the current object is architecture selected structure, use A.22 and C.30.
  • If the current expression is mathematical-lens choice, use C.29.
  • If the current question is performed work, use A.15.1.

Problem Frame

B.1.1 separates dependency structure from graph representation.

A dependency structure can be ontology-side when a direct pattern has selected the relation under concern. A dependency graph is a mathematical or representation description of that selected relation structure. The graph may be useful, but it is not the holon, not the part-whole relation, and not the constructional grounding by itself.

Problem

Without B.1.1:

  1. Edge drift spreads. ComponentOf, MemberOf, PhaseOf, SerialStepOf, RepresentationOf, source use, evidence relation, and control relation all become generic graph edges.
  2. Boundary crossing becomes parthood. A power grid, supplier, teacher, measuring instrument, model, or source record is drawn as a part because it affects the holon.
  3. Design and run objects mix. Planned structure, design description, actual work occurrence, and telemetry are placed in one dependency expression without a DesignRunTag or owner distinction.
  4. Acyclic graph discipline overclaims. A graph check says something about the drawing, but the ontology-side relation remains ungrounded.
  5. Mappings become parts. A digital twin, dashboard, diagram, or architecture description is treated as a constituent of the object it describes.

Forces

ForceTension
Visual clarity vs relation precisionGraphs make dependencies visible but tempt one-edge-fits-all modeling.
Part-whole locality vs external influenceExternal systems can influence, measure, transform, or supply a holon without becoming its parts.
Mathematical checks vs ontology-side groundingAcyclicity, cutsets, reachability, and flow checks help only after relation kinds are selected.
Design view vs run evidenceDesign-time dependency descriptions and run-time evidence often share labels but have different governed objects.

Solution

Use dependency structure first; use graph representation second.

Dependency Structure Frame

DependencyStructure@Context:
  structureUnderConcernRef:
  boundedContextRef:
  candidateNodeRefs:
  dependencyRelationRefs:
  partWholeRelationRefs?
  boundaryCrossingRelationRefs?
  orderRelationRefs?
  temporalRelationRefs?
  resourceRelationRefs?
  representationRelationRefs?
  evidenceRelationRefs?
  publicationOrSourceUseRefs?
  designRunTag?
  directOwnerRefs:

This frame is not a U-kind. It records which relation claims are current and which direct owners govern them.

Graph Representation

Use graph language only when a graph is the selected mathematical or representation lens:

DependencyGraphRepresentation@Context:
  representedDependencyStructureRef:
  nodeExpression:
  edgeExpression:
  graphPropertyChecks?
  mathLensRef?
  publicationOrViewRef?

The graph may express acyclicity, reachability, cutsets, weak links, flow, or traceability. Those checks apply to the graph expression and bear on the selected relation only when the relation owner admits the mapping.

Relation Grounding Guide

If the edge means...Recover...Direct owner
part of the wholepart-whole relation over admitted holonsA.14, C.13, B.1
member of a collectionmembership or collection-as-whole claimA.14, C.13, C.16
phase of the same carriertemporal phase relationA.14, temporal owner, B.1.4
ordered step or branchmethod, process-view, or order relationmethod owner, B.1.4, C.29 when lens is current
performed work partwork occurrence relation with evidence and timingA.15.1
external influence, signal, supply, measurement, or controlboundary-crossing relation or direct transformation, evidence, measurement, source-use, or control relationA.1, A.3.4, A.10, C.26, or direct owner
representation, dashboard, digital twin, or architecture descriptiondescription or representation relation, not parthoodC.2.1, E.17, C.30.AD, C.30.AD.BA

Graph Checks Are Conditional

Acyclicity, topological order, cutset, reachability, and flow checks are useful only after the graph is selected as a lens over a selected relation structure.

Do not infer:

  • parthood from graph adjacency;
  • independence from graph separation without relation-owner admission;
  • performed work from a planned step graph;
  • whole reidentification from a graph property without B.2;
  • architecture from a graph without selected-structure and architecture owners.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Graph as ontologyA graph node or edge is treated as the in-life object or relation.Recover the dependency structure and direct relation owners before graph expression.
One-edge-fits-alldepends on carries parthood, order, representation, source use, evidence, and influence at once.Split relation kinds and assign direct owners.
External influence as parthoodSupply, measurement, teaching, source use, or control is drawn as a component relation.Use boundary-crossing, evidence, source-use, publication-use, transformation, or direct relation owner.
Design-description and run-occurrence collapseA planned dependency graph is treated as evidence of performed work.Separate design description, work occurrence, and evidence relations.

Digital Twin

Source graph: DigitalTwin -> Turbine.

If the edge means representation, recover the architecture-description, publication, source-use, evidence, or digital-twin relation. The digital twin is not a turbine component by graph adjacency.

Work Plan And Work Occurrence

Source graph: Prep -> Weld -> Paint.

If the graph describes a method or process view, use the method and order owners. If the graph describes performed work, use A.15.1 with occurrence identity, timing, evidence, and work-part relation. Do not let the same graph do both jobs.

Bias-Annotation

Bias riskFailureMitigation
Graph as ontologyA graph node or edge is treated as the in-life object or relation.Recover the dependency structure and direct relation owners before graph expression.
One-edge-fits-alldepends on carries parthood, order, representation, source use, evidence, and influence at once.Split relation kinds and assign direct owners.
External influence as parthoodSupply, measurement, teaching, source use, or control is drawn as a component relation.Use boundary-crossing, evidence, source-use, publication-use, transformation, or direct relation owner.
Design-description and run-occurrence collapseA planned dependency graph is treated as evidence of performed work.Separate design description, work occurrence, and evidence relations.

Conformance Checklist

CheckRequirement
CC-B1.1-1A dependency claim names the relation kind before graph notation is relied on.
CC-B1.1-2Graph, matrix, table, or diagram wording is treated as mathematical or representation expression unless a direct owner selects it as the structure under concern.
CC-B1.1-3Part-whole edges use A.14 and C.13 discipline.
CC-B1.1-4Boundary-crossing, transformation, evidence, source-use, publication-use, and representation relations are not recast as parthood.
CC-B1.1-5Design description, run occurrence, and evidence are not mixed without direct owners and DesignRunTag or equivalent scope discipline.
CC-B1.1-6Graph checks are interpreted only through the selected relation owner and C.29 when the mathematical lens is relied on for the current claim.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
DependencyGraph as ontologyThe graph is treated as the thing being built.Name the dependency structure and relation owners first.
External supplier as partA supplier or infrastructure system is drawn inside the product.Use a boundary-crossing relation, supply relation, commitment relation, A.6.C contract-language unpacking, evidence relation, publication-use relation, source-use relation, or another direct owner; use parthood only for admitted parts.
Mapping as parthoodA model, dashboard, or digital twin is a node inside the asset.Use representation, publication, architecture-description, or evidence owners.
Order as componentA subsequent step is represented as a component of an earlier step.Use order, method, or work occurrence owners.
Acyclicity as adequacyThe graph has no cycles, so the model is accepted.Check whether the selected relation is grounded and whether graph checks answer the current concern.

Consequences

Positive consequences:

  • Dependency views become useful without becoming hidden ontology.
  • External influences can be discussed without corrupting parthood.
  • Graph checks keep their value and their limits.
  • B.1 aggregation receives cleaner part-whole inputs.

Costs:

  • A diagram alone is no longer enough; relation kinds and owners must be named.
  • Some compact dependency graphs need multiple relation layers or views.
  • Graph-based checks may need C.29 when the mathematical lens is relied on.

Rationale

Dependency language is useful exactly because it is broad. That breadth is also the danger. FPF keeps the breadth for recognition, then restores precision by separating relation kinds, selected structures, mathematical expressions, and publication forms.

B.1.1 therefore does not abolish dependency graphs. It makes them honest: a graph represents a selected relation structure; relation grounding comes from the direct owners.

SoTA-Echoing

Source linePractical implication for this pattern
Systems engineering dependency modelingDependency views are useful only when edge meaning is declared and traceable to the current engineering concern.
Graph theory and mathematical-lens practiceA graph property applies to the graph expression; it bears on the object only through an admitted mapping to the selected relation.
Applied ontology relation disciplinePart-whole, membership, representation, evidence, source-use, and influence relations have different admissibility conditions.
FPF design-description and run-occurrence distinctionA design dependency expression and a performed-work occurrence need separate owners and evidence.

Relations

  • Builds on: B.1, A.1, A.14, C.13, and A.6.5.
  • Coordinates with: A.15.1 for work occurrence, B.1.4 for contextual and temporal aggregation, C.29 for graph as mathematical lens, A.22 and C.30 for selected structure and architecture, C.30.AD and C.30.AD.BA for architecture description and digital-twin cases.
  • Can contribute evidence to: B.2 when dependency evidence bears on whole reidentification after existing-whole explanations fail.

B.1.1:End

System Aggregation and Holon Delimitation

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a physical, operational, organizational, cyber-physical, or socio-technical system is treated as a whole made from parts, and the aggregation claim depends on how the system is delimited from its environment.

Typical moments:

  • a machine, plant, robot, vehicle, building asset, service organization, or operating unit is aggregated from components or subholons;
  • a system-level characteristic is rolled up from component characteristics;
  • an external signal, supply, measurement, control, source, or publication relation is being mistaken for a part;
  • a functional element must be allocated to candidate physical or organizational bearers;
  • a boundary-interface-compatibility check is needed for a system aggregate.

First useful move. Name the candidate system whole, the candidate part relations, and the holon delimitation relation. Then decide which crossing relations remain external, which become internal after aggregation, and which are represented in a view or publication.

What goes wrong if missed. System aggregation becomes a drawing exercise. Ports, suppliers, documents, digital twins, dashboards, source records, and measuring instruments become components by placement. Functional parts become physical parts by label. External change or measurement is read as containment.

What this buys. B.1.2 makes system aggregation usable for engineering while keeping part-whole, holon delimitation, boundary crossing, functional structure, module allocation, and mathematical expression distinct.

Not this pattern when.

  • If the object is not an admitted U.System or candidate system, use A.1 first.
  • If the question is generic part-whole vocabulary, use A.14.
  • If the question is constructive grounding, use C.13.
  • If the question is functional behavior or functional element, use A.6.F and architecture structural-view owners.
  • If the question is module or bearer allocation, use A.6.M and architecture owners.
  • If the question is a mathematical aggregation lens, use C.29.

Problem Frame

B.1.2 specializes B.1 for system holons. It keeps the useful engineering concerns from system-specific aggregation: physical plausibility, system delimitation, external crossing relations, component integration, whole-level characteristics, and boundary-interface compatibility.

It does not make Gamma_sys the pattern head. It does not create generic boundary or interaction U-kinds. It does not say that a system changing another holon becomes the changed holon's super-holon.

Problem

Without B.1.2:

  1. Boundary by drawing. A box in a diagram is accepted as system delimitation.
  2. External relations become parts. Suppliers, grids, sensors, controllers, teachers, measuring instruments, or digital twins are placed inside the system because they interact with it.
  3. Functional and physical structures collapse. A resistor symbol, control function, chassis function, or service role is treated as a physical component by label.
  4. Whole-level characteristics lack grounding. Mass, capacity, reliability, safety, throughput, assurance, or agency-like characteristics are rolled up without saying which part relations and scales are used.
  5. Transformation becomes containment. A tool, teacher, actuator, script, or controller changes a holon and is then treated as that holon's containing whole.

Forces

ForceTension
Engineering concreteness vs broad FPF holon scopeSystem aggregation must be practical for systems without making all holons systems.
System delimitation vs external dependencyA system has a boundary in context, but many critical relations cross it.
Component structure vs functional structurePhysical or organizational bearers may realize multiple functions, and one function may require multiple bearers.
Conservative roll-up vs redundancyWeakest-link and conservation checks are useful, but redundancy or substitution may require B.2 whole reidentification.
Description vs in-life systemDiagrams, BIM models, digital twins, and dashboards describe systems; they are not the system by appearance.

Solution

Use B.1.2 to recover a system aggregation relation and its delimitation discipline.

System Aggregation Relation

SystemAggregationRelation@Context:
  candidateSystemWholeRef: U.System
  boundedContextRef:
  identityOrRecognitionRule:
  componentRelationRefs?
  portionRelationRefs?
  phaseRelationRefs?
  memberRelationRefs?
  holonDelimitationRelationRef:
  externalBoundaryCrossingRelationRefs?
  internalizedBoundaryCrossingRelationRefs?
  functionalElementRefs?
  moduleOrBearerAllocationRefs?
  wholeLevelCharacteristicRefs?
  constructionBasisRef?
  evidenceRelationRefs?
  mathLensOrRepresentationRef?

This relation is not a U-kind and not the system itself. It states which relations must be named before a system aggregation claim is relied on.

Delimitation And Boundary-Crossing

Use HolonDelimitationRelation@Context for the current system delimitation: identity rule, included parts, excluded environment, selected structure, and context boundary conditions.

Use HolonBoundaryCrossingRelation@Context or a direct owner for relations that cross that delimitation: material flow, energy flow, signal, control, measurement, source use, publication use, evidence relation, transformation, probe relation, supply relation, commitment relation, A.6.C contract-language unpacking, or coupling.

Do not recast crossing relations as parthood merely because the relation is important.

Boundary-Interface Compatibility Check

When a system aggregate exposes or hides crossing relations, record the compatibility choice:

BoundaryInterfaceCompatibilityCheck@Context:
  systemAggregationRelationRef:
  crossingRelationRef:
  compatibilityDecision: expose | namespace | internalize | exclude | useDirectOwner
  ownerPatternRef:
  evidenceRelationRef?

This check is a system-aggregation aid, not a new ontology. It prevents silent loss of external obligations and unmanaged endpoint explosion.

Whole-Level Characteristics

Roll up system-level characteristics only after the relation and scale are selected.

Useful families include:

  • additive quantities such as mass, cost, energy stock, or material amount;
  • limiting quantities such as pressure rating, weakest connector, safety class, or availability bottleneck;
  • logical or capability claims such as emergency-stop availability or vulnerability exposure;
  • architecture characteristics that depend on selected structure.

Use C.16, A.19, and C.29 when characteristic space, scale, threshold, or mathematical lens is relied on for the current claim. Use B.2 when redundancy, closure, or coordination creates or reveals a whole that must be reidentified.

Functional Elements And Bearers

A functional element in a functional view is not automatically a system part.

Recover separately:

  • functional behavior or functional element under A.6.F;
  • physical, organizational, software, or operational bearer under A.6.M, A.14, C.13, and architecture owners;
  • allocation or correspondence between function and bearer;
  • system aggregation only when bearer parthood is independently admitted.

One bearer may realize several functions. One function may require several bearers. This is allocation and correspondence before it is part-whole.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Box as ontologyA diagram boundary becomes system delimitation by appearance.Name identity rule, holon delimitation relation, and part relations.
Interface as partSupply, signal, measurement, control, publication, or evidence relation becomes a component.Keep boundary-crossing and direct-owner relations separate from parthood.
Function as bearerA functional block or symbol is treated as a physical or organizational component.Recover function, bearer, allocation, and system part-whole claims separately.
Description as systemBIM model, dashboard, digital twin, register, or source record is treated as the system.Use description, publication, evidence, source-use, and designation owners for the description side.
Transformation as containmentA tool or teacher changes a holon and is read as that holon's super-holon.Use A.3.4, A.15.1, A.12, and boundary-crossing owners before part-whole admission.

Resistor In A Circuit

A resistor symbol in a circuit diagram is a functional or design-description element. The physical bearer may be a packaged resistor, a length of wire, a transistor region, or a module allocation. B.1.2 admits system aggregation only for the chosen physical or operational bearer relation, not for the symbol by label.

Digital Twin Of A Building Asset

A BIM model, asset register, dashboard, or digital twin may describe the built asset and its systems. It is not the asset's part by being linked in a model. Use architecture-description, publication, evidence, source-use, and designation owners for the description side; use B.1.2 only for admitted system parts of the built asset.

Lathe And Workpiece

The lathe can change the workpiece through a bounded transformation and work occurrence. That relation does not make the workpiece a lathe component, nor the lathe the workpiece's super-holon. Use A.3.4, A.15.1, A.12, and boundary-crossing owners before any part-whole claim.

Bias-Annotation

Bias riskFailureMitigation
Box as ontologyA diagram boundary becomes system delimitation by appearance.Name identity rule, holon delimitation relation, and part relations.
Interface as partSupply, signal, measurement, control, publication, or evidence relation becomes a component.Keep boundary-crossing and direct-owner relations separate from parthood.
Function as bearerA functional block or symbol is treated as a physical or organizational component.Recover function, bearer, allocation, and system part-whole claims separately.
Description as systemBIM model, dashboard, digital twin, register, or source record is treated as the system.Use description, publication, evidence, source-use, and designation owners for the description side.
Transformation as containmentA tool or teacher changes a holon and is read as that holon's super-holon.Use A.3.4, A.15.1, A.12, and boundary-crossing owners before part-whole admission.

Conformance Checklist

CheckRequirement
CC-B1.2-1The candidate whole is an admitted U.System or candidate system under A.1.
CC-B1.2-2System aggregation names bounded context, identity or recognition rule, part relation, and holon delimitation relation.
CC-B1.2-3External supply, signal, control, measurement, source, publication, evidence, transformation, or coupling relations are kept as boundary-crossing or direct-owner relations unless parthood is separately admitted.
CC-B1.2-4Functional elements and physical or organizational bearers are separated before allocation or parthood claims.
CC-B1.2-5Whole-level characteristic roll-up names the characteristic, scale, relation owner, and mathematical lens when current.
CC-B1.2-6A system changing another holon is not treated as that holon's super-holon by transformation, manufacturing, teaching, measurement, repair, or control relation alone.
CC-B1.2-7Description artifacts, models, dashboards, digital twins, and registers are kept distinct from the system holon they describe.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Box as boundaryA diagram rectangle determines system membership.Name holon delimitation, identity rule, and part relations.
Supplier as componentExternal supplier or grid is treated as part of the system.Use boundary-crossing relation, supply relation, commitment relation, A.6.C contract-language unpacking, evidence relation, or source-use relation.
Function block as moduleA functional block is treated as a physical component.Recover functional element, candidate bearer, and allocation relation separately.
Digital twin as partModel or dashboard appears inside the system aggregate.Use architecture-description, publication, evidence, or source-use owners.
Redundancy as arithmeticRedundancy is averaged into a better system score.Check characteristic scale and existing-whole explanation; use B.2 when the whole must be reidentified.

Consequences

Positive consequences:

  • System aggregation remains practical for engineering systems and organizations.
  • Boundary and interface concerns become explicit relation work without false U-kinds.
  • Functional architecture, module allocation, and physical parthood stop collapsing into one diagram.
  • Digital-twin and publication artifacts stay on the description side unless another direct pattern admits a stronger relation.

Costs:

  • Engineering diagrams need relation-owner annotations when used for decisions.
  • Some familiar component lists must be split into physical parts, functional elements, external systems, sources, and descriptions.
  • Whole-level characteristic claims need scale and relation discipline.

Rationale

System aggregation is the place where holonic thinking is most tempting and most useful. It is also where false parthood is easy: anything connected, measured, represented, or controlled can be drawn inside a system box.

B.1.2 preserves the engineering payoff while requiring holon delimitation, boundary-crossing relation discipline, and direct owners for function, module, characteristic, evidence, and publication claims.

SoTA-Echoing

Source familyCurrent lesson for B.1.2FPF decision
Systems engineering and digital engineering practiceSystem breakdowns, interfaces, allocations, views, and digital twins must be coordinated but not identified with one another.B.1.2 separates system aggregation, functional view, bearer allocation, description, and publication claims.
Reliability and safety engineeringSystem-level claims need conservative relation and scale discipline.Whole-level characteristic roll-up returns to C.16, A.19, and C.29 when those claims are relied on for the current use.
Applied ontology and constructional mereologyExternal dependence and part-whole construction are different relations.Boundary-crossing relations do not become parthood without A.14 and C.13 admission.
Holonic and cyber-physical systems practiceCoordination and closure can create useful whole-level objects.B.2 owns whole reidentification when existing system aggregation is insufficient.

Relations

  • Builds on: B.1, A.1, A.14, C.13, and A.6.5.
  • Coordinates with: A.6.F for functional elements, A.6.M for module and bearer allocation, A.22 and C.30 for selected structure and architecture, C.16 and A.19 for characteristics, C.29 for mathematical lenses, A.3.4 and A.12 for transformation and acting-side externalization, and C.30.AD or C.30.AD.BA for architecture-description cases.
  • Can contribute evidence to: B.2 when system aggregation no longer explains the whole-level claim and whole reidentification is needed.

B.1.2:End

Γ_epist - Knowledge‑Specific Aggregation

► decided‑by: A.14 Advanced Mereology A.14 compliance — Use ConstituentOf for semantic parts; PortionOf only for quantitative splits of texts/data with declared μ (token/byte, etc.); PhaseOf for versions/revisions of MethodDescription/documents; no ComponentOf here.

Plain‑English headline. Γ_epist composes epistemic holons (claims, models, datasets, arguments) into a single episteme while preserving provenance, applying conservative trust bounds (B.3 F/G/R), and penalizing poor conceptual fit via congruence levels (CL). It is not a physical sum; it is a semantic and evidential fold.

Problem frame

  • Holonic foundation. In the FPF, a U.Episteme is a holon whose identity is knowledge‑bearing (A.1). It can be a statement/claim, a model, a theory, a specification, a dataset with semantics, or a compiled scholarly artifact.
  • Strict Distinction (A.15). We separate: structure (what the episteme comprises), order (argument flow), time (versioning/phases), work (what was spent to produce/validate it), and values (objectives/criteria). Γ_epist stays in the structure/semantics lane and calls out to Γ_ctx/Γ_time/Γ_work when needed.
  • Mereology (A.14). For knowledge composition we primarily use ConstituentOf (logical/semantic parts), UsageOf/ReferenceTo (external reliance), and MemberOf for collections (anthologies, corpora). We do not use ComponentOf (physical) in Γ_epist. PhaseOf handles temporal versions of the same episteme; RoleBearerOf is irrelevant here because knowledge does not play a role—it is used by a holon‑in‑role (Transformer) at run‑time (A.12).
  • Assurance (B.3). Knowledge carries F, G, R (Formality, ClaimScope, Reliability). Integration edges carry CL (congruence level) that penalizes poor fit. Γ_epist must preserve provenance and apply conservative bounds: no “truth averaging,” no silent context hops. Obligations here are mode/assurance‑gated per C.2.1. # [M‑0]
  • Order/time flavours. Argument sequences may need Γ_ctx (non‑commutative ordering of premises to conclusion). Knowledge evolution uses Γ_time (versioning, deprecation, update). When composition produces new closure or supervision (e.g., explanatory theory emerges), we declare MHT (B.2).

Problem

Naive aggregation of knowledge holons causes recurring failures:

  1. Trust inflation by averaging. Averaging confidences of conflicting claims creates a falsely “reliable” whole; violates WLNK and B.3 conservatism.
  2. Provenance erasure. Merges that drop sources, methods, or links break A.10 Evidence Graph Referring and make results unauditable.
  3. Semantic drift. Folding across mismatched concepts without explicit mappings (and their CL) yields incoherent composites that look formal but mean nothing.
  4. Order blindness. Arguments with essential dependency order (premise ⇒ lemma ⇒ conclusion) are treated as sets; non‑commutativity is lost and results become non‑reproducible.
  5. Context chimeras. Combining items across bounded contexts (different vocabularies/units/policies) without a Context Reframe (B.2) silently corrupts claims and inflates R.
  6. Category errors. Importing Γ_sys rules (e.g., “sum truth,” “avg formality”) into knowledge composition produces physically sounding but epistemically nonsensical models.

Forces

ForceTension
Conservatism vs. SynthesisKeep reliability bounded by the weakest supported link ↔ allow genuine explanatory integration when it actually emerges.
Universality vs. Domain nuanceOne operator across math, science, engineering specs ↔ domain‑specific semantics and evidence patterns differ.
Provenance fidelity vs. Cognitive loadKeep the full trail of sources and methods ↔ avoid overwhelming authors with bookkeeping.
Order/time discipline vs. FlowRespect argument order and version time ↔ keep composition usable for day‑to‑day synthesis.
Parsimony vs. FitSmall rule set (A.11) ↔ explicit congruence penalties and context rebasing when needed.

Solution — Terms, operator family, invariant Standard, core rules

Terms (didactic recap)

  • U.Episteme — a knowledge holon. Internally read it as an EpistemeSlotRelation: EntityOfConcernSlot for what it is about, ClaimGraphSlot or theory/model structure for what it claims, GroundingHolonSlot where grounding is live, and SCR/RSCR carrier references for text, code, figures, or datasets.
  • Evidence/Provenance Graph — edges like evidences, derivesFrom, usesMethod, isMeasuredBy with anchors (A.10).
  • Mapping edge — a typed relation between conceptual vocabularies (e.g., ontology alignment, unit conversion) with a CL score (0…3/4 per A.15/B.3 convention).
  • SCR — a U.SCR that lists all symbol carriers included in the aggregate; never dropped.
  • Bounded context — a modelling Standard (vocabulary/units/policy). Crossing it requires Context Reframe (B.2) or explicit mappings with CL.

Didactic reminders. • Knowledge does not “act.” Transformers (A.12) use knowledge. • MemberOf creates collections; it is not a semantic argument link. Use ConstituentOf for logical/evidential composition. • PhaseOf is for versions of the same episteme; if identity, boundary, or context re‑anchor, declare MHT.

The operator family (companion flavours)

To keep design vs run clean (A.15), Γ_epist has two companion flavours that share the same algebra but serve different moments:

  1. Synthesis (design‑time) — fold epistemes into a draft aggregate
Γ_epist^synth : ( D_know : DependencyGraph< U.Episteme >,
                  TA     : U.RoleAssignment[roleRef = TransformerRole@Context] ) → U.Episteme
  • Domain. D_know uses ConstituentOf, UsageOf/ReferenceTo, evidences/derivesFrom, optional MemberOf for collections.
  • Result. A composite episteme whose Object/Concept/Symbol components are assembled; provenance and SCR are preserved; F/G/R/CL are provisionally computed for later assurance. Gating: at M‑mode only tuple placeholders are required; numeric scoring may be omitted ([M‑0/M‑1]). At F‑mode the tuple MUST be computable in‑Context ([F‑*,L1+]). # [M/F]
  1. Compile (run‑time) — produce the released artifact in a bounded context
Γ_epist^compile : ( E_synth : U.Episteme,
                    Ctx     : BoundedContext,
                    TA      : U.RoleAssignment[roleRef = TransformerRole@Context] ) → U.Episteme
  • Domain. A synthesized episteme and a target context (journal, standard, program spec).
  • Result. A context‑anchored episteme (e.g., published paper/spec) whose mappings to the context vocabulary are explicit and carry CL; assurance will reference this context baseline (B.3).

Relationship to Γ_ctx / Γ_time. If the knowledge fold explicitly depends on argument order (e.g., derivation), the internal fold uses Γ_ctx for the sequence. If a temporal storyline (updates, retractions) is important, use Γ_time to slice versions; Γ_epist then composes the current slice. If composition yields new explanatory closure beyond WLNK/CL, declare MHT (B.2).

Invariant Standard (how the Quintet applies; math by level)

  • IDEM (Idempotence). Folding a single episteme returns itself; no accidental “upgrade.”
  • COMM/LOC (Local commutativity / locality). For independent subgraphs (no logical/evidential dependency), fold order/location is irrelevant; when dependencies exist, Γ_ctx controls order explicitly.
  • WLNK (Weakest‑link bound). Aggregate Reliability (R) is bounded by the weakest supported link along any justification path, after considering the lowest CL on mappings used by that path.
  • MONO (Monotonicity). Strengthening a part (raising R with valid evidence or raising CL on a needed mapping) cannot lower aggregate R. Adding contradictory evidence is not an improvement; it triggers conflict handling (below), not MONO.
  1. Reliability fold. Along any support spine, R_raw = min_i R_i; apply congruence penalty Φ(CL_min) → R_eff = max(0, R_raw − Φ(CL_min)). No averaging; weakest‑link. Math by level:[M‑0/M‑1] allow ordinal comparisons only (no arithmetic on R); Φ may be stated qualitatively (“low/med/high”). – [M‑2/L1] require numeric Φ table (default in §4.4) and reproducibility tag on empirical edges. – [F‑*,L1/L2] require formal derivability of the fold rules from LOG‑CAL; constructive mode annotates proof.kind=constructive. # [M/F]

Core rules for epistemic aggregation (design‑time synthesis)

When computing Γ_epist^synth(D_know, T):

  1. Provenance preservation. The provenance/evidence graph is unioned with de‑duplication; every claim in the aggregate remains traceable to its sources and methods. No source, method, or dataset that supports a retained claim may be dropped.

  2. SCR construction. Build a U.SCR that lists all symbol carriers (texts, code, figures, datasets) that materially participate in the aggregate. Provenance nodes must be mappable to SCR entries.

  3. Object alignment. Determine a common Object via domain taxonomy (e.g., least common ancestor) or create a U.CompositeEntity with explicit mappings. Record CL for each mapping; do not silently merge homonyms.

  4. Concept integration with CL penalty. Compute provisional F/G/R of the aggregate:

    • F_eff = min(F_i) (formality is as strong as the least formal constituent actually used).
    • G_eff = function of coverage; typically monotone in included scope, capped by weakest definitional fit.
    • R_eff = min over justification paths of { R_i along the path } penalized by the lowest CL used by that path: R_eff := max(0, min_path( min_claimR(path) − Φ(CL_min(path)) )), where Φ is the normative penalty function defined below. If a mapping with CL < threshold is essential to a path, mark the claim provisional.
  5. Normative Penalty Function Φ (v1.0) The penalty function Φ quantifies the loss of reliability due to poor conceptual alignment between parts.

Congruence Level CL_min0123
Penalty Φ(CL_min)1.51.00.50.0

A domain profile MAY provide an alternative table but MUST preserve monotonic decrease (a lower CL cannot have a smaller penalty). The default values are derived from empirical fits in KD-CAL Bench 0.3.

  1. Conflict detection (no averaging). Detect contradictions (e.g., p and ¬p with overlapping scope). Do not average. Either (i) separate by context or scope (bounded contexts; Γ_time slices), (ii) mark provisional with explicit conflict edges, or (iii) if resolution yields new closure, consider MHT.

  2. Handling of Axiomatic vs. Postulative Epistemes In alignment with ADR-028, the computation of R_eff depends on the episteme's declared mode.

  • For an input episteme E_i with mode: axiomatic, empirical R is N/A; take R_i_eff = F_i. Tag: line=formal. # [F‑*]
  • For mode: postulative, use declared R_i with decay; Tag: line=empirical. # [M‑1/M‑2/F]
  • The aggregate E_eff MUST also declare a mode. If all inputs are axiomatic, the output is axiomatic. If any input is postulative, the output MUST be postulative.
  • Constructive note. Under F‑constructive, equivalence claims use isomorphism/equivalence in the chosen UF library; CL=2 means proof‑reconstructed alignment, not mere model‑theoretic appeal. # [F‑constructive]
  1. Order‑aware arguments (optional). If the argument requires premise ordering, embed a Γ_ctx fold inside Γ_epist; record the OrderSpec for reproducibility (NC‑1..3). Gating: OrderSpec is recommended at M‑1 and required at M‑2/F. # [M‑1→F]

  2. No costs here. Any compute/collection effort is Γ_work; attach references but do not mix costs into epistemic aggregation.

Core rules for compilation (run‑time context anchoring)

When computing Γ_epist^compile(E_synth, Ctx, T):

  1. Context bindings. # [M‑1+] Map all operative concepts/units/claims into Ctx; record mappings and their CL. If the rebase changes boundary/objective of the episteme (e.g., from descriptive compendium to explanatory theory with commitments), declare Context Reframe (MHT) per B.2.

  2. Assurance baseline (gated). Recalculate the assurance tuple (B.3) in Ctx: F and R may change with formalization and mapping penalties; G is re‑expressed in Ctx’s scope. Gating:

  • [M‑0] narrative justification only;
  • [M‑1] qualitative tuples allowed;
  • [M‑2/L1] numeric tuple required;
  • [F‑*/L2] tuple and proof obligations on weight/penalty model selection. # [M/F]
  1. Release SCR. Produce RSCR with carrier hashes; at L2 require independent re‑hash verification. # [M‑1/L2]

  2. Order/time hooks. If the compiled artifact includes an internal derivation, carry the OrderSpec; if it codifies a specific time slice of evolving knowledge, link back to the Γ_time slice used.

Archetypal grounding (worked, didactic)

Episteme — Meta‑analysis into a guidance statement

  • Inputs (U.Episteme): E₁ randomized trial (R=0.84, F=3, G=medium), E₂ observational study (R=0.55, F=2, G=wide), E₃ mechanistic model (R=0.60, F=3, G=narrow). Mappings: dosage units (mg ↔ IU), outcome definitions (pain scale variants), each with declared CL (e.g., unit mapping CL=3, outcome alignment CL=2).

  • Γ_epist^synth:

    • Provenance preservation: all study protocols, datasets, analysis scripts listed in the SCR.
    • Object alignment: “acute low‑back pain within 6 weeks” via taxonomy LCA; non‑aligned chronic cohorts excluded or mapped with low CL and flagged.
    • Concept integration: compute provisional R_eff along each justification path, penalized by **Φ(CL_min(path)); aggregate R_eff` = min over paths.
    • Conflict handling: E₂ contradicts E₁ in a subgroup; kept as provisional with explicit conflict edge and scope note (different baseline severity).
  • Γ_epist^compile (journal context): Map outcomes to journal’s required measure, recalc F/G/R with mapping penalties; produce release SCR (hashes, versions) and context baseline. Result: “Guidance Statement v1.0” with conservative R.

  • Why not averaging? Averaging would inflate R and hide low‑CL outcome mappings; Γ_epist enforces pathwise min + CL penalty.

Episteme — Safety case from heterogeneous evidence

  • Inputs: requirement spec (F=3, R=0.7), hazard analysis (F=2, R=0.6), test logs (F=1, R=0.8), formal proof of controller property (F=3, R=0.9).

  • Γ_epist^synth:

    • Provenance union; SCR includes requirements, proof carrier, test datasets.
    • Concept integration: controller proof applies only under assumptions A; test logs violate A in edge case → CL low for mapping “test scenario ≡ proof assumption.”
    • R_eff bounded by the weakest justification path after Φ(CL_min); claim on “system‑level safety” marked provisional until assumption alignment is demonstrated.
  • Γ_epist^compile (certification context): Context re‑base to regulatory vocabulary; if the re‑base changes objective/boundary (e.g., from internal assurance to public certification), consider MHT (Context Reframe) per B.2.

Contrast (didactic)

AspectΓ_epist (Knowledge)Γ_sys (Physical)
What is folded?Claims, models, datasets, argumentsComponents, materials, assemblies
ConservatismPathwise min of R + penalty Φ(CL)WLNK via weakest part (strength, rating)
FitMappings with declared CLInterfaces/BIC compatibility
Order/timeOptional Γ_ctx for argument order; Γ_time for versionsΓ_ctx for workflows; Γ_time for phases
Work/costExternal in Γ_work (compute, curation)External in Γ_work (energy, labour)

Proof obligations (normative)

At synthesis (Γ_epist^synth):

  1. PO‑SYN‑PROV. The provenance/evidence graph MUST be preserved (union with de‑duplication); every retained claim is traceable to sources/methods in the SCR.
  2. PO‑SYN‑OBJ. The Object MUST be identified (single subject via LCA or explicit U.CompositeEntity) with declared mappings and their CL.
  3. PO‑SYN‑CL. All mapping edges that bridge semantics/units MUST carry CL; the chosen penalty Φ MUST be monotone in CL (lower CL ⇒ higher penalty). Thresholds for marking provisional MUST be stated.
  4. PO‑SYN‑R. R_eff MUST be computed as min over justification paths of (claim reliabilities along the path minus Φ(CL_min(path))). No arithmetic mean is allowed for reliability.
  5. PO‑SYN‑CONFLICT. Contradictions MUST be either (i) separated by context/scope, (ii) marked as provisional with explicit conflict edges, or (iii) escalated to MHT if resolution yields new explanatory closure.
  6. PO‑SYN‑ORDER. If order matters, the OrderSpec MUST be recorded and Γ_ctx NC‑1..3 (determinism, context hash, partial‑order soundness) MUST hold.
  7. PO‑SYN‑NOWORK. Resource spending, yields, and dissipation MUST NOT be computed here; instead, attach references to the aligned Γ_work composition.

At compilation (Γ_epist^compile):

  1. PO‑COMP‑CTX. The target bounded context MUST be declared; all active concepts MUST be mapped with CL; context vocabulary/units recorded.
  2. PO‑COMP‑ASSUR. The assurance tuple (F/G/R) MUST be recomputed in the target context with the applied CL penalties.
  3. PO‑COMP‑REL. A release‑grade SCR (hashes, versions, dates) MUST be produced.
  4. PO‑COMP‑MHT. If the compilation re‑anchors boundary, objective, or identity (e.g., from compendium to explanatory theory), an MHT (Context Reframe) MUST be declared with a Promotion Record (B.2).
  5. PO‑COMP‑ORDER/TIME. If derivational order or a specific time slice is essential, the OrderSpec and the Γ_time slice MUST be referenced.

Conformance Checklist (normative)

IDRequirementPurpose
CC‑B1.3.1Inputs to Γ_epist MUST be U.Episteme holons; ComponentOf is forbidden; use ConstituentOf / UsageOf / ReferenceTo; MemberOf only for collections.Prevent category errors.
CC‑B1.3.2Provenance and SCR MUST be preserved in the aggregate; dropping sources or methods is non‑conformant.Enforce Evidence Graph Referring.
CC‑B1.3.3Aggregate R MUST follow the pathwise min rule with Φ(CL_min) penalties; no averaging of reliability.Guard conservatism (WLNK).
CC‑B1.3.4Contradictions MUST NOT be smoothed by arithmetic; handle by scope separation, provisional status, or MHT.Keep incoherence visible.
CC‑B1.3.5Every U.Episteme serving as an input to Γ_epist MUST declare its mode (axiomatic or postulative). An aggregate holon's mode MUST be postulative if any of its constituents is postulative.Prevent category errors in reliability calculation.
CC‑B1.3.6Crossing bounded contexts requires either explicit mappings with CL or an MHT (Context Reframe).Make context explicit.
CC‑B1.3.7If order matters, Γ_ctx NC‑1..3 MUST hold; if versions matter, the Γ_time slice MUST be identified.Preserve order/time integrity.
CC‑B1.3.8Design‑time synthesis and run‑time compilation MUST NOT be conflated; use the appropriate flavour.Maintain A.15 separation.

Anti‑patterns & repairs

Anti‑patternSymptomRepair
Truth‑averagingAveraging confidence of conflicting claimsApply pathwise min with CL penalties; separate scopes or mark provisional.
Provenance amnesiaSources/methods disappear in the aggregateRebuild SCR; re‑run Γ_epist with provenance union.
Homonym mergeDifferent concepts with same name silently mergedInsert mapping edges with CL; if CL too low, split by context or mark provisional.
Context hopMixed units/vocabularies without declarationDeclare bounded context and mappings; if purpose changes, use MHT.
Version soupMixed time slices without clarityUse Γ_time to slice; compose current slice only; link others explicitly.
Work stuffingCompute/curation cost blended into reliabilityMove costs to Γ_work; keep R based on evidence, not spend.
Orderless proofDerivation steps treated as a setAdd OrderSpec; compose with Γ_ctx inside Γ_epist.
Synergy by narrative“New theory” claimed without BOSC evidenceIf closure/supervision actually emerges, declare MHT; otherwise lower claims.

Consequences

Benefits

  • Auditability by construction. Every retained claim remains tied to its sources; SCR guarantees reconstructability.
  • Safe synthesis. R cannot be inflated; CL penalties make conceptual misfit explicit.
  • Context‑aware releases. Compiled epistemes or publications are aligned with a declared context; cross‑context reuse is principled.
  • Didactic clarity. Separates semantic folding (Γ_epist) from order (Γ_ctx), time (Γ_time), spend (Γ_work), and emergence (B.2).

Trade‑offs

  • Mapping overhead. Declaring mappings and CL costs time; it prevents silent incoherence.
  • Conservative stance. Results may look pessimistic; this is deliberate (WLNK). Use MHT only for genuine explanatory closure.

Rationale (informative)

  • Epistemic composition is not physical addition. Reliability must be bounded by the weakest justified path, not averaged; conceptual misalignment must reduce confidence, not be ignored.
  • Provenance is part of meaning. Dropping sources/methods changes what the episteme is; Γ_epist treats provenance and SCR as first‑class.
  • Context matters. Bounded contexts structure practice; formal Context Reframe (MHT) prevents quiet re‑interpretations of claims.
  • Parsimony with power. A small set of rules (provenance preservation, CL‑penalized pathwise min, order/time hooks, context discipline) is enough to model scientific and engineering knowledge without importing domain‑specific tool jargon.

Relations

  • Builds on: A.12 (Transformer Role—compilers/editors enact), A.14 (Mereology Extension—ConstituentOf/MemberOf/PhaseOf usage), A.15 (Strict Distinction).
  • Coordinates with: B.1.1 dependency-structure and relation-grounding checks, B.1.4 (Γ_ctx/Γ_time inside knowledge folds), B.1.6 (Γ_work for compute/collection spend).
  • Triggers/Complements: B.2 (MHT) when explanatory closure or context re‑base creates a new whole (theory, standard).
  • Used by: B.3 assurance uses F/G/R and CL baselines computed here as inputs to trust calculations.

One‑sentence takeaway. Γ_epist preserves provenance, penalizes poor conceptual fit, forbids reliability averaging, and makes context explicit—so that knowledge aggregates are conservative, auditable, and genuinely coherent.

B.1.3:End

Contextual and Temporal Aggregation

Type: B-family aggregation pattern Status: Stable Normativity: Normative unless explicitly marked informative

Use this when. Use this pattern when the current claim aggregates relations across a bounded context, ordered situation, phase set, or time window, and the question is not just ordinary part-whole construction. Typical cues are ordered steps, order-sensitive argument chains, version histories, asset histories, phases of one carrier, rolling windows, context-scoped roll-ups, or time-sliced evidence.

Not this pattern when. If the question is ordinary part-whole or collection admission, use B.1, A.14, and C.13. If the question is the method as such, method description, work plan, or dated work occurrence, use A.3.1, A.3.2, A.15.2, or A.15.1. If the question is work-resource accounting, use B.1.6. If the question is changed identity, use A.3.4; if a new whole must be reidentified, use B.2 through B.2.P. If the question is temporal adequacy of a claim, use C.27.

What goes wrong if missed. Order, phase, context, or time-window wording becomes ordinary parthood, method order, performed work, evidence currentness, or whole reidentification by label.

What this buys. The practitioner can aggregate context-sensitive and temporal material while returning method, work, transformation, work-resource, temporal-adequacy, and MHT claims to their direct owners.

Problem Frame

Many useful aggregates are not simple unordered wholes. A manufacturing sequence changes meaning when steps are swapped. An argument chain depends on which premise is used before which lemma. A turbine, paper, or dataset may be considered as the same carrier across phases. In these cases the aggregation is about contextual order or temporal coverage, not about a new level, a generic boundary, or a hidden interaction kind.

B.1.4 governs the aggregation claim. It asks which EntityOfConcern is being aggregated, which context or time window bounds the claim, which ordered or phase relation is being used, what the aggregate may be used for, and which neighboring owner must carry stronger claims.

Problem

Without this pattern, four errors recur. First, SerialStepOf or another ordered relation is read as ordinary parthood, so changing the order looks harmless even when the aggregate meaning changes. Second, a phase label is read as a new holon level or a new whole, so identity change is hidden instead of handled by whole reidentification. Third, design-time plans, possible method order, run-time histories, and evidence windows are folded together as one sequence. Fourth, mathematical order, graph, or operator notation starts to govern the in-life object instead of expressing a recovered relation for one bounded use.

The practical failure is not a missing diagram. It is an inadmissible aggregate: the user cannot tell which carrier is being followed, which relation is ordered, which time window is covered, whether gaps or overlaps matter, and which stronger owner must carry work, resource, transformation, evidence, or whole-reidentification claims.

Forces

ForceTension
Order sensitivity vs. ordinary parthoodOrdered positions must remain reviewable without recasting them as parts of one physical whole.
Temporal coverage vs. carrier identityA phase aggregate needs useful time windows, but it must not hide that the carrier changed identity.
Design-time relation vs. run-time historyMethod order, work plan, and performed work often share labels, but they are different claims.
Compact notation vs. ontologyGamma_ctx, Gamma_time, graph, or algebra notation can make a relation easy to use, but cannot create a holon, method, work occurrence, or transformation.
Local aggregation vs. stronger returnThe pattern should keep a small aggregation record, while sending resource, evidence-currentness, transformation, and MHT claims to their owners.

Solution

Recover a ContextTemporalAggregation@Context before using the aggregate:

ContextTemporalAggregation@Context:
  aggregationConcernRef
  aggregatedEntityOfConcernRef
  boundedContextRef
  aggregationMode: contextualOrder | temporalPhase | declaredMixedUse
  orderedRelationRefs?
  phaseRelationRefs?
  orderSpecRef?
  timeWindowRef?
  carrierIdentityRef?
  independenceOrJoinConditionRefs?
  coverageAndNonOverlapConditionRefs?
  boundaryCrossingRelationRefs?
  relatedMethodRefs?
  relatedMethodDescriptionRefs?
  relatedWorkOccurrenceRefs?
  relatedWorkResourceAggregationRefs?
  relatedTransformationRefs?
  relatedWholeReidentificationRefs?
  evidenceOrSourceRefs
  admissibleUse
  nonAdmissibleOverread
  strongerSourceReturnCondition

Use the record as a small typed relation, not as a new durable U.Level, U.Boundary, U.Interaction, or generic process object.

Two Aggregation Modes

ModeCurrent objectRequired relation disciplineTypical use
Contextual order aggregationA bounded set of relation positions whose order, partial order, or join structure changes meaning.OrderSpec, ordered relation refs, join or independence conditions, and a bounded context.Ordered method relation, order-bound argument chain, staged construction description, controlled sequence.
Temporal phase aggregationOne carrier considered through phases or time slices.Carrier identity, PhaseOf or phase relation refs, TimeWindow, coverage, and non-overlap conditions.Asset history, revision history, experimental run phases, dated evidence window.

If one source phrase mixes both modes, split the record. A method may have an ordered relation structure, and the work that enacts it may also have dated phases, but those are different claims.

Direct Owner Map

Current claimDirect owner
Method as semantic way of doingA.3.1
Method description, SOP, algorithm text, simulator configuration, or formal expressionA.3.2, with publication owners when publication use is current
Work planA.15.2
Dated work occurrence, performed episode, or evidence that work happenedA.15.1
Work-resource roll-up, spent resource, cost, effort, energy, material, or comparable ledgerB.1.6
Phase relation, portion relation, membership, or parthoodA.14, B.1, and C.13 as appropriate
Holon delimitation or boundary-crossing relationA.1, B.1, A.12, A.3.4, or the direct relation owner named by value
Bounded change under conditionsA.3.4
Whole reidentification, emergence-family wording, MHT, MET, MFT, synergy, or metric-mirage wordingUse B.2.P to test whether a whole-reidentification problem is current. If it remains current, use B.2, B.2.2, B.2.3, B.2.4, or B.2.5 according to the recovered whole, emergence, autonomy, capability, or supervisor relation claim.
Architecture structural view or selected structureC.30.ASV, A.22, or the architecture owner named by value
Mathematical order, graph, algebraic notation, graph path, or morphism used as expressionUse C.29 when mathematical-lens adequacy, preserved structure, lost structure, payoff, or stop condition is being evaluated. Use E.18 when the selected transformation-flow structure is current. Use E.18.2 when the mathematical expression of that selected structure is current.

Optional Operator Notation

Gamma_ctx and Gamma_time are optional notation for already recovered aggregation claims.

Gamma_ctx(contextualAggregationRecord, orderSpec, independenceAndJoinConditions)
  -> contextual aggregate record

Gamma_time(temporalAggregationRecord, timeWindow, coverageAndNonOverlapConditions)
  -> temporal aggregate record

The notation does not create a holon, transformation, method, work occurrence, or whole reidentification by itself. It records how the selected relation set is combined for the current use.

If the source says a system actually sequences, combines, transforms, measures, or audits something, name that acting-side relation separately through [A.12](/generated/patterns/A.12), [A.3.4](/generated/patterns/A.3.4), [A.15.1](/generated/patterns/A.15.1), [B.1.6](/generated/patterns/B.1.6), [A.10](/generated/patterns/A.10), or the direct owner. The person, team, controller, or tool that writes an aggregation record is not automatically the in-world transformer for the EntityOfConcern being aggregated.

Admissible Checks

For contextual order aggregation:

  • the ordered relation refs are named by value;
  • the OrderSpec is declared as total order, partial order, or another named relation;
  • independence, branch, or join conditions are named when parallel factors are used;
  • all claims stay within one bounded context unless a boundary-crossing relation is named;
  • method, method-description, work, transformation, and resource claims use their direct owners.

For temporal phase aggregation:

  • the carrier identity is recoverable;
  • the time window is declared;
  • phase intervals are covered and non-overlapping, or the admissible use is narrowed;
  • identity change is not hidden as another phase;
  • work-resource and evidence-currentness claims use B.1.6, A.10, and C.27 when current.

B.1 invariant carry-through. B.1.4 keeps B.1 invariants only after the current relation is recovered. A singleton ordered relation or singleton phase is idempotent for the selected use. Contextual aggregation is deterministic only relative to the declared OrderSpec and join or independence conditions. Temporal aggregation is valid only relative to carrier identity, coverage, and non-overlap. Weakest-link and monotonicity claims must name the characteristic being bounded or improved; otherwise the aggregate is only an aggregation record, not a performance, safety, or assurance claim.

Compact Obligation Rows

ObligationWhat must be namedWhy it matters
Independence and joinsBranch relation refs, join relation refs, and the condition under which branches may be combined.Prevents an ordered aggregate from silently treating dependent branches as independent evidence or work.
Order specificationTotal order, partial order, precedence relation, or another named relation over the selected positions.Keeps order-sensitive claims from being read as unordered collection claims.
Decisive dependency relationThe relation that makes one position, delay, or missing step decisive for the aggregate use.Allows weakest-link claims only when the decisive relation is visible.
Carrier identityThe carrier being followed across phases and the condition under which it remains the same EntityOfConcern.Prevents temporal aggregation from hiding identity change or MHT.
Temporal coverageTime window, phase refs, coverage rule, and non-overlap or overlap policy.Prevents missing phases and double counting.
Chronological disciplineThe rule that separates chronological order, logical order, publication order, and performed-work order.Keeps a document sequence, argument sequence, and work occurrence sequence from substituting for one another.
Monotone characteristicThe exact characteristic that is preserved, bounded, or improved when the aggregate grows.Blocks generic monotonicity claims over an unspecified aggregate.

Archetypal Grounding (Worked Slices)

Manufacturing sequence. A frame is prepared, welded, inspected, painted, and packed. B.1.4 records the contextual order claim: selected steps, order specification, join conditions, and admissible use for planning or comparison. The actual shop-floor work occurrences use A.15.1; energy and material roll-ups use B.1.6; a changed frame state uses A.3.4.

Paper revision history. A paper has draft, reviewed, and camera-ready phases. B.1.4 records the same episteme carrier across phases and the time or version window being claimed. Source-currentness and publication-use claims use A.10 and E.17; the phase relation does not make the publication authoritative by itself.

Cross-context evidence window. A dashboard aggregates observations from two operating contexts. B.1.4 records the bounded contexts and the admissible aggregation window. If one context has a different measurement basis, use C.16 or C.29 for comparability before relying on the aggregate.

Bias-Annotation

Bias riskFailureMitigation
Notation becomes ontologyGamma_ctx, Gamma_time, graph, or algebra wording is treated as the governed object.Recover the ordered or temporal relation first, then treat notation as a selected expression.
Sequence becomes workA method order, plan order, document order, or performed-work history is treated as the same thing.Name the direct owner: method, method description, work plan, dated work occurrence, or evidence window.
Phase becomes levelA phase label is used as a new system level or a new whole.Recover carrier identity and PhaseOf or phase relation; return identity change to whole reidentification.
Coverage becomes authorityA complete-looking timeline is treated as sufficient evidence or currentness.Use evidence, source-currentness, and temporal-adequacy owners when those claims are current.

Conformance Checklist

IDRequirementPurpose
CC-B1.4-1The aggregate names the EntityOfConcern, bounded context, aggregation mode, and admissible use.Prevents a context or time label from acting as ontology.
CC-B1.4-2Contextual aggregation names ordered relation refs and an OrderSpec; temporal aggregation names carrier identity, phase refs, and TimeWindow.Keeps order and time as different relations.
CC-B1.4-3Independence, join, coverage, and non-overlap conditions are present when the claim uses them.Keeps local composition reviewable.
CC-B1.4-4Method, method-description, work-plan, work-occurrence, work-resource, transformation, and whole-reidentification claims are assigned to their direct owners.Prevents B.1.4 from absorbing neighboring objects.
CC-B1.4-5Mathematical notation is treated as a selected lens or expression, not as the governed object.Keeps Gamma_ctx, Gamma_time, graph, and algebra language bounded.
CC-B1.4-6If identity changes, coverage breaks, or a new whole is claimed, the record narrows use or names the stronger owner.Prevents temporal aggregation from becoming hidden MHT or transformation.

Common Anti-Patterns and How to Avoid Them

OverreadRepair
A sequence is treated as physical parthood.Recover ordered relation refs and use contextual aggregation; use part-whole owners only for part-whole claims.
A phase label is treated as a new system level.Recover the carrier identity and phase relation; use whole reidentification only if B.2.P keeps that claim current.
A planning order is treated as performed work.Use A.15.2 for work plan and A.15.1 for dated work occurrence.
A resource total is placed inside temporal aggregation.Use B.1.6 for the work-resource ledger.
A diagram or table is treated as the aggregate.Recover the Description episteme or publication relation and the EntityOfConcern separately.

Consequences

This pattern makes ordered and temporal aggregation inspectable without turning every sequence, phase, or context label into a holon level. It also lets practitioners keep useful Gamma_ctx and Gamma_time notation while avoiding a category error: the notation is an apparatus over a recovered aggregation claim, not the in-life work, method, transformation, or whole.

The cost is that the practitioner must name the relation being aggregated. The gain is that contextual order, temporal coverage, work evidence, resource accounting, transformation, and whole reidentification stop interfering with one another.

Rationale

B.1.4 exists because contextual order and temporal phase aggregation are neither ordinary part-whole construction nor generic process talk. The same carrier can be considered through phases; a selected relation set can be order-sensitive; and both cases need admissible aggregation without inventing a new holon kind. The pattern therefore keeps relation discipline explicit: PhaseOf and carrier identity for phase aggregation; ordered relation refs and OrderSpec for contextual aggregation; direct-owner return for method, work, resource, transformation, evidence, and whole reidentification.

The old DesignRunTag warning is preserved as a rule rather than a label: do not fold design-time possible order and run-time history into one aggregate. If both are needed, make two records and relate them by value.

SoTA-Echoing

Source linePractical implication for this pattern
Constructive and mereological treatment of phases and partsPhase aggregation must preserve carrier identity and coverage conditions; it cannot borrow ordinary parthood when the current relation is temporal.
Engineering process and ordered-method notationsOrdered relations may be useful expressions of method or plan structure, but performed work and resource accounting need their direct owners.
Temporal modeling and evidence-currentness practiceA time window or complete phase list does not by itself prove source currentness, admissible evidence, or causal support.
Mathematical-lens discipline in FPFGraph, order, and algebra notation are selected expressions over recovered relations, not ontology by spelling.

Relations

  • Builds on B.1, A.14, and C.13 for part-whole, phase, and constructive grounding discipline.
  • Coordinates with A.3.1, A.3.2, A.15.2, and A.15.1 for method, method description, work plan, and dated work occurrence.
  • Coordinates with B.1.6 for work-resource aggregation.
  • Coordinates with A.3.4 for transformation. When whole reidentification or emergence-family wording is current, B.2.P tests the problem and the relevant B.2-family pattern governs the recovered claim.
  • Coordinates with C.27 for temporal-claim adequacy. When mathematical expression is selected, C.29 governs lens-use adequacy, E.18 governs selected transformation-flow structure, and E.18.2 governs mathematical description of that selected structure.

B.1.4:End

Gamma_method - Order-Sensitive Method Composition and Work Enactment

Type: Part B composition and grounding pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a project must decide whether several recovered methods compose into one larger U.Method, and when order, guarded choice, parallel branches, typed joins, adapters, or method-interface exposure changes the identity of that whole method.

Typical moments:

  • a procedure, workflow, algorithm, pipeline, proof route, clinical protocol, manufacturing recipe, inference pipeline, or operational playbook has named steps or branches;
  • changing the order of two candidate submethods changes the result or the admissible conditions of use;
  • a source diagram or code file looks like a method, but it may be only a method description, a work plan, a dated work trace, a selector registry, or a mathematical lens;
  • a larger method must expose some interactions at its boundary while hiding internal steps;
  • assurance needs to know which joins, adapters, cutsets, or exposed interfaces make the composite method reliable enough to enact.

Primary EntityOfConcern. The EntityOfConcern is an order-sensitive method-composition claim: a claim that recovered U.Method values form one composite U.Method under a bounded context.

First useful move. For each apparent step or branch, recover the governed object before composing anything: U.Method, U.MethodDescription, U.WorkPlan, dated U.Work, MethodRelationStructure@BoundedContext, method-family registry or selector outcome, mathematical lens, mechanism, formal substrate, or quote-only source wording.

What goes wrong if missed. A flowchart becomes the method, a plan item becomes a submethod, an event log becomes proof that a method was enacted, an order edge becomes a part, or a registry of alternatives is treated as one composed method. Then work starts from a description or label whose method identity, joins, interfaces, and failure conditions were never recovered.

What this buys. The project can admit a composite U.Method only when method parts, whole-forming relations, whole identity, interface exposure, assurance hooks, and enactment boundary are explicit. If that threshold is not met, the project still has a useful lower object: a selected method relation structure, description, plan, work record, lens, or source-restoration request.

Not this pattern when.

  • If the current claim is one semantic way of doing with no order-sensitive composition question, use A.3.1.
  • If the current claim is a representation that describes a method or method relation structure, use A.3.2.
  • If the current claim is intended work, use A.15.2.
  • If the current claim is a dated occurrence, use A.15.1.
  • If the current claim is structural component parthood, use A.14, C.13, and B.3.5.
  • If the current claim is only a method-family registry, selector, fallback relation, or alternative set without one whole-method assembly, use G.5 or MethodRelationStructure@BoundedContext.

Problem Frame

U.Method is a non-agentive method holon kind. A method can have submethods and can participate as a submethod in a larger method. This does not mean every step-looking node, document section, file module, graph edge, work-plan item, or work occurrence is a method part.

Order-sensitive method composition is a narrow constructive question:

Given recovered U.Method parts in one bounded context,
which whole-forming relations assemble them into one larger U.Method,
and what whole-level commitments make the resulting method reidentifiable and enactable?

The whole method is not the diagram, code, schedule, event log, or work history that may describe, plan, record, or evidence it. Work enacts the method; the method does not perform work.

Gamma_method is the name for this method-composition discipline. It is not a new root U-kind, not a workflow notation, not a resource-accounting operator, and not a substitute for U.Work.

Problem

Without B.1.5:

  1. Source-wording composition. "Step", "stage", "activity", "task", "procedure", "workflow", "pipeline", or "algorithm" wording is accepted as method composition without recovering the actual objects.
  2. Description-as-method. A workflow diagram, BPMN model, code repository, proof script, table, checklist, or graph path is treated as the composite method itself.
  3. Order as mereology. SerialStepOf, ParallelFactorOf, guarded choice, or fallback relation is placed in a structural part-whole chain.
  4. Typed joins disappear. One submethod's output is assumed to satisfy the next submethod's precondition without an adapter, bridge, conversion, or declared equivalence.
  5. Interface exposure is hidden. Callers rely on internal interactions that should be encapsulated, or fail to see interactions that the composite method must expose.
  6. Run-time leakage. Resources, timestamps, telemetry, performed values, and outcomes are baked into the method instead of being recorded on U.Work.
  7. False whole method. A method-family registry, fallback table, selector rule, or local relation structure is treated as one whole method although no whole-method identity has been recovered.

Forces

ForceTension
Method reuse vs source concretenessTeams need a reusable way of doing, while sources often show only one description, run, or plan.
Order fidelity vs compact modelingImportant sequences and joins must remain explicit without turning every diagram edge into ontology.
Whole-method identity vs relation usefulnessSome method-side relations are useful without asserting one composite method whole.
Interface exposure vs encapsulationA composite method must state which interactions callers may rely on and which remain internal.
Assurance vs executionAssurance needs joins, adapters, cutsets, and failure conditions; execution evidence belongs to work and evidence patterns.

Solution

Admit one composite U.Method only when all composition coordinates are recovered.

OrderSensitiveMethodComposition:
  WholeMethodRef: U.Method
  BoundedContextRef: U.BoundedContext
  PartMethodRefs: non-empty set of U.Method
  WholeFormingRelations:
    serial | parallel | guardedChoice | iteration | refinement | substitution | fallback | adapter | typedJoin
  WholeIdentity:
    preconditions
    effects or postconditions
    invariants
    accepted inputs and outputs
    failure and stop conditions
  MethodInterfaceExposure:
    exposed interactions
    forwarded interactions
    encapsulated interactions
  MHTOrWholeReidentification:
    whole-level commitment or B.2 relation when needed
  AssuranceHooks:
    typed joins, adapters, fragile branches, cutsets, evidence targets
  EnactmentBoundary:
    which U.Work may enact this method and which U.MethodDescription describes it
  LoweredDispositionIfNotComposite:
    MethodRelationStructure | U.MethodDescription | U.WorkPlan | U.Work | G.5 selector | lens | source-restoration request

Recover Parts Before Composition

Do not start from the word "step". Start from the object claim.

An apparent step can be:

  • a U.Method submethod;
  • a description constituent inside U.MethodDescription;
  • a plan item inside U.WorkPlan;
  • a dated U.Work occurrence or work part;
  • an order relation, fallback relation, or selector relation inside MethodRelationStructure@BoundedContext;
  • a mathematical or representation lens over a relation structure;
  • mechanism or formal-substrate material;
  • quote-only source wording.

Only the first case can be a method part. Do not mint U.StepSpec, U.StepMethod, U.MethodStep, or U.MethodAlgebra for the others.

Admit The Composite Method

When the apparent parts are recovered as U.Method values, compose them only after naming the whole-forming relations:

  • serial composition when one submethod's accepted result is a precondition for the next;
  • parallel composition when branches can proceed independently under a declared join condition;
  • guarded choice when one branch is selected by a declared predicate;
  • iteration when a submethod repeats until a stop condition is met;
  • refinement or substitution when a submethod can stand in for another under declared bounds;
  • fallback or dispatch when a selector chooses a method family member;
  • adapter when a conversion method is needed to make a typed join admissible.

For order-sensitive composition, the method-composition claim also needs the order apparatus by reference: OrderSpecRef, any context hash or partial-order reproducibility condition inherited from B.1.4, and the typed join or adapter evidence that says one submethod's accepted outputs meet the next submethod's preconditions. This preserves the old capability-continuity obligation without treating "capability type" as the capability instance itself.

The result is one composite U.Method only when the whole has its own identity: preconditions, effects, invariants, accepted inputs and outputs, failure conditions, and work-facing acceptance relation. If those whole-level commitments cannot be named, lower the claim to MethodRelationStructure@BoundedContext or another neighboring object.

Keep Order Out Of Structural Mereology

SerialStepOf, ParallelFactorOf, guarded choice, iteration, fallback, adapter, and typed join are method-composition or method-relation claims. They are not A.14 component parthood.

Use A.14, C.13, and B.3.5 when the claim is about structural parts of a holon. Use B.1.5 when the claim is about how ways of doing compose into a larger way of doing. The same project may need both, but they are different relation families.

When the current method-composition claim needs explicit order aggregation, context hash, partial-order soundness, or Gamma_ctx notation, use B.1.4 for that ordered-relation apparatus. B.1.4 can express the order discipline; B.1.5 still decides whether the recovered ordered methods are enough to admit one composite U.Method.

When the current claim is temporal phasing of the same carrier or method-description edition history, use the phase or temporal owner rather than B.1.5. A phase boundary becomes a B.2-family question only when the boundary also introduces whole reidentification, closure, supervision, or context rebase. Order, phase, structural parthood, and MHT are different claims even when one source diagram uses one line for all of them.

Expose The Composite Method Interface

A composite method needs an interface exposure decision:

  • exposed: a caller may rely on the interaction as part of the whole method;
  • forwarded: a caller may address an internal submethod interaction through a declared namespace or adapter;
  • encapsulated: the interaction is internal and cannot be relied on from outside the whole method.

The interface exposure decision is part of the composite method identity when outside work, assurance, planning, or substitution relies on it. It is not a publication layout decision.

Method Interface Card (MIC)

When an interface exposure decision is reliance-bearing, publish it as a compact Method Interface Card (MIC). The MIC is a method-description or assurance-facing card about the composite method; it is not a new U-kind and not the method itself.

MethodInterfaceCard:
  methodRef: U.Method
  methodDescriptionRef?: U.MethodDescription
  orderSpecRef?: B.1.4 order apparatus
  externalInteractions:
    - interactionName
      exposureMode: exposed | forwarded | encapsulated
      acceptedInputOrCallSignature
      preconditions
      postconditionsOrEffects
      qualityEnvelopeRefs?
  invariants
  adapterOrTypedJoinRefs?
  assuranceHookRefs?
  rationale

Use a MIC when callers, planners, auditors, or substituting methods may rely on the composite boundary. For lightweight internal use, a few exposure lines may be enough; do not create a separate card by ritual.

Keep Method Admission And Work Occurrence Separate

B.1.5 admits and grounds a composite U.Method. It may require a U.MethodDescription to describe the composition. It does not by itself create performed work.

A performed enactment is U.Work under A.15.1. The work record cites:

  • the enacted U.Method;
  • the method-description source when current;
  • the performer through U.RoleAssignment;
  • the time window, parameter bindings, affected referent, resource ledger, outcome, and evidence relations.

Resource aggregation, elapsed time, telemetry, retries, and work outcomes belong to U.Work, Gamma_work, and evidence patterns. They do not become parts of the method.

The composition link is not one-to-one. A work occurrence may enact the whole method without exposing every submethod as a separate work part. A temporal work slice often enacts the same whole method during a selected interval. An episode may span several method factors, repeat one factor, or be split by evidence policy without changing the method identity. A work part enacts a submethod only when that submethod has already been recovered as U.Method; otherwise the current object is a work part, method-description node, evidence segment, mechanism material, system-component behavior, or source-restoration request.

Reader check. Before saying that a work part enacts a submethod, name both sides:

  • the occurrence-side object: parent U.Work, part relation, interval or boundary event, performer, resources or evidence role;
  • the method-side object: recovered U.Method submethod, whole-forming relation, preconditions, effects, interface, and whole-method identity.

If either side is missing, lower only that side. Do not repair a missing submethod by inventing a work part, and do not repair a missing work part by inventing a submethod.

Planning And Performed-Work Obligations

B.1.5 has two common use positions, but they are positions in use, not two U-kinds:

  • Planning or description-side use. Recover the submethods, order apparatus, typed joins or adapters, method interface exposure, invariants, and whole-level commitments. The output is a composite U.Method claim and, when a representation is needed, a U.MethodDescription or MIC that describes that method.
  • Performed-work use. A U.Work occurrence may cite the composite U.Method and the method-description source it used. The work record checks role assignment, capability-fit or admission conditions when current, preconditions, postconditions, order conformance, MIC-honouring interactions, resource ledger handoff, and evidence relations. These checks annotate or support the performed work; they do not become parts of the method.
  • Assurance use. Identify cutset submethods, fragile typed joins, adapter points, mapping congruence or CL-sensitive edges, and the envelope or scope in which the composite method is expected to hold. B.3 and related assurance patterns evaluate those hooks; B.1.5 only makes them visible.

Useful invariants remain: a single recovered submethod composed alone does not create a surprising new method; order is deterministic only under the declared order apparatus; composite quality or throughput is constrained by critical path and weakest-link considerations unless a B.2-family whole reidentification claim is separately admitted; strengthening a submethod, adapter, or typed join should not make the composite method worse unless a stated side condition changes.

Use MethodRelationStructure Below Whole-Method Threshold

Use MethodRelationStructure@BoundedContext when method-side relations are current but one whole method is not admitted. Typical cases:

  • a fallback registry selects among alternatives;
  • a workflow diagram relates method descriptions but does not recover method parts;
  • a method family has refinement, substitution, or dispatch relations;
  • a graph or algebra analyzes method relations as a lens;
  • a cross-context source uses the same method names without a bridge for method identity;
  • a work plan orders tasks but does not define one reusable method.

This lower object is not a failure. It is the right governed object when relation structure is useful but method holon composition is not current.

Worked Slices

Manufacturing Recipe

AssembleFrame, InstallMotor, and RunFunctionalTest are recovered as U.Method values in a bounded manufacturing context. InstallMotor must precede RunFunctionalTest; the test accepts the installed harness as input; an adapter method is needed when a supplier motor uses a different connector.

The composite BuildAndVerifyPumpUnit is admitted as a U.Method only after the whole states its preconditions, accepted inputs, final effect, exposed start and abort interactions, encapsulated internal calibration interactions, and failure conditions. The actual Tuesday build is U.Work; resource burn and test telemetry are not method parts.

Emergency Intake

RegisterPatient, AssessVitals, ClassifyUrgency, and RouteToCare may compose into EmergencyIntake@Hospital. The guarded choice is driven by declared vital-sign and symptom predicates. A role assignment and capability check determine who may enact the work, but they are not parts of the method.

If the source only provides a wall poster with boxes and arrows, the current object is first U.MethodDescription. The composite U.Method is admitted only when the hospital context recovers the methods, guards, typed joins, failure response, and interface exposure.

Learned Model Pipeline

A neural-network pipeline may describe feature extraction, embedding, attention, retrieval, ranking, and explanation generation. Some blocks may be formal substrate or mechanism material, some may be U.MethodDescription, and some may be recovered as U.Method values.

The pipeline is one composite U.Method only when it has accepted inputs, outputs, invariants or admissibility conditions, typed joins, fallback behavior, failure conditions, and work-facing acceptance criteria. Otherwise keep the graph as a method description, mathematical lens, mechanism material, or MethodRelationStructure@BoundedContext.

Evidence Synthesis And Publication

CollectDatasets, NormalizeSchemas, EstimateModel, CrossValidate, and DraftManuscript can compose into EvidenceSynthesisPublish@ResearchContext only when each candidate is recovered as a U.Method and the typed joins are explicit. NormalizeSchemas must produce a feature or evidence space acceptable to EstimateModel; legacy datasets may need adapter methods; CrossValidate may be a critical cutset for later assurance; DraftManuscript may require a provenance or SCR condition before publication work is admitted.

A paper draft, workflow diagram, repository, or notebook is first a U.MethodDescription or another episteme. The publication work is U.Work. Compute, storage, reviewer time, and artifact-release resource costs belong to U.Work and Gamma_work. The MIC may expose Submit() and ReleaseArtifacts(), forward a parameterized CrossValidate.Folds(k) interaction, and encapsulate ad hoc scrubbing utilities.

Conformance Checks

CheckRequirement
CC-B1.5-1Every claimed method part is recovered as a U.Method value before method-holon composition is admitted.
CC-B1.5-2Step wording, description nodes, plan items, work occurrences, file modules, graph edges, and source wording are not method parts by position or wording.
CC-B1.5-3Serial, parallel, guarded, iterative, fallback, adapter, and typed-join relations are method-composition or method-relation claims, not structural component parthood.
CC-B1.5-4The composite method states whole-level preconditions, effects, invariants, accepted inputs and outputs, failure conditions, and work-facing acceptance relation.
CC-B1.5-5Interface exposure distinguishes exposed, forwarded, and encapsulated interactions when outside reliance depends on the method boundary.
CC-B1.5-6U.MethodDescription, U.WorkPlan, U.Work, mechanism, formal substrate, mathematical lens, evidence, and publication-use claims remain with their direct patterns.
CC-B1.5-7If whole-method identity is not recovered, the claim is lowered to MethodRelationStructure@BoundedContext or another neighboring object without demoting U.Method as a holon kind.
CC-B1.5-8When the composite method needs whole reidentification or emergence-family explanation, use B.2 in addition to B.1.5.
CC-B1.5-9A work part is not evidence of a submethod unless the method-side candidate is recovered as U.Method; temporal slices, episodes, event-log segments, telemetry intervals, engine strokes, detector components, and work-plan items stay with their direct patterns until that recovery is made.
CC-B1.5-10Order-sensitive composition that relies on order semantics names the B.1.4 order apparatus, including OrderSpecRef, context hash, partial-order soundness, or equivalent order evidence when current.
CC-B1.5-11Typed joins show capability-continuity evidence as input/output, pre/post, adapter, bridge, or equivalence claims without turning those signatures into U.Capability instances.
CC-B1.5-12Reliance-bearing composite boundaries publish MIC or equivalent exposure lines and performed work honours only the exposed or forwarded interactions unless the method is revised.
CC-B1.5-13Resource costs, yields, dissipation, telemetry, and resource ledgers are handed to U.Work, B.1.6, and evidence patterns; B.1.5 may point to them but does not aggregate them.
CC-B1.5-14Assurance hooks name cutsets, fragile joins, adapter points, CL-sensitive mappings, and envelope or scope refs for B.3; apparent super-additivity is returned to B.2-family whole reidentification instead of being averaged into the method.

Anti-Patterns And Repairs

Anti-patternRepair
"The workflow diagram is the composite method."First govern the diagram as U.MethodDescription; admit a composite U.Method only after recovered submethods and whole-forming relations are named.
"Step A is part of the method because it is a box."Recover whether the box denotes a U.Method, description node, plan item, work occurrence, relation edge, or lens expression.
"Parallel branches can join because the picture rejoins."State the typed join, adapter, or equivalence relation; otherwise the composite method is not admitted.
"The selector table is the method."Use G.5 or MethodRelationStructure@BoundedContext unless one whole method with whole-level commitments is recovered.
"The run proved the method structure."Record the run as U.Work and evidence separately; use it as evidence only through the governing evidence or assurance relation.
"The phase is a method step."Use phase or temporal relation discipline for carrier phases and use B.2 only when the phase boundary changes whole identity, supervision, closure, or context.
"The join improves throughput, so the method has emergence."First name critical path, cutsets, typed joins, and CL-sensitive mappings for assurance; open B.2 only when the whole-level reidentification claim remains.
"The MIC is a nice diagram."Treat MIC as reliance-bearing method-interface description only when callers, planners, auditors, or substitutions depend on exposed, forwarded, or encapsulated interactions.

Consequences And Rationale

B.1.5 buys deterministic method composition without confusing method, method description, work occurrence, resource ledger, and assurance argument. The practitioner sees what is being composed by order and typed joins, what is spent by performed work, and what is later assessed by assurance.

The cost is explicitness: submethods, order apparatus, typed joins, adapters, interface exposure, and assurance hooks must be named before the composite method can be relied on. That cost prevents hidden brittleness at joins and accidental external dependencies at method boundaries.

The rationale is the old strict distinction in updated ontology. Order is semantic but not structural parthood. A method can be a non-agentive holon, but a step label, graph node, phase, source section, or work part is not a method part until the U.Method object is recovered. Gamma_method composes ways of doing; Gamma_work accounts resources; B.3 evaluates assurance; B.2 handles whole reidentification when the composed method participates as a new whole.

SoTA-Echoing

Source lineSelected source examples already carried by neighbouring hostsWhat FPF takesWhat FPF does not take
Current workflow, case, decision, process-mining, and object-centric event-log practice separates process models from event logs and resource records.A.15 carries BPMN, CMMN, DMN, DDD, service-design, and ITIL source use; A.15.1 carries dated work-occurrence identity.B.1.5 keeps method, method description, work plan, dated work, event trace, and resource aggregation separate while still allowing evidence return from work occurrence to method admission.A workflow notation, event log, or trace is not the composite method.
Typed functional, effect, protocol, and workflow-composition practice treats composition as constrained by interfaces, preconditions, postconditions, handlers, and admissible order.A.3.1 and A.3.2 carry method versus method-description separation, constructor/process-theory source use, scoped-effect analogy, and source-return discipline.B.1.5 requires typed joins, adapters, exposed or encapsulated interactions, preconditions, outputs, and failure conditions before admitting a composite method.A type signature, process theory, or source description alone does not ground dated work occurrence.
Systems and software architecture practice uses interface exposure and encapsulation to make composed behavior reliable and substitutable.A.15.2 carries plan versus occurrence discipline; A.15 carries role-assignment and method-enactment alignment.B.1.5 makes method-interface exposure part of method identity when outside work, planning, substitution, or assurance relies on it.Publication layout or diagram position does not decide whether an interaction is exposed, forwarded, or encapsulated.
FPF holon and whole-reidentification patterns require parts, whole-forming relations, whole-level commitments, and higher-level participation.A.1, B.2, A.14, C.13, and B.3.5 provide neighbouring holon, whole-reidentification, and structural-parthood tests.Composite method admission is a method-holon grounding question with method-side whole-forming relations, not a structural-component parthood shortcut.Method-composition order is not automatically A.14 component parthood.

Relations

  • Builds on A.1 for holon admission and non-agentive holon kinds.
  • Builds on B.1.4 when the method-composition claim uses Gamma_ctx, ordered-relation aggregation, context hash, or partial-order soundness.
  • Builds on A.3.1 for U.Method.
  • Builds on A.3.2 for U.MethodDescription.
  • Coordinates with A.15, A.15.1, and A.15.2 for role, method, work-plan, and performed-work separation.
  • Coordinates with B.1.6 and Gamma_work for work-resource aggregation.
  • Coordinates with B.3 for weakest-link, cutset, CL-sensitive mapping, and assurance evidence use.
  • Coordinates with A.14, C.13, and B.3.5 when structural parthood and constructive grounding are current.
  • Coordinates with B.2 when whole reidentification, MHT, or emergence-family explanation is current.
  • Coordinates with G.5 when method-family registry, selector, fallback, or candidate-set relation is current.
  • Coordinates with C.29, A.6.0, A.6.1, and E.20 when mathematical lens, formal substrate, or mechanism claim is current.
  • Coordinates with E.10 for method, step, process, workflow, owner, requirement, and source wording precision recovery.

B.1.5:End

Work-Resource Aggregation

Type: B-family aggregation pattern Status: Stable Normativity: Normative unless explicitly marked informative

Use this when. Use this pattern when the current claim aggregates resources, effort, time, energy, material, information, cost, or another measured resource over dated work occurrences, phase slices, boundary partitions, or comparable work-resource ledgers.

Not this pattern when. If the current question is the method as a way of doing, use A.3.1. If it is a method description, SOP, algorithm text, simulator configuration, or formal expression, use A.3.2. If it is a work plan, use A.15.2. If it is whether work occurred, use A.15.1. If it is work-entry readiness, full-kit condition, or resource readiness before work entry, use A.15.5. If it is temporal phase aggregation without resource accounting, use B.1.4. If it is a transformation claim, use A.3.4. If apparent resource gain changes whole identity, use B.2.P before any B.2-family owner.

What goes wrong if missed. Resource, effort, time, energy, or cost totals are read from methods, plans, dashboards, or phase labels without a dated work occurrence, resource ledger, and overlap policy.

What this buys. The practitioner can aggregate resources over performed work while avoiding double counting and returning method, plan, transformation, evidence, and MHT claims to their direct owners.

Problem Frame

Practitioners need to roll up work-resource claims across runs, phases, teams, devices, stations, model-training epochs, or evidence-production episodes. The recurring error is to treat a method, method description, plan, phase label, dashboard, or expected efficiency as if it were measured performed work.

B.1.6 governs the work-resource aggregation claim. It keeps dated work occurrence, method, method description, work plan, resource ledger, holon delimitation, transformation, evidence, and whole reidentification in their own owners.

Problem

Work-resource totals are often borrowed from plans, method descriptions, dashboards, or phase labels even when no performed-work evidence, resource-accounting basis, holon delimitation, time window, and overlap policy have been recovered. The failure is to treat a convenient total as a work-resource aggregation claim before the dated work occurrences and resource ledger are explicit.

Forces

ForceTension
Measured work vs. planned workExpected yield, duration, or resource use helps planning, but cannot prove performed-work resource use.
Typed resources vs. convenient totalsEnergy, mass, time, cost, data volume, and attention can be compared only after their resource-accounting basis and conversion relation are declared.
Boundary accounting vs. local convenienceResource values are useful only when the holon delimitation, boundary-crossing relation, stock relation, and time window are named.
Additivity vs. shared stocksDisjoint partitions can be added; shared meters, tools, people, inventories, data, or ports need overlap and deduplication policy.
Efficiency vs. whole reidentificationApparent free gain may be measurement, changed accounting basis, substitution, or a new whole; B.1.6 cannot decide that by resource wording alone.

Solution

Recover a WorkResourceAggregation@Context:

WorkResourceAggregation@Context:
  aggregationConcernRef
  parentWorkOccurrenceRef?
  workOccurrenceRefs
  boundedContextRef
  transformedOrAffectedEntityRef?
  holonDelimitationRefs
  boundaryCrossingRelationRefs?
  timeWindowRef
  phaseRelationRefs?
  resourceBasisRefs
  resourceMeasureRefs
  resourceLedgerRefs
  overlapOrDeduplicationPolicyRef?
  methodRefs?
  methodDescriptionRefs?
  workPlanRefs?
  evidenceOrMeasurementRefs
  aggregationRuleRef
  aggregatedResourceValueRef
  admissibleUse
  nonAdmissibleOverread
  strongerSourceReturnCondition

The record is a resource-aggregation relation over work evidence. It is not a method, not a method description, not proof that planned work happened, not a new holon level, and not a whole reidentification claim.

Resource readiness is a neighboring claim, not a measured aggregation result. Planned capacity, reserved inventory, staffing availability, or a full-kit-looking label may be cited as a work-plan, source, or readiness reference, but [A.15.5](/generated/patterns/A.15.5) governs whether intended work is ready to enter performed-work execution. [B.1.6](/generated/patterns/B.1.6) governs only the resource-accounting basis, ledger, evidence, aggregation rule, and aggregated value for dated work occurrences or explicitly narrowed planned estimates.

Direct Owner Map

Current claimDirect owner
Semantic way of doingA.3.1
Description of the way of doing, including algorithm text or SOPA.3.2
Planned work window or planned assignmentA.15.2
Work-entry readiness, full-kit condition, or resource readiness before work entryA.15.5
Dated performed work occurrence and occurrence evidenceA.15.1
Work-resource aggregation over dated work occurrencesB.1.6
Holon delimitation, ports, interfaces, or part-whole boundary used for accountingA.1, B.1, A.14, C.13, or the direct relation owner named by value
Boundary-crossing change under conditionsA.3.4
Phase relation or temporal coverageB.1.4 and A.14; use C.27 when temporal claim adequacy is current
Measurement construction, units, scales, thresholds, or comparabilityC.16, C.16.P, or C.29
Evidence provenance, source currentness, or source-use relationUse A.10 for evidence-use relations. Use E.17 for publication and publication-use relations. Use the direct publication or source owner when a more specific source-use claim is being made.
Apparent free efficiency, synergy, or whole reidentificationB.2.P, then B.2-family owner only if recovered

Optional Gamma_work Notation

Gamma_work is optional notation for a recovered WorkResourceAggregation@Context.

Gamma_work(workResourceAggregationRecord, resourceBasis, aggregationRule)
  -> aggregated resource value plus ledger

The notation applies only after the work occurrence refs, resource-accounting basis, time window, holon delimitation, and evidence or measurement refs have been named. It does not order method steps, certify the method, create work evidence, or declare emergence.

Ledger Discipline

A conforming WorkResourceAggregation@Context includes a work-resource ledger with:

  • work occurrence refs or parent and child work occurrence refs;
  • resource-accounting basis and unit refs;
  • time window and phase refs when time slicing is used;
  • holon delimitation refs and any boundary-crossing relation refs used for accounting;
  • method, method-description, and work-plan refs only when those objects are actually used;
  • evidence, measurement, or source refs for the resource values;
  • overlap or deduplication policy when work occurrences share resources, time windows, ports, stocks, people, tools, or data;
  • admissible use and non-admissible overread.

For any resource type in the selected resource-accounting basis, the ledger should say whether the value is measured, estimated, normalized, or converted. If the value is measured, it names the measurement or evidence relation. If the value is planned, it stays marked as expected work-resource use and does not become performed-work evidence.

When the aggregation divides a stock or resource amount, use PortionOf or the direct quantitative relation owner. When the aggregation slices one work occurrence or one carrier over time, use PhaseOf or the direct phase owner. Do not use MemberOf for resource stock, resource portion, or time-slice composition.

Aggregation Rules

Resource vectors stay typed. Add joules to joules, hours to hours, kilograms to kilograms, and bytes to bytes. A conversion or equivalence relation needs its governing measurement, model, or mathematical-lens owner.

Partition additivity requires declared partitions. Resource values may be added across disjoint boundary partitions only after the boundary and stock relation are named. Shared stock, shared meters, shared people, shared tools, or overlapping time windows require an overlap or deduplication policy.

Time slicing requires temporal coverage. A resource roll-up over phases uses non-overlapping phase refs and a time window. If a missing phase matters, the admissible use is narrowed or B.1.4/C.27 supplies the temporal owner.

Plan and result stay separate. A method description or work plan may provide expected yield, expected duration, or expected resource use. Measured work-resource aggregation uses dated work occurrence evidence. Do not overwrite one with the other.

B.1 invariant carry-through. B.1.6 keeps B.1 invariants only for recovered work-resource ledgers. A singleton zero-resource occurrence is idempotent for the selected resource-accounting basis. Addition is commutative only for independent partitions, non-overlapping slices, or explicitly deduplicated overlaps. Weakest-link claims must name the critical resource, availability, or threshold; monotonicity claims must name the resource characteristic being improved. Apparent "free" gains remain measurement, equivalence, or whole-reidentification questions until their direct owner is recovered.

Proof-sketch obligations. For idempotence, show the zero-resource or singleton ledger under the selected resource-accounting basis. For commutativity or locality, show disjoint boundary partitions, disjoint time slices, or the declared deduplication relation. For weakest-link, name the critical resource and availability condition. For monotonicity, name the exact resource characteristic that cannot get worse under the selected improvement. These are user-facing obligations for the aggregation claim, not a separate proof package.

Compact Obligation Rows

ObligationWhat must be namedWhy it matters
Typed resource vectorResource-accounting basis, unit, measure, evidence refs, and source refs for each component.Prevents hours, energy, material, cost, and data volume from becoming one undifferentiated total.
Disjoint partitionBoundary partition, stock relation, time window, and work occurrence refs.Allows addition only where the partitions are actually disjoint for the selected resource-accounting basis.
Shared-stock handlingShared meter, shared tool, shared person, shared data, shared inventory, or overlap policy.Prevents double counting and false savings.
Critical resource capThe capacity, availability, threshold, or bottleneck resource whose limit governs the claim.Makes weakest-link and capacity claims inspectable.
Yield relationInput resource refs, output result refs, loss refs, and measurement basis.Keeps efficiency from being asserted without a result relation.
Embodied and dissipated splitWhich resource remains embodied in the changed entity and which is dissipated, consumed, wasted, or externalized.Keeps conservation, loss, and waste claims from being collapsed into one spent-resource label.
Loss monotonicityThe exact loss, waste, delay, cost, risk, or degradation characteristic being bounded or reduced.Allows monotone improvement claims only for a named characteristic.
Plan-result separationExpected resource use from method description or work plan versus measured resource use from dated work evidence.Prevents a plan or algorithm from proving performed-work resource use.

Archetypal Grounding (Worked Slices)

Manufacturing cell. A frame is welded and painted in two dated work occurrences. B.1.6 records electricity, gas, consumables, and labor-hour ledgers with their time windows and meters. The step order belongs to B.1.4 or the method owner; the state change of the frame belongs to A.3.4.

Model training. A model-training run has epochs as dated work slices. B.1.6 aggregates compute energy, storage reads, and operator time from work evidence. The algorithm text is A.3.2; the trained model publication and source-use claims use episteme and publication owners; fairness or ethical assurance uses D-patterns when current.

Architecture documentation effort. A team records work spent building a multi-view architecture description. B.1.6 can aggregate the work-resource ledger. The architecture description itself remains C.30.AD; the usefulness or adequacy of a view remains C.30.ASV or its direct owner.

Bias-Annotation

Bias riskFailureMitigation
Plan becomes evidenceExpected yield or expected resource use is read as performed work.Keep planned and measured values separate and name the work occurrence evidence.
Boundary word carries accountingA port, interface, team, device, or phase label is used without a holon delimitation or boundary-crossing relation.Name the delimitation, stock, time window, and measurement relation before aggregating.
Untyped total hides conversionHours, energy, material, money, and data are added as one number.Keep resource vectors typed until a measurement, model, or mathematical-lens owner admits conversion.
Shared stock is double-countedThe same person, tool, inventory, meter, dataset, or port appears in multiple work slices.Declare overlap and deduplication policy, or narrow admissible use.
Efficiency becomes emergenceReduced resource use is treated as a new whole or synergy without reidentification.Use measurement and evidence owners first; return to B.2.P only when whole reidentification remains current.

Conformance Checklist

IDRequirementPurpose
CC-B1.6-1The aggregation names dated work occurrence refs or explicitly narrows use to planned estimates.Prevents plans and method descriptions from masquerading as performed work.
CC-B1.6-2Resource-accounting basis, units, measurement refs, evidence refs, and source refs are named.Keeps resource values comparable and reviewable.
CC-B1.6-3Holon delimitation and any boundary-crossing relation used for accounting are named by value.Prevents an unexplained boundary word from carrying the claim.
CC-B1.6-4Time windows, phase refs, and overlap and deduplication policy are present when slices or shared resources are aggregated.Prevents double counting and missing epochs.
CC-B1.6-5Method, method-description, work-plan, transformation, and whole-reidentification claims use their direct owners.Keeps work-resource aggregation from absorbing neighboring objects.
CC-B1.6-5aWork-entry readiness, full-kit condition, and resource readiness before work entry use A.15.5; B.1.6 cites such refs only as neighboring inputs when a resource aggregation claim also exists.Keeps planned or reserved resource availability from becoming measured performed-work aggregation.
CC-B1.6-6Gamma_work is used only as notation over a recovered aggregation record.Keeps algebraic notation from becoming ontology by spelling.

Common Anti-Patterns and How to Avoid Them

OverreadRepair
A method or algorithm is treated as the work-resource roll-up.Use A.3.1 or A.3.2; use B.1.6 only for the resource aggregation claim.
A work plan is treated as measured work.Use A.15.2 for the plan and A.15.1 for performed work evidence.
A phase label or timeline is treated as a resource ledger.Use B.1.4 for phase aggregation and add B.1.6 only when resource values are being aggregated.
A resource gain is treated as emergence.Use measurement and evidence owners first; use B.2.P only if whole reidentification remains current.
A dashboard or report total is treated as proof.Recover publication-use, source-use, and evidence relations before using the total.

Consequences

This pattern gives FPF a conservative place for work-resource aggregation without turning it into a general method algebra. It makes resource claims usable across levels, phases, and contexts while keeping performed work evidence, measurement, temporal coverage, and transformation separate.

The cost is explicit accounting discipline. The gain is that resource roll-ups become comparable without claiming more than the evidence and boundary relation allow.

Rationale

B.1.6 exists because work-resource accounting is easy to confuse with method, plan, phase, transformation, evidence, and whole reidentification. The governed object is the resource aggregation claim over dated work occurrences or explicitly narrowed estimates. That claim needs a ledger discipline: typed resource-accounting basis, holon delimitation, time window, stock and boundary-crossing relation, measurement or evidence relation, and overlap policy.

The pattern keeps the useful old Gamma_work notation, but only as notation over a recovered aggregation record. It also preserves the old planned-versus-measured warning: a method description or work plan can declare expected yield or expected resource use, but measured aggregation depends on dated work evidence.

SoTA-Echoing

Source linePractical implication for this pattern
Conservation and engineering accounting practiceResource roll-ups need a selected resource-accounting basis, boundary, stock relation, and time window before addition is meaningful.
Constructive mereology and phase disciplineResource portions, work phases, and collection membership are different relations; PortionOf, PhaseOf, and MemberOf cannot substitute for one another.
Measurement and mathematical-lens disciplineUnit conversion, normalization, efficiency, and typed vectors need their measurement, model, or mathematical-lens owner.
Work and method distinction in FPFA method, method description, or work plan can guide expected resource use, but performed-work aggregation requires dated work occurrence evidence.

Relations

  • Builds on A.15.1 for dated work occurrence and on A.15 for role-method-work alignment.
  • Coordinates with A.3.1, A.3.2, and A.15.2 for method, method description, and work plan.
  • Coordinates with A.15.5 for work-entry readiness, full-kit condition, and resource readiness before work entry; B.1.6 may cite those refs but does not decide readiness.
  • Coordinates with B.1.4 and C.27 for phase and temporal-claim adequacy.
  • Coordinates with A.1, B.1, A.14, and C.13 for holon delimitation, part-whole, phase, and constructive grounding.
  • Coordinates with A.3.4 for transformation. When whole reidentification or emergence-family wording is current, B.2.P tests the problem and the relevant B.2-family pattern governs the recovered claim.
  • Coordinates with C.16, C.29, and A.10 for measurement, mathematical lens, and evidence relations; source-use and publication-use relations remain with E.17 or the direct source owner.

B.1.6:End

Meta-Holon Transition - Whole Reidentification

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a configured whole can no longer be treated as the same whole for the current claim: its delimitation, objective, supervision, capability envelope, agency threshold, temporal consolidation, or bounded context has changed enough that the EntityOfConcern must be reidentified.

Typical moments:

  • a set of coordinated parts becomes a regulated system with its own objective and externally visible commitments;
  • a commissioning history crosses into operation and the assurance claim must restart for the operational whole;
  • a theory, model family, or knowledge body becomes an admitted episteme whole rather than a loose catalogue;
  • a capability envelope appears only after structure, functioning, method, work, and evidence align;
  • an architecture residual cannot be explained inside the existing whole.

First useful move. Try ExistingWholeExplanationCheck@Context first. If the observed gain or shift can be explained inside the existing whole by better parts, corrected relations, improved measurement, method or work repair, richer phase coverage, or architecture-view repair, stay with the existing whole and its direct owners. Use B.2 only when the whole itself must be reidentified.

What goes wrong if missed. Emergence becomes rhetoric, ordinary improvement is overclaimed as a new whole, or a genuinely new whole remains hidden under old part, evidence, assurance, architecture, or responsibility claims.

What this buys. B.2 gives one accountable whole-reidentification move: recover the existing whole, trigger profile, result holon kind, identity claim, evidence, direct owner of changed content, and blocked overreads before any MHT claim is relied on.

Not this pattern when.

  • If the claim is ordinary part-whole construction, use B.1, A.14, and C.13.
  • If the claim is a whole-level characteristic change, use C.16 and measurement or evaluation owners.
  • If the claim is capability without whole reidentification, use capability and characteristic owners.
  • If the claim is transformation or work, use A.3.4, A.12, A.15, and A.15.1.
  • If the claim is only wording repair for emergence-family language, use B.2.P first.
  • If the claim is graph, RG-like, MSPD, or other mathematical expression, use C.29 unless whole reidentification is also current.

Problem Frame

A Meta-Holon Transition is not a new root ontology, not a generic emergence label, and not a mathematical graph result. It is a whole-reidentification claim about a holon in a bounded context.

The old whole remains a possible explanatory object. B.2 is selected only when the old whole is no longer the right EntityOfConcern for the current claim. The result can be admitted as a U.System, U.Episteme, U.Work, U.BoundedContext, U.Discipline, or another holon kind only when the direct governing pattern admits that kind and slot discipline.

Problem

Without B.2:

  1. New whole is missed. A coordinated closure or context reframe changes the object, but evidence and architecture still point to old parts.
  2. Ordinary improvement is overclaimed. A better component, stronger measurement, or corrected method is called emergence.
  3. Record fields become ontology. A result field, trigger mnemonic, profile, or checklist is treated as a U-kind or actor.
  4. Agency becomes binary. A threshold crossing is read as "agent or not agent" instead of a characteristic-space threshold for a system in role.
  5. Mathematics replaces ontology. A graph, RG-like flow, MSPD score, or benchmark jump is treated as MHT without recovering the holon claim.
  6. Transformation becomes containment. A system changing another holon is treated as that holon's super-holon.

Forces

ForceTension
Parsimony vs real noveltyFPF should not mint new wholes for every improvement, but some closures really change the EntityOfConcern.
Continuity vs reidentificationHistory and phase continuity matter, but some transitions require a new result whole.
Trigger recognition vs trigger inflationDelimitation, objective, supervision, capability, agency threshold, time, and context cues help recognition but do not declare MHT by themselves.
System-facing emergence vs broader holonsHolonic systems literature is system-facing, while FPF also needs episteme, work, bounded-context, and discipline result cases.
Math-lens power vs ontology disciplineRG-like, graph, algebraic, or benchmark expressions can bear on a claim only after the holon and relation are named.

Solution

Use B.2 as a whole-reidentification pattern with three artifacts: a trigger profile, an existing-whole explanation check, and a holon reidentification record.

MHTTriggerProfile

MHTTriggerProfile@Context is a trigger and evidence profile for possible whole reidentification. It is not a U-kind and not MHT itself.

MHTTriggerProfile@Context:
  existingWholeRef: U.Holon
  boundedContextRef:
  holonDelimitationChangeRef?
  objectiveOrEvaluationChangeRef?
  supervisionOrCoordinationChangeRef?
  capabilityOrClosureEvidenceRef?
  agencyThresholdRef?
  temporalConsolidationRef?
  contextReframeRef?
  evidenceRelationRefs:
  sourceUseRelationRefs?
  candidateResultHolonKindRef?

The profile asks whether enough has changed to make the old whole no longer the right EntityOfConcern. A single trigger is evidence for attention, not automatic admission.

ExistingWholeExplanationCheck

Before declaring MHT, run:

ExistingWholeExplanationCheck@Context:
  observedGainOrShiftRef:
  existingWholeRef:
  explanationByBetterParts?
  explanationByCorrectedPartRelation?
  explanationByImprovedMeasurement?
  explanationByRaisedCongruenceOrSourceQuality?
  explanationByMethodOrWorkRepair?
  explanationByTemporalCoverageRepair?
  explanationByArchitectureViewRepair?
  explanationByCapabilityOrFunctioningRepair?
  remainingWholeReidentificationQuestion:

If an existing-whole explanation is sufficient, do not declare MHT. Use the direct owner for the repair.

HolonReidentificationRecord

Declare MHT only with a record that names the old whole, result whole, result kind, triggers, identity claim, and owner boundaries.

HolonReidentificationRecord@Context:
  existingWholeRef: U.Holon
  boundedContextRef:
  selectedTriggerProfileRef: MHTTriggerProfile@Context
  existingWholeExplanationCheckRef: ExistingWholeExplanationCheck@Context
  mhtResultHolonRef:
  mhtResultSystemRef?
  mhtResultEpistemeRef?
  mhtResultWorkOccurrenceRef?
  mhtResultBoundedContextRef?
  mhtResultDisciplineRef?
  resultHolonKindAdmissionRef:
  identityContinuationOrReidentificationClaim:
  changedContentOwnerRefs:
  evidenceRelationRefs:
  sourceUseRelationRefs?
  mathLensUseRefs?
  blockedOverreads:

This record is not a U-kind and not an actor. It carries the reidentification claim and the direct owners of neighboring claims.

Result References

Use result references as fields, not as kinds:

  • mhtResultHolonRef for the reidentified whole;
  • mhtResultSystemRef only when the result is admitted as U.System;
  • mhtResultEpistemeRef only when the result is admitted as U.Episteme;
  • mhtResultWorkOccurrenceRef only when the result is admitted as U.Work;
  • mhtResultBoundedContextRef only when a bounded context is itself the result whole under its direct owner;
  • mhtResultDisciplineRef only when the result is a discipline holon under C.20.

Do not use post* field names as live governed names. They hide the result kind and invite temporal shorthand.

Agency Threshold

Agency is not a binary status and not a root kind. Treat agency as a characteristic-space threshold for a system in bounded context.

Use A.13, A.19, and C.16 for the characteristic-space and threshold claim. Levin-line TAME work can discipline the multi-characteristic framing when agency evidence is relied on for the current claim. B.2 uses agency threshold only as one possible trigger in MHTTriggerProfile@Context, and only when crossing the threshold changes closure, supervision, objective, or whole identity.

Acting-System Participation

When a source describes a system changing another holon, recover acting-system participation and transformation separately.

Use A.12 for acting-side externalization, A.3.4 for bounded transformation, and A.15.1 for work occurrence. A system changing another holon does not become that holon's super-holon, and no U.Transformer kind is created.

Mathematical-Lens Separation

Graph, algebra, RG-like, MSPD, benchmark, scaling, and morphism language can bear on MHT recognition only as mathematical or analytical expression.

Use C.29 when the mathematical lens is relied on for the current claim. Use B.2 only after the holon identity claim is recovered and the existing-whole explanation check leaves a whole-reidentification question.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Emergence rhetoricA gain, surprise, or synergy label declares a new whole.Run ExistingWholeExplanationCheck@Context before B.2.
Record as ontologyTrigger profiles, result fields, or checklist labels become U-kinds.Admit result holon kind through direct owners and keep records as records.
Math as MHTGraph, RG-like, MSPD, benchmark, scaling, or morphism expression declares whole reidentification.Use C.29; recover holon identity and existing-whole explanation first.
Binary agencyAgency threshold crossing is treated as a root kind or binary status.Use characteristic-space and threshold owners; use B.2 only when whole identity changes.
Transformation as containmentA system changes another holon and is treated as its super-holon.Use A.12, A.3.4, A.15.1, and boundary-crossing owners before part-whole or MHT admission.

Compendium Becomes Theory

A collection of results can remain a catalogue. B.2 becomes current only when the knowledge body is reidentified as an episteme whole with its own claim-bearing structure, explanatory objective, reference scheme, and evidence relations.

B.2.3 specializes this case when the MHT-result holon is admitted as U.Episteme. C.2.1 and the episteme family own episteme slot relation, publication, source-use, and claim-bearing structure.

Capability Envelope Appears

Several systems, methods, and work occurrences align and a new capability envelope appears. Use direct capability, characteristic, function, transformation, method, work, evidence, and architecture owners first.

Use B.2.4 only when that capability or functioning evidence creates or reveals a whole-reidentification question under B.2.

Lathe And Workpiece

A lathe transforms a workpiece. That is transformation and work, not MHT and not parthood. B.2 becomes current only if the manufacturing arrangement creates or reveals a new whole that must be reidentified, such as a production cell with closure, objective, coordination, and evidence that cannot be explained by the existing parts alone.

Bias-Annotation

Bias riskFailureMitigation
Emergence rhetoricA gain, surprise, or synergy label declares a new whole.Run ExistingWholeExplanationCheck@Context before B.2.
Record as ontologyTrigger profiles, result fields, or checklist labels become U-kinds.Admit result holon kind through direct owners and keep records as records.
Math as MHTGraph, RG-like, MSPD, benchmark, scaling, or morphism expression declares whole reidentification.Use C.29; recover holon identity and existing-whole explanation first.
Binary agencyAgency threshold crossing is treated as a root kind or binary status.Use characteristic-space and threshold owners; use B.2 only when whole identity changes.
Transformation as containmentA system changes another holon and is treated as its super-holon.Use A.12, A.3.4, A.15.1, and boundary-crossing owners before part-whole or MHT admission.

Conformance Checklist

CheckRequirement
CC-B2-1A B.2 use names the existing whole and bounded context before declaring whole reidentification.
CC-B2-2MHTTriggerProfile@Context is a trigger and evidence profile, not a U-kind or substitute for MHT.
CC-B2-3ExistingWholeExplanationCheck@Context is completed before MHT is declared.
CC-B2-4HolonReidentificationRecord@Context names result refs, result kind admission, identity claim, evidence, source-use relation, math-lens use when current, and blocked overreads.
CC-B2-5Agency-threshold claims use characteristic-space and threshold owners; B.2 uses them only when whole identity changes.
CC-B2-6Acting-system participation and transformation use A.12 and A.3.4; B.2 does not create U.Transformer.
CC-B2-7Mathematical expressions can bear on but do not replace the holon reidentification claim.
CC-B2-8Result references are fields, not new U-kinds.
CC-B2-9Episteme, system, work, bounded context, and discipline result cases use their direct admission patterns.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Emergence by adjectiveA capability or property is called emergent without reidentifying the whole.Use B.2.P to recover claim kind, then B.2 only if whole reidentification is current.
Record as ontologyTrigger profile, result field, or record name is treated as a U-kind.Keep profile and record as forms; admit the result holon kind through direct owners.
KPI jump as MHTA metric improves and MHT is declared.Run ExistingWholeExplanationCheck@Context; use measurement, characteristic, method, work, or architecture owners if sufficient.
Agency shortcutAgency threshold crossing creates a new root kind.Use characteristic-space threshold owners; B.2 only when closure, supervision, objective, or identity changes.
Math result as MHTGraph, RG-like, MSPD, or benchmark expression declares new whole.Use C.29; recover holon identity before B.2.
Transformation as containmentA system changes another holon and is treated as its super-holon.Use A.12, A.3.4, A.15.1, and boundary-crossing relation owners; use parthood only if independently admitted.

Consequences

Positive consequences:

  • MHT becomes a precise whole-reidentification move rather than a synonym for improvement.
  • System, episteme, work, bounded-context, and discipline result cases share one B.2 spine while keeping their direct owners.
  • Trigger language remains useful without becoming ontology.
  • Mathematical and benchmark evidence can be used without replacing the holon claim.

Costs:

  • Users must try existing-whole explanations before declaring MHT.
  • MHT records require explicit result-kind admission and evidence.
  • Some attractive emergence claims will return to ordinary characteristic, method, work, architecture, or measurement repair.

Rationale

Holonic work needs a way to recognize when a whole has changed enough that the old EntityOfConcern no longer carries the current claim. B.2 provides that move without collapsing all novelty into "emergence" and without inventing record-field U-kinds.

The pattern is intentionally conservative: it preserves ordinary direct-owner repairs first, then admits whole reidentification only when the existing whole no longer explains the observed shift. This protects B.1 part-whole construction, A.15 work, A.3.4 transformation, C.16 characteristics, C.29 math-lens use, and episteme and publication discipline from being swallowed by MHT.

SoTA-Echoing

Source familyCurrent lesson for B.2FPF decision
Holonic systems and cyber-physical systems practiceClosure, coordination, objective, and system-wide outcomes can justify treating a configured whole as a new operating object.MHTTriggerProfile@Context includes delimitation, objective, supervision, capability or closure, agency threshold, time, and context cues.
Constructional ontology and identity workReidentification must say what object is being continued, replaced, or newly admitted.HolonReidentificationRecord@Context names existing whole, result whole, identity claim, and result-kind admission.
TAME and agency-as-continuum workAgency is multi-characteristic and thresholded by concern, not a binary kind.Agency threshold remains a characteristic-space trigger, not a root kind.
Mathematical modeling and RG-like analysisScale, coarse-graining, and trajectory measures can reveal pressure for reidentification but are lenses.B.2 uses C.29 when mathematical-lens use is relied on and requires holon recovery before MHT.

Relations

  • Builds on: A.1 for holon admission, B.1 for part-whole construction, A.14 and C.13 for relation and constructional grounding, and E.24.UK for result-kind admission discipline.
  • Coordinates with: A.12 and A.3.4 for acting-side and transformation, A.15 and A.15.1 for method and work, C.16 and A.19 for characteristic space and threshold, C.29 for mathematical lenses, C.32.P2S when architecturing pressure becomes whole reidentification or emergence rather than local structure repair, and A.10 for evidence.
  • Specialized by: B.2.2 for system-result MHT, B.2.3 for MHT-result holons admitted as U.Episteme, and B.2.4 for capability and functioning whole reidentification.
  • Can use neighboring evidence from: B.2.5 when a supervisor-subholon feedback relation is part of the B.2 case evidence or neighboring structure; that does not make B.2.5 a result-kind specialization.
  • Uses: B.2.P when emergence-family, MHT, MET, MFT, synergy, or metric-mirage wording hides which claim kind is current before B.2 is applied.

B.2:End

Emergence and MHT Precision Restoration

Type: Part B precision-restoration pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when wording such as emergence, emergent, synergy, higher-level property, meta-system, meta-epistemic, meta-functional, MHT, MET, MFT, promotion, post*, or collection words mixed with those terms could be pointing to several different FPF objects.

The first useful move is:

Recover the claim kind before choosing replacement wording.

B.2.P is selected only when the source wording hides one of these recurring questions:

  • Is this a B.2 whole-reidentification claim?
  • Is this a system-result, episteme-result, or capability and functioning specialization of B.2?
  • Is this only a characteristic, capability, functioning, architecture, evidence, measurement, or mathematical-lens claim?
  • Is a collection, fleet, community, pool, or base being admitted as a whole, acting collective, whole-level characteristic bearer, or merely a membership set?
  • Is a metric jump or benchmark result being overread as a new whole?

What goes wrong if missed. A word like "emergent" becomes a shortcut to a new U-kind, a collection receives agency by name, a metric jump becomes MHT, or source title mnemonics survive as if they were current pattern authority.

What this buys. B.2.P gives one local recovery profile for emergence-family and MHT wording. It keeps B.2-family subject patterns centered on whole reidentification while ordinary capability, characteristic, function, architecture, evidence, math-lens, publication, and collection claims remain with their direct owners.

Not this pattern when.

  • If the text already names the governing pattern and object by value, use that pattern directly.
  • If the question is ordinary collection admission without emergence, synergy, MHT, metric mirage, or whole-reidentification wording, use [A.14](/generated/patterns/A.14), [C.13](/generated/patterns/C.13), [B.3.5](/generated/patterns/B.3.5), [A.1](/generated/patterns/A.1), [A.15](/generated/patterns/A.15), A.2 patterns, or [C.16](/generated/patterns/C.16) directly.
  • If the question is phrase-level plain technical rewriting after the object is recovered, use [F.19](/generated/patterns/F.19).
  • If the question is general wording-use architecture, use [E.10](/generated/patterns/E.10) and [E.10.ARCH](/generated/patterns/E.10.ARCH).

Problem Frame

Emergence-family wording is overloaded. It can point to a new system whole, an episteme whole, a capability envelope, a characteristic crossing, an architecture residual, a mathematical scale expression, a benchmark artifact, a publication claim, or a collection-as-whole question.

The pattern therefore does not ask "what word should replace emergence?" It asks which EntityOfConcern, claim kind, slot relation, and direct governing pattern are current.

Problem

Without B.2.P:

  1. Generic emergence becomes ontology. U.Emergence or an equivalent hidden kind appears even though no such root kind is selected.
  2. Collections become systems by poetry. A fleet, community, pool, or base is treated as an acting system because the phrase sounds collective.
  3. Capability becomes MHT. A new capability envelope or functioning relation is treated as a new whole without checking existing-whole explanations.
  4. Mathematics becomes declaration. A graph, scaling law, RG-like expression, benchmark jump, or MSPD score is treated as whole reidentification.
  5. Old mnemonic titles become current owners. Source labels such as MET or MFT hide whether the result is an episteme whole, capability and functioning evidence, or something else.
  6. Semio-bias returns. Publication, dashboard, model, or source interpretation claims displace the in-life holon or characteristic under concern.

Forces

ForceTension
Useful recognition vs false kindEmergence wording often marks a real modeling concern, but it does not name a selected root kind.
Whole reidentification vs property changeSome cases need B.2; many cases need only characteristic, capability, function, architecture, evidence, or math owners.
Collection language vs collective systemCollection words can name membership, a constructed whole, an acting system, or a characteristic bearer.
Source mnemonics vs current authorityShort labels help recognition but can preserve rejected ontology.
Mathematical expression vs ontology replacementFormal or statistical expressions can bear on a claim only after the governed object is recovered.

Solution

Recover the claim kind and direct owner before any wording replacement.

Emergence Claim-Kind Recovery

Use this recovery note:

EmergenceClaimKindRecovery@Context:
  sourceExpression:
  projectConcern:
  candidateEntityOfConcernRef:
  sourceUseDisposition:
  recoveredClaimKind:
  recoveredDirectOwnerPattern:
  candidateWholeReidentificationRef?
  candidateResultHolonKindRef?
  characteristicOrCapabilityRef?
  functionOrFunctioningRef?
  architectureOrStructureRef?
  mathematicalLensUseRef?
  evidenceOrMeasurementRef?
  collectionAdmissionRef?
  publicationOrSourceUseRef?
  blockedOverreads:
  replacementWordingOrStop:

The recovery note is not a U-kind and not a durable project object by itself. It is a local precision-restoration record.

Claim-Kind Recovery and Owner Selection Table

Recovered claim kindUse this ownerDo not overread as
Whole reidentification of a holonB.2, then B.2.2, B.2.3, B.2.4, or another admitted result-kind owner when currentgeneric emergence, metric gain, or title mnemonic
System-result MHTB.2.2all emergence cases or all system aggregation
Episteme-result MHTB.2.3 plus C.2.1 and episteme familyepisteme agency, publication authority, or EFEM by title
Capability or functioning evidence that creates or reveals whole reidentificationB.2.4 under B.2generic capability, generic function, or all functioning
Ordinary capability claimA.2.2 and C.16MHT
Function or functioning claimA.6.F, A.3.4, C.30.TFS-REL, C.16, or direct owner named by valueU.Emergence or MHT by wording
Whole-level characteristic or thresholdC.16, A.19, A.13, evidence ownersnew whole by metric alone
Architecture-induced property or residualC.30, A.22, C.30.ASV, C.30.TFS-REL, C.30.ILC, and C.29 when mathematical lens is currentMHT unless B.2 reidentification is recovered
Mathematical emergence, scale, coarse-graining, graph, morphism, benchmark, or MSPD expressionC.29 plus the direct subject ownerontology by mathematical spelling
Metric or benchmark mirageC.16, A.10, C.29, source-use, and evaluation ownersMHT or system admission
Collection or collective wording mixed with emergence, MHT, or synergyFirst recover membership, collection-as-whole, acting collective, whole-level characteristic, or MHTcollection admission by B.2.P
Publication, model, dashboard, theory-text, or report claimC.2.1, E.17, C.30.AD, E.17.*, source-use, or episteme ownersin-life whole by description alone

Whole-Reidentification Recovery

When whole reidentification remains possible after the claim-kind recovery, recover the B.2 slot relation:

B2WholeReidentificationRecovery@Context:
  existingWholeRef:
  boundedContextRef:
  candidateResultHolonKindRef:
  candidateResultRef:
  mhtTriggerProfileRef:
  existingWholeExplanationCheckRef:
  changedContentOwnerRefs:
  evidenceOrSourceRelationRefs:
  mathematicalLensUseRefs?
  blockedOverreads:

Then return to B.2. B.2.P does not declare MHT.

Collection Boundary

Collection words enter B.2.P only when they are entangled with emergence, synergy, MHT, metric mirage, or whole-reidentification wording.

If the claim is plain collection admission:

  • use A.14 for membership and part-whole relation vocabulary;
  • use C.13 for collection-as-whole constructional grounding;
  • use B.3.5 for working-model assurance grounding;
  • use A.1 with A.15 and A.2 patterns for an acting collective admitted as U.System;
  • use C.16 for a whole-level characteristic.

B.2.P may record that these are the direct owners; it does not own them.

Source Mnemonics and Result Fields

Treat source labels and short forms as recognition cues until their governed object is recovered.

  • MET may point to an episteme-result MHT, source-title wording, episteme morphing, publication synthesis, or source-only phrase. Recover before use.
  • MFT may point to capability and functioning whole reidentification, a functional-structure view, function-like wording, method and work collapse, or source-only phrase. Recover before use.
  • promotion may hide whole reidentification, status change, release, gate, publication, or project process wording. Recover before use.
  • post* fields should become mhtResult*Ref only when B.2 record fields are current.

Do not keep the source label as the pattern owner merely because it is recognizable.

Archetypal Grounding (Worked Cases)

"The Fleet Emerged As A New Actor"

Recover:

  • Is "fleet" a membership set, collection-as-whole, acting collective system, or MHT-result system?
  • Does the agency wording name a system in role, an agency-threshold claim, or only ordinary prose?
  • Is there result-system delimitation, objective, coordination, capability envelope, evidence, and assurance?

If the result is an acting system whole, use B.2 and B.2.2. If it is only a managed collection with a whole-level metric, use A.14, C.13, B.3.5, and C.16.

"The Model Shows Emergent Robustness"

Recover:

  • Is the model a description episteme or mathematical-lens expression?
  • Is robustness a characteristic-space claim?
  • Is the result a benchmark artifact?
  • Is there an in-life holon whole-reidentification question?

Most cases use C.29, C.16, A.10, and source-use owners. Use B.2 only if the in-life whole has to be reidentified.

"A Meta-Functional Transition Happened"

Recover:

  • Is there capability or functioning evidence?
  • Does the evidence create or reveal a whole-reidentification question?
  • Is the current object a function-like wording issue, a functional-structure view, a method and work relation, or a result holon?

Use B.2.4 only for the B.2-facing whole-reidentification case. Otherwise use A.6.F, A.2.2, C.16, A.3.4, C.30.TFS-REL, A.15, or architecture owners.

Bias-Annotation

BiasHow B.2.P prevents it
Emergence-as-root-kind biasThe recovery starts from EntityOfConcern, claim kind, and direct owner; no generic U.Emergence is introduced.
Collection-agency biasCollective nouns are separated into membership set, constructed whole, acting collective system, whole-level characteristic bearer, or MHT-result holon.
Metric-as-whole biasBenchmark jumps and characteristic changes stay with C.16, A.10, C.29, source-use, and evaluation owners unless B.2 whole reidentification is still live.
Math-lens-as-ontology biasGraph, scale, morphism, benchmark, and MSPD expressions stay mathematical-lens or evaluation material until the in-life EntityOfConcern is recovered.
Source-mnemonic biasMET, MFT, promotion, and post* spellings remain recognition cues until the governed object and owner pattern are named.

Conformance Checklist

CheckRequirement
CC-B2P-1Precision restoration starts with claim-kind recovery, not lexical replacement.
CC-B2P-2No generic U.Emergence is created.
CC-B2P-3Whole reidentification returns to B.2; B.2.P does not declare MHT.
CC-B2P-4Collection admission remains with direct owners unless collection wording is entangled with emergence-family or MHT wording.
CC-B2P-5Capability, functioning, characteristic, architecture, evidence, math-lens, publication, and source-use claims keep their direct owners.
CC-B2P-6Source mnemonics and result-field spellings do not become pattern owners or U-kinds.
CC-B2P-7Replacement wording is scanned again for E.10 triggers before it is admitted as live FPF wording.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Emergence as root kindThe sentence needs a new named thing called emergence.Recover claim kind; use B.2, C.16, C.29, C.30, A.2.2, A.6.F, A.10, or source-use owner.
Collection receives agency by wordingA community, pool, fleet, or base acts because the noun is collective.Recover membership, collection-as-whole, acting collective system, whole-level characteristic, or MHT separately.
Metric jump as new wholeBenchmark improvement is declared as emergence.Use C.16, A.10, C.29, and source-use owners; return to B.2 only if the whole must be reidentified.
Title mnemonic as authorityMET or MFT is used as if the acronym named the governed object.Recover episteme-result MHT, capability and functioning whole reidentification, direct episteme owner, function owner, or source-only wording.
Description as in-life wholeA model, dashboard, report, or twin is treated as the system because it depicts the system.Use episteme, publication, architecture-description, source-use, or digital-twin description owners unless the in-life holon is recovered.

Consequences

Positive consequences:

  • B.2-family emergence language no longer creates hidden U-kinds.
  • B.2, B.2.2, B.2.3, and B.2.4 stay centered on their subject claims instead of carrying repeated first-stage precision restoration.
  • Collections, capabilities, functions, characteristics, architecture residuals, mathematical expressions, and publications keep their direct owners.

Costs:

  • Ambiguous emergence-family phrases take one recovery step before use.
  • Some attractive umbrella claims become narrower direct-owner claims.
  • Old mnemonic labels may survive only as quoted source wording or reduced-use cues unless their current governed object is recovered.

Rationale

Emergence-family wording is useful because it marks a possible explanatory concern. It is dangerous because it can hide the actual object: a holon, system, episteme, capability, characteristic, architecture structure, mathematical expression, evidence relation, source publication, or collection.

B.2.P follows the E.10.ARCH algorithm: recover ontology first, then choose wording. This prevents one word from creating several local ontologies.

SoTA-Echoing

Line of practicePractical implication for B.2.P
Emergence and whole-level behavior literature distinguishes new-whole questions from ordinary characteristic, capability, and measurement claims.B.2.P keeps whole reidentification with B.2 and assigns ordinary characteristic, capability, evidence, and measurement claims to their direct owners.
Systems and holonic practice use collection and whole language for many different objects.B.2.P requires membership, constructed whole, acting collective system, whole-level characteristic bearer, and MHT-result holon to be recovered separately.
Mathematical and statistical treatments of scale, coarse-graining, graphs, morphisms, and benchmarks can clarify a claim without replacing the ontology.B.2.P uses C.29 for the mathematical-lens claim and still requires the in-life EntityOfConcern and direct subject owner.
Publication and model practice often makes the description more visible than the described holon or characteristic.B.2.P separates publication, source-use, model, dashboard, and architecture-description claims from the in-life whole-reidentification claim.

Relations

  • Builds on: E.10, E.10.ARCH, E.24, F.18, and B.2.
  • Returns whole reidentification to: B.2, with B.2.2, B.2.3, and B.2.4 as current specializations.
  • Keeps collection admission with: A.14, C.13, B.3.5, A.1, A.15, A.2 patterns, and C.16.
  • Coordinates with: A.2.2, C.16, A.6.F, A.3.4, C.30, A.22, C.30.ASV, C.30.TFS-REL, C.30.ILC, C.32.P2S, C.29, A.10, C.2.1, E.17, and source-use patterns.

B.2.P:End

Meta-System Transition - System Specialization of MHT

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a Meta-Holon Transition result is an acting physical or operational holon admitted as U.System: a swarm, production cell, cloud platform, regulated control system, organizational unit, or another operating whole that now has system participation slots of its own.

The first useful question is not "is there emergence?" but:

Is the MHT-result whole a U.System whose delimitation, objective,
supervision or coordination, capability envelope, role assignments,
methods, work occurrences, transformations, functioning, evidence,
assurance, and temporal claims must be re-declared for the result whole?

Use [B.2](/generated/patterns/B.2) first to decide whether whole reidentification is needed. Use [B.2.2](/generated/patterns/B.2.2) only after the result-kind question points to mhtResultSystemRef.

What goes wrong if missed. A real operating whole is still managed through old component claims, or a mere collection is declared a new system without system participation evidence.

What this buys. The system MHT keeps the useful meta-system-transition intuition while preserving FPF's direct owners for system participation, architecture, capability, transformation, work, evidence, and assurance.

Not this pattern when.

  • If the result whole is claim-bearing and non-agentive, use [B.2.3](/generated/patterns/B.2.3) and the episteme family.
  • If the evidence is only a capability or functioning gain without whole reidentification, use [A.2.2](/generated/patterns/A.2.2), [C.16](/generated/patterns/C.16), [A.6.F](/generated/patterns/A.6.F), [A.3.4](/generated/patterns/A.3.4), C.30.TFS-REL, and [A.10](/generated/patterns/A.10).
  • If the claim is ordinary system aggregation or delimitation, use [B.1.2](/generated/patterns/B.1.2), [A.1](/generated/patterns/A.1), [A.14](/generated/patterns/A.14), and [C.13](/generated/patterns/C.13).
  • If the claim is a mathematical, simulation, graph, benchmark, or scaling expression, use [C.29](/generated/patterns/C.29) and the relevant description or publication pattern before returning to B.2.
  • If the claim is only supervisor-subholon feedback relation inside an already admitted system whole, use [B.2.5](/generated/patterns/B.2.5).

Problem Frame

B.2 is holon-general. B.2.2 is its system-result specialization.

A system-result MHT occurs when the result of whole reidentification is an acting physical or operational holon. The old constituent systems may remain parts, participants, resources, or interacting neighbors, but the current claim now needs a result system with its own selected delimitation, objective, supervision or coordination, capability envelope, functioning relation, architecture claims, transformation participation, work occurrences, evidence, assurance, and temporal claims.

The pattern does not say that every collection of systems is a system MHT. It says how to carry the system ontic when B.2 has already left a whole-reidentification question and the result-kind admission is U.System.

Problem

Without this specialization:

  1. System identity stays on old parts. The project keeps component assurance, component responsibilities, and component interfaces after the operating whole has changed.
  2. System claims become rhetoric. A group gets a collective name, but no result-system delimitation, objective, coordination, or capability evidence is named.
  3. Supervision is overread. A coordination mechanism is treated as a super-holon, safety evidence, or a complete system admission.
  4. Transformation is confused with containment. One system changing another holon is treated as part-whole construction instead of transformation and work.
  5. Architecture description replaces architecture. Dashboards, diagrams, simulations, bills, and digital twins are treated as the operating system rather than descriptions of it.

Forces

ForceTension
Component assurance vs result-system assuranceOld component claims may still matter, but they do not automatically cover the new operating whole.
Delimitation vs external participationThe result system needs an admitted delimitation while external acting systems, resources, and environments remain outside it.
Coordination vs whole identityCoordination can be evidence for system MHT, but coordination alone does not admit a new system whole.
Capability gain vs identity changeA new capability envelope can reveal a result system, but some gains remain ordinary capability or functioning claims.
System architecture vs system descriptionArchitecture claims concern the operating whole; diagrams and records are description epistemes or publication forms.

Solution

After B.2 leaves an MHT question open, admit the system-result case with a system-focused slice of the HolonReidentificationRecord@Context.

System-Result MHT Slice

Use this slice when mhtResultSystemRef is selected.

SystemMHTSlice@Context:
  existingWholeRef: U.Holon
  mhtResultSystemRef: U.System
  boundedContextRef:
  selectedTriggerProfileRef: MHTTriggerProfile@Context
  existingWholeExplanationCheckRef: ExistingWholeExplanationCheck@Context
  systemKindAdmissionRef: A.1 or B.1.2 admission
  resultDelimitationRelationRef:
  resultBoundaryCrossingRelationRefs:
  objectiveOrEvaluationRelationRef?
  supervisionOrCoordinationRelationRef?
  capabilityEnvelopeRef?
  roleAssignmentRefs?
  methodOrMechanismRefs?
  transformationParticipationRefs?
  workOccurrenceRefs?
  functioningRelationRefs?
  architectureClaimRefs?
  evidenceOrAssuranceRefs?
  temporalOrDynamicsRefs?
  blockedOverreads:

This slice is not a U-kind. It is the system-result part of the B.2 record, written so that every system-dependent claim can return to its direct owner.

System Participation Re-Basing

When the result is U.System, re-base system participation slots for the result system:

  • role assignments through A.2.1 and role-relation owners;
  • capabilities through A.2.2 and C.16;
  • methods and mechanisms through A.15, A.6.1, and their current direct owners;
  • transformations through A.3.4;
  • work occurrences through A.15.1;
  • functioning and functional structure through A.6.F and C.30.TFS-REL;
  • architecture through C.30, A.22, and C.30.ASV;
  • evidence and assurance through A.10, B.3, and B.3.5;
  • temporal and dynamics claims through C.27, A.19, and the direct temporal owners.

Do not reuse old component evidence as if it automatically covered the result system. Carry continuities by explicit relation; re-declare changed slots for the result system.

System Trigger Interpretation

The B.2 trigger profile can be interpreted for systems as follows:

Trigger family in MHTTriggerProfile@ContextSystem-result readingDirect owner kept visible
Delimitation changeThe operating whole now has an external delimitation and crossing relations that differ from the old aggregate.A.1, B.1.2, A.14, C.13
Objective or evaluation changeThe whole is now evaluated by a system-level objective, mission, SLO, safety case, or viability claim.C.16, E.13, A.10, decision or assurance owners
Supervision or coordination changeA controller, protocol, governance relation, or distributed coordination relation regulates constituent behavior for the result whole.B.2.5, A.12, A.3.4, A.15.1
Capability or closure evidenceThe capability envelope belongs to the result system, not to any one constituent alone.A.2.2, C.16, B.2.4 when whole reidentification is current
Agency thresholdThe result whole crosses a concern-specific agency threshold in characteristic space.A.13, A.19, C.16
Temporal consolidationA commissioning, phase, release, or operating-time consolidation changes the current system identity claim.C.27, A.15.1, temporal owners
Context reframeThe relevant bounded context changes the operating whole under concern.A.1, bounded-context owners, architecture owners

No single row is enough by itself. The row names evidence to inspect. B.2 decides whether the whole must be reidentified.

Delimitation and External Acting Systems

For system-result MHT, distinguish:

  • a part of the result system;
  • an external acting system that changes the result system or a constituent;
  • an environment or resource that participates in work;
  • a description, dashboard, twin, model, diagram, or publication about the result system.

A lathe making a workpiece, a controller steering a plant, or a teacher changing a learner does not become a super-holon merely because it changes another holon. Use A.12, A.3.4, and A.15.1 for acting side, transformation, and work. Use part-whole owners only when parthood itself is admitted.

Assurance Re-Basing

When mhtResultSystemRef is admitted, old assurance must be tested against the result system.

Ask:

  • Which component evidence still applies unchanged?
  • Which evidence applies only through explicit correspondence or source-use relation?
  • Which assurance claims must be rewritten for the result system?
  • Which architecture, capability, functioning, work, temporal, or evidence claims now have different owners?

The result system can inherit evidence only through named relations. It does not inherit safety, reliability, responsibility, or performance claims by label.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Named aggregate as systemA fleet, platform, or cell name is treated as system admission.Require result-system delimitation, objective, coordination, capability, and evidence refs.
Component evidence transferComponent certificates are read as result-system assurance.Re-base assurance and evidence for mhtResultSystemRef.
Coordination as wholeA controller, protocol, or coordination relation is treated as automatic system MHT.Keep supervision evidence visible, but require B.2 whole reidentification and system admission.
Description as systemDashboard, simulation, model, twin, or bill is treated as the operating system.Use episteme, publication, source-use, and architecture-description owners for description objects.
Transformation as containmentAn external system changes a holon and is treated as its super-holon.Use A.12, A.3.4, A.15.1, B.2.5, and part-whole owners separately.

Cloud Platform

Independent services become a platform only if the current claim concerns a result system: a shared control plane, system-level SLO, deployment and rollback coordination, platform-level evidence, and external commitments.

If the only change is a better dashboard or one more service, use architecture-description, publication, measurement, or component owners. Use B.2.2 only when mhtResultSystemRef is the operating platform itself.

Production Cell

A machine, robot, fixture, workpiece carrier, and inspection station can become a production cell when the cell has its own delimitation, objective, coordination, transformation structure, work occurrence evidence, and capability envelope.

The fixture being manufactured is not part of the machine merely because the machine changes it. The production cell claim needs a result system; the manufacturing relation remains transformation and work.

Bias-Annotation

Bias riskFailureMitigation
Named aggregate as systemA fleet, platform, or cell name is treated as system admission.Require result-system delimitation, objective, coordination, capability, and evidence refs.
Component evidence transferComponent certificates are read as result-system assurance.Re-base assurance and evidence for mhtResultSystemRef.
Coordination as wholeA controller, protocol, or coordination relation is treated as automatic system MHT.Keep supervision evidence visible, but require B.2 whole reidentification and system admission.
Description as systemDashboard, simulation, model, twin, or bill is treated as the operating system.Use episteme, publication, source-use, and architecture-description owners for description objects.
Transformation as containmentAn external system changes a holon and is treated as its super-holon.Use A.12, A.3.4, A.15.1, B.2.5, and part-whole owners separately.

Conformance Checklist

CheckRequirement
CC-B2.2-1B.2 has already left a whole-reidentification question before B.2.2 is used.
CC-B2.2-2The result kind is admitted as U.System and recorded as mhtResultSystemRef.
CC-B2.2-3SystemMHTSlice@Context does not act; it carries refs to direct owners.
CC-B2.2-4Result-system delimitation and crossing relations are named without creating U.Boundary or U.Interaction.
CC-B2.2-5Supervision or coordination evidence is not treated as automatic system admission or safety evidence.
CC-B2.2-6Acting-system participation, transformation, and work are separated from parthood.
CC-B2.2-7Component assurance is not silently transferred to the result system.
CC-B2.2-8Descriptions, dashboards, simulations, and digital twins remain epistemes or publications unless the operating system itself is the EoC.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Named aggregate as system"The platform" or "the fleet" is treated as a system because it has a name.Recover SystemMHTSlice@Context; require result-system delimitation, objective, coordination, capability, and evidence refs.
Component certificate transferIndividual part certificates are used as result-system assurance.Re-base assurance through B.2.2:4.5 and evidence owners.
Controller as super-holonA controller or external system is treated as the new whole because it changes the parts.Use A.12, A.3.4, B.2.5, and part-whole owners separately.
Dashboard as systemA monitoring model is treated as the operating system.Use episteme, publication, source-use, C.30.AD, or digital-twin description owners.
Capability jump as system MHTA metric improves and the result is called a new system.Use ExistingWholeExplanationCheck@Context; return to capability, characteristic, method, work, or architecture owners if sufficient.

Consequences

Positive consequences:

  • Meta-system transition remains usable for engineering and organizational systems without making B.2 system-only.
  • System ontic preservation becomes explicit: system slots are re-based rather than replaced by generic whole language.
  • Assurance, responsibility, architecture, work, and evidence claims are kept with their direct owners.

Costs:

  • A system-result MHT cannot be declared by name, diagram, dashboard, or metric jump alone.
  • Teams must separate old component evidence from result-system evidence.
  • Some apparent emergence claims return to ordinary system aggregation, capability, measurement, or architecture repair.

Rationale

Valentin Turchin's meta-system transition remains a useful intuition for the system case: components can become a higher operating whole when coordination and control create a new object of management and assurance. FPF generalizes that intuition in B.2, then uses B.2.2 to keep the classical system case precise.

The key distinction is ontological, not lexical. A result system is not a trigger profile, coordination mechanism, graph, description, dashboard, or process label. It is an admitted U.System whose system participation slots must be available and, where changed, re-declared.

SoTA-Echoing

Source familyLesson for B.2.2FPF decision
Meta-system transition and holonic systems lineageA new coordinated whole can become the relevant operating object.B.2 owns whole reidentification; B.2.2 specializes it for mhtResultSystemRef.
Systems-of-systems and cyber-physical systems practiceOperational closure, coordination, external commitments, and assurance often change at the result-system level.B.2.2 requires result-system slot re-basing rather than component evidence transfer.
Constructional and part-whole ontologyActing on an object and being part of it are different relations.A.12, A.3.4, A.15.1, A.14, and C.13 remain separate owners.
Digital-twin and architecture-description practiceRich descriptions can track a system without being the system.Dashboards, models, twins, and publications use episteme and description owners unless the operating system is recovered as EoC.

Relations

  • Specializes: B.2 for MHT-result holons admitted as U.System.
  • Builds on: A.1, B.1.2, A.14, and C.13 for holon and system delimitation and part-whole grounding.
  • Coordinates with: A.12, A.3.4, A.15, A.15.1, A.2.1, A.2.2, C.16, A.6.F, C.30, A.22, C.30.ASV, C.30.TFS-REL, A.10, B.3, and B.3.5.
  • Uses: B.2.5 when supervisor-subholon feedback relation is part of the system-result evidence.
  • Contrasts with: B.2.3 for MHT-result holons admitted as U.Episteme and B.2.4 for capability and functioning whole-reidentification evidence.

B.2.2:End

Meta-Holon Transition With Episteme Result

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a Meta-Holon Transition result is admitted as U.Episteme: a theory, model family, standard, doctrine, specification body, research programme, field-level knowledge body, or other claim-bearing non-agentive holon.

Use B.2 first to decide whether whole reidentification is current. Use B.2.3 only when the result-kind question points to mhtResultEpistemeRef.

First useful move. Recover the episteme result as a U.Episteme holon with its C.2.1 slot relation: EntityOfConcern, grounding holon, claim graph, reference scheme, viewpoint, view, and publication or source-use relations when current.

What goes wrong if missed. A catalogue, literature review, dashboard, model repository, or vocabulary is called a new theory without claim-graph reidentification; or a real new episteme whole is treated as a pile of publications.

What this buys. The pattern preserves B.2 whole reidentification while keeping episteme ontology with C.2.1 and the episteme family. It prevents episteme-result MHT from becoming episteme agency, publication authority, generic emergence, or a second episteme ontology.

Not this pattern when.

  • If the result whole is an acting physical or operational holon, use B.2.2.
  • If the question is episteme slot relation, publication, source use, view, viewpoint, claim graph, reference scheme, or description use without MHT, use C.2.1, C.2.P, C.2.P.DR, E.17, and the episteme family directly.
  • If the question is effect-free episteme morphing, viewing, retargeting, or controlled semantic coarsening, use A.6.2, A.6.3, A.6.4, or A.6.3.CSC.
  • If the question is synthesis work, use A.15.1 for performed work and A.12 or A.3.4 for acting-side and transformation claims.
  • If the wording is ambiguous emergence-family language, use B.2.P before selecting B.2.3.

Problem Frame

A library is not a theory, and a theory is not its publication.

A group of papers, models, datasets, design notes, forecasts, standards, or local doctrines may remain a collection. It becomes an MHT-result episteme only when the current claim needs one reidentified claim-bearing holon whose C.2.1 slot relation can be filled and governed as one episteme.

B.2.3 does not introduce a special episteme ontology. It uses mhtResultEpistemeRef in the B.2 record and then returns episteme structure to C.2.1.

Problem

Without this specialization:

  1. Catalogues become theories. Aggregated publications or dashboards are treated as a new episteme because they are stored together.
  2. Theory becomes publication. The paper, report, standard document, model card, or dashboard is used as the episteme itself.
  3. Episteme receives agency. The theory, standard, or doctrine is described as if it performs work or enforces behavior by itself.
  4. Morphing becomes MHT. A view, retargeting, coarsening, translation, or model transformation is treated as a new episteme whole.
  5. Assurance is inherited silently. Trust in constituent sources is treated as trust in the reidentified episteme whole.
  6. Generic emergence replaces claim structure. "Emergent theory" hides the actual claim graph, reference scheme, and grounding relation.

Forces

ForceTension
Synthesis vs aggregationA new episteme whole can integrate claims, but many collections remain indexes, reviews, or portfolios.
Episteme identity vs publication formThe episteme may be published in many forms; no publication form is the episteme by appearance.
Claim organization vs agencyAn episteme can organize claims and guide use, but systems perform work with or on it.
Constituent evidence vs result assuranceEvidence for parts may bear on the result, but the result episteme needs its own claim and assurance relations.
Source mnemonic vs current ontologyShort labels can aid recognition while hiding whether the current object is B.2, C.2.1, A.6, E.17, or source-use.

Solution

Use B.2.3 as the episteme-result specialization of B.2.

Episteme-Result MHT Slice

When mhtResultEpistemeRef is selected, use:

EpistemeResultMHTSlice@Context:
  existingWholeRef: U.Holon
  mhtResultEpistemeRef: U.Episteme
  boundedContextRef:
  selectedTriggerProfileRef: MHTTriggerProfile@Context
  existingWholeExplanationCheckRef: ExistingWholeExplanationCheck@Context
  epistemeKindAdmissionRef: C.2.1
  epistemeSlotRelationRef: U.EpistemeSlotRelation
  entityOfConcernSlotRef:
  groundingHolonSlotRef:
  claimGraphSlotRef:
  referenceSchemeSlotRef:
  viewpointSlotRef?
  viewSlotRef?
  publicationOrSourceUseRefs?
  constituentEpistemeRefs:
  synthesisWorkRefs?
  evidenceOrAssuranceRefs:
  mathematicalLensUseRefs?
  blockedOverreads:

This slice is not a U-kind and not a second episteme ontology. It is the B.2 record slice that says the MHT result is an episteme and names the C.2.1 relation that governs it.

Episteme Slot Re-Basing

For the result episteme, re-base at least these C.2.1 slots when current:

  • EntityOfConcernSlot: what the result episteme is about;
  • GroundingHolonSlot: where the result claim is grounded or tested;
  • ClaimGraphSlot: what the result episteme says as a claim structure;
  • ReferenceSchemeSlot: how claims are read as about their entities;
  • ViewpointSlot and ViewSlot: when the result episteme has viewpoint-governed views;
  • publication, source-use, and representation relations when the result episteme is published, cited, carried, or represented.

Do not infer these slots from the existence of a publication set. Fill them as episteme slots.

Episteme Trigger Interpretation

Interpret MHTTriggerProfile@Context for epistemes without giving agency to epistemes:

Trigger family in MHTTriggerProfile@ContextEpisteme-result readingDirect owner kept visible
Delimitation changeThe knowledge body now has a stable EntityOfConcern, scope, reference scheme, and claim scope.C.2.1, A.7, source-use owners
Objective or evaluation changeThe result episteme answers or evaluates a question that the collection did not answer as one claim-bearing whole.C.2.1, C.16, E.21 or relevant evaluation owner
Supervision or coordination changePrinciples, axioms, invariants, reference schemes, or claim-graph constraints organize how constituent claims are interpreted.C.2.1, A.6.0, A.6.1, C.29 when formal lens is current
Capability or closure evidenceThe result episteme enables a new explanatory, predictive, specification, or coordination use.C.2.1, C.16, A.10, use-specific owner
Agency thresholdUsually not applicable to the episteme itself; if agency is claimed, recover the acting system in role.A.12, A.2.1, A.13, A.19, C.16
Temporal consolidationA field, standard, or theory becomes one current knowledge body after phase consolidation or source-currentness change.C.27, E.17, source-use owners
Context reframeNew terms, reference schemes, or EntityOfConcern mapping reframe the knowledge body.C.2.1, A.6.3, A.6.4, F.18

B.2.3 uses these rows as evidence to inspect. B.2 decides whether whole reidentification is admitted.

Blocked Readings

Do not use B.2.3 as:

  • a name for generic emergence;
  • an authority claim for a publication;
  • an agentive claim about a theory, standard, or doctrine;
  • an effect-free episteme morphism, view, retargeting, or coarsening;
  • a second episteme ontic beside C.2.1;
  • a shortcut from source synthesis to high trust;
  • a replacement for source-use, evidence, assurance, or publication patterns.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Library as theoryA repository, dashboard, or reading list is treated as one claim-bearing episteme.Fill C.2.1 slots and use B.2.3 only when whole reidentification remains current.
Publication as epistemeA PDF, report, standard document, model card, or dashboard is treated as the episteme itself.Keep publication forms with E.17 and source-use owners.
Episteme agencyA theory, standard, or doctrine is described as performing work or enforcement.Recover acting systems, role assignments, methods, work, and evidence separately.
Morphing as MHTView, translation, coarsening, or retargeting is called a new episteme whole.Use A.6 episteme-morphism owners unless B.2 whole reidentification remains current.
Source trust transferTrust in constituent sources becomes assurance for the result episteme.Rebuild assurance and source-use relations for the result episteme.

Model Family Becomes Theory

A model family can remain a toolbox. It becomes an episteme-result MHT only if the result has a unified claim graph, reference scheme, grounding holons, and admissible explanatory or predictive use that the collection did not carry as one whole.

If the change is only a new model publication or benchmark score, use publication, source-use, measurement, evidence, and mathematical-lens owners instead.

Standard Body

A set of clauses, examples, and annexes can become a standard episteme when the result is one claim-bearing whole with terms, references, scope, conformance claims, and publication forms.

The standard is not the committee, not the PDF, and not the work of enforcement. The committee is an acting system or role-bearing system; the PDF is a publication form; enforcement is work by systems in role.

Bias-Annotation

Bias riskFailureMitigation
Library as theoryA repository, dashboard, or reading list is treated as one claim-bearing episteme.Fill C.2.1 slots and use B.2.3 only when whole reidentification remains current.
Publication as epistemeA PDF, report, standard document, model card, or dashboard is treated as the episteme itself.Keep publication forms with E.17 and source-use owners.
Episteme agencyA theory, standard, or doctrine is described as performing work or enforcement.Recover acting systems, role assignments, methods, work, and evidence separately.
Morphing as MHTView, translation, coarsening, or retargeting is called a new episteme whole.Use A.6 episteme-morphism owners unless B.2 whole reidentification remains current.
Source trust transferTrust in constituent sources becomes assurance for the result episteme.Rebuild assurance and source-use relations for the result episteme.

Conformance Checklist

CheckRequirement
CC-B2.3-1B.2 has left a whole-reidentification question before B.2.3 is used.
CC-B2.3-2The result kind is admitted as U.Episteme and recorded as mhtResultEpistemeRef.
CC-B2.3-3EpistemeResultMHTSlice@Context names U.EpistemeSlotRelation and does not create a second episteme ontic.
CC-B2.3-4Publication, source-use, view, viewpoint, claim-bearing, and representation questions return to C.2.1, E.17, C.2.P, C.2.P.DR, and direct episteme-family owners.
CC-B2.3-5The episteme is non-agentive; acting systems, synthesis work, and enforcement work use A.12, A.2, A.15, A.15.1, or work owners.
CC-B2.3-6Assurance for the result episteme is not silently inherited from constituent epistemes or publications.
CC-B2.3-7Effect-free morphing, viewing, retargeting, and controlled coarsening are not treated as B.2.3 unless whole reidentification is current.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Library as theoryA repository or reading list is treated as one episteme.Fill C.2.1 slots; use B.2.3 only if one result episteme whole is recovered.
PDF as epistemeA publication form is used as the theory itself.Use E.17 and publication owners; keep mhtResultEpistemeRef for the episteme.
Doctrine receives agency"The standard enforces..." or "the theory decides..."Recover the acting system, role, method, work, evidence, or decision claim.
Morphism as MHTA view, translation, coarsening, or retargeting is called a new episteme whole.Use A.6.2, A.6.3, A.6.4, or A.6.3.CSC unless B.2 whole reidentification is current.
Synthesis as high trustA new theory inherits trust because its sources were reliable.Rebuild assurance for the result episteme through A.10, B.3, B.3.5, C.2.1, and source-use owners.

Consequences

Positive consequences:

  • Episteme-result MHT becomes usable without preserving title mnemonics as ontology.
  • C.2.1 remains the episteme ontic owner.
  • Publications, source use, synthesis work, evidence, assurance, and acting systems remain separate.

Costs:

  • A claimed synthesis must fill episteme slots, not only cite a portfolio.
  • Result-episteme assurance requires fresh relation work.
  • Some "new theory" claims return to publication, source-use, morphism, benchmark, or evidence owners.

Rationale

Knowledge synthesis can create a new holon, but only when the result is a reidentified claim-bearing episteme. B.2.3 keeps that useful case and removes the drift toward episteme agency, publication authority, generic emergence, and duplicate episteme ontology.

This pattern is deliberately thin. B.2 owns whole reidentification; C.2.1 owns episteme slot relation; E.17 and source-use patterns own publications; A.6 episteme-morphism patterns own morphing and retargeting; A.15 and A.12 own synthesis work and acting systems.

SoTA-Echoing

Source familyLesson for B.2.3FPF decision
Evidence synthesis and living-review practiceSynthesis claims need explicit scope, evidence relation, currentness, and maintenance rather than narrative authority.B.2.3 requires result-episteme slots, assurance relations, and source-use relations.
Knowledge-graph and claim-network practiceA knowledge body can be represented as related claims, evidence, and sources.ClaimGraphSlot remains C.2.1 material; graph representation does not declare MHT by itself.
Science-of-science and paradigm-change studiesFields and theories can consolidate into named bodies with new scope and organizing principles.B.2.3 treats consolidation as possible evidence for episteme-result MHT, not as automatic admission.
Publication and standards practiceStandards, reports, models, and dashboards are carriers and publication forms.E.17 and source-use owners remain separate from the episteme whole.

Relations

  • Specializes: B.2 for MHT-result holons admitted as U.Episteme.
  • Builds on: C.2.1 for U.EpistemeSlotRelation, A.1 for holon admission, and E.24.UK for result-kind admission discipline.
  • Coordinates with: C.2.P, C.2.P.DR, E.17, E.17.*, A.6.2, A.6.3, A.6.4, A.6.3.CSC, A.10, B.3, B.3.5, C.29, F.18, and F.19.
  • Uses: B.2.P when source wording such as emergence-family or title-mnemonic wording hides the claim kind.
  • Contrasts with: B.2.2 for system-result MHT and B.2.4 for capability and functioning whole-reidentification evidence.

B.2.3:End

Capability and Functioning Whole Reidentification

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when capability-envelope evidence, functioning-relation evidence, or transformation-flow-structure evidence creates or reveals a B.2 whole-reidentification question.

The first useful question is:

Does this capability or functioning evidence show that the existing whole
is no longer the right EntityOfConcern, or is this only a direct capability,
functioning, transformation, method, work, module, characteristic, or
architecture claim?

Use [B.2.4](/generated/patterns/B.2.4) only for the first case. Use direct owners for the second.

What goes wrong if missed. A genuine new whole is hidden under ordinary capability improvement; or every impressive capability, function, method chain, module allocation, or metric gain is overclaimed as emergence.

What this buys. The pattern keeps capability and functioning evidence available for B.2 while preventing B.2.4 from becoming a generic capability, function, method, work, module, or emergence pattern.

Not this pattern when.

  • If the claim is ordinary capability, use [A.2.2](/generated/patterns/A.2.2) and [C.16](/generated/patterns/C.16).
  • If the claim is function-like wording or functioning relation without whole reidentification, use [A.6.F](/generated/patterns/A.6.F).
  • If the claim is transformation or transformation-flow structure, use [A.3.4](/generated/patterns/A.3.4), [E.18](/generated/patterns/E.18), and C.30.TFS-REL.
  • If the claim is method, method relation, method description, work plan, or work occurrence, use [A.15](/generated/patterns/A.15), [A.3.1](/generated/patterns/A.3.1), [A.3.2](/generated/patterns/A.3.2), [A.15.2](/generated/patterns/A.15.2), and [A.15.1](/generated/patterns/A.15.1).
  • If the claim is module allocation or bearer allocation, use [A.6.M](/generated/patterns/A.6.M) and architecture owners.
  • If the claim is measurement, threshold, score, robustness, quality, or whole-level characteristic, use [C.16](/generated/patterns/C.16), [A.19](/generated/patterns/A.19), and evidence owners.
  • If the wording is ambiguous emergence, synergy, or title-mnemonic language, use [B.2.P](/generated/patterns/B.2.P) before selecting B.2.4.

Problem Frame

A new capability is not automatically a new whole. A function-like relation is not automatically a part-whole relation. A transformation-flow structure is not automatically MHT.

B.2.4 is the narrow B.2 specialization for cases where capability, functioning, or transformation-flow evidence makes the existing whole explanation fail and points to a reidentified holon. It is not a pattern for all capabilities or all functions.

Problem

Without this specialization:

  1. Capability becomes generic emergence. A threshold crossing or new envelope is treated as a new whole without B.2 checks.
  2. Function becomes ontology. Function-like wording creates U.Function or a hidden peer kind.
  3. Method and work collapse. The way of doing, description of doing, planned work, and performed work are compressed into one vague operational claim.
  4. Module allocation becomes functional truth. A module label is treated as evidence for the required behavior or selected structure.
  5. Transformation-flow description replaces in-life structure. A graph, diagram, or publication of a flow is treated as the flow structure or whole.
  6. Whole reidentification is missed. A real result whole is left as "just a better capability".

Forces

ForceTension
Capability evidence vs whole identityCapability evidence can reveal a new whole, but most capability claims stay with A.2.2 and C.16.
Functioning relation vs part-whole relationFunctioning often crosses parts and bearers; it is not parthood by wording.
Transformation-flow structure vs mathematical descriptionFlow structure may enter architecture claims; graphs and diagrams remain lenses or publications unless selected as objects.
Method composition vs performed workA method relation can describe possible doing, while work occurrence evidence concerns dated performance.
New whole vs local improvementThe pattern must preserve real novelty without turning every improvement into MHT.

Solution

Use B.2.4 as a decision bridge from capability and functioning evidence to B.2 whole reidentification.

Capability-Functioning Whole-Reidentification Slice

Use this slice only when B.2 remains current after direct-owner explanations are checked.

CapabilityFunctioningWholeReidentificationSlice@Context:
  existingWholeRef: U.Holon
  boundedContextRef:
  capabilityEnvelopeRef?
  functioningRelationRef?
  transformationFlowStructureRef?
  functionalStructureViewRef?
  candidateBearerRefs?
  methodRelationRefs?
  methodDescriptionRefs?
  workPlanRefs?
  workOccurrenceRefs?
  moduleAllocationRefs?
  characteristicOrThresholdRefs?
  evidenceOrMeasurementRefs:
  existingWholeExplanationCheckRef: ExistingWholeExplanationCheck@Context
  candidateB2RecordRef:
  blockedDirectOwnerOverreads:

This slice is not a U-kind and not a capability object. It carries the evidence needed to decide whether B.2 whole reidentification is current.

Direct-Owner Test

Before using B.2.4 for whole reidentification, test whether a direct owner explains the evidence:

Evidence under concernDirect owner if sufficientB.2.4 becomes current only when
Capability envelopeA.2.2, C.16, A.10the envelope belongs to a result whole that cannot be explained by the existing whole
Function or functioning relationA.6.F, A.3.4, C.16the relation creates or reveals a new whole-level EntityOfConcern
Transformation-flow structureC.30.TFS-REL, E.18, A.3.4, C.29 when mathematical lens is currentthe flow structure changes the identity of the whole under B.2
Method relation or method familyA.15, A.3.1, G.5, C.29 when lens is currentmethod evidence changes the whole, not merely the way of doing
Method description or procedure textA.3.2 and C.2.1; use publication-use or source-use owners when publication or source reliance is currentdescription is not enough; in-life whole reidentification must be recovered
Work plan or work occurrenceA.15.2, A.15.1performed or planned work is evidence for a result whole, not the whole by label
Module, component, or bearer allocationA.6.M, C.30, A.22, C.30.ASVallocation evidence changes the whole under concern
Metric, score, threshold, robustness, qualityC.16, A.19, A.10the characteristic shift defeats existing-whole explanation

Existing-Whole Explanation

Use ExistingWholeExplanationCheck@Context before claiming whole reidentification.

Direct-owner explanations that often stop B.2.4:

  • better measurement or benchmark normalization;
  • improved component capability;
  • corrected function-like wording;
  • a clearer method relation or method family selection;
  • a new method description without performed capability evidence;
  • better work coordination inside the same whole;
  • module allocation repair;
  • architecture-view or transformation-flow-structure repair;
  • evidence or source-currentness improvement.

If one of these explanations is sufficient, do not use B.2.4. Use the direct owner.

When B.2.4 Returns To B.2

Return to B.2 when the evidence shows that the current object must be reidentified as a result holon. Examples:

  • a production cell now has a capability envelope, coordination relation, transformation-flow structure, and assurance claim that cannot be explained by individual machines;
  • a service platform now has a functioning relation and external commitments that cannot be assigned to one service or module;
  • a team, toolchain, and method family now operate as one result system with new capability and work evidence;
  • an episteme or standard now has a capability for explanation, prediction, or specification use that requires result-episteme reidentification.

After the return, B.2 owns the MHT record and result-kind admission. B.2.4 carries only the capability and functioning evidence slice.

Archetypal Grounding (Worked Cases)

Bias-Annotation

Bias riskFailureMitigation
Capability as emergenceA new capability label declares a new whole.Test direct capability, characteristic, evidence, and existing-whole explanations first.
Function as partA function block or functioning relation becomes physical or organizational parthood.Separate functioning relation, bearer allocation, selected structure, and part-whole claims.
Method chain as wholeA sequence of methods or work stages is called a new holon.Keep method, method description, work plan, and work occurrence with direct owners.
Diagram as flow structureA diagram or graph is treated as the in-life transformation-flow structure.Use mathematical, description, publication, and selected-structure owners before B.2.
Metric jump as MHTA benchmark, KPI, robustness, or threshold gain declares whole reidentification.Use C.16, A.19, A.10, and B.2 existing-whole explanation before MHT.

CI/CD Capability

A team may have methods for coding, testing, and releasing. That does not by itself create a new whole. Use method and work owners for the method relations and performed release work.

B.2.4 becomes current only if the capability evidence points to a result holon: a platform, team-system, or work occurrence whole with new delimitation, coordination, external commitments, evidence, and assurance. An automated delivery sequence label does not decide the ontology.

Theory Explains New Phenomena

A new theory may explain phenomena that the source portfolio did not explain. B.2.4 can carry the explanatory-capability evidence, but B.2.3 owns the episteme-result MHT if the result is U.Episteme; C.2.1 owns the episteme slot relation; C.29 owns mathematical-lens use when the lens is relied on for the current claim.

Bias-Annotation

Bias riskFailureMitigation
Capability as emergenceA new capability label declares a new whole.Test direct capability, characteristic, evidence, and existing-whole explanations first.
Function as partA function block or functioning relation becomes physical or organizational parthood.Separate functioning relation, bearer allocation, selected structure, and part-whole claims.
Method chain as wholeA sequence of methods or work stages is called a new holon.Keep method, method description, work plan, and work occurrence with direct owners.
Diagram as flow structureA diagram or graph is treated as the in-life transformation-flow structure.Use mathematical, description, publication, and selected-structure owners before B.2.
Metric jump as MHTA benchmark, KPI, robustness, or threshold gain declares whole reidentification.Use C.16, A.19, A.10, and B.2 existing-whole explanation before MHT.

Conformance Checklist

CheckRequirement
CC-B2.4-1B.2.4 is used only when capability, functioning, or transformation-flow evidence creates or reveals a B.2 whole-reidentification question.
CC-B2.4-2Ordinary capability, function, functioning, transformation, method, work, module, characteristic, evidence, and architecture claims return to direct owners.
CC-B2.4-3No generic U.Emergence, U.Function, U.MetaMethod, or capability-root kind is created.
CC-B2.4-4Method, method description, work plan, and work occurrence remain separate.
CC-B2.4-5Mathematical or publication descriptions of transformation-flow structure do not replace the in-life structure.
CC-B2.4-6If B.2 remains current, B.2 owns the MHT record and result-kind admission.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Capability by declarationA leader names a new capability, but evidence remains component-level.Use A.2.2, C.16, and A.10; use B.2.4 only if the existing whole explanation fails.
Function as partA function block is treated as a physical or organizational part.Use A.6.F, C.30.TFS-REL, A.6.M, and architecture allocation owners.
Method chain as wholeA sequence of methods is called a new holon.Recover method relation and work occurrence; return to B.2 only when a result holon is current.
Diagram as flow structureA diagram or graph is treated as the transformation-flow structure itself.Use C.29, E.17, C.30.AD, or publication owners unless the selected structure is recovered.
Metric jump as wholeA KPI improves and MHT is declared.Use C.16, A.10, and existing-whole explanation first.

Consequences

Positive consequences:

  • Capability and functioning evidence can bear on real whole reidentification without becoming a generic emergence owner.
  • Direct owners remain visible, so local improvements are not overclaimed.
  • Method, work, function, module, and architecture distinctions survive high-pressure capability language; each claim remains with its governing pattern.

Costs:

  • Teams must do the direct-owner test before using B.2.4.
  • Many impressive capability claims will stay outside MHT.
  • B.2.4 depends on B.2 for the final whole-reidentification record.

Rationale

Capabilities and functioning relations are often where new wholes first become visible. But the evidence is mixed: it may belong to capability measurement, function-like wording, architecture structure, transformation flow, method relation, work occurrence, module allocation, or whole reidentification.

B.2.4 exists to keep that mixed evidence disciplined. It does not rename all of it as "meta-function". It asks whether the evidence defeats the existing whole explanation and, only then, returns to B.2.

SoTA-Echoing

Source linePractical implication for this pattern
Capability and functioning approachesA capability envelope is evidence about what a holon can do under conditions; it is not automatically a new whole.
Functional architecture and transformation-flow practiceFunctioning and flow structures can expose a result whole, but descriptions and diagrams remain distinct from selected in-life structures.
Method and work ontology in FPFMethod, method description, work plan, and performed work occurrence must stay separate when capability evidence is interpreted.
TAME and agency-as-characteristic-space workAgency-like evidence is multi-characteristic and thresholded by concern; B.2.4 does not create a binary agency kind.

Relations

  • Specializes: B.2 for cases where capability, functioning, or transformation-flow evidence creates or reveals whole reidentification.
  • Uses: B.2.P when emergence-family or title-mnemonic wording hides the claim kind.
  • Coordinates with: A.2.2, C.16, A.6.F, A.3.4, E.18, C.30.TFS-REL, A.15, A.3.1, A.3.2, A.15.2, A.15.1, A.6.M, C.30, A.22, C.30.ASV, C.29, A.10, and source-use patterns.
  • Contrasts with: B.2.2 for system-result MHT and B.2.3 for episteme-result MHT.

B.2.4:End

Supervisor-Subholon Feedback Relation

Type: Part B holonic construction pattern Status: Stable Normativity: Normative unless a section is explicitly informative

Use This When

Use this pattern when a holon is supervised, regulated, steered, corrected, constrained, or coordinated through a two-sided feedback relation between a supervisor role and one or more supervised holons.

The first useful move is to recover the relation:

Which holons are supervised?
Which acting system holds the supervisor role in this bounded context?
What observation, report, signal, publication, or source relation carries state?
What influence, constraint, objective, mode, or work change returns?
Which transformation, work, architecture, evidence, assurance, timing,
or causal claim is being made in addition to the relation?

What goes wrong if missed. A control diagram, policy note, dashboard, publication channel, or supervisor word starts carrying part-whole, agency, safety, assurance, timing, gate, or architecture claims that belong elsewhere.

What this buys. B.2.5 gives a small relation record: supervised holons, supervisor role, acting system, medium or publication relation, observation or report side, influence or constraint side, and direct owners for stronger claims.

Not this pattern when.

  • If the question is a control-structure view, use [C.30.LCA](/generated/patterns/C.30.LCA).
  • If the question is architecture or selected structure, use [C.30](/generated/patterns/C.30), [A.22](/generated/patterns/A.22), and [C.30.ASV](/generated/patterns/C.30.ASV).
  • If the question is reusable dynamics, timing, rate, or temporal validity, use [A.3.3](/generated/patterns/A.3.3) and [C.27](/generated/patterns/C.27).
  • If the question is causal use, use [C.28](/generated/patterns/C.28).
  • If the question is evidence, assurance, gate, or constraint validity, use [A.10](/generated/patterns/A.10), [G.6](/generated/patterns/G.6), [B.3](/generated/patterns/B.3), [A.20](/generated/patterns/A.20), or [A.21](/generated/patterns/A.21).
  • If the question is module allocation or interface commitment, use [A.6.M](/generated/patterns/A.6.M).
  • If the question is whole reidentification, use [B.2](/generated/patterns/B.2).

Problem Frame

Supervisor-subholon feedback is a relation among holons, roles, acting systems, observed or published state, and returned influence or constraint. It is not automatically parthood, not automatically a control-structure view, not automatically evidence, and not automatically a mathematical loop object.

B.2.5 governs the relation-level claim. It can sit inside a broader architecture description, control-structure view, MHT claim, work claim, or evidence claim, but those claims keep their direct owners.

Problem

Without this pattern, three different structures collapse:

  1. Part-whole structure. Which holons are parts of which wholes.
  2. Supervisor-subholon feedback relation. Which acting system holds the supervisor role, what it observes, and what influence or constraint returns.
  3. Description or representation structure. Which diagram, dashboard, report, model, publication, or control-view description represents the relation.

When these are confused, a functional layer is treated as a physical part, a publication is treated as an acting system, a diagram is treated as evidence, or a supervisor label is treated as a gate or assurance result.

Forces

ForceTension
Recognizable feedback language vs kind precisionEngineers use feedback, control, supervision, and regulation language naturally; FPF needs the relation and neighboring claim kinds named.
Relation vs viewA supervisor-subholon relation may appear inside a control-structure view, but the view and relation are different objects.
Acting system vs epistemeA theory, model, standard, dashboard, or report may be revised or used, but it does not act by itself.
Closure vs stronger claimsA two-sided feedback relation can supply input to stability or assurance work, but does not certify those claims.
Medium visibility vs perfect communicationThe relation needs observation or report and influence or constraint sides, including publication or medium limits when current.

Solution

Model the current object as SupervisorSubholonFeedbackRelation@Context.

SupervisorSubholonFeedbackRelation@Context:
  supervisedHolonRefs: FinSet(U.HolonRef)
  boundedContextRef:
  supervisorRoleRef:
  supervisingActingSystemRef:
  supervisedWorkOrTransformationRefs?
  observationOrReportRefs: FinSet(ObservationRef | ReportRef | PublicationUnitRef | SourceUseRef)
  influenceOrConstraintRefs: FinSet(InfluenceSignalRef | ConstraintRef | ObjectiveRef | ModeRef)
  sharedMediumOrPublicationRefs?
  holonBoundaryCrossingRelationRefs?
  feedbackClosureCondition:
  admissibleUse:
  nonAdmissibleUse:
  neighboringClaimOwnerRefs?

This relation is not a U-kind and not a mathematical loop lens. It is a relation record for the current bounded context.

Two-Sided Feedback Relation

A one-way command, publication, or report relation is not yet a supervisor-subholon feedback relation. Name both:

  • the observation, report, signal, source, or publication side; and
  • the returned influence, constraint, objective, mode, or work-change side.

If only one side is current, record a one-sided relation and use the direct owner for that claim.

Part-Whole Boundary

A supervised holon may be part of a larger holon, but supervision and parthood are different relations. An acting controller system, committee system, platform-governance system, review board, or tool-mediated group can hold the supervisor role without being a physical part of the supervised holon. A method, policy, or review practice can structure the supervision work; it does not supervise by itself.

Use A.1, B.1, A.14, and C.13 for parthood. Use B.2.5 only for the supervisor-subholon feedback relation.

Acting-System Boundary

The supervisor role is held by an acting system in a bounded context. Do not create U.TransformerRef or treat a publication, theory, dashboard, model, method description, or report as the acting system.

For acting-side externalization, use A.12. For transformation, use A.3.4. For work, use A.15.1. For role assignment, use A.2.1.

Control-Structure View Boundary

When the relation is drawn as planner, controller, observer, plant, and supervisor structure, B.2.5 names the relation, while C.30.LCA owns the control-structure view. A diagram or view does not establish the relation by appearance; recover the in-life relation and the description relation separately.

Neighboring Claim Boundary

B.2.5 does not certify stability, safety, assurance, evidence sufficiency, causal validity, gate passage, rate adequacy, or mathematical adequacy.

Use:

  • A.3.3 for reusable dynamics or state-evolution claims;
  • C.27 for temporal and rate adequacy;
  • C.28 for causal-use claims;
  • A.10 and G.6 for evidence and provenance;
  • B.3 for assurance;
  • A.20 and A.21 for constraint validity and gate decisions;
  • C.29 for mathematical-lens use.

Archetypal Grounding (Worked Cases)

Robotic Swarm

A fleet controller supervises drones. B.2.5 records each drone as a supervised holon, the controller system holding the supervisor role, telemetry as observation side, and waypoint or mode commands as influence side.

Claims about convergence, delay tolerance, disturbance damping, evidence, assurance, or safety use their direct owners. The feedback relation does not certify them.

Scientific Theory Revision

A theory is revised when labs publish findings and a research community reviews anomalies and accepted revisions.

B.2.5 may record the theory or constituent epistemes as supervised objects only when the current claim is about a feedback relation around review and revision. The acting system is the research community, standards body, lab, review board, or tool-mediated group in role. The theory does not sense, judge, plan, decide, or act.

Publication channels, journals, datasets, reports, and review records remain publication or source-use objects.

Product Platform Policy

A product platform constrains component teams through interface rules and release gates. B.2.5 records the acting platform or governance system holding the supervisor role, component holons, report channels, and constraint returns.

Work authority uses A.15; gate passage uses A.21; interface commitments use A.6.M; architecture view uses C.30.LCA when the control structure is described.

Bias-Annotation

BiasHow B.2.5 prevents it
Supervisor-as-superholon biasThe supervisor relation is not a parthood claim; parthood stays with A.1, B.1, A.14, and C.13.
Feedback-as-proof biasA closed feedback relation may supply input to separate stability, safety, assurance, or timing work, but does not certify those claims.
Description-as-relation biasA diagram, dashboard, report, or control-view description does not establish the in-life feedback relation by itself.
Episteme-agency biasA theory, standard, model, dashboard, or publication may stand in a supervised slot or source-use slot, but the acting system in the supervisor role must still be named.

Conformance Checklist

CheckRequirement
CC-B2.5-1A conforming use names supervised holons, supervisor role, and the acting system holding that role.
CC-B2.5-2A conforming use names observation, report, or source side and influence, constraint, or objective side.
CC-B2.5-3SupervisorSubholonFeedbackRelation@Context is used instead of loop wording unless a separate math-lens owner selects a loop object.
CC-B2.5-4No U.TransformerRef or U.InteractionRef is created.
CC-B2.5-5Parthood, control-structure view, publication and source-use relation, and feedback relation are kept separate.
CC-B2.5-6Stability, safety, timing, causal, evidence, assurance, gate, and mathematical-lens claims return to their governing patterns.
CC-B2.5-7Episteme examples name the acting systems that perform review, revision, publication, or use.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Ghost coordinationSubholons coordinate, but no supervisor role, acting system, medium, or feedback relation is named.Fill SupervisorSubholonFeedbackRelation@Context.
Functional layer as componentA planning or control layer is modeled as a physical part of the controlled holon.Separate parthood from feedback relation; use C.30.LCA for the view.
Perfect communicationState access is assumed instant, complete, or lossless.Name medium or publication limits; use C.27, A.3.3, or evidence owners for timing and information claims.
Episteme actsA theory, model, paper, dashboard, or standard senses, judges, plans, or adapts.Name the acting system in role, the method or review practice structuring the work when current, the revision work, and any publication or source-use relation.
Relation certifies safetyThe feedback relation is treated as evidence, assurance, gate, or safety result.Keep the relation and apply the governing pattern for the stronger claim.

Consequences

Positive consequences:

  • Supervisor-subholon language stays useful without creating false acting objects or false part-whole claims.
  • Control diagrams, publication channels, and feedback relations can be coordinated without being collapsed.
  • Stability, safety, assurance, gate, timing, and evidence claims stay inspectable.

Costs:

  • A feedback relation record is only the beginning of stronger analysis.
  • Some control diagrams become less impressive because their unproven claims are separated.
  • Episteme examples require explicit acting systems for review and revision.

Rationale

Supervisor-subholon feedback is a recurring relation in control, organization, architecture, and epistemic revision. It becomes precise only when separated from part-whole composition, control-structure views, publication and source-use relations, and stronger assurance claims.

The selected name is SupervisorSubholonFeedbackRelation@Context because the governed object is a relation. A mathematical loop, if needed, is a lens or structure selected by another pattern; it is not selected by the name of this relation.

SoTA-Echoing

Source familyLesson for B.2.5FPF decision
Layered and multi-rate control practiceSupervisor, plant, controller, observer, rate, and feedback language are useful recognition cues.B.2.5 recovers the relation; C.30.LCA, A.3.3, C.27, and C.29 own view, dynamics, timing, and mathematical claims.
Cyber-physical systems practiceMedium limits, observation channels, actuation, delay, disturbance, and plant dynamics affect adequacy.The relation names medium and returned influence; adequacy claims use direct owners.
Organizational policy and review practiceSupervision may be enacted through policies, reviews, reports, publication channels, and role assignments.The acting system in role is named; publications and reports remain source-use or publication objects.
Episteme and publication disciplineKnowledge-bearing objects can be reviewed, revised, cited, and published, but they do not act.Episteme examples use acting systems for review and keep the episteme as reviewed or revised object.

Relations

  • Builds on: A.1, A.2.1, A.12, A.3.4, A.15.1, B.1, A.14, and C.13.
  • Coordinates with: B.2 when feedback evidence creates a whole-reidentification question.
  • Coordinates with: C.30.LCA for control-structure view, A.3.3 for dynamics, C.27 for temporal and rate adequacy, C.28 for causal use, A.10 and G.6 for evidence, B.3 for assurance, A.20 and A.21 for constraint validity and gate decisions, A.6.M for module-interface relation, and C.29 for mathematical-lens use.
  • Uses: B.2.P when feedback, supervision, emergence, or MHT wording hides the claim kind.

B.2.5:End

Trust and Assurance Calculus (F-G-R with Congruence)

Type: Foundational (B) Status: Stable Normativity: Normative for FPF use that claims assurance, trust, readiness, compliance, safety, release confidence, F, G, R, or CL for a named claim.

Plain-English headline. B.3 defines how assurance or trust is assigned, aggregated, and reused for physical systems, epistemes, and publication or evidence records that are used to claim assurance. It uses one typed assurance tuple, F-G-R: F and R as characteristics, G as the scope value, plus edge-scoped CL; the aggregation rules stay conservative, respect the current composition, transformation, temporal, and work invariants named by their governing patterns, and keep the A.7 EntityOfConcern and description strict distinction. It treats the E.14 Working-Model layer as the publication-facing assertion layer for claims, with assurance inputs attached downward from Mapping, Logical, Constructive, and Empirical Validation layers.

Use this when. Use B.3 when a claim, label, dashboard, evidence bundle, model, report, gate decision, or assurance-input package is being used to raise assurance, trust, readiness, compliance, safety, release confidence, F, G, R, or CL for a named claim.

What goes wrong if missed. Labels, dashboards, model cards, credentials, provenance marks, gate decisions, or evidence bundles start raising trust or readiness without one typed assurance claim, named evidence, scope, limitations, decay, and relying context.

What this buys. Assurance becomes a conservative typed claim over F, G, R, and edge-scoped CL, with explicit evidence, scope, time, limitations, contestability, and stop or reopen conditions.

First output. Write one typed Assurance(H, C | K, S) claim per named assurance claim C, or write an explicit no-assurance-claim disposition when the encountered publication face, rendering, cue, evidence pointer, wording issue, gate decision, role assertion, status-value assertion, commitment, or work occurrence does not carry an assurance claim.

Not this pattern when. If the encountered source or publication face is only a cue, action invitation, boundary wording, evidence question, currentness question, gate decision, release decision, role assertion, status-value assertion, commitment, or work occurrence, use A.15, A.6, A.10, A.21, A.20, A.2.1, A.2.8, A.2.9, or A.15.1 as appropriate.

Assurance result selection. Use the lightest assurance result that can decide the assurance use being claimed. A cue or source pointer gets no B.3 tuple. A local, non-release, non-compliance, non-safety, non-reused claim may be written as a compact bounded assurance claim statement that names claim, assurance use carried by the assurance tuple or relying context, evidence pointer, limit, and stop or reopen condition. Reserve a full typed Assurance(H, C | K, S) claim for readiness, compliance, safety, release confidence, trust, F, G, R, CL, or reused assurance input.

Assurance claim over time. Treat an assurance claim as time-bounded and updateable: it can decay, reopen, narrow, or be withdrawn, not remain a one-time checklist result. For model, data, AI, documentation, release, or operational assurance, name the drift, monitoring, incident, evidence refresh, version change, policy change, gate change, or residual unsupported-use condition that reopens the assurance claim.

Problem frame

Every non‑trivial result in FPF—a composed system is safe, a model is credible, a conclusion holds—is a claim that rests on composed evidence.

  • For U.System holons, assurance is about capabilities and constraints under stated conditions.
  • For U.Episteme holons, assurance is about the quality of evidence relation for a statement or model.

To make such claims comparable and auditable across domains, B.3 introduces a Trust and Assurance Calculus that:

  • uses a small typed assurance tuple (F-G-R: F and R as characteristics plus G as scope value) governed by conservative propagation rules; this tuple is not a state space,
  • accounts for integration quality via Congruence Level (CL) along the edges of a DependencyGraph (B.1.1, A.14),
  • and composes these values only through current governing composition, transformation, temporal, and work operators while respecting their declared invariants.

B.3 is conceptual and normative: it defines which assurance components must be published and how they propagate. How those components improve (for example by formalizing, replicating, reconciling, or widening or narrowing scope under declared operation rules) is handled by KD-CAL improvement moves; those knowledge-dynamics references are descriptive, not required to read here.

Mechanism linkage. For law-governed operation families (for example USM and UNM) authored as mechanisms, use A.6.1 — U.Mechanism to publish OperationAlgebra, LawSet, AdmissibilityConditions, and the Transport clause (Bridge-only; CL, CL^k, and CL^plane). All such penalties reduce R_eff only; F and G remain invariant.

Working-Model handshake (alignment with E.14, B.3.5, and C.13). Assurance consumes two inputs declared in the Working-Model assertion layer (CT2R-LOG, B.3.5): the justification declaration validationMode ∈ {postulate, inferential, axiomatic} and, where present, the grounding link tv:groundedBy. Structural claims that aspire to the strongest guarantees rely on Constructive grounding as a constructive-composition narrative referenced via tv:groundedBy. No assurance record or publication defines Working-Model wording or layout; dependence remains downward-only under E.14.

Problem

Without a disciplined calculus, four chronic failures appear:

  1. Trust inflation: Averaging or summing heterogeneous “quality” tags yields aggregates that look better than their weakest parts, violating WLNK.
  2. Scale confusion: Mixing ordinal and ratio scales (e.g., averaging F ordinal scale values with numeric reliabilities) produces meaningless numbers.
  3. Congruence blindness: Integration quality (how well pieces fit) is invisible; brilliantly strong parts connected by weak mappings produce overconfident wholes.
  4. Scope drift: Design-time formalism and run-time evidence are composed into a single score; dashboards then claim “assurance” for a blueprint using run-time data, or vice versa.

Forces

ForceTension
Conservatism vs. SynthesisAvoid overclaiming (WLNK) ↔ recognize real gains from better integration (raise CL) or true emergence (B.2).
Universality vs. Domain nuanceOne calculus for systems and epistemes ↔ physics and epistemology use different primitives; keep them comparable but not identical.
Simplicity vs. FidelityKeep the assurance tuple small and typed (A.11) ↔ capture enough structure to be informative and improvable by KD-CAL moves.
Static clarity vs. Dynamic evolutionA score must be reproducible today ↔ tomorrow it should legitimately rise after formalization, replication, or reconciliation.

Solution — Part 1: The assurance tuple and the universal aggregation skeleton

B.3 defines what the assurance components are, where they are assigned on nodes and edges of the dependency graph, and the shape of the aggregation that any Γ-flavour must honor when producing an assurance result.

The F-G-R assurance components (typed; F and R as CHR, G as USM)

We standardize two node characteristics, one node scope value, and one edge characteristic:

  1. Formality (F)how constrained the reasoning is by explicit, proof-grade structure.

    • Scale kind: ordinal (its scale values do not admit arithmetic).
    • Canonical scale values (example): F0 Informal prose - F1 Structured narrative - F2 Formalizable schema - F3 Proof-grade formalism.
    • Monotone direction: higher is better (never lowers assurance when all else fixed).
  2. ClaimScope (G)the declared set of U.ContextSlice values where the result applies.

    • Type: set-valued USM scope value (A.2.6), not a CHR characteristic.
    • Well-typed operations: membership and set algebra (, , , , SpanUnion, plus declared Bridge translation, widening, narrowing, or refit operation).
    • Scalar proxy (report-only): if a G scope report needs a number, it may publish an explicitly declared CoverageMetric(G); such a proxy must not replace G in norms, gates, bridge semantics, or CL-bearing relation decisions.
  3. Reliability (R)how likely the claim or behavior holds under stated conditions.

    • Scale kind: ratio in [0,1] (or a conservative ordinal proxy when numeric modeling is unavailable).
    • Monotone direction: higher is better.
  4. Congruence Level (CL)edge property: how well two parts fit (semantic alignment, calibration, interface standard).

    • Scale kind: ordinal with a monotone penalty function Φ(CL) where Φ decreases as CL increases.
    • Canonical scale values (example): CL0 tentative guess - CL1 plausible mapping - CL2 validated mapping - CL3 verified equivalence.
    • Interpretation: low CL reduces the credibility of the integration itself (not the parts), and therefore penalizes the aggregate R.

EntityOfConcern and description strict distinction (A.7).

  • Assurance components are recorded as value and scope claim components: F and R as characteristics, G as a scope value, while the governing composition, order, temporal, and work patterns keep structure, order, and time distinct.
  • Do not smuggle assurance components into structural edges; keep F, R, and CL explicit as CHR metadata and G explicit as a USM scope value.

Assurance shoulders (Working-Model split). Mapping raises TA (typing, fit, and CL). Logical and Constructive contribute to VA (intended relation semantics; constructive-composition identity for structure when the governing pattern admits it). Empirical Validation contributes to LA (evidence in a bounded context). These assurance inputs attach downward from the Working-Model assertion layer (E.14).

Assurance as a typed claim

B.3 speaks about assurance of a specific typed claim C over a holon H under context K and scope S ∈ {design, run}:

Assurance(H, C | K, S) = ⟨F_eff, G_eff, R_eff, Notes⟩
  • C examples: meets load L, argument Q holds, model M predicts within δ.
  • K binds assumptions (environment, usage, priors).
  • Notes include carrier/source-currentness records, evidence-provenance references (A.10), OrderSpec or TimeWindow where applicable, cutsets, and evidence citations.

This tuple gives practitioners an at-a-glance assurance result while preserving the pieces needed for audit and improvement.

Validation modes (declaration, normative). Each published Working-Model assertion declares validationMode ∈ {postulate, inferential, axiomatic} (E.14).

  • postulate -> pragmatic working claim; Empirical Validation is required for audit.
  • inferential -> reasoned consequence; Logical assurance carries the reasoning requirement.
  • axiomatic -> constructive identity; structural edges provide a constructive-composition narrative and a tv:groundedBy pointer (C.13, B.3.5).

Design versus run (no chimeras). Assurance tuples for design-time and run-time are reported separately and are not composed into a single score; see the Scope drift hazard in B.3:2 and the obligations in B.3:4.6.

Authority-looking labels and dashboard tiles

A badge, label, score, dashboard tile, credential display, provenance mark, compliance-looking mark, model card, datasheet, data card, assurance document, attestation label, assurance-looking note, or generated confidence phrase does not enter assurance calculus or improve F, G, R, CL, readiness, safety, compliance, trust, release confidence, or assurance by display alone.

Adversarial misuse guard. Do not let dashboards with favorable labels, compliance-looking badges, old model cards, provenance labels, assurance-looking documents, or generated confidence phrases supply missing evidence, limitations, scope, decay, or argument for an assurance claim.

B.3 dispositions for such a source or publication face are:

DispositionUse whenOutput
No assurance useThe encountered source or publication face is only a cue, source pointer, evidence question, currentness question, gate decision, role assertion, status-value assertion, commitment, boundary wording, or work occurrence.Use A.15, A.10, A.6, A.21, A.20, A.2.1, A.2.8, A.2.9, or A.15.1; no tuple is needed.
Compact bounded assurance claim statementThe claim is local, non-release, non-compliance, non-safety, not reused as assurance input, and does not affect a people or team status value.Record the claim, assurance use carried by the assurance tuple or relying context, evidence pointer, limit, and stop or reopen condition in the current work record.
Full assurance tupleThe source or publication face is being used to raise readiness, compliance, safety, release confidence, trust, F, G, R, or CL.One typed Assurance(H, C &#124; K, S) claim per named assurance claim C, with argument, evidence, limitations, and decay condition.
Rejected or narrowed assurance claimEvidence, scope, argument, currentness, or limitations do not carry the attempted assurance claim.State the assurance claim, work claim, or reliance claim that the current assurance tuple does not carry, then name the next legitimate formalization, evidence repair, scope narrowing, or claim narrowing move.

Build a B.3 assurance claim only when the next work occurrence or reliance use depends on a typed assurance claim. The typed assurance claim names:

FieldRequired content
Claim and assurance use carried by the tupleThe claim named by value C and the assurance use the tuple carries: readiness, release, audit, compliance, safety, model credibility, or another named assurance use.
Holon, context, and scopeH, K, and S plus audience or relying context when the label is human-facing.
Evaluation conditionWhat was evaluated, under which method, policy, test, audit, measurement, or assurance case.
Evidence relation and evidence refsThe A.10 evidence-provenance path, scoped evidence refs, source-maintenance role assignments, windows, verifier rule, relying-party rule, and proof results or status-value results that evidence the assurance tuple.
Argument and assurance rationaleThe argument pattern, assurance case, or reason why the evidence relation evidences claim C under K and S, including assumptions, defeaters, and contestable challenges.
Limitations and rival explanationsScope limits, claims or uses not carried by the assurance tuple, stale display, spoofing, copied text, generated text, proxy-for-value substitution, provenance-only source relation, context shift, and known failure conditions.
Decay and reopen conditionValid-until, revocation, policy version, gate version, model version drift, monitoring change, incident signal, evidence refresh, and contest or redress relation.

Assurance evidence minimization. A typed assurance result cites the minimum A.10 evidence-provenance path needed for the named assurance claim and relying context. Use redacted, hashed, scoped, or role-mediated evidence refs when raw evidence records would expose personal data, secrets, privileged logs, tenant identifiers, security-sensitive traces, incident details, or unnecessary identities; do not build a full assurance dossier when pointers preserve enough recoverability.

Viewpoint prompts for assurance use:

Role in the situationPrompt
Assurance stewardWhich named Assurance(H, C &#124; K, S) claim is being made or revised?
Audit roleWhich evidence-provenance path, argument, limitation, decay condition, reopen condition, and relying context must be recoverable?
Manager or release roleWhich desired decision or work or reliance use is outside B.3 and must instead use A.15, A.21, A.10, or another named source?
Model or data stewardWhich documented bounded-use statement or external intended-use field, evaluation condition, version, window, limitation, drift, and incident condition bound the model or data documentation?
Evidence source-maintenance role assignmentWhat evidence ref or scoped pointer must be exposed without turning documentation presence into an assurance claim?

Display guidance for assurance labels: a readiness, safety, compliance, trust, release-confidence, or assurance display should show the named assurance claim, assurance use carried by the assurance tuple or relying context, evaluation condition, evidence-provenance ref, scope, window, limitation, decay condition, reopen condition, and assurance, work, or reliance claims not carried by the assurance tuple. A label that only points to documentation should remain a source pointer, not an assurance result.

Incident-learning fields for assurance overread: visible label, documentation record, attempted assurance claim, missing tuple or evidence-provenance field, assurance claim, work claim, or reliance claim not carried by the assurance tuple, limitation or decay condition that defeated the claim, next legitimate formalization, evidence repair, scope narrowing, or claim narrowing move, and upstream repair record for documentation, evidence refs, assurance label wording, monitoring, or reopen trigger.

Contestability and redress relation: when the B.3 material-reliance threshold is met, the B.3 result should name the claim being contested, evidence-provenance path, limitation or decay condition, contest forum or decision forum, safe interim disposition, and what evidence or scope change would reopen the assurance claim.

If those fields are missing, the encountered publication face, rendering, or cue remains an orientation label, source pointer, evidence pointer, documentation record, or unsubstantiated confidence cue. Use A.15 when the question is whether that lane may guide work or reliance, A.10 when the question is evidence, currentness, or provenance, and A.6 when the question is mixed policy, API, or schema wording.

Positive repaired assurance statement. When the assurance use being claimed and the required assurance fields are present, write the smallest typed assurance result that can guide work or reliance: the named claim, context, scope, evaluation condition, evidence-provenance path, argument, limitations, decay condition, and reopen condition. That result may improve or justify assurance only for the stated claim and scope; other gate, evidence, work-occurrence, or compliance uses still need their own named sources. Constructive assurance moves:

  • narrow G to the evidenced or rule-bounded scope;
  • raise F by formalizing argument structure, method-description fields, or MethodRelationStructure@BoundedContext when method composition, fallback, selection, or method-family relation is current;
  • raise R by adding validation, replication, more probative, repeated, current, or more relevant evidence;
  • improve CL by repairing mappings, units, interfaces, or integration edges;
  • separate design assurance from run assurance;
  • add limitations, assumptions, defeaters, monitoring, drift, and reopen triggers;
  • reject or downgrade the assurance use when those moves are not available.

Negative controls:

Visible source or publication faceBounded source or assurance useUnsupported use without a typed assurance claim
Source-backed release dashboard tileIf the tile is a current view of A.21 GateDecision or DecisionLogRef plus an A.10 evidence-provenance path, it may carry gate-passage reliance outside B.3 for the named release and environment. B.3 is used only when the tile is also asked to raise readiness, safety, compliance, trust, or release-confidence assurance.Release approval by display, compliance proof, rollback success, work occurrence, or assurance increase without a typed assurance claim.
Credential, compliance, or provenance labelBounded source, holder, status value, history, or documentation source relation when evidenced.Safety, truth, permission, gate passage, readiness, or assurance claim by label presence.
Model card, datasheet, data card, assurance document, or assurance-looking noteScoped documentation for a named claim, documented bounded-use statement or external intended-use field, evaluated condition, limitation, version, and window.Higher R, broader G, higher F, better CL, readiness, compliance, safety, or release confidence by document presence.
Generated confidence phraseSource-finding or explanation relation when grounded.Assurance increase, authority, approval, or evidence by wording alone.

Model cards, datasheets, data cards, assurance documents, and assurance-looking notes are external documentation records or source records unless they are mapped into existing FPF claims and publication faces. They do not add MVPK face kinds and do not bypass B.3 when the use under repair is an assurance claim.

Lint trigger. A model card, datasheet, or data card cited as readiness, safety, compliance, release confidence, or assurance proof requires documented intended-use match, evaluation condition, limitations, an A.10 evidence-provenance path, and one typed Assurance(H, C \| K, S) claim for the named assurance claim. Without those, classify the use as no assurance use or as a rejected or downgraded assurance claim.

Positive repaired example: a model card plus documented bounded-use statement or external intended-use field, evaluation condition, version, window, limitations, an A.10 evidence-provenance path, and a typed Assurance(H, C \| K, S) claim may carry assurance for that named model claim in that evaluated context. The same documentation still does not carry another deployment context, gate passage, release work occurrence, or compliance proof unless those sources are separately present.

Minimum reliance safety assurance record

Use this B.3 section when the B.3 material-reliance threshold is met: reliance on a visible source may materially change behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people or team status value, operational action, or controlled-entity regulation. The first B.3 move is to decide whether an assurance claim is being made; if it is, write the minimum reliance safety assurance record for the named reliance use. Mere attention shift, learning, orientation, source-finding, or source-wording correction is not enough.

RelianceSafetyCase is the local Tech label for this B.3 assurance-record form. The plain phrase is minimum reliance safety assurance record. The label is not a new FPF pattern, Core kind, safety authority, gate, policy source, approval, certificate, compliance method, or general safety-case ontology.

Assurance-record use: the trigger and non-trigger table is a B.3 recognition aid, the minimum assurance-record table is a minimum local record aid, and the worked reliance-threshold slices are examples for users of the pattern. They are not a universal project checklist, sign-off sequence, untyped status vocabulary, or replacement for Assurance(H, C | K, S); use them only when the named material reliance trigger is met. This local section keeps the attempted reliance inside the B.3 assurance relation; it does not create an extra SEMIO authority or cross-pattern relation vocabulary.

Affordability card: orientation or source-finding stays outside B.3; bounded local reliance stays with the local evidence, explanation, CV, gate, or pattern-quality relation unless an assurance claim is being made; threshold reliance uses the minimum reliance safety assurance record only when the B.3 material-reliance threshold is met. Plain wording remains ordinary unless it changes bounded use, source relation, evidence, gate, assurance, work, decision, or selected governing pattern.

Common wrong first classification: a safety-looking note, safety case, compliance-looking label, or dashboard warning is a certificate, approval, or gate. First honest entry: state one typed B.3 assurance claim with A.10 evidence-provenance path, assumptions, limitations, defeaters, residual uncertainty, monitoring or stop condition, contest and redress relation, bounded assurance use, and unsupported attempted use.

First B.3 move: name the reliance use, the assurance claim, the affected context or audience, the trigger that meets the B.3 material-reliance threshold, the A.10 evidence-provenance path, the argument, limitations, defeaters, contest and redress relation, stop or monitoring condition, bounded assurance use, and unsupported attempted use. If those pieces are absent, use A.10, E.17.EFP, A.20, A.21, E.19, or the local relation that actually governs the source use rather than inventing assurance by label.

Trigger and non-trigger cases:

Encountered source useB.3 dispositionMinimum response
Ordinary source-backed report, citation, model card, datasheet, data card, or documentation record with no assurance use and no met B.3 material-reliance thresholdNo B.3 assurance use.Stay in A.10 with claim, source record or publication face, evidence-provenance path, window, bounded evidence use, unsupported attempted use, and reopen trigger.
Generated explanation, generated summary, or didactic reconstruction used only for source-finding or learningNo B.3 assurance use.Stay in E.17.EFP unless operative claims are relied on through A.10 evidence-provenance paths or another source relation that carries or exposes the source basis for the operative claim.
Local conformance label, CV.Status, benchmark result, or score near a release conversation but not used to raise assuranceNo B.3 assurance use.Keep CV.Status in A.20, gate-decision publication in A.21, pattern-quality result in E.19, measurement or marker relation in C.16 or A.10, and no assurance tuple unless an assurance claim is being made.
Confidence, calibration, prediction interval, or abstention reason tied to one reversible local actCompact bounded assurance claim only when the act depends on assurance; otherwise no B.3 use.State act, context, window, calibration condition, stop condition, bounded evidence use, and unsupported attempted use; use C.27 or G.11 when time, expiry, refresh, or monitoring changes the action.
Safety-looking note, compliance-looking label, public warning, dashboard value, generated operational explanation, or status-value display is intended or reasonably foreseeable to meet the B.3 material-reliance threshold: reliance materially changes behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people or team status value, operational action, or controlled-entity regulation.Minimum reliance safety assurance record is required.Build the B.3 assurance record with A.10 evidence-provenance path and any relevant A.20, A.21, E.19, C.27, G.11, B.2.5, or representation and retargeting dependency.

Minimum assurance record:

FieldRequired content
Reliance use and assurance claimThe behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people or team status value, operational action, or controlled-entity regulation that would materially change, and the assurance claim being made about that change.
Context, audience, and affected roleThe bounded context, environment, user group, team, public audience, relying role, affected role, tenant, release line, service, or work occurrence being guided.
Source record and evidence kindThe visible source, publication face, record, cue, marker, conformance label, dashboard, explanation rendering, score, warning, or status-value display, plus the evidence kind being used.
A.10 evidence-provenance pathClaim, source record or source relation, producer or method trace, currentness and window, source-maintenance role assignment, evidence relation, rival explanation, bounded evidence use, unsupported attempted use, and reopen trigger.
Argument and assurance relationWhy this evidence-provenance path carries the assurance claim under the context; include assumptions, limitations, defeaters, residual uncertainty, and unacceptable-harm or risk-tolerance condition when relevant.
DependenciesAny relevant A.20 CV status, A.21 gate decision, E.19 pattern-quality result, C.27 temporal claim, G.11 refresh and decay relation, B.2.5 control relation, or representation and retargeting relation.
Monitoring, rollback, or stop conditionWhat observation, incident, drift, contest, expiry, changed C.28 identification or realizability profile, changed A.21 gate profile, changed evaluation condition, changed source record, or failed check stops, narrows, reopens, or withdraws the reliance.
Contest and redressThe disputed claim or disposition, affected use or harm, accountable review role, challenge evidence admitted by the contest relation, possible disposition change, outcome record, and reopen trigger.
Public and protected evidence boundaryPublic summary, protected evidence reserved for an accountable review role, affected-party contestable minimum, and any scoped, redacted, hashed, or role-mediated evidence ref needed to preserve recoverability without overexposure.

Positive repaired assurance result: when the threshold is met and the assurance record is sufficient, write the smallest typed assurance result that can guide the reliance: named assurance claim, reliance use, context, evidence-provenance path, argument, limitations, dependencies, monitoring or stop condition, contest and redress relation, bounded assurance use, and unsupported attempted use. When the record is insufficient, narrow the reliance, degrade the assurance use, abstain, require evidence, reopen the source, or block the attempted assurance use; do not convert a polished source into safety acceptance.

A safety case is accepted only as a bounded assurance argument for the named reliance use. It remains contestable by defeaters, changed evidence, changed context, monitoring failure, residual-uncertainty breach, or affected-party challenge admitted by the contest relation. Stop when the named reliance use, unsupported attempted use, limitations, defeaters, contest and redress relation, monitoring or rollback condition, and reopen condition are sufficient for this threshold trigger; do not expand the record into a general safety dossier.

Accountable review is insufficient by title alone. It counts here only when it can change the disposition, records the outcome, and leaves the bounded assurance use, unsupported attempted use, and reopen condition inspectable.

Misuse guard: an incoming or attempted-reliance RelianceDisposition=safety-case-required must name the trigger that meets the B.3 material-reliance threshold. A source producer, dashboard-value publisher or maintainer, model producer, documentation producer, or status-value label issuer cannot self-clear a threshold-bearing reliance by attaching the label. Where the B.3 material-reliance threshold is met, the assurance record must expose an accountable review role and a contest relation capable of changing the disposition.

Affected-party contestable minimum: public and protected evidence separation is sufficient only if the affected party can see enough of the claim, source class, disposition, affected use, accountable role, and challenge evidence admitted by the contest relation to challenge the result. Protected evidence reserved for an accountable review role may stay protected, but protected evidence cannot make redress non-contestable while the assurance use still claims contest or assurance relation. A blocked, abstained, degraded, or evidence-needed assurance use is not final if challenge evidence admitted by the contest relation, missing affected-party evidence, changed source, changed context, monitoring failure, or redress can materially change the disposition.

Worked reliance-threshold slices:

SliceB.3 moveBoundary
A public-service or access status-value display changes who receives access, assistance, or review.Use the minimum reliance safety assurance record for the named status-value-changing reliance, with contest and redress and unsupported attempted use.The display is not approval, safety, fairness, compliance, or resource authority by itself.
An SRE dashboard changes incident behavior or resource allocation.Use B.3 only when the dashboard is asked to raise assurance or safety-bearing reliance; keep ordinary evidence and currentness in A.10.Use B.2.5 only for a control relation being claimed and A.21 only for a gate decision being claimed.
A public warning or synthetic-content label changes perceived meaning but there is no evidence that it changed the behavior claimed to change, release risk, safety claim, or control relation.Keep the label as A.10 evidence or source-finding and orientation cue; require audience-effect or behavior-effect evidence before B.3 reliance.Do not infer safety, compliance, behavior change, or control effect from label presence alone.
A manufacturing conformance label appears near release.Keep local CV or conformance evidence in A.20, A.21, C.16, or A.10; use B.3 only when assurance, safety, compliance, or release-confidence reliance is being claimed.Conformance presence is not safety acceptance or release permission.
A software supply-chain attestation is cited as runtime safety.Use A.10 for origin, build, and process claims and B.3 only for the named assurance claim with argument, limitations, defeaters, and stop condition.Build provenance is not runtime safety or operational permission.
A people or team status-value badge changes permissions, resources, or review priority.Require an assurance record that names affected role, relying role, evidence-provenance path, contest relation, and disposition change condition.The badge issuer cannot self-clear the people or team-status-value-changing reliance by issuing the badge.
A standards-document clause is reused as approval.Use A.10 for evidence of the clause; use the named approval, commitment, gate, or assurance relation only when that relation is being claimed by value.A cited clause is not project approval, gate passage, or assurance by quotation.

Do not treat the assurance record as a graded scale, standalone status value, universal assurance checklist, release certificate, or new safety-case disposition family. B.3 consumes the assurance record only as typed assurance input for the named claim and reliance use.

Where the numbers are assigned (and where they are not)

  • On nodes: each input holon contributes its local F, G, R according to its nature (system vs. episteme).
  • On edges: each integration step has a CL (congruence of the connection).
  • Not inside Γ: Γ consumes D and produces a composed holon; B.3 governs how F, G, R, CL propagate to the Assurance tuple for that composed holon. This keeps Γ algebra and assurance calculus separable and reviewable.
  • Not a state space: ⟨F,G,R⟩ is an assurance tuple, not a U.CharacteristicSpace; do not draw “trajectories” in ⟨F,G,R⟩. For episteme evolution, use ESG states and the assurance‑trace hooks (see below).

Universal aggregation skeleton (domain‑neutral)

Any Γ‑flavour that claims an Assurance result must adopt the following conservative skeleton:

  1. Formality:

    F_eff = min_i F_i

    Rationale: the least formal piece caps the formality of the whole (WLNK on F). Monotone: raising any F_i cannot reduce F_eff.

  2. ClaimScope (G):

    G_eff(path)  = intersection({G_i | i is essential on the dependency path})
    G_eff(claim) = SpanUnion({G_eff(path_j)}) only across independently evidenced paths
    • Along an essential dependency path, every required evidence relation must hold on the same slice, so the effective claim scope is the intersection of the required scopes. Empty intersection means the path does not evidence the claim on any slice.
    • Across independent evidence lines for the same claim, B.3 may publish a SpanUnion of the path scopes, but only when the independence assumption and evidence relation are explicit.
    • Constraint: any region not covered by the required evidence relation for its path is dropped. A raw union of node scopes is never the default law for G.
    • Monotone: adding an independently evidenced path may widen the published claim scope; adding a new essential dependency may narrow it.
  3. Reliability (penalized by integration):

    R_raw = min_i R_i                       # Weakest-link cap
    R_eff = max(0, R_raw − Φ(CL_min))       # Congruence penalty
    • CL_min is the lowest Congruence Level (CL) value on any edge in the proof spine or critical integration region for the claim C.
    • Φ is monotone decreasing and bounded (never makes negative values).
    • Monotone: increasing any R_i or any CL cannot lower R_eff.
  4. Evidence-source notes:

    • The aggregate produces an assurance source-currentness record listing all contributing nodes and edges, with their F, G, R, CL, scopes, and evidence links (A.10).
    • The record also displays the EntityOfConcernRef (entityOfConcernRef and groundingHolonRef) and the ReferencePlane for the claim, and presents a separable TA, VA, and LA table of evidence contributions with valid-until or decay marks and the Epistemic-Debt per § B.3.4.
    • If order or time mattered for the claim, attach the OrderSpec or TimeWindow identifiers (B.1.4).

This skeleton is mandatory. Domain‑specific patterns may add refinements (e.g., separate epistemic “replicability” vs. “calibration”) as long as they do not violate WLNK or MONO and preserve scale kinds.

System vs. Episteme - same shape, different interpretations

For systems:

  • F means engineering discipline (from ad-hoc method to verified specification).
  • G means operational envelope coverage.
  • R means assured reliability under K (requirements, environment, test campaigns).
  • CL covers interface verification or integration verification.

For epistemes:

  • F means logical formality or semantic formality (from prose to proof).
  • G means domain span (concepts, populations, conditions).
  • R means evidential relation quality (replication quality, measurement integrity).
  • CL covers vocabulary mapping quality and ontology mapping quality.

Scale discipline (CHR guard‑rails)

To prevent silent misuse:

  • Ordinal scales (F, CL): never average or subtract; use only min, max, thresholds, and monotone comparisons defined for ordinal scale values.
  • Coverage scales (G): use union and intersection in a declared domain space; do not “average” sets. If a numeric proxy is used (e.g., coverage ratio), it must be derived from a set operation, not vice versa.
  • Ratio scales (R): may be combined with min, max, or explicitly justified conservative functions; do not add R’s from different contexts without normalization of K (assumptions).

What improves the tuple (improvement-pattern overview)

B.3 remains neutral about how improvement happens, but for didactic clarity:

  • Raise F: formalize narratives (specifications, machine‑checked models).
  • Raise G: enlarge evidence-covered span (new test regimes, new populations) with adequate evidence.
  • Raise R: replicate, calibrate, tighten measurement error, reduce bias.
  • Raise CL: reconcile vocabularies, align units, formalize mappings, verify interface Standards.

Each of these corresponds to recognizable U.RoleAssignment values, U.Method or U.MethodDescription changes, evidence-producing U.Work, and improvement moves. Their run-time counterparts are covered by temporal evidence and work-cost evidence under the governing temporal and work patterns.

Prohibition (normative) — F–G–R is not a CharacteristicSpace

Do not treat ⟨F,G,R⟩ as a U.CharacteristicSpace and do not define geometric trajectories over it. Use ESG for episteme state and the assurance‑trace hooks for trends in assurance tuples.

Assurance consequence for unsupported causal-use claims

B.3 consumes CausalUseSupportVerdict, CausalEvidenceSupportBasis, and relevant profile refs from C.28 and A.10 when an assurance claim depends on a C.28 causal-use verdict:

CausalUseSupportVerdict = supported | bounded | unsupported | abstain

CausalAssuranceTupleTrigger is narrower than local causal-use repair. A local [C.28](/generated/patterns/C.28) downgrade, redirection to a relation governing the asserted use, or abstain disposition does not require a new [B.3](/generated/patterns/B.3) assurance tuple by itself. Create or update a [B.3](/generated/patterns/B.3) tuple only when the causal-use claim is assurance-bearing, publication-bearing, release-bearing, or reused as an input to assurance, trust, certification, risk acceptance, or downstream selection. Exploratory causal wording, local causal wording repair, or a [C.28](/generated/patterns/C.28) cheap stop remains outside [B.3](/generated/patterns/B.3) until it changes assurance or publication use.

An unsupported causal-use shift lowers, blocks, or abstains from R for the affected causal-use claim. If CounterfactualSamplingRealizabilityProfile.verdict = nonrealizable, [B.3](/generated/patterns/B.3) lowers or blocks R for claims that require direct counterfactual-comparison sampling evidence. If CounterfactualSamplingRealizabilityProfile.verdict = unknown, direct-realization claims are unsupported, while identified, bounded, or simulation-only bounded use may remain available when [C.28](/generated/patterns/C.28) declares the bounded use and unsupported use.

Verdict consequences:

CausalUseSupportVerdictAssurance consequenceBounded assurance wording
supportedThe causal-use claim contributes to R only inside the named CausalUseSupportStatement, scope G, CausalEvidenceSupportBasis, and cited profile refs."Supported only for the declared causal use under the cited CausalEvidenceSupportBasis, profile refs, and scope."
boundedR is bounded to the declared bounded-use limit; assurance prose must name the bound, the CausalUseSupportStatement, and the CausalUseUnsupportedStatement, and must not imply unqualified causal use outside them."Bounded causal-use claim for the declared regime, population, policy, model, or window; unsupported outside that bound."
unsupportedThe causal-use claim cannot raise R; it becomes CausalUseUnsupportedStatement, is downgraded, removed, or blocks the assurance claim when the causal use is necessary."Causal use unsupported for this assurance claim; use association-only, metric-only, or simulation-only wording or block the causal assurance claim."
abstainNo causal-use conclusion contributes to R; the assurance tuple either proceeds only on named non-causal grounds or abstains from the affected causal claim."No causal-use conclusion is used; assurance proceeds only on named non-causal grounds or abstains from this causal claim."

What changes in practice: assurance prose cannot say "high confidence that the policy caused improvement" when the evidence-provenance path only evidences association or simulation-only counterfactual output; the unsupported causal-use step must degrade, abstain, or block the causal-use claim.

What this does not authorize: [B.3](/generated/patterns/B.3) does not determine the [C.28](/generated/patterns/C.28) target CausalityLadderRung, estimand, causal identification, evidence design, or realizability profile; it applies assurance consequences to the CausalUseSupportVerdict supplied by [C.28](/generated/patterns/C.28) and the evidence-provenance path supplied by [A.10](/generated/patterns/A.10).

B.3:5 Proof obligations (attach these when producing an Assurance tuple)

These obligations adapt the current B.1 and B.1.1 dependency-structure and relation-grounding checks for assurance outputs. Each Γ-flavour that emits an Assurance(H, C | K, S) tuple attaches the applicable obligations below.

Common obligations (all Γ‑flavours)

  • ASS-CLM (Typed claim and context). State the claim C (what is being assured), the context K (assumptions, environment), and the scope S ∈ {design, run}.

  • ASS‑SCA (Scale discipline). Declare the scale kind used for each characteristic (F ordinal, G coverage, R ratio) and confirm that each operation is defined for that scale kind (no averaging of ordinals; G via set and coverage operations).

  • ASS‑WLNK (Weakest‑link evidence). Identify the cutset (node or edge set) that caps F, G, and R for the claim (the proof spine for epistemes, the structural or assurance bottleneck for systems).

  • ASS‑CL (Congruence on integration dependency). Identify the relevant integration dependency path(s) and record CL_min used in the penalty Φ(CL_min).

  • ASS‑MAN (evidence-source record). Produce an assurance source-currentness record listing all contributing nodes and edges with (F, G, R) and CL values, their DesignRunTag, and Evidence Graph Ref (A.10). If order or time affect the claim, include the OrderSpec or TimeWindow identifiers from the governing temporal or order pattern.

  • ASS‑MONO (Declared monotone characteristics). List the characteristics along which local improvement cannot reduce the aggregate (this is used by future evolution, B.4).

Γ_sys (systems) — additional obligations

  • CORE‑BIC (Interface congruence). Reference the Boundary‑Inheritance Standard (BIC) from B.1.2 and record any interface mismatches; these contribute to CL_min.

  • CORE‑ENV (Operating envelope). Specify the domain used for G (e.g., load–temperature region) and how coverage is computed (set union constrained by evidence relation).

Γ_epist (epistemes) — additional obligations

  • EPI‑SPN (Entailment spine). Identify the premise spine or lemma spine for the claim; R_raw = min R_i is taken along this spine, not over arbitrary satellites.

  • EPI‑MAP (Semantic mapping congruence). Point to the vocabulary mappings and ontology mappings used; their verification status sets the CL values on the integration edges.

Γ\ctx and Γ\method (order‑sensitive) — additional obligations

  • CTX‑ORD (OrderSpec). Attach the partial or total order σ and any join-soundness conditions (types, preconditions, and postconditions). (See B.1.4 for NC‑1..3 invariants; B.1.5 adds duration/capability typing.)

Γ_time (temporal) — additional obligations

  • TIME-COV (Coverage and identity). Show that PhaseOf intervals cover the declared window without overlap for the same phased entity; justify any gap or overlap explicitly.

Note on Γ_work. Resource spending and efficiency belong in Γ_work. Their measurement integrity can influence R for a claim (e.g., if a reliability figure depends on calibrated energy input), but costs themselves are not assurance; keep them in Γ_work and cite their measurement assurance as inputs here.

Archetypal grounding (worked examples)

Bias-Annotation

B.3 deliberately biases assurance toward conservative aggregation and explicit reliance use. This prevents dashboards, labels, badges, credentials, model cards, provenance marks, or generated confidence phrases from raising trust by appearance. The cost is that assurance claims need typed evidence, scope, limitations, decay, and contestability when they are used for readiness, safety, compliance, release confidence, or other material reliance.

Episteme archetype — Meta-analysis claim

  • Claim C: Intervention X reduces outcome O by Δ on population P.

  • Context K: Inclusion criteria, exclusion criteria, measurement protocol; S = design.

  • Graph: Studies MemberOf evidence corpus; effect models ConstituentOf synthesis; mappings align different outcome scales.

  • Inputs:

    • F: two RCTs at F3, one observational at F2 -> F_eff = F2.
    • R: replication quality per study -> weakest R on the entailment spine caps R_raw.
    • CL: mapping of scales (CL1 vs CL3).
    • G: populations union, but unevidence-covered sub-populations are dropped.
  • Aggregation:

    • F_eff = F2 from the weakest study-design evidence relation in the synthesis.
    • R_eff = max(0, min(R_RCT1, R_RCT2, R_OBS) - Φ(CL_min=CL1)).
    • G_eff: union of evidence-covered sub-populations; out-of-scope groups excluded.
    • CL_min = CL1 for scale mappings; record the mapping witness and weakest-link study in the assurance source-currentness record.
  • Evidence/source record: Data provenance, scale mappings, bias assessment, and proof-term hash for the effect-model equivalence when it is used constructively.

  • Improvement move: upgrade mapping verification to CL2 or CL3; increase F via registered analysis plan; replicate lagging study.

Order-sensitive manufacturing-sequence assurance

  • Claim C: The domain manufacturing sequence R, mapped to an order-sensitive Method/Work sequence with an OrderSpec, meets output defect rate <= epsilon.

  • Context K: Materials, equipment class; S = run.

  • Γ_ctx records: OrderSpec σ for the method/work sequence; declared independent branches; join conditions at inspection.

  • Assurance:

    • R_raw = min R_step along the declared order-sensitive dependency path (including inspection effectiveness).
    • Penalty from poor join soundness CL_min.
    • Improvement via faster but verified inspection (increase R_step) or tighter join spec (increase CL).

Temporal archetype — Versioned model credibility

  • Claim C: Model M predicts within ±δ over τ.

  • Context K: Data regime and drift tolerance; S = run.

  • Γ_time records: PhaseOf slices v1, v2, v3 covering τ.

  • Assurance:

    • R_raw = min(R_v1, R_v2, R_v3);
    • penalty if v2–v3 interface had low calibration congruence;
    • improvement via re‑calibration (↑CL) or new validation campaign (↑R_v3).

Bias-Annotation

B.3 deliberately biases assurance toward conservative aggregation and explicit reliance use. This prevents dashboards, labels, badges, credentials, model cards, provenance marks, or generated confidence phrases from raising trust by appearance. The cost is that assurance claims need typed evidence, scope, limitations, decay, and contestability when they are used for readiness, safety, compliance, release confidence, or other material reliance.

Conformance checklist

IDRequirementPurpose
CC-B3.1An assurance result is a typed claim Assurance(H, C &#124; K, S) with S ∈ {design, run}.Prevent scope drift and chimeras.
CC-B3.2F is ordinal and uses thresholds or min; G is a USM scope value and uses membership, intersection along essential paths, and SpanUnion only across independent evidence lines; R is ratio and uses min plus conservative operations.Preserve scale integrity (CHR and USM).
CC-B3.3Congruence Level (CL) is assigned to edges; the penalty Φ(CL) is monotone decreasing and bounded (R_eff ≥ 0).Make integration quality first-class.
CC-B3.4R_eff = max(0, min_i R_i - Φ(CL_min)) for the relevant integration dependency paths, unless a stricter domain-specific rule is justified.Enforce WLNK and penalize low-CL integrations.
CC-B3.5For G, essential dependency paths compose by intersection; SpanUnion applies only across explicitly independent evidence lines to the same claim and only over evidenced slices.Prevent over-generalization.
CC-B3.6An assurance source-currentness record lists node and edge values, Evidence Graph Ref, and any OrderSpec or TimeWindow identifiers; it also displays the describe(EntityOfConcernRef->GroundingHolonRef) binding for the claim, the declared ReferencePlane value of world, concept, or episteme, a separable TA, VA, and LA evidence breakdown per CC-KD-08, decay or valid-until indicators on empirical bindings, and the Epistemic-Debt tally from B.3.4.Provide auditability through A.10 without collapsing evidence families.
CC-B3.7Agency-characteristic values (A.13/C.9) do not override WLNK or Φ(CL) penalties; if agency grade change alters capabilities, model it as a Meta-Holon Transition.Preserve safety; keep agency separate.
CC-B3.8Design-time assurance and run-time assurance are kept in separate tuples and compared side by side when both matter.Avoid design-time and run-time mixing.
CC-B3.9If an assurance claim depends on a C.28 causal-use verdict, it consumes CausalUseSupportVerdict, CausalEvidenceSupportBasis, and relevant profile refs from C.28 or A.10; a causal-use claim whose C.28 verdict is unsupported degrades, blocks, or abstains rather than raising R.Prevent assurance prose from certifying unsupported causal claims.
CC-B3.10A local C.28 downgrade, redirection to the relation governing the asserted use, or abstain disposition is not a new assurance tuple trigger unless the claim is assurance-bearing, publication-bearing, release-bearing, or reused as an assurance input.Keeps cheap causal triage from becoming assurance ceremony.
CC-B3.11A conforming B.3 use does not treat a label, badge, dashboard tile, credential display, provenance mark, compliance-looking mark, model card, datasheet, data card, assurance document, attestation label, or generated confidence phrase as raising F, G, R, CL, readiness, safety, compliance, trust, release confidence, or assurance unless a typed Assurance(H, C &#124; K, S) claim and A.10 evidence-provenance path name the claim, assurance use stated by the assurance tuple or relying context, scope, evaluation condition, evidence refs, argument and assurance rationale, limitations, decay condition, reopen condition, and relying context.Blocks visible authority-looking labels from supplying false assurance relation.
CC-B3.12When reliance on a source may materially change behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people or team status value, operational action, or controlled-entity regulation, the B.3 result provides a minimum reliance safety assurance record or explicitly rejects, narrows, degrades, abstains, or reopens the attempted assurance use. The local Tech label RelianceSafetyCase is not a certificate, approval, gate, policy source, Core kind, release permission, or general safety-case ontology.Keeps safety-bearing reliance relation concrete without turning every source or publication face into a dossier or a new authority system.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Averaging assuranceMean of R_i reported as system reliabilityUse min R_i on the cutset, then apply Φ(CL_min).
Ordinal arithmeticAveraging F or CL to produce “2.3”Use min or max or thresholds; never average ordinals.
Coverage as centroidReplacing G union with a single “typical point”Keep G as set and coverage; if a numeric proxy is needed, derive it from the set.
Ignoring congruenceNo penalty for low-CL mappings or interfacesAssign CL to integration edges and apply Φ(CL_min).
DesignRunTag chimera“One score” mixing blueprint and telemetrySplit into S=design and S=run tuples; compare explicitly.
Agency overrideClaiming higher assurance because a controller is “clever”Agency may justify how improvements are achieved; it cannot remove WLNK or Φ.
MemberOf as stockUsing MemberOf to sum reliabilitiesKeep MemberOf for collections; reliability comes from the relevant Γ composition, such as the Γ_sys cutset.
False assurance relationBadge, dashboard color, credential display, compliance mark, provenance label, model card, datasheet, data card, assurance document, attestation label, or generated confidence phrase is used as an assurance claim.Keep it as orientation or source pointer unless a typed assurance claim and A.10 evidence-provenance path make the intended assurance use bounded and evidenced.
Minimum reliance safety assurance record inflationOrdinary evidence, source-finding explanation, local CV, documentation, or reversible local calibration use is forced into a safety assurance record; or the assurance record is used as approval, release permission, gate passage, safety acceptance, or compliance proof.State the trigger that meets the B.3 material-reliance threshold. If the trigger is absent, use A.10, E.17.EFP, A.20, A.21, E.19, or the local relation that actually governs the use. If the threshold is met, write only the minimum assurance record and contest and redress relation needed for the named reliance use.

Consequences

Benefits

  • Comparable, conservative, improvable. The tuple ⟨F, G, R⟩ with edge-scoped Congruence Level (CL) values gives a compact, auditable view that improves monotonically under targeted moves (formalize, replicate, reconcile).
  • Cross-scale coherence. Works for assemblies and arguments, methods and histories, without leaking order, time, or cost into structure.
  • Clear improvement moves. It is obvious what to do to raise each component: raise F, G, or R locally, or raise CL on the integration edge.

Trade‑offs

  • More explicit metadata. You must state scale kinds, cutsets, and mapping congruence; this is intentional transparency.
  • Conservatism may feel pessimistic. True synergy appears only via MHT or after raising CL—never by arithmetic optimism.

Rationale

B.3 distills mature post‑2015 practice across several fields into a single, small calculus:

SoTA-Echoing

  • Assurance by weakest link reflects reliability engineering and safety cases in complex systems; composing assurance evidence by minima prevents over‑statement.
  • Formality and verifiability mirror advances in model‑based engineering and formal verification, where raising F turns subjective arguments into verifiable records.
  • Coverage as set and measure follows evidence synthesis and validation practice that treat applicability as a domain region, not a scalar to “average.”
  • Congruence on edges captures what meta‑analysis, interface control, and ontology alignment have repeatedly shown: integration quality is often the real bottleneck. Penalizing low‑CL is a principled way to prevent silent over‑confidence while rewarding verified reconciliation.
  • Assurance documentation, provenance, and release-status practice treats labels, model cards, datasheets, C2PA provenance marks, SLSA and in-toto attestations, credential displays, generated confidence phrases, and dashboards as scoped documentation or source pointers, not automatic assurance claims. B.3 adopts claim, argument, and evidence discipline and scoped assurance-documentation use, adapts model cards, datasheets, data cards, attestations, provenance marks, dashboards, and generated confidence phrases as possible documentation or evidence inputs for a named assurance claim, and rejects visible-label promotion into readiness, compliance, safety, trust, R, F, G, CL, or release confidence without a typed tuple and A.10 evidence-provenance path.

Practical result from that safety-case and assurance-documentation practice: safety notes, compliance-looking labels, assurance documents, dashboards, provenance marks, model cards, datasheets, data cards, and generated confidence phrases do not become certificates, approvals, gates, safety acceptance, or assurance by appearance. The local B.3 result is one typed assurance claim or minimum reliance safety assurance record for the named reliance use, with A.10 evidence-provenance path, assumptions, limitations, defeaters, residual uncertainty, monitoring or stop condition, contest and redress relation, bounded assurance use, unsupported attempted use, and reopen when evidence, source record, context, C.28 identification or realizability profile, A.21 gate profile, evaluation condition, monitoring, or challenge evidence admitted by the contest relation materially changes the disposition.

This arrangement preserves A.11 Parsimony (few characteristics), aligns with A.14, A.7, and A.15 (clear separation of structure, order, time, cost, values), and leaves Context for domain-specific refinements that do not break the invariants.

Relations

  • Builds on: B.1 where its current composition invariants are named by value, B.1.1 dependency-structure and relation-grounding checks, current system-composition, context, temporal, and work patterns when those operators are active, A.14 (Mereology), A.7 (EntityOfConcern and Description strict distinction), A.10 (evidence-provenance and carrier/source-currentness relations), A.15 (role, method, work-plan, and work alignment), A.2 and A.2.1 (role values and role assignments), A.3.4 (Transformation when actual change is current), and C.13 (Compose-CAL).
  • Coordinates with: E.14 (Human‑Centric Working‑Model) for publication-facing assertion discipline and B.3.5 (CT2R‑LOG) for Working‑Model relation label-meaning and grounding (tv:*, validationMode).
  • Coordinates with: C.28 for CausalUseSupportVerdict, CausalityLadderRung, CausalEvidenceSupportBasis, identification profile refs, realizability profile refs, supported causal use, and unsupported causal use; A.10 for the evidence-provenance graph path carrying causal-evidence refs.
  • Coordinates with: A.15 for work disposition and reliance disposition, A.6 for mixed authority wording, A.21 for OperationalGate(profile), GateDecision, and DecisionLogRef, A.20 for ConstraintValidity status or witness, and A.15.1 for release or deployment work occurrence. B.3 only handles typed assurance use; labels and evidence pointers stay with the source relation that governs them when assurance is not being claimed.
  • Used by: KD-CAL improvement patterns (to plan improvements), B.4 (Evolution loops that raise F, G, R, or CL over time).
  • Triggers: B.2 (Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes) when genuine new capabilities emerge that change the applicable cutsets or envelopes.

One‑page takeaway. Report assurance as ⟨F, G, R⟩ for a typed claim under explicit context and scope, and penalize by the lowest edge-scoped Congruence Level (CL) value. Improve assurance by raising F, G, R, or CL—and keep order, time, and cost in their own lanes.

Assurance relation for quantum-like claims

Quantum-like wording does not raise the claim-assurance requirement by default. A local C.26 modeling note can remain lightweight when it only prevents a representational mistake and is not used for a work-guiding use, reliance use, audit-closure claim, readiness-certification claim, or empirical-superiority claim.

Assurance-relation checks:

  1. Decide the claim-assurance requirement before building assurance machinery.
  2. If the QL note only prevents a local misinterpretation, keep it as QL-lite with ordinary evidence.
  3. If the claim will be reused, state the governing FPF pattern, local stop condition, and evidence relation or evidence-provenance condition.
  4. If the claim is used for release, readiness, audit, compliance, assurance, or threshold-bearing work or reliance, build the B.3 assurance claim over named evidence refs and scope.
  5. If the claim says QL is better, faster, more accurate, or uniquely necessary, compare rival models, baseline, claimed mechanism, scope, and loss.
  6. State decay conditions and reopen conditions so an old QL-evidenced assurance claim does not silently stay current after new validation observations, changed source records, changed evidence refs, or scope change.
Claim-use requirementB.3 expectationOutput
Local modeling noteNo assurance tuple beyond the ordinary pattern and evidence noteQL-lite note with local stop
Reusable example or pattern-facing noteName the governing FPF pattern, local stop condition, and evidence relation or evidence-provenance conditionReusable example with source relation
Decision, release, audit, readiness, or compliance useProvide F, G, R, congruence relation, evidence refs, confidence, rival explanations, and decay or reopen conditionsAssurance tuple and evidence-provenance path
Comparative superiority claimAdd rival-model comparison, baseline, claimed mechanism, and scope limitsBounded superiority claim or apply the FPF pattern that governs the comparison being claimed

Useful outputs:

  • no B.3 assurance use when QL is only a local representational lens;
  • a compact bounded assurance claim statement when reuse is modest;
  • a full assurance tuple only when consequence severity demands it;
  • a rejected, narrowed, or withdrawn claim when evidence does not carry the claimed assurance use or relying context.

C.29 mathematical-lens use relation

If a mathematical lens is used as input to assurance, readiness, reliability, release confidence, safety, trust, or engineering justification, write the assurance relation in B.3 with the relevant evidence-provenance path and residual-use limits. A C.29 output may be cited only as a lens-use result; mathematical elegance, validation regime, or a declared structure-preserving mapping does not raise assurance by itself. Evidence-provenance paths remain A.10; measurement construction and comparability remain C.16.

B.3:End

B.3.3 — Assurance Subtypes & Levels

Problem Frame

A complex project may generate hundreds of assurance targets and evidence carriers: design specifications, simulation models, test suites, and operational logs. While the Trust & Assurance Calculus provides a framework for evaluating these assurance targets and their evidence, teams often face a critical challenge: how to aggregate this diverse evidence into a single, meaningful signal of an assurance target's maturity. Simply counting the number of tests or documents can lead to "paper compliance," where an assurance target appears well-supported but has critical, unexamined weaknesses in its formal structure or conceptual alignment.

Problem

How do we create an objective, auditable, and balanced Standard for what constitutes "trustworthiness" at each stage of an assurance target's development state cycle? FPF requires a mechanism that moves beyond simple evidence counting to a qualitative assessment of assurance. This mechanism must prevent common failure modes, such as over-investing in run-time validation (LA) at the expense of design-time verification (VA), or neglecting the critical work of ensuring concepts are correctly mapped and typed (TA).

Solution

FPF establishes a formal Standard that links three distinct Assurance Subtypes to three computable Assurance Levels. An assurance target's level is not assigned manually by an author; it is derived automatically by its anchored evidence. This creates a transparent and falsifiable system for tracking an assurance target's progression from a speculative idea to a robust, reliable holon.

Assurance Subtypes: The Three Pillars of Trust

These three subtypes categorize the kind of question an assurance activity answers, ensuring a balanced approach to building confidence.

SubtypeCodeCore QuestionLinks to Epistemic ScoreManager's View: What It Prevents
Concept-Bridge AssuranceCBA"Are the assurance target's load-bearing terms bridged to the intended FPF values?"CL (Congruence Level)Miscommunication & Integration Failures. CBA checks whether a requirement's "Sensor" and an architecture view's "Sensor" name the same entity, characteristic, role assignment, interface, or publication claim in the current scope. This activity directly improves the Congruence Level (CL) of the integration edges between assurance targets.
Verification AssuranceVA“Is the holon logically correct under its stated assumptions?”FV (Formal Verifiability)"It Works on Paper" Errors. VA catches design flaws, logical inconsistencies, and specification errors before a single line of code is written or a physical part is machined. It ensures the blueprint is sound.
Validation AssuranceLA“Does the holon work correctly in the real world?”EV (Empirical Validability)"Works in the Lab, Fails in the Field" Surprises. LA confirms that the holon performs as expected under real or simulated operational conditions, accounting for noise, unexpected inputs, and environmental factors.

Computed Assurance Levels: Evidence-support progression

An assurance target's level is computed based on the evidence it has accumulated. This creates a declared progression for increasing trust without treating assurance as a generic ladder.

LevelNameHow It Is Computed
Level 0UnsubstantiatedNo verifiedBy or validatedBy evidence is present. The assurance target is a claim or an idea.
Level 1SubstantiatedAt least one verifiedBy or validatedBy link to an evidence carrier exists, and the assurance target is supported by Concept-Bridge Assurance (CBA).
Level 2AxiomaticThe assurance target is verifiedBy either a proof or a Compose‑CAL (Γₘ) constructive narrative that the author has linked from the Working‑Model via tv:groundedBy (CT2R‑LOG). Its FormalVerifiabilityScore (FV) meets or exceeds a pre‑defined threshold. Additionally, if the holon is designated as safety‑critical, it MUST also be supported by Validation Assurance (LA). For non‑critical holons, LA is recommended (SHOULD).

Didactic Note for Managers: What 'Level 1' Really Means

Think of moving from Level 0 to Level 1 as the first step toward professional seriousness.

  • Level 0 is an idea on a whiteboard. It has potential, but no receipts.
  • Level 1 means you have at least one receipt. You have anchored the idea to something concrete: a passing test, a formal sketch, a simulation result. It's no longer just an opinion.

Crucially, Level 1 also demands Concept-Bridge Assurance. This sounds technical, but its business impact is simple: it means the project has named its terms in a way that survives movement across documents, diagrams, and specialist vocabularies. You've used the Domain-Concept Bridge (Pattern B.5.3) to check whether "Sensor" in requirements and "Sensor" in an architecture view name the same entity, characteristic, role assignment, interface, or publication claim. This basic alignment work is what prevents costly integration failures and endless meetings where teams talk past each other.

Conformance Checklist

To ensure the integrity of the assurance calculus, the following rules are normative. A Target of Assurance (ToA) is any working-model element designated as a root claim (e.g., a root system requirement, safety goal, or core hypothesis).

  • CC-B3.3.1 (L1 Anchor Mandate): A ToA SHALL NOT be considered to have reached AssuranceLevel:L1 unless it is linked to at least one evidence carrier via verifiedBy or validatedBy.
  • CC-B3.3.2 (Concept-Bridge Mandate): A ToA at AssuranceLevel:L1 or higher MUST be supported by Concept-Bridge Assurance. This includes, at a minimum, that its core terms are mapped through the Domain-Concept Bridge (Pattern B.5.3) and conform to their declared schemas, slot relations, or bridge records.
  • CC-B3.3.3 (L2 V&V Mandate): A ToA at AssuranceLevel:L2 MUST satisfy all L1 criteria. In addition, it MUST be supported by Verification Assurance (VA) with FV ≥ threshold_FV. For holons designated as safety-critical (e.g., criticality ≥ SIL-2), the ToA MUST also be supported by Validation Assurance (LA) with EV > 0. For non-critical holons, LA SHOULD be present.
    • Exemption Note: Purely formal epistemes (e.g., mathematical axioms) may justify an exemption from the LA requirement, provided this is documented in the formal episteme's rationale.
  • CC-B3.3.4 (Concept-Bridge Completeness): For any mechanism used in a model at AssuranceLevel:L1 or higher, its load-bearing local terms, slots, and governed values MUST be mapped to their declared FPF kinds, relations, characteristics, method values, work values, publication-use relations, or evidence-use relations via the Domain-Concept Bridge (Pattern B.5.3).
  • CC-B3.3.5 (Scope Separation): Assurance claims MUST maintain a strict separation between design-time and run-time scopes (Pattern A.4). An assurance tuple for a MethodDescription (design-time) SHALL NOT be conflated with one for its corresponding Work/Trace (run-time). The Evidence Graph Ref (verifiedBy, validatedBy) must point to evidence carriers or records with the appropriate scope.
  • CC-B3.3.6 (CT2R‑LOG Handshake): If a ToA depends on structural claims, those claims SHALL be published as Working‑Model relations and, when used to justify L2, SHALL declare validationMode=axiomatic and provide Constructive grounding with tv:groundedBy → Γₘ.(sum|set|slice) (see B.3.5 and C.13).
  • CC-B3.3.7 (Downward‑Only Dependence): Assurance publications or records (Mapping, Logical, Constructive, and Evidence) SHALL NOT impose vocabulary or layout back onto the Working‑Model surface (E.14).

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Tested but Unbridged" Mess"Our code has 100% test coverage, but we still have integration bugs and nobody understands what the code does."CC-B3.3.2 makes Concept-Bridge Assurance (CBA) mandatory for L1. You cannot claim your work is "Substantiated" without first ensuring your terms and concepts are clear, context-scoped, and consistently bridged.
The "Perfect Blueprint, Flawed Reality""The design was formally proven to be perfect, but the physical product failed catastrophically in the field."CC-B3.3.3 mandates Validation Assurance (LA) for safety-critical systems at L2. A perfect blueprint (FV=4) is not enough; you must also provide empirical evidence (EV>0) that it works in the real world.
The "Paper Compliance" Shell Game"We have thousands of documents and links, so we must be at a high assurance level."The computed AssuranceLevel is not based on the quantity of evidence but on its type and quality (via FV/EV scores). You cannot reach L2 without strong formal verification (VA), no matter how much validation (LA) you do.

Consequences

BenefitsTrade-offs / Mitigations
Objective Gatekeeping: The rules provide a clear, objective, and falsifiable basis for an assurance target's assurance status, eliminating subjective judgment and "assurance theater."Risk of Over-stringency: The rules might feel too strict for rapid prototypes. Mitigation: The requirements for L1 are deliberately lightweight, demanding only one piece of evidence and basic typing, making the first evidence-support transition accessible.
Balanced Assurance: The Standard requires a mix of evidence types for higher levels, preventing teams from over-investing in one area (e.g., testing) while neglecting another (e.g., formal specification).Risk of Evidence Inflation: Teams might add trivial evidence just to meet the criteria. Mitigation: The quality of evidence is assessed via the epistemic scores (FV, EV, CL); merely linking to low-quality evidence will not significantly raise the scores needed for L2.
Clear Progress Tracking: The assurance-level progression provides a clear roadmap for maturing an assurance target from an idea to a fully assured component, making planning and progress monitoring transparent.Overhead for Complex Holons: A holon with many ToAs may require significant assurance work. Mitigation: The framework allows grouping, where a parent claim's evidence can satisfy the coverage requirements for its children if explicitly declared.

Rationale

This pattern transforms the assurance framework from a descriptive taxonomy into a prescriptive, actionable Standard. By binding the computed AssuranceLevel to mandatory, well-defined evidence coverage, it makes the notion of "trustworthiness" in FPF an objective and auditable property. The rules ensure that as an assurance target's formality and claimed reliability increase, the rigor and balance of its supporting evidence increase in lockstep, operationalizing the principle of "no blind trust." The separation of design-time and run-time evidence, mandated by CC-B3.3.5, further ensures that claims made about a blueprint are not confused with claims made about a running system, preserving the integrity of the whole design-time and run-time evidence history.

Relations

  • Builds on: B.3 Trust & Assurance Calculus, C.2.1 U.Episteme, C.16/A.19 characterization discipline, A.10 Evidence Graph Referring, A.4 Temporal Duality.
  • Constrains: The computation and interpretation of AssuranceLevel for all holons.
  • Enables: Objective quality gates in the Canonical Evolution Loop (B.4) and reliable inputs for D.4 Ethical Mediation and Decision Use.

B.3.3:End

Evidence Decay & Epistemic Debt

Problem Frame

The FPF assurance model (Pattern B.3.3) provides a robust framework for building trust in holons by anchoring claims to a rich body of evidence. However, it implicitly treats this evidence as timeless. A proof verified today is assumed to hold forever; a validation test run last year is given the same weight as one run yesterday. This assumption is dangerously flawed in any dynamic environment.

Consider a bridge certified in 1980. The assurance case, resting on evidence about steel fatigue from that era, would be considered highly reliable at that time. Today, after decades of environmental change, new material science insights, and an entirely different traffic load, would we still trust that original certification without re-evaluation? The context has drifted, and the original evidence has lost its relevance. FPF requires a formal mechanism to account for this natural decay of trust.

Problem

Without a calculus for evidence aging, FPF models are vulnerable to three critical failure modes:

  1. Silent Risk Accumulation: Trust silently decays. A component's high AssuranceLevel can become an illusion, resting on foundational evidence that is no longer valid in the current operational context. When aggregated, this stale trust propagates upwards, creating a seemingly robust system-of-systems that is, in fact, incredibly brittle.
  2. Audit Illusion: An assurance target can pass an audit with flying colors, showing a complete set of anchors to high-quality evidence, yet be fundamentally untrustworthy because that evidence is obsolete. This leads to a false sense of security and undermines the very purpose of the assurance case.
  3. Maintenance Paralysis: Without a systematic way to flag stale evidence, re-validation efforts are often misdirected. Teams either engage in costly, unfocused re-testing of everything, or, more commonly, do nothing, allowing epistemic debt to accumulate until a failure forces a crisis.

Forces

ForceTension
Timeless Truth vs. Contextual RealityFormal proofs and logical derivations feel permanent and universal, yet the assumptions they make about the world are context-dependent and perishable.
Rigor vs. AgilityContinuously re-validating every piece of evidence is prohibitively expensive and would paralyze any agile workflow.
Transparency vs. Cognitive LoadWe need to make the "staleness" of evidence visible, but we must do so without overwhelming teams with a constant barrage of decay alerts.
Governance vs. FlexibilityThere must be a formal method for managing aging evidence, yet teams need the autonomy to make risk-informed decisions about when to accept, refresh, or deprecate it.

Solution

FPF introduces a formal freshness model and a governance loop that make evidence aging a first-class, manageable property of the assurance calculus.

The Principle of Perishable Evidence

The core of the solution is a new normative principle: Evidence is perishable. The relevance of any piece of evidence is a function of time and context. An AssuranceLevel is therefore not a permanent achievement but a state that must be actively maintained.

Mechanism 1: The Freshness Standard (valid_until)**

Every evidence carrier anchored in the Assurance Layer MUST carry a valid_until attribute.

  • valid_until: ISO-8601-date | null
  • This attribute acts as a "best before" date, explicitly stating the time horizon over which its creators consider it to be fully relevant without review.
  • A value of null signifies that the evidence is considered perpetual. This is reserved for evidence carriers such as mathematical axioms or fundamental physical laws whose validity is not expected to decay on engineering timescales.

Mechanism 2: The Epistemic Debt Metric (ED)

When the current time t surpasses an evidence carrier's valid_until date, that evidence carrier begins to accrue Epistemic Debt (ED).

  • Definition: Epistemic Debt is a quantitative measure of an evidence carrier's "staleness." It is a function of its age past its expiry date.
  • Purpose: ED is not a penalty but a signal. It makes the invisible risk of relying on old evidence visible and measurable.

Mechanism 3: The Governance Loop (Refresh / Deprecate / Waive)

Epistemic Debt is managed through a project-level epistemic_debt_budget. When the total accrued debt exceeds this budget, an alert is triggered, and the team MUST take one of three actions:

ActionWhat It MeansManager's View: The Practical Consequence
RefreshProduce new, up-to-date evidence and set a new valid_until date."We invest the resources to re-validate." This is the engineering fix: run the tests again, update the model, re-certify the component.
DeprecateAcknowledge that the evidence is no longer valid and formally downgrade the AssuranceLevel of the dependent assurance target (typically to L0 or L1)."We accept the risk by lowering the component's official status." The component is no longer considered fully assured and may be flagged for restricted use until it is refreshed.
WaiveA designated authority (e.g., a senior systems engineer or a safety officer) formally accepts the risk of using the stale evidence for a limited time."I am signing off on this risk, for now." This is a temporary, auditable override. It keeps the project moving but makes the risk acceptance explicit and assigns responsibility.

Didactic Note for Managers: Managing Your "Trust Budget"

Think of Epistemic Debt exactly like financial or technical debt. It’s not inherently evil, but it must be managed. The FPF dashboard now includes a "Trust Health" meter.

  • Green: Your evidence is fresh. Your assurance case is solid.
  • Amber: Epistemic Debt is accumulating. It's time to plan for re-validation work in the next sprint.
  • Red: Your debt has exceeded its budget. Your CI/CD pipeline might be issuing warnings, and you are now carrying un-budgeted risk. You must immediately decide: Pay it down (Refresh), write it off (Deprecate), or take out a short-term, high-visibility loan (Waive).

This loop transforms the vague problem of "keeping things up to date" into a concrete, resource-managed, and auditable engineering process.

Mechanism 4: The Epistemic Debt (ED) Calculation & Aggregation**

To make ED a useful leading indicator, it must be computed and aggregated consistently.

  • Calculation: For a single evidence carrier i, its debt at time t is a function of its age past expiry: ED_t(i) = k * max(0, t - valid_until_i)

    • The coefficient k is a configurable linear decay factor (default: 1.0 per day), allowing projects to tune the "interest rate" on their debt.
  • Aggregation: The total ED for an assurance target A is the sum of the debt from all its direct and transitive Evidence Graph Ref: ED_t(A) = Σ_i ED_t(evidence_i)

    • This rule ensures that debt propagates up the holarchy. If a foundational component's validation expires, the entire system that depends on it inherits that debt.
  • Impact on Assurance Level: When an assurance target's total ED_t(A) exceeds a defined threshold (typically > 0 unless waived), its computed AssuranceLevel is provisionally downgraded by one level. For example, an L2 assurance target with expired evidence is treated as L1 for governance and risk purposes until the debt is resolved. This makes the consequence of inaction immediate and visible on project dashboards.

Conformance Checklist

  • CC-ED.1 (Freshness Mandate): Every evidence carrier anchored via verifiedBy or validatedBy MUST include a valid_until attribute. A value of null (perpetual) MUST be justified in the evidence carrier's rationale.
  • CC-ED.2 (Debt Budget Mandate): Every project or U.System at AssuranceLevel:L1 or higher MUST declare an epistemic_debt_budget in its manifest.
  • CC-ED.3 (Aggregation Mandate): The total Epistemic Debt of a composite holon MUST be the sum of the debt of its constituent parts, consistent with the aggregation rule ED_t(S) = Σ_j ED_t(child_j).
  • CC-ED.4 (Downgrade Mandate): An assurance target with ED_t > epistemic_debt_budget SHALL have its effective AssuranceLevel provisionally downgraded until the debt is resolved via Refresh, Deprecate, or Waive.
  • CC-ED.5 (Waiver Auditability): Any Waive action MUST be recorded as a formal, auditable event, citing the responsible authority, the rationale, and a new, short-term expiry date for the waiver itself.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Perpetual Evidence" Fallacy"We verified this component five years ago, so it's still L2. It's just a simple library, nothing has changed."CC-ED.1 forces a valid_until date. The context (compiler versions, new vulnerabilities, OS updates) has certainly changed. Setting valid_until: null requires explicit justification that the evidence carrier is truly timeless, like a mathematical theorem.
The "Invisible Debt" TrapA critical component test suite has been failing silently for months, but the system dashboard is still green.CC-ED.3 ensures that the debt from the failing component's expired evidence propagates up to the system level, turning the dashboard amber or red and forcing attention.
The "Risk Acceptance by Silence""We know those tests are stale, but we're too busy to fix them. Let's just ignore the warnings for now."CC-ED.5 makes risk acceptance an explicit, auditable action. A manager must formally Waive the debt, putting their name on the decision. This transforms passive neglect into active, accountable risk management.

Consequences

BenefitsTrade-offs / Mitigations
Freshness honesty: The framework provides a transparent, quantitative way to track the erosion of trust over time, preventing "assurance rot."Process Overhead: Teams must now manage valid_until dates and respond to debt alerts. Mitigation: Tooling can automate much of this, suggesting default expiry dates based on evidence-carrier kind and providing one-click actions for the governance loop.
Risk-Informed Maintenance: Epistemic Debt becomes a leading indicator for maintenance and re-validation planning, allowing teams to allocate resources proactively, not reactively.Risk of False Positives: Overly aggressive decay coefficients (k) could create excessive noise. Mitigation: The k value is configurable, and the Waive mechanism provides a safety valve for situations where a formal refresh is not yet warranted.
Enhanced Auditability: The entire state progression of evidence—from creation to expiry and resolution—is now a traceable, auditable part of the FPF model.-

Rationale

Knowledge frameworks that ignore time degrade silently. By embedding entropy accounting (epistemic debt) directly into the assurance calculus, FPF gains a self-regulating "immune system." This pattern operationalizes the common-sense insight that evidence is perishable, transforming maintenance from an ad-hoc, often-neglected chore into a budgeted, auditable, and risk-informed engineering activity. It complements the human-centric loop of ADR-014 and the pragmatic utility guardrail of ADR-015 by ensuring that what we trust today remains trustworthy tomorrow.

Relations

  • Builds on: B.3.3 Assurance Subtypes & Levels, A.10 Evidence Graph Referring.
  • Constrains: The temporal validity of AssuranceLevel for all holons.
  • Enables: Proactive maintenance planning within the Canonical Evolution Loop (B.4) and provides a dynamic risk input for ethical and strategic decision-making (Part D).

B.3.4:End

Working-Model Relations & Grounding (CT2R-LOG)

Status: Stable Type: Pattern

At a glance. Use B.3.5 when a human-facing Working-Model relation such as ut:ComponentOf, ut:MemberOf, ut:PortionOf, or ut:AspectOf needs an assurance grounding relation without exposing constructive machinery as the public vocabulary.

Use this when. Use this pattern when a structural edge must remain readable to engineers and managers while still carrying validationMode and, for structural claims, a tv:groundedBy link to a reconstructible Compose-CAL trace.

What goes wrong if missed. The readable relation layer and the constructive proof layer collapse into each other: either authors lose usable relation names, or reviewers cannot reconstruct why a structural edge should be trusted.

What this buys. The alias-plus-grounding split: Working-Model relations stay canonical for communication, while CT2R-LOG carries the grounding channel and validation stance that E.24.UK can cite for structural U-kind admission.

Not this pattern when. Not this pattern when the current question is how to construct the trace (C.13), which mereology relation kind is intended (A.14), whether a new holon exists (B.2), or whether a candidate name deserves durable U-kindhood (E.24.UK).

One‑line summary. CT2R-LOG treats the everyday Working-Model relationsut:ComponentOf, ut:MemberOf, ut:PortionOf, ut:AspectOf —as the public relation layer for structure, while binding each published edge to a grounding trace and a declared tv:validationMode. Authors keep using a short list of relations; reviewers get reconstructible provenance.

Intent

Provide a single, human-facing family of Working-Model relations as the public relation layer, with explicit hooks for (G) grounding and (R) reliability, without exposing constructor jargon or overloading day-to-day authors.

What you get (manager/engineer view). The same relations you already know (e.g., ComponentOf) remain the public relation vocabulary.

What changes (auditor/ontologist view).

  • Each published edge carries two additional commitments:

    1. tv:groundedBy → points to a reconstructible trace (e.g., Γ_m.sum) whenever the edge is structural.
    2. validationMode ∈ {axiomatic, inferential, postulate} → declares how the author justifies the assertion.

This is the alias‑plus‑grounding split: Compose‑CAL builds the trace; CT2R‑LOG declares the alias pattern and links it; Lang‑CHR supplies the labels.

Problem Frame

B.3.5 exists where a readable Working-Model relation must remain usable by practitioners while assurance readers still need a grounding relation and declared validation stance. The EntityOfConcern is not a notation, trace file, or tool output. It is the relation-use discipline that keeps the public relation layer and assurance grounding layer distinct.

Problem

Declared sub‑relations of ut:PartOf (e.g., ComponentOf, MemberOf) are easy to use but not self‑justifying: nothing in their declaration shows why a given edge should be trusted, or how to re‑derive it if challenged. Conversely, exposing constructor traces everywhere makes the graph unreadable to non‑specialists.

We need: a stable public relation layer for relations and a mandatory, reconstructible grounding channel—plus a visible validation intent that downstream assurance can reason about.

Forces

  • Two audiences, one dial. Project managers want one relation family and stable views; ontologists want generative completeness and extensional identity.
  • Parsimony constraint. The Kernel stays minimal; construction is outside the Kernel.
  • Unification inside FPF. We already unify external vocabularies; the same discipline is applied internally so every pattern that needs mereology rides on one generative calculus and one alias façade.

Solution (thumbnail)

CT2R‑LOG introduces a two‑link discipline around each canonical edge:

  1. Alias link (concept‑level). Working‑Model relations (e.g., ut:ComponentOf) are alias patterns over a general constructional principle. Denote by tv:AliasOf.

  2. Grounding link (evidence‑level). Each edge instance carries tv:groundedBy:

    • MANDATORY for all structural edges (sub-properties of ut:StructPartOf): the target is a valid Γ_m trace from Compose-CAL (one of sum, set, slice). Set validationMode=axiomatic; postulate SHALL NOT be used for structural edges.
    • Optional for epistemic edges (e.g., ConstituentOf, RepresentationOf): if no Γ_m trace is appropriate, attach an evidence object whose admissibility is governed by the declared validationMode ∈ {inferential, postulate} (assurance rules).
  3. Validation flag (author intent). Every declared edge or aggregation rule carries tv:validationMode with one of:

    • postulate — pragmatic working claim backed by observations;
    • inferential — reasoned consequence (proof outline);
    • axiomatic — constructive grounding via a Γ_m.* composition.

F–G–R alignment. F (the published Fact): :PumpA ut:ComponentOf :Skid12. G (its Grounding): :e123 tv:groundedBy :trace_Γm_sum_456. R (declared Reliability mode): tv:validationMode=axiomatic → inputs B.3.3’s AssuranceLevel assessment.

Vocabulary & notation (normative)

  • Working-Model relations (front‑stage). ut:ComponentOf, ut:PortionOf, ut:AspectOf are publication-grade sub-properties of ut:StructPartOf (structural); ut:MemberOf is a sub-property of ut:EpiPartOf (epistemic).

  • Alias principle (lexical). tv:AliasOf links a relation type to its generative rule schema (e.g., “ComponentOf aliases the result of a Γ_m.sum with role=component”).

  • Grounding (per‑edge). tv:groundedBy on an edge instance MUST point to a Γₘ trace (sum|set|slice) for structural edges (set validationMode=axiomatic); for epistemic edges it MAY point to an evidence object or a logical proof per declared validationMode ∈ {inferential, postulate}.

  • Trace family. Γ_m.sum, Γ_m.set, Γ_m.slice are the only normative constructors for structural grounding; no temporal or workflow constructor is added here (time slices live in Sys‑CAL; parallelism via set).

  • Validation flag. tv:validationMode ∈ {postulate, inferential, axiomatic} is required on every declared edge or aggregation rule; for structural edges postulate is disallowed.

Archetypal Grounding - Running example

Story. A refinery team publishes :PumpA ut:ComponentOf :Skid12.

  • Publication — Working-Model relation layer. They mint one edge with the Working-Model relation ComponentOf and declare the published edge's U.Formality (typically F≈F3, controlled narrative). Only the Working-Model relation is visible to readers.

  • Constructive grounding (Γₘ). In the background, the edge node records tv:groundedBy :trace_Γₘ_sum_456. That trace is a Compose-CAL “sum” that lists the parts aggregated into the skid. Any auditor can replay the trace to prove extensional identity. (Grounding does not change the published edge's F; it sets validationMode=axiomatic and contributes to R in the VA lane.)

  • Assurance stance & R-lane. Because the edge is construction-backed, authors set tv:validationMode=axiomatic. B.3.3 reads the flag and assigns an AssuranceLevel in the appropriate R lane (scale defined in B.3.3). F, G, and R remain orthogonal: this move raises assurance without changing claim scope (G) or the published edge's formality (F).

  • Contrast (epistemic). When the same team asserts :MassFlowRepresentation RepresentationOf :FlowModel, they declare validationMode=postulate and attach a calibration dataset (Empirical Validation) instead of a Γₘ trace. The edge remains publishable, but reviewers record a lower-confidence stance, and B.3.4’s evidence ageing policy will decay its trust over time.

Result: one visible relation for engineers, two assurance references for reviewers.

Author Standard (at a glance)

When you add or import a relation edge:

  1. Pick a Working‑Model relation (ComponentOf/MemberOf/…); avoid raw ut:PartOf unless you are drafting meta‑level axioms.

  2. Attach tv:groundedBy:

    • Structural? → must be a Γ_m trace ID.
    • Epistemic? → Γ_m trace or evidence object.
  3. Declare tv:validationMode (postulate / inferential / axiomatic).

What managers see: nothing new in the graph picture. What auditors get: a reliable trail from every published edge back to a principled constructor or an evidence pack.

Compatibility & cross‑references

  • C.6 Proof and Inference Use Calculus (LOG‑CAL). CT2R‑LOG supplies the places to hang proofs/evidence that C.6 formalizes.
  • B.3.3 (Assurance levels). validationMode + presence/quality of tv:groundedBy are the inputs to compute AssuranceLevel (L0–L2).
  • B.3.4 (Evidence ageing). If an edge relies on postulated evidence, its confidence decays per that pattern until refreshed; axiomatic edges from Γ_m traces do not age, but their inputs (tokens) might.

Rule‑set — CT2R‑LOG (conceptual, human‑first)

Intent (one line). Make Working-Model relations the canonical relation vocabulary for authors, while providing a clean, optional bridge to formal assurance by way of aliasing and grounding semantics.

Vocabulary & Roles (what the words mean in this pattern)

  • Working-Model relation. A human-oriented statement an engineer would naturally write, using public relation kinds such as ut:ComponentOf, ut:PortionOf, ut:AspectOf, ut:MemberOf. This is the canonical public relation layer for structure for readers and reviewers in Part B. (Didactic primacy governs this choice.)

  • Assurance Layer. Three complementary assurance modes an author MAY attach:

    • Constructive grounding: a generative narrative that reconstructs the relation via the three mereological aggregators (Γ_m.sum | Γ_m.set | Γ_m.slice) from Compose‑CAL. (No formal notation is required in this pattern—only a reconstructible story of construction.)
    • Logical grounding: a reasoned chain (think KD‑CAL style arguments) that shows why the relation follows from stated premises.
    • Mapping grounding: a relation-label alignment that shows the domain label truly denotes the intended Working-Model relation (Kind-CAL / Lang-CHR stance). These three assurance modes are complementary, not exclusive.
  • Empirical Validation. How a published relation meets reality (observations, calibration scenarios). It lives beside, not inside, the relation. (See B.3 family.)

  • Grounding vocabulary (tv:).

    • tv:AliasOf — declares that a Working‑Model relation is the canonical projection of a more general pattern (its “principle of use”).
    • tv:groundedBy — points to the author’s grounding narrative (Constructive, Logical, or Mapping, as applicable). The tv: namespace is part of the Core conceptual lexicon; it is notation‑agnostic and tool‑agnostic.
  • tv:validationMode ∈ {postulate, inferential, axiomatic}. A declaration by the author of the confidence stance for a relation instance: postulate — a pragmatic working claim; inferential — a reasoned consequence; axiomatic — a constructively grounded identity (mereological extensionality is exhibited). (Modes align with the B.3 cluster’s trust model.)

Authoring note. This pattern defines meanings, not formats. The words above SHALL be used consistently and without reference to any specific notations or execution environments (Guard‑Rails: Notational Independence).

Normative rules (MUST/SHALL clauses for thinking‑and‑writing)

S‑1 (Working-Model first). Authors SHALL publish structural claims in the Working-Model form (ut:*Of relations). This is the canonical relation vocabulary for human readers and cross-disciplinary teams. Formal reconstructions are optional and live in the Assurance Layer.

S‑2 (Alias declaration). If a Working‑Model relation follows a known general principle, the author SHOULD declare tv:AliasOf <Principle>, thereby making the intended use‑pattern explicit for reviewers and future readers. (This improves comparability without introducing extra formality.)

S‑3 (Grounding by mode). For every relation instance the author MUST set validationMode and follow the corresponding grounding stance:

  • S‑3.a postulate. The author MAY omit Γ_m grounding; the relation stands as a pragmatic working claim within a stated scope. The author SHOULD supply brief empirical cues (where the claim tends to hold) to ease later validation. (Empirical Validation is tracked in B.3.)

  • S‑3.b inferential. The author SHALL outline a reasoned chain (plain‑language steps) that makes the relation a consequence of previously admitted statements. No formal calculus is required in this pattern; the outline must be sufficient for a peer to follow. (Think KD‑CAL stance, conceptually.)

  • S‑3.c axiomatic. The author SHALL provide a constructive grounding narrative that reconstructs the relation as a Γ_m.sum | Γ_m.set | Γ_m.slice composition and SHALL link it with tv:groundedBy. The narrative MUST be reconstructible by a competent peer without introducing new primitives (parsimony). (Compose‑CAL’s three aggregators are the only constructive moves assumed here.)

  • S-3.d Structural constraint. For structural edges, tv:groundedBy → Γ_m.* is REQUIRED regardless of validationMode; the postulate mode MUST NOT be used for structural mereology.

S-4 (Relation-kind sense-making).

  • For structural subtypes of ut:StructPartOf (Component/Portion/Aspect), constructive grounding (tv:groundedBy → Γ_m.*) is REQUIRED in all modes; postulate MUST NOT be used for structural mereology (see S-3.d).

  • For epistemic/constitutive links (e.g., representation, usage), constructive grounding is OPTIONAL in all stances; authors prefer inferential or postulate with empirical cues.

S‑5 (Order and time are not mereology). Authors SHALL NOT encode execution order, parallelism, or temporal slicing as part‑whole. Such concerns belong to Γ_method and Γ_time families and SHOULD appear as method/time statements adjacent to, not inside, Working‑Model structure. (This prevents conceptual leakage between planes.)

S‑6 (Unidirectional dependence). CT2R‑LOG may consume Compose‑CAL and KD‑CAL conceptually; it SHALL NOT redefine them. Meaning flows downward only (Kernel → Extention → Context → Instance).

S‑7 (Register discipline). When naming principles in tv:AliasOf, authors SHOULD use Tech/Plain twin labels where available and obey minimal‑generality and rewrite rules (LEX‑BUNDLE), so that aliases are recognisable across context of meaning.

S‑8 (No tool talk). Core prose MUST NOT introduce CI/CD terms, file formats, APIs, or machine‑oriented notations in place of concepts. If examples are needed, they MAY be plain‑language narratives or domain vignettes. (This pattern is conceptual by Standard.)

Scope & Non‑Goals (to keep the plane clean)

  • In scope. Canonical publication of relations for humans; alias‑to‑principle clarity; conceptual grounding stories; author‑declared validationMode; separation of structure vs order/time.

  • Out of scope. Any machinery that executes checks; any binding to specific notations; any process/workflow mechanics; any discussion of file formats. (Those belong to tooling publications, pedagogy publications, and companion records; they SHALL NOT be imported by the Conceptual Core.)

  • Edge placements. When a claim is chiefly about naming fit across Contexts, prefer Mapping grounding (Kind-CAL/Lang‑CHR stance). When it is chiefly about why it follows, prefer Logical grounding. When it is about what the whole is, from its parts, prefer Constructive grounding. (Authors MAY combine them.)

Author’s working moves (micro‑playbook, notation‑free)

M‑1. State the relation in Working‑Model form (e.g., “Impeller ComponentOf Pump”). M‑2. Pick validationMode:

  • If you’re sketching and exploring → choose postulate; add one‑sentence scope.
  • If you’re justifying from known statements → choose inferential; list the 2–4 steps in plain language.
  • If you require extensional identity → choose axiomatic; narrate the Γ_m.* reconstruction in a short paragraph.

M‑3. Add tv:AliasOf to the principle you intend readers to recognise (e.g., “Component = sum of parts”). M‑4. Keep order/time adjacent, not embedded: if you need “assembled in two parallel lines”, write that as a method/time statement next to the structure, not as a part‑of edge. M‑5. Stop when the reader can follow without guessing. This is the stopping rule for Quarter 2: clarity before formality. (Didactic primacy.)

Bias-Annotation (auditable, human-first)

The purpose of this section is to make typical cognitive slips visible and name the counter-moves an author or assurance reader should apply in thought—not with tools. These biases are generic; the remedies point to neighboring FPF guard-rails and patterns.

Bias (name)Symptom in the modelCognitive counter‑move (conceptual only)Where to check
Formalism captureTreating a constructive trace as “the real thing” and the human relation (e.g., ComponentOf) as an optional label.Re‑assert canonical‑first: the Working‑Model relation is the canonical publication. A constructive trace is a grounding you may attach when assurance demands it. Choose a validationMode explicitly.CC‑CT2R‑1, CC‑CT2R‑2; B.3 skeleton for assurance conservatism.
Canonical inversionDemanding a constructive grounding for epistemic claims by default. (For structural claims, Constructive grounding is mandatory; epistemic remains progressive.)Keep progressive assurance: declare validationMode ∈ {postulate, inferential, axiomatic}; reserve axiomatic with Constructive grounding for structural; use Logical/Mapping/Empirical where appropriate. Express formality via F (C.2.3), not tiers.CC-CT2R-2; B.3.3 relation-kind discipline & validation modes.
Order/time leakageEncoding sequence or phase as part‑whole edges.Apply Strict Distinction: order/time belong to Γ_method and Γ_time, not to mereology or CT2R relations.B.3 “keep order/time in their own lanes”; cross‑ref Γ_ctx/Γ_time.
Notation lock‑inLetting a diagram or syntax define the meaning (“it’s true because the diagram says so”).Enforce Notational Independence: meaning is defined in prose/maths; renderings are illustrative only.Part E guard‑rail on notational independence.
Congruence blindnessComposing strong parts through weak mappings without acknowledging the fit penalty.Make edge‑fit first‑class: reason about Congruence Level (CL) on connections; penalise low fit conceptually.B.3 universal aggregation skeleton (Φ(CL)); anti‑patterns list.
Collection/composition swapUsing MemberOf to stand in for PartOf (or vice versa), then carrying over reliability as if it were a structural sum.Re‑separate MemberOf (collections) from part‑whole mereology; read A.14 notes in Γ_epist context.Γ_epist context / A.14 compliance.
DesignRunTag chimeraMixing design‑time and run‑time evidence into one “assurance” line.Split the scope of the claim: S ∈ {design, run}; compare side‑by‑side rather than merging.B.3 typed claim tuple & anti‑pattern “DesignRunTag chimera”.

Reader reminder. Bias audit is a reading aid. It never licenses tooling talk in Core; use the guard‑rails in Part E to keep semantics primacy and unidirectional dependence of layers.

Conformance Checklist (normative, author-facing)

The following obligations regulate how to think and write CT2R content. They are notation‑agnostic and purely conceptual.

IDRequirementPurpose
CC-CT2R-1 (Canonical-first).A relation published for readers SHALL be stated in Working-Model terms (ut:*Of) as the canonical form; any constructive or logical justification is recorded as grounding (not as the definition).Preserve human-first canon and didactic primacy.
CC‑CT2R‑2 (Mode declaration).For every declarative relation or rule, the author SHALL declare tv:validationMode ∈ {postulate, inferential, axiomatic} in prose (no silent defaults).Make assurance intent explicit and auditable by reading.
CC‑CT2R‑3 (Structural axiomatic grounding).If the relation is structural (a subtype of ut:StructPartOf) and the author chooses axiomatic, they SHALL provide a grounding narrative that can be reconstructed as one of the Γ_m aggregators (sum, set, slice).Tie high‑assurance claims to constructive identity without tool mandates.
CC‑CT2R‑4 (No order/time in parts).Authors SHALL NOT encode order (Serial/Parallel) or phase/time as part‑whole relations; handle them via Γ_method / Γ_time when relevant to the claim.Maintain the structure/order/time firewall.
CC‑CT2R‑5 (Collection vs part).Authors SHALL keep MemberOf (collections) distinct from PartOf (structure) and refrain from carrying reliability as if membership implied structural composition.Prevent category errors flagged in B.3 anti‑patterns.
CC‑CT2R‑6 (Fit is explicit).Where mappings or alignments matter, the author SHALL reason about fit explicitly (Congruence Level, conceptually) and acknowledge that weak fit reduces the effective reliability of any composed claim.Keep integration quality first‑class.
CC‑CT2R‑7 (Notational independence).Core meaning MUST NOT hinge on any specific diagram or syntax; illustrative renderings, if present, are labelled informative.Ensure longevity and cross‑discipline portability.
CC‑CT2R‑8 (Layer direction).Grounding flows downwards from Working‑Model to Assurance layers (Mapping/Logical/Constructive). Authors SHALL avoid back‑defining the canonical relation by its Mapping, Logical, Constructive, or Empirical grounding.Preserve unidirectional dependence of layers.
CC‑CT2R‑9 (Scope split).When assurance is discussed, authors SHALL state the typed claim and scope S ∈ {design, run} and keep them distinct in reasoning.Prevent DesignRunTag chimeras.

Common Anti-Patterns and How to Avoid Them

Anti-patternWhat goes wrongRepair
Constructive-trace replacementA Gamma_m trace is treated as the public relation, so engineers lose the readable Working-Model edge.Keep the Working-Model relation canonical and attach the trace only as grounding.
Unchecked relation labelA familiar part-whole label is published without naming the intended relation kind or validation mode.Declare the Working-Model relation, validationMode, and the grounding or evidence relation that makes the edge reviewable.
Order/time leakageAssembly sequence, phase, or parallel work is encoded as a part-whole edge.Keep order, method, and temporal claims adjacent to the structural edge; do not turn them into mereology.
Assurance by notationA diagram, graph display, or data format is treated as if it made the relation true.Treat representations as publication forms; keep the relation claim, grounding relation, and validation mode explicit.

Consequences (benefits, trade-offs, mitigations)

Benefits

  • Cognitive clarity for authors and readers. By making Working‑Model relations canonical and keeping formal bases as optional groundings, CT2R reduces the barrier to disciplined reasoning while preserving a path to higher assurance when necessary. This honours the B.3 family's “few characteristics, conservative aggregation” ethos and keeps order/time outside of structure.
  • Progressive assurance without tooling commitments. The postulate → inferential → axiomatic assurance-posture progression lets teams raise assurance deliberately, matching their context and risk, in line with B.3.3’s maturity logic.
  • Explicit fit management. Treating edge‑fit (CL) as a first‑class concern prevents silent over‑confidence: weak mappings visibly cap reliability of composed claims.
  • Cleaner separation of concerns. Distinguishing collections from compositions and keeping sequence/time in Γ_method and Γ_time prevents recurrent category errors and preserves Γ‑algebra reviewability.

Trade‑offs & mitigations

  • Extra prose discipline. Declaring validationMode and writing a short grounding narrative (when axiomatic) adds authoring effort. Mitigation: reuse local templates; keep narratives concise and Γ_m‑oriented by idea rather than notation.
  • Temptation to stay “forever postulate.” Teams may stop at Working‑Model relations. Mitigation: use B.3.3’s subtypes/levels as a planning aid to decide where axiomatic or inferential grounding is worth the cost.
  • Perceived conservatism. Acknowledging weak fit (CL) may lower effective reliability of otherwise strong parts. Mitigation: treat CL as a guide to improvement (reconcile terms, align units, verify declared links) rather than a punishment.

One‑line takeaway for managers. CT2R lets you talk in natural, domain‑meaningful relations while preserving a clear, optional path to formal grounding and empirical checking—so confidence can grow deliberately without dragging your model into tooling or syntax.

Rationale (informative)

13.1 Why canonical‑first? CT2R-LOG treats the human-readable, task-appropriate relation (e.g., ut:ComponentOf) as the canonical publication form because that is what engineers and managers actually use to reason, decide, and communicate. The formal layers ground that form; they do not replace it. This is consistent with the authoring Standard in Part E (pattern template and style guide), which privileges clarity, purpose and didactics over premature formalism in the body text. Authors write for people first, then point to the kind of assurance they are invoking.

13.2 Why two tv: links—and why concept‑only? tv:AliasOf and tv:groundedBy name conceptual bridges between a Working‑Model relation and its assurance. They are not mandates for any particular notational scheme; they are mental handles that keep authors honest about what grounds their claims (constructive, logical, mapping) and when that grounding is expected to be present. This honours the Notational Independence guard‑rail in Part E: we adopt concepts and obligations, not file formats or tool Standards, in the normative text.

13.3 Why a triad of validationMode? The triad {postulate, inferential, axiomatic} expresses staged formality compatible with the FPF stance on staged assurance: start with what the team can responsibly claim now, then move to stricter justification where risk or context demands it. That gives reviewers a shared vocabulary for the declared assurance posture of a claim without changing the canonical relation itself.

13.4 Why keep order/time out of mereology? CT2R‑LOG aligns with A.14’s firewall: structure (parthood) is distinct from order and temporal coverage. The former is published as ut:StructPartOf sub‑relations; the latter live in Γ_method / Γ_time and must not be smuggled into part‑trees. This separation avoids classic modelling failures (temporal smearing, pseudo‑components for quantities) and keeps reasoning crisp across the Γ‑family.

13.5 Why point to Γ_m.sum | set | slice (Compose‑CAL) for constructive grounding? Three constructive moves—sum, set, slice—are sufficient to narrative‑rebuild all structural trees while preserving extensional identity. When an author selects the axiomatic stance, a brief grounding narrative can always be told in those terms, without expanding the kernel or inventing bespoke constructors. This satisfies parsimony (C‑5) and keeps formal power outside the kernel, in a calculus.

13.6 Why mental obligations rather than process mandates? Part E requires that patterns govern thinking and authoring; enforcement and automation, if any, are external concerns. CT2R‑LOG therefore states obligations as self‑contained cognitive checks: declare your mode; tell the constructive story only when you claim axiomatic strength; keep order/time in their places. This keeps the core specification evergreen and tool‑agnostic, as required.

SoTA-Echoing

Constructive mereology, assurance-case practice, and model-based engineering all separate a readable working statement from the justification that supports it. B.3.5 carries that separation into FPF: relation names remain usable at the publication layer, while grounding and validation mode preserve the constructive or evidential basis needed for assurance.

Relations

Builds onA.14 Advanced Mereology — structural catalogue and the firewall that excludes roles/recipes and distinguishes Portion/Phase/Component/Constituent; CT2R‑LOG preserves these distinctions at publication time. • A.11 Ontological Parsimony (C‑5) — constructive grounding lives in a calculus; the kernel remains minimal. • B.1 Universal Γ — shared invariants and the placement of order/time in their respective Γ‑flavours. • Part E authoring rules — canonical pattern template and notational independence, which CT2R‑LOG explicitly follows.

Coordinates withCompose-CAL (Γ_m) — provides the constructive shoulder of the Assurance layer for structural relations; CT2R-LOG’s tv:groundedBy points conceptually to traces narratable as sum/set/slice. • KD‑CAL — provides the logical shoulder (inferential justification) when authors pick validationMode = inferential. • Kind-CAL / Lang-CHR — provide the mapping shoulder (kind and relation-label alignment) governing alias policies without altering Working-Model relations.

Constrained byNotational Independence (E.5.2) — CT2R‑LOG refuses to prescribe formats, keeping all obligations conceptual.

Specialises / feedsB.3 with B.3.3 and B.3.4 — supplies the publication discipline (Working-Model relations, declared relation kind and validationMode; F per C.2.3 where relevant) that B.3’s trust calculus expects; interacts with ageing and assurance-level assessments without changing the relations themselves.

Non‑relations No introduction of order/time — CT2R‑LOG does not define SerialStepOf / ParallelFactorOf / temporal phases; method structure and work ordering belong to A.3, A.15, and B.1.5, while physical or temporal system claims go to C.1 Sys‑CAL, C.27, or the direct temporal governing pattern when current.

B.3.5:End

Canonical Evolution Loop

Status: Stable Type: Pattern

Use this when. Use this pattern when a U.System or U.Episteme changes across design-time and run-time scopes and the project must keep observation, refinement, evidence, and renewed operation connected.

What goes wrong if missed. Teams treat drift, learning, release, and improvement as separate events; specifications become stale, operational surprises lose their evidence relation, and changes appear without a responsible transformer or a recoverable basis.

What this buys. A compact evolution loop that keeps the holon under change, the acting-side transformer, the design-time episteme, the run-time occurrence, and the evidence relation in one reviewable structure.

Not this pattern when. Not this pattern when the current question is only relation grounding (B.3.5), early cue stabilization (B.4.1), abductive hypothesis work (B.5.2.0), temporal status (C.27), or method/work alignment without a holon-evolution claim (A.15).

Problem Frame

The FPF is built on the Principle of Open-Ended Evolution (P-10). This is not merely a philosophical stance, but a pragmatic recognition that a useful holon, whether a physical U.System or a knowledge-bearing U.Episteme, can change under continuing contact with evidence, use, and context. A static model is a dead model when the project keeps relying on it after the situation changes. The framework therefore requires a shared evolution loop for holons. Methods, work plans, and work occurrences participate through method descriptions, work use, and evidence relations; they are not treated as holons by default.

Problem

Without a canonical, shared model for evolution, projects fall into predictable and costly failure modes:

  1. Design-Reality Divergence (The "Drift"): The run-time holon-in-operation (the "as-is") slowly drifts away from its design-time specification (the "as-intended"). Over time, the formal models become elegant fictions, assurance cases become irrelevant, and the team loses the ability to reason reliably about their own creation.
  2. Learning Stagnation (The "Ivory Tower"): Valuable insights are generated by observing a holon's performance in its context, but there is no formal method to feed this learning back into the design. "Lessons learned" are captured in static documents that are never acted upon.
  3. Chaotic Change (The "Whack-a-Mole"): "Improvements" are made in an ad-hoc, reactive manner. Each change is a patch, not a principled refinement. This introduces hidden dependencies and unintended consequences, often making the holon more fragile over time.

Forces

ForceTension
Stability vs. ChangeHow to evolve a holon continuously while maintaining its core identity and assurance guarantees.
Learning vs. OperatingHow to balance the need for a holon to be stable in its operational context with the need to gather data and learn from its performance.
Top-Down Intent vs. Bottom-Up RealityHow to reconcile strategic, top-down refinement goals with emergent, bottom-up feedback from operational reality.

Solution

FPF defines the Canonical Evolution Loop, a four-phase cycle that serves as the universal engine for all principled, open-ended evolution. This loop is a direct implementation of the Explore → Shape → Evidence → Operate state machine (Pattern B.5.1) and is powered by the Canonical Reasoning Cycle (Pattern B.5).

The loop creates a closed, auditable circuit between the two temporal scopes. Crucially, transitions between phases are performed by an external acting-side holder under TransformerRole@Context (Pattern A.12). A holon does not evolve itself; it is evolved by an external holder acting upon it.

A diagram showing a cycle: Operate (Run-time) → Observe (Run-time to Design-time bridge, performed by a Transformer) → Refine (Design-time) → Deploy (Design-time to Run-time bridge, performed by a Transformer) → Operate.

The Four Phases of the Loop:

PhaseCore ActivityRole of the External TransformerKey FPF Patterns Used
1. OperateThe holon exists in its run-time context, fulfilling its purpose.The Transformer observes the holon. It does not act on it, but gathers data about its performance or state. For a U.System, this could be a sensor. For a U.Episteme, this could be a researcher applying the theory and noting its predictions.A.4 Temporal Duality
2. ObserveThe Transformer compares the observed reality with an expected model, identifying an anomaly or an opportunity. This is the bridge from run-time back to design-time.The Transformer generates a new insight. Based on the observation, the Transformer (e.g., the research team, an automated analysis system) formulates a new hypothesis about how to improve the holon.B.5.2 Abductive Loop, A.10 Evidence Graph Referring
3. RefineThe design-time model of the holon is updated by the Transformer. A new hypothesis is shaped (Deduction) and tested against evidence (Induction).The Transformer modifies the blueprint. It alters the design-time episteme—the specification, the theory, the source code—to incorporate the new insight.B.5 Canonical Reasoning Cycle, B.3 Trust & Assurance Calculus
4. DeployThe Transformer instantiates the refined design-time model as a new run-time version of the holon. This is the bridge that carries improvements from the blueprint back into the real world.The Transformer builds and releases the new version. This could be a compiler building new software, a 3D printer creating a new physical part, or an editor publishing a revised version of a scientific paper.A.3 Transformer Constitution, A.4 Temporal Duality

Didactic Note: The "Learn and Adapt" engine

The Canonical Evolution Loop is a formal account of repeated adaptation. It keeps four durable questions explicit:

  1. Operate: "What is the holon doing in use or in the field?"
  2. Observe: "What anomaly, opportunity, or mismatch is now visible to a responsible Transformer?"
  3. Refine: "What design-time change would better fit what has been observed?"
  4. Deploy: "How is that refined design-time content instantiated back into run-time reality?"

The point is not managerial uplift. The point is to keep adaptation legible: every refinement has an observed basis, an external Transformer, and an auditable return from design-time into run-time.

Archetypal Grounding

The Canonical Evolution Loop is universal. It applies identically to the evolution of physical systems, bodies of knowledge, and operational methods. The following sub-patterns show how the loop becomes more explicit in neighbouring patterns.

  • B.4.1 - Observe -> Notice -> Stabilize -> Route (pre-abductive seam):

    • Context: A fleet of autonomous delivery drones (U.System) is in operation, and operators begin to notice that winter deliveries feel "off" before a clean anomaly statement exists.
    • Loop Example:
      1. Operate: The drones perform deliveries.
      2. Observe: A monitoring service (Transformer) and operators notice recurring cold-weather battery strain, but the evidence still has low articulation.
      3. Stabilize: The team publishes a U.PreArticulationCuePack that preserves the cue nucleus, the primary witness traces, and the current language-state position without pretending that a final anomaly or action record already exists.
      4. Route: The team publishes a RoutedCueSet that keeps multiple admissible continuations visible (for example, battery-chemistry investigation versus route-planning adjustment) so that endpoint governing patterns can take over without losing the early signal.
  • Knowledge-instantiation slice (theory refinement loop):

    • Context: A scientific theory of protein folding (U.Episteme) is being used to predict structures.
    • Loop Example:
      1. Operate: The theory exists and is applied by researchers.
      2. Observe: A research lab (Transformer) discovers a new class of proteins whose structure the theory fails to predict (an anomaly). They publish this finding.
      3. Refine: Another research team (Transformer) revises the original theory, adding a new term to its equations (design-time model) that accounts for the new protein class.
      4. Deploy: The team (Transformer) publishes the revised theory in a journal. The scientific community begins to use the new version. Note. The chart and any CG‑frame readings derived from this episteme MUST cite the updated MethodDescription (per A.19.CN CC‑A19.D1‑3) to keep comparability auditable.

    Adaptive-specialization note. Knowledge instantiation for one declared task family SHALL name the prior basis being refined from, the named work-measure threshold being pursued, the adaptation budget being spent, and the freshness or provenance basis for claiming the specialization is reusable. If the refinement is claimed as one specialization step, it SHALL also cite the declared TaskFamily or TaskSignature anchor consumed by C.22.1, G.5, and G.9. This keeps the refinement legible as contextual task-family specialization rather than vague general capability growth.

  • Method-instantiation slice (adaptive method loop):

    • Context: A field-maintenance organization uses a declared inspection-and-repair method (U.Method).
    • Loop Example:
      1. Operate: Teams execute the current method during each maintenance cycle.
      2. Observe: A review lead (Transformer) notes that the time from fault detection to safe restoration is repeatedly exceeding the allowed window (an anomaly).
      3. Refine: The method stewards (Transformer) revise the design-time method description by adding an earlier isolation step and a clearer classification checkpoint.
      4. Deploy: The revised method description is adopted for the next maintenance cycle. Note. Method evolution MUST be recorded as Γ_method composition over U.Method (design‑time) and separated from U.Work (run‑time), with design-rationale references attached (per A.4/B.1.5).

    Adaptive-specialization note. Method instantiation for one declared task family SHALL name the narrower higher-fit specialist method or specialist portfolio being activated, the refinement budget being spent, the escalation or commit checkpoints, and the fallback when that method fails. If the method update is being used as evidence of specialization, the note SHALL keep the bearer of that specialization explicit: the holder, dyad, team, or scoped portfolio carries the claim; the method is only one selected vehicle. This keeps method evolution reviewable as bounded specialist acquisition rather than as hidden budget inflation.

Bias-Annotation

BiasSymptomCorrection
Self-evolution biasThe holon is said to observe, refine, or deploy itself, so the acting-side transformer disappears.Name the external holder acting under TransformerRole@Context, even when that holder is an automated system.
Design-time/run-time smearA live operational change is treated as if it had already updated the design-time episteme, or a design-time edit is treated as if it had already changed the holon in operation.Keep the design-time episteme, run-time holon occurrence, deploy relation, and evidence relation distinct.
Method-as-holon shortcutA method update is described as if the method itself were the evolving holon.Treat the method through U.Method, method description, work use, and evidence relations; use B.4 only when a holon-evolution claim is live.

Conformance Checklist

  • CC-B4.1 (Loop Integrity): Any evolutionary change to a holon MUST be documented as a full traversal of the four-phase loop. Ad-hoc changes that bypass a phase (e.g., deploying a refinement without a documented observation and evidence phase) are a process violation.
  • CC-B4.2 (Temporal Scope Mandate): The Refine phase MUST operate on design-time epistemes such as specifications, theories, source code, or method descriptions, while the Operate phase involves the run-time holon-in-operation. The Observe and Deploy phases are the only permissible bridges between these scopes.
  • CC-B4.3 (Transformer Mandate): The Observe, Refine, and Deploy transitions MUST be performed by an explicitly identified external Transformer (Pattern A.12). A holon cannot observe, refine, or deploy itself.
  • CC-B4.4 (Adaptive-specialization anchoring): When the knowledge-instantiation or method-instantiation slice carries a bounded-specialization claim, that claim MUST name the declared TaskFamily or TaskSignature, the work-measure threshold target, the adaptation budget, and the freshness or provenance basis for reuse.
  • CC-B4.5 (Adaptive-specialization boundary): The knowledge-instantiation and method-instantiation slices SHALL NOT silently re-govern selector or parity semantics. If transfer, retention, downstream exploitation efficiency, corridor entry, or downside cost are comparison-relevant, the pattern-local note MUST leave those fields recoverable by the downstream C.22.1, G.5, and G.9 governing patterns.

Common Anti-Patterns and How to Avoid Them

Anti-PatternObservable symptomHow FPF Prevents It (Conceptually)
The "Immaculate Conception"A new feature or design "just appears" in the specification, with no record of the problem it was meant to solve.CC-B4.1 and CC-B4.3 mandate that every refinement must start with an Observe phase, performed by a named Transformer. There is no change without a documented observation and an agent who made it.
The "Self-Healing Illusion"The model claims "the system automatically improves itself" without specifying the mechanism.CC-B4.3 forbids self-evolution. The model must explicitly show an external Transformer (which could be an automated control loop, but is still modeled as external to the holon being changed) that performs the Observe-Refine-Deploy cycle.
The "Run-time Edit"An engineer makes a "quick fix" directly on a live system without updating the official design documents.CC-B4.2 enforces that all refinements happen in design-time. A "hotfix" is conceptually an emergency, accelerated run through the entire loop: the fix is observed, designed, and then deployed.

Consequences

BenefitsTrade-offs / Mitigations
Creates a "Learning Architecture": The loop provides a formal, repeatable structure for continuous improvement and adaptation, making the organization's learning process explicit.Record overhead: Documenting each phase of the loop can feel bureaucratic for small, rapid changes. Mitigation: keep the local evolution note lightweight. The key is to capture the changed holon, observed basis, acting-side transformer, design-time refinement, deploy relation, and renewed run-time scope.
Ensures Design-Reality Sync: The loop guarantees that design-time specifications and run-time realities are continuously reconciled, preventing divergence and maintaining a "living" assurance case.-
Makes Evolution Auditable: The evolution history of a holon, including every refinement and the rationale behind it, becomes a traceable, auditable record performed by named Transformers.-

Rationale

This pattern operationalizes the Open-Ended Evolution Principle (P-10) by providing its core engine. It keeps design-time refinement, run-time observation, the acting-side Transformer, and the changed holon distinct, so adaptation does not become a vague story that the system or theory "evolved by itself."

SoTA-Echoing

The loop echoes proven iterative cycles like the Deming Cycle (Plan-Do-Check-Act) and the OODA Loop (Observe-Orient-Decide-Act), but it enriches them with the strong semantic distinctions of the FPF, such as design-time vs. run-time and the formal role of the external Transformer.

By making the Transformer's role explicit in every phase, the pattern avoids the common conceptual error of treating systems or theories as if they evolve on their own. Evolution is always an action performed by an agent on a holon. This rigorous, externalist stance is critical for clear causal reasoning and auditable accountability. By making this loop canonical, FPF ensures that all holons within its ecosystem are not just designed and built, but are designed to be evolved in a principled, traceable manner.

Relations

  • Implements: P-10 Open-Ended Evolution, A.4 Temporal Duality.
  • Orchestrates: B.5 Canonical Reasoning Cycle (provides the cognitive engine for the Observe and Refine phases) and B.3 Trust & Assurance Calculus (provides the metrics for the Evidence sub-phase).
  • Is detailed by: B.4.1 Observe -> Notice -> Stabilize -> Route for early cue routing, together with B.4.x instantiation patterns for specific holon families.

Pre-abductive seam compatibility

For early language-state routing, Observe does not have to jump directly into anomaly or hypothesis forms. Observe may publish U.PreArticulationCuePack and a RoutedCueSet via B.4.1, after which downstream loops consume that routed cue publication directly or a downstream typed publication such as U.AbductivePrompt, as appropriate.

B.4:End

Observe -> Notice -> Stabilize -> Route

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

Plain-name. Observe-to-route seam.

Problem frame

Observation rarely yields a ready anomaly, A.6.A invitation, or hypothesis in one step. Between low-articulation cue preservation and endpoint governance through governing patterns, the cluster needs one explicit route-bearing seam that can publish route plurality or route selection without pretending that the cue already belongs to a governing pattern.

That seam begins after U.PreArticulationCuePack. Cue preservation may exist before routing. B.4.1 begins only when route publication itself becomes worth making explicit.

Problem

Without a pre-abductive seam, early cue publications are either lost, prematurely forced into late forms such as AnomalyStatement, Characteristic, ActionOption, or requirement language, or they smuggle route selection into cue-pack prose with no explicit route-governing pattern.

Forces

ForceTension
Early capture vs endpoint disciplinePreserve low-articulation cues without collapsing route discipline.
Plural route set vs explicit selectionPermit multiple candidate routes while still requiring an explicit selection record when selection occurs.
Seam clarity vs new-type inflationAdd a real seam without creating an uncontrolled zoo of new publication kinds.
Form vs face precisionKeep route-bearing publication form distinct from the MVPK face on which it is rendered.

Solution

Insert a pre-abductive route-bearing seam inside the language-state cluster, between observation/cue preservation and endpoint governing-pattern entries:

Observe -> Notice -> Stabilize -> Route

The seam yields a RoutedCueSet, normally downstream of U.PreArticulationCuePack.

RoutedCueSet shape

A conforming routed cue set may publish:

  • sourceCuePackRef
  • candidateRouteSet
  • routeDecision?
  • selectedRoute?
  • routeRationale?
  • routeAuthorityState?
  • multiRoutePolicy?
  • publicationFaceRefs?
  • articulationThresholdStatus?
  • closureStatus?
  • scope?
  • GammaTime?

RoutedCueSet is not itself the late endpoint. articulationThresholdStatus and closureStatus report guard state only; their governance remains with C.2.4 and C.2.5, and route discrimination may additionally cite C.2.6 or C.2.7 when anchoring or representation-factor differences are load-bearing.

candidateRouteSet and routeDecision are the load-bearing core here. selectedRoute, routeRationale, and routeAuthorityState belong here when route selection is explicit. They do not belong in U.PreArticulationCuePack.

publicationFaceRefs names MVPK faces only when face typing matters for publication or review. Faces are renderings of the routed cue set or of later typed projection publications; they are not the route-bearing form itself.

A multi-route RoutedCueSet is still one governed member. A lineage fork appears only after distinct successor publications are issued.

Starter route family and conditional extension species

The candidate route set may contain, among others:

  • starter canonical routes:
    • EvaluativeRoute
    • ActionInvitationRoute
    • ProblemAbductionRoute
    • MethodWorkRoute
    • RequirementCommitmentRoute
  • conditional extension routes for bounded specialization or corridor discovery:
    • TaskFamilySpecializationRoute
    • AdaptationProbeRoute
    • NonHumanUtilityRoute
    • SubstrateDiversificationRoute
Specialization-sensitive extension route family

These four routes are not part of the starter canonical core. Use them only when the cue already carries explicit bounded-specialization pressure, corridor-entry pressure, or substrate-fit doubt that governing patterns must be able to recover by value.

Use TaskFamilySpecializationRoute when the cue points toward acquiring one narrower higher-fit specialist lane for one declared task family under budget, where that lane may later resolve into one specialist method, portfolio, or competence bundle. Use AdaptationProbeRoute when the honest next question is whether threshold-reaching specialization is actually attainable under the current budget. Use NonHumanUtilityRoute when the cue suggests a promising utility target outside the current human-default solution corridor but still tied to one declared task family or utility target. Use SubstrateDiversificationRoute when the cue says the current method substrate may be too narrow and a broader or different substrate should be tested before commitment.

Contexts may refine the route family locally, but they shall keep the distinction between early route publication and endpoint governance.

Projection discipline

Here projection names route-bounded partialization, not a rival governing pattern and not a face kind. The resulting publication must be a typed publication form rendered, when needed, on an existing MVPK face.

A routed cue set may therefore lead to:

  • U.AbductivePrompt under B.5.2.0,
  • a later typed endpoint-entry publication under A.6.P, A.6.A, or C.16.Q,
  • or another explicitly typed upstream projection publication.

If no typed downstream publication form can yet be named honestly, stay in RoutedCueSet rather than hiding a pseudo-form behind face language.

Archetypal Grounding

Tell. Observation alone is not yet routing. A route requires at least a stabilized cue plus a declared candidate route set.

Show (System). An operator alarm may route toward intervention, rollback, or anomaly investigation without yet becoming work or a requirement.

Show (Episteme). An inquiry cue about a model-vs-observation discrepancy may route toward anomaly framing, opportunity framing, or probe design before a hypothesis exists.

Bias-Annotation

The pattern favors preserving low-articulation cues and publishing route plurality explicitly. The counter-bias is explicit as well: routing must still state why one route is live and why one route was selected if selection occurred.

Conformance Checklist

  • CC-B.4.1-1 Observe output SHALL NOT be forced directly into AnomalyStatement when articulation threshold is not yet met.
  • CC-B.4.1-2 A routed cue set SHALL name its candidateRouteSet.
  • CC-B.4.1-3 When route selection occurs, routeDecision, selectedRoute, and routeRationale SHALL be explicit.
  • CC-B.4.1-4 publicationFaceRefs MAY be named, but route-bearing form and publication face SHALL NOT be collapsed.
  • CC-B.4.1-5 RoutedCueSet SHALL NOT silently masquerade as a late endpoint governing pattern.
  • CC-B.4.1-6 When a specialization-sensitive route is kept live, the route package SHALL name the declared task family or utility target, the current budget window if known, the missing discriminator still needed, and the downstream governing pattern that would become admissible if the discriminator is satisfied.

Common Anti-Patterns and How to Avoid Them

  • Anomaly inflation. Treat every early cue as already an anomaly statement.
  • Cue-pack route smuggling. Hide route decision or route rationale upstream in U.PreArticulationCuePack.
  • False single-route certainty. Pretend one route is obvious when multiple candidate routes are still live.
  • Projection capture. Treat a typed downstream projection publication or its MVPK face as if it already governed the endpoint family.

Consequences

The benefit is an admissible early seam for language-state trajectories and a cleaner bridge from cue preservation to later patterns. The trade-off is one more explicit publication form and one more explicit route declaration.

Rationale

B.4.1 provides the route-bearing seam between cue preservation and endpoint or abductive entry. It keeps route publication explicit without forcing cue packs to become route records.

SoTA-Echoing

This matches practice in incident triage, exploratory design, model probing, and embodied cue work, where routing follows stabilization rather than appearing fully formed at first observation.

Relations

  • Builds on: B.4, C.2.2a, A.16, A.16.1, C.2.LS.
  • Coordinates with: A.16.0, C.2.4, C.2.5, C.2.6, C.2.7, B.5.2.0, B.5.2, A.6.P, A.6.A, C.16.Q, A.15, F.9.1.
  • Constrains: pre-abductive route publication.

Worked Route Sets

Multi-route operator case

An operator alert note about a service disturbance may admissibly publish a route set containing:

  • ActionInvitationRoute,
  • ProblemAbductionRoute,
  • and RequirementCommitmentRoute.

At this stage the point is not to collapse the routes into one winner, but to keep the plurality explicit until a selected route is justified.

Inquiry case

A conceptual mismatch may route simultaneously toward:

  • explanatory inquiry,
  • probe design,
  • and later lexical repair.

This is admissible only if the route rationale makes the plurality explicit rather than hiding it under vague prose.

Invalid direct jump

It is invalid to treat a routed cue set as if it were already a hypothesis, a gate, or a work plan. It is a route-bearing publication form, not the endpoint governing pattern.

Specialization-route and nonhuman-utility split

A routed cue set for a new task family may admissibly keep ProblemAbductionRoute, TaskFamilySpecializationRoute, and NonHumanUtilityRoute live together. The point is to preserve the declared task family, utility target, current budget window, missing discriminator, and possible corridor-entry load without laundering those routes into a premature prompt, selector, or policy choice.

Keeping route plurality useful

A routed cue set stays useful only when route plurality, route grounds, and current authority remain explicit without turning the seam into one hidden endpoint.

Minimal route package

A robust route package should identify:

  • the originating cue pack,
  • the candidate route set,
  • the route decision state,
  • the selected route, if any,
  • the grounds for each live route,
  • the conditions that would change route ranking,
  • and any typed downstream publication already published.

This is enough to keep later handoff reviewable without collapsing the seam into an endpoint governing pattern.

For specialization-sensitive routes, the package should also make explicit the declared task family or utility target, the current budget window, the missing discriminator still needed, and the downstream governing pattern that would become admissible if that discriminator is satisfied.

Selected route is not endpoint governance

Even when one route is selected, the routed cue set remains a seam publication form until a governing pattern is entered explicitly.

Review prompt and threshold reminder

A reviewer should check whether the selected route is justified by the published cue pack and whether suppressed alternative routes were genuinely considered rather than silently erased. If the articulation threshold is not yet met, keep the publication early rather than laundering it into a late prompt, requirement, or work governing pattern.

Deferred selection and route splitting

Deferral is admissible when route plurality and missing discriminators are published. It is not admissible when one route is silently assumed while the publication still speaks as if the question were open.

One cue cluster may also split into several routed cue sets if different sub-cues support different destinations. The split should be published explicitly so that later readers do not assume that one route exhausted the whole original cue complex.

Migration and worked continuation boundaries

B.4.1 governs route publication, not abductive reasoning, lexical repair, deontic commitment, or work execution. Those belong to governing patterns once the next publication is explicit enough to carry them.

Migration from anomaly-first prose

Older anomaly-first language should be migrated into route publication when the publication does not yet meet anomaly-governance entry conditions.

Intervention vs inquiry split

An operator-facing disturbance may legitimately support both:

  • an immediate intervention-oriented route,
  • and a slower explanatory route.

B.4.1 preserves both without forcing one to swallow the other.

Requirement-route overreach

A route set that includes RequirementCommitmentRoute should not be read as if the requirement already exists. The route is only one admissible continuation unless a later requirement governing pattern is actually entered.

Leaving the seam

The routed cue set should leave this pattern only when one later publication is already explicit enough to own the next governed use, for example:

  • explicit evaluative family selection for C.16.Q,
  • explicit A.6.A family selection,
  • explicit prompt question for B.5.2.0,
  • explicit requirement or commitment head for requirement-facing governing patterns,
  • or explicit A.15 hook for method, work-plan, or work-occurrence use.

If those next-governing-pattern conditions cannot yet be stated honestly, the governed publication still belongs in the seam and should keep its route plurality visible.

Route Evidence and Discrimination Package

Evidence-per-route rule

Each live route in a routed cue set should cite the cue grounds that actually support it. If a route has no published grounds, it is not a live route; it is only a private guess.

Discriminator publication

When a route set remains plural, authors should name the discriminator they are waiting for: a missing anchor, contrast, measurement, witness, articulation threshold, closure condition, or other explicit facet transition. Doing so makes deferred selection informative instead of merely indecisive.

Multi-route state is not yet a lineage fork

One routed cue set may keep several candidate routes live without yet forking lineage. A fork occurs only when distinct successor publications are actually issued and acquire their own authority, losses, or handoff semantics.

Projection restraint

A typed downstream projection publication or prompt may be shown as one admissible continuation, but it shall not dominate the routed cue set so much that the other routes become unreadable. Projection is guidance, not covert governing-pattern replacement.

Review test for false single-route certainty

Ask: if the selected route were denied, would the publication still contain enough information to explain the other live routes and the discriminator that would separate them? If not, the route set is under-published and has collapsed too early into one favored continuation.

B.4.1:End

Canonical Reasoning Cycle

Problem Frame

While preceding patterns define the anatomy of trust (Assurance Levels in B.3) and the structure of holons (A.1, A.14), they do not specify the cognitive "engine" that drives the creation and evolution of knowledge within FPF. A framework for thinking must provide more than just a filing system for conclusions; it must offer a repeatable, rigorous method for arriving at them, especially when confronting novel, complex, or ill-defined problems.

Problem

Without a formal, shared reasoning cycle, teams and individuals fall into predictable cognitive traps that stall progress and hide risks:

  1. Analysis Paralysis: Teams get stuck endlessly debating existing assumptions, running deductions within a closed world of known facts without a mechanism to introduce genuinely new ideas.
  2. Blind Empiricism: Teams engage in unstructured, expensive trial-and-error, running tests and gathering data (induction) without a clear, falsifiable hypothesis to guide their efforts.
  3. Innovation Gap: In the face of a problem where existing knowledge is insufficient, there is no formal "permission" or process to generate a creative, plausible guess—the essential first step of any breakthrough.

These pathologies lead to wasted resources, circular debates, and a failure to solve the very problems that require first-principles thinking.

Forces

ForceTension
Rigor vs. InnovationHow can we encourage creative, "out-of-the-box" hypotheses while maintaining formal discipline and verifiability?
Certainty vs. ProgressHow can we act and learn systematically when faced with incomplete information and uncertainty?
Theory vs. PracticeHow do we ensure that abstract models and formal deductions are continuously anchored to real-world evidence and empirical validation?
Systematic FlowHow do we transform problem-solving from a chaotic, ad-hoc art into a repeatable, auditable, and teachable science?

Solution

FPF establishes the Abductive–Deductive–Inductive Loop as its canonical reasoning cycle. This cycle gives formal primacy to abduction (hypothesis generation) as the engine of innovation, while using deduction and induction as the rigorous mechanisms for testing and refining those hypotheses.

The loop consists of three distinct, sequential phases:

Abduction (Hypothesis Generation)

  • Core Question: "What is the most plausible new explanation or solution?"
  • Description: This is the creative, inventive leap. When faced with an anomaly, a design challenge, or an unanswered question, the first step is to propose a new U.Episteme—a new requirement, a new component, a new causal link—that might solve the problem. This act is not guaranteed to be correct; it is a conjecture. Within FPF, this new, untested hypothesis episteme typically begins its life at AssuranceLevel:L0 (Unsubstantiated). Abduction is the only phase that introduces genuinely novel ideas into the model. This formalizes the process described in the Abductive Loop (Pattern B.5.2).

Deduction (Consequence Derivation)

  • Core Question: "If this hypothesis is true, what logically follows?"
  • Description: This is the phase of rigorous analysis. Given the new hypothesis, we use the formal models and calculi of FPF to deduce its logical consequences. What are its testable predictions? Does it create internal contradictions with other parts of the model? How does it propagate through the system? This phase aligns with Verification Assurance (VA) and is concerned with raising the hypothesis episteme's FormalVerifiabilityScore (FV). Deduction turns a plausible idea into a set of precise, falsifiable claims.

Induction (Empirical Evaluation)

  • Core Question: "Do the predicted consequences match reality?"
  • Description: This is the phase of testing and learning from evidence. The predictions derived in the deductive phase are compared against real-world data from experiments, simulations, or observations. This phase aligns with Validation Assurance (LA) and is the primary mechanism for raising the hypothesis episteme's EmpiricalValidabilityScore (EV) and, consequently, its Reliability (R). A successful test corroborates the hypothesis (raising its AssuranceLevel), while a failed test (a refutation) provides critical new information that feeds back into the next abductive cycle.

Didactic Note for Managers: The "Propose → Analyze → Test" Cycle

The Abductive-Deductive-Inductive loop is not an abstract philosophical concept; it is the formal name for the problem-solving cycle that all successful R&D and engineering teams instinctively use.

PhaseSimple NameWhat Your Team DoesFPF's Contribution
AbductionProposeBrainstorms a new feature, architecture, or fix.Gives formal permission for this creative step and a place to record the new hypothesis episteme (L0).

| Deduction | Analyze | Thinks through the implications, runs simulations, checks for conflicts. | Provides the formal models (VA, FV) to make this analysis rigorous and repeatable. | | Induction | Test | Builds a prototype, runs A/B tests, gathers user feedback. | Provides the framework (LA, EV, R) to measure the results and build an auditable evidence base. |

By making this cycle explicit, FPF transforms problem-solving from a chaotic art into a repeatable, auditable science. It gives teams a shared map for navigating from an unknown problem to a validated solution.

Conformance Checklist

To ensure the reasoning cycle is applied consistently and rigorously, the following criteria are normative:

  • CC-B5.1 (Abductive Primacy): Any discipline that introduces a new, non-derivable claim or design element into a working model MUST document it as an abductive step. The resulting claim or design element SHALL initially be assigned AssuranceLevel:L0 as a hypothesis episteme or equivalent working-model element.
  • CC-B5.2 (Deductive Mandate): An abductively generated hypothesis SHALL NOT be subjected to inductive testing (Validation Assurance) until its key logical consequences have been derived and documented through a deductive process.
  • CC-B5.3 (Inductive Grounding): A claim SHALL NOT be promoted to AssuranceLevel:L1 or higher on the basis of a successful inductive test unless that test is explicitly linked to a prediction derived in the deductive phase.
  • CC-B5.4 (Cycle Closure): The outcome of an inductive test (whether corroboration or refutation) MUST be formally recorded as an evidence carrier (Pattern A.10), and that evidence carrier MUST be used as an input for the next iteration of the reasoning cycle.
  • CC-B5.5 (State Machine Alignment): The Abductive–Deductive–Inductive Loop is the cognitive engine that drives state transitions in the Explore → Shape → Evidence → Operate state machine (Pattern B.5.1). Abduction dominates the Explore phase; Deduction dominates the Shape phase; and Induction is the core of the Evidence phase.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Solution in Search of a Problem"A team builds a technically impressive feature (deduction/induction) but cannot clearly state what user problem it solves.CC-B5.1 forces the process to start with an abductive hypothesis that is explicitly framed as a solution to a stated problem or anomaly.
The "Ready, Fire, Aim" ApproachA team jumps directly from an idea to expensive prototyping and testing, without a clear model of what they expect to happen.CC-B5.2 mandates a deductive analysis phase before inductive testing. This ensures that every test is designed to confirm or refute a specific, well-defined prediction.
The "Data Dredging" ExerciseA team gathers massive amounts of data and looks for correlations, hoping a solution will emerge.The cycle requires a hypothesis first. Data is gathered to test that hypothesis, not in the hope of stumbling upon one. This makes the process more focused and cost-effective.

Consequences

BenefitsTrade-offs / Mitigations
Encourages Innovation: By formally sanctioning abduction, the framework creates a safe and structured space for creative problem-solving and the introduction of novel ideas.Abduction is not algorithmic: The framework cannot tell you how to generate a good hypothesis. Mitigation: It provides the structure to capture and test hypotheses, and can be used in conjunction with creative methodologies (e.g., TRIZ, design thinking) that specialize in hypothesis generation.
Improves Problem-Solving Efficiency: The cycle provides a clear, repeatable workflow that prevents teams from getting stuck in analysis paralysis or wasting resources on unfocused testing. It ensures that effort is always directed toward falsifying or corroborating a clear claim.Requires Iterative Mindset: The cycle is inherently iterative. Teams must be prepared for hypotheses to be refuted and for the need to restart the cycle. Mitigation: FPF's architecture (e.g., cheap state transitions) is designed to make this iteration low-cost.
Creates a Transparent Rationale: The cycle produces a complete, auditable trail of how a solution was developed: which hypotheses were proposed, what their consequences were, and how they fared against empirical evidence. This "intellectual provenance" is invaluable for future maintenance, audits, and learning.-
Aligns with Scientific and Engineering Best Practices: The cycle is a formalization of the scientific method (conjecture and refutation) and modern engineering design cycles (e.g., Deming's PDCA loop).-

Rationale

FPF is designed to be an "operating system for thought," and this reasoning cycle is its central processing unit. By elevating abduction to a first-class citizen, FPF acknowledges a fundamental truth about complex problem-solving: progress does not come from simply rearranging known facts (deduction) or finding patterns in data (induction). It comes from the creative act of proposing a new way of seeing the world—a new hypothesis. Deduction and induction are the indispensable tools we use to discipline and validate this creativity.

This pattern provides the engine that drives a hypothesis episteme through the AssuranceLevels progression. An abductive leap creates an L0 hypothesis episteme. Deduction begins the process of providing Verification Assurance, building its FV score. Induction provides the Validation Assurance, building its EV and R scores. Without this cycle, the assurance framework would be a static scoring system; with it, it becomes a dynamic model of knowledge growth.

Relations

  • Integrates: B.5.1 Explore → Shape → Evidence → Operate, B.5.2 Abductive Loop.
  • Drives: The progression through B.3.3 Assurance Subtypes & Levels.
  • Enables: The refinement phase of the B.4 Canonical Evolution Loop.
  • Operationalizes: The core FPF mission of transforming ideas into reliable, evidence-backed holons.

B.5:End

Explore → Shape → Evidence → Operate

Problem Frame

Every successful innovation, from a new piece of software to a scientific theory, follows a recognizable development state cycle. It begins as a fuzzy idea, is gradually given a clear structure, is tested against reality, and finally, is put into operational use. Without a shared state-cycle model, teams often get stuck: developers might endlessly refine a structure without testing it, while analysts might gather evidence for an idea that has not yet been clearly defined.

Problem

How do we provide a simple, universal state machine that guides a U.Episteme or U.System from a raw concept to a reliable, operational holon? This pattern defines the four canonical states of this journey, providing a clear roadmap for teams and a stable framework for project management.

Solution

FPF defines a four-state development cycle model for any U.Episteme or U.System under development. That episteme or system transitions from one state to the next as it accumulates rigor and evidence. This state machine is driven by the Canonical Reasoning Cycle (Pattern B.5).

The Four Development States:

StateCore ActivityManager's View: What It MeansDriven by Phase of Reasoning CycleTypical AssuranceLevel
1. ExplorationGenerating possibilities. The focus is on brainstorming, questioning assumptions, and generating multiple, often competing, hypotheses."We are in the 'what if' phase. All ideas are on the table. We are looking for a plausible path forward."Abduction (Pattern B.5.2)L0
2. ShapingDefining a single, coherent form. The most promising hypothesis from the exploration phase is selected and given a rigorous, internally consistent structure."We've chosen our direction. Now we are building the blueprint, defining the architecture, and ensuring all the pieces fit together logically."DeductionL0L1 (if formalization counts as TA)
3. EvidenceTesting against reality. The shaped episteme or system is subjected to rigorous empirical or formal tests to validate its claims and measure its performance."The blueprint is done. Now we are at the proving ground. Does it actually work? We are running the tests and gathering the data."InductionL1L2
4. OperationDeploying and monitoring in a live environment. The validated episteme or system is put into production, where it performs its intended function and is monitored for ongoing reliability."It's live. The system is in service, delivering value, and we are monitoring its health and performance."Continuous Induction (Monitoring)L2 (maintained)

Didactic Note for Managers: Aligning States with Your Project Plan

This state machine is not an abstract theory; it maps directly to the familiar phases of any well-run project.

  • Exploration is your R&D or initial discovery sprint.
  • Shaping is your design and architecture phase.
  • Evidence is your QA, testing, and V&V phase.
  • Operation is the live deployment and maintenance phase.

By using these four states, you can instantly communicate to your team and stakeholders exactly where the episteme or system is in its state transition, what the current focus is, and what needs to happen to move to the next stage.

Conformance Checklist

  • CC-B5.1.1 (State Explicitness): Every state-bearing U.Episteme or U.System in a project MUST be tagged with its current state from the set {Exploration, Shaping, Evidence, Operation}.
  • CC-B5.1.2 (Sequential Progression): A state-bearing U.Episteme or U.System SHALL progress through the states in sequence. Skipping a state (e.g., moving directly from Exploration to Evidence without Shaping) is a process violation and must be explicitly justified in the evidence carrier's rationale.
  • CC-B5.1.3 (Reasoning Cycle Alignment): The transition between states MUST be triggered by the completion of the corresponding phase of the Canonical Reasoning Cycle (Pattern B.5). For example, the transition from Shaping to Evidence requires the completion of the deductive analysis.

Consequences

BenefitsTrade-offs / Mitigations
Clear Project Visibility: The state machine provides a simple, shared language for tracking the maturity of every state-bearing episteme or system in a project.Risk of Bureaucracy: If applied too rigidly, the state machine could feel like a waterfall process. Mitigation: The cycle is meant to be rapid and iterative. A single episteme or system might cycle through all four states within a single sprint. The goal is clarity, not ceremony.
Improved Focus: Each state has a clear primary activity, which helps teams focus their efforts and avoid common pitfalls like premature optimization or untested designs.-
Reduces "It's Done" Ambiguity: The states provide a precise definition of "done" for each phase. An episteme or system is not "done" with Shaping until its structure is coherent and its consequences are deduced.-

Rationale

This pattern operationalizes the Principle of State Explicitness (P-9). By giving every state-bearing episteme or system a clear, unambiguous state, FPF transforms the often-chaotic process of innovation into a structured, manageable, and auditable development cycle. This state machine provides the "scaffolding" upon which the more detailed cognitive work of the Canonical Reasoning Cycle is performed, ensuring that every idea is systematically guided from a speculative guess to a reliable operational reality.

Relations

  • Is driven by: B.5 Canonical Reasoning Cycle.
  • Organizes the progression of: B.3.3 Assurance Subtypes & Levels.
  • Provides the states for: B.4 Canonical Evolution Loop.

B.5.1:End

Abductive Loop

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

Plain-name. Abductive loop.

Builds on. B.5 Canonical Reasoning Cycle, B.5.1 Exploration, B.5.2.0 U.AbductivePrompt, A.10, B.3.3.

Coordinates with. B.4.1 Observe-Notice-Stabilize-Route for pre-abductive routing, A.16 for admissible language-state moves, A.6.P for lexical repair before hypothesis publication, and C.16.Q / A.6.A when the initiating publication face or cue is evaluative or action-inviting rather than explanatory.

Problem frame

The Canonical Reasoning Cycle begins with abduction: the disciplined proposal of a candidate explanation, model, or conjecture that could account for a declared prompt. In practice this phase is often treated either as opaque inspiration or as unstructured ideation. Neither framing is bounded or auditable enough for FPF. The framework needs an entry discipline that is broad enough to admit real inquiry starts and narrow enough to keep the resulting hypothesis auditable.

Problem

Without an explicit abductive pattern:

  1. Inquiry stalls at surprise. A team encounters an anomaly, opportunity, or probe pressure but has no admissible next action for producing a candidate hypothesis.
  2. Origin is lost. Once a conjecture appears, the initiating prompt, rival candidates, and early plausibility grounds disappear from the record.
  3. Candidate space collapses too early. The first plausible-seeming explanation is treated as the explanation, even though alternatives were never exposed.
  4. Selection becomes opaque. A chosen conjecture moves downstream without a visible record of why it outranked alternatives.
  5. Untestable hypotheses survive too long. A candidate that cannot guide deduction, probe design, or evidence gathering is still treated as if it had earned progression.

Forces

ForceTension
Generativity vs disciplineThe loop must admit non-deductive candidate generation without making arbitrary guesses look admissible.
Breadth vs typed entryAbduction should begin from more than anomaly alone, but not from any untyped prose fragment.
Rival diversity vs decision pressureSeveral candidates should remain visible long enough to compare them, while still allowing one prime hypothesis to progress.
Speed vs traceabilityThe loop must be light enough for repeated use but explicit enough to preserve provenance and later review.
Plausibility vs evidenceA candidate may be worth pursuing before evidence is strong, but it still needs explicit plausibility grounds.

Solution - Structured abductive micro-cycle

B.5.2 defines abduction as a typed, iterative micro-cycle that begins from an admissible U.AbductivePrompt, expands a candidate set, filters that set by explicit plausibility criteria, and publishes one selected conjecture as a new U.Episteme with AssuranceLevel:L0.

Nature of abduction in FPF

In FPF, abduction is inference to a presently most plausible candidate explanation or solution under a declared prompt. It is neither arbitrary guessing nor hidden inspiration. The output is not yet an established result; it is a disciplined conjecture prepared for downstream deduction, testing, or refinement.

Four-step micro-cycle

StepCore activityRequired publication outcome
1. Frame the promptState the initiating U.AbductivePrompt precisely enough that the unexplained contrast, opportunity, or probe pressure is explicit.A prompt record with open question, scope notes, and provenance.
2. Generate candidate hypothesesProduce multiple candidate conjectures that could resolve the prompt.A visible candidate set, even if lightweight.
3. Apply plausibility filtersCompare candidates against explicit plausibility criteria.A short rationale that records why some candidates remain live and others are rejected.
4. Select and publish the prime hypothesisChoose one candidate for downstream work and instantiate it as a hypothesis-bearing episteme.A new U.Episteme at AssuranceLevel:L0, linked back to the prompt and selection rationale.

The loop is intentionally iterable. A selected prime hypothesis may later be replaced, narrowed, or reopened if deduction, probe work, or evidence reveals a better rival.

Entry discipline via U.AbductivePrompt

AnomalyStatement remains a canonical prompt species, but it is not the only one. B.5.2 also accepts the broader prompt species governed by B.5.2.0, such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt. This broadens entry without dissolving type discipline.

Plausibility filters

The filtering step is local and context-sensitive, but the criteria used SHALL be explicit. Typical filters include:

  • Parsimony. Does the candidate introduce only the additional structure that the prompt requires?
  • Explanatory reach. How much of the prompt does the candidate actually account for?
  • Consistency with established constraints. Does the candidate avoid collision with already trusted pillars, mechanisms, or scope declarations?
  • Falsifiability / probeability. Does the candidate create an admissible next check, deduction, contrast, or evidence-acquisition relation?
  • Scope fit. Is the candidate framed for the declared prompt scope rather than for an inflated or shifted target?

No one filter is universally decisive. The pattern only requires that at least two filters be declared when a prime hypothesis is selected.

Archetypal Grounding

Tell. Abduction is not "a flash of insight." It is the governed passage from a typed prompt to a candidate conjecture through explicit rival generation and plausibility comparison.

Show (System). An operations team sees a recurring latency spike that existing method explanations do not cover. They publish an AnomalyStatement, generate rival causes, filter them by consistency with current telemetry and mechanism knowledge, and publish one prime conjecture as an L0 hypothesis for downstream checking.

Show (Episteme). A research group notices that two accepted results no longer fit together under one framing. It publishes a ProbeCuePrompt, enumerates several rival explanatory reframings, rejects the ones that fail scope fit or would not generate decisive probes, and advances one candidate explanation as the next working hypothesis.

Bias-Annotation

This pattern biases authors toward visible candidate plurality, explicit plausibility criteria, and persistent prompt provenance. That bias is intentional. B.5.2 would rather keep early conjectures slightly over-exposed than let their origin and selection grounds disappear.

Conformance Checklist

  • CC-B.5.2-1 Every abductive run SHALL begin from a declared U.AbductivePrompt; arbitrary prose fragments are not sufficient prompt-entry forms.
  • CC-B.5.2-2 A conforming abductive run SHALL record at least one rival candidate alongside any selected prime hypothesis, unless the author explicitly justifies why no rival candidate was available.
  • CC-B.5.2-3 Selection of a prime hypothesis SHALL cite at least two explicit plausibility filters.
  • CC-B.5.2-4 The selected prime hypothesis SHALL be published as a new U.Episteme with AssuranceLevel:L0.
  • CC-B.5.2-5 The prime hypothesis record SHALL preserve a link to the initiating prompt and to the filtering rationale that justified selection.
  • CC-B.5.2-6 A hypothesis that cannot support any downstream deduction, probe design, or evidence-acquisition relation SHALL NOT be presented as a conforming abductive result.

Common Anti-Patterns and How to Avoid Them

Anti-patternWhat it looks likeHow FPF prevents it
Authority candidateOne favored conjecture is advanced immediately, with no rival set and no explicit filtering.CC-B.5.2-2 and CC-B.5.2-3 require candidate plurality and visible plausibility grounds.
Untestable grand conjectureThe candidate sounds deep or comprehensive, but it creates no admissible next step for checking, probing, or deduction.CC-B.5.2-6 rejects prime hypotheses that cannot open a downstream checking, probing, deduction, or evidence-acquisition relation.
Prompt amnesiaA later reader can see the conjecture but not the initiating anomaly, opportunity, or probe pressure.CC-B.5.2-1 and CC-B.5.2-5 keep prompt provenance attached.
Symptom patchingThe selected candidate only redescribes a visible symptom and leaves the actual prompt unresolved.The explicit plausibility filter for explanatory reach forces the candidate to be compared against the whole prompt.

Consequences

BenefitTrade-off / Mitigation
Disciplined generativity. Abduction stays inventive without collapsing into formless conjecturing.Requires explicit prompt and filter publication; mitigation: the required record can remain lightweight.
Traceable hypothesis origin. Later review can reconstruct why a conjecture entered the reasoning cycle.Adds a small provenance-support load; mitigation: reuse prompt and candidate-set notes from adjacent patterns.
Cleaner downstream use. Deduction and evidence work begin from an AssuranceLevel:L0 U.Episteme publication with explicit scope and rationale.Some early conjectures will be rejected sooner; that is a feature, not a defect.
Admissible reopening. Rival candidates can be revisited when later work undermines the selected prime hypothesis.Demands editorial discipline so that abandoned rivals remain legible rather than silently vanishing.

Rationale

The Canonical Reasoning Cycle needs a disciplined beginning that is neither over-formalized nor mystical. B.5.2 supplies that beginning. It keeps hypothesis generation explicit, connects it to typed prompt publications, and prepares the output for later assurance work without pretending that early plausibility is already evidence.

SoTA-Echoing

Contemporary inquiry practice in science, engineering, design, and diagnosis treats candidate generation as iterative and contrast-driven rather than singular and opaque. The pattern aligns with that practice, but keeps the representation lightweight: explicit prompts, visible rival candidates, and local plausibility grounds instead of heavyweight ideation machinery.

Relations

  • Is the first reasoning phase within: B.5 Canonical Reasoning Cycle.
  • Typically operates during: B.5.1 Exploration.
  • Consumes: U.AbductivePrompt publications from B.5.2.0, often reached through B.4.1 and A.16.
  • Produces: hypothesis-bearing U.Episteme publications at AssuranceLevel:L0.
  • Provides inputs for: downstream deduction, probe design, and evidence acquisition in the reasoning cycle.

Prompt-entry broadening via U.AbductivePrompt

Older wording that makes AnomalyStatement the exclusive entry form is superseded. B.5.2 accepts U.AbductivePrompt, where AnomalyStatement remains one canonical species alongside cue-derived prompt species such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt.

Prompt, Candidate, and Hypothesis Package Discipline

The abductive loop stays auditable only if the three main publication forms remain distinct: the prompt, the candidate set, and the selected prime hypothesis. Collapsing them into one paragraph is one of the main reasons later review cannot reconstruct what actually happened.

Prompt package

A conforming prompt package should make explicit:

  • the prompt species (AnomalyStatement, ProblemCuePrompt, OpportunityCuePrompt, or ProbeCuePrompt),
  • the open question that makes abduction necessary,
  • the declared scope under which the question is being posed,
  • the witnesses or provenance cues that made the prompt worth preserving,
  • and the reason the current model is insufficient.

If the initiating publication is still primarily evaluative, action-inviting, or lexically overloaded, it should first be repaired by the relevant A.6 family before it is treated as a stable abductive prompt. B.5.2 assumes typed entry, not raw lexical ambiguity.

Candidate-set note

A candidate-set note is the minimal record that preserves rival plurality. It need not be heavy, but it should make visible:

  • candidate identifiers or short names,
  • the differentiating claim each candidate adds,
  • the principal plausibility supports and liabilities of each candidate,
  • whether the candidate remains live, is deferred, or is rejected,
  • and what missing evidence or probe would best discriminate among the remaining rivals.

The important point is not bureaucratic completeness. The important point is to prevent retrospective rewriting in which the surviving candidate is made to look as if it had been the only serious option from the beginning.

Prime-hypothesis record

A selected prime hypothesis should preserve more than the hypothesis sentence itself. A conforming L0 hypothesis record should name:

  • the selected candidate,
  • the prompt it answers,
  • the filters under which it outranked rivals,
  • the scope within which it is being advanced,
  • the next admissible downstream use (deduction, probe design, targeted evidence acquisition, or explicit reopening criteria),
  • and any known fragilities already visible at selection time.

This is how B.5.2 stays connected to the rest of the reasoning cycle. The abductive loop does not merely emit an idea; it emits a conjecture with explicit downstream-use terms.

Admissible Transitions, Abort Paths, and Reopening

The abductive loop is iterative, but it is not formless. Several transition cases need explicit handling so that later stages know whether they are receiving a stable L0 conjecture, a deferred candidate, or a prompt that should be reopened rather than forced forward.

Relation to B.4.1 and A.16

B.4.1 and A.16 often supply the pre-abductive seam. They help preserve and stabilize upstream publications, including route-bearing publication forms when those forms are explicitly governed, before the publication is fit for explicit conjecture. B.5.2 begins only once the current publication is ready to function as an abductive prompt. This boundary matters because it prevents two opposite errors:

  • premature abduction, where a low-articulation cue is treated as if it had already earned hypothesis form;
  • delayed abduction, where a now-stable prompt is kept indefinitely in early cue form even though rival conjectures should already be compared.

Abort, defer, and split cases

Not every abductive run should end in a prime hypothesis. Three non-selection outcomes are admissible:

  1. Abort. The prompt dissolves because the initiating anomaly or opportunity was misread, duplicated, or already answered elsewhere.
  2. Defer. Several candidates remain live, but the discriminating evidence or probe is not yet available. The loop pauses without pretending a winner exists.
  3. Split. The original prompt turns out to contain several distinct questions. The run should fork into several narrower prompts rather than select one over-broad conjecture.

These outcomes are not failures. They are part of keeping abduction honest.

Reopening and rival reinstatement

A prime hypothesis may later lose support under deduction, probe results, or new evidence. When that happens, B.5.2 prefers explicit reopening to silent replacement.

A conforming reopening note should identify:

  • which prior prime hypothesis is being reopened,
  • whether a stored rival is being reinstated or a new candidate is entering,
  • what change in evidence, scope, or internal contradiction triggered the reopening,
  • and whether the original prompt itself has changed or only the candidate ranking has changed.

This allows the reasoning cycle to keep continuity without pretending that the earlier abductive choice had never been made.

Scope discipline during iteration

Abductive drift often comes from silent scope expansion. A conjecture first framed for one target slice quietly becomes a universal explanation. B.5.2 therefore expects scope discipline to remain explicit during iteration. If a candidate requires a broader or narrower scope than the prompt originally declared, that scope move should be stated rather than smuggled in under the rhetoric of a "better explanation."

Worked Examples

Service degradation diagnosis

A service team notices recurring latency spikes during one operating window. The prompt species is AnomalyStatement: why does latency spike in the evening batch window despite unchanged nominal load?

The candidate set includes:

  • queue saturation in one downstream dependency,
  • a time-window interaction with backup traffic,
  • and a recent mechanism regression in cache invalidation.

The prime hypothesis is not selected because it sounds most familiar. It is selected because it best fits the observed window, remains consistent with known mechanism declarations, and generates a concrete next probe: isolate backup traffic and compare the latency shape against prior windows. The resulting conjecture becomes an L0 hypothesis with one explicit evidence-acquisition relation.

Opportunity-driven materials inquiry

A research group sees an opportunity rather than a failure: a new fabrication method appears to create a micro-structure with useful thermal behavior. The prompt species is OpportunityCuePrompt rather than anomaly.

Candidate hypotheses include:

  • the effect is caused by surface geometry,
  • it is caused by composition gradients,
  • or it is an effect of one measurement regime.

The selected prime hypothesis is the geometry explanation because it explains more of the initial observations and yields a cleaner discriminating experiment. The loop shows why opportunity-driven abduction still needs rival tracking; without it, attractive novelty language would substitute for hypothesis discipline.

Probe-driven theory repair

A theory-maintenance group identifies a probe-worthy mismatch between two accepted claims. The prompt species is ProbeCuePrompt: what changed assumption would allow these two claims to coexist without contradiction?

The candidate set includes:

  • hidden scope restriction on the first claim,
  • mistaken invariance assumption in the second,
  • and a more general missing mediating construct.

The selected prime hypothesis is the mediating construct, but the scope-restriction candidate remains stored as a live rival because it could still outperform if later deductions fail. This example illustrates why B.5.2 tracks the rival set rather than only the currently favored conjecture.

Authoring and Review Guidance

For abductive-publication authors

Authors should treat the abductive loop as a selection discipline, not as a prose genre. The minimal questions are:

  • what is the prompt,
  • what rival candidates were seriously considered,
  • why is one candidate currently the best live conjecture,
  • and what downstream use could expose that selection as right or wrong?

If those answers cannot be given, the publication is probably not yet at B.5.2 and should return to prompt-shaping or lexical repair.

For hypothesis reviewers

Hypothesis reviewers should not ask only whether the chosen hypothesis looks plausible. They should also ask:

  • whether the prompt was typed in an admissible way,
  • whether at least one real rival was preserved,
  • whether the filters named at selection time actually discriminate among candidates,
  • whether the selected hypothesis has a credible downstream test, deduction, or evidence-acquisition relation,
  • and whether any scope inflation occurred during selection.

A polished hypothesis with no visible rivals is usually less trustworthy than a rougher hypothesis whose rival space is explicit.

For integrators and assurance leads

Integrators should remember that L0 is still early assurance. B.5.2 supplies disciplined conjectures, not corroborated claims. Its value is that it exposes where deduction, method design, and evidence acquisition should now concentrate. Assurance leads therefore should preserve the prompt link and the filter rationale rather than flattening the conjecture into a decontextualized work item.

Migration and Boundary Notes

Migration from anomaly monopoly

Older wording that says abduction begins only from anomaly should be rewritten into the broader but still typed claim: abduction begins from an admissible U.AbductivePrompt, of which anomaly is one canonical species.

Migration from inspiration rhetoric

Legacy prose that describes abduction as a flash, leap, or raw creative moment may remain as didactic metaphor, but it should not be used as the operational description of the pattern. The operational core is typed prompt -> rival set -> plausibility filtering -> prime hypothesis publication.

Boundary to deduction and evidence

B.5.2 ends when one conjecture is published as a prime L0 hypothesis or when the run is explicitly aborted, deferred, or split. Deduction, evidence acquisition, and later assurance do not belong to the abductive loop itself, even though the loop must prepare a clear downstream-use boundary for them.

B.5.2:End

U.AbductivePrompt

Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative

Plain-name. Abductive prompt.

Use this when. Use this pattern when a stabilized cue, opportunity, probe need, or anomaly must enter abduction as a typed question-bearing publication form rather than as an already chosen hypothesis.

What goes wrong if missed. A cue is forced into anomaly form, an opportunity is treated as a hypothesis, or a prompt-like sentence silently smuggles in the preferred answer before rival hypotheses can be compared.

What this buys. A small admission form for abduction: prompt species, open question, scope, and provenance stay explicit while the downstream abductive loop remains free to compare rival answers.

Not this pattern when. Not this pattern when the object is still a raw cue (B.4.1), a language-state threshold claim (C.2.4, C.2.5), a chosen hypothesis (B.5.2), or a selector decision about methods, substrates, or portfolios.

Kind and publication-form boundary

U.AbductivePrompt is a dependent durable publication-form value under episteme publication and abductive entry, not a root U-kind. Its identity is the typed prompt form that may seed B.5.2 after cue preservation, routing, and language-state threshold checks. A cue, routing note, anomaly sentence, candidate hypothesis, or local prompt label does not become U.AbductivePrompt unless the prompt species, open question, scope, and provenance required by this pattern are present.

Problem frame

B.5.2 needs an entry form that can accept admissible language-state trajectories after cue preservation and routing, without pretending that anomaly is the only admissible starting form.

Problem

If anomaly is the only admissible input, pre-anomaly opportunity cues and route-derived prompt forms are excluded or misrepresented. If anything can enter, abduction loses its typed starting discipline.

Forces

ForceTension
Breadth vs disciplineAdmit more than anomaly, but keep a bounded family of admissible prompt species.
Reuse vs type inflationIntroduce a clean entry form without exploding the number of heavy publication kinds.
Prompt vs hypothesisKeep the initiating prompt distinct from the downstream abductive outcome.

Solution

U.AbductivePrompt is a narrow family head for the prompt forms that may admissibly seed B.5.2 after admissible cue preservation and governing-pattern selection under A.16, A.16.1, and B.4.1. A.16.0 is used only when the cue-to-prompt history itself has governance value as an explicit trajectory account. When rendered, a prompt uses ordinary MVPK faces; prompt status is a property of the publication form, not a rival face ontology.

Starter canonical species and conditional extension species

  • starter canonical species:
    • AnomalyStatement
    • ProblemCuePrompt
    • OpportunityCuePrompt
    • ProbeCuePrompt
  • conditional extension species:
    • TaskFamilySpecializationPrompt
    • AdaptationProbePrompt
    • NonHumanUtilityPrompt
    • SubstrateDiversificationPrompt
Specialization-sensitive prompt species

These extension species are admissible only when cue provenance or trajectory account already carries the bounded-specialization evidence requirement by value; they are not the starter canonical entry set for ordinary abduction.

TaskFamilySpecializationPrompt asks what narrower higher-fit specialist option should be acquired for the declared task family, where that option may resolve into one specialist method, portfolio, or competence bundle. AdaptationProbePrompt asks which bounded probe would most cheaply reveal whether threshold-reaching specialization is actually attainable. NonHumanUtilityPrompt asks whether a low-human-overlap approach may still satisfy the declared utility target better than the current familiar repertoire. SubstrateDiversificationPrompt asks whether the current substrate is too narrow and a broader or different substrate should be tested before commitment.

Core shape

A conforming abductive prompt may publish:

  • promptSpecies
  • motivatingCueRef?
  • openQuestion
  • contrastSet?
  • scope?
  • witnessRefs?
  • routeProvenance?
  • GammaTime?

A prompt is not yet a hypothesis. Prompt admission usually presupposes articulation high enough to publish a stable open question and closure low enough that rival answers remain live; those articulation and closure thresholds remain governed by C.2.4 and C.2.5, typically reached through cue or route provenance from A.16.1 and B.4.1. It is the initiating publication form that licenses entry into the abductive loop.

Boundary rule

U.AbductivePrompt is an entry form, not an excuse to let arbitrary prose count as abductive input. Only declared prompt species may enter B.5.2 through this form.

Archetypal Grounding

Tell. An anomaly is one prompt species, not the only one.

Show (System). A control cue may begin probe-design abduction even before it is framed as anomaly.

Show (Episteme). A promising mismatch can begin an opportunity-style abductive prompt rather than only a problem statement.

Bias-Annotation

The pattern broadens the entry form to abduction, but still keeps it typed and auditable.

Conformance Checklist

  • CC-B.5.2.0-1 Every U.AbductivePrompt SHALL declare its prompt species.
  • CC-B.5.2.0-2 A prompt SHALL NOT be confused with a finished hypothesis.
  • CC-B.5.2.0-3 Cue-derived prompts SHOULD preserve route provenance.
  • CC-B.5.2.0-4 Prompt publication SHALL include the open question that makes abduction appropriate.
  • CC-B.5.2.0-5 A publication that already fixes the answer or suppresses plausible rivals SHALL NOT remain in prompt status.
  • CC-B.5.2.0-6 When a specialization-sensitive prompt species is used, the prompt package SHALL make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, and the route or cue provenance that made the prompt admissible.

Common Anti-Patterns and How to Avoid Them

  • Prompt equals hypothesis. Keep the prompt distinct from the abductive output.
  • Anything can begin abduction. No: only declared prompt species can.
  • Route amnesia. A cue-derived prompt loses the early route provenance that explains why it entered here.

Consequences

The benefit is cleaner, less brittle abduction-entry terms. The trade-off is one additional explicit prompt family head and one more declared publication form.

Rationale

This keeps admissible cue preservation and trajectory publication able to dock into B.5.2 through a typed prompt form without anomaly inflation and without making A.16.0 mandatory.

SoTA-Echoing

The pattern reflects real abductive practice, where opportunities, probe prompts, and stabilized cues often begin the loop before a full anomaly formulation exists.

Relations

  • Builds on: C.2.2a, A.16, A.16.1, B.4.1, C.2.LS, C.2.4, C.2.5.
  • Coordinates with: A.16.0, A.16.2, C.2.6, C.2.7, B.5.2, A.6.P, C.16.Q, A.6.A, F.9.1.
  • Constrains: admissible prompt entry into abduction.

Worked Prompt Species

Anomaly statement as canonical prompt

An anomaly statement remains a canonical prompt species, especially when the contrast and failure condition are already explicit.

Opportunity-style prompt

A cue may admissibly become an opportunity prompt when the open question concerns a potentially valuable line of probe or intervention rather than a failure description.

Probe-style prompt

A routed cue may become a probe prompt when what matters is not yet explanation but the explicit need to test, contrast, instrument, or perturb.

Specialization-sensitive prompt set

A cue set may admissibly become a TaskFamilySpecializationPrompt, AdaptationProbePrompt, NonHumanUtilityPrompt, or SubstrateDiversificationPrompt when the current question is not yet a selector decision but a bounded entry into specialist acquisition, adaptation probing, nonhuman-utility discovery, or substrate widening. The point is to preserve the task family, budget window, rival candidate options, and entry evidence requirement long enough for downstream comparison rather than smuggling a commitment into prompt form.

Prompt package discipline

A prompt becomes reusable in B.5.2 only when its initiating question is explicit enough to remain stable across downstream hypothesis work.

Minimal prompt package

A robust abductive prompt should make explicit:

  • the prompt species,
  • the open question,
  • the motivating cue or route provenance,
  • the contrast set, if one is already visible,
  • the scope in which the question is being asked,
  • and the witnesses or cue grounds that justify beginning abduction.

This package lets downstream conjectures be tested against the same question rather than against a rewritten paraphrase.

For specialization-sensitive prompt species, the package should also make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, the prior route provenance, and the rival prompt shapes still in play.

Prompts are questions, not claims

A prompt may cue one explanation, but it remains a question-bearing entry form. If the text already asserts the answer, it has moved past prompt status and should be treated under B.5.2 or another governing pattern that carries the asserted answer.

Prompt provenance remains load-bearing

Route provenance, cue provenance, and witness provenance are part of prompt admission, not optional history.

Check prompt against silent promotion

An assurance reader should watch for the common mistake where authors silently upgrade a prompt into a hypothesis merely because the prose sounds explanatory. If the text already leans on one preferred answer as settled, either rewrite it back into a real question or explicitly apply the governing pattern that carries the asserted answer.

Species boundary reminders

Use anomaly species when the key form is an explicit failure, contradiction, or surprising departure from what the current model expected. Use opportunity species when the cue comes from a promising line of development or advantageous contrast. Use probe species when what matters is the need to instrument, contrast, perturb, or ask a question that could discriminate among several candidate explanations.

Use TaskFamilySpecializationPrompt when the current question is which narrower higher-fit specialist option should be acquired for one declared task family. Use AdaptationProbePrompt when the next honest move is a bounded probe that tests whether threshold-reaching specialization is attainable under the current budget. Use NonHumanUtilityPrompt when the prompt must keep a low-human-overlap approach admissible because it may satisfy the declared utility target better than the current familiar repertoire. Use SubstrateDiversificationPrompt when the current question is whether the present substrate is too narrow and a broader or different substrate should be tested before commitment.

Cue-derived prompt entries should stay prompt-headed species rather than projection-headed aliases. The load-bearing question is the prompt kind itself, not one package-local naming trick.

Boundary crossing and invalid drift

A prompt should enter B.5.2 only when the question is explicit enough that rival hypotheses can now be compared against it. If the question is still underspecified, the admissible continuation is further stabilization or routing, not premature abduction.

A routed cue may be close to prompt form but still missing one decisive contrast or witness. In such cases the candidate stays outside U.AbductivePrompt until its initiating question is stable.

A bare intuition, slogan, or rhetorical question with no prompt species and no cue provenance is not yet an admissible U.AbductivePrompt.

A common failure mode is drift from cue -> prompt -> hypothesis without anyone naming the boundary crossings. B.5.2.0 blocks that drift by keeping the prompt package distinct from both the earlier cue pack and the downstream prime hypothesis.

Scope, rival-set, and comparative-validity discipline

A prompt should declare the scope in which its question is being asked: the domain fragment, operational horizon, or inquiry-bounded scope cut that makes the question answerable. If scope remains unbounded, rival hypotheses become incomparable because they are answering different questions.

A prompt need not list full hypotheses yet, but it should make visible whether rival answer types are already imaginable. If no rival answer space is even latent, the publication may still be a cue or orientation note rather than a true abductive prompt.

A prompt may be narrowed to become more discriminating, but the narrowing must not silently smuggle in the answer it is supposedly asking about. Otherwise the prompt ceases to be an initiating question and becomes a disguised conclusion. If a prompt already excludes every serious rival except one preferred explanatory line, the publication may already be preloading a hypothesis. Review should then either rewrite the prompt back into a real question or explicitly apply the governing pattern that carries the asserted answer.

Prompts may be compared across contexts only when their species, scope, and provenance are explicit. A probe-shaped question and an opportunity-shaped question are not the same kind of abductive entry merely because both invite explanation.

One note may legitimately contain a bundle of closely related prompts. If so, the bundle members should be distinguishable and still allow downstream rival comparison without confusion.

An assurance reader can test prompt readiness with three questions:

  1. Is there a real open question? If the text already asserts the answer, it is no longer a prompt.
  2. Is the prompt species plausible? If the initiating cue shape is opportunity-shaped or probe-shaped, forcing anomaly species is a category error.
  3. Could rival hypotheses now be compared against this prompt? If not, the prompt candidate probably needs more stabilization before entering B.5.2.

Add three follow-up checks:

  • Is the scope tight enough for downstream comparison?
  • Is there an imaginable rival-set, even if not yet fully written?
  • Is the narrowing still a question rather than a disguised answer?

B.5.2.0:End

Creative Abduction with NQD

Status. Normative binding to B.5.2 Abductive Loop that delegates candidate generation to Γ_nqd.generate (C.18 NQD-CAL) and exploration/exploitation policy to E/E-LOG (C.19); the kernel remains unchanged.

Non‑duplication & parsimony. “Introduces no new kernel primitives; reuses the CHR kit (A.17/A.18) to define measurable Characteristics. This pattern does not introduce new eligibility conditions. Application is permitted only when USM coverage holds for the target slice and the performer’s RSG state is enactable (eligibility), without prescribing any team workflow. Per A.11 Ontological Parsimony, only a context‑local CHR import and a Method are added; no changes to Γ/LOG. All generation is performed via Γ_nqd. (C.18)* and all exploration/exploitation control via E/E-LOG (C.19). Terminology discipline. Use NQD consistently (Novelty–Quality–Diversity). Treat S/I as secondary metrics unless explicitly promoted by policy (see §3, §5).

Problem Frame

  • Conceptual binding: B.5.2 Abductive Loop (this pattern specifies the how for Steps 2–3).
  • FPF pattern: a domain‑neutral Creativity‑CHR (C‑cluster) that declares the Characteristics used here (see §2). (No change to Γ/LOG.) This binding also references C.18 NQD-CAL (operators Γ_nqd.*) and C.19 E/E-LOG (EmitterPolicy).
  • Manager’s mental model (informative): “We add measurable characteristics for newness, spread, and fit, then use a generator that explores widely and returns a front over the declared Q components together with retained exploration/archive evidence when the policy asks for it, not a single winner and not one bundled {Q,N,D} default.”
  • Operational loops: compatible with B.4 Canonical Evolution Loop (ideas generated here flow into Run→Observe→Refine→Deploy) and with B.5 Canonical Reasoning Cycle (ADI), preserving abductive primacy.
  • Decision-subject note. Later choices are attributed to one declared DecisionSubject at explicit DecisionSubjectGranularity. Contexts publish measurement spaces and admissible policies as semantic frames; they do not enact choices.

Intent & Problem

Intent. Turn Step 2 (generate) and Step 3 (filter) of the Abductive Loop from ad‑hoc brainstorming into a disciplined, instrumented exploration that can (i) produce many distinct, plausible hypotheses and (ii) surface the few worth pursuingwithout bloating the kernel or forcing a specific creative method.

Problem. Unstructured ideation routinely fails on two fronts: it either produces too little variety (pet ideas win by seniority) or too little plausibility (grand theories with no testable predictions). B.5.2 names these failure modes; this pattern adds a minimal, measurable counter‑mechanism aligned to FPF’s assurance lanes and state machine.

The Creativity‑CHR (references only; no re‑definitions here)

This binding references the context‑local Creativity‑CHR (see C.17) and does not restate measurement templates. The primary coordinates are: • Novelty@context (C.17 §5.1), • ΔDiversity_P (marginal; C.17 §5.5), and • Q components (per A.18). Surprise and Illumination are secondary: Illumination is report‑only telemetry (published as IlluminationSummary over Diversity_P); both act as tie‑breakers unless explicitly promoted by policy (C.19). Use‑Value (alias: ValueGain) is informative for decision lenses (Decsn‑CAL) and MUST NOT enter NQD dominance by default (see C.17 §5.2).

All listed Characteristics are context‑local with explicit units/ranges and polarity↑. They are measurements, not eligibility conditions; eligibility conditions are supplied by USM/RSG. (Complies with A.18 measurement discipline; does not overload assurance semantics.)

Lexical discipline. The items above are Characteristics in the sense of A.17/A.18; avoid reserved names such as “validity” or “operation.” Normalization note. If a QualityVector has heterogeneous units, Contexts SHALL normalize or nondimensionalize each component before Pareto analysis (see CC‑B.5.2.1‑7). D vs I (normative). D = ΔDiversity_P (marginal gain) is measured for archive quality, tie-breaking, and policy-promoted dominance only. By default it is not in the primary DominanceSet. I is portfolio illumination (report/visual); it SHALL NOT be part of the primary dominance test and is usable only as an explicit tie-break per policy. Measurement invariants. Distances, grids, and transforms MUST be declared once per run, versioned, and referenced from provenance (§3, §5).

Solution — Binding to Γ_nqd.generate (C.18)

Method name (Plain/Unified Tech). NQD‑Generate — a U.Method that, given (i) a HypothesisSpace and (ii) a CharacteristicSpace with a CoverageGrid, returns a finite candidate package: a current front over the declared DominanceSet plus the retained archive/tie-break telemetry needed to keep diversity and novelty reviewable without making them default dominance dimensions.

Minimal signature.

  • Inputs (declared in MethodDescription): HypothesisSpace, CharacteristicSpace, Seeds?, Budget (time/compute), EmitterPolicy (E/E-LOG policy id), QualityMeasures (Q components), NoveltyMetric, CoverageGrid/Granularity, CellCapacity K? (default=1), EpsilonDominance ε? (default=0), TieBreakPolicy? (S/I), DedupThreshold?, Policy(TimeWindow), DeterminismSeed?

  • Outputs: CandidateSet = {h_i: (desc_i, Q_i, N_i, D_i:=ΔDiversity_P(h_i | Pool), S_i, I_i, UseValue_i?), genealogy_i?, provenance_i (including DHCMethodRef.edition and policyId from E/E-LOG)} where Q_i is a vector and provenance_i captures generator settings and evaluation sources. If Use‑Value is present, include the objective id / acceptanceSpec, counterfactual method (if predicted), and model edition per C.17. Note: N, D, S, and I are archive, tie-break, telemetry, or policy-promoted signals by default; only the declared DominanceSet enters the current front. Use-Value is decision-side/supporting unless the current Context explicitly declares it inside the active Q tuple / DominanceSet; when it is only recorded as a side measure, keep it outside dominance.

Strategy (notation‑neutral).

  1. Seeding. Initialize with seeds (known solutions, random draws, or prior L0 hypothesis epistemes).
  2. Iterated illumination. Propose variations, evaluate Q (per‑component); maintain up to K elites per cell (or descriptor bucket); compute N/D/S/I on the fly; deduplicate by DedupThreshold in CharacteristicSpace.
  3. Budget‑bounded loop. Iterate until budget or coverage‑convergence; return the (ε‑)Pareto front over the declared DominanceSet. When the Context consumes the ordinary default, that means the declared Q components under DefaultId.DominanceRegime, not one fresh local doctrine. Keep N, D=ΔDiversity_P, Surprise, and IlluminationSummary as archive/tie-break/telemetry signals unless one Context policy explicitly promotes one of them into dominance and records the policy id. Use-Value enters dominance only when the current Context explicitly declares it inside the active Q tuple; otherwise it may appear as one decision-side/supporting side note.
  4. Traceability. Emit a Design Rationale Record (DRR): grids/metrics versions, seed(s), policy and TimeWindow, which cells were filled, why items were dominated (list Characteristics), and how the final set was produced (including ε, K, and dedup). (Lightweight DRR is permitted per B.4 guidance.)
  5. Algorithmic freedom (informative). Implementations MAY use MAP‑Elites/illumination, novelty search with local competition, Bayesian/surrogate‑assisted search, or deterministic enumerations; ε‑dominance or knee‑point thinning MAY be used after recording the full front in provenance.

No kernel growth. This is a method/work use of A.3, A.15, and B.1.5 plus a characteristic-space import; no new Γ‑operator is added (per A.11).

Implementation & Binding into B.5.2 (two injection points)

Step 2 — Generate candidates. Precondition (USM+RSG). Generation is permitted only when the Claim/Work Scope covers the TargetSlice (USM) and the performer’s RoleAssignment is in an enactable RSG state (Green-Gate law).

When the pattern is imported, replace or supplement freeform brainstorming with NQD‑Generate; the output is a pool of L0 hypotheses annotated by {N, D, Q, S, I, V?} plus provenance/DRR refs. The abductive step remains abduction (a conjecture), now instrumented and diverse by construction.

Step 3 — Plausibility filters. Apply B.5.2’s plausibility criteria, now with explicit hooks:

  • Falsifiability → filter out ideas with no testable predictions in the Shaping/Evidence states (B.5 alignment).
  • Explanatory power → prioritize candidates whose Q‑improvements (and attached rationales) align with the framed anomaly.

The selected “prime hypothesis” proceeds exactly as in B.5.2: formalize it as a new U.Episteme at L0, then move to Deduction/Induction.

Primary dominance test: compute the (ε-)Pareto front over the declared DominanceSet. When the Context consumes the ordinary default, that means the declared Q components. By default, N (Novelty@context) and ΔDiversity_P act only as tie-breakers unless a policy explicitly promotes them into the dominance set; S (Surprise) and I (Illumination) are also tie-break/report-only by default; Use-Value remains non-dominant unless the active Q tuple explicitly includes it.

Ordinary fallback posture when no narrower local policy is specified

Do not mint one local dominance doctrine here. Consume the ordinary default DefaultId.DominanceRegime from G.Core/G.5 together with the active C.19 policy-side defaults; in ordinary Q-front use this means the declared Q components, with ConstraintFit=pass as eligibility gate. Tie‑breakers: Novelty@context, ΔDiversity_P, and Surprise; IlluminationSummary (telemetry summary over Diversity_P) remains report‑only unless a CAL policy promotes it. Archive: K=1, ε=0, deduplication in CharacteristicSpace. Policy family: one uncertainty-aware explore policy family with one declared regime key; UCB-class with moderate temperature and explore_share ≈ 0.3–0.5 is one didactic starter profile, not the semantic default family. Provenance (minimum): record DescriptorMapRef.edition, DistanceDefRef.edition, EmitterPolicyRef, TimeWindow, Seeds.

Scope‑of‑claim annotation (descriptive). Record the BoundedContext and TimeWindow that delimit where each N/Q/D measurement is intended to hold; this is for reasoning traceability only (no operational gates).”

Note — Status Surprise (scope and default role): By default in B.5.2.1, Surprise functions solely as a secondary tie‑break among candidates that are otherwise Pareto‑equivalent on the Context’s primary characteristics. A Context policy MAY elevate Surprise into the dominance set, allowing it to enter the CreativitySpace dominance alongside the primary characteristics. If no Context policy is specified, the default tie‑break role applies.

Creative-generation consistency with the declared dominance doctrine

  • When candidate generation speaks about fronts, use the declared DominanceSet for the front and keep archive retention separate when archive mode is active.
  • Do not write novelty or diversity terms into the front definition merely because they are important to archive quality or exploration value.
  • If one generator emits both a front-facing result and an archive-facing result, say which surface each result belongs to.
  • If one generator speaks about selected results, keep that language in the shortlist family rather than silently reusing front language.
  • Prefer wording like front over the declared DominanceSet, plus the corresponding ExplorationArchive when archive mode is active over wording that folds Q, novelty, and diversity into one default front by habit.
  • The local generation story should stay consistent with the declared Front, Archive, and Shortlist language so comparison stays intelligible and lawful.

Conformance Checklist (normative)

CC‑B.5.2.1‑1 (CHR discipline). If this pattern is applied in a Context, that Context SHALL declare the Creativity‑CHR Characteristics with A.18‑style templates (type, unit/range, polarity). No new kernel terms are introduced. CC‑B.5.2.1‑2 (Instrumented generation). Step 2 of B.5.2 SHALL either (a) invoke NQD‑Generate or (b) justify a Context‑specific generator of equivalent effect (diversity + quality + novelty with measurable Characteristics). CC‑B.5.2.1‑3 (Diversity coupling). When this pattern is applied, D MUST be ΔDiversity_P computed against the current candidate Pool using the C.17 definition of Diversity_P under the same Context, CharacteristicSpace, kernel, and TimeWindow. CC‑B.5.2.1‑Eligibility: Eligibility requires (i) ConstraintFit = pass for the candidate under the declared must-constraint set, then (ii) USM coverage for the TargetSlice and (iii) an enactable RSG state for the performer; only then may calls to Γ_nqd.* occur. CC‑B.5.2.1‑4 (Non‑dominated candidate front). The CandidateSet MUST include the Pareto front over the declared DominanceSet. If the Context consumes the ordinary default, cite that consumed DefaultId.DominanceRegime rather than restating one local default doctrine. Any pruned candidate MUST carry a DRR note (“dominated by … on {Characteristics}”). N, D=ΔDiversity_P, Surprise, IlluminationSummary, and similar signals enter dominance only under an explicit recorded promotion policy; otherwise they remain archive, tie-break, or telemetry signals. CC‑B.5.2.1‑4a (Archive companion when retained exploration is in scope). If the active policy depends on retained exploration, stepping-stone retention, or open-ended search, the emitted candidate package MUST include the corresponding ExplorationArchive or cite one explicit policy id that says archive mode is disabled for that run. CC‑B5.2.1‑5 (Abductive primacy preserved). The pattern MUST NOT bypass the ADI ordering mandated by B.5: induction may not start before deduction; abductive L0 creation remains the start. CC‑B.5.2.1‑6 (Normalization for Pareto). When Q has multiple components with different units and scales, Contexts SHALL normalize or use declared utility‑free monotone transforms before dominance tests. **CC‑B.5.2.1‑7 (Use‑Value separation). ** If Use‑Value (C.17 §5.2) is recorded outside the active DominanceSet, it SHALL remain outside Assurance scores and MAY inform decision lenses (Decsn‑CAL). If the current Context explicitly places Use-Value inside the active Q tuple, record that declaration together with its objective id / acceptanceSpec. Do not alter R/G semantics based on side-measure Use‑Value. (see C.17 §5.2 for Use-Value and ValueGain definitions) CC‑B.5.2.1‑8 (Provenance). Each h_i in the CandidateSet MUST reference its provenance_i sufficient to reproduce scores given the same Policy(TimeWindow), score/metric versions, and DeterminismSeed?. CC‑B.5.2.1‑9 (Secondary metrics). I (illumination) and S (surprise) SHALL be used only for tie‑breaking/reporting unless explicitly promoted by policy; the primary dominance test uses the declared DominanceSet, which under the ordinary default means the context-declared Q components. CC‑B.5.2.1‑10 (Cell capacity & ε). If K>1 or ε>0 are used, the values MUST be declared and recorded in provenance; any thinning AFTER recording the front SHALL be documented in the DRR. CC‑B.5.2.1‑11 (Dominance set). If the Context consumes the ordinary default DefaultId.DominanceRegime, the active dominance set SHALL be the declared Q components and provenance SHALL cite that consumed default plus the active C.19 policy or lens id. N (Novelty@context) and ΔDiversity_P act as tie‑breakers unless explicitly promoted by policy (record the policy‑id in provenance).

Cognitive Load & Kernel Growth Budget

For engineers/managers (user cognitive load).

  • Added steps: selecting descriptor Characteristics & granularity; reading a Pareto table (non‑statisticians tip: scan the “front” row; ignore dominated rows).
  • Mitigations: provide a one‑screen “NQD Cards” template analogous to RSG cards; default grids and metrics per Context. (Keep ≤ 7 visible Characteristics—mirrors RSG human‑scale guidance.)
  • Reader quickstart (engineer‑manager): (1) Pick 2–3 Q characteristics aligned to the anomaly + a simple CharacteristicSpace (2–4 dimensions). (2) Accept defaults for NoveltyMetric, grid granularity, and K=1. (3) Run NQD‑Generate to a fixed budget; read the front row first. (4) Apply Step 3 filters; log decisions in the DRR.

For the framework (kernel growth).

  • Zero new primitives; only a CHR import and a Method. Passes A.11 minimal‑sufficiency.

Placement in the Reasoning Cycle (ADI)

This pattern only structures hypothesis exploration (Abduction) and does not define or imply any operational gates. It respects ADI ordering (Abduct → Deduct → Induct) and leaves deployment/readiness concerns to patterns outside this spec.

Context‑Level KPIs (optional, informative)

Contexts may monitor these—not as gates, but to improve practice:

  1. Generativity (Gv). Fraction of abductive cycles whose selected candidate reaches L1/L2 within policy windows (time‑to‑L1; time‑to‑evidence). (Maps onto state transitions driven by B.5.)
  2. Frontier‑Hit Rate (FHR). % of cycles where the chosen candidate lies on the Pareto front over the declared DominanceSet at selection time; track novelty/diversity contribution separately as archive, tie-break, or policy-promoted evidence.
  3. Coverage Gain (ΔI, report). Change in the illumination summary (coverage map/%filled cells) per cycle (how much of the descriptor space is now “lit”).
  4. Exploration Cost Ratio (ECR). Compute/time spent in NQD‑Generate divided by downstream Shape/Evidence cost saved (tracks whether the pattern pays for itself).
  5. Refutation Learning Yield (RLY). Among refuted candidates, % that added new coverage or raised SurpriseScore—turning “failures” into map‑building.

Worked micro‑example (abbreviated)

Framing = Step 1 in B.5.2 Context: A Context using FPF to evolve FPF itself (meta‑improvement). Anomaly: “Users perceive FPF as compliance‑heavy; we need first‑principles creativity surfaced.”

Step 2 (NQD‑Generate).

  • CharacteristicSpace: {creative‑characteristic count, explicit novelty metric present?, QD operator present?, didactic cards present?}. (Illustrative; Contexts SHALL define their own descriptors per §2.)

  • Q‑measures: {editor effort↓, time‑to‑L1↓, reader clarity↑}.

  • Output Pareto set (sketch):

    • h₁ = “Add Creativity‑CHR + NQD pattern (this pattern)” — high D, high N, medium Q.
    • h₂ = “Rename governance terms to arts vocabulary” — low N, low D, medium Q.
    • h₃ = “Add live ideation sandbox (ops tooling)” — medium N, medium D, high Q.

Step 3 (Filters).

  • Falsifiability: h₂ weak—no testable prediction → drop.
  • Scope (USM): h₁ scoped to Part B; TimeWindow = edition 2025‑Q4covers TargetSlice. h₃ crosses Contexts (tooling) → requires Bridge; the overhead is accounted for in R (not F/G). (This pattern does not create or alter Bridges.)
  • Select prime: h₁ → formalize as L0 episteme (this pattern), move to Shaping (define checklist), then Evidence (track KPIs).

Trade‑offs & mitigations

  • Cognitive effort. Interpreting Pareto sets and coverage maps adds thinking overhead. Mitigation: standard “NQD Card” + default grids; keep Characteristics small in number (≤ 7). Manager shortcut: pick 2–3 Q characteristics that reflect the anomaly, then run with defaults.
  • Locality. Novelty/diversity are context‑local; Cross‑context reuse requires re‑measurement or an explicit mapping. This pattern does not define Cross‑context operational controls.
  • Not a magic idea machine. Abduction remains human/agentic; the pattern structures search, it does not automate insight. B.5’s abductive primacy stands.
  • Metric gaming & collinearity. Avoid making N and S redundant by policy; when strong collinearity is detected, freeze one as informative only and record rationale in the DRR.
  • Extends: B.5.2 Abductive Loop (Step 2/3 operationalization).
  • Driven by / feeds: B.5 Canonical Reasoning Cycle (Abduction→Deduction→Induction), B.4 Evolution Loop (Observe/Refine).
  • Uses: A.17/A.18 for characteristic discipline and B.5 ADI ordering. May refer to Context‑specific MAP‑Elites/novelty‑search implementations in the MethodDescription. No operational gating is in scope here. C.17 (Use‑Value / ValueGain, normative definition).
  • Respects: A.11 (no kernel growth beyond CHR template import + Method).

B.5.2.1:End


Domain-Concept Bridge

Problem Frame

FPF keeps a small set of admitted U-kinds, ontics, slot relations, mechanisms, characteristics, methods, work values, epistemes, and publication-use relations. Working domains use their own words. A thermodynamicist says "system", "macrostate", "control volume", and "free energy"; a safety engineer says "hazard", "mitigation", and "assurance case"; a software team says "service", "endpoint", and "release".

Those words are useful. The problem starts when one local word is silently treated as a new root kind, a role assignment, a characteristic, a method, a work occurrence, an evidence relation, or a publication claim without saying which FPF value the claim uses.

Problem

How can FPF let project teams keep domain vocabulary while preserving the current FPF ontology? A dictionary-style alias is too weak because it only says that two labels are being associated. It does not say whether the claim concerns an entity, a kind, a slot filler, a characteristic coordinate, a role assignment, a method, a mechanism, a work plan, a performed work occurrence, an episteme, a publication-use relation, or an evidence-use relation.

Forces

ForceTension
Domain fluency vs. ontological parsimonyTeams need familiar words, but FPF must not grow a new root kind whenever a local term appears.
Same word vs. different claimOne word such as "sensor", "state", "process", or "role" can point to different FPF values in different bounded contexts.
Bridge use vs. role overuseSome domain words really name role values or role assignments; many others name entities, characteristics, methods, descriptions, or evidence relations.
Bridge record vs. hidden ontologyA bridge must carry scope, loss, and return conditions rather than hiding them behind a synonym.

Solution

Use a Domain-Concept Bridge. Start with the local word in its U.BoundedContext, then recover the FPF value that the project is actually using.

  1. Establish the bounded context and local sense: use F.1 to identify the domain family and authoritative sources, F.2 to harvest terms with provenance, and F.3 to cluster the local sense or SenseCell with counter-examples.
  2. Ask what the local word is doing in the current claim: naming an entity, admitted U-kind, ontic slot filler, relation, characteristic coordinate, method, mechanism, work plan, performed work, role assignment, episteme, publication-use relation, evidence-use relation, or other governed value.
  3. If the claim needs durable kindhood, use admission under E.24.UK and C.3 and supply the ontic and slot relation that make the kind reviewable.
  4. If the claim is only local vocabulary, keep it as a LocalSense or SenseCell and bridge it with scope and loss notes.
  5. Use role vocabulary for system or holon role assignments in bounded work-facing contexts. Express meaning, status, evidence use, publication use, and domain interpretation through their own FPF values and relations.

The bridge record is therefore not an alias. It is a small typed settlement saying which FPF value the claim uses, what local wording points to it, where the bridge is admissible, and when the stronger source or direct governing pattern must be reopened.

Practical difference from an alias:

  • An alias says "L is another name for V."
  • A Domain-Concept Bridge says: in bounded context K, local wording L is being used for FPF value or relation V in the current claim; the bridge carries the constraints, units, role assignments, loss notes, and return conditions that make that use reviewable.
  • If a component is called "sensor", the bridge can point to a system, a functional element, a measurement capability, a signal publication, or a role assignment. The claim decides which value is being used; the word "sensor" alone does not.

Archetypal Grounding

A thermodynamics team models a heat engine.

  • "Thermodynamic system" names the engine as the entity under thermodynamic concern in the current bounded context. The bridge points to the same system or holon already used elsewhere, plus the thermodynamic boundary and state variables that matter here. It is not automatically a role.
  • "Macrostate" names a state description or characteristic bundle over pressure, volume, temperature, and particle amount. The bridge records the reference scheme and units.
  • "Control volume" may name a boundary or region relation. The bridge must say which entity is bounded and which exchanges cross the boundary.
  • "Free-energy objective" may name an objective claim, characteristic, or selection criterion. The bridge must say which FPF value the decision uses.
  • If the engine control system is assigned the role of heat-source controller in a work context, that is a separate U.RoleAssignment(holderRef, roleRef, boundedContextRef) claim.

What this achieves:

  • Domain constraints become reviewable without turning every domain word into a root kind.
  • Verification can use the governing pattern for the recovered value: boundary discipline for a control volume, characteristic-space discipline for state variables, role-assignment discipline for controller work, and publication-use or evidence-use discipline for reports and dashboards.
  • The heat engine remains the same system or holon when a power-plant architecture, finance model, safety case, and thermodynamics model all discuss it. Bridges record which local meanings travel across those contexts and which losses block substitution.

The same local word can be reused in an architecture view, a requirements document, and a simulation model only after the bridge states whether those uses point to the same entity, the same characteristic, the same role assignment, or merely related descriptions.

Conformance Checklist

  • CC-B5.3.1 (Recover the FPF value used by the claim): A bridge row names the current FPF value or slot relation before naming the preferred wording.
  • CC-B5.3.2 (No kindhood by spelling): A local term, dotted name, table row, or diagram label does not become a U-kind unless admission under E.24.UK and C.3 supplies the ontic and the needed slot relation.
  • CC-B5.3.3 (Role boundary): Role language is used for system or holon role assignments in bounded work and method contexts; other uses are expressed through their own FPF values or relations.
  • CC-B5.3.4 (Scope and loss): A bridge records context, scope, loss, and return conditions; it does not claim lossless sameness by name alone.
  • CC-B5.3.5 (Description boundary): If the local word appears in a requirement, diagram, dashboard, report, or publication, the bridge keeps the described entity distinct from the description and publication form.

Common Anti-Patterns and How to Avoid Them

Anti-PatternWhat it looks likeBetter FPF move
Subtype explosionEvery domain term becomes a new root kind.Keep the local term in its context unless admission under E.24.UK and C.3 proves durable kindhood.
Magic synonymA table says "sensor = component" with no scope or loss.Write a bridge row naming the FPF value used by the claim, context, admissible use, and return trigger.
Role-for-everythingEvidence, status, domain interpretation, and document use are all called roles.Use role assignment only for systems or holons in work-facing contexts; use episteme, publication, evidence-use, status-use, characteristic, method, or work vocabulary for the value being claimed.
Description collapseA diagram label is treated as the entity, interface, or method itself.Keep entity, description episteme, representation scheme, and publication form distinct.

Consequences

BenefitsTrade-offs / Mitigations
Domain language stays usable: Experts keep familiar words without forcing every word into the kernel.Bridge overhead: Load-bearing local terms need a small bridge record. Keep it short and reopen stronger patterns only when a claim becomes load-bearing.
Kernel stays lean: New kinds require explicit admission and ontic support.More precise modeling choices: The bridge may reveal that one local word hides several FPF values. That is the point: split them before they drive work.
Cross-document clarity: Requirements, diagrams, dashboards, simulations, and reports can be compared without pretending they are the same artifact.Need for current context: Bridges are context-scoped; do not move them across projects without checking scope and loss.

Rationale

The bridge implements open-ended parsimony: FPF can talk with many domains without turning every useful domain word into a kernel kind. It keeps role vocabulary inside role-assignment ontology; domain vocabulary is mediated through local senses, bridge rows, admitted U-kinds, ontics, slot relations, and the FPF values governed by direct patterns.

Relations

  • Builds on: A.2, A.2.1, A.6.5, C.3, E.24.UK, F.1, F.2, F.3, F.5, F.8, F.18.
  • Coordinates with: A.7, C.2.1, E.17, A.13, A.15, B.3.3, F.7, F.9, and domain-specific CHR, LOG, and CAL patterns.
  • Used when: a project term must be carried across bounded contexts, documents, diagrams, models, evidence records, or pattern applications without losing its governed FPF value.

B.5.3:End


Last Updated: 2026-07-03 — upstream FPF commit f7c7e93f (github.com/ailev/FPF)