Part B - Trans-disciplinary Reasoning Cluster
Preface node
heading:part-b-trans-disciplinary-reasoning-cluster:36281
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, collection belonging under the collection's own rule, 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, collection belonging under the collection's own rule, collection-as-whole grounding, a relation among local system-role kinds, a direct participation or assignment relation, method relation structure, work occurrence holarchy, selected architecture structure, or mathematical description. If claim-bearing source wording still says only “role,” use E.10.ROLE before choosing one of these branches.
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 is the pattern for relation vocabulary, C.13 is the pattern for constructional grounding, B.3.5 is the pattern for Working-Model assurance grounding, A.15.1 is the pattern for work-occurrence holarchy, and C.29 is the pattern for 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 an exact relation among local system-role kinds, use
A.2.7; if it is classification, assignment, or a direct participation relation, state that fact through its own pattern and predicate. Send unresolved claim-bearing “role” wording throughE.10.ROLE. Use the Method patterns for method relation structure andC.29when 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.2orB.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:
- Mereology and notation collapse. A graph or algebra is treated as the part-whole structure itself.
- Roles and methods become parts. Role factors, method parameters, guards, steps, and compositions are read as holonic parts because the same word "decomposition" appears.
- Work occurrence is inferred from plan. A method decomposition or schedule is treated as evidence that performed work had those parts.
- Collections become acting systems. A set, list, batch, fleet, or community is treated as an admitted acting System or responsibility bearer from plural naming, a system-role kind or assignment, a Method, or Work. Admission of the acting collective remains an A.1 question; responsibility also needs the predicate, participants, and pattern or rule that defines it.
- 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
Solution
Use B.1 as a discriminator and construction frame.
Holon Aggregation Claim Frame
When part-whole construction is current, recover:
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)forComponentOf,ConstituentOf,PortionOf,PhaseOf, collection belonging under the collection's own rule, 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
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 subject pattern.
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)
Pump Skid
A pump skid can be a U.System holon whose parts include pumps, valves, controller, frame, and connectors.
B.1 recovers the holon aggregation claim. A.14 names component or portion relations. C.13 gives constructional grounding. C.16 carries whole-level characteristics such as maximum flow or pressure envelope. If a graph is drawn, it represents a selected dependency or structure; the graph is not the skid.
Evidence Corpus
A corpus can be a collection under its own inclusion rule and a C.13 set account. This alone does not make it a holon. Treat an integrated claim-bearing corpus as a whole only after all six A.1 matters pass, including constructive part relations, assembly, a composition-grounded whole characteristic, and possible participation in a larger assembly. Coverage, source freshness, bias exposure, or evidential diversity may be collection-level characteristics without settling that stronger question.
The corpus does not become an acting system. A review board, script, or research team may instead be admitted as a System. If the current claim says only that it takes part in ordinary review or analysis, state the direct participation relation and stop there. If it says that the System performed admitted U.Work, recover that performer's A.13 core and independently admit the Work under A.15.1. Add F.6 afterward only when the B.1 claim also needs precise assignment-bound attribution. A short B.1 sentence may omit an unused assignment identifier only when every relation it consumes remains recoverable. A local kind and a separate System-classification judgment remain independently optional. The corpus may be an episteme or publication-side object under its subject patterns.
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 patterns and C.29 when algebra is selected. If the current claim is the actual run, use A.15.1.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
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 subject pattern before the notation is used: work occurrence evidence uses
A.15.1, work-resource aggregation usesB.1.6, mathematical-lens reliance usesC.29, and whole reidentification first usesB.2.Pand thenB.2when 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 use of the applicable direct patterns. 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
Relations
- Builds on:
A.1for holon admission,A.14for relation vocabulary,C.13for constructional grounding, andB.3.5for Working-Model assurance grounding. - Coordinates with:
A.15andA.15.1for method and work,A.22andC.30for selected structure and architecture,C.16for whole-level characteristics,C.29for mathematical lenses, andB.2for whole reidentification. - Refined by:
B.1.1,B.1.2,B.1.4, andB.1.6for 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 it is part-whole, boundary crossing, order, temporal phase, resource, representation, evidence, publication use, source use, or another direct relation defined or tested by the applicable pattern.
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.22andC.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:
- Edge drift spreads.
ComponentOf, a collection's belongs-to relation,PhaseOf,SerialStepOf,RepresentationOf, source use, evidence relation, and control relation all become generic graph edges. - 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.
- Design and run objects mix. Planned structure, design description, actual work occurrence, and telemetry are placed in one dependency expression without a DesignRunTag or a distinction among the patterns that define those claims.
- Acyclic graph discipline overclaims. A graph check says something about the drawing, but the ontology-side relation remains ungrounded.
- Mappings become parts. A digital twin, dashboard, diagram, or architecture description is treated as a constituent of the object it describes.
Forces
Solution
Use dependency structure first; use graph representation second.
Dependency Structure Frame
This frame is not a U-kind. It records the current relation claims, their exact participants, grounds and qualifications, the selected dependency structure when one is current, and the patterns that define or test those relations.
Graph Representation
Use graph language only when a graph is the selected mathematical or representation lens:
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 rule for that relation admits the mapping.
Relation Grounding Guide
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 a rule that makes the selected relation support that inference;
- performed work from a planned step graph;
- whole reidentification from a graph property without B.2;
- architecture from a graph without an exact described holon, selected structure, and architecture relation or claim.
Archetypal Grounding (Worked Cases)
Plant Supplier
Source graph: PowerGrid -> Plant.
If the edge means electricity supply, recover a boundary-crossing or supply relation. The power grid is not a plant part. Use part-whole relations only for admitted plant internals.
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 patterns that define the method, description, and order claims. If it describes performed Work, use A.15.1 with occurrence identity, timing, evidence, and the exact Work relation. Do not let the same graph do both jobs.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
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 the patterns that define or test them 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; each direct relation is grounded by the facts and rule that make it obtain.
SoTA-Echoing
Relations
- Builds on:
B.1,A.1,A.14,C.13, andA.6.5. - Coordinates with:
A.15.1for work occurrence,B.1.4for contextual and temporal aggregation,C.29for graph as mathematical lens,A.22andC.30for selected structure and architecture,C.30.ADandC.30.AD.BAfor architecture description and digital-twin cases. - Can contribute evidence to:
B.2when 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 one exact entity recognized under the already admitted U.System kind, or one exact entity still being evaluated under A.1 for that kind, is being considered as a whole and an engineering decision depends on coordinating its independently governed part-whole, delimitation, crossing, function/bearer, and whole-characteristic claims.
Typical moments:
- a machine, plant, robot, vehicle, building asset, service organization, or operating unit is proposed as a whole assembled from exact constituents;
- a system-level characteristic is to be rolled up from constituent characteristics;
- a supply, signal, measurement, control, source, publication, evidence, or transformation relation is being mistaken for a part relation;
- a functional element must be distinguished from and allocated to physical, organizational, software, or operational bearers;
- a named decision needs one recoverable view of the system boundary, exact crossings, and compatibility choices without turning that view into the system.
First useful move. Name the exact whole and its A.1 recognition status, the decision being made, and each load-bearing claim. For every claim, select its subject pattern and either recover the exact result or state the exact missing governor or information. Only then ask whether their joint organization itself changes the named decision.
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 elements become physical parts by label. External change or measurement is read as containment. One convenient record then appears to establish all those unrelated facts.
What this buys. B.1.2 coordinates one engineering aggregation decision while leaving system recognition, exact parthood, assembly, delimitation, crossing, function, bearer, characteristic, evidence, description, representation, and decision claims with their subject patterns.
Not this pattern when.
- If the exact entity has not yet been evaluated under the already admitted
U.Systemkind, useA.1; do not promote the proposal into a durable kind-like label. - If one exact part-whole relation is the question, use
A.14and its direct specialization. - If constructive assembly grounding is the question, use
C.13. - If functional behavior or a functional element is the question, use
A.6.Fand the exact architecture structural-view pattern. - If module or bearer allocation is the question, use
A.6.Mand the exact architecture or part-relation pattern. - If a mathematical aggregation lens is the question, use
C.29. - If the question is project system-of-interest designation, system-role assignment, Work, transformation, service or access, evidence, description, or publication, use that subject pattern; B.1.2 neither identifies nor defines those relations.
Problem Frame
B.1.2 specializes B.1 for system holons, but it is a coordination method rather than the source of one omnibus system-aggregation relation. The useful engineering question is which exact independently governed facts must be considered together for one aggregation or delimitation decision.
Keep five frequently collapsed objects distinct:
- The exact system whole. It is independently recognized under A.1 and its direct identity rule.
- Its environment. In this pattern,
environmentmeans the exact external referents and exact crossing relations made relevant by a stated delimitation and use. It is not a generic surrounding object; an exact medium is named separately when that medium is itself the subject. - An actual containing system. The larger system of which
Sis an admitted part exists for this claim only when an exact part-whole relation independently obtains. Interaction or spatial surrounding is not enough. - The project system-of-interest. Project designation or selection is a separate claim from
U.Systemidentity, environment, parthood, system-role kind or assignment, and architecture. B.1.2 does not derive it from a box or aggregation decision. - Use qualification and neighboring relations.
Contextis not one world-side container supplied by B.1.2. When claim scope, effective reference scheme, or a bounded model-use structure qualifies a use, recover that exact qualifier under its subject pattern. Recover any system-role assignment or other neighboring relation separately. None delimits the system, identifies its environment, or establishes containment by itself.
B.1.2 does not make Gamma_sys the pattern head, create generic boundary or interaction U-kinds, or infer a part-whole relation from transformation, coordination, responsibility, or representation.
Problem
Without B.1.2:
- Boundary by drawing. A box in a diagram is accepted as system delimitation.
- External relations become parts. Suppliers, grids, sensors, controllers, teachers, measuring instruments, or digital twins are placed inside the system because they interact with it.
- Functional and physical structures collapse. A resistor symbol, control function, chassis function, or service label is treated as a physical component by name alone.
- Whole-level characteristics lack grounding. Mass, capacity, reliability, safety, throughput, assurance, or agency-like characteristics are rolled up without saying which bearers, relations, and scales support the claim.
- Transformation becomes containment. A tool, teacher, actuator, script, or controller changes a holon and is then treated as its part or containing whole.
- Coordination record becomes ontology. One aggregate-shaped record silently creates systemhood, parts, boundary, crossings, allocation, evidence, and representation instead of pointing to independently governed facts.
Forces
Solution
Use B.1.2 to coordinate one named system-aggregation or delimitation decision across independently governed results. Do not introduce SystemAggregationRelation@Context, HolonDelimitationRelation@Context, HolonBoundaryCrossingRelation@Context, or another record-shaped relation merely to hold the answers together.
Recover Each Direct Result Or Blocker
Naming those results together does not create a further world-side relation. Stop at the first direct blocker that prevents the named decision; do not weaken it into an aggregate-shaped placeholder.
Select A Structure Only When The Joint Organization Matters
If the joint organization of several exact results itself changes the named decision, select one ordinary U.Structure under A.22. Recover all four identity discriminators: exact independently identified constituents, exact selected obtaining relation occurrences, exact constraints as applied, and one named selection-use frame with its admissible action or stop.
The selected structure is non-agentive. It creates no system, part, crossing, allocation, characteristic, evidence, or decision fact and does not become the system, its environment, or its containing whole. A box, list, graph, table, description, view, or publication can represent or describe the selected organization but supplies none of the four discriminators by form.
Make Interface Choices About Exact Crossing Relations
When the aggregate exposes, namespaces, internalizes, excludes, or leaves a crossing with its subject pattern, make that choice about one exact crossing-relation occurrence and one named use. These words are ordinary decision options, not a closed FPF enumeration and not another relation kind.
Name the direct world facts, affected endpoints, exact crossing predicate and occurrence, preserved obligation or information, evidence if relied on, and the C.11 ChoiceResult or C.32.PAD ArchitectureDecisionRelation@Project that chooses among the ordinary interface options when its exact predicate applies. A different choice passes only after its exact subject assertion, predicate, and result are named; otherwise stop with the established missing-governor blocker, whose content identifies the absent exact predicate source. If a later use must inspect the choice, identify a separate C.2.1 episteme whose claim content describes it and cites that direct result; the episteme does not make the crossing, parthood, compatibility, or decision fact obtain. This preserves interface accountability without an omnibus compatibility-check object. Without that account, an apparent simplification can silently drop an external obligation or proliferate unmanaged endpoints.
Whole-Level Characteristics
Roll up system-level characteristics only after the exact bearer, characteristic relation or assignment, scale, and aggregation or inference rule are selected under their subject patterns.
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 patterns; - 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)
Pump Skid
A pump skid may be one exact entity proposed for recognition under the already admitted U.System kind. Pumps, frame, valves, controller, and connectors become its components only when their exact A.14 part-relation occurrences obtain and C.13 grounds the assembly; the proposal, drawing, and component list establish none of those facts.
The power grid, maintenance crew, telemetry dashboard, and supplier are not skid components merely because the skid depends on them. Recover the exact systems or epistemes and their supply, work, telemetry, publication, source-use, or other direct relations. If a maintenance-isolation decision needs their joint organization, an A.22 selected structure may include the exact obtaining crossings without turning them into parts.
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. Recover the exact function, bearer, allocation or correspondence, and any part relation separately; B.1.2 only coordinates them for the current circuit decision.
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, representation, and naming patterns for the description side; use exact part-relation patterns 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. Those facts do not make the workpiece a lathe component or make the lathe the larger whole containing it. Use A.3.4, A.15.1, A.12, and the exact crossing or participation pattern; use part-whole only when an exact relation independently obtains.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- System aggregation remains practical for engineering systems and organizations.
- Boundary and interface concerns become explicit subject-pattern work without omnibus relation or check objects.
- Functional architecture, module allocation, and physical parthood stop collapsing into one diagram.
- Digital-twin and publication artifacts stay on the description side unless an exact stronger relation predicate is defined and current facts satisfy it.
Costs:
- Engineering diagrams used for decisions need annotations that name the exact relation and its defining pattern or declaration.
- 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 by coordinating exact subject-pattern results for recognition, parthood, assembly, delimitation, crossings, function, bearer, characteristic, evidence, and description. It selects one ordinary A.22 structure only when their joint organization changes the named decision.
SoTA-Echoing
Relations
- Builds on:
B.1,A.1,A.14,C.13,A.22, and the direct relation patterns selected for the current decision. - Coordinates with:
A.6.Ffor functional elements,A.6.Mfor module and bearer allocation,A.22andC.30for selected structure and architecture,C.16andA.19for characteristics,C.29for mathematical lenses,A.3.4andA.12for transformation and acting-side externalization, andC.30.ADorC.30.AD.BAfor architecture-description cases. - Can contribute evidence to:
B.2when system aggregation no longer explains the whole-level claim and whole reidentification is needed.
B.1.2:End
Γ_epist - Knowledge‑Specific Aggregation
At a glance. Use B.1.3 to compose exact U.Episteme inputs into one knowledge aggregate while preserving provenance, conceptual fit, context, and conservative assurance bounds.
Use this when. Use this pattern when a named synthesis or compilation use depends on how claims, models, datasets, or arguments are combined, and the aggregation must keep source, mapping, conflict, order, and temporal qualifications inspectable.
Not this pattern when. Use C.2.1 for episteme identity and edition continuity, A.14 for a proper temporal restriction of one unchanged episteme, A.15.1 for Work parts or occurrences, B.1.4 for a bounded aggregation of already recovered order or temporal relations, and B.3 for the assurance claim that consumes the aggregate.
What changes in practice. Identify every input episteme and mapping before folding; preserve provenance and conflicts; and return identity, edition, temporal restriction, Work, publication, and assurance questions to their subject patterns.
► decided‑by: A.14 Advanced Mereology A.14/C.2.1 compliance — Use ConstituentOf for semantic parts and PortionOf only for quantitative splits of texts/data with declared μ. Use
PhaseOfonly for a proper interval of one unchanged C.2.1 episteme. When a MethodDescription or document episteme's claim content, EntityOfConcern, or effective ReferenceScheme changes, identify another episteme and assertEpistemeEditionRelationonly when its historical-continuation predicate obtains. Work segmentation uses A.15.1; no ComponentOf is used 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.Epistemeis 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 claim-bearing synthesis. - Strict Distinction (A.15). We separate: structure (what the episteme comprises), order (argument flow), identity and history (C.2.1 identities and edition relations), proper temporal restriction (A.14), 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 only after their direct inputs are recovered.
- Mereology (A.14). For knowledge composition we primarily use ConstituentOf (logical or semantic parts), UsageOf or ReferenceTo (external reliance), and each collection's own belongs-to rule for collections such as anthologies or corpora. We do not use ComponentOf (physical) in Γ_epist.
PhaseOfmay restrict the same unchanged episteme to a proper interval when its complete C.2.1 identity triple remains fixed. Distinct labelled versions or revisions require distinct C.2.1 identities when a discriminator changes and an independently obtainingEpistemeEditionRelationfor any claimed historical continuation. Knowledge does not act and acquires neither a work-facing local system-role kind nor an assignment. Ordinary prose may say, for example, "the researcher synthesized the sources". If the receiving use does not identify that action as one particular datedU.Workoccurrence, stop with the ordinary sentence. If it does, recover each actual performer's A.13 core and independently admit the occurrence under A.15.1. Add F.6 only when the receiving use also needs precise assignment-bound attribution; a short local projection may omit an unused assignment identifier only when every consumed relation remains recoverable. - 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 first uses C.2.1 to identify exact epistemes and any obtaining edition relations; B.1.4/Γ_time may then aggregate already recovered temporal restrictions, relation order, deprecation, or update windows for a bounded use. The aggregation creates neither identity nor continuity. Open B.2 only if the synthesis leaves a genuine whole-reidentification question after the existing-whole explanation check and identifies an exact candidate new whole; new wording or explanatory gain alone is not MHT.
Problem
Naive aggregation of knowledge holons causes recurring failures:
- Trust inflation by averaging. Averaging confidences of conflicting claims creates a falsely “reliable” whole; violates WLNK and B.3 conservatism.
- Provenance erasure. Merges that drop sources, methods, or links break A.10 Evidence Graph Referring and make results unauditable.
- Semantic drift. Folding across mismatched concepts without explicit mappings (and their CL) yields incoherent composites that look formal but mean nothing.
- Order blindness. Arguments with essential dependency order (premise ⇒ lemma ⇒ conclusion) are treated as sets; non‑commutativity is lost and results become non‑reproducible.
- Semantic-context chimeras. Combining claims whose local senses or reference schemes differ, without exact mappings and—when meanings cross—an F.9 Bridge plus a separately warranted bounded-use claim, silently corrupts claims and inflates R.
- Category errors. Importing Γ_sys rules (e.g., “sum truth,” “avg formality”) into knowledge composition produces physically sounding but epistemically nonsensical models.
Forces
Solution — Terms, operator family, invariant Standard, core rules
Terms (didactic recap)
- U.Episteme — a claim-bearing knowledge holon. C.2.1 identifies it through the participant-determined
EpistemeConstitutionRelationover<claim content, exact EntityOfConcern, effective ReferenceScheme>.ClaimGraphSlot,EntityOfConcernSlot, andReferenceSchemeSlotname participant meanings only inside that relation's reusable declaration; they are not internal slots of the episteme. Empirical grounding uses the separateEpistemeEmpiricalGroundingRelation, while text, code, figures, datasets, SCR/RSCR references, publication forms, and presentation carriers remain separately governed provenance, representation, publication, or carrier material. - Evidence/Provenance Graph — edges like evidences, derivesFrom, usesMethod, isMeasuredBy with anchors (A.10).
- Semantic mapping — the exact correspondence rule used by this fold. When it crosses semantic contexts, identify the source and receiving F.17
SchemeSenseCellvalues and an obtaining F.9Bridge; keep the proposed use, direction, use-specific rule, permitted loss, reliance, and CL evidence summary separate. F.9 does not require CL for every Bridge, but B.1.3 admits a mapping into its reliability fold only when that summary is present. CL can lower the estimate and never grants the use. - SCR — a
U.SCRthat lists all symbol carriers included in the aggregate; never dropped. - Semantic context — Plain shorthand for the local interpretation basis recovered from one exact F.17
SchemeSenseCellas<ReferenceScheme, LocalSenseClaim>. It is not another operation argument or entity. Crossing between two such contexts uses F.9 and the separate bounded-use and reliance steps above.
Didactic reminders. • Knowledge does not act. A researcher or engineer may use it while performing Work. Recover the exact System and Work only when the receiving claim consumes them; use A.12 only when the acting-side distinction is itself current. • A collection's own rule establishes which epistemes belong to it; belonging is not a semantic argument link and does not by itself make a holon. Use ConstituentOf for logical or evidential composition. •
PhaseOfis only a proper temporal restriction of one unchanged episteme. Changed C.2.1 discriminators identify another episteme; testEpistemeEditionRelationseparately. Use MHT only for a remaining whole-reidentification question, not as a substitute for C.2.1 identity.
The operator family (companion flavours)
To keep design vs run clean (A.15), Γ_epist has two companion flavours that share the same algebra but answer different semantic questions. Their declarations contain only the values on which the result depends. A performer, local system-role kind, or assignment is therefore not an operator argument: the same fold can be specified before staffing and can be applied in Work performed by different Systems without changing its result semantics.
When one particular operation application matters, use A.6.1 for that application and its argument and result bindings. A practitioner sentence may still say "the engineer compiled the guidance". If no particular dated U.Work claim is current, that ordinary sentence needs no classification or assignment apparatus. If one is current, recover every actual performer System's A.13 core and independently admit the Work under A.15.1 from its performance history, enacted Method, temporal extent, and containing System. Add F.6 afterward only when precise assignment-bound attribution is current. A short B.1.3 projection may omit an assignment identifier unused by its receiver only when every relation it consumes remains recoverable. An operation result binding says which value the application returned; it establishes neither production nor first existence of that value, publication, release, acceptance, nor a carrier. Open A.15.PROD or the publication patterns only when one of those separate questions is current.
Synthesis (design-time semantic fold). Compose exact input epistemes into a draft aggregate.
- Domain.
D_knowdesignates exact source epistemes and the governed ConstituentOf, UsageOf, ReferenceTo, evidences, derivesFrom, and collection-specific belongs-to relations that obtain among them, together with the mappings used by the fold. The graph represents those objects and relations; it does not make them obtain. - Result. One synthesized episteme whose claim content, exact EntityOfConcern, and effective reference scheme satisfy C.2.1. Its ClaimGraph integrates the retained conceptual and symbolic content; its provenance and SCR keep every contributing source and carrier traceable; and its provisional F/G/R values use the declared CL inputs. 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 under the result's effective reference scheme ([F-*,L1+]). # [M/F]
Compilation (target-scheme fold). Map one synthesized episteme into one exact target reference scheme.
- Domain. One synthesized episteme and the exact target reference scheme used to read the compiled claims—for example, the scheme used by a journal, standard, or program specification. For every meaning that crosses semantic contexts, the fold also relies on exact source and receiving
SchemeSenseCellvalues, an obtaining F.9 Bridge, and a separately stated bounded-use claim; any relied-on use must pass A.10 or B.3. - Result. One compiled, target-scheme episteme with explicit mapping and loss information and a C.2.1 identity determined by its claim content, exact EntityOfConcern, and effective reference scheme. The result is not thereby a publication, release, carrier, or accepted artifact.
Relationship to Γ_ctx / Γ_time. If the knowledge fold explicitly depends on argument order (for example, a derivation), the internal fold uses Γ_ctx for the sequence. If a temporal storyline matters, first identify each exact episteme and any obtaining C.2.1 edition relation; then use B.1.4/Γ_time to aggregate only the recovered temporal restrictions, relation order, or applicability windows required by the use. Γ_epist composes exact selected episteme inputs, not a label-defined current slice. If the result changes claim content, EntityOfConcern, or effective reference scheme, C.2.1 identifies another episteme. Use B.2 only when exact construction facts leave a separate existing-whole versus candidate-new-whole question.
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.
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 a numeric Φ table (default in §4.4) and a reproducibility tag on empirical edges.[F‑*,L1/L2]require formal derivability of the fold rules from LOG‑CAL; constructive mode annotatesproof.kind=constructive. # [M/F]
Core rules for epistemic aggregation (design‑time synthesis)
When computing Γ_epist^synth(D_know):
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. Identify the result's one exact EntityOfConcern. Reuse the same already identified entity when the inputs concern it. A governed least common ancestor in a domain taxonomy may support that identification, but the calculation does not create the entity. If the claim requires a collection, relation occurrence, or other joint subject, identify that entity under its direct pattern and show that its identity rule obtains. A list, dependency graph, shared label, or mapping cannot create a joint subject; if none is governed, stop with the missing composition governor instead of inventing a generic composite entity. Record the semantic mappings and their CL evidence summaries without silently merging 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.
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.
6. Conflict detection (no averaging).
Detect contradictions (for example, p and ¬p with overlapping scope). Do not average. Either (i) separate them by exact claim scope or interpretation basis, (ii) mark the affected claim provisional with explicit conflict edges, or (iii) if exact construction facts leave a whole-reidentification question after the existing-whole explanation check, open B.2 for that separate question.
7. 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_iwithmode: axiomatic, empiricalRis N/A; takeR_i_eff = F_i. Tag:line=formal. #[F‑*] - For
mode: postulative, use declaredR_iwith decay; Tag:line=empirical. # [M‑1/M‑2/F] - The aggregate
E_effMUST also declare a mode. If all inputs areaxiomatic, the output isaxiomatic. If any input ispostulative, the output MUST bepostulative. - 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]
8. 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]
9. No costs here. Any compute/collection effort is Γ_work; attach references but do not mix costs into epistemic aggregation.
Core rules for target-scheme compilation
When computing Γ_epist^compile(E_synth, TargetScheme):
1. Reference-scheme bindings. # [M-1+]
Map every operative concept, unit, and claim into TargetScheme and record the exact mapping and its CL evidence summary. For a meaning that crosses semantic contexts, name the source and receiving SchemeSenseCell values, the obtaining F.9 Bridge, the proposed use, direction, use-specific rule, and permitted loss; establish reliance separately. C.2.1 identifies the compiled episteme from its resulting claims, exact EntityOfConcern, and target scheme. A changed identity discriminator identifies another episteme; it does not by itself open a whole-reidentification question.
2. Assurance baseline (gated). Recalculate the assurance tuple (B.3) under TargetScheme: F and R may change with formalization, mapping evidence, and loss; G is re-expressed in the target scheme'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]
3. Compilation trace. Produce the compiled episteme's SCR and the carrier hashes needed to reconstruct this application; at L2 require independent re-hash verification. This trace establishes neither publication nor release. # [M-1/L2] 4. Order/time hooks. If the compiled episteme includes an internal derivation, carry the OrderSpec. If it selects knowledge for a time-bounded use, name the exact C.2.1 episteme identity and link to the already recovered proper temporal restriction, edition relation order, applicability window, or B.1.4/Γ_time aggregation actually 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_effalong each justification path, penalized by Φ(CL_min(path)); aggregateR_effas the minimum over paths. - Conflict handling:
E₂contradictsE₁in a subgroup; kept as provisional with explicit conflict edge and scope note (different baseline severity).
-
Γ_epist^compile (target journal scheme): Map outcomes to the journal's required scheme through the exact sense mappings used by the fold, recalculate F/G/R with mapping penalties, and produce the compilation SCR and hashes. The result is the target-scheme episteme "Guidance Statement v1.0" with conservative
R; any later journal publication is a separate publication occurrence. -
Why not averaging? Averaging would inflate
Rand 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_effbounded by the weakest justification path after Φ(CL_min); claim on “system‑level safety” marked provisional until assumption alignment is demonstrated.
-
Γ_epist^compile (target certification scheme): Map the claims to the regulatory vocabulary. Where local meanings differ, identify exact source and receiving
SchemeSenseCellvalues, test the F.9 Bridge, state the bounded certification use and permitted loss, and establish any relied-on use separately. C.2.1 identifies the resulting target-scheme episteme; a certification publication occurrence or acceptance verdict remains separate.
Contrast (didactic)
Proof obligations (normative)
At synthesis (Γ_epist^synth):
- 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.
- PO-SYN-OBJ. The result MUST name one exact EntityOfConcern already identified under its direct pattern. If the synthesis depends on several inputs as a joint subject, its collection, relation, or whole identity MUST be independently governed; a list, graph, label, or mapping is insufficient. Every semantic mapping used by the fold MUST be declared with its CL evidence summary.
- PO-SYN-CL. Every semantic mapping used by the reliability fold MUST have a CL evidence summary; the chosen penalty Φ MUST decrease monotonically as CL rises. Thresholds for marking a claim provisional MUST be stated. The summary neither establishes an F.9 Bridge nor grants the mapped use.
- PO‑SYN‑R.
R_effMUST be computed as min over justification paths of (claim reliabilities along the path minusΦ(CL_min(path))). No arithmetic mean is allowed for reliability. - PO-SYN-CONFLICT. Contradictions MUST be separated by exact claim scope or interpretation basis, marked provisional with explicit conflict edges, or—only when exact construction facts leave a separate whole-reidentification question—sent to B.2.
- PO‑SYN‑ORDER. If order matters, the OrderSpec MUST be recorded and Γ_ctx NC‑1..3 (determinism, context hash, partial‑order soundness) MUST hold.
- 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):
- PO-COMP-SCHEME. The exact target reference scheme MUST be declared. Every active concept and unit MUST have an explicit mapping; a cross-context meaning use MUST name the exact F.9 Bridge, separate bounded-use claim, permitted loss, and any relied-on A.10 or B.3 result.
- PO-COMP-ASSUR. The assurance tuple (F/G/R) MUST be recomputed under the target scheme with the applied mapping and loss penalties.
- PO-COMP-SCR. The compiled episteme MUST retain an SCR with the hashes, versions, and dates required to reconstruct the application. This obligation does not assert release or publication.
- PO-COMP-ID. The output MUST be identified through its C.2.1 claim content, exact EntityOfConcern, and effective target scheme. A changed discriminator identifies another episteme. B.2 is opened only for an independently current existing-whole versus candidate-new-whole question, never as a substitute for this identity rule.
- PO‑COMP‑ORDER/TIME. If derivational order is essential, the OrderSpec MUST be referenced. If temporal selection is essential, name the exact C.2.1 episteme identity and reference the already recovered proper restriction, edition-relation order, applicability window, and B.1.4/Γ_time aggregation actually consumed.
Conformance Checklist (normative)
Anti‑patterns & repairs
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.
- Target-scheme results. Compiled epistemes are aligned with one declared reference scheme; any release or publication remains separately governed.
- 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 B.2 only when exact construction and identity facts leave a genuine whole-reidentification question.
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.
- Interpretation matters. Exact reference schemes and local senses prevent quiet reinterpretation. F.9 governs any cross-context Bridge; C.2.1 governs the resulting episteme identity.
- 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: C.2.1 (episteme identity and independently obtaining edition relations), A.6.1 (semantic operation declarations and exact application bindings), A.14 (ConstituentOf, collection belonging under each collection's own rule, and proper temporal restriction of one unchanged carrier), and A.15/A.15.1 (Strict Distinction and Work-temporal law). A.12 is used only when an acting-side distinction is current. An ordinary actor sentence needs no classification apparatus. Any particular dated synthesis or compilation
U.Workfirst reuses each performer's A.13 core and is independently admitted under A.15.1; F.6 follows only when the receiving claim also needs precise assignment-bound attribution. A short local projection may omit an assignment identifier unused by the receiver only when every consumed relation remains recoverable. - 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).
- Coordinates with: F.9 for exact cross-context Bridges and bounded-use claims; A.10 or B.3 for reliance; A.15.PROD when production, first existence, or completion is current; and E.17/E.24.PUB for publication, form, and carrier. B.2 is used only when exact construction facts leave a separate whole-reidentification question after the existing-whole explanation check.
- Used by: B.3 assurance uses
F/G/Rand 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 already recovered relations over an exact set of ordered positions, phases, or a time window, and the question is not just ordinary part-whole construction. Typical cues are ordered steps, order-sensitive argument chains, asset histories, proper temporal restrictions of one enduring carrier, rolling windows, use-bounded roll-ups, time-sliced evidence, or a bounded chronology over exact C.2.1 episteme identities and already obtaining edition relations.
Not this pattern when. If the question is ordinary part-whole or collection admission, use B.1, A.14, and C.13. If it is episteme identity or historical edition continuity, use C.2.1 before any aggregation. If the question is the method as such, method description, work plan, dated work occurrence, or Work temporal part or episode, 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 the pattern that defines the subject's identity or change; 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 order-sensitive and temporal material while keeping method, work, transformation, work-resource, temporal-adequacy, and MHT claims with the patterns that define or test them.
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 or another enduring individual with a stated identity rule may be considered across proper temporal restrictions. An unchanged paper or dataset episteme may also be restricted to a proper interval only while its complete C.2.1 identity triple remains fixed; changed claim content, EntityOfConcern, or effective ReferenceScheme identifies another episteme, with edition continuity tested separately. In these cases the aggregation is about order or temporal coverage over already recovered relations, not about a new level, a generic boundary, or a hidden interaction kind.
B.1.4 defines the aggregation claim. It asks which EntityOfConcern is being aggregated, which positions or phases are included, which scope and time window qualify the claim, which ordered or phase relation is being used, what the aggregate may be used for, and which neighboring pattern carries any stronger claim.
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 stand for 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 positions or phases are included, which relation is ordered, which time window is covered, whether gaps or overlaps matter, or which pattern must carry a stronger work, resource, transformation, evidence, or whole-reidentification claim.
Forces
Solution
Recover a ContextTemporalAggregation@Context before using the aggregate:
stopOrReturnCondition states when to stop aggregating or apply another pattern; strongerSourceReturnCondition states the condition for a stronger claim. Include nonAdmissibleOverread? only when it passes F.19's plausible-reader test. groundedNonAdmissibleOverread? is an alias for that same optional value.
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
If one source phrase mixes both modes, split the record. A Method may have an ordered relation structure; the Work that enacts it may have exact A.15.1 temporal parts, episodes, operational parts, or separate occurrences, while C.27.TA supplies any independently declared overlap or other interval relation the receiving use aggregates. Those are different claims, and generic PhaseOf does not replace the Work or temporal relations.
Where Stronger Claims Go
Optional Operator Notation
Gamma_ctx and Gamma_time are optional notation for already recovered aggregation claims.
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 pattern that defines the exact relation. 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
OrderSpecis declared as total order, partial order, or another named relation; - independence, branch, or join conditions are named when parallel factors are used;
- the record names its included positions, ClaimScope when needed, and admissible use; any holon-boundary crossing is named by an exact relation;
- method, method-description, work, transformation, and resource claims use the patterns that define or test them.
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, andC.27when 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
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 edition history. When draft, reviewed, and camera-ready texts change claim content, EntityOfConcern, or effective ReferenceScheme, C.2.1 identifies distinct epistemes and tests each claimed EpistemeEditionRelation independently. B.1.4 may record a bounded chronology over those already recovered identities, relations, applicability windows, or publication windows; it does not turn the editions into phases of one episteme. If one unchanged episteme is genuinely needed over a proper interval, A.14 PhaseOf may state only that restriction. Source-currentness and publication-use claims use A.10, G.11, and E.17; chronology establishes none of them.
Cross-regime evidence window. A dashboard aggregates observations from two operating regimes. B.1.4 records the exact observation sets, their subject populations or carriers, the aggregation window, and the admissible use. If the regimes use different measurement bases, use C.16 or C.29 for comparability before relying on the aggregate.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
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. One enduring carrier with a stated identity rule can be considered through proper temporal restrictions; 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 the carrier's identity rule for legitimate phase aggregation; C.2.1 identity and independently obtaining edition relations for distinct episteme history; A.15.1 relations for Work; ordered relation refs and OrderSpec for contextual aggregation; and separate patterns for 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
Relations
- Builds on
B.1,A.14, andC.13for part-whole, phase, and constructive grounding discipline. - Coordinates with
C.2.1for exact episteme identities and independently obtaining edition relations; withA.3.1,A.3.2,A.15.2, andA.15.1for method, method description, work plan, dated work occurrence, and exact Work-temporal relations. - Coordinates with
B.1.6for work-resource aggregation. - Coordinates with
A.3.4for transformation. When whole reidentification or emergence-family wording is current,B.2.Ptests the problem and the relevant B.2-family pattern defines or constrains the recovered claim. - Coordinates with
C.27for temporal-claim adequacy. When mathematical expression is selected,C.29tests lens-use adequacy,E.18defines the selected transformation-flow structure, andE.18.2defines its mathematical description.
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
Problem Frame
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 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.
- a source presents Methods as a first–then list even though representative Work may also require several of them to contribute at the same time.
Primary EntityOfConcern. The EntityOfConcern is one exact candidate or composite U.Method, already identified under A.3.1. The proposition that exact part Methods and whole-forming facts qualify it as composite is separately governed claim content. A separately identified C.2.1 episteme may carry that proposition in its ClaimGraph; the episteme then has the exact candidate Method as its EntityOfConcern under its effective ReferenceScheme. The proposition does not become the episteme.
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, an A.22-selected U.Structure, method-family registry or selector outcome, mathematical lens, mechanism, formal substrate, or quoted wording that does not yet carry a method claim.
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 test whether an already identified candidate U.Method is composite and can state the needed part, order, join, interface, and identity facts without turning every useful sentence into a relation kind. If that qualification fails, the project still has a useful lower object: an A.22-selected U.Structure, description, plan, work occurrence, lens, selector result, or A.15.4 appearance-based reliance repair 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 claim-bearing episteme that describes a method or relations among methods, use
A.3.2andC.2.1. - 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, andB.3.5. - If the current claim is only a method-family registry, selector, fallback relation, or useful organization of already identified methods without one whole-method construction, use
G.5or select aU.StructureunderA.22.
Composition Question And Object Boundaries
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:
The whole method is not the diagram, code, schedule, event log, card, or work history that may describe, plan, record, or evidence it. Work enacts the method; the method does not perform work. An A.22-selected U.Structure may organize several methods and obtaining relations for one use without constructing another method.
Gamma_method is the name for this method-composition discipline. It is not a new root U-kind, not a workflow notation, not a generic container, not a resource-accounting operator, and not a substitute for U.Work.
Problem
Without B.1.5:
- Source-wording composition. "Step", "stage", "activity", "task", "procedure", "workflow", "pipeline", or "algorithm" wording is accepted as method composition without recovering the actual objects.
- Description-as-method. A workflow diagram, BPMN model, code repository, proof script, table, checklist, or graph path is treated as the composite method itself.
- Order as mereology.
SerialStepOf,ParallelFactorOf, guarded choice, or fallback relation is placed in a structural part-whole chain. - Typed joins disappear. One submethod's intended result is assumed to satisfy the next submethod's precondition without an adapter method, governed correspondence or equivalence, and an explicit failure route.
- Interface exposure is hidden. Callers rely on internal interactions that should be encapsulated, or fail to see interactions that the composite method must expose.
- Run-time leakage. Resources, timestamps, telemetry, performed values, and results are baked into the method instead of remaining occurrence-side facts and separately governed resource, result, and evidence relations.
- False whole method. A method-family registry, fallback table, selector rule, or A.22-selected relation organization is treated as one whole method although no construction or whole identity has been recovered.
- Sequence becomes level. A source list, vertical diagram, curriculum, or first–then account is treated as a subject hierarchy or level structure without an independently established level relation.
- Simultaneous contributions become stages. Methods that contribute during the same bounded Work situation are forced into one before-after chain because the source, presentation, or review visits them one at a time.
Forces
Solution
A.3.1 first identifies the exact candidate U.Method and every exact part method. B.1.5 does not create their U.Method membership. It asks the narrower question: do these already identified methods, contributions, constraints, and boundary decisions warrant the claim that the candidate Method is composite?
Start with the smallest useful composition claim:
- Name the same exact A.3.1 candidate Method and exact A.3.1 part methods.
- In ordinary domain language, state the candidate's reusable whole action, what each part contributes, and the order, guard, adapter, or join condition that the whole action actually needs.
- For every whole-forming statement other than B.1.5's narrow
methodPartOf, use A.6.RCD's lightest sufficient disposition: an existing direct predicate, a local compound claim, or a reusable predicate-definition episteme. A convenient edge label is not a relation-kind admission. - Add stable relation-occurrence identity, typed declarations, publication, or assurance only when a named dependent use consumes that extra result. Submit any relation-kind candidate to the exact E.24/E.24.UK admission predicates rather than admitting it here.
- If the whole action, boundary, contribution, or reidentification rule is still missing, stop the composite claim and keep the useful lower object under its subject pattern.
Minimal positive. BuildAndVerifyPumpUnit is already an exact A.3.1 Method. Its construction rule requires frame assembly, motor installation, connector adaptation when the installed connector does not meet the test precondition, and functional testing; installation and any required adaptation must finish before testing, and adapter failure stops the whole before test. These plain claims, exact methodPartOf facts, and the whole identity rule can warrant the composite-method qualification without minting one relation kind per arrow.
Discriminating non-composite. AssessVitals, ClassifyUrgency, and RouteToCare can support readable result-to-precondition and guarded-dispatch claims while still lacking one reusable whole action, complete boundary, and whole reidentification rule. Keep those claims local and do not call their organization a composite Method. Select an A.22 U.Structure only if a real receiving use needs a load-bearing selected organization.
When a caller system, planner system, substituting-method selection use, auditor, or assurance use needs a reliance-bearing account, check the complete coordinates below. This is a reading checklist, not a schema, record, RelationSignature, or set of SlotSpecs.
Recover Parts Before Composition
Do not start from the word "step". Start from the object claim.
An apparent step can be:
- a
U.Methodsubmethod; - a description constituent inside
U.MethodDescription; - a plan item inside
U.WorkPlan; - a dated
U.Workoccurrence or work part; - an order, fallback, or selector claim among independently identified objects;
- a mathematical or representation lens over selected relations;
- mechanism or formal-substrate material;
- quoted wording that does not yet carry a method claim.
Only the first case can be a method part. Do not mint U.StepSpec, U.StepMethod, U.MethodStep, or U.MethodAlgebra for the others.
B.1.5 directly governs MethodPartOfRelation, expressed in Plain register as methodPartOf(partMethod, wholeMethod). Both participants are exact U.Method values already identified under A.3.1. The predicate obtains exactly when the whole Method's stable construction rule names the part Method as a required contributor or as an admitted alternative for a required contribution, and that contribution participates in the whole's reusable action. It establishes neither A.14 structural-component parthood, a work part, nor a transformation part.
One methodPartOf occurrence is determined by the ordered pair <part Method, whole Method>. Every bounded alternative already admitted by the whole's construction rule can stand in methodPartOf at the same time; dated Work selecting one alternative does not start, end, or recur the other occurrences. For the same two exact Methods, the relation is atemporal: there is no silent cessation and later recurrence. If the construction rule changes so that a part is newly admitted or no longer admitted, the composite Method must be reidentified or the claim remains unresolved; reidentifying either participant gives another pair. This is why the participant pair is sufficient for the narrow family defined in B.1.5 even when actual enactments vary.
The same part Method may also stand in methodPartOf relations to several different whole Methods. Test every pair against the construction rule of its own whole. Each whole keeps its own reusable action, applicability, boundary, constraints, interfaces, accepted variations, and reidentification rule. One supported pair says nothing about another and creates no unique containing Method, discipline-wide whole, kind inheritance, transitivity, fusion, or common-whole closure.
A source label, list membership, diagram containment, shared name, registry entry, description membership, plan position, or work decomposition does not make methodPartOf obtain. When the test fails, keep the apparent step under its subject pattern and do not add a negative part merely to complete a diagram.
Test The Composite-Method Qualification
First identify the exact candidate Method under A.3.1 from its reusable action, participant meanings, applicability, preconditions, intended result or preserved condition, bounds, and failure or stop conditions. If that Method cannot yet be identified, require A.3.1. B.1.5 then tests whether already identified part Methods and exact whole-forming facts justify calling that same candidate a composite Method; it does not create the candidate's Method identity.
State each whole-forming fact in ordinary domain language before choosing its representational or ontological disposition. The words serial, parallel, guarded, iterative, fallback, adapter, and join do not settle the claim by themselves.
Before using a first–then or vertical list as Method architecture, make both checks.
- Preserve real order. Ask what must finish or become true before another Method can start or continue. Name the Methods, the required result or condition, any join or adapter, and the failure or stop route. Keep a genuine first–then result as an unfolding or order claim; its position does not make it a subject level.
- Test simultaneous contribution. Choose one bounded Work situation and ask whether several Methods contribute during it without all of them falling into one before-after chain. One Work whole may enact several Methods through separate A.15.1 relations. Alternatively, separately identified Work occurrences may overlap while enacting different Methods. State the Work identities and relations that actually obtain. Co-occurrence alone establishes no Method part, composite Method, Work part, or level.
Both answers may be true. A Method can contain a real ordered segment while other Methods contribute during the same broader Work. The source's reading order and the fact that several Methods are used together decide neither which Methods are parts of one whole nor whether any level exists.
Then use A.6.RCD. Reuse an existing direct predicate when one already governs the needed claim. Otherwise stop at a local compound claim when it closes this use, or publish a reusable predicate-definition episteme when several uses need the same rule. Continue to a relation-kind candidate only when a named receiver needs stable occurrence semantics that claim content cannot supply; E.24 and E.24.UK decide admission. A label such as precedesInMethod is readable claim language, not admission evidence, and an ordinary composition claim needs no invented occurrence.
Keep definition, signature, kind, and edition distinct. A predicate-definition episteme may independently satisfy ordinary A.6.0 U.Signature membership. It is not a RelationSignature; that specialization opens only for an admitted relation kind. Changed predicate-definition or signature content identifies another episteme under C.2.1. Treat and connect the two epistemes as editions through EpistemeEditionRelation only when C.2.1's historical-continuation test passes: exact source use and the applicable continuation rule identify which claim, EntityOfConcern, and scheme features must be preserved or may deliberately change, and the current facts satisfy that rule. Revision or supersession Work, Method, provenance, and change facts are evidence for this test; no label establishes continuity. Otherwise the later episteme is a non-continuing replacement. The changed content triggers review of dependent claims; it does not by itself prove another relation kind or relation occurrence. If a relation kind is independently admitted, its direct pattern or declaration defines applicability and occurrence identity, while current case facts establish obtaining, continuation, or cessation where relevant.
When several admitted order occurrences must be reviewed together, use B.1.4's OrderSpec, exact ordered-relation designations, and join or independence conditions in a separate bounded-use aggregation record. The record and optional Gamma_ctx notation neither participate in Method identity nor make any relation obtain. When the order statements remain local claims rather than admitted relation occurrences, compare those claim contents directly and do not pretend that an OrderSpec has occurrences to aggregate.
The composite-method qualification holds only when the candidate Method also has its own reusable semantic action, generic participant meanings, applicability, preconditions, intended effects or preserved conditions, invariants, bounds, accepted inputs and outputs, failure and stop conditions, and interface decisions. Its identity includes the exact part Methods and construction architecture on which those semantics depend. Cite an effective reference scheme or claim scope only when its variation changes a Method meaning or the use of a claim about that Method; neither is a generic container.
State the reidentification rule with the qualification. The same exact candidate continues through only those parameter changes, reorderings, or part substitutions that its A.3.1 identity rule already permits while preserving the whole action, applicability, preconditions, intended result or preserved condition, bounds, required joins, and interface boundary. A change outside those permitted variations identifies another U.Method. Use B.2 when a separate higher-level reidentification or emergence claim is current; a B.2 label is not needed to state an ordinary B.1.5 rule.
Keep Order Out Of Structural Mereology
Source cues such as SerialStepOf, ParallelFactorOf, guarded choice, iteration, fallback, adapter, and typed join call attention to possible whole-forming claims. They are not admission evidence, they need not become relation kinds, they are not A.14 component parthood, and they do not make methodPartOf obtain by themselves.
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 reusable ways of doing construct a larger reusable way of doing. The same project may need both, but the relation occurrences and truth conditions remain separate.
Use B.1.4 when a receiving use needs an inspectable order aggregation, partial-order test, or join/independence account. Its OrderSpec and optional notation describe already recovered order occurrences; B.1.5 still decides whether those methods and relations construct one composite U.Method.
When the current claim is a proper temporal restriction of one unchanged non-Work carrier, apply that subject's direct identity rule and A.14/B.1.4 rather than B.1.5. For MethodDescription history, compare the C.2.1 identity triples and assert EpistemeEditionRelation only when its historical-continuation predicate obtains. For Work intervals, episodes, performed parts, retries, resumptions, or later occurrences, apply A.15.1's exact relations; generic PhaseOf is not their substitute. A temporal boundary becomes a B.2-family question only when a separate whole-reidentification, closure, or supervision claim remains. Order, temporal restriction, episteme edition, Work segmentation, structural parthood, method composition, and whole reidentification remain different claims even when one source diagram uses one line for all of them.
Expose The Composite Method Interface
The candidate Method's reusable action includes a boundary decision for each interaction:
- exposed: a caller system may rely on the interaction as part of the whole Method;
- forwarded: a caller system may address an internal submethod interaction through a declared designation or adapter;
- encapsulated: the interaction is internal and cannot be relied on from outside the whole Method.
An exposure decision contributes to Method identity whenever changing it changes the reusable action or its admissible boundary. That identity consequence does not wait for an outside party to rely on the Method. A named caller, planner, auditor, substituting-method selection use, or assurance use instead determines when the decision must be stated explicitly or published for reuse. Name the interaction, precondition, result or preserved condition, failure route, and any adapter needed for each exposed or forwarded case.
Composite-Method Boundary Account and Publication Form
When a named receiver must reuse the boundary account, first identify one exact claim-bearing U.MethodDescription episteme under A.3.2 and C.2.1. Its claim content concerns the exact composite Method and states the exposed, forwarded, and encapsulated interactions. Then keep the publication-side objects and designation content below separate.
In B.1.5, composite-Method boundary account is the local Plain phrase for this MethodDescription claim content. A boundary-account form is the separately identified reusable arrangement used to present that content when publication is load-bearing. Neither phrase creates a new kind or acronym. The separate A.10 instantiation card keeps its different design-time use for Precedes, Choice, Join, guards, and exceptions.
- A bounded-use-declaration episteme states the operations or decisions supported by this publication, the conditions of that use, and the excluded stronger use.
- An audience-declaration episteme states the audience criterion. The actual audience consists of entities admitted by that declaration; those entities are not substituted for the declaration episteme as a publication-relation participant.
- An independently identified reusable boundary-account arrangement is a publication-form participant only while E.24.PUB
PublicationFormExpressionRelation(description edition, boundary-account form, bounded-use declaration)obtains. - A paper card, poster, page, file, or screen must first be identified independently as a physical or digital
U.PresentationCarrier; E.24.PUBPublicationFormBearingRelation(carrier, boundary-account form)then states which form it bears. - An actual system performs separate rendering, printing, uploading, indexing, or access-granting publication Work. That Work may establish or restore availability, but it is not the publication occurrence or one of its participants.
- One
EpistemePublicationRelationoccurrence, with the exact five participants<description edition, audience-declaration episteme, bounded-use-declaration episteme, boundary-account form, carrier>, makes the edition available to the declared audience for the declared use throughout its maximal continuous interval of availability. The relation occurrence is not performed by the publishing system, and the boundary-account form does not publish itself. - Names, labels, and links that designate the Method or description edition remain separately governed designation content. Neither the form nor the carrier establishes designation merely by displaying similar words.
These prompts organize presentation; they are not direct-relation SlotSpecs, relation participants, Method parts, or a schema that creates a Method. None supplies the world-side methodPartOf facts or any other whole-forming claim. For a lightweight internal use, state the few boundary decisions in clear sentences and stop; do not create a description edition, declaration episteme, boundary-account form, carrier, publication Work, or publication occurrence by ritual.
Keep Method Qualification And Work Occurrence Separate
B.1.5 evaluates and grounds the composite-method qualification of an exact U.Method already identified under A.3.1. A separately constituted U.MethodDescription may state that composition claim. Neither object creates performed Work.
One dated U.Work occurrence enacts one exact U.Method only when the A.15.1 method-enactment relation obtains. Recover each exact actual performer through A.13; A.15.1 then independently identifies the Work, time, containing System, and enacted Method. F.6 enters only when the Method-enactment account also consumes precise assignment-bound attribution through the same obtaining A.13 assignment; missing or failed F.6 leaves the Work and enactment intact. The System acts and the assignment does not. An assertion or occurrence description may cite those facts and the MethodDescription used; the Work occurrence does not store a card or record.
Parameter bindings, affected referents, resource use, telemetry, retries, results, actual transformations, production, evidence, evaluation, delivery, and acceptance remain separate objects and direct relations under their own governors. They do not become method parts, method identity fields, or generic Work outcomes merely because a report places them beside the Work.
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. An exact A.15.1 TemporalPartOf_work may enact the same whole method during its selected interval. An A.15.1 episode may span several method factors, repeat one factor, or be split by evidence policy without changing the method identity. Conversely, a work part does not establish a submethod. A work part enacts a submethod only when that submethod is already an independently identified U.Method and a separate enactsMethod(workPart, submethod) occurrence obtains.
Reader check. Before saying that a work part enacts a submethod, name both sides:
- the occurrence-side object: parent
U.Work, obtaining work-part relation, interval or boundary, and exact performer System recovered through A.13; only when this reader check expressly consumes precise assignment-bound attribution, also name the exact covering A.2.1 assignment and obtaining F.6 relation; add any separately obtaining resource or evidence relation only when used; - the method-side object: exact A.3.1 submethod,
methodPartOfoccurrence, whole-forming claim at its A.6.RCD disposition, preconditions, intended result or preserved condition, interface boundary, and whole-Method identity; - the cross-side fact: the exact
enactsMethod(workPart, submethod)occurrence.
If any 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. Keep a method-description node, evidence segment, mechanism material, system-component behavior, or A.15.4 appearance-based reliance repair request under its subject pattern.
Planning And Performed-Work Obligations
B.1.5 has three common use positions, but they are positions in use, not U-kinds:
- Planning or description-side use. A planner system performing planning Work recovers the exact Methods,
methodPartOfoccurrences, whole-forming claims at their A.6.RCD dispositions, any justified order aggregation, typed joins or adapters, interface boundary, invariants, and whole-level commitments. A resulting exactU.WorkPlanmay cite the MethodDescription edition on which it relies; neither the planning Work nor the plan is the reader that defines Method identity. - Performed-work use. Recover each exact actual performer through A.13, let A.15.1 independently admit the Work, and recover the exact
enactsMethodoccurrence for the whole Work. Add the exact covering A.2.1 assignment and F.6 relation only when this use expressly consumes precise assignment-bound attribution; missing or failed F.6 leaves the Work and enactment intact. Check capability fit or admission only when the work-entry decision consumes those claims; then check preconditions, order conformance, and exposed or forwarded interactions through their subject patterns. State resource use, evidence, and results only through their own obtaining relations. None becomes part 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 exact order claims and conditions at their selected A.6.RCD dispositions; any throughput or quality bound must name its characteristic, critical path, and weakest-link basis; strengthening a submethod, adapter, or typed join should not make the composite Method worse unless a stated side condition changes.
Stop Before Transformation Composition
Method composition and Work decomposition establish no U.Transformation part, composite transformation, transformation atomism, or TransformationPartOfRelation. Even when several method parts address the same referent and one Work enacts the whole method, identify each actual transformation independently under A.3.4. If a claim needs transformation composition and no direct transformation-composition governor supplies its participants, obtaining rule, and occurrence identity, return missing-governor[transformation-composition] for the proposed whole and independently identified changes. Do not infer either composition or indivisibility from the gap.
Select A Structure Below The Whole-Method Threshold
Use A.22 when independently identified Methods and already obtaining relations are useful to one question or action but do not construct one whole Method. For an actual load-bearing selection, first name the selecting system, selection Method, dated selection Work and bindings, and any result episteme needed to preserve the decision. Then name all four structure discriminators: exact constituents, exact selected obtaining relation occurrences, applied constraints, and the use frame. For a one-off hypothetical comparison, state the comparison and stop without asserting a selected U.Structure. MethodRelationStructure may be used as a local readable designator only for an actually selected structure; it is not a U-kind, relation kind, Method holon, or identity field.
Typical cases:
- a fallback registry selects among alternatives but supplies no whole method;
- a workflow diagram relates method descriptions but does not recover method parts;
- a method family has independently governed refinement, substitution, or dispatch relations;
- a graph or algebra represents selected method relations as a lens;
- the same method labels occur under different effective reference schemes, while the local senses have not been resolved and any F.9 Bridge would establish only sense correspondence, not method identity;
- a work plan orders tasks but does not define one reusable method.
The selected structure is a dependent organization for its named use. It does not create its constituents or relations, become a Method, or supply holonhood. Conversely, the internal construction of one exact Method whose composite qualification has been established does not become a second generic structure merely because a diagram can display it. Select a U.Structure only when that organization itself changes the next question or action.
This lower object is not a failure. It is the right governed object when relation organization is useful but whole-method construction is not current.
Archetypal Grounding — Worked Slices
Manufacturing Recipe
AssembleFrame, InstallMotor, AdaptMotorConnector, RunFunctionalTest, and BuildAndVerifyPumpUnit are exact U.Method values already identified under A.3.1; the last is now the candidate for a composite-method qualification. The four participant-determined occurrences methodPartOf(AssembleFrame, BuildAndVerifyPumpUnit), methodPartOf(InstallMotor, BuildAndVerifyPumpUnit), methodPartOf(AdaptMotorConnector, BuildAndVerifyPumpUnit), and methodPartOf(RunFunctionalTest, BuildAndVerifyPumpUnit) obtain because the stable whole construction rule names each contribution. Every already admitted connector-adapter alternative may stand in methodPartOf simultaneously; one Work occurrence selecting an alternative does not toggle those atemporal occurrences. Removing a contribution from the construction rule, adding a new admitted alternative, or changing a required order, join, whole result, or boundary outside the declared variations identifies another whole Method.
For the ordinary use, say: the installed motor must provide the harness-installed condition required by functional test; when the supplier connector does not provide it, AdaptMotorConnector must provide the conversion before test; adapter failure stops the whole before test. In this one use, PumpInstallBeforeTest and PumpConnectorAdapterJoin are readable labels for local compound claim content in the exact PumpBuildCompositionDescription-v1 : U.MethodDescription episteme under A.3.2 and C.2.1, not relation-kind names or occurrence designators. If several pump-family uses need the same parameterized rule, A.6.RCD can identify a reusable predicate-definition episteme. Only a later named receiver that needs stable occurrences can justify evaluating a derived-kind candidate under E.24 and E.24.UK.
The composite qualification additionally requires the candidate's generic participants, applicability, preconditions, accepted inputs, final effect, preserved conditions, exposed start and abort interactions, encapsulated calibration interaction, failure routes, and reidentification rule. A list of the five names or an arrow diagram establishes none of these facts.
PumpUnitBuildWork-2026-07-29 may enact the whole through one exact enactsMethod occurrence without four corresponding work parts. If a separately admitted MotorInstallationWorkPart-2026-07-29 exists, it enacts InstallMotor only through its own enactsMethod occurrence. Resource use, test telemetry, the produced pump unit, acceptance, and evidence remain under their subject patterns.
Emergency Intake
RegisterPatient, AssessVitals, ClassifyUrgency, and RouteToCare are independently identified Methods. For a one-off protocol review, the practitioner may state two local claims in ordinary language: the intended vital-sign result meaning of AssessVitals must satisfy the admitted input meaning of ClassifyUrgency; and the declared triage rule decides which admitted urgency category holds from the declared vital-sign conditions and, when the protocol uses them, the declared symptom conditions, then maps that category to one compatible RouteToCare. If no category or several incompatible categories hold, the practitioner stops the routing decision and returns the guard rule for repair. These are useful claim contents, not MethodResultPreconditionRelation or MethodDispatchRelation admissions.
This review is deliberately hypothetical and non-load-bearing. It compares the four Methods and the two claims but does not assert a persisted U.Structure or a selection judgment. If a later receiving use needs an A.22-selected structure, its selection must identify the exact selecting system, selection Method, dated selection Work and bindings, and—where the result must persist—the result episteme. The structure itself is then identified by all four A.22 discriminators: exact constituents, exact independently admitted obtaining relation occurrences, applied constraints, and use frame. The present local claims cannot be relabelled as such occurrences merely to fill that list.
The comparison still discriminates the non-composite case. No reusable whole action, complete precondition-to-result boundary, response to every guard conflict, or whole reidentification rule has been established. A wall poster may be a carrier bearing a publication form; an exact U.MethodDescription edition is a different claim-bearing episteme, and an actual publication occurrence is what makes that edition available to an audience. For intake Work, recover each actual performer through A.13 and admit the Work independently through A.15.1. Only if this comparison also consumes which assignment covered that Work should it separately check the A.2.1 occurrence and obtaining F.6 attribution; capability or admission claims consumed by entry remain separate. None of these facts is a Method part.
If a later hospital protocol first identifies an exact A.3.1 Method such as EmergencyIntakeMethod-v4 with the missing whole semantics, B.1.5 can test its composite-method qualification. Neither a poster, the one-off comparison, nor a later selected structure turns into that Method.
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 constituents of a U.MethodDescription, and some may be recovered as U.Method values.
After the candidate whole represented by the pipeline and every claimed part have been independently identified as exact A.3.1 Methods, that candidate qualifies as composite only when exact methodPartOf occurrences, whole-forming claims at their A.6.RCD dispositions, accepted inputs and outputs, invariants or admissibility conditions, typed joins, fallback behavior, failure conditions, interface decisions, and reidentification rule are present. Otherwise keep the graph as a MethodDescription, mathematical lens, mechanism material, or—when an actual selection basis and receiving use exist—an A.22-selected U.Structure.
Suppose one dated training Work enacts the exact pipeline Method while three independently identified transformations occur: the feature store changes, model parameters change, and the ranking index changes. Common Work, shared data, Method order, and temporal adjacency do not establish transformation parts or one composite transformation. Without a direct transformation-composition governor, retain the three transformations and return missing-governor[transformation-composition] for the proposed three-change whole; do not call them atomic either.
Evidence Synthesis And Publication
CollectDatasets, NormalizeSchemas, EstimateModel, CrossValidate, DraftManuscript, and EvidenceSynthesisAndPublication-v3 must first be exact A.3.1 Methods. B.1.5 can qualify the last as composite only when every claimed methodPartOf occurrence obtains and its whole-forming claims and constraints pass A.6.RCD's lightest sufficient disposition. In ordinary language, the intended result of NormalizeSchemas must satisfy the admitted input meaning of EstimateModel; legacy datasets may require adapter Methods; CrossValidate may be a critical cutset for later assurance; and a provenance condition may be a precondition of DraftManuscript before publication Work begins.
A paper draft, workflow diagram, repository, or notebook may be a claim-bearing episteme, a representation, or a carrier; its form does not make it the Method. Publication Work is U.Work. Compute, storage, reviewer time, artifact production, release, and acceptance stay with their subject patterns.
EvidenceSynthesisInterfaceDescription-v3 : U.MethodDescription may state that the Method exposes Submit() and ReleaseArtifacts(), forwards CrossValidate.Folds(k), and encapsulates ad hoc scrubbing utilities. Identify SubmissionReleaseBoundaryAccountForm-v3 independently as the reusable arrangement entity selected as the boundary-account form. Identify EvidenceSynthesisMethodsPage-2026-07 : U.PresentationCarrier independently as the digital carrier. Identify SubmissionAndArtifactReleaseUse : U.Episteme as the bounded-use declaration whose claims state the supported submission and artifact-release operations, their conditions, and the excluded stronger use. Identify SubmittingResearchersAudienceDeclaration-v1 : U.Episteme as the audience declaration whose claims select the authorized submitting researchers; those researchers are the declared audience, not a participant substituted for the declaration episteme.
PublicationFormExpressionRelation(EvidenceSynthesisInterfaceDescription-v3, SubmissionReleaseBoundaryAccountForm-v3, SubmissionAndArtifactReleaseUse) must obtain for that form use, and PublicationFormBearingRelation(EvidenceSynthesisMethodsPage-2026-07, SubmissionReleaseBoundaryAccountForm-v3) must obtain for that bearing claim. ResearchPublicationSystem performs the separate EvidenceSynthesisInterfacePublicationWork-2026-07 : U.Work, which may establish or restore availability. The distinct EvidenceSynthesisInterfacePublication-2026-07 occurrence of EpistemePublicationRelation has the five fixed participants <EvidenceSynthesisInterfaceDescription-v3, SubmittingResearchersAudienceDeclaration-v1, SubmissionAndArtifactReleaseUse, SubmissionReleaseBoundaryAccountForm-v3, EvidenceSynthesisMethodsPage-2026-07> and carries the description edition's enduring availability to the audience selected by the audience declaration for the bounded use. Publication Work is not a participant of that occurrence. None of these description, declaration, form, carrier, Work, or publication-relation objects creates an interaction, SlotSpec, Method part, or composition fact.
Ordered Preparation And Simultaneous Performance
A music-and-dance performance can contain both kinds of fact. Venue setup, safety checks, and interface checks may need a real order before the public performance starts; a failed safety check may stop the unfolding. Preserve that order when the exact Methods and conditions support it. It is not a level structure.
During the performance, dancing, music making, sound mixing, lighting, and stage coordination may contribute at the same time. If the project identifies one performance Work whole, it may enact several exact Methods through separate relations. If it identifies several Work occurrences, state which overlap. Do not rewrite these contributions as five stages merely because a production plan or review lists them one by one. Conversely, do not erase real setup, cue, or handoff order merely because the overall performance is simultaneous.
The same two-way check applies elsewhere. In engineering Work, a lifecycle or product order does not prove that architecture, realization, integration, assurance, and feedback form one sequence. In operating Work, a workflow line does not serialize queues, commitments, resources, measures, and improvement. In capability development, preparation Work may precede the target Work while several target Methods contribute together during the transfer check. Preserve every real continuation condition, but do not invent order among concurrent contributions.
Bias-Annotation
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: cross-domain order-sensitive composition of already identified U.Method values. It does not cover sole-Method identification, description-only organization, dated Work decomposition, structural mereology, or transformation composition without a direct governor.
- Gov: each
methodPartOfoccurrence and each other whole-forming claim stays with its direct governor; a named receiver changes how much of the boundary account must be stated or published, not whether a world-side fact obtains. - Arch: the whole is qualified from exact part Methods and construction facts; order aggregation, a selected A.22 Structure, and a separate higher-level reidentification claim remain distinct architectural objects.
- Onto/Epist: Methods and obtaining relation occurrences remain distinct from MethodDescription claims, boundary-account presentation, carriers, publication Work, and publication occurrences.
- Prag: ordinary use may stop at readable local claims; reusable definitions, relation kinds, declarations, publication, and assurance are added only when a named receiving use needs them.
- Did: the manufacturing, emergency-intake, learned-pipeline, evidence-synthesis, and performance slices show positive composition, useful non-composite stopping results, and the difference between real order and simultaneous contribution across domains.
The pattern intentionally biases toward explicit construction and boundary accounts when joins or outside reliance are load-bearing. The lightweight local-claim lane and subject-pattern exits mitigate that bias so inspectability does not become ritual apparatus.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
B.1.5 buys inspectable Method composition without confusing the candidate Method, composition claim, MethodDescription, selected Structure, Work occurrence, resource use, and assurance argument. The practitioner can say which exact Methods are parts, which ordinary whole-forming claims and constraints qualify the candidate as composite, which interactions belong to its boundary, what exact Work enacts it, and where a stronger claim must stop.
The cost is proportionate explicitness: exact Methods, methodPartOf occurrences, whole-forming claim content, order and join conditions, interface decisions, whole semantics, and reidentification must be stated before the composite qualification can be relied on. Ordinary use can stop at readable local claims; reusable definitions, relation kinds, declarations, publication, and assurance are added only when a named receiver needs them.
Rationale
The rationale is a strict object separation. Paying this explicitness cost exposes brittle joins and accidental external dependencies at Method boundaries before someone relies on the composite claim. Order is semantic but not structural parthood. A method can be a non-agentive holon, but a step label, graph node, phase, source section, description constituent, plan item, or work part is not a method part until the U.Method and methodPartOf occurrence are recovered. Gamma_method concerns ways of doing; Gamma_work supports occurrence-side resource analysis; B.3 evaluates assurance; A.22 selects useful relation organizations; B.2 handles a separately current higher-level reidentification claim. None of those neighboring objects replaces the direct B.1.5 construction facts.
SoTA-Echoing
These rows answer the B.1.5 practice question: how to decide and expose order-sensitive Method composition without mistaking descriptions, Work, event records, or construction diagrams for the composite Method.
Currentness and reopen. These four decisions are qualified by the exact source selections cited above. Reopen only the affected row when a cited source or edition is superseded, or when newer practice changes the relied-on model/occurrence separation, order or join condition, interface or substitution boundary, or construction and reidentification test. Recheck that row's B.1.5 adoption, refusal, and affected Solution, worked-case, checklist, and Relations loci; leave unaffected rows closed.
Relations
- Uses
A.1for the general non-agentive-holon recognition boundary; A.1 does not supply Method-part or whole-forming facts. - Uses
A.3.1to identify the exact candidate Method and every exact part Method before B.1.5 tests the composite-method qualification; B.1.5 directly governs onlyMethodPartOfRelationand the composite-construction test. - Uses
A.6.RCDfor serial, parallel, guarded, iterative, fallback, adapter, join, substitution, and other whole-forming claims. Existing direct predicates, local compound claims, and reusable predicate definitions are valid stopping results; only a named occurrence-semantics need requiresE.24 for a kind candidateandE.24.UK. - Uses
A.6.RELonly when an independently admitted relation kind has an obtaining occurrence whose identity a receiver consumes. B.1.5 does not manufacture occurrence semantics for ordinary claim content. - Uses
C.2.1to identify predicate-definition, signature, and MethodDescription epistemes and any later episteme with changed identity-bearing content. UsesEpistemeEditionRelationonly when C.2.1's exact historical-continuation predicate obtains; otherwise the later episteme is a non-continuing replacement. A predicate definition may satisfy ordinary A.6.0U.Signaturemembership; only an admitted relation kind can have aRelationSignature. - Uses
B.1.4only when a receiving use needs an explicit aggregation of already admitted, obtaining order relations, anOrderSpec, and join or independence conditions. - Uses
A.3.2for each exact claim-bearingU.MethodDescriptionandE.24.PUBonly when a named use requires publication detail: independently identified bounded-use- and audience-declaration epistemes, boundary-account form andU.PresentationCarrier; exactPublicationFormExpressionRelationandPublicationFormBearingRelation; separate publication Work performed by a system; and the five-participantEpistemePublicationRelationoccurrence that makes the edition available. Raw audience and designation content remain separately governed. - Uses
A.22.CGUSwhen a real first–then, guarded, branching, or returning unfolding is the useful result; an unfolding position is not a subject level or evidence that all contributions are sequential. - Uses
A.15,A.15.1, andA.15.2for exact datedU.Work,enactsMethod, and plans; usesA.2,A.2.1, and F.6 for local system-role-kind and Method alignment, separately declared assignment species, actual assignment occurrences, and obtaining Work–assignment attributions. The Method does not act, Work is not a relying reader, and neither a system-role kind nor an assignment performs Work. - Uses
B.1.6andGamma_workonly for occurrence-side work-resource aggregation after the Work and resource relations are recovered. - Uses
B.3for cutset, weakest-link, CL-sensitive mapping, and assurance claims; composition alone supplies no assurance verdict. - Uses
A.22only for a real selected organization with its selection basis and four identity discriminators. A one-off hypothetical comparison and local whole-forming claims do not assert a selectedU.Structure. - Uses
C.13only after B.1.5 supplies exact Method parts, whole-forming facts and constraints, and the whole reidentification rule; C.13 consumes those facts but does not create them or require one relation kind per fact. - Keeps A.14 structural-component parthood distinct from Method composition; coordinates with
B.3.5only when a published structural claim and its grounding are current. - Uses
B.2when a separate higher-level reidentification or emergence-family explanation is current; ordinary composite-Method identity still needs its explicit B.1.5 rule. - Uses
G.5when a Method-family registry, selector, fallback, or candidate-set decision is current but no whole construction is claimed. - Uses
C.29,A.6.1, andE.20when a mathematical lens, formal substrate, mechanism, or representation-maintenance claim is current. - Uses
E.10for method, step, process, workflow, ownership/stewardship, requirement, and source wording precision recovery. - Stops before any positive transformation-composition or transformation-part claim until a direct governor supplies exact participants, obtaining semantics, and occurrence identity.
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 exact dated Work occurrences, A.15.1 temporal or operational Work parts, event-bounded episodes, non-Work carrier phases with an established identity and PhaseOf relation, 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 or which Work temporal part, episode, operational part, retry, resumption, or later occurrence is current, 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 bounded aggregation of already recovered temporal relations 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 pattern.
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. A replayable chain that keeps the resource Characteristic, measurement work/result episteme, aggregation work/result, exact policy, work parthood/overlap, and provenance separately recoverable while preventing double counting.
Problem Frame
Practitioners need to roll up work-resource claims across runs, exact A.15.1 Work temporal parts or episodes, teams, devices, stations, model-training epochs, non-Work carrier phases with an established identity and PhaseOf relation, or evidence-production occurrences. The recurring error is to treat a method, method description, plan, phase label, dashboard, or expected efficiency as if it were measured performed Work or as if the label established a Work relation.
Use B.1.6 for the work-resource aggregation claim. Treat dated work occurrence, Method, MethodDescription, WorkPlan, resource ledger, holon delimitation, transformation, evidence, and whole reidentification as separate claims under their applicable patterns.
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
Solution — separate measurement from aggregation
Start with one direct sentence:
Dated aggregation work
W_aggapplied policyPto the exact C.16 resource-result epistemes for work setW_set, under declared work-part/overlap relations and accounting boundaryB, and obtained aggregation resultR_agg; C.2.1 epistemeE_aggstates that result and A.10/G.6 record its provenance.
If any referenced resource value lacks its resource Characteristic, measurement work, result episteme, Scale/Unit, uncertainty when current, or provenance, it is not repaired by adding a ledger row.
WorkResourceAggregation@Context is a descriptive account for one aggregation claim:
stopOrReturnCondition states when to stop or return to another pattern. Include nonAdmissibleOverread? only when it passes F.19's plausible-reader test. groundedNonAdmissibleOverread? is an alias for that same optional value.
Recover each of these objects and claims independently:
- a resource Characteristic says which quantity or property is accounted for;
- measurement work and a C.16 measurement-result episteme supply each attributed resource value, Scale, Unit, uncertainty, model, calibration, and time stance;
- the aggregation policy declares inclusion, conversion, weighting, missing-value, partition, overlap, and deduplication rules;
- aggregation work has its actual performer identified through A.13 and is independently admitted as dated
U.Workthrough A.15.1; if the aggregation account must also identify the assignment under which the Work was performed, F.6 checks that relation separately; Method, actual inputs through direct relations or A.6.1 bindings, resources, and temporal extent remain separate; - the B.1.6 aggregation result is the typed total, vector, interval, or bounded estimate obtained under that policy and work set;
- a distinct C.2.1 aggregation-result episteme states the result, work set, policy, boundary, time window, qualifications, and uncertainty; and
- A.10/G.6 provenance makes the measurement sources, transformations, aggregation work, and result episteme replayable.
A ledger, dashboard, policy, profile, clause, citation, or graph edge may represent or cite this chain. None establishes work occurrence, actual participation, measurement, aggregation, or result identity by presence.
Subject Pattern Map
Optional Gamma_work Notation
Gamma_work is optional notation for a recovered WorkResourceAggregation@Context.
The notation applies only after the resource Characteristics, C.16 measurement Work and result epistemes, dated Work set, every A.15.1 Work-part relation used by the aggregation, any C.27.TA overlap fact used by it, any separately current non-Work carrier identity and PhaseOf relation, accounting boundary and time window, aggregation policy, and dated aggregation Work have been named. The notation then summarizes that recovered aggregation record.
Ledger Discipline
The ledger is a replay surface, not the source of the aggregation claim. For every resource component it records:
- resource Characteristic, Scale, Unit, polarity when relevant, and accounting boundary;
- exact measured or estimated subject, time window, and work occurrence to which the value applies;
- C.16 measurement work and measurement-result episteme, including model, calibration, uncertainty, and provenance refs when current;
- every A.15.1 Work-part relation used by the ledger, every C.27.TA overlap fact used by it, and any separately current non-Work carrier
PhaseOf, each independently established by its subject pattern; - shared resource, meter, person, tool, stock, data, port, or time-window overlap and the exact deduplication rule;
- conversions, normalizations, imputations, and their declared method/policy refs;
- the aggregation policy edition and actual aggregation work occurrence;
- aggregation result and distinct C.2.1 result episteme; and
- A.10/G.6 source and provenance refs, G.11 currentness when current, admissible use, stop or reopen condition, and any guard justified by F.19's plausible-reader test.
Measured, estimated, normalized, converted, allocated, and planned values remain visibly different. A planned value does not become a measurement result or performed-work resource use. A citation to a meter or invoice does not establish the measurement work; a ledger row does not establish work parthood or overlap.
Use PortionOf only for a resource portion with its A.14 measure and additivity basis. Use PhaseOf only for a proper temporal restriction of one unchanged non-Work carrier after its direct identity rule and interval conditions hold. For Work, use A.15.1 TemporalPartOf_work, EpisodeOf_work, OperationalPartOf_work, or another admitted Work-part relation only between independently admitted Work participants after its predicate passes. Route interval overlap through C.27.TA. Use retry or resumption only through a locally declared species with the needed participant meanings, predicate, identity, cardinality, and applicability; otherwise keep separately identified occurrences. Belonging to a collection, common timestamps, shared identifiers, a phase label, or co-listing in the ledger establishes none of those relations.
Aggregation Rules
Typed resource basis. Aggregate only values whose resource Characteristic, Scale, Unit, subject, and accounting boundary are compatible under the declared policy. Joules, hours, kilograms, currency, bytes, and attention do not become one scalar by co-location.
Measurement before aggregation. Each measured input points to exact C.16 measurement work and one measurement-result episteme. Raw meter output, indication, resource stock, attributed value, aggregation input, and later efficiency verdict remain distinct.
Exact Work set. Name every dated Work occurrence included. Parent–child, TemporalPartOf_work, EpisodeOf_work, OperationalPartOf_work, and other admitted Work-part relations must already obtain between exact Work participants under A.15.1 or their direct subject patterns. Any overlap fact comes through its exact C.27.TA temporal declaration. A Method, plan, epoch or phase label, invoice period, or dashboard grouping does not establish the Work set.
Exact policy. The aggregation policy states inclusion/exclusion, conversion, normalization, weighting, missing-value treatment, boundary allocation, uncertainty treatment, overlap/deduplication, and output kind. A policy declaration is not aggregation work or a result.
Overlap and shared stocks. Addition is admissible only for disjoint partitions or after an exact policy handles overlap. Shared people, tools, meters, inventories, datasets, ports, and time windows require the direct shared-use/overlap fact and a justified allocation or deduplication rule.
Aggregation work and result. Use A.13 to identify the actual performer and A.15.1 to admit the dated aggregation Work independently. If the aggregation account must also identify the assignment under which the Work was performed, check that relation separately through F.6. Keep the Method, actual bindings, resources, and time separate. State the B.1.6 result as a typed total, vector, interval, or bounded estimate under the named policy and Work set; then state it in a distinct C.2.1 episteme.
Uncertainty and provenance. Propagate measurement uncertainty and model/conversion uncertainty according to the exact aggregation policy. Use A.10/G.6 paths to record the established work, measurements, policy application, transformations, result, and sources.
Plan/result separation. Keep expected use from a method description or WorkPlan as planned and resource readiness under A.15.5. Use A.15.1 and the measurement or aggregation predicates for performed Work and measured results.
Efficiency and yield. A ratio or yield claim names its input resource results, exact output/domain result, measurement bases, aggregation work, and comparison policy. It does not use a generic output-result relation. Apparent free gain remains a measurement, accounting-boundary, substitution, or whole-reidentification question until its subject pattern is recovered.
Compact Obligation Rows
Archetypal Grounding
Engine test programme. C.16 measurement Work attributes fuel mass, electrical energy, operator time, and emissions values to exact subjects under their Scales, models, calibration bases, windows, and uncertainties. Each has its own result episteme. Exact test-run occurrences and obtaining A.15.1 Work-part relations define the included Work set; independently declared C.27.TA overlap facts state shared timing. A test-cell or engine phase enters only through the carrier's identity rule and proper phase relation. Shared warm-up energy is recorded under the exact temporal and resource-use facts. Dated aggregation Work applies ProgrammeResourcePolicy-v3, which allocates warm-up energy once and propagates input uncertainty. The B.1.6 result is a typed resource vector plus qualifications; a C.2.1 episteme states it. A later emissions verdict remains separate evaluation Work and result.
Manufacturing cell. Welding and painting are two dated work occurrences. Electricity, gas, consumables, and labor time are separate resource Characteristics with measurement-result epistemes. A shared extraction fan and overlapping operator time require direct shared-use facts and an allocation policy. The resource ledger represents those facts. Establish any separately claimed Work-part relation or frame transformation through its direct pattern.
Model training. Epoch labels alone do not establish work parts. Ground the training work and exact slices, then recover C.16 measurements for compute energy, storage traffic, and operator time. Aggregation work applies an edition-pinned policy to those result epistemes. The algorithm remains a method description; trained-model identity, fairness result, provenance, assurance, and deployment decision stay with their subject patterns.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
This pattern defines a conservative predicate and result form for typed resource aggregation while keeping each input measurement, performed work occurrence, aggregation policy/application, result episteme, work relation, and provenance path distinct.
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 a convenient total can hide several ontically different chains. Its result is obtained only after exact resource measurement, work-set and overlap grounding, an edition-pinned aggregation policy, and dated aggregation work. The ledger represents that recovered account.
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 qualification was checked against the publishers' current surfaces on 2026-07-30. Because ISO and GHG Protocol announced active joint development of an updated product-accounting standard in 2026, these decisions remain qualified only through 2027-01-30 unless a new draft, amendment, confirmation status, or published replacement appears earlier. Internal FPF neighbour authority stays in Relations; it is not presented as an external source decision.
Source refresh is local: replay the row's named rule, case, and checklist rows first. Widen only when that replay contradicts another current B.1.6 locus; a changed accounting source cannot by itself create work, overlap, measurement, result episteme, provenance, or a downstream verdict.
Relations
- Builds on A.13 for actual performers, A.15.1 for independently admitted dated measurement or aggregation Work, F.6 when a result must also identify the assignment under which that Work was performed, and A.6.1 for declarations and actual bindings; C.2.1 governs measurement-result and aggregation-result epistemes.
- Coordinates with
A.3.1,A.3.2, andA.15.2for method, method description, and work plan. - Coordinates with
A.15.5for 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
A.15.1for exact Work temporal parts, episodes, operational parts, overlaps, retries, resumptions, and later occurrences; withB.1.4only for bounded aggregation of already recovered temporal relations; and withC.27for temporal-claim adequacy. - Coordinates with
A.1,B.1,A.14, andC.13for holon delimitation, part-whole, proper temporal restriction andPhaseOffor a non-Work carrier, and constructive grounding. - Coordinates with
A.3.4for transformation. When whole reidentification or emergence-family wording is current,B.2.Ptests the problem and the relevant B.2-family pattern defines or constrains the recovered claim. - Coordinates with
C.16for resource Characteristics and measurement results;A.10andG.6for provenance;G.11for currentness;C.29for representation or mathematical-lens claims; A.15.1 for Work relations; A.14 and B.1.4 for non-Work part or phase relations and their bounded aggregation; E.17 for publication; and the applicable comparison, assurance, transformation, reidentification, or decision pattern when those uses are current.
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, part relation, constitutive assembly, objective, supervision, capability envelope, agency threshold, or temporal consolidation 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 episteme whole recognized under the already admitted
U.Epistemekind rather than remaining a loose catalogue; - separately governed structure, functioning, method, and work facts support a capability envelope that the existing whole cannot explain; evidence separately supports the claim about those facts;
- an architecture residual cannot be explained inside the existing whole.
First useful move. Compare the observed gain or shift with explanations that preserve the existing whole. If better parts, corrected relations, improved measurement, Method or Work repair, richer phase coverage, or architecture-view repair is sufficient, stay with the existing whole and use that subject pattern. 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 exact existing whole, the separately governed facts that challenge its identity, the exact candidate new whole, and decide whether the existing whole continues or the new whole must carry the claim before relying on evidence, a record, or a receiving-use decision.
Not this pattern when.
- If the claim is ordinary part-whole construction, use
B.1,A.14, andC.13. - If the claim is a whole-level characteristic change, use
C.16and the direct measurement or evaluation pattern. - If the claim is capability without whole reidentification, use the direct capability and characteristic patterns.
- If the claim is transformation or work, use
A.3.4,A.12,A.15, andA.15.1. - If the claim is only wording repair for emergence-family language, use
B.2.Pfirst. - If the claim is graph, RG-like, MSPD, or other mathematical expression, use
C.29unless whole reidentification is also current.
Problem Frame
A Meta-Holon Transition is not a new root ontology, generic emergence label, or mathematical graph result. It is a whole-reidentification claim about an exact holon already recognized through A.1 construction, identity, part relations, whole-level characteristics, and a direct kind-specific pattern.
The old whole remains a possible explanatory object. Use B.2 only when the old whole is no longer the right EntityOfConcern for the current claim. The candidate new whole can be recognized as a U.System, U.Episteme, U.Method, U.Work, U.Discipline, or another holon kind only after E.24.UK has admitted that public kind and the exact candidate satisfies A.1 plus the direct kind-specific criterion.
Problem
Without B.2:
- New whole is missed. A constructive assembly or coordinated closure changes the object, but evidence and architecture still point to old parts.
- Ordinary improvement is overclaimed. A better component, stronger measurement, or corrected method is called emergence.
- Record fields become ontology. A result field, trigger mnemonic, profile, or checklist is treated as a U-kind or actor.
- Agency becomes binary. A threshold crossing is read as “agent or not agent” instead of a characteristic-space threshold for an admitted System. A local system-role kind, classification, or assignment is a separate optional fact and neither establishes nor is required for the agency characteristic.
- Mathematics replaces ontology. A graph, RG-like flow, MSPD score, or benchmark jump is treated as MHT without recovering the holon claim.
- Transformation becomes containment. A system changing another holon is treated as its part or the larger whole containing it without a separately obtaining part-whole relation.
Forces
Solution
Use B.2 as a world-side whole-reidentification pattern. Start with the actual wholes and the facts governed by their direct patterns; add records only when a receiving use needs them.
- Name the exact existing whole, its admitted kind, and its identity or reidentification rule.
- Recover each changed delimitation, constituent, constructive part relation, assembly, supervision, objective, capability, characteristic, or temporal fact under its direct pattern. A cue word, profile field, measurement, or graph edge does not make the fact obtain.
- Test whether those facts can be explained as a change of the same whole. If repair, maintenance, changed characteristics, phase coverage, method or work correction, measurement, or architecture-view correction is enough under the existing reidentification rule, keep that whole and stop B.2.
- If the existing whole is not enough, identify the exact candidate new whole and execute the complete A.1 criterion. Recover its constituents, obtaining constructive relations, assembly, reidentification rule, and composition-grounded whole characteristic. Also show that the candidate's actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy the applicability and compatibility conditions of at least one governed larger-assembly construction method or rule under which it can remain a constituent. Then name its already admitted holon kind and satisfy the direct kind-specific criterion. If a required condition fails, the candidate fails A.1; if missing evidence or an unavailable dependency prevents a determination, evaluation returns
unknown. - State the whole-reidentification claim: why the existing whole no longer carries the current subject claim and why the candidate new whole is the EntityOfConcern. This comparison does not itself create, admit, or classify either whole.
- Materialize a trigger profile, optional explanation-result episteme, reidentification assertion, or record only when a named receiving use must inspect, cite, compare, or preserve that claim.
The optional MHTTriggerProfile, ExistingWholeExplanationResult, and HolonReidentificationRecord are ordinary C.2.1 epistemes. Their content can designate exact wholes, facts, claims, and relation occurrences; the content fields are not world-side participants and supply no substitute for the preceding move.
MHTTriggerProfile
MHTTriggerProfile is a U.Episteme whose EntityOfConcern is the exact existing whole already recognized under an admitted holon kind. It collects exact current cues and support for asking whether whole reidentification is live. It is not MHT itself, and its content fields do not declare another relation.
The profile's effective U.ReferenceScheme, any current U.ClaimScope, and an independently selected model-use structure can qualify this episteme under C.2.1 when its receiving use needs them. They do not identify either whole, become MHT trigger facts, or make any referenced relation obtain. A single cue warrants attention; it does not establish whole reidentification.
Existing-whole comparison and optional result
First perform an ordinary comparison: compare the observed change with direct explanations that preserve the existing whole. Consider better parts, corrected relations, improved measurement, method or Work repair, richer phase coverage, capability change, and architecture-view repair only when their direct patterns make those explanations current. If one explanation is sufficient for the receiving use, keep the existing whole, use that subject pattern, and stop B.2.
When another use must inspect or cite the outcome, identify an optional ExistingWholeExplanationResult episteme whose EntityOfConcern is the existing whole:
The comparison is an action a practitioner performs. The optional result records its claim-bearing outcome. Neither is a reusable checklist or Method unless an independent receiving use later requires and defines such an object. The episteme creates none of its referenced claims or relations.
HolonReidentificationRecord
HolonReidentificationRecord is an optional U.Episteme whose EntityOfConcern is the exact new holon. Use it only when a person or system performing later work needs a durable account of why that new holon, rather than the prior whole, is the current EntityOfConcern. Candidate classification remains a separately governed judgment.
The record does not make the A.1 criterion true, admit a public kind, or create the candidate new holon. E.24.UK is the pattern for public-kind admission; A.1 is the pattern for world-side recognition; C.2.1 is the pattern for the optional classification assertion; its warrant requires exact evidence and assurance relations. Publication of the record is another relation under the publication patterns.
Candidate New Whole Reference And Kind
Use one resultHolonRef : U.HolonRef for the candidate new whole and one resultHolonKindRef : U.KindRef for its kind. E.24.UK must already have admitted that public kind, and the candidate new whole must satisfy the A.1 constructive criterion plus any kind-specific membership condition. Neither the references nor the record establish those facts.
When a person or system performing downstream work must inspect or cite the classification judgment, add the optional resultHolonClassificationAssertionRef. That C.2.1 assertion may report a governed evaluation of true, false, or unknown; its evidence, warrant, and G.11 currentness stay separate from world-side criterion satisfaction. B.2 still asks a different question: whether the existing whole can continue to carry the subject claim or a new whole must be identified.
Do not use post* field names as live governed names. They hide the candidate new whole and its kind and invite temporal shorthand. Name that whole and its admitted public kind; cite a classification assertion only when the receiving use needs that episteme.
Agency Threshold
Agency is not a binary status and not a root kind. Treat agency as a characteristic-space threshold for one exact system, predicate, claim scope, and qualification window.
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, and only when crossing the threshold changes closure, supervision, objective, or whole identity.
Recover the admitted System and its agency-relevant characteristic or threshold independently. A System may bear that characteristic while participating passively in the situation. Recover a local system-role kind, a separate System-classification judgment, an obtaining assignment, and ordinary source wording as separate branches; include one only when the receiving claim depends on it. If claim-bearing source wording still says only “role,” use E.10.ROLE rather than presuming classification or assignment.
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 thereby become its part or the larger whole containing it, 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 ordinary existing-whole comparison leaves a whole-reidentification question.
Keep Whole Identity, Evidence, Currentness, And Reliance Separate
Keep five results apart:
- the existing whole and candidate new whole, their constituents, obtaining constructive relations, assemblies, characteristics, and identity rules are world-side objects and facts under their direct patterns;
- a B.2 whole-reidentification assertion is a C.2.1 episteme about those objects;
- evidence and assurance relations support or warrant the assertion's claim content but create neither whole and decide neither identity rule;
- use G.11 to determine whether the selected assertion or record edition is current for the receiving use;
- a person or system performing the receiving work decides whether to rely, decline to rely, defer, or reopen.
Evidence present or missing, and a current or stale record, can change what an evaluation returns and whether a person or system relies while performing receiving work. They cannot turn the same whole into a new whole or a new whole into the same one. Whether the existing whole continues or a new whole must be identified follows the direct identity and reidentification rules plus the actual construction facts. A.1 recognition of either candidate supplies no B.2 warrant and does not select B.2.
Archetypal Grounding (Worked Cases)
Closed-Loop Regulated System
Parts: plant, sensor, controller, actuator.
Existing-whole repair may be enough if only a sensor improved or a controller parameter changed. B.2 becomes current only when exact constructive relations and a governed assembly close the feedback and supervision around an objective, yielding one exact new whole proposed for recognition under the already admitted U.System kind, whose boundary, external commitments, and capability envelope are no longer explainable as changes of the existing whole. That proposed whole can satisfy A.1 only if its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions also satisfy at least one applicable governed larger-assembly construction method or rule—for example, a rule under which the regulated system can remain one constituent of a larger plant or production system. If that compatibility condition does not hold, the proposed whole fails A.1; if the needed evidence or dependency is unavailable, evaluation remains unknown. Loop closure, a record, or a measurement supplies none of those facts.
The exact EntityOfConcern is an actual participant in the C.2.1 EpistemeConstitutionRelation; EntityOfConcernSlot is only the corresponding declaration-local participant meaning inside EpistemeConstitutionRelationSignature. The entityOfConcernRef field and indented content fields carry participant or claim designations in each episteme; they are not SlotKinds or participants of a new MHT relation. The feedback and capability relations retain their direct identities, while the optional classification assertion retains its own C.2.1 identity and does not establish world-side holonhood.
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 exact candidate new holon named by the MHT claim is recognized under the already admitted U.Episteme kind. C.2.1 defines episteme constitution and identity; E.17 and E.24.PUB define publication occurrences, forms, and carriers; C.2.P recovers source-expression and source-to-use distinctions; A.10 and G.6 supply evidence-provenance relations when the receiving use relies on them.
Capability Envelope Appears
Several systems, methods, and work occurrences align and a new capability envelope appears. Apply the direct capability, characteristic, function, transformation, method, work, evidence, and architecture patterns first.
Use B.2.4 only when separately governed capability or functioning facts make a whole-reidentification question live under B.2. Evidence can support the claim about those facts; it creates neither the facts nor the question.
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 exact constituents, obtaining coordination and supervision relations, a governed assembly, an objective, a whole-level capability, and a reidentification rule that the earlier arrangement lacks. A.1 recognition additionally requires the cell's actual boundary, interfaces, relevant characteristics, and identity-preservation conditions to fit at least one applicable governed construction method or rule under which the cell can remain a constituent of a larger production system.
Same Whole, New Whole, And Lost Evidence
Replacing Pump #37's seal is an ordinary constituent change when the pump's reidentification rule admits that maintenance phase. The same pump remains the EntityOfConcern; use the direct maintenance, part-relation, work, transformation, and characteristic patterns and stop B.2.
Closing a controller-sensor-actuator loop can yield a new regulated-system whole only when the exact candidate assembly, supervision and coordination relations, boundary, objective, whole-level capability, admitted U.System kind, and reidentification rule satisfy A.1 and the system criterion. Its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions must also satisfy at least one applicable governed larger-assembly construction method or rule under which the regulated system can remain a constituent. If that condition fails, the candidate fails A.1; if the needed evidence or dependency is unavailable, evaluation returns unknown. A wiring diagram, commissioning record, loop closure, or capability measurement alone supplies none of those construction or compatibility facts.
If the support for the reidentification assertion is present and its edition is current, a person or system performing receiving work may rely on it. If the same evidence is unavailable, evaluation can return unknown; use G.11 to test whether the edition is current for this use; and the actor may decline, defer, or reopen. None of those branches changes whether the regulated-system whole actually exists or whether the prior configuration remains the same whole.
Selected Structure And Transformation Stops
A selected BoundedModelUseStructure organizes exact model-use relations. It is not the new holon named by an MHT claim and gains no parts, agency, or whole identity from selection, naming, or a Context Map.
Several actual changes during assembly may each be exact U.Transformation occurrences. B.2 does not treat them as constituents of one composite transformation. If whole reidentification would require positive transformation composition, transformation parthood, or composite-transformation identity and no direct governor supplies contribution, compatibility, boundary, interfaces, and reidentification, retain the exact blocker and the independently identified changes. The missing composition facts do not show that any change is atomic.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- MHT becomes a precise whole-reidentification move rather than a synonym for improvement.
- Cases involving a candidate new system, episteme, method, work occurrence, or discipline use the same B.2 whole-reidentification solution while retaining their subject patterns.
- 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 a reference to the exact candidate new whole, a reference to its already admitted public kind, A.1 recognition, and the evidence needed by any classification assertion used downstream.
- 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 applies repairs from subject patterns first, then supports 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.
Decision-bearing SoTA account
These sources answer different questions. None supplies a universal emergence detector. Popular modeling languages and generic architecture standards are not used as decision authority here because they do not decide when the same whole ends and another begins.
Relations
- Builds on:
A.1for world-side holon recognition,B.1for part-whole construction,A.14andC.13for relation and constructional grounding, andE.24.UKfor one-time public-kind admission. - Coordinates with:
A.12andA.3.4for acting-side and transformation,A.15andA.15.1for method and work,C.16andA.19for characteristic space and threshold,C.2.1for optional claim and record epistemes,A.10andB.3for evidence and warrant,G.11for edition currentness,C.29for mathematical lenses, andC.32.P2Swhen architecturing pressure becomes whole reidentification rather than local structure repair. - Specialized by:
B.2.2when the candidate new whole is a system,B.2.3when it is recognized under the admittedU.Epistemekind, andB.2.4when capability or functioning facts require whole reidentification. - Can use neighboring evidence from:
B.2.5when a supervisor-subholon feedback relation is part of the B.2 case evidence or neighboring structure; that does not make B.2.5 a specialization for the candidate new holon's kind. - Uses:
B.2.Pwhen 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:
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 the candidate new whole a system or episteme, or do capability and functioning facts make whole reidentification necessary?
- 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 subject patterns.
Not this pattern when.
- If the text already names the subject 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.
It asks which exact EntityOfConcern, world-side or claim-side fact, and subject pattern are current, and whether the same whole still carries the claim.
Problem
Without B.2.P:
- Generic emergence becomes ontology.
U.Emergenceor an equivalent hidden kind appears even though no such root kind is selected. - Collections become systems by poetry. A fleet, community, pool, or base is treated as an acting system because the phrase sounds collective.
- Capability becomes MHT. A new capability envelope or functioning relation is treated as a new whole without checking existing-whole explanations.
- Mathematics becomes declaration. A graph, scaling law, RG-like expression, benchmark jump, or MSPD score is treated as whole reidentification.
- Old mnemonic titles are mistaken for applicable PatternIDs. Source labels such as
METorMFThide whether the claim concerns an episteme whole, capability or functioning facts, evidence for those facts, or something else. - Semio-bias returns. Publication, dashboard, model, or source interpretation claims displace the in-life holon or characteristic under concern.
Forces
Solution
Recover the claim kind and subject pattern before any wording replacement.
Emergence Claim-Kind Recovery
Read the sentence once and recover five things before rewriting it:
- Practical use. What decision, explanation, design move, or stop depends on the sentence?
- Exact object. Is the concern an existing whole, candidate new whole, collection, characteristic, capability, functioning relation, structure, transformation, measurement result, assertion, or mathematical expression?
- Concrete claim. What changed or obtains: construction, identity, capability, characteristic value, evidence, publication, representation, or only the wording?
- Subject pattern. Which pattern defines or constrains that object and claim without using
emergenceas a substitute? - Disposition. Keep the exact direct claim, open B.2 only for a remaining whole-reidentification question, or stop with the exact missing object or governor.
A temporary author note may retain the source phrase, exact object, subject pattern, blocked overread, and replacement or stop. The note is not a U-kind, relation, result object, or required project record. Do not ask a practitioner to fill a generic emergence card before the direct object can be named.
Claim-Kind Recovery and Subject-Pattern Selection Table
Whole-Reidentification Recovery
When a whole-reidentification question remains after claim-kind recovery, do not create a second MHT schema. Use B.2 with this concrete account:
- name the exact existing whole, admitted kind, and identity or reidentification rule;
- name each changed delimitation, constituent, constructive relation, assembly, supervision, objective, capability, characteristic, or temporal fact and its subject pattern;
- try the existing-whole explanation and state whether it preserves the existing whole;
- if a new whole is still needed, require B.2 and execute the complete A.1 criterion: name the exact candidate, its constituents, obtaining constructive relations, assembly, reidentification rule, and composition-grounded whole characteristic; show that its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy at least one applicable governed larger-assembly construction method or rule under which it can remain a constituent; then name its already admitted kind and satisfy the direct kind-specific criterion;
- state whether the direct identity rules preserve the same whole or require a new whole for the current subject claim;
- only when a specific downstream task must inspect or cite the decision, identify any separate assertion or record, supporting evidence and warrant, G.11 currentness result, and rely, decline, defer, or reopen decision.
Evidence availability, an evaluation value, a record field, and receiving reliance neither construct the candidate nor decide whether the existing whole continues or a new whole must be identified. If the exact candidate, one required constructive fact, or the larger-assembly compatibility condition has no governor, stop with that missing object or governor rather than writing candidateResultRef, resultKindRef, mhtWitnessRef, or a context-shaped placeholder.
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.14for membership and part-whole relation vocabulary; - use
C.13for collection-as-whole constructional grounding; - use
B.3.5for working-model assurance grounding; - use
A.1withA.15and A.2 patterns for an acting collective admitted asU.System; - use
C.16for a whole-level characteristic.
B.2.P may point to these subject patterns; it does not own their claims. An unassembled collection remains an unassembled collection even when a list, dashboard, or project card names it as one whole. A C.13 collection construction does not by itself establish an integrated assembly, acting system, or A.1 holon.
Source Mnemonics and Result Fields
Treat source labels and short forms as recognition cues until the concrete thing or claim and its direct pattern are identified.
METmay point to a claim that the candidate new whole is an episteme, source-title wording, episteme morphing, publication synthesis, or a source-only phrase. Identify the concrete claim before use.MFTmay 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.promotionmay hide whole reidentification, status change, release, gate, publication, or project process wording. Recover before use.post*fields do not survive as generic governed names. When B.2 is current, name the exact candidate new whole and its already admitted holon kind directly; cite an optional classification assertion or reidentification record only when receiving work needs that episteme.
Do not treat the source label as a subject-pattern locator 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 the candidate new system named by an MHT claim?
- Does the agency wording name an admitted System, an agency-relevant characteristic or threshold, a local system-role kind, a separate System-classification judgment, an obtaining assignment, or only ordinary prose? Recover these independently: the characteristic can obtain without an assignment and the System may participate passively. Send unresolved claim-bearing “role” wording through
E.10.ROLE. - Does the candidate new system have its own delimitation, objective, coordination, and capability envelope, and is the reidentification claim separately supported by evidence and assurance?
If the candidate new whole is an acting system, use B.2 and B.2.2. If the case 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 patterns. 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?
- Do separately governed capability or functioning facts make a whole-reidentification question live, with evidence only supporting the claim about those facts?
- Is the concern function-like wording, a functional-structure view, a method-and-work relation, or a candidate new 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 patterns.
"The Selected Context Became A Meta-System"
Recover the exact selected relation organization. If it is BoundedModelUseStructure, keep it as dependent U.Structure under A.1.1 and A.22. A context label, Context Map, diagram, or selection decision supplies no constituents, part relations, agency, holonhood, or MHT. If the source instead concerns an actual system whole, identify that system and its construction independently before B.2.
"The Evidence For Emergence Was Lost"
Recover the exact whole-reidentification assertion, its evidence or assurance relation, the selected assertion edition, and the receiving work. Missing evidence can make a governed evaluation return unknown; a stale edition can fail G.11 currentness; receiving work can decline, defer, or reopen. None of those results reverses an actual construction or changes the direct rule that decides whether the existing whole continues or a new whole must be identified. Do not rewrite evidence loss as absence of the whole or as a new MHT.
"The Assembly Changes Form One Higher-Level Change"
Identify each actual change independently under A.3.4. A shared work occurrence, flow, changed referent, time window, method decomposition, or C.13 construction trace does not make those changes parts of one transformation. If the use requires a composite transformation and no direct governor supplies constituent contribution, compatibility, boundary, interfaces, whole identity, and reidentification, return that exact blocker. Do not infer either composition or atomism.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
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 subject patterns.
Costs:
- Ambiguous emergence-family phrases take one recovery step before use.
- Some attractive umbrella claims become narrower subject-pattern claims.
- Old mnemonic labels may survive only as quoted source wording or reduced-use cues unless the concrete thing or claim and its direct pattern are identified.
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
Relations
- Builds on:
E.10,E.10.ARCH,E.24,F.18, andB.2. - Uses for whole reidentification:
B.2, withB.2.2,B.2.3, andB.2.4as current specializations. - Keeps collection admission with:
A.14,C.13,B.3.5,A.1,A.15, A.2 patterns, andC.16. - Coordinates with:
A.2.2,C.16,A.6.F,A.3.4,C.30,A.22,A.1.1,C.30.ASV,C.30.TFS-REL,C.30.ILC,C.32.P2S,C.29,A.10,B.3,C.2.1,G.11,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 B.2 has identified one exact candidate new whole and that same individual must be recognized under the already admitted U.System kind: a swarm, production cell, cloud platform, regulated control system, organizational unit, or another physical or operational whole that can act in work or transformation while remaining itself.
The first useful question is not "is there emergence?" First test the exact candidate against A.1's six common components. Then test whether its physical or operational organization makes it eligible to act in work or transformation while preserving its identity—the direct U.System criterion. After those two tests, recover only the additional facts used by the concrete case, such as delimitation, an objective or commitment, coordination, capability, system-role kind or assignment, method, work, transformation, functioning, architecture, evidence, assurance, or time. State each fact or claim through the pattern that defines its object or relation. Do not make an objective or commitment a condition for U.System recognition; require it only for the separate objective or commitment claim being made.
Use B.2 first to decide whether whole reidentification is needed and to identify the one candidate new whole. Use B.2.2 only when that candidate's already admitted kind is U.System.
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 subject patterns 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.3and the episteme family. - If the evidence is only a capability or functioning gain without whole reidentification, use
A.2.2,C.16,A.6.F,A.3.4,C.30.TFS-REL, andA.10. - If the claim is ordinary system aggregation or delimitation, use
B.1.2,A.1,A.14, andC.13. - If the claim is a mathematical, simulation, graph, benchmark, or scaling expression, use
C.29and 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.
Problem Frame
B.2 is holon-general. B.2.2 is its U.System specialization.
A system-result MHT is current when B.2's exact new whole proposed for recognition under the already admitted U.System kind is an acting physical or operational holon and the case needs that same recognized whole to carry one or more separately governed system-level claims, such as delimitation, objective, coordination, capability, functioning, architecture, transformation, work, assurance, or time. The old constituent systems may remain parts, participants, resources, or interacting neighbors, but their claims do not automatically become claims about that recognized result system.
A collection of systems is not thereby a system MHT. B.2.2 carries B.2's existing-whole/new-whole comparison through complete A.1 recognition and the direct U.System criterion; it does not create a system-specific result object or record schema.
Problem
Without this specialization:
- System identity stays on old parts. The project keeps component assurance, component responsibilities, and component interfaces after the operating whole has changed.
- System claims become rhetoric. A group gets a collective name, but no delimitation, objective, obtaining coordination relation, or capability envelope is established for the exact new whole proposed for recognition under
U.System. - Supervision is overread. A coordination mechanism is treated as a containing whole, safety warrant, or complete system recognition without the corresponding direct facts.
- Transformation is confused with containment. One system changing another holon is treated as part-whole construction instead of transformation and work.
- Architecture description replaces architecture. Dashboards, diagrams, simulations, bills, and digital twins are treated as the operating system rather than descriptions of it.
Forces
Solution
After B.2 leaves a whole-reidentification question open, continue with the same exact candidate new whole and direct facts. Add no system-specific result species or context-shaped slice.
Reuse The B.2 Candidate And Complete System Recognition
Keep B.2's one resultHolonRef for the exact candidate new whole and its one resultHolonKindRef, which here resolves to the already admitted U.System kind. The references may appear in B.2's optional HolonReidentificationRecord when a receiving use needs a durable account; B.2.2 adds no second record.
Before calling the candidate a system result:
- execute the complete A.1 criterion over the candidate's exact constituents, obtaining constructive relations, governed assembly, reidentification rule, and composition-grounded whole characteristic;
- show that its actual boundary, interfaces, relevant characteristics, and identity-preservation conditions satisfy at least one applicable governed larger-assembly construction method or rule under which it can remain a constituent;
- apply the direct
U.Systemcriterion to that same individual: its actual physical or operational organization must make it eligible to act causally in work or transformation while preserving its identity; - recover only the additional system facts used by the concrete case—including any delimitation, objective, commitments, coordination, capability, system-role kind or assignment, method, work, transformation, functioning, architecture, evidence, assurance, or temporal claim—and state each through the pattern that defines its object or relation; and
- keep the classification judgment, evidence or assurance, currentness, and receiving reliance separate from those world-side facts.
If a required A.1 component or the acting-eligibility criterion fails, do not identify the candidate as the system result. If an additional system fact needed for another claim is absent, withhold that claim rather than treating its absence as failure of the U.System criterion. If missing evidence or an unavailable dependency prevents a determination, report unknown; neither a filled reference nor an optional record changes that result.
Carry Result-System Claims Through Subject Patterns
When the candidate is recognized as U.System, state every changed result-system fact or claim under its subject pattern:
- system-role assignments through
A.2.1, relations among system-role kinds throughA.2.7, and other relations through the patterns that define them; - capabilities through
A.2.2andC.16; - methods and mechanisms through
A.15,A.6.1, and any other applicable method or mechanism pattern; - transformations through
A.3.4; - work occurrences through
A.15.1; - functioning and functional structure through
A.6.FandC.30.TFS-REL; - architecture through
C.30,A.22, andC.30.ASV; - evidence and assurance through
A.10,B.3, andB.3.5; - temporal and dynamics claims through
C.27,A.19, and the direct temporal patterns.
Do not reuse old component evidence as if it automatically covered the proposed new whole after recognition under U.System. Carry an unchanged component claim only through its exact continuing relation; establish each changed result-system fact under its subject pattern and support the associated claim through a separate evidence or assurance relation.
System Trigger Interpretation
When a receiving use has materialized B.2's optional MHTTriggerProfile, read its cues for a system case as follows:
No cue is enough by itself. Each row points to facts and claims to inspect; B.2's direct existing-whole/new-whole comparison, complete A.1 recognition, and the system-kind criterion decide the result.
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 thereby become a part of the changed holon or the larger whole containing it. Use A.12, A.3.4, and A.15.1 for acting side, transformation, and work. Use part-whole patterns only when parthood itself is admitted.
Assurance Re-Basing
When the exact candidate new whole is recognized as U.System, test old assurance against that system rather than transferring it by name.
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 subject patterns?
A claim about the recognized result system may reuse component evidence only through an exact correspondence or source-use relation and a fresh evaluation of applicability. That system does not inherit safety, reliability, responsibility, or performance claims by label.
Archetypal Grounding (Worked Cases)
Search-And-Rescue Swarm
Before MHT, the project has individual drones with local navigation and maintenance records. After MHT, the current object may be one search-and-rescue swarm if the result whole has its own mission objective, coordination relation, external command relation, capability envelope, and swarm-level risks.
- Candidate new whole: the search-and-rescue swarm named by B.2.
- A.1 basis: exact drone constituents, obtaining formation and coverage-coordination relations, the governed swarm assembly, the swarm reidentification rule, and the whole-level area-search characteristic; its boundary, command and mission interfaces, operating characteristics, and identity-preservation conditions also fit the applicable larger rescue-system construction rule.
- System criterion: the swarm has its own command-and-operating-area delimitation, mission objective, coordination relations, external commitments, and acting eligibility.
- Assurance: swarm-level tests support claims about the candidate; individual drone certificates remain component evidence and do not establish the swarm facts.
The old drone evidence remains relevant, but it is not enough for the swarm-level assurance claim.
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 patterns. Use B.2.2 only when B.2 identifies the operating platform itself as the exact candidate new whole and that candidate passes A.1 plus the direct U.System criterion.
Production Cell
A machine, robot, fixture, workpiece carrier, and inspection station can become a production cell when the cell has its own delimitation, objective, obtaining coordination relations, transformation structure, exact work occurrences, and capability envelope. Evidence separately supports the claims about those facts.
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
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- Meta-system transition remains usable for engineering and organizational systems without making B.2 system-only.
- System ontic preservation becomes explicit: the same exact candidate is recognized under A.1 and
U.System, while each system fact and claim stays with its subject pattern. - Assurance, responsibility, architecture, work, and evidence claims are kept with their subject patterns.
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 whole proposed for recognition under the admitted U.System kind is not a trigger profile, coordination mechanism, graph, description, dashboard, or process label. It is one exact candidate new whole that satisfies A.1 and the direct U.System criterion; every changed system fact and claim stays with its subject pattern.
SoTA-Echoing
Relations
- Specializes:
B.2for one exact candidate new whole independently recognized under the already admittedU.Systemkind. - Builds on:
A.1,B.1.2,A.14, andC.13for 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, andB.3.5. - Uses:
B.2.5when supervisor-subholon feedback relation is part of the system-result evidence. - Contrasts with:
B.2.3for MHT-result holons admitted asU.EpistemeandB.2.4for 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 B.2 has identified one exact candidate new whole and that same individual must be recognized under the already admitted U.Episteme kind: 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 and to identify the one candidate new whole. Use B.2.3 only when its resultHolonKindRef resolves to U.Episteme.
First useful move. For B.2's exact candidate, identify one U.ClaimGraph, one exact EntityOfConcern, and one effective U.ReferenceScheme, then test whether their EpistemeConstitutionRelation obtains under C.2.1. Keep grounding, viewpoint, view, publication, source use, representation, evidence, and assurance in their neighboring direct relations.
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 constitution, empirical grounding, publication, source use, view, viewpoint, ClaimGraph, reference scheme, or description use without MHT, use
C.2.1,C.2.P,C.2.P.DR,E.17, and the direct episteme-family pattern. - If the question is effect-free episteme morphing, viewing, retargeting, or controlled semantic coarsening, use
A.6.2,A.6.3,A.6.4, orA.6.3.CSC. - If the question is synthesis work, use
A.15.1for performed work andA.12orA.3.4for acting-side and transformation claims. - If the wording is ambiguous emergence-family language, use
B.2.Pbefore 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. B.2.3 becomes current only when B.2's exact candidate new whole can be constructively recognized under A.1 and the current C.2.1 constitution criterion identifies that same individual as one claim-bearing episteme.
B.2.3 introduces no special episteme result object. It retains B.2's one resultHolonRef and resultHolonKindRef, then requires C.2.1 for episteme constitution and every neighboring relation and its subject patterns.
Problem
Without this specialization:
- Catalogues become theories. Aggregated publications or dashboards are treated as a new episteme because they are stored together.
- Theory becomes publication. The paper, report, standard document, model card, or dashboard is used as the episteme itself.
- Episteme receives agency. The theory, standard, or doctrine is described as if it performs work or enforces behavior by itself.
- Morphing becomes MHT. A view, retargeting, coarsening, translation, or model transformation is treated as a new episteme whole.
- Assurance is inherited silently. Trust in constituent sources is treated as trust in the reidentified episteme whole.
- Generic emergence replaces claim structure. "Emergent theory" hides the actual claim graph, reference scheme, and grounding relation.
Forces
Solution
Use B.2.3 as the U.Episteme specialization of B.2. Reuse B.2's exact existing whole, exact candidate new whole, direct construction facts, and optional C.2.1 records; add no context-shaped slice or episteme-result schema.
Reuse The B.2 Candidate And Complete Episteme Recognition
Keep B.2's one resultHolonRef for the candidate and its one resultHolonKindRef, which here resolves to the already admitted U.Episteme kind. Execute the complete A.1 criterion over that candidate, including the larger-assembly applicability and compatibility condition. Then apply C.2.1 to the same individual:
- identify its exact claim content as one
U.ClaimGraph; - identify the exact independently governed
U.Entitythat those claims concern; - identify the effective
U.ReferenceSchemeunder which the claims are read about that entity; and - test whether the direct
EpistemeConstitutionRelationamong those participants obtains and yields one interpretable claim-bearing whole.
The candidate and its constitution relation are distinct, even though C.2.1 reidentifies them from the same participant triple. A card, tuple, repository, publication set, graph representation, or filled reference does not make the relation obtain. If A.1 or C.2.1 fails, do not identify the candidate as the episteme result; if a required dependency cannot be evaluated, return unknown.
Keep Constitution And Neighboring Relations Separate
The exact ClaimGraph, EntityOfConcern, and effective ReferenceScheme are the three participants of C.2.1's EpistemeConstitutionRelation. That constitution relation does not by itself identify A.1 constituents or constructive part relations. When A.1 requires those facts, recover them from an exact direct episteme-part or claim-composition pattern. The EntityOfConcern remains an independently governed entity related through aboutness and reference. Keep all other current questions in their direct relations:
- empirical grounding uses
EpistemeEmpiricalGroundingRelationonly when designated empirical claims have current claim-to-world mappings involving the exact grounding holon; - viewpoint selection and
U.Viewrecognition use their description-context and conformance patterns; - publication occurrence, publication form, carrier, source use, and C.29 representation remain distinct from the episteme and its constitution;
- an exact acting System first has the A.13 core and A.15.1 independently admits its synthesis Work under a Method; F.6 enters only if the receiving transition account also consumes precise assignment-bound attribution through the same obtaining A.13 assignment, while any actual transformation remains a separate claim; and
- evidence and assurance support or challenge exact claims but do not enter episteme identity or establish constitution.
Add only the neighboring object or relation required by the receiving use. Do not infer any of them from a publication set, and do not turn them into extra identity positions.
Episteme Trigger Interpretation
When a receiving use has materialized B.2's optional MHTTriggerProfile, interpret its cues without giving agency to epistemes:
These cues identify claims and relations to inspect. They neither constitute the candidate episteme nor select B.2; the direct facts, complete A.1 criterion, C.2.1 constitution test, and B.2 existing-whole/new-whole comparison decide the result.
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)
Reliability Doctrine
Before MHT, teams have local runbooks, incident reports, dashboards, and reliability definitions. They may be useful, but they are not yet one episteme.
After MHT, the exact candidate may be a reliability doctrine when it passes A.1 and its ClaimGraph, EntityOfConcern, and effective ReferenceScheme stand in an obtaining C.2.1 constitution relation. Add empirical grounding to operating services, handbook publication, and source-use relations for standards or training materials only when the receiving use needs them.
- Candidate new whole: the reliability doctrine named by B.2.
- A.1 basis: exact constituents and constructive relations established by an obtaining episteme-part or claim-composition predicate, a governed assembly and reidentification rule, a composition-grounded claim-bearing characteristic, and compatibility with an applicable larger knowledge-body construction rule.
- C.2.1 constitution: the doctrine's exact ClaimGraph states its principles and definitions; its EntityOfConcern is user-visible service harm and reliability; its effective ReferenceScheme supplies the reliability designations and interpretation rules.
- Neighboring relations: empirical grounding to operating services, handbook publication, source use for standards and training materials, and evidence or assurance are added only for the receiving use and do not identify the doctrine.
The doctrine does not enforce anything by itself. Systems use it, cite it, train with it, and work according to it; any relevant local system-role kind and assignment remain separate claims.
Model Family Becomes Theory
A model family can remain a toolbox. It becomes an episteme-result MHT only if B.2's candidate passes A.1 and one exact ClaimGraph, EntityOfConcern, and effective ReferenceScheme stand in an obtaining C.2.1 constitution relation. Empirical grounding and explanatory or predictive use are checked through neighboring direct relations when the receiving use needs them; they are not extra identity constituents.
If the change is only a new model publication or benchmark score, use publication, source-use, measurement, evidence-use, and mathematical-lens patterns 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, the PDF, or the Work of enforcement. The committee may be an acting System. If committee or enforcement Work is claimed, recover each exact performer through A.13 and admit the Work independently under A.15.1. Add F.6 only if the account expressly consumes precise assignment-bound attribution; a missing or failed relation leaves the Work intact. The PDF is a publication form.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- Episteme-result MHT becomes usable without preserving title mnemonics as ontology.
- C.2.1 remains the episteme identity pattern.
- Publications, source use, synthesis work, evidence, assurance, and acting systems remain separate.
Costs:
- A claimed synthesis must identify and test the current C.2.1 constitution, 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-use patterns.
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 is the pattern for whole reidentification; C.2.1 is the pattern for the ClaimGraph/EntityOfConcern/ReferenceScheme constitution relation and episteme identity; publication and source-use patterns contain the defining content for their relations; A.6 episteme-morphism patterns contain the defining content for morphing and retargeting; use A.15 for synthesis Work and A.12 for the acting-side split.
SoTA-Echoing
Relations
- Specializes:
B.2for an exact candidate new whole independently recognized under the already admittedU.Epistemekind. - Builds on:
B.2for the exact candidate new whole and whole reidentification,A.1for candidate recognition,C.2.1for the obtaining ClaimGraph/EntityOfConcern/ReferenceScheme constitution relation, andE.24.UKfor prior public-kind admission. - 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, andF.19. - Uses:
B.2.Pwhen source wording such as emergence-family or title-mnemonic wording hides the claim kind. - Contrasts with:
B.2.2for system-result MHT andB.2.4for 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 exact capability, functioning, or transformation-flow facts, already established under their subject patterns, make a B.2 whole-reidentification question live.
The first useful question is whether those facts can still be explained by the existing whole. If they can, keep that whole and use the direct pattern for the capability, functioning relation, transformation, Method, Work, module, characteristic, or architecture claim. If they cannot, use B.2 for the residual question. Evidence and measurement separately support, challenge, or leave unresolved the claims about those facts; they create neither the facts nor B.2 selection.
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 facts available to B.2 while preserving the separate evidence relation and 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.2andC.16. - If the claim is function-like wording or functioning relation without whole reidentification, use
A.6.F. - If the claim is transformation or transformation-flow structure, use
A.3.4,E.18, andC.30.TFS-REL. - If the claim is method, method relation, method description, work plan, or work occurrence, use
A.15,A.3.1,A.3.2,A.15.2, andA.15.1. - If the claim is module allocation or bearer allocation, use
A.6.M,C.30,A.22, andC.30.ASVaccording to whether the live claim concerns the module, architecture, selected structure, or architectural structural view. - If the claim is measurement, threshold, score, robustness, quality, or a whole-level characteristic, use
C.16andA.19for that claim andA.10only when evidence use is current. - If the wording is ambiguous emergence, synergy, or title-mnemonic language, use
B.2.Pbefore 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 exact capability, functioning, or transformation-flow facts defeat the existing-whole explanation and point to a candidate new holon. Evidence bears on claims about those facts; it does not make the explanation fail by itself.
Problem
Without this specialization:
- Capability becomes generic emergence. A threshold crossing or new envelope is treated as a new whole without B.2 checks.
- Function becomes ontology. Function-like wording creates
U.Functionor a hidden peer kind. - Method and work collapse. The way of doing, description of doing, planned work, and performed work are compressed into one vague operational claim.
- Module allocation becomes functional truth. A module label is treated as evidence for the required behavior or selected structure.
- Transformation-flow description replaces in-life structure. A graph, diagram, or publication of a flow is treated as the flow structure or whole.
- Whole reidentification is missed. A real result whole is left as "just a better capability".
Forces
Solution
Use B.2.4 as a decision bridge from direct capability and functioning facts to B.2 whole reidentification. Add no generic slice, context placeholder, candidate-bearer list, or second B.2 record.
Start From Exact Facts, Claims, And Support
- Name the exact existing whole and its direct identity or reidentification rule.
- Identify each exact capability envelope, obtaining functioning relation, or selected in-life transformation-flow structure under its subject pattern. Keep method, method description, work plan, work occurrence, module allocation, characteristic, and architecture facts separate when they are current.
- State the exact claim made about those facts. Name evidence or measurement only as a separate relation that supports, challenges, or leaves that claim unresolved.
- Perform B.2's ordinary existing-whole comparison. Better measurement, component improvement, Method or Work repair, allocation repair, or architecture-view repair can leave the same whole in place.
- If a residual whole-reidentification question remains, use B.2 for it. B.2 then identifies one exact candidate new whole, applies the complete A.1 and kind-specific criteria, and compares that candidate with the existing whole.
B.2.4 adds no result species. If a receiving use needs a durable account, use B.2's optional C.2.1 epistemes; their content neither creates the direct facts nor selects the new whole.
Subject-Pattern Test
Before applying B.2, test whether the exact facts are already explained under a subject pattern:
Existing-Whole Explanation
Perform B.2's ordinary existing-whole comparison before claiming whole reidentification. Materialize its optional ExistingWholeExplanationResult only when another use must inspect or cite the outcome.
Subject-pattern explanations that often stop B.2.4 include:
- 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 corresponding in-life capability or work facts;
- better work coordination inside the same whole;
- module allocation repair;
- architecture-view or transformation-flow-structure repair;
- better evidence, measurement, or source currentness for an unchanged world-side claim.
If one of these explanations is sufficient, do not use B.2.4. Use the subject pattern.
When B.2.4 Requires B.2
Use B.2 when the exact direct facts show that the existing whole cannot carry the current subject claim and an exact candidate new whole must be tested. Examples:
- a production cell has an exact capability envelope, obtaining coordination and functioning relations, a selected in-life transformation-flow structure, and external commitments that cannot be explained by individual machines or the old aggregate;
- a service platform has an obtaining functioning relation and external commitments that cannot be assigned to one service or module;
- a team, toolchain, and method family participate in exact coordination and work facts that make a result-system candidate live; or
- a candidate episteme has exact constitution and explanatory-use facts that leave an episteme whole-reidentification question.
After the return, use B.2 for the existing-whole/new-whole comparison, its one exact candidate, and any optional record. B.2.4 adds no result record or evidence slice. The direct patterns still define and test the contributing facts, while evidence or measurement supports the associated claims.
Archetypal Grounding (Worked Cases)
Bias-Annotation
CI/CD Capability
A team may have methods for coding, testing, and releasing. That does not by itself create a new whole. Use the direct Method and Work patterns for the method relations and performed release work.
B.2.4 becomes current only if exact capability, coordination, commitment, and work facts leave a result-holon question that the existing team or platform cannot explain. Evidence may support that claim; an automated delivery label or score 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 supply the exact explanatory-capability fact to B.2's ordinary existing-whole comparison, while evidence separately supports or challenges its claim. B.2.3 supplies the episteme-result specialization if the exact candidate is U.Episteme; C.2.1 defines its constitution; C.29 handles any mathematical-lens use.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Positive consequences:
- Exact capability and functioning facts can make real whole reidentification current, while evidence bears only on the associated claims.
- Subject patterns 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 subject pattern.
Costs:
- Teams must do the subject-pattern 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 a new-whole question first becomes visible. Their direct facts, not the availability of supporting evidence, determine whether the existing-whole explanation still works.
B.2.4 keeps this mixed situation disciplined. It does not rename the capability, functioning, transformation flow, method, work, allocation, measurement, or support as "meta-function". It asks whether the exact direct facts defeat the existing-whole explanation and, only then, requires B.2 for the residual question.
SoTA-Echoing
Relations
- Specializes:
B.2for cases where exact capability, functioning, or selected in-life transformation-flow facts leave a whole-reidentification question after subject-pattern explanations are tested. - Uses:
B.2.Pwhen 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.2for system-result MHT andB.2.3for 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 one supervising acting system and one or more supervised holons. If the supervision is conditioned by a local system-role kind or assignment, recover that classification and exact assignment separately.
The first useful move is to recover 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, supervising acting system, optional exact system-role kind and assignment, medium or publication relation, observation or report side, influence or constraint side, and the patterns that define any stronger claim.
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 supervised holons, a supervising acting system, observed or published state, and returned influence or constraint. A system-role kind or assignment may qualify the acting system but is not created by the feedback relation. The relation is not automatically parthood, a control-structure view, evidence, or a mathematical loop object.
Use B.2.5 for the relation-level claim. It can sit inside a broader architecture description, control-structure view, MHT claim, work claim, or evidence claim, but treat those as separate claims under their applicable patterns.
Problem
Without this pattern, three different structures collapse:
- Part-whole structure. Which holons are parts of which wholes.
- Supervisor-subholon feedback relation. Which admitted system supervises, what it observes, and what influence or constraint returns; add its system-role kind and assignment only when separately current.
- 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
Solution
Model the current object as SupervisorSubholonFeedbackRelation@Context.
This relation is not a U-kind and not a mathematical loop lens. The record names the exact supervised holons, supervising acting system, feedback policy when one applies, signal paths, ClaimScope when needed, qualification window, and evidence when a later use relies on it. Evidence can support the claim but does not create the feedback relation. The kind and assignment fields are present only when the classification and the assignment occurrence with its declared species exist separately; the feedback relation creates neither.
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 pattern that defines 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 supervise under an exact system-role assignment 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 supervising participant is an admitted acting system. When local classification matters, A.2 supplies the exact supervisor system-role kind and A.2.1 supplies the obtaining assignment; neither label nor assignment acts. 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 system-role kind and assignment, use A.2 and 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 is the pattern for 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.3for reusable dynamics or state-evolution claims;C.27for temporal and rate adequacy;C.28for causal-use claims;A.10andG.6for evidence and provenance;B.3for assurance;A.20andA.21for constraint validity and gate decisions;C.29for 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 as an admitted supervising system, telemetry as observation side, and waypoint or mode commands as influence side. Add a local supervisor system-role kind and exact assignment only if this use relies on them.
Claims about convergence, delay tolerance, disturbance damping, evidence, assurance, or safety use their subject patterns. 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; any local system-role kind and assignment are separate claims. 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 admitted platform or governance system that supervises, component holons, report channels, and constraint returns; a system-role kind or assignment is added only when separately current.
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
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
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 subject is a relation. A mathematical loop, if needed, is a lens or structure selected by another pattern; the relation's name does not establish it.
SoTA-Echoing
Relations
- Builds on:
A.1,A.2.1,A.12,A.3.4,A.15.1,B.1,A.14, andC.13. - Coordinates with:
B.2when feedback evidence creates a whole-reidentification question. - Coordinates with:
C.30.LCAfor control-structure view,A.3.3for dynamics,C.27for temporal and rate adequacy,C.28for causal use,A.10andG.6for evidence,B.3for assurance,A.20andA.21for constraint validity and gate decisions,A.6.Mfor module-interface relation, andC.29for mathematical-lens use. - Uses:
B.2.Pwhen feedback, supervision, emergence, or MHT wording hides the claim kind.
B.2.5:End
Trust and Assurance Calculus
Type: Foundational (B) Status: Stable Normativity: Normative when an FPF use makes an assurance claim about one exact target claim.
Plain-English headline. B.3 helps a practitioner state what an assurance claim is about, which argument and results support it, what use they support, what remains unsupported, and what would reopen the conclusion. It does not turn a badge, evidence item, calculation, record, publication, status, or decision into assurance by appearance.
Use this when. Use B.3 when an actual named assurance claim is current: for example, a claim that an exact model claim is credible for one decision, or that an exact safety claim is adequately supported for one release use.
First useful move. Write the target claim and the assurance use in one sentence. Then ask which direct results and argument make that use supportable. If there is no assurance claim, stop and use the pattern that defines or tests the actual evidence, status, gate, permission, safety, release, work, or domain-result claim.
What goes wrong if missed. A visible label or a convenient score starts raising trust without an exact target, argument, basis, limitation, and use. At the other extreme, a modest assurance question is forced through a universal score and a large record whose fields do not affect the decision.
What this buys. The user gets the smallest assurance result that changes the named use, with enough basis and limits to inspect or reopen it. Domain-specific characteristics and calculations remain usable without pretending that unlike measures share one scale.
Not this pattern when. Stay with A.2.4 for the classification of an episteme as evidence, A.10 and G.6 for source recovery and bounded reliance, G.11 for currentness, F.10 for a status value and its use, A.21 for a gate decision, and the direct domain pattern for safety, permission, access, responsibility, release, compliance, or controlled action. Consequence alone does not create an assurance claim. A direct domain rule may require one, but the claim must be stated before B.3 is applied.
First output. Produce either one bounded AssuranceResult claim or a plain statement that the available argument does not support the attempted assurance use. Do not create a B.3 result merely to record that another pattern is relevant.
Problem frame
Assurance concerns a claim, not the world-side subject in isolation. Begin with one exact C.2.1 target-claim episteme and one named use of an assurance conclusion. The claim's EntityOfConcern remains the system, episteme, method, work occurrence, relation occurrence, or other exact subject identified by its direct pattern.
For example:
- a battery-pack safety fact and its direct test result remain under their safety, measurement, and test patterns;
- the episteme that states the safety claim remains under C.2.1;
- an assurance result states whether a named argument carries that claim for a named release use;
- a later gate, permission, or release decision remains a separate result.
The word calculus here means a disciplined way to select, combine, and interpret the inputs that the assurance argument actually consumes. B.3 defines no universal arithmetic across systems and epistemes.
Problem
Five failures recur:
- Assurance by appearance. A badge, dashboard, attestation, card, status, or publication is treated as the assurance conclusion.
- One scale for unlike properties. Formality, reliability, coverage, congruence, and evidence quality are placed in one tuple even though they have different bearers and scales.
- Unsupported aggregation.
min, an average, a penalty, or another fold is called conservative without a dependency model and calibrated quantities. - Process burden by default. Every result is required to name dated Work, Method, assignment, bindings, and a reusable record even when the claim's own basis closes the use.
- Domain obligations absorbed into assurance. Safety, rights, access, responsibility, contest, redress, status, or controlled-action rules are replaced by a generic assurance record.
Forces
Solution
Start from one assurance question
State these three things before choosing measures or a record:
- the exact target claim;
- the named assurance use;
- the conclusion that must be supported, narrowed, or refused for that use.
Keep the following objects separate whenever they are current:
- world-side facts and direct domain results;
- the target-claim episteme;
- evidence-use relations and source-provenance paths;
- any assessment Work and the System that performed it;
- formal, empirical, causal, measurement, conformance, or comparison input results;
- the assurance-result episteme;
- calculation traces, witnesses, and an optional note or publication that cites the result;
- later reliance, status use, gate, permission, release, or action.
Evidence can support or challenge a claim. It does not make the target fact true. A favorable assurance result does not pass a gate, grant permission, or prove that later work relied on it.
Use the smallest sufficient result
The compact result contains only facts every B.3 use needs:
targetClaimRef identifies the exact C.2.1 episteme or one exact C.2.1 ClaimAddress when the use concerns one addressed claim inside a larger episteme. basisRefs cite the direct results, evidence-use relations, provenance paths, argument claims, or domain rules actually used. A compact result is complete when these fields decide the named use and another person can see why the stronger use is not carried.
Add a claim scope, condition set, interpretation scheme, audience, or time window only when changing it could change the conclusion. Keep design and run conclusions separate whenever their inputs or conditions differ.
Add assessment Work, performer, Method, application bindings, witnesses, or a reusable record only when the receiving use depends on competence, conflict of interest, timing, reproducibility, contest, redress, or later replay. These identities are never mandatory merely because B.3 is used.
An optional assurance note may cite the result and its basis. B.3 does not define a reusable RelianceSafetyCase, a safety authority, or a general contest-and-redress profile. If such a reusable object is needed, it requires its own problem, ontology, sources, minimum output, and direct domain boundaries.
Name each characteristic by its bearer and scale
Include a characteristic result only when the assurance argument consumes it. State:
One characteristic name must not silently change meaning between subjects. System reliability, replication quality, evidential support, proof inspectability, and relation congruence are different characteristics even when a local source labels several of them R or CL.
The legacy letters F, G, R, and CL may appear inside a declared local scheme, but B.3 assigns them no universal cross-domain meaning:
- Formality or inspectability. Formal structure can make assumptions and inference steps easier to check. It raises assurance only when the named argument explains which uncertainty or verification need it closes. Making a wrong model proof-grade does not improve truth or empirical adequacy.
- Claim scope.
U.ClaimScopestays an A.2.6 value. It is not a quality coordinate. Widening or narrowing scope changes the claim and its applicable use under the declared scope rules. - Reliability-like characteristics. Use the exact domain definition, bearer, population or trials, conditions, scale, unit, and qualification window. A system reliability measure and an evidence-quality judgment are not interchangeable.
- Relation congruence. Characterize one exact mapping, calibration, interface, or other relation occurrence only under a declared scale and interpretation. The value neither changes the participants nor supplies a universal penalty.
Never average ordinal values. Do not subtract an ordinal value from a ratio quantity. Thresholds and order comparisons are valid only under the scale that defines them.
Aggregate only under an applicable model
B.3 supplies no default fold. When the assurance argument combines quantitative or ordered inputs, cite:
- the exact result claims being combined;
- the dependency or alternative-path structure;
- the domain aggregation rule or model;
- independence, dependence, calibration, and unit assumptions;
- the calculation or ordered comparison;
- the rival rule that would matter if an assumption fails.
Use min only when the cited domain rule makes the weakest input a lower bound or bottleneck for the exact quantity. It is not universally conservative. If no applicable aggregation rule is available, report the inputs separately and return a bounded, non-positive, or unresolved disposition. Do not manufacture one score to make the result look complete.
Several independent evidence lines may strengthen an argument only through the rule that states how their dependence and coverage are handled. Claim-scope intersection or union follows A.2.6 and the relevant evidence model; it is not an assurance arithmetic shortcut.
Choose one of three proof paths
Compact path. Use the six-field result in 4.2. Stop when it decides the named use.
Calculated or model-bearing path. Add the characteristic results, dependency structure, assumptions, aggregation rule, rival, calculation trace, and sensitivity or failure condition actually used.
Replay path. Add Work, performer, Method, application bindings, witnesses, and a reusable note only when those identities change the named assurance use. For any assessment Work, use A.13 to identify the actual performer and A.15.1 to admit the dated occurrence independently. Add F.6 only if the replay must also say exactly under which assignment the Work was performed. The Work, performer, Method, optional assignment check, result, witness, note, and publication remain separate.
Do not select the replay path merely because the use is important. Importance may make more basis necessary, but every added field must change inspectability, contestability, or the decision.
Keep visible authority outside the result
A badge, score, dashboard tile, credential display, provenance mark, model card, datasheet, data card, assurance document, attestation, generated confidence phrase, or publication form can be a cue, source, evidence item, or representation. It contributes to assurance only through an exact claim and basis relation used by the argument.
If the visible item only reports a status, gate decision, permission, warning, or source location, use its direct pattern and produce no B.3 result. If an assurance claim is current, cite the item only for the property it actually establishes. A valid signature or provenance chain can establish origin and integrity without establishing safety, truth, compliance, or readiness.
Leave domain obligations with their direct patterns
B.3 evaluates an assurance claim. It does not define safety duties, access rules, responsibility, affected-party disclosure, contest, redress, people or team status, resource allocation, release authority, or controlled action. Cite each applicable direct rule as a premise or limitation.
When a direct domain rule says a consequential use requires an assurance claim, state that claim and then apply B.3. When the direct rule requires a decision, permission, review, contest route, or redress relation instead, use that result directly. A display that affects behavior does not by itself open B.3.
Preserve time, currentness, and design/run distinctions
State the exact window only when time changes the assurance conclusion. Monitoring, drift, incidents, evidence refresh, version change, policy change, gate change, or a newly discovered defeater can narrow, reopen, or withdraw a result while the target fact and target-claim identity remain unchanged.
Design evidence and run evidence may support different claims. Produce separate results when target use, conditions, scope, or evidence window differs; compare them instead of merging them into one score.
Keep causal-use and method-structure branches direct
When an assurance argument depends on a causal-use claim, consume the exact C.28 result and its stated supported and unsupported uses. B.3 does not re-run causal identification. An unsupported causal-use result narrows, blocks, or leaves the assurance claim unresolved; it does not become a low universal reliability coordinate.
When composition, fallback, selection, or family organization among Methods matters to the assurance argument, use A.22 to select the exact structure for that question and use the local designator MethodRelationStructure only for that selected structure. Do not introduce a universal method-relation kind or infer structure from a list of Methods.
Use Working-Model declarations only for what they state
An E.14 Working-Model assertion may contribute its declared validation posture and grounding links. A postulate still needs the empirical basis required by the current assurance use; an inferential claim needs its reasoning basis; an axiomatic or constructive claim needs the exact construction and identity basis it relies on. The declaration, grounding link, assessment Work, assurance result, and publication remain different objects.
Proof obligations
Common obligations
Every positive or narrowed B.3 result:
- identifies the exact target claim and named assurance use;
- cites only basis results and relations that actually bear on that use;
- states assumptions, limitations, and unsupported stronger uses;
- keeps target fact, claim, evidence, assessment, result, record, publication, and later use distinct;
- names a reopen condition;
- uses the direct domain rule for every safety, permission, access, status, release, responsibility, or controlled-action premise;
- avoids aggregation unless its model and assumptions are explicit.
Additional obligations for a calculated result
A calculated result also names every bearer, characteristic, scale, unit, dependency, calibrated mapping, aggregation rule, and calculation. It shows at least one assumption whose failure changes the result. If a rival rule is plausible at comparable effort, show why the selected rule fits the declared dependency structure.
Additional obligations for replay
A replayable result adds only the Work and performance facts needed by the receiving use. Follow the §4.5 replay route for each assessment Work. Add its Method, application binding, witness, timing fact, or separate F.6 assignment check only when competence, independence, reproducibility, contest, or redress actually depends on that fact. No record field stands in for an obtaining relation.
Worked cases
Fully calculated case: two necessary independent conditions
Target claim: “The protection function succeeds on a demand.” Assurance use: a bounded reliability argument for a named design decision.
The domain model says that both independently tested conditions must succeed: sensor detection and actuator response. Each has estimated probability 0.9 under the same stated demand class and qualification window. Under the declared independence assumption, the joint probability is:
Using min(0.9, 0.9) = 0.9 would overstate this conjunction. If the conditions are dependent, even the product is not justified; the result must use the applicable conditional model or remain unresolved. The B.3 result therefore cites the two domain results, the series dependency structure, independence basis, product calculation, 0.81 conclusion, limitations, and the observation that reopens the independence assumption.
What changes in practice: the design decision is evaluated against 0.81, not a falsely “conservative” 0.9. No universal B.3 reliability formula is created.
Routed-away case: dashboard status
Starting sentence: “The dashboard approves launch.”
The dashboard is a publication face. Suppose it displays GateDecision GD-17, which records that a named gate passed for release candidate R. The repaired sentence is: “The dashboard shows GateDecision GD-17 for release candidate R; the decision, not the display, records that the gate passed.”
Use A.21 and the release or permission pattern that consumes the gate decision. No assurance claim is present, so B.3 stops. If the dashboard does not resolve an exact gate decision, it is only a cue and launch approval remains unresolved.
Episteme credibility with a compact result
Target claim: “Model edition M predicts response Y within the declared operating region.” Assurance use: whether an engineer may use that prediction as one input to a reversible design comparison.
The engineer cites the exact model claim, its empirical-validation result, the A.2.4 evidence-use relation, the A.10 provenance path, the operating region, and the expiry condition. No combination of unlike characteristics is needed. The compact disposition is supported-for-use, limited to the reversible comparison; release, safety, and operation are expressly not carried. No dated assessment Work or reusable record is added because the use does not depend on who performed the already cited validation.
Order-sensitive Method case
An assurance argument relies on a manufacturing sequence whose result changes when two steps are reversed. The practitioner uses the direct Method and Work patterns for the sequence and, only because organization among several Methods affects the argument, uses A.22 to select a MethodRelationStructure for that exact question. The assurance result cites the sequence result and selected structure; B.3 creates neither the Methods nor their order.
Bias annotation
Conformance checklist
Common anti-patterns and repairs
Consequences
Benefits
- Assurance remains explicit without forcing one cross-domain score.
- A small local claim can stop after six fields.
- Calculations become more trustworthy because assumptions and dependency structure are visible.
- Domain safety, access, responsibility, status, and decision rules retain their own meaning.
- Visible artifacts can contribute useful provenance or evidence without becoming authority.
Trade-offs
- B.3 no longer supplies a convenient universal number. A project must use the domain model that gives its inputs meaning.
- Some assurance questions return
unresolveduntil a dependency model, calibrated mapping, or direct domain requirement is supplied. - Reusable replay records cost more than a compact result and therefore require an actual receiver.
Rationale
Assurance-case practice supports explicit claims, arguments, evidence, and maintenance. Reliability engineering supports calculations tied to dependency structure and assumptions. Neither supports one universal F-G-R-CL score across unlike subjects. B.3 therefore standardizes the boundaries and the minimum result while leaving characteristics and aggregation with the exact models that define them.
Decision-bearing SoTA account
Older assurance-case editions and generic weakest-link slogans are lineage, not decision authority. Popularity, formal appearance, and publication recency do not establish the selected architecture.
Relations
- Builds on:
C.2.1for target and assurance-result epistemes;A.2.4for exact evidence-use classification;A.10andG.6for source-provenance paths and bounded reliance;A.2.6for ClaimScope;C.16andC.16.Qfor characteristic and scale discipline; and the direct domain patterns for every input result. - Coordinates with:
A.15.1andA.6.1only when assessment Work and applications matter;G.11for currentness;F.10for status;A.21for gates; permission, commitment, release, access, responsibility, contest, redress, safety, and controlled-action patterns for their own results; andE.17,E.24.PUB, andC.29for publication and representation. - Coordinates with:
C.28for causal-use results andA.22for a selectedMethodRelationStructurewhen Method organization is part of the assurance argument. - Used by: a pattern or project decision that consumes one exact assurance result. The consumer still applies its own decision, permission, gate, status, or work rule.
Quantum-like claims
Quantum-like wording does not require assurance by itself. If the wording only prevents a local representation mistake, keep the note with C.26 and ordinary evidence. Apply B.3 only when an actual assurance claim about that exact quantum-like result and use is current. A comparative superiority claim must name the rival model, baseline, claimed mechanism, scope, evidence, and loss. Mathematical novelty or prestige supplies no assurance.
Mathematical-lens use
When a C.29 mathematical-lens result is an input to an assurance claim, cite the exact lens-result claim, its interpretation and limits, the evidence-use and provenance relations relied on, and the named assurance use. Mathematical elegance or a structure-preserving mapping does not raise assurance by itself. Measurement construction and comparability remain with 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.
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.
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:L1unless it is linked to at least one evidence carrier viaverifiedByorvalidatedBy. - CC-B3.3.2 (Concept-Bridge Mandate): A ToA at
AssuranceLevel:L1or 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:L2MUST satisfy all L1 criteria. In addition, it MUST be supported by Verification Assurance (VA) withFV ≥ threshold_FV. For holons designated as safety-critical (e.g.,criticality ≥ SIL-2), the ToA MUST also be supported by Validation Assurance (LA) withEV > 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:L1or 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-timeandrun-timescopes (Pattern A.4). An assurance tuple for aMethodDescription(design-time) SHALL NOT be conflated with one for its correspondingWork/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 declarevalidationMode=axiomaticand provide Constructive grounding withtv: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
Consequences
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.19characterization discipline,A.10 Evidence Graph Referring,A.4 Temporal Duality. - Constrains: The computation and interpretation of
AssuranceLevelfor 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:
- Silent Risk Accumulation: Trust silently decays. A component's high
AssuranceLevelcan 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. - 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.
- 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
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
nullsignifies 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:
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 timetis a function of its age past expiry:ED_t(i) = k * max(0, t - valid_until_i)- The coefficient
kis a configurable linear decay factor (default:1.0 per day), allowing projects to tune the "interest rate" on their debt.
- The coefficient
-
Aggregation: The total ED for an assurance target
Ais 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> 0unless waived), its computedAssuranceLevelis provisionally downgraded by one level. For example, anL2assurance target with expired evidence is treated asL1for 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
verifiedByorvalidatedByMUST include avalid_untilattribute. A value ofnull(perpetual) MUST be justified in the evidence carrier's rationale. - CC-ED.2 (Debt Budget Mandate): Every project or
U.SystematAssuranceLevel:L1or higher MUST declare anepistemic_debt_budgetin 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_budgetSHALL have its effectiveAssuranceLevelprovisionally downgraded until the debt is resolved viaRefresh,Deprecate, orWaive. - CC-ED.5 (Waiver Auditability): Any
Waiveaction 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
Consequences
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
AssuranceLevelfor 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 structural relation or a collection's own belongs-to relation has been selected for an additional assurance account without exposing constructive machinery as the public vocabulary.
Use this when. Use this assurance profile only when a publication choice or named current requirement elects it for a direct relation claim. State the readable relation first. After election, structural parthood and collection belonging follow separate trace and validationMode obligations. The trace reports independently grounded facts for inspection; it creates neither the relation occurrence nor the entity it describes.
What goes wrong if missed. The readable relation and its assurance account collapse: authors either lose usable relation sentences, treat collection belonging as parthood, prohibit separately grounded parthood by label, or make a trace look like the cause of the claim.
What this buys. Working-Model relations stay readable, while an elected assurance branch supplies the right inspectable account without changing the direct relation kind.
Not this pattern when. Not this pattern when a direct relation claim is sufficient and no publication choice or current requirement elects this assurance profile. Also 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 keeps ComponentOf, ordinary belongs-to sentences, PortionOf, and AspectOf readable while respecting their different relation kinds. When this assurance profile is elected, structural parthood uses its applicable construction account; collection belonging uses a current
C.13 settrace. Neither branch changes what makes the direct relation obtain, and neither trace decides whether a separate part relation is possible.
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 when the profile is elected (auditor/ontologist view).
-
Each covered published edge carries two additional commitments:
tv:groundedBy→ points to the support required by the relation's branch: the applicablesumorslicetrace for structural parthood, one currentC.13 settrace for the collection's belongs-to relation, or an admissible argument or evidence object for another permitted claim.validationMode ∈ {axiomatic, inferential, postulate}→ declares how the author justifies the assertion.
The pattern that defines the relation still decides when it obtains. CT2R-LOG records the public alias, the branch-specific support link, and the declared assurance posture; 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
Working-Model relations such as ComponentOf and an ordinary belongs-to sentence are easy to use but not self-justifying. Their declarations alone do not show which participants and occurrences obtain, which rule defines the relation, or what identifies the whole or collection. Conversely, exposing construction traces everywhere makes the graph unreadable to non-specialists.
We need: a stable public relation layer for relations and, where this profile is elected, a required, reconstructible grounding channel plus a visible validation intent that downstream assurance can reason about. The direct relation layer does not depend on electing the profile.
Forces
- Two audiences, one dial. Project managers want one relation family and stable views; assurance readers want an inspectable construction account with explicit direct facts and identity conditions.
- 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 patterns that publish structural claims can reuse one three-form construction-account discipline and one readable relation façade without making that account a second ontology.
Solution (thumbnail)
CT2R‑LOG introduces a two‑link discipline around each canonical edge:
-
Alias link (concept‑level). Working-Model relations (e.g.,
ut:ComponentOf) are the public names for their exact direct relation principles.tv:AliasOfmay point from the public relation kind to that principle for comparison and reuse; the alias defines neither an occurrence nor a whole. -
Grounding link (assurance level). Each relation assertion covered by this elected profile carries
tv:groundedByaccording to its direct relation kind:- Structural parthood (
ComponentOf,PortionOf, orAspectOf) requires one current C.2.1 construction-trace episteme in the applicablesumorsliceform andvalidationMode=axiomatic.postulateis not available for this branch. - Collection belonging under the collection's own rule requires one current C.2.1
C.13 settrace andvalidationMode=axiomatic. The trace reports the collection, the entity, the already established relation, the rule for belonging, and the identity conditions. It does not make the entity a constructive part, make belonging obtain, or prove that separately grounded parthood is impossible. - Other epistemic or constitutive edges may use an admissible evidence object or logical argument under
validationMode ∈ {inferential, postulate}when no constructive trace is appropriate.
- Structural parthood (
-
Validation flag (author intent). Every relation or aggregation rule covered by this profile carries
tv:validationModewith one of:postulate— pragmatic working claim backed by observations;inferential— reasoned consequence with a followable argument; oraxiomatic— one inspectable construction account is the declared assurance basis.
The direct branch above selects which modes and grounding targets are allowed. The flag is an assurance posture, not a species of world-side relation and not an identity or timelessness guarantee.
F–G–R alignment. F (the published relation claim):
:PumpA ut:ComponentOf :Skid12. G (its inspectable grounding account): the assertion links to:trace_Γm_sum_456, a C.2.1 episteme about the exact direct construction facts. R (the author's declared assurance posture):tv:validationMode=axiomatic→ one input to B.3.3's AssuranceLevel assessment; it does not alter F.
Structural CT2R Typing-Grounding Unfolding Structure Block
When a constructive trace, working-model relation, and target kind or logical representation must be carried together across contexts, use this block or cite an equivalent A.22.CGUS specialization. The block is useful when the reader must see the passage from constructional material to a typed or logical claim without treating a readable relation label as proof.
unfoldingStructureRef names the current local structure record. StructuralCT2RTypingGroundingUnfoldingStructure is a local [A.22.CGUS](/generated/patterns/A.22.CGUS) U.Structure specialization whose block is governed by B.3.5 only for structural construction-to-typed/logical projection; the A.22-level relation to that narrower specialization, when needed, is specializedStructureRef? on the generic CGUS record. It is not a root U-kind, proof, empirical evidence, work plan, decision, or general ontology-return structure. [C.13](/generated/patterns/C.13) contributes constructive-trace loci; [C.3](/generated/patterns/C.3) contributes kind intent, extent, subkind, and bridge loci; neither creates separate authority for this block.
When an inadequate working account requires general diagnostic recovery of the exact subject construction, use [A.7.1](/generated/patterns/A.7.1). That return may stop at a direct relation, system-role assignment, state or capability, Work occurrence, holon recognition, or the pattern for another subject without opening this structural CT2R specialization.
workingModelOrConstructiveRepresentationRef names the relation, trace, model, or representation being carried. targetKindOrLogicalRepresentationRef names the typed or logical target. bridgeRef and CL_or_CLk are mandatory when cross-context or kind-level movement is current. preservedStructure and lostOrCollapsedStructure state what survives the passage and what the published relation no longer carries. Evidence linkage remains with B.3 evidence and assurance subject patterns; proof linkage remains with the proof or mathematical subject pattern that is current. The unfolding block only makes the structure of the passage inspectable.
Vocabulary & notation (normative)
-
Working-Model relations (front‑stage).
ut:ComponentOf,ut:PortionOf, andut:AspectOfare publication-grade structural relations under their direct A.14 rules. A collection uses the belongs-to predicate defined by the pattern for that collection; FPF has no public genericut:MemberOfrelation. Belonging is not a sub-property ofut:PartOf,ut:StructPartOf, orut:EpiPartOf, but the same entities may separately stand in a constructive part relation when its own rule and all six A.1 matters pass. -
Alias principle (lexical).
tv:AliasOflinks a public relation type to the exact direct relation principle whose reading it carries (for example,ComponentOfpoints to the direct structural-component principle). The alias supports comparison; it neither defines an occurrence nor says that asumexpression produced the relation. -
Grounding (per‑edge). When this profile is elected for structural parthood,
tv:groundedBypoints to the applicable current C.2.1 construction trace andvalidationMode=axiomatic. When elected for collection belonging, it points to one currentC.13 settrace under the collection's own rule and also usesvalidationMode=axiomatic. Other epistemic or constitutive claims may use a logical argument or evidence object under their permitted mode. Every target supports replay of the assertion's basis; it creates neither the direct occurrence nor entity identity. -
Trace family.
Γ_m.sum,Γ_m.set, andΓ_m.sliceare the C.13 forms used by the covered branches.sumandslicereport structural-parthood constructions;setreports an already grounded collection and the belongs-to occurrences established under its own rule. No form creates the facts it reports, and no temporal or workflow form is added. -
Validation flag.
tv:validationMode ∈ {postulate, inferential, axiomatic}is required on every claim covered by this elected profile. Structural parthood and collection belonging useaxiomaticwith their branch-specific current trace. A direct relation outside the profile has no B.3.5 field obligation.
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 published assertion links to
:trace_Γₘ_sum_456, a C.2.1 episteme that names the exact pump and skid, the direct fastening, coupling, enclosure, terminal, flange, and seal occurrences that obtain, the applicable skid assembly rule, and the skid reidentification rule. An auditor replays that account to inspect the assertion's basis. The same listed parts under a different assembly can form another whole, while a permitted pump replacement can preserve Skid12; the direct relations and reidentification rule, not the trace or input list, decide. -
Assurance stance & R-lane. Because the assertion is linked to an inspectable construction account, authors set
tv:validationMode=axiomatic. This records their assurance posture; it does not strengthen the direct relation, fix identity, or make either timeless. B.3.3 reads the flag together with the actual grounding, warrants, evidence, and their currentness to assess the appropriate R lane. F, G, and R remain orthogonal. -
Contrast (epistemic). When the same team asserts
:MassFlowRepresentation RepresentationOf :FlowModel, they declarevalidationMode=postulateand 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.
Collection case — Fleet North. First publish the ordinary sentence: “Vehicle 12 belongs to Fleet North under its registration rule.” Under that rule, the occurrence begins when Fleet North accepts the vehicle's registration, ends on withdrawal or transfer, and a later accepted registration begins another occurrence. If no current publication choice or requirement elects this profile, the direct sentence is sufficient and the author stops.
Here the fleet publication elects the profile. It links the assertion to one current C.13 Γ_m.set trace that names Fleet North and its identity rule, Vehicle 12, the obtaining registration occurrence, the registration rule, and its ending and recurrence conditions; it declares validationMode=axiomatic. If a vehicle enters or leaves the fleet, or the rule changes, the earlier trace remains an account of its earlier state but is not current support for the later assertion. The register and trace report the relation; neither creates it. They prove neither ComponentOf nor that a separately grounded constructive part relation is impossible.
Author Standard (at a glance)
When you add or import a relation edge:
-
Pick a Working-Model relation sentence such as “Impeller ComponentOf Pump” or “Vehicle 12 belongs to Fleet North under its registration rule”; avoid raw
ut:PartOfunless you are drafting meta-level axioms. If no current publication choice or requirement elects CT2R-LOG, publish that direct claim and stop. -
When CT2R-LOG is elected, attach
tv:groundedBy:- Structural parthood → the applicable current construction trace and
validationMode=axiomatic. - Collection belonging under the collection's own rule → one current
C.13 settrace andvalidationMode=axiomatic. - Another permitted epistemic or constitutive claim → the branch's logical argument or evidence object and allowed mode.
- Structural parthood → the applicable current construction trace and
-
Declare the selected
tv:validationModefor every covered claim.
What managers see: nothing new in the graph picture. What auditors get: a reliable trail from every edge covered by the elected profile back to its inspectable construction or evidence account.
Compatibility & cross‑references
- B.3.2 (LOG‑use). CT2R‑LOG supplies the places to hang proofs/evidence that B.3.2 formalizes.
- B.3.3 (Assurance levels).
validationMode+ presence/quality oftv:groundedByare the inputs to computeAssuranceLevel (L0–L2). - B.3.4 (Evidence ageing and currentness). A relation assertion, its construction-trace episteme, and the warrants or evidence used for it retain their own editions and currentness.
validationMode=axiomaticdoes not freeze a trace or make described world-side facts timeless; changed participants, relations, rules, or identity conditions require direct reinspection.
Rule‑set — CT2R‑LOG (conceptual, human‑first)
Intent (one line). Make Working-Model relations the canonical relation vocabulary for authors, while providing a clean, purpose-selected bridge to assurance through aliasing and grounding semantics; the bridge is required only for the published assertions covered by an elected B.3.5 profile or named current requirement.
Vocabulary and meanings in this pattern
-
Working-Model relation. A human-oriented direct relation statement using a public name such as
ut:ComponentOf,ut:PortionOf, orut:AspectOf, or an ordinary sentence such as “this edition belongs to this product series.” It is the canonical public layer for readers; the direct pattern keeps the relation meaning fixed. -
Assurance Layer. Three complementary assurance modes an author MAY attach:
- Constructive grounding: an inspectable account in one of the three C.13 forms (
Γ_m.sum | Γ_m.set | Γ_m.slice). It names independently grounded participants, direct relation occurrences, the applicable construction rule, and identity or reidentification conditions. No formal notation is required, and the account does not create the relation it reports. - 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.
- Constructive grounding: an inspectable account in one of the three C.13 forms (
-
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 account (Constructive, Logical, or Mapping, as applicable). When a construction trace is recorded, it is a C.2.1 episteme with its own edition and currentness. Thetv: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 — the author declares that a constructive account is the assurance basis for this assertion. The mode does not classify the world-side relation and guarantees neither identity nor timelessness.
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 state each covered direct relation claim in Working-Model form. Assurance accounts remain below that public layer. Electing this profile adds branch-specific trace and mode obligations; it is not a precondition for direct use.
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 covered by an elected B.3.5 profile, the author MUST set validationMode and follow the corresponding grounding stance:
-
S‑3.a
postulate. For a branch that permits it, the author may omit constructive grounding, state the working scope, and give the empirical cues that would challenge the claim. -
S‑3.b
inferential. For a branch that permits it, the author gives a short reasoned chain from admitted statements that a peer can follow. -
S‑3.c
axiomatic. The author links the assertion to the current C.2.1 trace episteme required by its branch. A competent peer can recover the exact participants, direct relation occurrence, applicable rule, and identity or reidentification conditions. The account supports inspection; it creates none of those facts. -
S‑3.d Structural parthood. A covered
ComponentOf,PortionOf, orAspectOfassertion requiresvalidationMode=axiomaticand the applicable current C.13 construction account;postulateis not available. -
S‑3.e Collection belonging. A covered belongs-to assertion uses the rule defined for that collection and requires
validationMode=axiomaticand one current C.13settrace. The trace reports already established belonging and collection identity. A logical argument or evidence object may support the inclusion decision separately, but neither substitutes for the elected set trace, turns belonging into parthood, or prohibits a separately grounded part claim.
S-4 (Relation-kind sense-making).
-
For structural
ComponentOf,PortionOf, andAspectOfclaims, the elected profile requires the applicable current construction account andvalidationMode=axiomatic. -
For collection belonging, the elected profile requires one current
C.13 settrace andvalidationMode=axiomatic. The collection's own rule still decides whether the occurrence obtains. -
For other epistemic or constitutive links, constructive grounding remains optional and the branch may prefer inferential or postulate reasoning 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. If a publication choice or named current requirement elects this profile, pick validationMode; otherwise keep the direct relation claim and stop:
- For a permitted exploratory claim, choose postulate and state scope plus challenge cues.
- For a permitted conclusion from known statements, choose inferential and list the short argument.
- For structural parthood covered by the profile, choose axiomatic and link the applicable current construction account.
- For collection belonging covered by the profile, choose axiomatic and link one current
C.13 settrace that reports the already established relation under the collection's own rule.
M‑3. Add tv:AliasOf only when a named direct relation principle helps reviewers recognize the intended reading; do not alias the relation to a constructor result.
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 selected readable relation and remaining non-use boundary are clear and, if this profile is elected, its validation mode and required current support are recoverable without guessing.
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.
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.
Common Anti-Patterns and How to Avoid Them
Consequences (benefits, trade-offs, mitigations)
Benefits
- Cognitive clarity for authors and readers. Working-Model relations remain canonical while assurance accounts stay beneath them. Every claim covered by the elected profile carries only its branch-specific support account; ordinary direct claims remain lightweight. CT2R preserves a path to higher assurance while keeping collection belonging distinct from constructive parthood and order and time outside 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
validationModeand 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)
14.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.
14.2 Why two tv: links—and why concept‑only?
tv:AliasOf and tv:groundedBy name conceptual bridges from a public Working-Model relation to its direct principle and assurance account. They mandate no notation. They keep authors explicit about the relation reading, the support being invoked, and when that support must be current, without letting an alias, trace, or mode define the world-side occurrence.
14.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.
14.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.
14.5 Why point to Γ_m.sum | set | slice (Compose‑CAL) for constructive grounding?
The three C.13 forms—sum, set, slice—are sufficient to report the recurring construction accounts for integrated assemblies, collections, and aspects without expanding the kernel. They are not identity functions. A truthful account carries exact participants, direct relation occurrences, the applicable rule, and identity or reidentification conditions: the same inputs under another assembly can form another whole, while a permitted replacement can preserve one whole.
14.6 Why mental obligations rather than process mandates? Part E requires that patterns define or constrain 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
Checked 2026-08-25. Three source lines change this pattern's method; none supplies its ontology wholesale.
At comparable correctness and currentness, always exposing the heavier account costs more to write and read, while a bare direct sentence cannot meet an elected assurance need. B.3.5 therefore starts with one readable relation and adds one branch-specific account only when the publication elects the profile. The cost is that the relation assertion and its support must be checked for currentness separately.
Reopen only the affected source row and rule if A.14 changes the construction/belonging decision, a later ISO 15026-2 edition changes assurance-case structure or maintenance, or newer model-based-engineering evidence demonstrates a lower-effort way to retain direct meaning, declared posture, traceability, and independent currentness. A changed member, rule, trace, or evidence item instead reopens the affected assertion; it does not by itself reopen this architecture.
Relations
Builds on
- A.14 Advanced Mereology — supplies direct structural relations and the discipline for collection belonging under each collection's own rule and separately grounded parthood; B.3.5 adds only the assurance branch elected for the relation.
- 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 with
- Compose-CAL (
Γ_m) andC.13— supply current construction accounts for structural parthood and thesetaccount for elected assurance of collection belonging. Each trace reports facts whose meanings and conditions come from the pattern that defines the relation. - A.22.CGUS / StructuralCT2RTypingGroundingUnfoldingStructureBlock — provides the local structural CT2R unfolding block when a constructive trace, working-model relation, target kind or logical representation, bridge, preserved structure, and loss must be inspected together;
A.7.1is the pattern for general diagnostic return to a subject construction. - 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 by
- Notational Independence (E.5.2) — CT2R‑LOG refuses to prescribe formats, keeping all obligations conceptual.
Specialises / feeds
- B.3.1–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; those belong to Method‑CAL and Sys‑CAL (TemporalPart) respectively.
B.3.5:End
Canonical Evolution Loop
Status: Stable Type: Pattern
Use this when. Use this pattern when repeated adaptation must keep one exact subject's current identity, an observed basis, a proposed or actual successor, the Systems and dated Work that make the change, and renewed use connected. Name the subject kind first: System, episteme, Method, MethodDescription, or a sequence of distinct Work occurrences.
What goes wrong if missed. Teams treat drift, learning, release, and improvement as unrelated events. Specifications become stale, operational surprises lose their evidence relation, and changes appear without a clear predecessor, successor, performing System, or dated Work. At the opposite extreme, one generic loop is imposed on every subject: a description edit is called a Method change, completed Work is said to be revised, or an internal adaptation is rejected because its acting System is not external.
What this buys. A compact, reviewable adaptation cycle whose identity rule comes from the subject pattern. It keeps observed basis, design-time change, run-time use, acting Systems, dated Work, evidence, publication, acceptance, and responsibility distinct while connecting only the facts needed by the receiving use.
Not this pattern when. Not this pattern when one direct subject-pattern claim answers the change question without a repeated adaptation cycle. Use B.3.5 for relation grounding, B.4.1 for early cue stabilization and routing, B.5.2.0 for abductive hypothesis work, C.27 for temporal status, or A.15 for method/work alignment without an adaptation-loop claim.
Problem Frame
The FPF is built on the Principle of Open-Ended Evolution (P-10): continued use can reveal reasons to adapt a System, an episteme, a Method, or a description. The useful commonality is a repeated move from use through an observed basis and an explicit change back to use. The identity question is not common. The same subject may continue through a change, a successor may be identified, or later dated Work may be a distinct occurrence rather than a revision of earlier Work. B.4 therefore supplies a shared cycle only after the relevant subject pattern has supplied that distinction.
Problem
Without a canonical, shared model for evolution, projects fall into predictable and costly failure modes:
- Design-Reality Divergence (The "Drift"): The run-time subject in use slowly diverges from its design-time account. Formal models become elegant fictions, assurance cases become irrelevant, and the project loses the ability to reason reliably about what it uses.
- Learning Stagnation (The "Ivory Tower"): Observation produces valuable findings, but no explicit change path carries them into a revised design or renewed use. "Lessons learned" remain static documents.
- Chaotic Change (The "Whack-a-Mole"): Reactive patches have no stated observed basis, identity decision, or return-to-use condition. Hidden dependencies and unintended consequences accumulate.
Forces
Solution
Use the Canonical Evolution Loop as a coordinating cycle, not as a universal identity rule. First recover the exact subject and what continuity means for it. Then name the actual Systems and dated Work, traverse only the phases that occurred, and connect the result to renewed use.
Name the subject and continuity question
Not every holon is an adaptation-loop subject, and the five branches are not interchangeable. If the continuity or successor relation is still open, keep that question explicit rather than hiding it behind the word evolution.
Separate the changed subject from the acting side
The subject does not observe, refine, or deploy itself by grammatical convenience. A System performs each actual piece of Work. The changed subject, performing System, dated Work, Method enacted by that Work, and result remain distinct. Practitioner prose can still say "the engineer refined the design" or "the controller adjusted the valve" when that recognizable actor and action are enough. If that ordinary sentence is all the receiver needs, do not open a technical Work account. If B.4 identifies one particular dated U.Work occurrence, first recover every actual performer's A.13 core and independently admit the Work under A.15.1 from its performance history, enacted Method, temporal extent, and containing System. Add F.6 only when the receiving claim also needs precise assignment-bound attribution. A short B.4 account may omit an unused assignment identifier or classification only when every relation it consumes remains recoverable.
The performing System need not be external to the larger holon. For internal adaptation, apply the A.12 reflexive split: identify the changed subsystem or part and the acting subsystem or part as exact, distinct participants, and establish their parthood in the containing holon independently. Use an external System when that is what the case actually has. For any particular dated U.Work, recover every performer's A.13 core and independently admit the occurrence under A.15.1; add F.6 afterward only when precise assignment-bound attribution is current. Name an assignment in the short B.4 account only when the receiving claim uses its identity. State authority, responsibility, permission, acceptance, or admission through its own direct predicate, actual participants, and applicability basis; neither a phase label nor Work supplies them.
Keep the four phases non-overlapping
Use explicit transition conditions:
- Operate -> Observe: a named cue, question, monitoring result, or review need requires interpretation.
- Observe -> Refine: the receiving use has an observed basis or a routed cue from which a change question can be formed.
- Refine -> Deploy: one candidate is selected and its subject-specific identity question or intended treatment is explicit. State an obtaining continuity, successor, substitution, refinement, or edition relation here only when both endpoints already exist; otherwise keep the question open until the relevant change or production has occurred.
- Deploy -> Operate: actual renewed operation or use begins; availability alone does not close this transition.
Evidence is not a fifth phase. Evidence relations warrant the observed basis, candidate choice, transition, or renewed-use claim when a receiver relies on them. Evidence can be produced or used during several phases without duplicating those phases.
Connect neighbouring cycles without collapsing them
The Canonical Reasoning Cycle (B.5) can supply reasoning Work within Observe and Refine. The B.5.1 development states and B.4 phases coordinate, but they are not a one-to-one implementation: a finding may reopen Exploration or Shaping, evidence use can support Evidence, and renewed use can enter or return to Operation.
When Observe finds only a weakly articulated cue, use the optional B.4.1 sequence Notice -> Stabilize -> Route. Its routed result can return to Refine or enter another subject pattern. That sequence does not replace the four B.4 phases.
Keep the account proportional. A local repair can name only the current subject, observed basis, actual Work, resulting identity relation, and next use. Expand to a complete cycle trace when a named relying decision, assurance case, audit, or later replay needs it. Never invent phases merely to make the record look complete.
Didactic Note: four practical questions
- Operate: What exact subject is operating or being used now?
- Observe: What has actual use shown, and through whose Work?
- Refine: What change is being considered, and would it continue or replace the subject?
- Deploy: What deployment Work occurred, and what separately established fact now supports the next use?
The gain is not a ceremonial loop. It is a readable connection from an observed basis to a real change and back to use, without losing subject identity, performers, Work, or evidence.
Archetypal Grounding
The phase names can be shared, but each subject branch keeps its own identity and return-to-use rule.
-
B.4.1 - Observe -> Notice -> Stabilize -> Route (optional pre-abductive route):
- 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:
- Operate: The drones perform deliveries.
- Observe: The monitoring service and named operators perform observation Work and find recurring cold-weather battery strain, but the cue still has low articulation.
- Optional B.4.1 route inside Observe: A named team performs stabilization Work. Under
A.16.1, aU.PreArticulationCuePackpreserves the cue nucleus, primary witness traces, and current language-state position without pretending that a final anomaly or action record exists; when the pack is made available for this use, name the separate publication occurrence underE.24.PUB. The same or another team performs routing Work. UnderB.4.1, aRoutedCueSetkeeps multiple continuations visible—for example, battery-chemistry investigation or route-planning adjustment; again, name its publication occurrence underE.24.PUBwhen availability matters. - Continue the loop: The selected route enters Refine or another fitting subject pattern. Only a selected and tested change proceeds to Deploy and renewed drone operation.
- Context: A fleet of autonomous delivery drones (
-
Knowledge-instantiation slice (theory refinement loop):
- Context: A scientific theory of protein folding (
U.Episteme) is used to predict structures. - Loop Example:
- Operate: Named researchers perform theory-application Work using the current theory episteme.
- Observe: A research lab performs observation Work. A separately identified
C.2.1finding episteme states that the current theory fails to predict the structure of a protein class; name separately anyE.24.PUBpublication occurrence that makes this finding available. - Refine: A research team performs revision and testing Work. A later theory episteme, identified under
C.2.1from its changed claim content, includes a term for the new protein class. Assert an edition relation between the two theory epistemes only if that relation obtains. - Deploy: The team performs publication Work for the later theory. The publication occurrence, journal acceptance, admission into a configured knowledge base, and later community use are separate relations. 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
TaskFamilyorTaskSignatureanchor consumed byC.22.1,G.5, andG.9. This keeps the refinement legible as contextual task-family specialization rather than vague general capability growth. - Context: A scientific theory of protein folding (
-
Method-instantiation slice (adaptive method loop):
- Context: A field-maintenance organization uses a declared inspection-and-repair Method (
U.Method) described by one currentU.MethodDescription. - Loop Example:
- Operate: Maintenance teams perform dated maintenance Work that enacts the current Method.
- Observe: A reviewer performs review Work and records that the time from fault detection to safe restoration repeatedly exceeds the allowed window.
- Refine: Method maintainers perform revision and testing Work. A wording clarification can yield a later MethodDescription while the same Method remains current. Adding an earlier isolation action or changing a classification checkpoint can instead change identity-bearing Method semantics; decide under
A.3.1whether the result is a refinement, substitute, or distinct successor Method, and useB.1.5if its composition changes. Then identify the MethodDescription episteme that describes the chosen Method. - Deploy: A named publishing team performs publication or release Work for the later MethodDescription and, where needed, configuration or training Work for renewed Method use. Decision results, authority, acceptance, admission, and later Work that enacts the Method remain separate. Completed maintenance Work is never revised.
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.
- Context: A field-maintenance organization uses a declared inspection-and-repair Method (
Bias-Annotation
Conformance Checklist
- CC-B4.1 (Proportional loop integrity): Record the actual path from observed basis through change to renewed use. A complete phase-by-phase trace is required only when a named relying decision, assurance case, audit, or replay needs it. Do not invent a phase or claim completion merely to fill a loop.
- CC-B4.2 (Subject identity): Name the exact subject kind and apply its direct continuity rule: System continuity or transformation; episteme predecessor, successor, or edition; Method identity, refinement, substitution, or successor; MethodDescription edition; or separate dated Work occurrences.
- CC-B4.3 (Acting-side distinction): Work that observes or changes a subject MUST have an identified performing System distinct from the changed subject in that Work account. Internal adaptation is permitted when
A.12establishes exact distinct subsystems or parts and their independently obtaining parthood. Every particular datedU.Workreuses each performer's A.13 core and is independently admitted under A.15.1; F.6 is added afterward only for precise assignment-bound attribution. Its short B.4 account may omit an assignment identifier unused by the receiver only when every consumed relation remains recoverable. - 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
TaskFamilyorTaskSignature, 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, andG.9patterns. - CC-B4.6 (Phase and transition separation): Operate, Observe, Refine, and Deploy MUST have the distinct outputs and transition conditions stated in B.4:4.3. Evidence use and optional B.4.1 cue routing do not become duplicate phases.
- CC-B4.7 (No success inference): Deployment or publication establishes neither acceptance nor successful renewed use. Record failure, reopening, fallback, or another iteration when that is what occurred.
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
This pattern operationalizes the Open-Ended Evolution Principle (P-10) by connecting use, observation, explicit change, and renewed use. It does not supply one generic ontology of evolution. Subject patterns decide identity and continuity; Systems perform dated Work; evidence supports relied-on claims; and B.4 makes their repeated coordination inspectable.
SoTA-Echoing
The phase rhythm has historical lineage in iterative cycles such as Plan-Do-Check-Act and Observe-Orient-Decide-Act. B.4 adapts that lineage rather than treating those labels as an ontology: it distinguishes design-time accounts from run-time use, applies a kind-specific identity rule, identifies actual Systems and dated Work, admits internal acting-side splits, and keeps evidence, deployment, publication, acceptance, and renewed use separate.
The result is a practical review language for repeated adaptation. It avoids both agentless "self-evolution" stories and the opposite mistake of requiring every acting System to be external. Canonical means the four questions recur; it does not mean every subject or project follows one identical history.
Relations
- Operationalizes:
P-10 Open-Ended Evolution. - Uses:
A.4 Temporal Dualityfor design-time/run-time distinctions;A.12for external or reflexively split acting sides;A.15.1for dated Work; and the direct subject patterns named in B.4:4.1 for identity and continuity. - Coordinates with:
B.5 Canonical Reasoning Cycle,B.5.1development states, andB.3 Trust & Assurance Calculus. B.4 does not implement the B.5.1 states one-for-one, and evidence is not a B.4 phase. - Is detailed by:
B.4.1 Observe -> Notice -> Stabilize -> Routefor optional early cue routing, together with B.4.x instantiation patterns for specific subject 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 a U.PreArticulationCuePack and a RoutedCueSet through B.4.1; a selected route then enters Refine or another fitting pattern. A downstream loop consumes the routed cue publication directly or a later typed publication such as U.AbductivePrompt, as appropriate.
B.4:End
Observe -> Notice -> Stabilize -> Route
Type: Architectural (A) Status: Stable 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 assertions under exact subject predicates, the cluster needs one explicit route-bearing seam that can publish route plurality or route selection without pretending that the cue already satisfies an endpoint predicate.
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-subject assertion, predicate, and pattern locator.
Forces
Solution
Insert a pre-abductive route-bearing seam inside the language-state cluster, between observation/cue preservation and endpoint subject-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:
sourceCuePackRefcandidateRouteSetrouteDecision?selectedRoute?routeRationale?routeSelectionStatus?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 routeSelectionStatus belong here when route selection is explicit. They do not belong in U.PreArticulationCuePack. The status says only whether plurality remains open or a route has been selected; endpoint admission, publication availability, current use or retirement, and any actual authority relation remain separate claims under A.16 and their direct patterns.
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:
EvaluativeRouteActionInvitationRouteProblemAbductionRouteMethodWorkRouteRequirementCommitmentRoute
- conditional extension routes for bounded specialization or corridor discovery:
TaskFamilySpecializationRouteAdaptationProbeRouteNonHumanUtilityRouteSubstrateDiversificationRoute
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 subject 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 subject 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.AbductivePromptunderB.5.2.0,- a later typed endpoint-entry publication under
A.6.P,A.6.A, orC.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-1Observe output SHALL NOT be forced directly intoAnomalyStatementwhen articulation threshold is not yet met.CC-B.4.1-2A routed cue set SHALL name itscandidateRouteSet.CC-B.4.1-3When route selection occurs,routeDecision,selectedRoute, androuteRationaleSHALL be explicit.CC-B.4.1-4publicationFaceRefsMAY be named, but route-bearing form and publication face SHALL NOT be collapsed.CC-B.4.1-5RoutedCueSetSHALL NOT silently masquerade as a late endpoint subject pattern.CC-B.4.1-6When 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 subject 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 subject 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, selection status, and any current-use or retirement claim 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 subject 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 subject 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 subject 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 subject 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 subject 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 subject 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.Afamily selection, - explicit prompt question for
B.5.2.0, - explicit requirement or commitment head for requirement-facing subject patterns,
- or explicit
A.15hook for method, work-plan, or work-occurrence use.
If those next-subject-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 epistemes or project records are identified and their preserved and lost content and any exact lineage relations are stated. Publication availability and any responsibility or authority handoff remain separate claims.
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 subject-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:
- 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.
- 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.
- 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
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 atAssuranceLevel: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.
| 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:L0as 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:L1or 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
Consequences
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:
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.EpistemeorU.Systemin 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.EpistemeorU.SystemSHALL 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
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:
- Inquiry stalls at surprise. A team encounters an anomaly, opportunity, or probe pressure but has no admissible next action for producing a candidate hypothesis.
- Origin is lost. Once a conjecture appears, the initiating prompt, rival candidates, and early plausibility grounds disappear from the record.
- Candidate space collapses too early. The first plausible-seeming explanation is treated as the explanation, even though alternatives were never exposed.
- Selection becomes opaque. A chosen conjecture moves downstream without a visible record of why it outranked alternatives.
- 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
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
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.
Abductive Unfolding Structure Block
When the abductive run must be reused as more than a one-off hypothesis note, add an unfolding block. It shows how the prompt becomes rival hypotheses and downstream tests without treating the creative passage as evidence.
Use unfoldingStructureRef for the current local structure record; use A.22.CGUS specializedStructureRef? only when the generic CGUS record must point to this narrower specialization. Use cueSetWithDownstreamPatternAlternativesRef when the prompt still carries several possible patterns for the next question. Use rivalHypothesisSetRef before selecting a prime hypothesis. Use evidenceReturnLoci[] to say where later evidence, deduction, probe design, or assurance work can return; do not use those loci as evidence. If the live claim becomes candidate retention, pool policy, selected-set result declaration, or comparison, apply [C.18](/generated/patterns/C.18), [C.19](/generated/patterns/C.19), [G.5](/generated/patterns/G.5), or the pattern that defines the required comparison instead of making abduction a selector.
AbductiveSearchUnfoldingStructure is a local [A.22.CGUS](/generated/patterns/A.22.CGUS) U.Structure specialization used for abductive search. It is not a root U-kind, ideation workflow, evidence, or selection decision. Use [B.5.2](/generated/patterns/B.5.2) to state the abductive prompt, cue set with alternative next patterns, rival hypotheses, plausibility constraints, and evidence-return loci. Use the patterns that define or test evidence, deduction, probe design, assurance, selected-set result declaration, pool policy, and comparison when those claims become current.
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-1Every abductive run SHALL begin from a declaredU.AbductivePrompt; arbitrary prose fragments are not sufficient prompt-entry forms.CC-B.5.2-2A 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-3Selection of a prime hypothesis SHALL cite at least two explicit plausibility filters.CC-B.5.2-4The selected prime hypothesis SHALL be published as a newU.EpistemewithAssuranceLevel:L0.CC-B.5.2-5The prime hypothesis record SHALL preserve a link to the initiating prompt and to the filtering rationale that justified selection.CC-B.5.2-6A 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
Consequences
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.AbductivePromptpublications fromB.5.2.0, often reached throughB.4.1andA.16. - Produces: hypothesis-bearing
U.Epistemepublications atAssuranceLevel:L0. - Provides inputs for: downstream deduction, probe design, and evidence acquisition in the reasoning cycle.
- Coordinates with:
A.22.CGUSwhen the abductive prompt,B.4.1cue publication, rival hypotheses, plausibility constraints, evidence-return loci, and downstream tests must be inspected as anAbductiveSearchUnfoldingStructure.
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, orProbeCuePrompt), - the open question that makes abduction necessary,
- the declared scope under which the question is being posed,
- the witnesses or provenance cues that made the prompt worth preserving,
- and the reason the current model is insufficient.
If the initiating publication is still primarily evaluative, action-inviting, or lexically overloaded, it should first be repaired by the relevant A.6 family before it is treated as a stable abductive prompt. B.5.2 assumes typed entry, not raw lexical ambiguity.
Candidate-set note
A candidate-set note is the minimal record that preserves rival plurality. It need not be heavy, but it should make visible:
- candidate identifiers or short names,
- the differentiating claim each candidate adds,
- the principal plausibility supports and liabilities of each candidate,
- whether the candidate remains live, is deferred, or is rejected,
- and what missing evidence or probe would best discriminate among the remaining rivals.
The important point is not bureaucratic completeness. The important point is to prevent retrospective rewriting in which the surviving candidate is made to look as if it had been the only serious option from the beginning.
Prime-hypothesis record
A selected prime hypothesis should preserve more than the hypothesis sentence itself. A conforming L0 hypothesis record should name:
- the selected candidate,
- the prompt it answers,
- the filters under which it outranked rivals,
- the scope within which it is being advanced,
- the next admissible downstream move (deduction, probe design, targeted evidence acquisition, or explicit reopening criteria),
- and any known fragilities already visible at selection time.
This is how B.5.2 stays connected to the rest of the reasoning cycle. The abductive loop does not merely emit an idea; it emits a conjecture with explicit 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 publication forms that carry route-shaped representations 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:
- Abort. The prompt dissolves because the initiating anomaly or opportunity was misread, duplicated, or already answered elsewhere.
- Defer. Several candidates remain live, but the discriminating evidence or probe is not yet available. The loop pauses without pretending a winner exists.
- 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 move could expose that selection as right or wrong?
If those answers cannot be given, the publication is probably not yet at B.5.2 and should return to prompt-shaping or lexical repair.
For 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
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:
AnomalyStatementProblemCuePromptOpportunityCuePromptProbeCuePrompt
- conditional extension species:
TaskFamilySpecializationPromptAdaptationProbePromptNonHumanUtilityPromptSubstrateDiversificationPrompt
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:
promptSpeciesmotivatingCueRef?openQuestioncontrastSet?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-1EveryU.AbductivePromptSHALL declare its prompt species.CC-B.5.2.0-2A prompt SHALL NOT be confused with a finished hypothesis.CC-B.5.2.0-3Cue-derived prompts SHOULD preserve route provenance.CC-B.5.2.0-4Prompt publication SHALL include the open question that makes abduction appropriate.CC-B.5.2.0-5A publication that already fixes the answer or suppresses plausible rivals SHALL NOT remain in prompt status.CC-B.5.2.0-6When 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:
- Is there a real open question? If the text already asserts the answer, it is no longer a prompt.
- Is the prompt species plausible? If the initiating cue shape is opportunity-shaped or probe-shaped, forcing anomaly species is a category error.
- 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
DecisionSubjectat explicitDecisionSubjectGranularity. 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 pursuing—without 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 •Qcomponents (per A.18).SurpriseandIlluminationare secondary: Illumination is report‑only telemetry (published asIlluminationSummaryoverDiversity_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_iis a vector andprovenance_icaptures 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, andIare archive, tie-break, telemetry, or policy-promoted signals by default; only the declaredDominanceSetenters the current front.Use-Valueis decision-side/supporting unless the current Context explicitly declares it inside the activeQtuple /DominanceSet; when it is only recorded as a side measure, keep it outside dominance.
Strategy (notation‑neutral).
- Seeding. Initialize with seeds (known solutions, random draws, or prior L0 hypothesis epistemes).
- 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
DedupThresholdin CharacteristicSpace. - 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 declaredQcomponents underDefaultId.DominanceRegime, not one fresh local doctrine. KeepN,D=ΔDiversity_P,Surprise, andIlluminationSummaryas archive/tie-break/telemetry signals unless one Context policy explicitly promotes one of them into dominance and records the policy id.Use-Valueenters dominance only when the current Context explicitly declares it inside the activeQtuple; otherwise it may appear as one decision-side/supporting side note. - 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.) - 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, andB.1.5plus 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.DominanceRegimefromG.Core/G.5together with the activeC.19policy-side defaults; in ordinary Q-front use this means the declaredQcomponents, withConstraintFit=passas eligibility gate. Tie‑breakers:Novelty@context,ΔDiversity_P, andSurprise;IlluminationSummary (telemetry summary over Diversity_P)remains report‑only unless a CAL policy promotes it. Archive:K=1,ε=0, deduplication inCharacteristicSpace. Policy family: one uncertainty-aware explore policy family with one declared regime key;UCB-class with moderate temperature andexplore_share ≈ 0.3–0.5is one didactic starter profile, not the semantic default family. Provenance (minimum): recordDescriptorMapRef.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
DominanceSetfor 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 activeover wording that foldsQ, novelty, and diversity into one default front by habit. - The local generation story should stay consistent with the declared
Front,Archive, andShortlistlanguage 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, andK=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:
- 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.)
- Frontier‑Hit Rate (FHR). % of cycles where the chosen candidate lies on the Pareto front over the declared
DominanceSetat selection time; track novelty/diversity contribution separately as archive, tie-break, or policy-promoted evidence. - Coverage Gain (ΔI, report). Change in the illumination summary (coverage map/%filled cells) per cycle (how much of the descriptor space is now “lit”).
- Exploration Cost Ratio (ECR). Compute/time spent in NQD‑Generate divided by downstream Shape/Evidence cost saved (tracks whether the pattern pays for itself).
- 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‑Q4→ covers 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.
Related Patterns
- 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
Solution
Use the Domain-Concept Bridge as a bounded reasoning move, not as a new domain container or mandatory record.
- Start from the exact expression, source, edition, and relevant passage. Use F.0.1 to recover the source-local claim. Create an F.17 cell and basis relation only when later durable reuse needs that address.
- Ask which exact FPF value or relation the current claim needs, then use the pattern that defines or constrains it. For example, the answer may concern a System, characteristic, Method, Work occurrence, episteme, system-role assignment, or evidence-use relation; the list is illustrative, not a set of new bridge kinds.
- If the use really needs a new kind, apply E.24.UK and C.3. A familiar expression, table row, or diagram label supplies no kindhood.
- If the recovered source-local claim already answers the question, return it and stop. If a receiving use must relate two distinct local-sense claims, use F.9 to test whether an exact Bridge between their F.17 cells actually obtains. Shared spelling, a mapping table, or a completed card proves no such relation.
- State the receiving use separately. Name the direction, scope or applicability boundary, tolerated loss, evidence or reliance basis, and reopen condition only when each changes that use. The semantic relation alone neither authorizes nor performs the use.
- When role wording is material, use E.10.ROLE and A.2 to distinguish a local system-role kind, classification, assignment, participation, responsibility, or ordinary language before making the direct claim.
The practical result can be one readable sentence. Use a note, row, or card only when a later reader or tool needs durable packaging. The package describes the result; it does not create the FPF value, local meaning, relation, or permitted use.
An alias says only that L is another name for V. A completed B.5.3 move instead says what the exact source means here, which FPF value the current claim uses, whether any direct relation actually obtains, and what the named receiving use may rely on. Thus a component called "sensor" may lead to a System claim, measurement-capability claim, publication claim, or system-role-assignment claim; the expression alone chooses none of them.
Archetypal Grounding
A thermodynamics team models a heat engine.
- In the cited thermodynamics source, "thermodynamic system" names the engine under concern together with the boundary and state variables relevant to that local claim. Recover the same System already used elsewhere; the expression does not automatically name a kind or assignment.
- "Macrostate" makes a source-local claim about a state description or characteristic bundle over, for example, pressure, volume, temperature, and particle amount. State the effective scheme and units directly; create an F.17 cell only if durable reuse needs one.
- "Control volume" may name a boundary or region relation. The claim 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 claim must say which FPF value the decision uses.
- If the engine control System is assigned a locally defined heat-source-controller system-role kind, establish a separate obtaining occurrence of the declared
U.SystemRoleAssignmentspecies. The source-local meaning, classification, assignment, Work, claim scope, and time window remain separate.
Current physical-system claims in this example use A.1 for system identity, A.14 and A.22 for composition and boundary relations, A.3.4 for state and dynamics, B.1.6 for work-resource aggregation, and C.16 for measured characteristics. Planned C.1 (Sys-CAL) may later consolidate that guidance; it is not a current governor.
What this achieves:
- Domain constraints become reviewable without turning every domain word into a root kind.
- Verification can use the direct pattern for the recovered value: boundary discipline for a control volume, characteristic-space discipline for state variables, system-role-assignment discipline when an assignment is claimed, and publication-use or evidence-use discipline for reports and dashboards.
- The heat engine remains the same System when a power-plant architecture, finance model, safety case, and thermodynamics model all discuss it. Any actual F.9 relation states how two distinct local meanings correspond; the named receiving-use claim states which losses block that use.
The same expression can be reused in an architecture view, a requirements document, and a simulation model only after each local claim identifies its actual value. If the claims use distinct local meanings, test any required F.9 relation and its receiving use separately.
Conformance Checklist
- CC-B5.3.1 (Recover the FPF value used by the claim): The result names the exact FPF value or relation used by the current claim before treating a preferred expression as reusable.
- CC-B5.3.2 (No kindhood by spelling): A local expression, dotted name, table row, or diagram label does not become a U-kind. A needed durable kind requires its own E.24/E.24.UK and C.3 settlement from independent ontic and membership evidence.
- CC-B5.3.3 (Role boundary): When role wording changes the claim, E.10.ROLE first recovers whether it means a local system-role kind, classification, assignment, participation, responsibility, or ordinary language. Each resulting claim then uses its own FPF pattern.
- CC-B5.3.4 (Relation and use boundary): Claim an F.9 Bridge only when its exact endpoint cells and predicate make it obtain. State the receiving use, direction, applicable scope, tolerated loss, evidence or reliance basis, and return condition separately; shared spelling proves none of them.
- CC-B5.3.5 (Description boundary): If the local expression appears in a requirement, diagram, dashboard, report, or publication, use the direct description and publication patterns to keep the described entity, description episteme, publication form, and carrier distinct.
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
This pattern implements open-ended parsimony: FPF can use many domain vocabularies without turning every useful expression into a kernel kind. It recovers the source-local claim first, routes the needed FPF value to its direct pattern, and introduces an F.9 Bridge only for an actual relation between distinct local senses.
Relations
- Builds on:
A.2,A.6.5,C.3,E.24.UK,F.0.1,F.1,F.2,F.3,F.5,F.8, andF.17. - Coordinates with:
A.7,C.2.1,E.10.ROLE,E.17,A.13,A.15,B.3.3,F.7,F.9, and the direct domain-specific CHR, LOG, and CAL patterns. - Used when: a project must recover what an exact source expression means for one FPF claim, or must relate two distinct local meanings for a named receiving use without confusing the wording, governed value, semantic relation, and use.
B.5.3:End
Last Updated: 2026-09-03 — upstream FPF commit b999972c (github.com/ailev/FPF)