This is generated FPF reference text from the specification preface or supporting sections. It helps interpret FPF; it is not FPF Reference product documentation.
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.
**Examples of Discipline Columns (illustrative):** Operational Management - IT/Software - Physics - Science/Theory - Mathematics - Literature - Religion._(Choose 3–5 that fit the thread; do not place Contexts here.)_### Didactic Aids* **Trip‑wire column (optional).** A ⚡ marker in `Notes` for known homonyms (e.g., *process (BPMN) ≠ process (thermo)*).* **DesignRunTag tag (optional).** `design` / `run` hint for concepts whose senses split by time.### Micro Examples (one line each, illustrative)*(These illustrate Layout A headings; swap Contexts to match your cut.)***Row: `U.Work` (Execution)**`Tech=Execution - Plain=run` — “Dated, resource‑consuming occurrence realising a MethodDescription.”**BPMN 2.0 (2011)**: *Activity instance* - **PROV‑O (2013)**: `prov:Activity` - **ITIL 4**: *change/incident record (run)* - **SOSA/SSN**: *(context: producer of Observation)* - **Essence (Language)**: *Activity occurrence* - **Bridges**: CL=3 (BPMN≍PROV) - **Rationale**: *All cells denote the concrete happening, not the recipe nor the capability.***Row: `U.MethodDescription` (Recipe)**`Tech=MethodDescription - Plain=recipe` — “Recorded specification guiding executions.”**BPMN 2.0 (2011)**: *Process model* - **PROV‑O (2013)**: `prov:Plan` - **ITIL 4**: *SOP / Work instruction* - **Essence (Language)**: *Activity space/Practice description* - **Bridges**: CL=2 (loss: control‑flow vs intent) - **Rationale**: *All cells denote the codified ‘how’, distinct from both the performer and the run.*> These rows are examples only; your UTS MUST be compiled from your chosen **Contexts** (Layout A) or **Discipline Columns (DC)** (Layout B) and SenseCells.### Relations* **Builds on:** [F.1](/generated/patterns/F.1)–[F.3](/generated/patterns/F.3) (contexts & local senses), [F.7](/generated/patterns/F.7) (Concept‑Set), [F.5](/generated/patterns/F.5) (names), [F.9](/generated/patterns/F.9) (Bridges).* **Feed:** Part A and Part C definitions/examples (row ids used as cross‑refs); teaching bundles ([F.16](/generated/patterns/F.16)).* **Constrained by.** [A.7](/generated/patterns/A.7) **Strict Distinction**, [A.11](/generated/patterns/A.11) **Parsimony**, **[E.10](/generated/patterns/E.10) §6 Twin‑Register Discipline** (Tech/Plain), **[E.10.P](/generated/patterns/E.10.P) (prefix registry: tv: / ut:)**, [E.10.D1](/generated/patterns/E.10.D1) **Context discipline**.### Migration Notes* **Re‑blocking.** If the Block Plan changes, keep row ids stable; move rows between blocks rather than renumbering.* **Context growth.** When adding a new Context, populate SenseCells progressively; do not claim coverage until ≥ 1 row per block cites it.* **Name evolution.** Update **Plain** labels freely for pedagogy; change **Tech** labels only via [F.5](/generated/patterns/F.5) with clear S‑rules.### FAQ (authoring hygiene)**Q1. Is the UTS a registry?***A.* No. It is a **didactic publication**. No CRUD semantics, no workflows.**Q2. Can we collapse two Contexts if their terms look identical?***A.* Only via **[F.9](/generated/patterns/F.9) Bridge** with **CL=3**. Identity must be argued, not assumed by spelling.**Q3. Where do state‑graphs ([A.2.5](/generated/patterns/A.2.5)) show up?***A.* In `Notes` or as a dedicated row if the stateful nature of a Role family is central to the thread.**Q4. How do we show deontic approvals?***A.* The concept rows (`U.SpeechAct`, `U.Commitment`, `U.PromiseContentClause`, `U.PromiseFulfillmentEvaluation`) make the communicative/epistemic pieces visible; enactment appears in examples, not as sheet mechanics.### 90‑Second Teaching Script> “To make our language usable, we publish a **Unified Term Sheet** for each thread. Each **row** is one **unified concept** (a Concept‑Set) named with a **Tech** and a **Plain** label and tied to concrete senses in our chosen **context of meaning**. If two contexts differ, we show an explicit **Bridge** with a **CL score** and a short **loss note**. The rows are grouped into 5–7 **didactic blocks** so the whole sheet fits in working memory. This is not a database; it’s the **one table** a careful mind can hold. From this sheet, everyone—engineers, managers, researchers—can talk precisely through **the same Concept-Set rows** across disciplines.”### F.17:End## Local‑First Unification Naming Protocol*Status: normative (Part F, Unification Suite). Audience: engineer‑managers, lead architects, editors of FPF records and publications.*### Use this whenUse `F.18` when a name must become stable and reusable across one local context, a concept set, a bridge, or a durable FPF/publication vocabulary. Use it when the issue is not merely one overloaded local phrase, but a name that must carry context, kind, local sense, use-domain, bridge relation or [F.9.1](/generated/patterns/F.9.1) bridge stance when live, and lineage without smuggling global sameness.**First useful move.** Ask whether the live work is durable naming. If yes, make the name local-first by naming its context, kind, purpose/use-domain, local sense, and bridge relation or [F.9.1](/generated/patterns/F.9.1) bridge stance when live. If no, use the lighter governing pattern: local phrase repair under `E.10` or `C.2.P`, relation precision under `A.6.P`, or the domain pattern that governs the named object.**Cheap stop.** If the wording is one-off local repair and does not create a reusable name, stop after the local repair with recovered kind and use. Do not open a full Name Card, mint a new head, or create lineage entries just because a phrase was clarified.### ContextNames must carry enough signal for everyday use, yet never smuggle in Cross‑context identities, hidden assumptions, or role/metric clutter. [F.18](/generated/patterns/F.18) supplies that naming discipline and weaves it through [F.1](/generated/patterns/F.1)–[F.17](/generated/patterns/F.17): Term Harvesting, Sense Clustering, Role Descriptions, Concept‑Sets, Bridges, Lexical Continuity, Anti‑Explosion control, and the Unified Term Sheet (UTS).**Scope.** This protocol applies to naming of **any concepts** authored in Part F (U.Types and **local concepts** alike: kinds, roles, services, methods, works, relations, characteristics, states/statuses, etc.). The **U.Types** norms in this section are a **specialization**, not a restriction of scope.**Purpose of this pattern.** Provide a **human-legible, context-bound naming protocol** that:* keeps *local meaning first* and prevents Cross‑context conflation;* makes the **kind** of thing explicit (System, Episteme, Role, Service, Method, Work, Decision, Requirement, etc.);* integrates smoothly with **Concept-Sets**, **`U.RoleDescription`**, and **Bridges** without requiring any special notation or tooling;* records lineage actions (mint, reuse, align, deprecate, split/merge) with a paper trail that managers can audit.### ProblemWithout a shared naming protocol inside Part F, the same recurrent failures appear:1. **Global‑name illusion.** A short label travels from one context to another and is *assumed* to mean the same SenseCell or Concept-Set row; later, contradictions appear during acceptance or assurance.2. **Context drift.** A label gradually changes inside its Context (edition, scope, envelope) without leaving a clean trace; readers argue over “what we meant.”3. **Kind confusion.** Names hide *what sort of thing* is being named (System vs Episteme vs Role vs Service, etc.), leading to category errors and brittle integration.4. **Threshold‑in‑the‑name.** Numeric limits, duty segregation, or state qualifiers get baked into names (“Critical‑Reviewer‑0.2 mm”), which cannot age or compose.5. **Stealth renames.** Quiet label swaps, steered by fashion or politics, sever continuity with earlier evidence, plans, and bridges.6. **Explosion by synonyms.** Teams mint many near‑synonyms instead of reusing a Concept‑Set row or creating an explicit Bridge with loss notes.These failures erode trust, block reuse, and make Part F machinery (Concept-Sets, `U.RoleDescription`, Bridges) harder to apply.### Forces| Force | Tension to balance || ------------------------------------------ | ----------------------------------------------------------------------------------------------------------------------------- || **Local truth vs Cross‑context portability** | The name must “belong” inside one context while remaining referenceable from other contexts through explicit bridges. || **Human ergonomics vs conceptual clarity** | Short, natural labels help teams move; explicit kind and Context cues keep reasoning sound. || **Stability vs evolution** | Names should be durable, yet easy to deprecate or refine without breaking links to past evidence and work. || **Brevity vs auditability** | A compact “badge” for everyday speech, plus an authoritative **Name Card** that records meaning, scope, edition, and lineage. || **Parsimony vs inclusivity** | Reuse existing Concept‑Set rows where possible; mint new names only when indispensable in the local context. |### Solution — The Local‑First Naming Protocol[F.18](/generated/patterns/F.18) defines **eight rules** (R‑rules) and **six practices** (P‑practices). Together they produce **Name Cards** that any reader can interpret **ontologically** without guessing, and that slot cleanly into the rest of Part F.**Path Card (subset of Name Card).** A **Name Card** whose named FPF value is an **EvidenceGraph Path**: it cites a **PathId** (or **PathSliceId**), **Context**, **ReferencePlane**, **Γ_time**, and any **Bridge id(s) + CL/CL^plane** (with loss notes). Used by **[G.6](/generated/patterns/G.6)** and **[G.10](/generated/patterns/G.10)** to make justifications portable on UTS.#### The Eight R‑rules (normative)**R1 — Speak every name *with its Context*.**A name is **never** context‑free. When you introduce or use a name, **pair it with the Bounded Context** where it lives (the “Context of meaning”), and with the **edition** of that Context if relevant. In everyday speech: “X, *in* Y.” Cross‑context use requires a Bridge; labels alone do not travel.**R2 — State the ontological *Kind* on the Card.**Every Name Card **must** state the **Kind** (System, Episteme, Role, Service, Method, Work, Objective, Requirement, Decision, Characteristic, etc.). This prevents category errors and keeps Role–Method–Work alignment clean. *Clarification:* this is a **Card requirement**, not a demand that the label string begin with the Kind. The Kind field uses an accepted FPF kind or an explicitly marked extension candidate; the Name Card does not itself create a `U.Kind`, `RelationKind`, `GateProfile`, `EvidenceKind`, MVPK face kind, or Bridge.**R3 — Declare the *Purpose / use‑domain* on the Card.**In addition to **Kind**, the Name Card **must** state the intended **Purpose / use‑domain** that situates the concept in practice and signals **which families of contexts** are expected to use it (e.g., mathematical formalism, engineering practice, computer science, systems management). This enables reconstruction of usage from the lexicon and reduces unintended scope drift. *Clarification:* this is a **Card field**; it does **not** require the label string to carry the purpose qualifier.**R4 — Resolve the name to a *Local‑Sense*.**A minted name must resolve to a Local-Sense inside its Context (the result of [F.2](/generated/patterns/F.2)–[F.3](/generated/patterns/F.3)). If a name points to a Role Description, state that template and its sense basis. Avoid heavily overloaded label words: when needed, prefer concise two-word Tech labels that hint at the intended sense.**R5 — Use *Twin Registers* (Unified Tech + Plain).**Provide two human‑oriented labels on the Name Card, per **[E.10](/generated/patterns/E.10)** register discipline:* a **Unified Tech** label (short, morphology‑stable, neutral in wording);* a **Plain** label (reader‑friendly phrasing for managers and subject‑matter experts).The **Unified Tech** label is the only one used in **Core** normative prose; **Plain** is for teaching and examples. Both remain **context‑local**; neither establishes Cross‑context identity (that is the job of the **UTS row** and **Bridges**).**R6 — Keep thresholds and states *out of the name*.**Do not encode numeric limits, separation‑of‑duties, or readiness states in the label. Put thresholds on **Method steps** (capability/acceptance), states in **Role State Graphs**, and SoD via **incompatibility** relations. Names carry *what this is* and *which Context claims it*—not *when and how it may act*.**R7 — Cross‑context only by *Bridge* with loss notes.**When another Context needs to reference a name, use an **Alignment Bridge** that states the relation (equivalent, narrower, broader, analogous) and its **Congruence Level** with explicit **loss/fit** annotations. Never equate two names by label alone.**R8 — Make renames and merges *first‑class events*.**When a label changes, or two labels consolidate or split, record it on the Name Card as a lineage action (rename, merge, split, retire) with rationale and dates. Past uses *remain valid as historical facts*; continuity comes from lineage, not silent edits.#### The Six P‑practices (normative process)**P1 — Candidate set (*NQD-front* of seed-words).**Do **not** pick a label “in one shot”. Build a **small, non-dominated candidate set** (an *NQD-front*, typically 5–10 items) by seeding and varying along:**Traditions** — mathematics, physics, engineering, computer science, systems thinking, management, etc. with their typical contexts and situations; use maximum diversity here; **Novelty/Familiarity** — from careful **reuse** of established terms to sharper **neologisms** from recent SoTA traditions; **Lexical form** — distinct **head terms** and morpheme families, readability/pronounceability, inflection/declension, transparency.Use the **Novelty–Quality–Diversity** discipline from **Part G** to maintain only **non-dominated** candidates; when appropriate, you may implement this via **Γ_nqd.generate**. Record the **seeds** and the short rationale in the Card’s notes. Choose final **Unified Tech**/**Plain** labels **from this frontier**; if a high-quality candidate is discarded, briefly note why.For the purposes of **Diversity_P**, group candidates into **head-term families** (same base noun/verb + minor prepositions or case endings). Variants such as *“Reference plane”*, *“Plane of reference”* and *“Referred plane”* **count as one family**, not three distinct candidates. An NQD-front with multiple near-clones from one family **does not** satisfy the diversity requirement. Aim for **≥ 3 distinct head-term families** in the CandidateSet; if the front ends up with fewer families (e.g. due to a very narrow domain or high AliasRisk on other heads), the Name Card **MUST** record a brief rationale in the NQD-front notes.**Lexical Q-components for the NQD-front**When P1 uses **NQD-CAL ([C.18](/generated/patterns/C.18))**, treat the **Quality vector** over candidates as part of the same archive as [C.18](/generated/patterns/C.18)’s **NQD-frontier**. Recommended components (all **ordinal; no arithmetic means**): * **SemanticFidelity (P — Ontological precision).** *Question.* Does the label verify against the **Minimal Definitional Statement (MDS)** and Concept‑Set row without adding or losing core invariants? *Scale (ordinal; ↑ better).* `{Misleading, Vague, Precise, Exact}` with `Exact ≻ Precise ≻ Vague ≻ Misleading`. *Link to P2.* When **P2** is run, derive the SemanticFidelity rating from the per‑sense‑seed judgements: candidates with any **core** sense‑seeds classified as `wrong‑prototype` **MUST** be rated **Misleading**; candidates rated **SemanticFidelity ≥ Precise** **SHOULD** have at least a configurable fraction `θ_P` (default `θ_P = 0.7`) of sense‑seeds in `on‑target` and **NONE** in `wrong‑prototype`. Discard candidates that remain **Misleading** after revision.* **CognitiveErgonomics (S — Sociolinguistic admissibility).** *Question.* Can the target **RoleEnactors** (engineers, managers) read, pronounce, and recall the label without specialist training? *Scale (ordinal; ↑ better).* `{Alienating, Jargon, Acceptable, Natural}` with `Natural ≻ Acceptable ≻ Jargon ≻ Alienating`. Prefer labels **≥ Acceptable** in the stewardship Context.* **MorphologicalActionFit (O — Morphological/action alignment).** *Question.* Does the morphology of the label hint at its role in **methods/morphisms** (object vs process vs result) and preserve the required derivational family (noun/verb/participial forms)? *Scale (ordinal; ↑ better).* `{Opaque, Role‑hinting, Action‑aligned}`. Action‑aligned labels make it obvious whether we are naming an **actor**, an **activity**, or a **publication result** (e.g., *ReviewerRole* vs *Reviewing* vs *ReviewRecord*). *Kind-sensitive cues.* When the **Kind** on the Card is a **Role**, prefer agentive/holder morphology (*…Role*, *…er*, *…or* or local equivalents); when the Kind is **Method or MethodDescription**, prefer verbal or gerundive forms; when the Kind is **Holon**, prefer result nouns, when **Work**, prefer verb. Misaligned morphology (e.g., a Role named with a pure process noun) should be treated as a **penalty on MorphologicalActionFit** and, if retained for legacy or regulatory reasons, called out explicitly in **Card notes**. See [F.5](/generated/patterns/F.5)/[F.11](/generated/patterns/F.11)/[F.12](/generated/patterns/F.12) and **LEX-BUNDLE §8**.* **AliasRisk (A — Lexical overload).** *Question.* How likely is a careful reader to import a **wrong sense** from neighbouring FPF records and publications or external canons when they see this string? *Scale (ordinal; ↓ better).* `{Safe, Context‑dependent, High‑Risk, Overloaded}` with `Safe ≻ Context‑dependent ≻ High‑Risk ≻ Overloaded`. Avoid adopting **Overloaded** labels unless required by legacy and called out explicitly in notes. When [C.18](/generated/patterns/C.18)’s **DomainDiversitySignature** is available, AliasRisk MAY be refined into a CHR‑typed characteristic with the same polarity.Use these components for **Pareto comparison only** (per **[C.16](/generated/patterns/C.16)** ordinal discipline). Do **not** collapse them into a single scalar score; the NQD-front is computed over the **vector of lexical Q-components** together with **Novelty** and **Diversity_P**.**P2 — Semantic read‑through against archetypal situations.**Alongside the NQD‑front of label candidates, maintain a **small set of 5–10 archetypal situations** (“**sense‑seeds**”) that instantiate the intended use (purpose) across different traditions. For **each** candidate label and each sense‑seed, perform a **read‑through test**:– write **1–2 short example sentences per sense‑seed** (e.g., “In case X, we perform \<Label\>”);– classify the outcome, for a careful reader in the stewardship Context, as one of `{too-narrow, on-target, too-wide, wrong-prototype}`.Maintain, on the Name Card, a small tally per candidate of how many sense-seeds fall into each class. Use these tallies both to **prune candidates** and to instantiate **SemanticFidelity** (P-component): labels with a sustained pattern of `wrong-prototype` hits on core sense-seeds **SHALL** be removed from the NQD-front (or kept only as deprecated aliases with an explicit warning). Candidates rated **SemanticFidelity ≥ Precise** **SHOULD** satisfy the `θ_P` constraint from the SemanticFidelity definition (fraction of `on-target` seeds) and have no `wrong-prototype` counts.Record **rejected candidates** and their **mismatch patterns** in the Name Card’s **NQD‑front notes**.**P3 — Mint‑or‑Reuse gate ([F.8](/generated/patterns/F.8)).**Before minting, search your Context’s **Concept‑Set table**. If a row already covers your sense, reuse it and only add a **local label**. If not, propose a **new row** and capture the decision in a brief rationale.**P4 — Concept‑Set linkage ([F.7](/generated/patterns/F.7)).**Every Name Card **must** indicate its Concept‑Set row (or record “not applicable” for intentionally Context‑unique names). This is the handle for alignment and anti‑explosion control.**P5 — UTS registration ([F.17](/generated/patterns/F.17)).**Publish each Name Card to the **Unified Term Sheet** with Context, kind, twin labels, sense reference, edition, and lineage status. Keep the UTS the single, human-readable table of record.**P6 — Lexical-continuity hygiene ([F.13](/generated/patterns/F.13)).**Apply the same discipline to renames, splits, merges, and retirements; leave forward and backward pointers so readers can trace lexical continuity at a glance.#### Guarded-head note for locally risky labelsSome locally useful heads remain risky because they already carry different load-bearing readings in different admissible local texts. In such cases, authors may publish a **guarded-head note** as a thin naming-governance companion.A guarded-head note does **not** create a new governing term, does **not** establish Cross-context sameness by itself, and does **not** replace the meaning fixed in the cited authority text, governing FPF pattern, or accepted `DRR`. It simply records that one publication-facing head should stay deconflicted while local-first naming continues to govern minting, reuse, aliases, and Bridges.This is especially useful when one head already appears in more than one admissible local reading, such as `projection` in `A.16` move language and in `F.9.1` bridge stance language. The note should therefore name the consumer sites, keep each local reading explicit, and resist any temptation to flatten them into one global head.#### Durable-head settlement for entry/discoverability vocabularyWhen naming work touches the discoverability amendment, `PCP-TERM` plus `F.18`and `A.6.P` must settle the durable heads used here, including`pattern-entry discoverability`, `description recognition signature`,`entry orientation`, `entry lexeme retrieval aid`, `expanded entry-disambiguation case`,`Problem-frame recognition signature`, and `thin-echo discipline`, as part ofthe amendment itself.The amendment should therefore assign each effect to one named FPF pattern,pattern section, field, relation, or section of a named non-pattern FPF publicationform with an entry or retrieval-aid function. When such a non-pattern publication form is used,its publication form, companion function, and reference must be named by value,and the referenced section must carry that effect. Do not let the single triggerword `discoverability` become one semantic swamp.The canonical settlement table for this amendment is:| Term | Canonical job | Receiving FPF pattern, pattern section, field, relation, or selected non-pattern FPF kind-reference pair | Plain-only or deprecated neighbors || --- | --- | --- | --- || `pattern-entry discoverability` | composite entry quality over one entry-recognition stack | [`E.11`](/generated/patterns/E.11) | broad `discoverability` alone || `description recognition signature` | first-contact cue structure of one description-bearing unit | [`A.6.RSIG`](/generated/patterns/A.6.RSIG) | `discoverability of descriptions` || `recognition text` | existing first reading text inside one pattern | [`E.8`](/generated/patterns/E.8) | invented `discoverability surface` || `FirstEntryPatternComparisonSet` | case-relative [`E.11`](/generated/patterns/E.11) entry-distribution grouping of plausible candidate patterns, tempting wrong patterns, entry-load reclassifications, and admissible entry stops | [`E.11`](/generated/patterns/E.11); use [`I.2`](/generated/patterns/I.2) for expanded entry-disambiguation cases when compact cues are insufficient | `route`, `semanticArea` as navigation label, `ontologicalNeighborhood` as navigation label || `entry lexeme retrieval aid` | lexical and query retrieval aid without alias minting | [`F.17`](/generated/patterns/F.17), [`F.18`](/generated/patterns/F.18), and [`E.10`](/generated/patterns/E.10), coordinated by [`E.11`](/generated/patterns/E.11) | `lexical discoverability`, bare search-help wording || `ExpandedEntryDisambiguationCase` | bounded case that expands compact first-entry comparison when wrong-pattern risk, repeated failure, retrieval-facing use, or compact guidance insufficiency is live | [`I.2`](/generated/patterns/I.2) | `workflow`, `scenario script`, `route`, untyped interpretation label || `thin echo` | low-detail projection pointer to the cited pattern, cited pattern section, field, relation, or section of a named non-pattern FPF publication form; the pointer makes the publication form, companion function, and reference recoverable, and the referenced section carries the claim | [`E.11`](/generated/patterns/E.11) | duplicated guidance, parallel blurbs |One canonical term per job is the settled target of this amendment.Rejected or superseded wording is not live Plain or Tech vocabulary; the row uses the selected name.#### EntityOfConcern family naming settlementWhen naming work touches the [C.2.1](/generated/patterns/C.2.1) EntityOfConcern family, use these rows as the local-first settlement. They are Name Card settlements for field and head names; they do not create a new `U.*` kind, relation kind, evidence kind, publication kind, or universal entity ontology.`EntityOfConcern` is the selected Tech head for the Russian idea "интересуемая сущность" in the episteme slot/ref and same-EntityOfConcern alignment family. It means the entity, relation, claim record, or kind named by value/reference pair selected for the declared use by role-method-interest selection, construction/reference trace, episteme trace when a Description episteme or Description episteme admitted for specification use is live, publication-unit trace when a bounded unit is live, bridge or retargeting trace when sameness crosses context, and witness trace when work, action, or reliance is live. If that trace is missing, the result is a candidate set, blocked use, or non-use, not a stronger claim under a nicer name.| Name or source wording | [F.18](/generated/patterns/F.18) settlement | Must not mean || --- | --- | --- || `EntityOfConcern` | Preferred Tech head for the EntityOfConcern, relation, claim record, or kind named by value/reference pair that a claim-bearing episteme, pattern body, or bounded publication unit treats as primary for the declared use. | A universal `object`, a topic by interest alone, the publication unit itself, or a new kernel kind. || `EntityOfConcernSlot` | Entity-valued [C.2.1](/generated/patterns/C.2.1) slot. Relation, claim-record, and kind named by value/reference cases enter only through the declared relation/claim/reference discriminator and the governing pattern. | A relation-valued bucket, a generic claim-use bucket, or a way to avoid the relation named by value, evidence, gate, work, decision, assurance, or architecture pattern. || `entityOfConcernRef`, `EntityOfConcernRef` | Reference handle for the EntityOfConcern under the slot/ref discipline of [C.2.1](/generated/patterns/C.2.1). Same-EntityOfConcern cases preserve this reference; retargeting changes it only through [A.6.4](/generated/patterns/A.6.4) and its invariant/loss boundary. | A free publication-unit field, title, topic, carrier reference, authoring-work reference, or review-object reference. || `EntityOfConcernClass` | Constraint on admissible EntityOfConcern values only where an episteme slot or same-EntityOfConcern law is live. | A topic taxonomy, audience category, object-quality class, or default pattern-family partition. || `publicationUnitPrimaryEntityOfConcern` | Technical head for the primary entity of concern, non-claim-bearing kind named by value, topic, or subject that one bounded `PublicationUnit` is mainly about while carrying one move and one outside-work boundary. When a claim-bearing episteme or episteme-lane `U.View` is live, recover it through `EntityOfConcernRef`. | A [C.2.1](/generated/patterns/C.2.1) slot by itself, a second EntityOfConcern ontology, a carrier identity, a title, or project-side authority by readable form. || `EntityOfInterest`, `EoIClass`, `DescribedEntity*`, `describedEntityRef`, `primary described entity` | Use `EntityOfConcern`, `EntityOfConcernRef`, `EntityOfConcernClass`, `publicationUnitPrimaryEntityOfConcern`, or the local FPF kind named by value. | Live technical vocabulary, second [C.2.1](/generated/patterns/C.2.1) slot family, alias permission, or permission to keep old semantics beside the selected family. || `EntityOfConcernAlignmentCase` | Local table head for the same-by-value, retarget, bridge, relation-record, distinct-entity, and blocked-use split. | A new kernel kind or a substitute for [A.6.4](/generated/patterns/A.6.4), [F.9](/generated/patterns/F.9)/[F.17](/generated/patterns/F.17)/[F.18](/generated/patterns/F.18), [A.6.P](/generated/patterns/A.6.P), or the pattern governing the relation kind. |#### Card purpose & mode guard (normative)To prevent “post-hoc justification” of intuitively chosen labels, every **Name Card** SHALL declare its**CardMode ∈ {MintNew, DocumentLegacy}**:* **MintNew.** The Card is the **output of an NQD-style lexical search** over a **candidate label set** generated inside the stewardship Context(s), using the lexical Q-tuple `{SemanticFidelity, CognitiveErgonomics, MorphologicalActionFit, AliasRisk}` together with **Novelty (N)** and **Diversity_P** (per [A.0](/generated/patterns/A.0) / [C.17](/generated/patterns/C.17)–[C.18](/generated/patterns/C.18) / [B.5.2.1](/generated/patterns/B.5.2.1)). – The Card SHALL record: – a minimal **CandidateSet** (the labels actually evaluated), with **head-term family** tags for each candidate; – the resulting **NQD-front** of **non-dominated candidates** over ⟨Q-tuple, N, Diversity_P⟩; – the **sense-seeds** used for P2 read-through and their mismatch patterns; – a short **selection note** explaining why the chosen Tech/Plain pair was picked from that front (e.g., “better CognitiveErgonomics at equal SemanticFidelity”). – A single-element NQD-front is permitted only if the Card records a brief rationale why **no alternative candidate survived** the lexical and NQD filters (e.g., legacy constraints, high AliasRisk on all other options). – A MintNew card is **non-conformant** if authors fill only the top fields after choosing a label by intuition. Recording the chosen label, Kind, and a short rationale is **not** a substitute for the seed set, NQD-front, sense-seed read-through, and explicit non-dominated selection.* **DocumentLegacy.** The Card documents an **externally imposed legacy label** (e.g., a regulatory or de facto Standard) and its mapping to FPF structures. In this mode the Card MAY omit a full NQD-front, but SHALL: – state the **legacy source and provenance**; – either (i) provide at least a **sketched NQD-comparison** of viable internal variants against the legacy label, or (ii) record a short **out-of-scope rationale** (e.g., “name frozen by law; see cited Standard”) explaining why NQD search is not being used for selection.For all **Core-facing naming of U.Types and other canonical FPF concepts**, **MintNew** is the **default** CardMode; usingDocumentLegacy for such names requires an explicit justification on the Card.For one-off local phrase repair, no Name Card mode is live. Use `E.10`, `C.2.P`, or `E.17.AUD.LHR`, and record the repaired phrase only where the local repair pattern requires it. Open a Name Card only when the repair mints or changes one durable reusable name, UTS row, Core-facing term, or cross-context naming relation.A **Name Card** is the authoritative, human‑readable record of a name inside its Context. It has these fields; teams may add local notes.1. **Row ID** — the stable, opaque **UTS row identifier** (the row identity handle).2. **Twin labels** — **Unified Tech** and **Plain** (per [E.10](/generated/patterns/E.10)).3. **Context of meaning** — the Bounded Context and, if relevant, its edition.4. **Kind** — what sort of thing this is (System, Episteme, Role, Service, Method, Work, Objective, Requirement, Decision, Characteristic, etc.). This is an **ontological category**, not a spelling prefix.5. **Purpose / use‑domain** — the intended area(s) of use (which families of contexts are expected to use it).6. **Minimal Definitional Statement (MDS)** — one-paragraph intended sense in the stewardship context (no tool/process slang).7. **Didactic subtitle** — ≤ 12 words that signal pragmatic use.8. **Sense reference** — a Local‑Sense reference (how [F.2](/generated/patterns/F.2)–[F.3](/generated/patterns/F.3) clustered it).9. **Concept‑Set linkage** — Concept‑Set reference or “not applicable” (with rationale).10. **Alignment note** — if a Bridge exists to other Contexts, cite it and record **loss/fit** in plain words (no formulas required on the Card).11. **Relation kind** — if the name is for a relation, declare **structural** vs **epistemic** and `validationMode ∈ {axiomatic, inferential, postulate}`. For **structural** relations, provide **Constructive** grounding (`tv:groundedBy → Γₘ.sum|set|slice`). If the name is not for a relation with arity ≥ 2, set this field to “n/a”.12. **Manager’s clip** — one‑line “use/avoid” guidance for everyday communication.13. **Archetypal situations (sense‑seeds)** — **5-10 short “X‑case” lines** used by **P2** for the semantic read‑through; keep them **edition‑aware** and **context‑local**. For **MintNew** cards these are required evidence, not optional examples.14. **NQD‑front notes** — brief rationale for discarded candidates (**include mismatch patterns from P2, the head-term family mix, and any lexical Q‑scores used in P1**).15. **SemanticFidelity/CognitiveErgonomics/MorphologicalActionFit/AliasRisk** scores for the NQD-front labels, recorded at least ordinally for the surviving candidates.16. **Version** — current status and history of editions.17. **Card notes** — optional free text with comments about the name (e.g., recommended translations, etymology, pronunciation).**Manager’s reading habit.** When two names collide in a meeting, ask for their **Context**, **Kind**, **Purpose/use-domain**, and **Sense reference**. If any of those differ, you are comparing different things; switch to **Bridge** talk, not label talk.### What belongs in the label—and what does not**Belongs (keeps the label clean and durable):*** The **core head word** that names the thing *(the **Kind** is recorded on the Card; the string need not encode it)* (e.g., “Pump”, “Standard”, “Requirement”, “Surgeon”, “Cooling”).* A **purpose qualifier** if it is essential to the local sense and stable across editions (e.g., “Cooling” vs “Fuel”).* A **scope qualifier** only if it is part of the *meaning* rather than the current plan (“Surgical Ward” rather than dates or batch numbers).**Does not belong (move elsewhere):*** **Numbers and thresholds** (put on steps, capabilities, acceptance clauses).* **States** (use Role State Graphs and checklists).* **Temporal windows** (work plans and history).* **Organisational authorisations** (speech acts and assignments).* **Imported acronyms** from other Contexts (use Bridges with loss notes instead).**Quick litmus for authors.** If removing a number, date, or state *does not* change the *meaning* of the thing, it should **not** be in the label.### Worked triad (three short, context‑local examples)*(Names below are illustrative; the same words in other Contexts may mean something else. The point is how the Name Card keeps them clear.)*#### Industrial operations Context: “Thermal Management - 2026”* **Kind:** Service* **Purpose / use‑domain:** industrial thermal utilities; line‑level planning and operations* **Unified Tech label:** Cooling Supply* **Plain label:** Chilled water for line B* **Sense reference:** supply of water at defined temperature/flow to boundary B* **Concept‑Set:** “Utility service” row; local variant recorded* **Alignment note:** Bridge to “Plant Utilities - 2026” notes that “Cooling Supply” there bundles filtration; *loss:* filtration is not guaranteed in this Context* **Version:** 20 Feb 2024* **NQD‑front (seed candidates):** *Cooling Supply*, *Chilled Water Service*, *Process Cooling*, *Cooling Utility*. **Chosen:** *Cooling Supply* (neutral, morphology‑stable).**Why it’s good.** The label doesn’t encode temperature or flow limits (those live in acceptance). It names a Service; nobody will confuse it with a pump System or a Method.#### Clinical Context: “Hospital OR - 2026”* **Kind:** Role* **Purpose / use‑domain:** OR governance and staffing; credentialing and checklists* **Unified Tech label:** Surgeon Role* **Plain label:** Operating surgeon* **Sense reference:** person who is authorised to perform surgical steps under defined checks* **Concept‑Set:** “Clinical roles” row* **Alignment note:** Bridge to “Training & Credentialing - 2026” shows partial overlap; *loss:* that Context’s “Senior Surgeon” carries teaching duties that do not apply here* **Version:** Feb 2025; renamed‑from “Lead Surgeon” (2025) with rationale: avoided “lead” vs “operating” ambiguity* **NQD‑front (seed candidates):** *Surgeon Role*, *Operating Surgeon*, *Primary Surgeon*, *Operating Physician*. **Chosen:** *Surgeon Role* (Kind‑neutral string; Plain clarifies).*Lexical Q snapshot (PSOA‑style, informative).*| Candidate | SF | CE | OA | A‑Risk | Comment || --- | --- | --- | --- | --- | --- || Surgeon Role | Precise | Acceptable | Role‑hinting | Safe | Neutral head noun; morphology matches **Role** Kind; works across departments. || Operating Surgeon | Precise | Natural | Role‑hinting | Context‑dependent | Reads well, but “operating” competes with “operating theatre/room”; kept as Plain label only. || Primary Surgeon | Vague | Natural | Role‑hinting | Context‑dependent | “Primary” ambiguous (training vs shift); rejected for governance vocabulary. || Operating Physician | Vague | Jargon | Role‑hinting | High‑Risk | Collides with non‑surgical physician roles; rejected despite familiarity in some hospitals. |**Why it’s good.** No fatigue thresholds or readiness states in the name; those live in the Role’s state graph and checklists.#### Public service Context: “Civic Services - 2026”* **Kind:** Requirement* **Purpose / use‑domain:** service performance management; public service SLAs* **Unified Tech label:** Passport Lead‑Time* **Plain label:** Time to issue a passport* **Sense reference:** elapsed time from complete application to issuance* **Concept‑Set:** “Service quality requirements” row* **Alignment note:** Bridge to “Legal Framework - 2026” records that legal “deadline” has different remedies; *loss:* legal exemptions not carried into this Context* **Version:** current* **NQD‑front (seed candidates):** *Passport Lead‑Time*, *Issuance Time*, *Service Turnaround*, *Time to Issue Passport*. **Chosen:** *Passport Lead‑Time* (neutral; Plain remains didactic).**Why it’s good.** Target values (e.g., ≤ 20 days) are not in the label; they live in acceptance clauses.### Conformance Checklist (editor aid) — Part I: naming & cards (non‑normative)**CCE‑F18.1 (Context pairing).**Every name used in normative text **must** be paired with its **Context of meaning**. If you cannot name the Context, you do not have a valid name.**CCE‑F18.2 (Kind clarity).**Every Name Card **must** state the **kind** (System, Episteme, Role, Service, Method, Work, Objective, Requirement, Decision, Characteristic, …). Using labels that hide kind is non‑conformant.**CCE‑F18.2a (Purpose declared).**Every Name Card **must** state the **Purpose / use‑domain** (families of contexts where the concept is expected to be used). Omitting Purpose is non‑conformant.**CCE-F18.3 (Sense reference).**A minted name **must** resolve to a **Local‑Sense** in its Context. If a sense cannot be stated, label minting is deferred.**CCE‑F18.4 (Twin registers).**Each Name Card carries a **Unified Tech** and a **Plain** label ([E.10](/generated/patterns/E.10)). Tech appears in **Core** prose; Plain in teaching/examples.**CCE‑F18.5 (No thresholds/states in labels).**Numeric limits, readiness states, and separation‑of‑duties **must not** appear in labels. Put them on steps, checklists, and role algebra.**CCE‑F18.6 (Bridge‑only travel).**Cross‑context reuse of a name **must** go through an **Alignment Bridge** with an explicit relation and **loss/fit** notes. Label matching alone is forbidden.**CCE‑F18.7 (Lexical-continuity visibility).**Renames, splits, merges, and retirements **must** be recorded on the Name Card with dates, rationale, and forward and backward lexical-continuity pointers. Past occurrences remain valid as historical facts.**CCE‑F18.8 (Mint‑or‑Reuse gate).**Before minting, authors **must** check the Context’s Concept‑Set table; if a row exists, **reuse** it with a local label unless a documented reason compels a new row.**CCE‑F18.9 (UTS entry).**Names used in normative FPF publications **must** appear on the **Unified Term Sheet** with the specified **Name‑Card fields**; include Notes when present).**CCE‑F18.10 (No cross‑kind labels).**Do not reuse the same **Unified Tech label** for different kinds inside one context (e.g., “Cooling” as a Service and as a Method). If unavoidable, add a stable qualifier to disambiguate and record the decision on both Name Cards.**CCE‑F18.11 (Manager’s clip).**Each Name Card **should** carry a one‑line “use/avoid” note to guide everyday speech. Where omitted, editors add it during review.**CCE‑F18.12 (Anti‑explosion check).**If three or more near‑synonyms for the same Local‑Sense appear in drafts, authors **must** either consolidate to one label or record an intentional synonym pair with use/avoid notes and a plan to converge.### Normative Standard (what must be true)> This section is binding. It specifies the publication Standard for unification-oriented names in the Unification Suite (Part F), with **local-first authority**, **bounded context clarity**, and **one-way unification** through declared dependency strata. It complements, and does not replace, the structural and epistemic Standards elsewhere in FPF.**9.1 Local authority & stewardship context.**Every unification name has a **single stewardship Bounded Context**: exactly one *Bounded Context* that authors and stewards it. That stewardship Context is responsible for the definition, examples, and lineage of the name. Cross-context reuse happens by **bridges**, not by relocating the stewardship Context.**9.2 Minimum definitional payload.**A published name MUST ship with a human-readable **Minimal Definitional Statement (MDS)** that states the intended sense in the stewardship context, and a **Didactic Subtitle** (≤ 12 words) that signals its pragmatic use. The MDS must be free of process slang and implementation jargon.**9.3 Row ID plus labels.**For each adopted name, the stewardship Context supplies:* a **Row ID** (the opaque UTS identifier — the **row identity handle**), and* two **labels**: a **Unified Tech** label (for Core prose) and a **Plain** label (for teaching). Both labels refer to the same underlying sense; **Plain** may simplify terms, not premises.**9.4 One-way dependency strata.**Each dependency stratum depends only on already-admitted lower strata: a name in stratum *n* can rely on names admitted in strata ≤ *n*, never sideways or upwards. Cycles are prohibited. If a dependency is not yet admitted at the required stratum, the new name remains Draft or Pilot.**9.5 Local‑first before reuse.**Teams MUST first **identify and stabilize the local sense** (within their Bounded Context). **Within the stewardship Context**, reuse existing **Concept-Set rows** where they fit (§4.2 **P1**). **Across contexts**, reuse occurs via **Alignment Bridges** that map the local sense to an existing sense elsewhere without collapsing the local stewardship Context.**9.6 Sense, not string.**Publication concerns **sense** (intended meaning in context), not the literal string. Synonyms are allowed as **Plain** labels or **aliases** only if they point to the same **Row ID** and pass the conformance checks in §15 (“CC‑F18”). Strings must not be treated as identity.**9.7 Relation-kind discipline (structural vs epistemic).**If the public name expresses a **structural relation**, its intended sense **MUST** be backed by *exactly one Constructive trace* in the structural calculus (Compose-CAL) and **SHALL** declare `validationMode=axiomatic` (see [E.14](/generated/patterns/E.14)). If the name expresses an **epistemic relation**, Constructive backing is optional; **declare** `validationMode ∈ {inferential, postulate}` and use **Logical/Mapping** and/or **Empirical Validation** as appropriate. **Do not mix relation kinds** inside a single name. *(Do not use “Tier-1/2”; formality is expressed via F per [C.2.3](/generated/patterns/C.2.3).)***9.8 Member vs Component.**Names that describe collection membership MUST NOT be used to imply part‑whole structure, and vice versa. If both aspects are needed, publish two names with their own MDS and an explicit bridge.**9.9 Name-lineage states.**A name travels through **Idea → Draft → Pilot → Ratified → Deprecated**. Transitions require explicit human review gates. Ratified names carry a clear stewardship contact and date.**9.10 Anti‑duplication duty.**Before ratification, the stewardship Context MUST perform a **near-neighbor review**: identify adjacent names, record the decision to align, merge, or keep separate, and publish the rationale in the name’s record.**9.11 Local clarity over global neatness.**When in doubt, prefer **local intelligibility** for practitioners over global symmetry. Global neatness can be achieved later via bridges; loss of local sense is hard to repair.**9.12 No imported tool terms in Core names.**Names and their MDS must not carry terms whose only meaning is tied to operating tools or pipelines. If such terms are unavoidable in pedagogy, confine them to Working-Names and examples with disclaimers.**9.13 Human‑only conformance.**Conformance for this protocol is judged by trained human reviewers using the author and reviewer checklists in §14 and the conformance criteria in §15 (“CC‑F18”). Automated heuristics, if any exist in an organization, have no standing in the Core.### Rationale (why this exists and why these rules)**10.1 Local‑first unlocks velocity without lexical debt.**Centralized naming regimes seem tidy but slow learning and create brittle compromises. Local‑first minting lets teams speak clearly **now**; unification comes from disciplined bridges and one‑way dependencies, not from premature centralization.**10.2 One stewardship context lowers ambiguity.**Names with several competing stewardship contexts drift. A **single stewardship Context** concentrates accountability for sense, examples, and lineage, while still enabling broad reuse via alignment bridges.**10.3 Unified Tech + Plain serve two audiences.**Engineers need **precise** wording; managers and stakeholders need **approachable** wording. Splitting the labels keeps the same sense while protecting accuracy and pedagogy; both are keyed by the **Row ID**.**10.4 One-way dependency strata prevent conceptual knots.**Acyclic dependencies cut off circular definitions and policy deadlocks. Dependency strata provide a simple mental model: build on what is already firm.**10.5 Relation-kind discipline prevents category errors.**Part-whole claims **(structural)** must rest on **Constructive** grounds (`tv:groundedBy → Γₘ.sum|set|slice`, `validationMode=axiomatic`). Experience-based or evaluative relations **(epistemic)** follow assurance rules (**Logical/Mapping**, and **Empirical Validation** when *postulate*), with an explicit `validationMode ∈ {inferential, postulate}`. Mixing relation kinds inside a single name confuses review and invites hidden assumptions.**10.6 Sense over string reduces false conflicts.**Disputes often orbit the string (“we hate that word”). By separating **sense** (what we mean) from **string** (how we say it), the protocol enables peaceful coexistence: keep the **Row ID** constant; use one **Plain** label and, where helpful, a budgeted **alias** per register.### Application Guidance (how to apply, step by step)**11.1 Prepare (30–60 min).*** Clarify **your Bounded Context** and audience.* Collect 2–3 typical user stories that require the name.* Scan near‑neighbors in adjacent contexts (see §14.2 Reviewer checklist).**11.2 Mint locally.*** Write the **MDS** in plain language, one paragraph.* Draft a **Didactic Subtitle** (≤ 12 words): “what this name buys you.”* Decide whether the intended **relation kind** is **structural** or **epistemic** (do not mix), and declare `validationMode`.**11.3 Choose labels.*** **Unified Tech label**: concise, morphology‑stable, neutral; avoid metaphor.* **Plain label**: approachable phrasing for non‑specialists.* **How to choose**: pick both **from a small NQD‑frontier** (see §4.2 P1 (candidate set), P2(read-through)): diversify by tradition, novelty/familiarity, and lexical form; record discarded contenders and rationale on the Card.**11.4 Place in the dependency stratum.*** Verify all dependencies are at the same dependency stratum or below.* If a dependency is still Draft/Pilot, keep this name at most Pilot.**11.5 Align, don’t erase.*** Where overlap exists with another context, propose an **alignment bridge**.* Keep your stewardship Context; record the mapping and any known divergence in reading.**11.5a Test the replacement candidate against umbrella drift.*** Before replacing an overloaded head, apply the `E.10:0.2` replacement-candidate anti-umbrella rule. Then run the candidate head through the same local-first naming test: primary `EntityOfConcern`, receiving FPF pattern, carried admissible move, kind named by value/ref or local field, relation or claim record when live, neighboring exclusions, and example fit.* Do not approve a candidate merely because it avoids the old bad word. The replacement is acceptable only when the FPF kind named by value or local field is defined by value and the current use names its boundaries.* If the candidate still hides several possible kinds, keep a candidate-set note and do not mint, rename, or land the term yet.**11.5b Keep interpretive-view labels subordinate to the base candidate set or family.*** When a naming pass talks about one palette, front, archive, shortlist, or candidate set, keep that base candidate set or family recoverable on the Name Card.* Use thinner interpretive-view wording when the pressure is local comparison across candidate labels, sense-seeds, rejected candidates, or guarded-head notes.* Use atlas wording only when the naming explanation truly depends on several declared views, spaces, mappings, or distortion qualifiers being visible together, for example one cited `OutcomeMapRef` plus a `BridgeDistortionNote`.* Those cited spaces or qualifiers stay naming-side reuse of already-declared substrate qualifiers; they do not let naming passages mint one new source-to-outcome relation or one new publication-use relation locally.* A guarded-head note remains naming governance: it can explain why one head word misleads across admissible readings, but it does not decide substrate stewardship or publication policy.**11.6 Publish and steward.*** Publish the name with MDS, subtitle, dependency stratum, stewardship contact, examples.* Schedule a **first refresh**: when should the stewardship Context examine usage and drift?**11.7 Deprecate gracefully.*** If the sense is superseded, publish **Deprecation Notes**: what to use instead, and why. Keep old Working-Names visible long enough to allow safe migration.**11.8 The “Friday test.”*** On a busy Friday, could a competent colleague apply the name correctly using only the MDS, subtitle, and two examples? If not, refine before ratification: it is too overloaded with meanings to be helpful.### Examples (worked mini‑cases for engineer‑managers)> These examples are deliberately simple. They show how local-first minting, one-way unification, and dependency-stratum discipline operate together.**12.1 “Module” vs “Component” (engineering structure).*** *Stewardship Context A (Platform)* mints **Component** with MDS: “A physically or logically integrated part whose removal would alter the integrity of the whole.” **Structural**.* *Stewardship Context B (App Team)* mints **Module** with MDS: “A deployable bundle of functionality maintained as a unit.” **Epistemic** (usage practice), not a structural claim.* **Unification:** An alignment bridge states: “In Platform, every Component may include one or more Modules; Modules are not Parts.” Dependencies are one-way: *Module* depends on *Component*; *Component* does not depend on *Module*. No synonymy asserted. Both names remain in their stewardship Contexts.**12.2 “Incident” vs “Event” (operational sense).*** *Stewardship Context C (Operations)* mints **Incident** with MDS: “An unplanned interruption or reduction in the quality of a service.” **Epistemic**.* *Stewardship Context D (Monitoring)* mints **Event** with MDS: “A recorded observation of a state change in a system.” **Epistemic**.* **Unification:** Bridge notes: “Some Events are Incidents when they degrade service; not all Events are Incidents.” **Plain** labels (and at most one alias per register) may vary (e.g., “Outage” as an alias for **Incident**), but the **Row IDs** stay distinct. No part‑whole claims are implied.**12.3 “Customer” vs “Account Holder” (business roles).*** *Stewardship Context E (Sales)* mints **Customer**: “A party that receives value from an offering in exchange for consideration.” **Epistemic**.* *Stewardship Context F (Finance)* mints **Account Holder**: “A party legally responsible for an account.” **Epistemic**.* **Unification:** Bridge states overlaps and divergence: “A Customer can be an Account Holder; an Account Holder may not be a Customer (e.g., trustee).” The stewardship Contexts retain stewardship; a shared Working-Name “Client” may be used in executive materials with a clear note: **Working-Name only; see Concept-IDs for decisions**.**12.4 “Batch” vs “Lot” (collection vs integration).*** *Stewardship Context G (Manufacturing)* mints **Batch**: “A collection of items produced under shared conditions.” **Epistemic membership**.* *Stewardship Context H (Quality)* mints **Lot**: “An integrated whole packaged and tracked as one item.” **Structural whole**.* **Unification:** Bridge notes: “A **Lot** may originate from a single **Batch** or a slice of a Batch; not every Batch yields a single Lot.” Relation mapping: **MemberOf** (Batch membership) vs **ComponentOf**/**Whole** (Lot integration). *Loss note:* membership evidence does **not** imply part‑whole structure; part‑whole structure does **not** imply shared production conditions.**12.5 “Palette label” vs “Atlas label” (NQD/OEE naming-side interpretation).*** A naming pass compares candidate labels over one active palette and shortlist. The card keeps the active palette recoverable and uses thinner interpretive-view wording, because the question is only which label best fits the current candidate spread.* Later, the same naming discussion must explain why one label misleads unless the reader can see the palette together with a derived archive, an `OutcomeMapRef`, and one `BridgeDistortionNote`. In that case atlas wording is allowed, but the card still names the base palette and records that the atlas is only optional interpretive help for the naming explanation.* In both cases, guarded-head notes stay on the naming side: they explain alias risk or mismatch patterns, not who stewards the substrate or which publication face is authoritative.### Anti‑Patterns & Failure Modes (what to avoid)**13.1 “Global name first.”**Trying to coin a single global string before local understanding is mature. **Fix:** mint locally, publish MDS, then align.**13.2 “Synonym storm.”**Collecting many strings without stabilizing the Concept-ID. **Fix:** one Concept-ID per sense; multiple Working-Names only if they truly help didactics.**13.3 “Process leakage into names.”**Burying workflow or tool steps inside the MDS. **Fix:** keep process in method descriptions; keep names about sense, not procedure.**13.4 “Member‑implies‑part.”**Letting collection names induce part‑whole claims. **Fix:** separate names, separate MDS; don’t smuggle structure into membership.**13.5 “Sideways dependency.”**Defining a name by appealing to another Draft at the same dependency stratum or higher. **Fix:** depend only downward or postpone ratification.**13.6 “Alias/Plain drift.”**Letting a Plain label or alias accumulate extra meanings absent in the underlying row. **Fix:** periodic label review; prune metaphors that start bending sense; respect the alias budget.**13.7 “Atlas label does substrate work.”**Letting atlas or interpretive-view language quietly replace the base candidate set or family or decide substrate stewardship or publication policy. **Fix:** keep the base palette, front, archive, or shortlist recoverable, use atlas wording only when several declared views or qualifiers are jointly load-bearing for the naming explanation, and move substrate questions and publication questions to the pattern sections that govern those objects.### Assurance & Conformance (human‑only checks)#### Author checklist (before requesting review).* [ ] I identified the **stewardship Bounded Context** and audience.* [ ] I wrote a clear **MDS** (≤ 1 paragraph) and a **Didactic Subtitle** (≤ 12 words).* [ ] I declared the **relation kind** (structural vs epistemic) and the **validationMode**; no mixing.* [ ] If **structural**, I can point to **exactly one Constructive trace** that backs the structural claim.* [ ] I surveyed near‑neighbors and recorded my decision to align, merge, or keep separate.* [ ] I produced both **Unified Tech** and **Plain** labels (per [E.10](/generated/patterns/E.10)), with the same sense and pointing to the same **Row ID**.* [ ] Dependencies point **only downward**; no sideways or upward pulls.* [ ] If I used interpretive-view or atlas wording, the Name Card still names the base palette, front, archive, shortlist, or candidate set and states why thinner interpretive wording did or did not suffice.* [ ] I scheduled a **refresh date** and listed 2–3 usage examples.#### Reviewer checklist (at the gate).*** [ ] One stewardship Context is declared; stewardship contact is clear.* [ ] The MDS is free from process jargon and implementation slang.* [ ] The declared **relation kind** is justified; **structural** claims are constructively grounded; **epistemic** claims declare `validationMode` and evidence basis.* [ ] Member vs Component is respected where relevant.* [ ] Alignment bridges are proposed where overlap exists, with explicit reading of convergence/divergence.* [ ] The dependency-stratum discipline holds: acyclic, downward-only dependencies.* [ ] The **Plain** label does not smuggle extra commitments; **Unified Tech** and **Plain** remain co‑referential and point to the same **Row ID**.* [ ] Interpretive-view or atlas wording, if present, leaves the base candidate set or family recoverable and does not smuggle substrate or publication decisions into a naming note.* [ ] Name-lineage state is accurate (Idea, Draft, Pilot, Ratified, or Deprecated) and dated.#### Lightweight outcomes.*** **Ratify** (meets all checks).* **Pilot** (publish with explicit questions and a refresh date).* **Revise** (return to author with targeted gaps).* **Merge** (replace with an alignment to an existing name).* **Deprecate** (publish successor guidance and sunset plan).### Conformance Criteria (normative “CC‑F18”)> These are **language‑level** obligations for authors and reviewers. They ensure every unified name is **local‑first**, **bridge‑aware**, and **teachable**.**CC‑F18‑1 (Context first).** Every unified name **SHALL** be grounded in **local senses** that were harvested and clustered **inside named Contexts** (“context of meaning”) prior to unification. No name may be minted from free‑floating glosses or Cross‑context intuition. Use [F.1](/generated/patterns/F.1)–[F.3](/generated/patterns/F.3) first.**CC‑F18‑2 (Bridge‑only sameness).** Claims of sameness across Contexts **SHALL** be expressed only via explicit **Bridges** with a stated congruence and loss note. Mere spelling similarity never licenses a unified name. Use [F.9](/generated/patterns/F.9).**CC‑F18‑3 (Twin‑register naming).** Each unified concept **SHALL** carry **two labels**—a **Unified Tech** label (used in Core prose) and a **Plain** label (used for teaching). Labels are chosen per the naming discipline of [F.5](/generated/patterns/F.5) and the register rules of **[E.10](/generated/patterns/E.10)**.**CC‑F18‑4 (Neutrality of the Tech label).** The **Unified Tech** label **SHALL NOT** be borrowed wholesale from any single source Context where that borrowing would re‑import that Context’s private distinctions. Prefer a **neutral** term; **Cross‑context reuse occurs only via the UTS row and explicit Bridges**. (See [F.5](/generated/patterns/F.5) “allowed/forbidden forms”.)**CC‑F18‑5 (One concept per row, one Tech label per row).** A unified concept **SHALL** be captured as **one Concept‑Set row** in the **UTS**. Exactly **one Unified Tech label** is normative for that row; additional deprecated strings are aliases in Annex (budgeted). Use [F.7](/generated/patterns/F.7) with [F.17](/generated/patterns/F.17).**CC‑F18‑6 (SenseCell citations).** For each unified name, the **SenseCells** (Context × Local‑Sense) that justify it **SHALL** be cited in the UTS row with **Context name + edition**. Omit edition only if the Context has a single stable edition. See [F.17](/generated/patterns/F.17) §6.**CC‑F18‑7 (Sheet‑level coverage).** Within a thread’s UTS, the **set of rows** carrying unified names **SHALL** collectively cite **≥ 3 distinct Contexts**, ensuring breadth of evidence. Coverage is a property of the **sheet**, not of every single row. See [F.17](/generated/patterns/F.17) §6 constraint.**CC‑F18‑8 (No global words).** In Core text, **“Context” always means `U.BoundedContext`**; **discipline columns** may be used in teaching layouts but **is not** a bearer of meaning. Do not write context‑free claims of sameness. See [E.10](/generated/patterns/E.10) and [F.17](/generated/patterns/F.17) §5.**CC‑F18‑9 (Didactic primacy).** A unified name **SHALL** be teachable on **one page**: its **UTS row** + a short narrative that a careful reader can replay ([F.16](/generated/patterns/F.16) template). If it cannot be taught concisely, the naming attempt is premature.**CC-F18-10 (No process-phase connotations).** Names **SHALL NOT** encode imagined “maturity stages” or time-ordering unless those are part of the concept meaning. Stages belong in **state-space** and dynamics narratives, not in names. (See A-series CHR patterns.)**CC‑F18‑11 (Strict distinction guard).** Names **SHALL** respect **[A.7](/generated/patterns/A.7) Strict Distinction**: do not collapse **Role ↔ Method ↔ Work** or **Status ↔ Description** into one word. Align with [F.11](/generated/patterns/F.11)/[F.12](/generated/patterns/F.12) where relevant.**CC‑F18‑12 (Change control via [F.13](/generated/patterns/F.13)).** Renames, splits, merges, and retirements **SHALL** follow [F.13](/generated/patterns/F.13)’s lexical continuity rules; the UTS remains the canonical public term sheet for these changes.**CC-F18-13 (Lexical Pareto discipline).** When a Name Card uses **NQD-CAL ([C.18](/generated/patterns/C.18))** to score label candidates, the **chosen Unified Tech label** **SHALL** lie on the **Pareto frontier** of the lexical Q-tuple `{SemanticFidelity, CognitiveErgonomics, MorphologicalActionFit, AliasRisk}` (per **[C.16](/generated/patterns/C.16)** ordinal discipline and P1’s NQD-front definition), unless an explicit exception is recorded. If authors deliberately select a dominated candidate (e.g., to honour legacy regulation or user muscle memory), the Name Card’s notes **MUST** state the reason for stepping off the frontier.**CC-F18-14 (NQD-front recorded, with honest diversity).**When a Name Card is in **MintNew** mode, the **candidate label set** and the resulting **NQD-front of non-dominated label candidates** over the lexical Q-tuple `{SemanticFidelity, CognitiveErgonomics, MorphologicalActionFit, AliasRisk}` **SHALL** be explicitly recorded on the Card (at least as a small table or list), together with the NQD evidence hooks (`DescriptorMapRef`, `DistanceDefRef`, and a brief `Diversity_P` / coverage summary).Each candidate **SHALL** carry a **head-term family** tag; morphological or prepositional variants built on the same head (e.g. “X plane”, “plane of X”, “planar X”) **MAY NOT** be counted as distinct for Diversity_P. The Card **SHALL** indicate how many distinct head-term families are represented on the NQD-front.An NQD-front with fewer than **three** head-term families is permitted **only** if the Card records why no lexically more diverse alternatives survived the SemanticFidelity / AliasRisk filters (e.g., very narrow domain, frozen legacy idiom).**CC-F18-15 (Selection from the front only).**The **Unified Tech** and **Plain** labels published on the UTS row for a unified concept **SHALL** be drawn from the currently recorded **NQD-front** on the Name Card. Publishing a Tech/Plain pair that is **not** on that front (or that is dominated with respect to the declared lexical Q-components plus NQD) is **non-conformant**, except in explicit **DocumentLegacy** mode as defined in §5.1.**CC-F18-16 (Mode declaration).**Every Name Card **SHALL** declare its `CardMode ∈ {MintNew, DocumentLegacy}`. For Core-facing naming of **U.Types** and other canonical FPF concepts, **MintNew** is the default; **DocumentLegacy** is permitted only when recording pre-existing external names and MUST (i) cite the legacy source, and (ii) either attach an NQD-front over viable FPF variants or record a short rationale why NQD search is out-of-scope. Ordinary local phrase repair has no Name Card mode unless it mints or changes one durable reusable name, UTS row, Core-facing term, or cross-context naming relation.**CC-F18-17 (Procedure is not optional in MintNew mode).**A **MintNew** Name Card is **non-conformant** if it records only the chosen label, Kind, and a short rationale while omitting the seed candidate set, the NQD-front, the sense-seed read-through, or the mismatch patterns that justify the final choice. A card filled in after an intuition-first label pick does **not** satisfy [F.18](/generated/patterns/F.18).**CC-F18-18 (Interpretive-view labels keep their base candidate set or family).**When a Name Card or worked naming note uses interpretive-view or atlas wording, it **SHALL** keep the base palette, front, archive, shortlist, or candidate set recoverable, **SHALL** use atlas wording only when several declared views, spaces, mappings, or qualifiers are jointly load-bearing for the naming explanation, and **SHALL NOT** let guarded-head notes stand in for substrate stewardship or publication policy decisions.### Anti‑patterns & safe rewrites (normative)> Each item names a **speaking error** and a **local‑first repair**. Use this as an author’s lint pass before proposing a unified name.| # | Anti‑pattern (do **not** say) | Why it fails | Safe rewrite (how to speak) || -- | ------------------------------------------------------- | --------------------------------------------------------------- | ------------------------------------------------------------------------------------------------------------------- || A1 | “These terms are the same **because they look alike**.” | Cross‑context **spelling** is not evidence of conceptual identity. | “We assert sameness **via a Bridge**; the loss note explains what survives across Contexts.” ([F.9](/generated/patterns/F.9)) || A2 | “Use the BPMN word as our Tech label.” | Imports BPMN’s local commitments into the unified term. | “Choose a **neutral** Unified Tech label; cite BPMN as a **SenseCell** in the row.” ([F.5](/generated/patterns/F.5), [F.17](/generated/patterns/F.17) §6) || A3 | “Merge *process* (recipe) with *process* (execution).” | Collapses **MethodDescription** with **Work**. | “Split the concepts: one row for **MethodDescription**, another for **Work**; align them in examples.” ([F.11](/generated/patterns/F.11)/[F.16](/generated/patterns/F.16)) || A4 | “Our name encodes the process phase.” | Process-phase phrasing sneaks in time. | “Name the **concept**; show **state-space** changes in examples, not in the label.” (A-series CHR rationale) || A5 | “Contextless glossary.” | Violates local‑first; readers re‑globalise. | “Publish a **UTS** per thread; each row lists **Contexts** (Contexts+editions).” ([F.17](/generated/patterns/F.17)) || A6 | “We’ll fix synonyms later.” | Synonym sprawl grows costs. | “Apply **[E.10](/generated/patterns/E.10)** rules now: one Tech, one Plain; retire extras via **[F.13](/generated/patterns/F.13)**.” || A7 | “One mega‑row for everything service‑like.” | Bundles distinct concepts; harms teachability. | “One **Concept‑Set per idea**; group with a **Block Plan** for pedagogy.” ([F.17](/generated/patterns/F.17) §7) |#### Canonical semantic unpacking for “contract” language (normative; used across FPF)In FPF, everyday “contract” talk is treated as shorthand for a bundle of distinct roles. When precision matters (architecture, audit, compliance), authors **SHALL** avoid mapping “contract” to a single concept and instead disambiguate at least:* **Service / promise clause (`U.PromiseContent`)** — the promised external effect + acceptance criteria (a spec/Standard), not a run (`U.Work`).* **Utterance (`U.SpeechAct`)** — the published statement (a Description) that declares or invokes the promise content.* **Commitment (`U.Commitment`)** — the deontic bond that binds an accountable `U.Agent` or `U.Role` to the promise content.* **Work & evidence (`U.Work` + carriers)** — the actual enactment and the traces/metrics used to adjudicate fulfilment.A “contract” bundle typically spans the whole [A.6.B](/generated/patterns/A.6.B) square; assign each piece explicitly to its [A.6.B](/generated/patterns/A.6.B) value:* `L-*`: definitions/invariants of the signature (“what it means”).* `A-*`: admissibility/entry predicates (“when it can be applied”).* `D-*`: duties/SLAs/penalties and who is accountable (“who is bound to what”).* `E-*`: evidence/observability claims (“how fulfilment/violation is adjudicated”).Example 2 (§F.18:18.2) shows one naming instantiation of this unpacking.### Migration notes (renames, splits, merges, retirements)**M1 — Start from Contexts, not from the old global word.** When inheriting legacy names, first **re‑harvest** terms inside the chosen Contexts ([F.2](/generated/patterns/F.2)–[F.3](/generated/patterns/F.3)). Only then decide whether to **reuse** or **mint** ([F.8](/generated/patterns/F.8)).**M2 — Preserve reader muscle memory without duplicating meaning.** Keep the **Plain** label close to familiar speech, but make the **Tech** label precise. If a legacy term is overloaded, publish it as a **deprecated alias** in Annexes, not as a second Tech label. ([F.13](/generated/patterns/F.13); Part H “Deprecated Aliases”.)**M3 — Prefer split‑then‑bridge over vague merges.** If one legacy word covers two distinct concepts, **split** into two rows and add a short **relation note** between them (e.g., “recipe vs run”). Do **not** hide the split under a wide new name. ([F.7](/generated/patterns/F.7); [F.16](/generated/patterns/F.16).)**M4 — Keep identifiers stable; move rows between blocks.** When the **Block Plan** evolves, move rows rather than renumbering; record the move in the row’s **Notes** field. ([F.17](/generated/patterns/F.17) §16.)**M5 — Upgrade rationale quality with worked examples.** Every rename or split should be accompanied by a **one‑page example** that shows the new row in action across at least **two Contexts**. ([F.16](/generated/patterns/F.16); “tell‑show‑show”.)### Worked examples (compact)> Each example shows **how the Protocol steers naming** so engineers and managers can communicate without hidden Cross‑context leaks.> **Card hygiene shown explicitly:** each example **states the Kind and the Purpose/use‑domain** and **chooses Tech/Plain labels from a small NQD‑frontier** (seed set diversified by traditions, novelty/familiarity, and lexical form; see Part G patterns).> **Head-term diversity:** each example **MUST** also state the **distinct head-term families** represented in its NQD candidate set (lexical “roots” such as *Recipe*, *Run*, *Episode*, not prepositional/morphological variants). This prevents faking Diversity_P with near-clones of one head.#### Example 1 — MethodDescription vs Work (recipe vs run)* **Context harvest:** *BPMN 2.0 (2011):* “Process model” (recipe) and “Activity instance” (run). *PROV‑O (2013):* `prov:Plan` vs `prov:Activity`. *ITIL:* “Work instruction” vs “Change implementation record.”* **Kind:** `U.MethodDescription` (design‑time record) **and** `U.Work` (run‑time occurrence).* **Purpose / use‑domain:** planning/scheduling vocabulary across BPMN, PROV‑O, ITIL; separates *design recipe* from *execution episode* for governance and telemetry.* **NQD‑front (seed candidates):** *design‑time:* *Procedure*, *ProcessModel*, *MethodSpec*, *WorkflowDefinition*, *Recipe*, *MethodScript* *run‑time:* *Run*, *Execution*, *Enactment*, *ActivityInstance*, *Job*, *Episode** **Head-term families used (DesignRunTag):** *design-time heads:* {Procedure, ProcessModel, MethodSpec, WorkflowDefinition, Recipe, MethodScript} *run-time heads:* {Run, Execution, Enactment, ActivityInstance, Job, Episode}* **Chosen from frontier (Unified Tech / Plain):** `U.MethodDescription` / “recipe”; `U.Work` / “run”. *Discarded highlights:* **Procedure** (collides with governance “procedure/policy”); **Execution** (overloaded in CS/security);* **Anti-pattern (for illustration only, non-conformant).** > *Bad CandidateSet (lexically narrow):* {“Reference plane”, “Plane of reference”, “Planar reference”, “Ref. plane v2”}. > All four are one **head-term family** (*plane*). Even if Diversity_P over raw strings looks high (four labels), **head-term diversity is 1**, so this set **fails** the [F.18](/generated/patterns/F.18) diversity intent. A conformant Card would either: (a) add labels with other heads (e.g., *Layer*, *Track*, *Band*), or (b) explicitly record why other heads are rejected (AliasRisk, domain idiom) and accept low lexical Diversity_P with a rationale.* **Enactment** (speech‑act nuance).* **Bridges:** recipe↔run **related**, not identical; loss note “control‑flow vs. execution.”* **Why it matters:** Managers can schedule **Work** while authors improve the **MethodDescription**—no category errors. The NQD‑front preserves tradition‑diverse, lexically stable options until a reasoned choice is made. ([F.11](/generated/patterns/F.11)/[F.16](/generated/patterns/F.16); [F.17](/generated/patterns/F.17) rows.)#### Example 2 — Service (promise) vs SpeechAct (utterance) vs Commitment (deontic)* **Context harvest:** *IT service canon:* “SLA/OLA clause”, “ticket approved”. *Speech‑act theory:* “performative utterance”. *Org governance:* “approval signature”.* **Kind:** `U.PromiseContent` (promise), `U.SpeechAct` (utterance), `U.Commitment` (deontic bond).* **Purpose / use‑domain:** ops/governance vocabulary connecting ITSM, organizational policy, and pragmatics; separates saying, binding, and promising.* **NQD‑front (seed candidates):** *promise:* *Service*, *Offering*, *Provision*, *CapabilityOffer* *utterance:* *SpeechAct*, *Performative*, *Utterance*, *Declaration* *deontic bond:* *Commitment*, *Obligation*, *Binding*, *Duty** **Chosen from frontier (Unified Tech / Plain):** `U.PromiseContent` / “service (promise)”; `U.SpeechAct` / “utterance”; `U.Commitment` / “commitment”. *Discarded highlights:* **Offering** (business‑model connotations); **Declaration** (too narrow for performatives); **Obligation** (legalese; narrower than commitment envelope).* **Ontology note (informative):** `U.SpeechAct` and `U.Commitment` are defined normatively in Part A ([A.2.9](/generated/patterns/A.2.9) and [A.2.8](/generated/patterns/A.2.8) respectively). This [F.18](/generated/patterns/F.18) card is a lexical/NQD reference, not the ontology definition site.* **Bridges:** utterance **institutes** commitment; commitment **binds** promise content; no synonymy claimed.* **Why it matters:** Status tracking becomes intelligible without pretending that a “service” acts; the NQD‑front yields neutral, cross‑tradition readable labels. ([F.12](/generated/patterns/F.12); [F.17](/generated/patterns/F.17) blocks D/R.)#### Example 3 — Characteristic names without process-phase bias* **Context harvest:** *Quality canon:* “maturity level”; *Performance canon:* “throughput”. **Kind:** `U.Characteristic` (measurement names).* **Purpose / use‑domain:** CHR‑compatible measurements for planning and performance; bridgeable across engineering and management.* **NQD‑front (seed candidates):** *readiness (ordinal):* *MaturityLevel*, *ReadinessLevel*, *PhaseReadiness*, *TRL*, *ReadinessScore* *throughput (ratio):* *Throughput*, *Rate*, *ProcessingRate*, *OpsPerSecond*, *FlowRate** **Chosen from frontier (Unified Tech / Plain):** `U.ReadinessLevel` / “readiness level” (ordinal); `U.Throughput` / “throughput” (ratio). *Discarded highlights:* **TRL** (tied to a specific scale/tradition); **Rate/OpsPerSecond** (over‑specific units baked in).* **Narrative:** Dynamics are shown as **movement in state-space**, not via process-phase-laden names such as “pre-production process”.* **Why it matters:** Prevents process phase/time from leaking into labels; the NQD-front ensures neutrality and recognizability. (A-series CHR rationale; [F.17](/generated/patterns/F.17) §4-§6.)### FAQ (authoring hygiene)**Q1. How many Contexts must a naming proposal cite?****A.** The **sheet** for a thread should cite **≥ 3** distinct Contexts overall; an individual row may cite fewer if the concept appears in fewer Contexts. The point is breadth at the **UTS** level, not token‑stuffing rows. ([F.17](/generated/patterns/F.17) §6 constraint.)**Q2. Can a Source Context’s term ever become the Tech label?****A.** Only if its form is **already neutral** and does **not** smuggle in that Context’s private commitments. When in doubt, pick a fresh neutral Tech label and keep the Source term in **SenseCells**. ([F.5](/generated/patterns/F.5).)**Q3. Where do we put discipline‑vantage views like “Operations” vs “Research”?****A.** Use the **discipline columns** in a teaching layout if helpful, but remember: **discipline columns are not Context columns** and carry no editions. ([F.17](/generated/patterns/F.17) §5.)**Q4. How do we keep names stable while the story evolves?****A.** Keep **row ids** stable; evolve placement via the **Block Plan** and record moves in **Notes**. Use [F.13](/generated/patterns/F.13) for renames/splits/merges. ([F.17](/generated/patterns/F.17) §16; [F.13](/generated/patterns/F.13).)**Q5. What if two teams insist on different Tech labels for the same concept?****A.** Publish **one** Tech label; treat the other as a **deprecated alias** (Annex). Bridge their local senses on the row. ([F.13](/generated/patterns/F.13); Part H.)### 90‑second teaching script (for engineer‑managers)> “**Local‑first** means we start in **context of meaning**—we harvest terms **inside** each Context and only then unify. A unified name is a **teachable promise**: one **Tech** label for precision, one **Plain** label for outreach. Its **row** in the **UTS** shows where the idea lives in real disciplines (the **SenseCells**) and how those Contexts connect (explicit **Bridges** with a brief loss note). We never equate terms by spelling; we argue sameness with a **bridge**. We also never bake stages or actors into names—those belong to **dynamics** and **roles**, not labels. When the story changes, we evolve names with **lexical continuity** rather than re‑inventing words. The result is a vocabulary managers and engineers can **hold on one page** and use the same way across projects.”### Acceptance Harness (SCR/RSCR) for F.18**Purpose.** Provide auditable, notation‑independent checks that a proposed unified name (and its publication on a UTS line) satisfies the **local‑first** unification discipline. The harness extends the general unification checks in **[F.15](/generated/patterns/F.15)** with **naming‑specific** obligations.#### Static Conformance Rules (SCR‑UNIFY)| ID | Requirement (normative “SHALL/SHALL NOT”) | Why this exists (conceptual) | Where this is reflected || -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------- | ------------------------------------------------------------ | ----------------------- || **SCR‑U‑01 (Row‑first).** A unified Tech/Plain name **SHALL** be published **only** on a **Concept‑Set row** whose cells are SenseCells drawn from declared Contexts. No free‑floating names. | Names are *lenses* onto a defended **row**, not vice‑versa. | **[F.7](/generated/patterns/F.7)** row‑as‑unit; **[F.17](/generated/patterns/F.17)** UTS row discipline. | §[F.7](/generated/patterns/F.7); §[F.17](/generated/patterns/F.17) || **SCR‑U‑02 (Bridge‑only equivalence).** Cross‑context sameness **SHALL** be claimed **only** via an explicit **Bridge** with a relation kind and **CL** + loss/fit note. | Prevents “string‑match identity”. | **[F.9](/generated/patterns/F.9)** Bridges; **[F.0.1](/generated/patterns/F.0.1)** principles. | §[F.9](/generated/patterns/F.9) || **SCR‑U‑03 (Neutral Tech).** The **Unified Tech** label **SHALL** be **neutral**—not lifted wholesale from any single Context **unless** the row’s Concept‑Set shows exact identity. | Avoids importing a local worldview as global. | **[F.5](/generated/patterns/F.5)** naming neutrality; **[F.17](/generated/patterns/F.17)** 9.8 naming neutrality. | §[F.5](/generated/patterns/F.5); §[F.17](/generated/patterns/F.17) || **SCR‑U‑04 (Twin registers).** Each row **SHALL** carry **Tech** and **Plain** names with the Part E register discipline; Plain is teacher‑friendly, Tech is morphology‑stable. | Satisfies didactic primacy without jargon creep. | **[E.10](/generated/patterns/E.10)** registers; **[F.5](/generated/patterns/F.5)** naming rules. | §[E.10](/generated/patterns/E.10); §[F.5](/generated/patterns/F.5) || **SCR‑U‑05 (No window‑in‑name).** Variations by **time/phase/scale** **SHALL** be handled by **applicability windows** on **Statuses** (or examples), **NOT** by baking modifiers into the unified name. | Prevents type/status explosion by adjectives. | **[F.10](/generated/patterns/F.10)/[F.12](/generated/patterns/F.12)** windows; **[F.14](/generated/patterns/F.14)** explosion guard. | §[F.10](/generated/patterns/F.10); §[F.12](/generated/patterns/F.12); §[F.14](/generated/patterns/F.14) || **SCR‑U‑06 (Heterogeneity).** A UTS block **SHALL** demonstrate **≥ 3** independent domain families across its rows, or an explicit Bias‑Annotation shall scope the claim. | Enforces trans‑disciplinary reach or honest scope. | **[F.17](/generated/patterns/F.17)** invariants 3; **[E.8](/generated/patterns/E.8)** Bias‑Annotation. | §[F.17](/generated/patterns/F.17); §[E.8](/generated/patterns/E.8) || **SCR‑U‑07 (Member≠Component sanity).** Names **SHALL NOT** imply holarchic composition when the row unifies **collections**; keep **MemberOf** distinct from **ComponentOf**. | Stops structural category errors. | Part F principles / anti‑patterns. | §9.8; §13 || **SCR‑U‑08 (One‑breath rationale).** Each row **SHALL** include a **single‑sentence** Unification Rationale that states **why** the cells belong in the same Concept-Set row despite wording differences. | Keeps the argument visible and auditable. | **[F.17](/generated/patterns/F.17)** invariant 7. | §[F.17](/generated/patterns/F.17) || **SCR‑U‑09 (Alias budget).** Per register, deprecated aliases on a unified name **SHALL** be **≤ 1**; additional deprecated labels go to Annex/Glossary. | Controls lexical drift while preserving continuity. | **[F.13](/generated/patterns/F.13)** alias budget rule. | §[F.13](/generated/patterns/F.13) || **SCR‑U‑10 (No Cross‑context rename).** A rename **SHALL** occur **within** the same Context or same row; Cross‑context “renames” are **prohibited**—use Bridges. | Keeps locality intact; forbids silent conflation. | **[F.13](/generated/patterns/F.13)** continuity; **[F.9](/generated/patterns/F.9)** Bridges. | §[F.13](/generated/patterns/F.13); §[F.9](/generated/patterns/F.9) || **SCR‑U‑11 (Semantic read‑through).** A unified Tech/Plain name **SHALL** pass a **semantic read‑through**: the Name Card lists **5–10 diverse NQD archetypal situations** and the **NQD‑front notes** record rejected candidate and their **mismatch patterns**. | Prevents labels that mislead across the intended situations; ties lexical choice to demonstrated use. | §[F.18](/generated/patterns/F.18) §4.2; §[F.18](/generated/patterns/F.18) §5. | §[F.18](/generated/patterns/F.18) |#### Regression Rules (RSCR‑UNIFY)| ID | Regression duty across editions | Effect || ------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | ---------------------------------------------------------------------- | ------ || **RSCR‑U‑E01 (Edition drift).** When a source Context updates, re‑validate the row: stable sense ⇒ **rename/alias**; changed sense ⇒ **split/merge** rows; never overwrite. | Preserves truthfulness without erasing history. **[F.13](/generated/patterns/F.13)** RSCR. | || **RSCR‑U‑E02 (CL honesty).** Bridges **SHALL NOT** increase their CL (claiming higher-CL sameness) without new witnesses; **SHOULD** reduce CL when editions diverge. | Guards against optimism bias in equivalence. **[F.17](/generated/patterns/F.17)** old wording. | || **RSCR‑U‑E03 (Alias creep).** Periodically prune aliases to the **≤ 1** budget per register. | Maintains narratively crisp UTS. **[F.13](/generated/patterns/F.13)** RSCR‑Alias. | || **RSCR‑U‑E04 (Name neutrality check).** If the Unified Tech label is traceable to one context’s idiom, re‑justify neutrality or retitle the row. | Keeps the name “ours,” not “theirs.” **[F.17](/generated/patterns/F.17)** 9.7–9.8. | || **RSCR‑U‑E05 (Window misuse).** Reject newly proposed types that are really **windows** on an existing Status/Role. | Prevents explosion by adjectives. **[F.14](/generated/patterns/F.14)** S14/E11 patterns. | |### Migration & Deprecation Notes (informative, naming‑specific)1. **Start from rows, not strings.** When consolidating legacy labels, **build or revisit the Concept‑Set row** first; only then pick the **Unified Tech/Plain** names. This keeps **meaning** primary. **([F.7](/generated/patterns/F.7), [F.17](/generated/patterns/F.17))**2. **Prefer alias over merge.** If the *sense* is stable but the label misleads, **rename and retain one alias**; if the sense changed, **mint a new row** (no retrofits). **([F.13](/generated/patterns/F.13))**3. **Resist modifier types.** New adjectives (e.g., *Peak*, *Remote*, *Night*) usually belong to **windows** or **examples**, not to the unified name. **([F.10](/generated/patterns/F.10)/[F.12](/generated/patterns/F.12)/[F.14](/generated/patterns/F.14))**4. **Keep neutrality visible.** If stakeholders push a brand‑coloured label, document why the chosen **Unified Tech** is **neutral** and include the brand as an **alias** in Glossary/Annex. **([F.5](/generated/patterns/F.5), [F.17](/generated/patterns/F.17))**5. **Don’t globalise a Context.** Never move a Context label into the unified name as if it were universal. Use **Bridges** to relate Contexts, with an explicit **loss note**. **([F.0.1](/generated/patterns/F.0.1), [F.9](/generated/patterns/F.9))**### FAQ (authoring hygiene for engineer‑managers)**Q1. Can we reuse a dominant industry term as the Unified Tech name?****A.** Only if the row’s Concept‑Set shows **exact identity** across Contexts; otherwise pick a **neutral** Unified Tech and list the industry label as an **alias** in the Glossary. **([F.5](/generated/patterns/F.5), [F.17](/generated/patterns/F.17))****Q2. Two terms look identical across Contexts—may we skip Bridges?****A.** No. **Sameness is argued, not spelled.** Publish a **Bridge** with relation kind and **CL** plus a short **loss/fit** note. **([F.9](/generated/patterns/F.9), [F.0.1](/generated/patterns/F.0.1))****Q3. When do we mint a new U.Type vs. add a new row vs. add an alias?****A.** Use **[F.8](/generated/patterns/F.8) Mint‑or‑Reuse**: if the *concept meaning* changes, **new U.Type**; if cross-context alignment needs a new Context, **new row**; if only the label misleads, **alias/rename**.**Q4. Our team keeps proposing “qualified roles” (e.g., *Night‑Operator*). What do we do?****A.** Keep the **Role** unified and express qualifiers as **windows** on **Statuses** or as **example context**. This follows **[F.14](/generated/patterns/F.14)** and **[F.12](/generated/patterns/F.12)**.**Q5. Can we compress two near‑equivalent rows into one to “simplify the sheet”?****A.** Only if the **one-breath rationale** remains true after review and the Bridges preserve equivalence with the same CL, or a higher CL only when new witnesses justify it; otherwise keep **two rows** with explicit differences. **([F.17](/generated/patterns/F.17), [F.9](/generated/patterns/F.9))**### Didactic distillation (90‑second script)> **“Name on a row, never on a whim.”** In FPF we **speak on rows, not on vibes**: a **Name Card** ties each Tech/Plain pair to a concrete Context, Concept‑Set row, and SenseCells, with a small **NQD‑front** of rejected alternatives. This gives you **bridged precision** without losing **local comfort**. **Your UTS is the one page a careful mind can hold.**### Name-card guardrails for set-candidate language- Keep `Palette`, `Front`, `Archive`, and `Shortlist` as distinct head families rather than as aliases of one generic `portfolio`.- Prefer this head family when the local entry load matches it: - `TraditionPalette` when `SubjectKind=Tradition` - `Q-Front` - `ExplorationArchive` - `Shortlist`- The shortlisted family stays internally coherent: - `RankedShortlist ⊑ Shortlist` - `ShortlistId` is one `Id` specialized to an emitted shortlist - `ChoiceSet` may appear only as one mathematical gloss for the shortlist's set object, not as one rival public head- Reserve `Pareto` for actual non-domination under a declared `DominanceSet`; do not use it for weighted ranking, popularity ordering, or one post-lens shortlist.- Treat bare `portfolio` as a guarded reject here because current `FPF` already uses `portfolio` as one broader selector/set-return family. When the local set family is recoverable, do not reuse that broader head as the local winner.- Treat bare `shortlist` as admissible only when the selected-set family is intended and the declared source set kind plus the named lens are already recoverable nearby.- When one set-family candidate is tied to traditions, methods, hypotheses, or environment-method pairs, say the `SubjectKind` explicitly instead of letting the head noun do the work by implication.- When one shortlist is emitted from one front or one archive, say the declared source set kind and the named lens instead of letting `Shortlist` drift into one generic selector result.- If one local explanation still needs `ChoiceSet`, say that it is the mathematical set gloss for the shortlist rather than letting it read like one second public set family.- Good examples include `TraditionPalette` for a tradition-member palette, `Palette + SubjectKind=MethodFamily`, `Q-Front`, `ExplorationArchive`, `ShortlistFromQFront`, `RankedShortlistFromShortlist`, and `ShortlistId`.- Bad examples include bare `portfolio`, `SoTA portfolio`, `Pareto shortlist`, `Pareto archive`, and `frontier set` when the declared dominance basis is still missing.### SoTA-Echoing (post-2015 practice alignment)[F.18](/generated/patterns/F.18) is local-first, kind-bound, and context-bound naming discipline. Its SoTA source-use material must not make ordinary naming look mathematically certified. Mathematical and search traditions are admitted only when they make the Name Card more reviewable for the current naming problem.* **Terminology work, especially ISO 704:2022 and ISO 1087:2019.** This is the direct practice basis for term formation, designation, definition, and concept discipline. [F.18](/generated/patterns/F.18) adopts the requirement that a reusable name must keep its kind, context, intended use, and definition recoverable, while rejecting dictionary substitution and global vocabulary rows as sufficient naming work.* **Word-sense disambiguation and sense evaluation.** P2's sense-seed read-through is a human-scale analogy: test a candidate name against several intended-use situations and record error patterns. WSD does not prove that a Name Card must use `theta_P`, sense-seed thresholds, or any particular numeric cut-off. Those remain FPF authoring choices that are admissible only when they improve local reviewability.* **Quality-diversity and multi-objective search, including MAP-Elites and NSGA-II families.** P1's NQD-front and **CC-F18-13** adapt the design-space lesson: keep several diverse good candidates visible instead of collapsing too early to one scalar winner. This does not validate lexical candidate selection by itself. Pareto or frontier wording is admissible only when the lexical Q-components are explicit, inspectable, and used under the ordinal discipline of [C.16](/generated/patterns/C.16).* **Design-space exploration and idea ranking in mechanical and industrial design.** Name-Card candidate tables may borrow the habit of comparing alternatives on several visible criteria. The practical gain is auditability of rejected candidates, not a claim that naming has become an engineering optimization problem.* **Semantic transparency and morphology in interfaces and code.** These traditions provide source-use material for readable labels and error prevention where comprehension is live. [F.18](/generated/patterns/F.18) adapts them into MorphologicalActionFit and local head-term checks, while rejecting readability as proof that the name is ontologically correct.### Relations**Builds on:****[F.0.1](/generated/patterns/F.0.1)** Contextual Lexicon Principles (local meaning; bridge‑only Cross‑context claims). **[F.1](/generated/patterns/F.1)–[F.3](/generated/patterns/F.3)** Contexts → term harvesting → local sense clustering. **[F.5](/generated/patterns/F.5)** Naming discipline. **[F.7](/generated/patterns/F.7)** Concept‑Set construction. **[F.8](/generated/patterns/F.8)** Mint‑or‑Reuse decision lattice. **[F.13](/generated/patterns/F.13)** Lexical continuity (renames/aliases/splits/merges). **[F.14](/generated/patterns/F.14)** Anti‑explosion controls (bundles, SoD, windows). **[F.15](/generated/patterns/F.15)** SCR/RSCR harness. **[F.17](/generated/patterns/F.17)** UTS as the public term sheet.**Constrains:**All patterns that propose or consume unified names and rows in Part F; any Part A/C pattern that cites U.Types on UTS rows inherits these naming duties (through the UTS linkage), while keeping **structural/epistemic/temporal** aspects distinct per Part E authoring rules.**Coordinates with.****[A.17](/generated/patterns/A.17)/[A.18](/generated/patterns/A.18)** for measurement lexicon when rows concern measurable notions (Characteristic/Scale/Level/Coordinate vocabulary), ensuring neutral naming aligns with canonical terms and eases external alignment via Bridges.### F.18:End## Ontology-First Plain Technical Rewriting> **Type:** Plain-technical precision-restoration pattern> **Status:** Stable> **Normativity:** Normative for FPF-governed technical prose unless explicitly marked informative; informative for external source prose until it is rewritten for FPF use**Plain-name.** Ontology-first plain rewriting.**Intent.**Repair technical prose whose object, claim, relation, action, role, or flow is buried under extra apparatus. The repair is not cosmetic plain-language editing. It first separates content from apparatus by ontology, then writes the remaining content in the shortest plain technical form that preserves FPF kinds, slots, claim boundaries, and admissible use. Remaining word, head, naming, or wording-use problems then apply `E.10`, `E.10.ARCH`, `F.18`, or the governing pattern for the object.**Builds on.** `E.8`, `E.10`, `E.10.ARCH`, `F.18`, `A.6.P`, `A.7`, `E.18`, `E.21`, and exact source-use, evidence, assurance, gate, work, decision, publication, architecture, characteristic, state-family, and relation patterns when those objects carry the repaired span's claim.**Coordinates with.** `E.19`, `E.22`, `E.23`, `A.19.SPR`, `C.2.P`, `C.16.P`, `C.30.P`, `E.11`, `I.2`, pattern-quality records, review records, `DRR`s, projection carriers, and source-side notes.### Use this whenUse `F.19` when a bounded piece of technical prose is trying to say something precise, but the reader must pass through role labels, container words, status words, process traces, quality proof, repeated negative catalogues, reference boilerplate, or pattern-application metaphors before the object and action are visible.Typical in-scope prose includes:- FPF pattern prose;- `DRR` text and architecture notes;- review findings and quality-loop records;- project-facing FPF guidance;- source prose being rewritten for FPF use;- other technical prose whose accepted ontology, domain model, controlled vocabulary, or role model must survive simplification.**What goes wrong if missed.** Authors replace one official-sounding phrase with another. The text becomes smoother or shorter while the hidden kind error remains, or it becomes easy to read by losing the FPF kind, slot, role, claim boundary, or admissible-use boundary.**What this buys.** Plain technical wording becomes an ontological discipline with less apparatus: fewer words, clearer objects, fewer repeated negative catalogues, and no loss of technical semantics.**First useful move.** Mark the span under repair. Split it into content candidates and apparatus candidates before rewriting either side.**Not this pattern when.**- If the problem is only one overloaded word or head after the content is visible, apply `E.10`.- If the problem is a durable reusable name, apply `F.18`.- If the span already names the content-bearing relation, source-use relation, state-family value, architecture label, characteristic, quality term, function wording, evidence claim, gate claim, work claim, decision claim, or other FPF object named by value, apply the governing pattern for that object.- If the source text is only being observed and not admitted into FPF-governed prose, keep the observation source-side.**Primary EntityOfConcern in plain terms.** One phrase-level, sentence-level, row-level, paragraph-level, or small-section technical-prose repair whose goal is kind-preserving plain expression.### Problem frameMature technical languages accumulate enough ontology that many bad sentences are not bad because the terms are unknown. They are bad because a simple technical claim is wrapped in process language, role language, status language, quality-carrier evidence, pattern-reference apparatus, or repeated negative distinctions.The repair question is:> What content remains when words that add no object, kind, relation, claim, role, flow, evidence value, or user move are removed?Examples inside FPF:- "`A.15` handles the claim" when the text needs to say that `A.15` applies to a work-planning claim;- "live pattern text" when the text means "the pattern" or "the pattern of concern";- "governing relation" when the named object is a pattern, not a relation;- long "not X, not Y, not Z" paragraphs when the text needs a positive object, action, and one stop condition;- corpus-projection proof written inside a pattern whose own user move is not corpus projection.The same defect appears outside pattern prose. A system note may hide an evaluation claim inside process language; a project note may treat a dashboard as evidence authority when it is a publication form; an architecture memo may replace a scale-preference claim over alternatives with a platform label.These failures confuse coupled transduction flows. A pattern under development, a pattern being applied, a quality evaluation of that pattern, a project work occurrence, a source publication, and a projection record are different objects. They may influence one another; they do not become one another by being mentioned in the same paragraph.### ProblemHow can FPF make technical prose plain without:- treating plain language as a synonym-replacement exercise;- deleting content-bearing technical terms as "jargon";- replacing exact terms with colourful synonyms or role nicknames;- letting process, review, projection, or quality proof become pattern content;- repeating the same boundary doctrine in every local pattern;- hiding slot/use-position changes under a shorter phrase;- turning every phrase repair into a new local mini-ontology?### Forces| Force | Tension ||---|---|| Plain wording vs ontology | Short prose helps readers, but careless simplification erases kinds, slots, roles, or claim boundaries. || Precision vs apparatus | Exact technical language needs kind recovery, but extra role, carrier, locus, flow, status, and process words can bury the claim. || Local repair vs semantic change | Some extra words are boilerplate; others carry a hidden kind, relation, slot, evidence role, or admissible-use boundary. || Flow separation vs readable prose | Development, evaluation, projection, and use flows must stay distinct without making every sentence narrate those flows. || Reuse vs repetition | References to related patterns matter, but repeated "if X, apply Y" prose can become reference fanout. || Plainness vs synonym churn | Plain prose should reduce apparatus, not create a new set of loose paraphrases for established FPF terms. |### SolutionUse `OntologyFirstPlainRewrite` as a five-step repair over one bounded span.1. **Bound the span.** Name the sentence, row, paragraph, or small section under repair. Name visible apparatus candidates: pattern-application drift, role label, container word, status word, process trace, quality proof, negative catalogue, reference boilerplate, or other overwrap.2. **Separate content from apparatus by ontology.** For each phrase part, ask what object, head kind, claim kind or relation kind, slot or use-position, admissible use, concerned role, and design/run or coupled-flow role it expresses. If a phrase part changes one of those values, keep it as content. If it only restates process, role label, negative catalogue, reference boilerplate, or quality proof without changing content, classify it as apparatus.3. **Remove or move apparatus.** Delete the apparatus or move it to the carrier where it belongs: `DRR`, review record, quality result, architecture note, README/ToC/[E.11](/generated/patterns/E.11)/[I.2](/generated/patterns/I.2) entry locus, projection carrier, release/landing evidence carrier, or source-side note. Do not replace it with a smoother synonym, role label, container word, or status word.4. **Restore remaining content precision.** Apply `E.10`, `E.10.ARCH`, `F.18`, or the governing pattern when a remaining word, head, relation, claim, slot/use-position, source-use role, durable name, or admissible-use boundary is still hidden.5. **Rewrite and check loss.** Write the shortest plain technical sentence that preserves the repaired object, kind, claim/relation/action, slot/use-position, role, flow, established term, and admissible use. The rewrite fails if it changes one of those values without an accepted semantic decision, or if it becomes harder for the declared reader to use.Use the full result form when the repair must be inspectable; otherwise a local rewrite plus the kind-preservation check is enough.#### Result form| Field | Meaning ||---|---|| `TextSpanRef` | Exact span under repair. || `ApparatusCandidateSet` | Visible pattern-application, role, carrier, locus, flow, status, process, negative-catalogue, reference, or quality-proof apparatus candidates. || `ContentCandidateSet` | Phrase parts that may carry object, kind, claim, relation, slot/use-position, role, flow, evidence value, or user move. || `ObjectOfConcern` | Object the span is about. || `KindAndClaimMap` | Head kind, claim kind, relation kind, slot or use-position when it changes admissible use, scope, and governing pattern when another pattern governs a specific outside claim. || `ConcernedRoleAndFlow` | Role concerned with the object, plus design/run or coupled-flow role when it changes meaning. || `ApparatusDisposition` | Removed, moved, retained as content, or blocker when separation is not yet possible. || `RemainingContentPrecisionRestoration` | `not needed`, [`E.10`](/generated/patterns/E.10), [`E.10.ARCH`](/generated/patterns/E.10.ARCH), [`F.18`](/generated/patterns/F.18), governing pattern, or blocker. || `PlainRewrite` | Short rewrite after apparatus removal and remaining-content precision restoration. || `KindPreservationCheck` | Pre-rewrite and post-rewrite object kind, relation or claim kind, slot or use-position, admissible use, and scope; disposition is `preserved`, `split`, `intentionally changed by accepted decision`, or `blocker`. || `LossCheck` | What became worse, less local, less current, less recoverable, or less usable if the rewrite is accepted. |#### Pattern-prose specializationWhen the repaired prose is an FPF pattern, apply the same algorithm with one role test:> Does this sentence address the pattern's intended user, or does it record development, review, projection, landing, quality, or source-management evidence about the pattern version?If it records evidence about the pattern version, keep that evidence outside the pattern unless the pattern's own primary `EntityOfConcern` is that evaluation or projection object. The evidence can cause edits to the pattern; it is not automatically pattern content.Pattern prose keeps:- the pattern's own primary `EntityOfConcern`;- the first useful move;- the practical delta and cost of missing it;- local boundary prose only for a documented local confusion and exact stop condition;- short declarative references to related patterns after the pattern's own content is visible.Pattern prose moves out:- package-placement rationale;- review/executor correspondence;- quality-status proof;- README/ToC/[E.11](/generated/patterns/E.11)/[I.2](/generated/patterns/I.2), retrieval, card, monolith-parity, or landing evidence;- repeated boundary doctrine already carried by another pattern.### Archetypal Grounding| Grounding slice | Before | [F.19](/generated/patterns/F.19) repair ||---|---|---|| Pattern application | "[`A.15`](/generated/patterns/A.15) handles the work-planning claim." | "Apply [`A.15`](/generated/patterns/A.15) to the work-planning claim." || Pattern vs relation | "The governing relation is [`C.29`](/generated/patterns/C.29)." | "Mathematical-lens claims are governed by [`C.29`](/generated/patterns/C.29)." || Pattern text role | "Live pattern text must not contain corpus projection evidence." | "A pattern must not contain projection evidence about itself." || Evaluation scope | "The evaluation has pre-landing host-set use." | "This is a host-only evaluation; corpus-entry values need corpus-projection evidence." || Negative catalogue | "This pattern is not proof, not work, not a gate, not a decision." | "This pattern evaluates pattern quality; project evidence claims are governed by project-side evidence patterns." || Role label | "The platform owns scale." | "The span makes a scale-preference claim over platform and non-platform alternatives." || Publication/evidence mix | "The dashboard is the evidence gate." | "The dashboard is a publication form; evidence and gate claims need their own governing patterns." |### Bias-Annotation`F.19` deliberately biases toward shorter, reader-facing prose. The protected value is kind-preserving clarity, not brevity by itself. A rewrite that removes terms while losing object kind, relation kind, slot/use-position, source-use role, or admissible-use boundary is worse than the original.`F.19` also protects against two common reviewer biases:- **negative-catalogue bias:** explaining a class by long lists of what it is not;- **apparatus-preservation bias:** replacing one process, role, carrier, locus, flow, status, or quality-proof phrase with another phrase that still hides the object.### Conformance checklist| Check | Requirement ||---|---|| `CC-F19-1` | The repair names the text span and visible apparatus candidates before rewriting. || `CC-F19-2` | The repair separates apparatus from content by object, kind, claim or relation kind, slot/use-position when it changes admissible use, concerned role, and flow role; lexical dislike is not enough. || `CC-F19-3` | Apparatus is removed or moved before wording-use precision restoration is applied to the remaining content. || `CC-F19-4` | Content-bearing wording remains content and is repaired by [`E.10`](/generated/patterns/E.10), [`E.10.ARCH`](/generated/patterns/E.10.ARCH), [`F.18`](/generated/patterns/F.18), or the governing pattern rather than deleted as style. || `CC-F19-5` | A removed apparatus word is not replaced by a synonym, metonymy, role label, container word, or status word that carries the same hidden apparatus. || `CC-F19-6` | Established FPF terms are preserved unless a named precision-restoration or naming pattern changes them. || `CC-F19-7` | Every accepted rewrite includes a `KindPreservationCheck`; a wording change that changes object kind, relation kind, claim kind, slot/use-position, admissible use, or scope without an accepted decision remains a blocker. || `CC-F19-8` | Development, evaluation, projection, landing, use-found, repair, and source-management evidence stay in their own carriers unless the text's own object of concern is that flow object. || `CC-F19-9` | The accepted rewrite is shorter or clearer without losing technical semantics; a longer rewrite is admissible only when it recovers a hidden kind, relation, role, slot, or claim boundary. || `CC-F19-10` | The repair records any value, usability, locality, currentness, or kind-recoverability loss. |### Common anti-patterns and how to avoid them| Anti-pattern | Symptom | Repair ||---|---|---|| Lexical paint | One umbrella word is replaced by another while the object kind stays hidden. | Recover the object kind and rewrite in the object's technical name. || Plain-language drift | Smooth prose drops the kind named by value or admissible-use boundary. | Remove apparatus first, then restore remaining wording precision before shortening. || Flow smuggling | Development, projection, landing, or evaluation evidence is written as user-facing guidance. | Move the evidence to its carrier and keep only the resulting user move or boundary. || Role label as ontology | A role label replaces the object kind. | Name the object kind; state the role relation only when it changes the claim. || Slot label as ontology | A slot, field, or use-position label replaces the object kind, or the same object in several slots is treated as several kinds. | Preserve object kind and slot/use-position separately and apply the governing pattern for the content-bearing relation, signature, lens, role, method, or work claim. || Negative catalogue | The sentence defines an object by listing what it is not. | Lead with the positive object and action; keep only local documented confusion and exact stop condition. || Overformalized precision | The rewrite preserves all terms but makes the sentence harder to think with or generalize from. | Keep the content-bearing kind and claim, drop non-load-bearing apparatus, and use a plain technical sentence plus reference named by value where needed. || Apparatus-preserving paraphrase | A rewrite changes wording but keeps the same status, process, or quality-proof apparatus. | Return to the apparatus/content split and repair by value. |### Consequences`F.19` makes technical prose easier to read because it removes apparatus before shortening the sentence. It also makes reviews stricter: a pleasant paraphrase does not count unless the pre/post kind, relation, slot/use-position, admissible use, and scope are preserved or deliberately changed by accepted decision.The cost is that some edits need a short repair note before they look simple. That cost is intentional. Without the note, agents tend to do lexical replacement, narrow a graph into a sequence, widen a work occurrence into a method, turn a publication into evidence, or hide a pattern application under a route-like metaphor.### RationalePlain technical style in FPF is not a separate aesthetic layer. It is the visible result of ontology-first repair with less apparatus. The order matters:1. remove or move boilerplate apparatus;2. restore the remaining content through the wording named by value-use, naming, relation, slot, source-use, or object pattern;3. write the shortest sentence that keeps the recovered meaning.Putting `F.19` beside wording-use restoration keeps `E.10` from becoming a phrase-style super-pattern. `E.10` catches words and heads whose kind or use is hidden. `F.19` catches the earlier phrase-level problem: the content may not even be visible until process, role, status, reference, quality, or negative-catalogue apparatus is removed.### SoTA-Echoing| Claim disciplined by source | Practice/source | Source-use relation | FPF import ||---|---|---|---|| Plain prose serves a reader and task, not a generic style preference. | ISO 24495-1:2023, *Plain language - Part 1: Governing principles and guidelines*. | Current standard reference for plain-language principles and task/readership fit. | [`F.19`](/generated/patterns/F.19) requires declared reader/use and checks loss after rewriting. It adapts plain-language principles to FPF kind preservation. || Plain language removes unnecessary complexity while keeping necessary terms. | Federal Plain Language Guidelines and Digital.gov plain-language guidance. | Current government plain-language practice reference for audience-first, direct, organized prose. | [`F.19`](/generated/patterns/F.19) removes apparatus but preserves established FPF terms unless [`E.10`](/generated/patterns/E.10) or [`F.18`](/generated/patterns/F.18) changes them. || Legal and technical documents can be clearer without losing controlled terms. | SEC, *A Plain English Handbook: How to Create Clear SEC Disclosure Documents*. | Lineage and practice reference for reducing legalese while retaining disclosure meaning. | [`F.19`](/generated/patterns/F.19) treats "plain" as meaning-preserving repair, not informal paraphrase or synonym churn. || FPF precision restoration must preserve ontology before style. | Current FPF patterns [`E.8`](/generated/patterns/E.8), [`E.10`](/generated/patterns/E.10), [`E.10.ARCH`](/generated/patterns/E.10.ARCH), [`F.18`](/generated/patterns/F.18), [`A.6.P`](/generated/patterns/A.6.P), [`E.21`](/generated/patterns/E.21). | Current FPF governing-source relation. | [`F.19`](/generated/patterns/F.19) becomes the phrase-level sibling to word/head/use restoration and feeds [`E.21`](/generated/patterns/E.21) through `PrecisionRestorationProfile`. |### Relations| Related pattern | Relation ||---|---|| [`E.8`](/generated/patterns/E.8) | Applies [`F.19`](/generated/patterns/F.19) to FPF pattern prose and keeps pattern bodies addressed to their intended users. || [`E.10`](/generated/patterns/E.10) | Restores remaining wording whose kind, relation, or admissible use is hidden after apparatus removal. || [`E.10.ARCH`](/generated/patterns/E.10.ARCH) | Provides shared wording-use recovery architecture for remaining content. || [`F.18`](/generated/patterns/F.18) | Settles durable reusable names after kind and use are known. || [`A.6.P`](/generated/patterns/A.6.P) | Restores relation construction when the remaining content hides relation kind, endpoint, support/basis, or slot/use-position. || [`A.19.SPR`](/generated/patterns/A.19.SPR), [`C.2.P`](/generated/patterns/C.2.P), [`C.16.P`](/generated/patterns/C.16.P), [`C.30.P`](/generated/patterns/C.30.P) | Govern state-family, source/publication, characteristic/scale, and architecture/structure wording when those objects remain as content after apparatus removal. || [`E.21`](/generated/patterns/E.21) | Consumes [`F.19`](/generated/patterns/F.19) findings through `PrecisionRestorationProfile`; it lowers affected quality coordinates without creating one coordinate per apparatus symptom. || [`E.19`](/generated/patterns/E.19), [`E.22`](/generated/patterns/E.22), [`E.23`](/generated/patterns/E.23) | Use [`F.19`](/generated/patterns/F.19) in review, framing, and improvement-loop work while keeping quality-loop records out of pattern prose. || [`E.11`](/generated/patterns/E.11) and [`I.2`](/generated/patterns/I.2) | Provide first-entry cues and expanded entry-disambiguation cases for phrase-level apparatus repair. |### F.19:End## G.Core - Part G Core Invariants**Tag.** Architectural pattern (Part‑G core invariants hub; refactoring/deduplication)**Stage.** *design‑time* (authoring discipline + ID‑stable citation discipline; no run‑time mechanism)**Primary hooks.** [E.8](/generated/patterns/E.8) (pattern template), [E.10](/generated/patterns/E.10) (lexical/ontological rules), [E.19](/generated/patterns/E.19) (conformance discipline), [A.6.7](/generated/patterns/A.6.7) (SuiteObligations + suite protocol pins), [A.15.3](/generated/patterns/A.15.3) (planned baseline), [A.19](/generated/patterns/A.19) (CN‑Spec), [G.0](/generated/patterns/G.0) (CG‑Spec), [A.19.CHR](/generated/patterns/A.19.CHR) (CHR suite boundary), [C.23](/generated/patterns/C.23) (SoS‑LOG), [F.17](/generated/patterns/F.17) (UTS), [F.15](/generated/patterns/F.15) (RSCR).**Status.** Stable**Placement.** Part G core section before `G.0` (without renumbering `G.0…G.13`).**Normativity.** Normative unless explicitly marked informative**Purpose.** Provide *one governing definition* for Part‑G‑wide invariants (**delegation-first citation and change-control discipline**), plus a typed **RSCR trigger kind catalogue** and a **Default Governing Definition Index**, so Part G can be refactored without semantic drift or public‑ID breakage.**Phase‑2 constraint.** `G.Core` is the only new Part‑G pattern introduced in Phase‑2; discipline/method/generator specifics remain in `G.x` as `Extensions`, citations to existing governing patterns, or Phase‑3 seeds (appendix) without new Phase‑2 norms.**Post‑Phase‑2 evolvability policy.** The Phase‑2 restriction above is historical. From Phase‑3 onward, new Part‑G `PatternId`s are permitted when (i) they introduce a genuinely new **kit/pack class** (typically levels `G.2–G.5`), or (ii) they are required to preserve **one governing pattern per wiring extension** and wiring-only separation. Method/discipline/generator specifics SHOULD still default to `GPatternExtension` modules under `G.x:Extensions` (scoped by `PatternScopeId = G.x:Ext.*` and `GoverningPatternId`), rather than adding new Part‑G patterns.### G.Core:1 - Problem framePart G contains patterns for CG‑frame characterization and its downstream artefacts (cards, evidence graphs, bridge surfaces, refresh/shipping orchestration, parity harnesses, dashboards, interop surfaces). In the current spec, several invariants are already present as **suite obligations/protocol norms** and are **reused across Part G**.*Part‑G‑wide* invariants are governed by `G.Core` so every `G.x` can:* cite the core invariants rather than restating them, and* isolate pattern-scoped specifics as `Extensions` without turning each `G.x` into a mixed bag of universal rules, kit surfaces, and method/generator descriptions.This pattern (`G.Core`) therefore acts as the **deduplication hub** for FPF Part G.### G.Core:2 - ProblemWithout one governing definition for Part‑G‑wide invariants, Part G drifts in at least six recurring ways:1. **Shadow governing spec refs** emerge: downstream patterns restate CN‑Spec / CG‑Spec constraints, accidentally creating “local specs” that can diverge from the canonical governing spec refs.2. **Crossing discipline becomes inconsistent**: “crossing events” and “crossing visibility” are described differently across `G.x`, causing ambiguity about what must be pinned (UTS/Path/policy‑ids/editions) and what triggers refresh/regression.3. **Guard semantics drift**: tri‑state eligibility and “unknown handling” can be reinterpreted in local prose, producing hidden fourth statuses or implicit coercions.4. **Hidden scalarization appears**: partial orders are silently collapsed into scalars, or totalization is introduced implicitly through “helpful” numeric summaries.5. **Suite/kit/pack mixing blurs governing-definition assignment**: downstream patterns drift into “governing” what should remain governed by the suite boundary (`A.6.7` and `A.19.CHR`), kit surfaces (each `G.x`), or shipping (`G.10`).6. **Refactoring breaks public IDs**: CC items and trigger labels become hard to evolve because removing duplicates risks breaking external references.Part G requires a single place where these invariants and refactoring disciplines live, while keeping Part G patterns modular and method/discipline specifics explicitly separated.### G.Core:3 - Forces* **One governing definition vs. usability:** We must centralize universal invariants, but `G.x` must remain readable and pattern-scoped for authors.* **Delegation-first vs. completeness:** Many norms already have canonical governing definitions such as `A.6.7`, `A.15.3`, `A.19`, `G.0`, `A.19.CHR`, and the relevant Part E patterns. `G.Core` must cite those governing definitions rather than duplicating semantics.* **Public-id and alias continuity:** Public CC IDs and deprecated trigger labels must remain stable as labels; deduplication must not break citations.* **Typed change control:** RSCR/refresh must become *id‑based* (catalogued trigger kinds) rather than prose-based “meaning”.* **Strict distinction:** Keep governing spec refs (CN‑Spec, CG‑Spec), suites, kits/surfaces, policies, planned baselines, audits, and refresh orchestration distinct.* **Minimal specificity naming:** New IDs must be kind‑suffixed and minimally specific, to reduce semantic lock‑in while remaining precise.* **Phase‑2 scope discipline:** `G.Core` must not become a container for discipline/method/generator taxonomies; those remain pattern-scoped (`Extensions`), delegated to existing governing patterns, or marked Phase‑3 seeds (appendix) without new Phase‑2 norms.### G.Core:4 - Solution`G.Core` establishes Part‑G‑wide invariants as **delegation rules + typed catalogs + authoring discipline**.#### G.Core:4.1 - Delegation-first citation for Part‑G‑wide invariants`G.Core` is a *citation hub*, not a “second spec”. For any Part‑G‑wide invariant that already has a governing definition, `G.Core`:1) standardises naming via `SuiteObligations.*` (A.6.7:4.2), and2) records where the invariant is governed, so downstream patterns cite rather than restate.**Delegation table (normative index; no semantic duplication).**| Obligation handle | Canonical governing definition(s) | Part‑G note || --- | --- | --- || `transport_declarative_only` + `cg_spec_cite_required_for_numeric_ops` | [A.6.7](/generated/patterns/A.6.7) + [A.19](/generated/patterns/A.19) (CN‑Spec) + [G.0](/generated/patterns/G.0) (CG‑Spec) + [A.19.CHR](/generated/patterns/A.19.CHR) | CN/CG are *pins*, not copies (“governing spec refs are pins, not copies”). No embedded/shadow governing spec refs. || `bridge_only_crossings` | [A.6.7](/generated/patterns/A.6.7) + [E.18](/generated/patterns/E.18) | Any cross-Context or cross-plane/kind move is Bridge‑mediated; no implicit crossings. || `crossing_visibility_required` | [E.18](/generated/patterns/E.18) (CrossingBundle) + [A.6.7](/generated/patterns/A.6.7) | Crossing visibility is a published **CrossingBundle**. `edition_key` changes on **crossing‑relevant artefacts** (Bridge/CL surfaces, BridgeCards, CrossingBundle registries, and UTS rows for crossing artefacts) are treated as crossing-bundle edits. If the required CrossingBundle is missing/non‑conformant, downstream consumers MUST **abstain** from cross-Context or cross-plane reuse (no silent crossings). || `two_bridge_rule_for_described_entity_change` | [A.6.7](/generated/patterns/A.6.7) | entityOfConcern retargeting requires an explicit KindBridge (`CL^k`) in addition to any Context/Plane Bridge. || `guard_decision_tristate(pass|degrade|abstain)` + `unknown_never_coerces_to_pass` | [A.6.7](/generated/patterns/A.6.7) + [C.23](/generated/patterns/C.23) | `GuardDecision := {pass|degrade|abstain}` only; `unknown` maps to `degrade`/`abstain` via explicit SoS‑LOG branch/policy pins. || `penalties_route_to_r_eff_only` | [A.6.7](/generated/patterns/A.6.7) | Penalties affect the **R lane (R_eff)** only; **F/G invariants** must not be altered by penalties. || `no_silent_scalarisation_of_partial_orders` + `no_silent_totalisation` | [A.6.7](/generated/patterns/A.6.7) | Partial orders stay set‑valued; no silent scalar ranks or “helpful” totalisation. || `planned_slot_filling_in_work_planning_only` + `finalize_launch_values_in_work_enactment_only` + `gate_decision_separation` | [A.15.3](/generated/patterns/A.15.3) + [A.19.CHR](/generated/patterns/A.19.CHR) + [A.6.7](/generated/patterns/A.6.7) | Planned baselines are WorkPlanning‑only; launch/finalization values are WorkEnactment‑only; planning does not govern GateDecision/DecisionLog semantics. || `DefaultGoverningDefinitionIndex.single_governing_definition_per_DefaultId` | this pattern | Any default names exactly one governing definition; `G.Core.DefaultGoverningDefinitionIndex` is an index, not a second spec. |This pattern also governs four pieces of Part‑G‑wide infrastructure that are **not** already governed elsewhere:* the typed **RSCRTriggerKindId catalogue** (single writer),* the **Default Governing Definition Index** (one governing definition per DefaultId; index only), and* the **Δ‑discipline** for ID‑stable deduplication (delegation without public‑ID breakage), and* the **linkage compression catalogues** (`GCoreConformanceProfileId`, `GCoreTriggerSetId`, `GCorePinSetId`) used to keep `G.x` linkage sections small.#### G.Core:4.2 - Mandatory G.Core linkage manifest requirement for every G.xEvery pattern `G.x` in Part G SHALL include a short, explicit **Core linkage** section that is notation‑independent and id‑based.* Relations: `Builds on: G.Core`.* Solution: include a section named `G.x:<n> - G.Core linkage (normative)` that contains a `GCoreLinkageManifest` listing, at minimum: * `CoreConformanceProfileIds := { GCoreConformanceProfileId… }` *(preferred)* and/or `CoreConformanceIds := { CC‑GCORE‑… }` * `RSCRTriggerSetIds := { GCoreTriggerSetId… }` *(preferred)* and/or `RSCRTriggerKindIds := { RSCRTriggerKindId… }` * `CorePinSetIds := { GCorePinSetId… }` *(preferred)* and/or `CorePinsRequired := { … }` *(pins/refs surfaced by the kit; include policy‑id pins and edition pins when applicable; list only additions/overrides if pin sets are used)* * `DefaultsConsumed := { DefaultId… }` *(ids only; governing definition is resolved via `G.Core.DefaultGoverningDefinitionIndex`; cite governing definition, don’t restate)* * `TriggerAliasMapRef?` *(present or cited) if the pattern uses local trigger tokens***Nil‑elision (normative size rule).** Any field whose value is `∅` MAY be omitted; omission means `∅` and does not relax any obligation.**Expansion rule (normative).** If profile/set ids are used, the effective `CoreConformanceIds` / `RSCRTriggerKindIds` / `CorePinsRequired` are the unions of their expansions plus any explicitly listed ids (see `G.Core:4.2.2`, `G.Core:4.2.3`, and `G.Core:4.3.4.2`).##### G.Core:4.2.1 - GCoreLinkageManifest (canonical shape)`GCoreLinkageManifest` is the minimal, pattern‑local wiring manifest for citing `G.Core` without duplicating universal prose.A `G.x` MAY render the manifest as prose, a table, or structured notation, but the ids SHALL be recoverable by authoring review:`GCoreLinkageManifest := ⟨ CoreConformanceProfileIds?: {GCoreConformanceProfileId…}, CoreConformanceIds?: {CC‑GCORE‑…}, RSCRTriggerSetIds?: {GCoreTriggerSetId…}, RSCRTriggerKindIds?: {RSCRTriggerKindId…}, CorePinSetIds?: {GCorePinSetId…}, CorePinsRequired?: {…pin ids…}, DefaultsConsumed?: {DefaultId…}, TriggerAliasMapRef?: TriggerAliasMapRef⟩`##### G.Core:4.2.2 - GCoreConformanceProfileId catalogue (compression primitive)A `GCoreConformanceProfileId` is a stable identifier for a named set of `CC‑GCORE‑*` items. It exists solely to reduce repetition in `G.x` linkage sections (no new semantics).| GCoreConformanceProfileId | Expands to `CC‑GCORE‑*` (set) | Notes || --- | --- | --- || `GCoreConformanceProfileId.PartG.AuthoringBase` | `{CC‑GCORE‑CN‑CG‑1, CC‑GCORE‑CROSS‑1, CC‑GCORE‑PEN‑1, CC‑GCORE‑SET‑1, CC‑GCORE‑P2W‑1, CC‑GCORE‑DEF‑1, CC‑GCORE‑TRIG‑1, CC‑GCORE‑TRIG‑2, CC‑GCORE‑TRIG‑3, CC‑GCORE‑TRIG‑4, CC‑GCORE‑ID‑1, CC‑GCORE‑ID‑2, CC‑GCORE‑LINK‑1, CC‑GCORE‑LINK‑2}` | Default baseline for most Part‑G kits. || `GCoreConformanceProfileId.PartG.TriStateGuard` | `{CC‑GCORE‑GUARD‑1}` | Add when the kit defines/consumes eligibility/guard outcomes. || `GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted` | `{CC‑GCORE‑UTS‑1}` | Add when the kit mints/evolves public ids (UTS rows). || `GCoreConformanceProfileId.PartG.ShippingBoundary` | `{CC‑GCORE‑SKP‑1}` | Add when shipping boundaries are in scope for the kit. |##### G.Core:4.2.3 - GCorePinSetId catalogue (compression primitive)A `GCorePinSetId` is a stable identifier for a named set of commonly recurring **pin obligations** used in Part‑G kits. It exists solely to reduce repetition in `G.x` linkage sections (no new semantics).**Conditional pins (normative).** In pin‑set expansions below, a pin marked with `?` is **conditional**: it **MUST** be present iff the pattern actually uses the corresponding surface/artefact class; otherwise it MAY be omitted (nil‑elision permitted) and is treated as `∅`. A `G.x` MAY strengthen a conditional pin to unconditional by listing it explicitly in `CorePinsRequired`.| GCorePinSetId | Expands to `CorePinsRequired` (set) | Notes || --- | --- | --- || `GCorePinSetId.PartG.AuthoringMinimal` | `{CG-FrameContext, entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩, CNSpecRef.edition, CGSpecRef.edition}` | Baseline scope+spec pins for most Part‑G authoring kits (design‑time, citable, refreshable). || `GCorePinSetId.PartG.CrossingVisibilityPins` | `{BridgeId/BridgeCardId, BridgeMatrixId?, CL/CL^k/CL^plane, Φ/Ψ/Φ_plane policy-ids, CrossingBundleId?, UTSRowId[]?, PathId[]/PathSliceId[]?}` | Use when the kit asserts or consumes crossings (Bridge‑only + visible). Conditional pins cover “only if that bundle is used” cases (UTS publication, path‑citable evidence, explicit CrossingBundle reference). |#### G.Core:4.3 - RSCR Trigger Catalogue and docking discipline`G.Core` is the **single writer** for Part‑G‑wide trigger kinds.##### G.Core:4.3.1 - Definitions* **RSCRTriggerKindId** Canonical, stable identifier for a *trigger kind* (a class of “why RSCR/refresh must fire”). Cross-pattern reason code.* **RSCRTriggerAliasId** Pattern-scoped human label/token kept for ergonomics and alias continuity (e.g., `G.11:T4`, `G.6:H3:lane-tag correction`).* **TriggerAliasMap** Mapping table: `RSCRTriggerAliasId → {RSCRTriggerKindId…}` (1..n).* **RSCRTrigger** Minimal conceptual form (notation-independent):
Where `payloadPins` contains any edition pins, policy-ids, Bridge ids, evidence pins, regression-set ids, etc., required to make the trigger actionable.##### G.Core:4.3.2 - Governing-definition model* TriggerGoverningDefinition := `G.Core`.* Any new trigger kind SHALL be added to `G.Core` first.* Other patterns MAY define aliases only (or cite shared alias maps), and MUST map aliases to canonical kinds.##### G.Core:4.3.3 - Authoring rules* **No implicit triggers:**Any RSCR/SCR/refresh artefact that *records reasons* MUST record canonical `RSCRTriggerKindId`. Aliases may be recorded as labels, but must not be the only reason code.* **No implicit overloading:**A local token string (e.g., `T4`) SHALL NOT silently change meaning across patterns; namespace is part of the alias (`G.11:T4` ≠ `A.20:T4`).* **Granularity discipline:**If a local cause is narrower than an existing canonical kind, map it to that kind and keep the nuance as a local scope note. If the difference matters for planning/selection, add a new canonical kind.* **Multi-cause discipline:**When an event spans multiple canonical kinds, record multiple triggers (preferred) or map the alias to a set `{…}` and require emitting the full set.##### G.Core:4.3.4 - Seed canonical catalogue (Phase‑2 minimum)The Phase‑2 stabilized canonical catalogue (based on the Phase‑2 inventory; sufficient to dock deprecated `G.6:H3` and `G.11:T0…T7` trigger labels and to populate `RSCRTriggerKindIds` in `G.0…G.13`):* `RSCRTriggerKindId.LegalitySurfaceEdit`* `RSCRTriggerKindId.PenaltyPolicyEdit`* `RSCRTriggerKindId.CrossingBundleEdit`* `RSCRTriggerKindId.ReferencePlaneEdit`* `RSCRTriggerKindId.EditionPinChange`* `RSCRTriggerKindId.TokenizationOrNameChange`* `RSCRTriggerKindId.PolicyPinChange`* `RSCRTriggerKindId.TelemetryDelta`* `RSCRTriggerKindId.FreshnessOrDecayEvent`* `RSCRTriggerKindId.EvidenceSurfaceEdit`* `RSCRTriggerKindId.MaturityRungChange`* `RSCRTriggerKindId.BaselineBindingEdit`* `RSCRTriggerKindId.DefaultGoverningDefinitionChange`##### G.Core:4.3.4.1 - Canonical kind definitions (normative, minimal)Each `RSCRTriggerKindId` SHALL have a short, stable definition in `G.Core` (single-writer) to prevent semantic drift.| RSCRTriggerKindId | Minimal meaning (cause class) | Typical payload pins (non-exhaustive) || --- | --- | --- || `RSCRTriggerKindId.LegalitySurfaceEdit` | A legality surface changed (CG‑Spec: ComparatorSet/SCP/Γ_fold/MinimalEvidence, or equivalent legality inputs). | `CGSpecRef.edition`, `ComparatorSetRef.edition`, `SCPRef.edition`, `ΓFoldRef.edition` || `RSCRTriggerKindId.PenaltyPolicyEdit` | A penalty / Φ / Ψ / FailureBehavior / SoS‑LOG branch policy changed. | penalty policy ids, `Φ`/`Ψ` policy ids, SoS‑LOG branch id pins || `RSCRTriggerKindId.CrossingBundleEdit` | A crossing bundle changed (Bridge/CL routing, crossing-bundle registry cards, crossing policy pins), including `edition_key` changes of crossing‑relevant artefacts (BridgeCards, CrossingBundle registries, UTS rows for crossing artefacts). | `BridgeId/BridgeCardId`, `BridgeMatrixId?`, `CL*` ids, crossing policy ids, `UTSRowId[]`, `PathId/PathSliceId?` || `RSCRTriggerKindId.ReferencePlaneEdit` | ReferencePlane or plane-routing surface changed. | `ReferencePlaneId`, plane-policy ids || `RSCRTriggerKindId.EditionPinChange` | Any pinned edition relevant to downstream artifacts changed (including **`CNSpecRef.edition`**, `CGSpecRef.edition`, comparator/method/descriptor/distance/etc.). Crossing‑artefact edition_key changes are additionally classified as `CrossingBundleEdit` per multi‑cause discipline. | changed `*.edition` pins, affected `PathSliceId`s || `RSCRTriggerKindId.TokenizationOrNameChange` | A published tokenization / naming / alias surface changed in a way that can affect docking, citations, or dispatch (e.g., UTS Name Cards, twin labels, alias maps). | affected `UTSRowId[]`, `NameCardId[]`, alias ids / maps || `RSCRTriggerKindId.PolicyPinChange` | A policy-id pin used by characterization changed (selection, insertion, emission, routing, refresh policy, etc.). | policy ids (and other non-edition configuration pins when they are explicitly pinned) || `RSCRTriggerKindId.TelemetryDelta` | Telemetry inputs that influence refresh/selection changed (not merely display-only). | telemetry ids/refs, `Audit`-published pins || `RSCRTriggerKindId.FreshnessOrDecayEvent` | Time/freshness/decay conditions affecting validity changed (window shift, decay thresholds, freshness policy edits). | freshness window refs/ids, decay/freshness policy ids || `RSCRTriggerKindId.EvidenceSurfaceEdit` | Evidence graph / evidence surface changed in ways that affect admissibility/acceptance/comparison. | evidence pins, `EvidenceGraph` refs, affected `PathId`s || `RSCRTriggerKindId.MaturityRungChange` | Maturity rung/ladder state changed for relevant artifacts or paths. | maturity rung ids, affected scopes || `RSCRTriggerKindId.BaselineBindingEdit` | Planned baseline bindings changed (planned slot fillings / binding refs), requiring a re-run along the P2W path. | `SlotFillingsPlanItem` refs, planned pins, variance pins || `RSCRTriggerKindId.DefaultGoverningDefinitionChange` | The governing definition of a `DefaultId` (as recorded in `G.Core.DefaultGoverningDefinitionIndex`) changed, or a default row was added/deprecated. | affected `DefaultId.*`, old governing definition ref, new governing definition ref |##### G.Core:4.3.4.2 - Canonical trigger sets (compression primitive)`GCoreTriggerSetId` identifies a named set of `RSCRTriggerKindId` values. A `G.x` MAY cite trigger sets in `RSCRTriggerSetIds` instead of repeating long `RSCRTriggerKindIds` lists.| GCoreTriggerSetId | RSCRTriggerKindIds (set) | Notes || --- | --- | --- || `GCoreTriggerSetId.CGSpecGate` | `{RSCRTriggerKindId.LegalitySurfaceEdit, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.FreshnessOrDecayEvent}` | Covers CG‑Spec legality‑gate kits (e.g., [`G.0`](/generated/patterns/G.0)). || `GCoreTriggerSetId.SoTAHarvestSynthesis` | `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.TokenizationOrNameChange, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.LegalitySurfaceEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}` | Covers SoTA harvesting/synthesis packs (e.g., [`G.2`](/generated/patterns/G.2)). || `GCoreTriggerSetId.EvidenceGraphKit` | `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.FreshnessOrDecayEvent, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.MaturityRungChange, RSCRTriggerKindId.BaselineBindingEdit}` | Covers EvidenceGraph/SCR kits (e.g., [`G.6`](/generated/patterns/G.6)). || `GCoreTriggerSetId.BridgeCalibrationKit` | `{RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.FreshnessOrDecayEvent, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.BaselineBindingEdit}` | Covers bridge calibration/CL kits (e.g., [`G.7`](/generated/patterns/G.7)). || `GCoreTriggerSetId.RefreshOrchestration` | `{RSCRTriggerKindId.LegalitySurfaceEdit, RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent, RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.MaturityRungChange, RSCRTriggerKindId.BaselineBindingEdit}` | Covers refresh orchestration (e.g., [`G.11`](/generated/patterns/G.11)). |##### G.Core:4.3.5 - Initial alias mapsThese alias maps are normative docking artefacts and preserve deprecated alias labels while moving semantics to canonical ids.**TriggerAliasMap.G11**Based on the existing trigger catalogue in `G.11` (`T0…T7`).* `G.11:T0 → { RSCRTriggerKindId.PolicyPinChange }`* `G.11:T1 → { RSCRTriggerKindId.TelemetryDelta }`* `G.11:T2 → { RSCRTriggerKindId.EditionPinChange }`* `G.11:T3 → { RSCRTriggerKindId.EditionPinChange }`* `G.11:T4 → { RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.PenaltyPolicyEdit }`* `G.11:T5 → { RSCRTriggerKindId.FreshnessOrDecayEvent }`* `G.11:T6 → { RSCRTriggerKindId.MaturityRungChange }`* `G.11:T7 → { RSCRTriggerKindId.PolicyPinChange }`**TriggerAliasMap.G0 (reserved; empty in Phase‑2).**Map any stable deprecated registry-hook labels emitted/recorded by `G.0` to the canonical kinds above (typically `LegalitySurfaceEdit`, `PenaltyPolicyEdit`, `CrossingBundleEdit`, `ReferencePlaneEdit`, `TokenizationOrNameChange`), preserving the original label text as `RSCRTriggerAliasId`. If none exist, `G.0` SHOULD emit canonical `RSCRTriggerKindId` values directly.**TriggerAliasMap.G6**EvidenceGraph `H3` example causes → canonical kinds:* `G.6:H3:freshness/decay change → { RSCRTriggerKindId.FreshnessOrDecayEvent }`* `G.6:H3:Bridge CL/CL^k or loss update → { RSCRTriggerKindId.CrossingBundleEdit }`* `G.6:H3:Φ/Ψ policy change → { RSCRTriggerKindId.PenaltyPolicyEdit }`* `G.6:H3:lane tag correction → { RSCRTriggerKindId.EvidenceSurfaceEdit }`* `G.6:H3:ReferencePlane correction → { RSCRTriggerKindId.ReferencePlaneEdit }`* `G.6:H3:QD/OEE artefact updates (U.DescriptorMapRef.edition/DistanceDef, EmitterPolicyRef, InsertionPolicyRef, archive K-capacity) → { RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange }`#### G.Core:4.4 - Default Governing Definition Index`G.Core` provides an index of Part‑G defaults with **one governing definition** per `DefaultId`. The index is not a “second spec”; it is a cross-reference table that points to the *governing definition reference* (a CC item, policy‑id, or TaskSignature rule) and states applicability conditions.##### G.Core:4.4.1 - Definitions* **DefaultId**Stable identifier of a default (a default constant or default rule).* **DefaultGoverningDefinitionRef**A reference to the governing definition of the default (e.g., a CC item id like `CC‑G5.23`, or a policy id, or a TaskSignature rule definition).##### G.Core:4.4.2 - Rules* Exactly one governing definition per `DefaultId`.* Any other mention in `G.x` MUST be a citation/delegation to the governing definition, not a competing statement.* A default may be conditional (default-rule) with explicit applicability conditions.* The Default Governing Definition Index SHALL NOT be used to “smuggle” mandatory invariants as defaults. Invariants remain invariants (typically cited through `CC‑GCORE‑…` and their canonical governing definitions).##### G.Core:4.4.3 - Seed Default Governing-definition assignment entries (Phase‑2 minimum)| DefaultId | DefaultGoverningDefinitionRef | Notes || ------------------------------ | --------------------------------------------------------- | ----- || `DefaultId.PortfolioMode` | `CC‑G5.23` | Existing governing definition; other mentions delegate to it. || `DefaultId.DominanceRegime` | `CC‑G5.28` | Existing governing definition; other mentions delegate to it. || `DefaultId.GammaFoldForR_eff` | `CC‑G5.4` | Default Γ‑fold for `R_eff` is weakest‑link; overrides require explicit CAL support. |This table may grow over time; the rule is that the **governing definition must already be named** (or be intentionally set to `G.Core` when the default is truly Part‑G‑wide and not governed elsewhere). Any change in a row (add/remove/change governing definition) SHALL be treated as a refresh‑sensitive edit and recorded as `RSCRTriggerKindId.DefaultGoverningDefinitionChange` (payload: affected `DefaultId.*`, old governing definition ref, new governing definition ref).#### G.Core:4.5 - ID continuity protocol (Δ‑discipline)When moving universal norms out of `G.x` into `G.Core`:* existing public CC ids in `G.x` that may be referenced externally SHALL NOT be deleted or renamed;* such CC items SHALL become **delegation** items that point to the relevant `CC‑GCORE‑…` item(s);* each `G.x` SHALL add exactly one bridge CC item `CC‑Gx‑CoreRef` (first in its CC list) that makes linked `CC‑GCORE‑…` items mandatory for `G.x` conformance.Deprecated trigger labels (e.g., `G.11:T*`, `G.6:H3:*`) are preserved as aliases and MUST map to canonical trigger kinds.Non-CC public identifiers (e.g., `UTSRowId`, `RSCRTriggerAliasId`, deprecation notices, edition bumps) MUST obey the same Δ-discipline: preserve old ids; represent drift via alias/deprecation/edition evolution (see `F.17 (UTS)`); and emit canonical trigger kinds (`RSCRTriggerKindId.TokenizationOrNameChange`, `RSCRTriggerKindId.EditionPinChange`) when downstream impact is possible.#### G.Core:4.6 - Explicit non-goals`G.Core` does not:* introduce CG‑frame kit entities (e.g., BridgeMatrix/ReferencePlane/Φ registries); those remain in their governing `G.x`;* introduce method-family taxonomies, discipline packs, or generator orchestration mechanisms; those remain as `Extensions` in their governing definitions (e.g., synthesis/shipping/refresh patterns);* define refresh algorithms; it defines trigger kinds and docking only.---### G.Core:5 - Archetypal grounding**Tell.**In Phase‑2 refactoring, `G.Core` is the hub that allows each `G.x` to become structurally predictable: (a) a short, normative “Core linkage” slice, and (b) pattern‑scoped `Extensions`. Universal obligations cite canonical governing definitions such as `A.6.7`, `A.15.3`, `A.19`, `G.0`, and `A.19.CHR`, while RSCR trigger kinds and `DefaultGoverningDefinitionRef` references become typed and cite named definitions.**Show 1: Refresh triggers without semantic drift.**`G.11` already uses trigger tokens `T0…T7`. `G.Core` keeps them as aliases and maps them to canonical trigger kinds (e.g., `TelemetryDelta`, `EditionPinChange`, `CrossingBundleEdit`). This makes RSCR reason codes consistent across patterns and avoids re-explaining trigger semantics in every pattern.**Show 2: Resolving competing defaults.**If multiple patterns imply a default for `PortfolioMode`, the Default Governing Definition Index points to one governing definition (currently `CC‑G5.23`). Other patterns (e.g., bundles/log patterns) must cite that governing definition or delegate to it, rather than restating the default with slightly different wording. This preserves intent while preventing drift and ambiguity.### G.Core:6 - Bias-annotation (informative)* **Centralization bias:** One governing hub can become too thick. Mitigation: delegation-first citation; keep only true Part‑G invariants and typed indices here.* **Over-typing bias:** A trigger catalogue can become overly granular. Mitigation: granularity discipline + scope notes; only add new kinds when planning/selection needs it.* **Refactor rigidity bias:** Preserving IDs can feel cumbersome. Mitigation: delegation items preserve IDs while enabling deduplication.* **Default absolutism bias:** Defaults may require conditional rules. Mitigation: Default Governing Definition Index allows conditional default rules with explicit applicability conditions.* **Single-writer bias:** prefers single‑writer *authoring* for catalogs and explicit governing-definition tables.*Mitigation:* delegation-first citation; keep catalogs minimal; avoid “second specs”.* **Architectural bias:** centralizes invariants to prevent accidental coupling across `G.x`.*Mitigation:* keep core thin; force `Extensions` to remain pattern‑scoped.* **Ontological/epistemic bias:** enforces strict distinction between governing spec refs, kits, mechanisms, and orchestration.*Mitigation:* allow didactic scope notes while keeping normative surface id‑based.* **Pragmatic bias:** adds authoring overhead (linkage sections, alias maps).*Mitigation:* one small mandatory bridge CC item per pattern (`CC‑Gx‑CoreRef`) and short linkage slices only.* **Didactic bias:** risks “glossy hub prose” that hides missing CC coverage.*Mitigation:* enforce CC/Solution coherence ([E.19](/generated/patterns/E.19)) and keep invariants checkable via `CC‑GCORE‑…`.### G.Core:7 - Conformance checklist (normative) — CC‑GCOREConformance items are authoring obligations and are enforced transitively by `CC‑Gx‑CoreRef` in every `G.x`.| ConformanceId | Statement || -------------------- | --------- || **CC‑GCORE‑DEL‑1** | A conforming `G.Core` SHALL be delegation-first: if a norm is already governed by [`A.6.7`](/generated/patterns/A.6.7), [`A.15.3`](/generated/patterns/A.15.3), [`A.19`](/generated/patterns/A.19), [`G.0`](/generated/patterns/G.0), [`A.19.CHR`](/generated/patterns/A.19.CHR), or a relevant Part E pattern, `G.Core` cites that governing definition rather than duplicating semantics. || **CC‑GCORE‑CN‑CG‑1** | Any pattern in Part G that builds on `G.Core` SHALL cite `CN‑Spec` and `CG‑Spec` as the only spec-legality surfaces and SHALL NOT introduce shadow specs (incl. complying with `SuiteObligations.transport_declarative_only` and `SuiteObligations.cg_spec_cite_required_for_numeric_ops`). || **CC‑GCORE‑OBL‑1** | A conforming `G.Core` SHALL treat the obligation vocabulary in `A.6.7:4.2` as the canonical naming surface for Part‑G‑wide obligations and SHALL NOT introduce competing obligation names for the same norms. || **CC‑GCORE‑CROSS‑1** | A Part‑G pattern that introduces or consumes crossings SHALL enforce `SuiteObligations.bridge_only_crossings` and `SuiteObligations.crossing_visibility_required` (CrossingBundle per [E.18](/generated/patterns/E.18)); SHALL prohibit implicit crossings; SHALL treat `edition_key` changes on **crossing‑relevant artefacts** (Bridge/CL/CrossingBundle registries and UTS rows for crossing artefacts) as `RSCRTriggerKindId.CrossingBundleEdit` (and, when an edition pin is involved, also `RSCRTriggerKindId.EditionPinChange` per multi‑cause discipline); and SHALL cite `SuiteObligations.two_bridge_rule_for_described_entity_change` through its canonical governing definition. || **CC‑GCORE‑GUARD‑1** | A Part‑G pattern SHALL treat `GuardDecision := {pass|degrade|abstain}` as the only admissibility/eligibility decision domain (`SuiteObligations.guard_decision_tristate(pass|degrade|abstain)`); `unknown` SHALL NOT silently coerce to `pass` (`SuiteObligations.unknown_never_coerces_to_pass`); “sandbox/probe‑only” SHALL be expressed via SoS‑LOG branch pins (policy/FailureBehavior) (see [`C.23`](/generated/patterns/C.23)), not as an extra decision value. || **CC‑GCORE‑PEN‑1** | A Part‑G pattern SHALL route penalties/assurance loss to the **R lane (`R_eff`) only** (`SuiteObligations.penalties_route_to_r_eff_only`) and SHALL preserve **F/G invariants** under penalties (penalties do not alter legality/invariant lanes). || **CC‑GCORE‑SET‑1** | A Part‑G pattern SHALL preserve set-return semantics for partial orders and SHALL prohibit silent scalarization/totalization (`SuiteObligations.no_silent_scalarisation_of_partial_orders`, `SuiteObligations.no_silent_totalisation`); any scalar summary SHALL be report-only unless declared as a admissible comparator surface. || **CC‑GCORE‑SKP‑1** | A Part‑G pattern SHALL preserve the suite/kit/pack distinction ([A.19.CHR](/generated/patterns/A.19.CHR)) and SHALL keep shipping concerns governed by their canonical governing patterns (e.g., [G.10](/generated/patterns/G.10)) rather than embedding shipping semantics into unrelated kits or core invariants. || **CC‑GCORE‑P2W‑1** | A Part‑G pattern that uses planned baselines SHALL anchor them via `SlotFillingsPlanItem` in WorkPlanning (`SuiteObligations.planned_slot_filling_in_work_planning_only`) and SHALL finalize launch values only in WorkEnactment (`SuiteObligations.finalize_launch_values_in_work_enactment_only`); gate decisions remain separated per `SuiteObligations.gate_decision_separation`. || **CC‑GCORE‑LINK‑1** | Every conforming `G.x` SHALL satisfy `G.Core:4.2` by providing a `G.x:<n> - G.Core linkage (normative)` section containing a `GCoreLinkageManifest` (incl. either `CoreConformanceProfileIds` or `CoreConformanceIds`, either `RSCRTriggerSetIds` or `RSCRTriggerKindIds`, and either `CorePinSetIds` or `CorePinsRequired` (or both)). Nil‑elision is permitted for `∅` fields. || **CC‑GCORE‑LINK‑2** | Every conforming `G.x` SHALL include `CC‑Gx‑CoreRef` as the first checklist item; it SHALL make mandatory the effective `CoreConformanceIds` (including expansions of any `CoreConformanceProfileIds`) declared in the linkage manifest. || **CC‑GCORE‑UTS‑1** | If a Part‑G pattern mints, deprecates, or evolves any public identifier, it SHALL publish/update the corresponding UTS entries and cite them via `UTSRowId` pins, delegating UTS semantics (twin labels, alias/deprecation discipline, edition pins) to its canonical governing definition `F.17 (UTS)`. || **CC‑GCORE‑ID‑1** | When deduplicating, existing public CC ids in `G.x` SHALL NOT be deleted/renamed; they SHALL become delegation items to relevant `CC‑GCORE‑…` items. || **CC‑GCORE‑ID‑2** | Public id continuity applies beyond CC item ids: `UTSRowId` rows, `RSCRTriggerAliasId` tokens (e.g., `T0…T7`), deprecation notices, and edition bumps SHALL preserve prior ids and express drift via alias/deprecation/edition evolution (never by reusing/redefining an old id). When downstream behaviour can change, the change SHALL emit a canonical `RSCRTriggerKindId` (e.g., `TokenizationOrNameChange`, `EditionPinChange`). || **CC‑GCORE‑TRIG‑1** | A conforming `G.Core` SHALL define the canonical `RSCRTriggerKindId` catalogue and SHALL be its single writer. || **CC‑GCORE‑TRIG‑2** | Any `G.x` that uses local trigger tokens SHALL provide (or cite) a `TriggerAliasMap` mapping each alias to canonical `RSCRTriggerKindId`. || **CC‑GCORE‑TRIG‑3** | Any artefact that records RSCR/SCR/refresh reasons SHALL record canonical `RSCRTriggerKindId` (aliases may be recorded as labels only). || **CC‑GCORE‑TRIG‑4** | A conforming `G.Core` SHALL keep `TriggerAliasMap.*` consistent with the governing patterns’ deprecated trigger alias catalogues (e.g., `G.11:T*`). Any change to an alias mapping SHALL be treated as refresh‑sensitive; at minimum it SHALL be recorded/emitted as `RSCRTriggerKindId.TokenizationOrNameChange` (and, if the mapped trigger kinds change, the corresponding canonical kinds apply as well). || **CC‑GCORE‑DEF‑1** | A conforming `G.Core` SHALL maintain a Default Governing Definition Index for Part‑G defaults, ensuring each `DefaultId.*` names exactly one governing definition (a CC item or a policy id). All other patterns SHALL cite the governing definition and SHALL NOT state competing defaults. Any governing-definition change MUST be recorded as `RSCRTriggerKindId.DefaultGoverningDefinitionChange`. |### G.Core:8 - Common anti-patterns and how to avoid them* **Anti-pattern:** Restating CN‑Spec/CG‑Spec rules inside a `G.x` “for convenience”.**Avoid:** cite `A.19` and `G.0` through `CC‑GCORE‑CN‑CG‑1`.* **Anti-pattern:** Adding a fourth guard status (“unknown”, “maybe”, “probe-only”) as a separate decision value.**Avoid:** keep guard domain tri‑state; express “probe-only” as policy/branching and record via pins/audit.* **Anti-pattern:** Treating mandatory invariants as “defaults” to centralize them.**Avoid:** keep invariants as invariants (CC‑GCORE‑* cited through canonical governing definitions); restrict the Default Governing Definition Index to true defaults (constants or conditional default-rules).* **Anti-pattern:** Turning partial orders into scalar ranks silently.**Avoid:** keep set‑valued semantics unless a total order is explicitly declared by a comparator/policy.* **Anti-pattern:** Competing defaults scattered across multiple patterns.**Avoid:** Default Governing Definition Index; delegate duplicate statements to the one governing definition.* **Anti-pattern:** Local trigger tokens without canonical mapping.**Avoid:** provide/cite a `TriggerAliasMap` with namespace‑qualified aliases.* **Anti-pattern:** Breaking public CC ids during dedup.**Avoid:** convert to delegation items; preserve IDs.### G.Core:9 - Consequences* **Positive:** Part‑G‑wide invariants cite `G.Core` as their governing definition; refactors become safer and easier to audit.* **Positive:** RSCR becomes reason-code driven (typed triggers), improving traceability and preventing semantic drift.* **Positive:** Default conflicts become detectable and resolvable because each `DefaultId` names one governing definition.* **Negative:** Adds an extra authoring step (linkage sections and CoreRef CC item) to each `G.x`.* **Negative:** Requires careful governance of the trigger catalogue to avoid excessive fragmentation.### G.Core:10 - RationaleUniversalization of Part G requires a stable "gravity center" for invariants, otherwise each pattern becomes a competing governing source. Delegation-first citation prevents duplication and makes governing-definition assignment explicit, while typed trigger kinds and the Default Governing Definition Index turn historically prose-driven drift into checkable, id-based structure.### G.Core:11 - SoTA alignment (informative)Although FPF is conceptual (not a data governance framework), `G.Core` aligns Part‑G authoring with modern best practice patterns seen across post‑2015 work:* **Selective prediction / abstention** informs tri‑state guard discipline: abstaining or degrading is a first-class outcome, not an error coerced into a scalar.* **Set-valued / conformal methods** motivate set-return semantics: when comparability is partial or uncertainty is structural, returning sets/regions is often the SoTA-friendly representation.* **Multiobjective optimization and quality-diversity** reinforce declared set-result and `Archive` semantics instead of forced “best single scalar”.* **Monotone constrained modelling** (where used) supports “legality-first” scoring/aggregation: constraints and admissibility precede optimization, mirroring CG‑Spec gate discipline.* **Schema evolution and contract testing** motivate id-stable conformance points and typed trigger catalogues: stable identifiers + regression hooks are the practical mechanism for safe refactoring.### G.Core:12 - Relations* **Builds on:*** `E.8` pattern template and section discipline* `E.10` lexical/ontological rules (strict distinction; twin naming; kind‑suffix discipline)* `E.18` CrossingBundle (crossing visibility bundle)* `E.19` conformance discipline* `A.6.7` SuiteObligations + suite protocol pins (delegation support)* `A.15.3` SlotFillingsPlanItem (planned baseline anchor)* `A.19` CN‑Spec governance card* `G.0` CG‑Spec legality gate* `A.19.CHR` CHR suite boundary and "governance cards and legality gates are cited as pins, not copied locally" discipline* `C.23` SoS‑LOG (tri‑state branches; sandbox/probe‑only)* `F.17` UTS (identifier registry; alias/deprecation discipline)* `F.15` RSCR (regression/conformance loop)* **Used by:*** `G.0…G.13` patterns (each adds `Builds on: G.Core`, linkage section, CoreRef CC item)* **Constrains:*** Part‑G authoring: no shadow specs, no silent scalarization, tri‑state guards, penalties routing, typed RSCR causes, defaults with one governing definition, and ID‑continuity refactors.### G.Core:End## Frame Standard and Comparability Governance — CG‑Spec**Tag.** Architectural pattern (foundational Standard; constrains [G.1](/generated/patterns/G.1)–[G.5](/generated/patterns/G.5))**Stage.** *design-time* legality gate (establishes comparison legality & evidence minima; constrains run-time gates)**Primary output.** `CG‑Spec` — a notation-independent legality gate for a `CG‑Frame`, published to UTS (with explicit edition pins for downstream reproducibility and RSCR).**Primary hooks.** `USM.ScopeSlice(G)`, `entityOfConcern`, `SCP`, `MinimalEvidence`, `CNSpecRef`, `Γ‑fold`, `Φ(CL)` / `Φ_plane` policy pins, `UTS` publication (Name Cards + edition pins).**Non-duplication note.** Universal Part‑G invariants are governed by `G.Core` and are satisfied here **only via delegation** (`CC‑G0‑CoreRef` → `CC‑GCORE‑*`). Single‑governing definition CN/CG spec-ref discipline is enforced via `CC‑GCORE‑CN‑CG‑1` (no shadow specs; no competing defaults).### Problem frameA team defines or evolves a `CG‑Frame` (e.g., a frame for creativity measurement, decision quality, architecture trade‑offs, or selected-set publication). Downstream mechanisms ([G.1](/generated/patterns/G.1)–[G.5](/generated/patterns/G.5) and beyond) must compare, aggregate, and publish CHR‑typed observations in ways that are:* lawful with respect to measurement legality (scale/unit/polarity constraints),* auditable with explicit evidence minima and provenance,* reproducible via pinned editions and explicit policy ids,* portable only via explicit crossings (bridges and reference-plane moves), never via implicit semantic leakage.`CG‑Spec` is the single design-time object that fixes *what comparisons and aggregations are lawful in this frame*, under which pinned assumptions and minimal evidence requirements, so that run-time selection and publication can be audited without inventing new “local legality gates”.Didactic subtitle: **Design-time rules for safe, auditable comparison.**### ProblemWithout a single, frame-level legality standard:* comparisons and aggregations drift into *implicit assumptions* (hidden scalarisation; silent totalisation of partial orders),* numeric gates run on “whatever is available” rather than declared evidence minima and lane/carrier requirements,* cross-context reuse happens without explicit crossing visibility and stated losses,* selection outcomes become hard to audit because legality, evidence minima, and penalty routing are not pinned and traceable.### Forces* **Pluralism vs. comparability.** Multiple traditions must co-exist while allowing admissible comparison where justified.* **Expressiveness vs. safety.** Rich comparator sets and aggregators vs. measurement legality constraints.* **Locality vs. portability.** Context-local semantics first; portability only via explicit bridges and explicit losses.* **Assurance vs. agility.** Evidence minima must meet the claim threshold while staying light enough to adopt.* **Design-time vs. run-time.** Keep legality standards and templates design-time; run-time only cites and applies them.### Solution — CG‑Spec as the design-time legality gate`CG‑Spec` is a **notation-independent** UTS-published object that, for a given `CG‑Frame`, defines:* the **ComparatorSet** (explicit, finite, typed) permitted in this frame,* the **ScaleComplianceProfile** (SCP) that constrains lawful operations per characteristic,* **MinimalEvidence** requirements per characteristic (lanes, carriers, freshness windows, crossing allowances, failure behavior),* the frame’s **penalty and trust folding wiring** (by explicit policy ids and edition pins),* **AcceptanceStubs** as design-time templates (thresholds remain governed by CAL, not by CG‑Spec),* optional method-family hooks (e.g., illumination/QD or explore↔exploit guards) *as wiring only*, with semantics governed by the corresponding patterns.`CG‑Spec` constrains downstream gate checks by being *referenced and pinned*; it is not itself an admissibility mechanism.#### G.Core linkage (normative)**Builds on:** `G.Core` (Part-G core invariants; governing-pattern citation)**GCoreLinkageManifest (normative; size-controlled via profiles/sets).**Effective obligations/pins/triggers are computed by union expansion of the referenced ids (per `G.Core:4.2`).Profiles/sets + explicit deltas; `Nil‑elision` applies.* `CoreConformanceProfileIds :=`* `GCoreConformanceProfileId.PartG.AuthoringBase`* `GCoreConformanceProfileId.PartG.TriStateGuard`* `GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted`* `CorePinSetIds :=`* `GCorePinSetId.PartG.AuthoringMinimal`* `GCorePinSetId.PartG.CrossingVisibilityPins`* `CorePinsRequired :=` *(delta over PinSets)** `UTSRowId[]`* `ReferenceMap`* `ComparatorSetRef.edition`* `SCPRef.edition`* `ΓFoldRef.edition?`* `MinimalEvidenceRef.edition?`* `FailureBehaviorPolicyId?`* `DefaultsConsumed := {DefaultId.GammaFoldForR_eff}` *(governing definition: `CC‑G5.4` per `G.Core.DefaultGoverningDefinitionIndex`)** `RSCRTriggerSetIds := {GCoreTriggerSetId.CGSpecGate}`* `RSCRTriggerKindIds :=` *(delta over TriggerSets)** `RSCRTriggerKindId.EvidenceSurfaceEdit`* `RSCRTriggerKindId.TokenizationOrNameChange`* `RSCRTriggerKindId.DefaultGoverningDefinitionChange`* `TriggerAliasMapRef := ∅`#### CG‑Spec object model (normative)`CG‑Spec` is authored per `CG‑Frame`. It SHALL:* be **published to UTS** as a notation-independent object,* reference CHR characteristics by id (measurement semantics remain governed by CHR packs),* constrain what comparisons and aggregations are lawful in this frame via explicit comparator specs and SCP bindings,* declare minimal evidence gates per characteristic, including explicit failure behavior wiring,* cite `CN‑Spec` for normalization/comparability policies (no duplication and no shadow specs),* publish edition pins and policy ids so downstream selection, parity, shipping, and refresh can be reproducible and RSCR-aware.#### CG‑Spec conceptual model (normative)
RSCR := ⟨
RSCRTestId[]?, // SHOULD cover: illegal_op_refusals; unit and scale legality checks; freshness windows; // partial-order scalarisation refusals; threshold semantics; CL→R_eff routing;
// and refusal of degrade.order on unit mismatches (MM‑CHR).
RSCRTriggerKindId[]
⟩,
**Local typing notes (non-exhaustive; normative intent but no shadow specs).*** `ComparatorSpec` MUST be typed against SCP/CHR constraints. Examples of lawful comparators are frame-local choices and are authored here (e.g., dominance where lawful; lexicographic over typed traits; medoid/median for ordinal where lawful; explicit weighted sums only where legality is proven and units are aligned).* `MinimalEvidenceEntry` MUST declare: lane requirements, evidence carriers, freshness window (if any), and explicit failure behavior wiring. The semantics of `{pass|degrade|abstain}` and `degrade(mode=…)` are delegated to `G.Core`.#### Interfaces (normative)| Interface | Consumes | Produces / constrains || ------------------ | ------------------------------------ | -------------------------------------------------------------------------- || **[G.0](/generated/patterns/G.0)‑1 Charter** | CG‑Frame brief, USM scope signals | `CG‑Spec.Scope`, `entityOfConcern`, `ReferenceMap` || **[G.0](/generated/patterns/G.0)‑2 SCP** | CHR pack refs ([G.3](/generated/patterns/G.3)), legality proofs | `CG‑Spec.SCP` + bindings to lawful operators/aggregators || **[G.0](/generated/patterns/G.0)‑3 Evidence** | SoTA inputs ([G.2](/generated/patterns/G.2)), carriers ([A.10](/generated/patterns/A.10)) | `CG‑Spec.MinimalEvidence`, `Γ‑fold` segment pins, `CL‑Routing`, `Φ` ids || **[G.0](/generated/patterns/G.0)‑4 Publish** | All above | Versioned `CG‑Spec@UTS` plus Name Cards, public-id continuity records, and RSCR tests and trigger kinds || **[G.0](/generated/patterns/G.0)‑5 Expose_CrossingHooks** | `CG‑Spec` + crossing/plane/policy pins | GateCrossing inputs for `GateChecks` (`E.18/A.21`): plane checks, lane purity, lexical SD pins || **→ [G.1](/generated/patterns/G.1)** | `CG‑Spec` | Generator guardrails (Comparator/SCP/MinEv pins); degrade/abstain wiring || **→ [G.2](/generated/patterns/G.2)** | `CG‑Spec` | Harvesting inclusion/exclusion and crossing policy constraints || **→ [G.3](/generated/patterns/G.3)** | `CG‑Spec` | Required CHR characteristics/scales/operators to exist || **→ [G.4](/generated/patterns/G.4)** | `CG‑Spec` | Acceptance templates; evidence minima; Γ‑fold override proof hooks || **→ [G.5](/generated/patterns/G.5)** | `CG‑Spec` | Eligibility gates and explainability pins (Path/UTS/policy ids) || **→ [G.6](/generated/patterns/G.6)** | `CG‑Spec` | EvidenceGraph/SCR pinning surface (policy ids + Path/PathSlice discipline) |#### CG‑Spec authoring chassis (informative)1. **Charter the frame.** Declare `Context`, `Scope`, `entityOfConcern`, boundary examples/non-examples, and `ReferenceMap`.2. **Draft ComparatorSet and SCP.** Enumerate permitted comparator forms and bind each to CHR characteristics and legality constraints (scale/unit/polarity discipline). Attach guard bindings as explicit references/pins.3. **Bind Characteristics.** Ensure every compared quantity is a CHR characteristic id (reuse/mint via UTS discipline).4. **Declare MinimalEvidence.** For each characteristic: required lanes/carriers, freshness window, crossing allowances (if any), and explicit failure behavior wiring (tri-state semantics delegated to `G.Core`).5. **Pin trust folding and penalties.** Cite the one governing definition for `DefaultId.GammaFoldForR_eff` unless explicitly overridden with proof refs; publish `Φ`/CL policy ids explicitly.6. **Publish and register regression tests.** Publish `CG‑Spec@UTS` with edition-pinned segments; register RSCR tests for the frame’s legality surfaces and evidence minima.7. **Public-id continuity and refresh readiness.** Declare refresh cadence and deprecations with lexical continuity notes; ensure RSCR trigger kinds are emitted as canonical ids.#### Extensions (pattern-scoped; non-core)All blocks below are `GPatternExtension` modules (PatternScopeId; not new PatternIds). They store wiring only and cite governing patterns.**GPatternExtension: SpecRefSurfaces*** **PatternScopeId:** `G.0:Ext.SpecRefSurfaces`* **GPatternExtensionId:** `SpecRefSurfaces`* **GPatternExtensionKind:** `InteropSpecific`* **GoverningPatternId:** `A.19`* **Uses:** `{A.19}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `CNSpecRef.edition` (and any CN-side policy ids referenced by `CG‑Spec` fields)* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.LegalitySurfaceEdit}`* **Notes (wiring-only):** `CG‑Spec` SHALL cite CN‑Spec; it SHALL NOT restate normalization/comparability semantics.**GPatternExtension: BridgeAndCLWiring*** **PatternScopeId:** `G.0:Ext.BridgeAndCLWiring`* **GPatternExtensionId:** `BridgeAndCLWiring`* **GPatternExtensionKind:** `InteropSpecific`* **GoverningPatternId:** `F.9`* **Uses:** `{F.9, G.7}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `BridgeCardId/BridgeId` (when crossings are permitted) * `CL` / `CL^k` and `Φ`/`Φ_plane` policy ids (when penalties are in play)* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.ReferencePlaneEdit}`* **Notes (wiring-only):** Crossing semantics and penalty routing are delegated to `G.Core`; this module only lists the required pins used by `CG‑Spec` entries.**GPatternExtension: SoTAPaletteInputs*** **PatternScopeId:** `G.0:Ext.SoTAPaletteInputs`* **GPatternExtensionId:** `SoTAPaletteInputs`* **GPatternExtensionKind:** `DisciplineSpecific`* **GoverningPatternId:** `G.2`* **Uses:** `{G.2}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `SoTA-Pack@CG‑Frame` refs used to justify comparator admissibility, evidence minima, and crossing allowances (e.g., claim sheets, operator inventory, bridge matrix ids)* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.FreshnessOrDecayEvent}`* **Notes (wiring-only):** Any SoTA palette/tradition semantics are governed by `G.2`. `G.0` only requires that `CG‑Spec` entries cite the needed SoTA artefacts for auditability.**GPatternExtension: QDAndExplorationHooks*** **PatternScopeId:** `G.0:Ext.QDAndExplorationHooks`* **GPatternExtensionId:** `QDAndExplorationHooks`* **GPatternExtensionKind:** `MethodSpecific`* **GoverningPatternId:** `C.18`* **Uses:** `{C.18, C.19, C.23}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `DescriptorMapRef.edition?`, `DistanceDefRef.edition?`, `InsertionPolicyRef?` * `FailureBehaviorPolicyId` / SoS‑LOG branch policy id when `degrade(mode=…)` is used* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`* **Notes (wiring-only):** `CG‑Spec` may declare optional QD/exploration hooks; semantics remain governed by the referenced method patterns.### Archetypal Grounding — Tell–Show–Show; System / Episteme#### Archetype 1: System comparability under mixed evidence and unit constraints**Tell.** Two labs compare energy efficiency results of a physical system where measurements use different rigs and units, and some evidence is missing.**Show (failure without CG‑Spec).** The team averages an ordinal safety rating, mixes units (“kWh” vs “MJ”), and silently treats missing lanes as zeros. Cross-lab reuse happens without explicit bridge and loss notes, so selection becomes a black box.**Show (repair with CG‑Spec).** A conformant `CG‑Spec`:* pins the lawful comparator(s) (e.g., unit-aligned ratio comparisons only; ordinal comparisons are order-only),* declares `MinimalEvidence` lanes/carriers and freshness windows per characteristic,* declares explicit failure behavior wiring (tri-state semantics delegated to `G.Core`),* exposes crossing pins (bridge ids + CL/policy ids) when reuse across rigs is attempted,* publishes the pinned editions so parity/refresh can detect drift.#### Archetype 2: Epistemic comparability for selected-set publication across traditions**Tell.** A team selects an R&D set using multiple evaluation traditions: safety assurance, cost models, and readiness heuristics.**Show (failure without CG‑Spec).** The team collapses partial orders into a single score, hides the threshold policy in code, and cannot explain why cross-tradition penalties changed between runs.**Show (repair with CG‑Spec).** A conformant `CG‑Spec`:* defines a comparator bundle (e.g., Pareto dominance + explicit lexicographic tiebreaks where lawful),* pins `CNSpecRef.edition` and the editioned segments (`ComparatorSetRef.edition`, `SCPRef.edition`, `MinimalEvidenceRef.edition`),* makes `AcceptanceStubs` explicit as templates while locating thresholds in CAL ([G.4](/generated/patterns/G.4)),* ensures RSCR triggers are emitted when comparator or policy pins change.### Bias-Annotation`CG‑Spec` can encode (and therefore amplify) biases if authored carelessly:* **Tradition favoritism.** Comparator choices may privilege a tradition’s evidence style; mitigation: require explicit evidence minima and explicit crossing costs, and keep cross-tradition aggregation gated by explicit justifications.* **Metric gaming and Goodhart effects.** Overemphasis on a single scalar can lead to gaming; mitigation: preserve set-return semantics and require explicit, auditable scalarisations when they are lawful and intended.* **Hidden thresholds and opaque safety policy.** Embedding acceptance thresholds in prose or code hides value judgments; mitigation: keep thresholds in CAL acceptance clauses and pin policy ids.* **Scope creep.** Comparisons leak across entityOfConcern or reference planes; mitigation: require explicit `entityOfConcern` and `ReferencePlane` pins and treat plane moves as explicit crossing events.### Conformance Checklist (normative)| ConformanceId | Statement || --- | --- || **CC‑G0‑CoreRef** | [`G.0`](/generated/patterns/G.0) is conformant only if the applicable core obligations listed in `G.0:4.1` are satisfied (delegation to `CC‑GCORE‑*`; no shadow specs, no competing defaults, typed RSCR triggers, explicit pins). || CC‑G0‑01 | `CG‑Spec` is published as a notation-independent UTS object with explicit `Edition`, `Context`, `Scope`, `entityOfConcern`, and a minimum `ReferenceMap`. || CC‑G0‑02 | `CNSpecRef.edition` is present and is treated as an external governance-card reference (no local redefinition of CN semantics). *(Delegation target: `CC‑GCORE‑CN‑CG‑1`.)* || CC‑G0‑03 | `ComparatorSet` is explicit and finite; each comparator is typed and bound to `SCP` and referenced CHR characteristics; **anything not enumerated MUST be treated as illegal/abstain by default** (no implicit comparator defaults). || CC‑G0‑04 | `SCP` declares, per characteristic, the lawful operation regime needed for each referenced comparator (scale/unit/polarity constraints and any required proofs/refs). || CC‑G0‑05 | `MinimalEvidence` is declared per characteristic and includes explicit lane/carrier requirements, freshness window references (if any), and explicit failure behavior wiring (tri-state semantics delegated). If freshness windows are used, a stable window id (e.g., `PathSliceId`) MUST be pinned for audit. || CC‑G0‑06 | `Γ‑fold` is present as an edition-pinned segment and either (i) cites `DefaultId.GammaFoldForR_eff` (one governing definition) or (ii) provides an explicit override with proof refs. || CC‑G0‑07 | If crossing penalties are used, `CL‑Routing` and `Φ` policy ids are explicit and auditable (policy ids are exposed as pins/refs) **and are required pins for downstream SCR publication on penalised claims** (see [`G.6`](/generated/patterns/G.6)). || CC‑G0‑08 | `AcceptanceStubs` in `CG‑Spec` are templates only; any context-local thresholds/acceptance policies are governed by CAL acceptance artefacts ([G.4](/generated/patterns/G.4)) and are cited, not duplicated. || CC‑G0‑09 | RSCR tests and triggers for edits to legality surfaces and evidence minima are present and use canonical `RSCRTriggerKindId`s. The RSCR test set SHOULD cover at least: illegal_op_refusals; unit and scale legality checks; freshness windows; partial-order scalarisation refusals; threshold semantics; CL→`R_eff` routing; refusal of `degrade.order` on unit mismatches (MM‑CHR). || CC‑G0‑10 | `PublicIdContinuity` is declared: governing definition, DRR link, refresh cadence, decay and aging policy, and deprecations. Deprecations preserve lexical continuity (Δ-discipline; delegated to `CC‑GCORE‑ID‑*`). || CC‑G0‑11 | *(Conditional)* If `Illumination` / QD hooks are present, `DescriptorMapRef.edition`, `DistanceDefRef.edition`, and any `InsertionPolicyRef` / promotion policy ids are pinned (or explicitly marked absent) and are recorded in provenance/audit pins. || CC‑G0‑12 | *(Conditional)* If freshness windows influence gating/selection, they are published and enforced, and the relevant window ids (`PathSliceId` or equivalent) are recorded in SCR/audit pins. || CC‑G0‑13 | **Pre-flight numeric gates.** Any numeric comparison/aggregation declared in `ComparatorSet` has associated `GateChecks` for unit legality, scale legality, pinned SOP/editions, and declared comparability assumptions; failing any check yields `refuse` or `abstain` (tri-state semantics delegated). || CC‑G0‑14 | **GateCrossing hook exposure.** Exports provide `Expose_CrossingHooks` inputs so `GateChecks` (`E.18/A.21`) can validate plane consistency, crossing intent, lane purity, and lexical SD; failures MUST block publication. || **CC‑G0‑Φ** | `Φ(CL)` (and `Φ_plane`, if used) is monotone, bounded, and table-backed; policy ids are published; construction preserves `R_eff ≥ 0`. || **CC‑G0‑Unknowns** | *Delegated.* Unknown handling MUST follow the tri-state guard semantics `{pass|degrade|abstain}` with no silent coercions. (See `CC‑GCORE‑GUARD‑1`.) || **CC‑G0‑CSLC** | Scale/unit/polarity legality MUST be proven before any aggregation; illegal arithmetic on ordinal/nominal values is nonconformant. (Governed by the relevant legality patterns; [`G.0`](/generated/patterns/G.0) only binds and cites.) |### Common Anti-Patterns and How to Avoid Them* **Anti-pattern: shadow legality gates in downstream code.** Avoid by requiring downstream to cite `CG‑Spec` segments by id+edition.* **Anti-pattern: “one number to rule them all”.** Avoid by preserving set-return outputs when only partial orders are lawful; any scalarisation must be explicit, typed, and justified.* **Anti-pattern: thresholds inside CG‑Spec or CHR.** Avoid by keeping thresholds and acceptance logic in CAL and citing from `CG‑Spec` only via stubs/templates.* **Anti-pattern: implicit crossings.** Avoid by requiring explicit bridge ids, CL/policy ids, and reference-plane pins.### Consequences* **Lawful comparability.** The frame declares exactly what can be compared/aggregated and under what constraints.* **Auditable selection.** Downstream selectors can justify outcomes via pinned legality surfaces and explicit evidence minima.* **Explicit portability costs.** Cross-context reuse becomes deliberate and costed via visible crossings and penalties.* **Lower drift under evolution.** Edition pinning + typed RSCR triggers makes comparability drift detectable and refreshable.### Rationale`CG‑Spec` centralises frame-level comparability constraints so that:* CHR authorship ([G.3](/generated/patterns/G.3)) remains about *measurement meaning* rather than implicit thresholds,* CAL ([G.4](/generated/patterns/G.4)) governs context-local acceptance/threshold policies and proof ledgers,* selectors and dispatchers ([G.5](/generated/patterns/G.5)) remain policy-governed and auditable rather than encoding hidden legality assumptions,* refresh ([G.11](/generated/patterns/G.11)) can treat legality edits and pin changes as explicit causes with canonical trigger ids.### SoTA‑EchoingThis pattern aligns with post‑2015 best practice in evaluation and governance by:* treating “abstain / defer” as a first-class outcome rather than forcing a single brittle scalar (cf. selective prediction / abstention and set-valued reporting practices),* preserving multiobjective / partial-order outputs as sets (Pareto / archive thinking) rather than silently collapsing to a scalar,* emphasising reproducibility via explicit versioning/pinning of evaluation surfaces (editions) and explicit policy identifiers,* making evidence minima explicit and auditable (a conceptual analogue of modern reproducibility/robustness checklists and evaluation protocols),* keeping method-family specifics modular (e.g., QD/archives, open-ended exploration budgets) via explicit wiring to governing patterns rather than embedding method semantics into the universal legality gate.### Relations**Builds on:** `G.Core`, `A.19 (CN‑Spec)`, `A.10 (evidence carriers)`, `A.17–A.19 / C.16 (MM‑CHR legality)`, `A.18 (CSLC)`, `B.3 (trust / Γ‑fold family)`, `F.* (contexts, bridges, CL, UTS)`, `E.10 (lexical rules)`, `E.5.* (notation independence discipline)`.**Used by:** `G.1` (generator guards), `G.2` (harvesting constraints), `G.3` (required CHR), `G.4` (acceptance templates / proof hooks), `G.5` (eligibility gates), `G.6` (evidence/pin surfaces), and downstream parity/shipping/refresh where `CG‑Spec` is pinned.**Publishes to:** `UTS` (Name Cards + editioned `CG‑Spec` segments).### G.0:End## CG‑Frame‑Ready Generator**Tag.** architectural pattern; *generator chassis* (design‑time kit / authoring scaffold)**Status.** stable (Phase‑2 universalisation)**Normativity.** normative, except sections explicitly marked *informative***Stage.** *design‑time* authoring of a generator‑kit with a *run‑time* execution façade (policy‑governed; edition‑aware)**Primary output.** the **six‑card chassis** `M1…M6` published as a **complete, reusable CG‑Frame kit**, plus a versioned **kit manifest** `CGKitId` that binds the six cards as a single reusable unit (view‑friendly inventory + wiring surface)**Primary hooks.** see **§12 Relations** (notably `G.Core`, `G.0`, `G.2`, `G.5`, `G.10`, `G.11`)**Working‑model first (informative).** prefer working models and didactic micro‑examples; escalate to formal harnesses only when risk warrants (per [E.8](/generated/patterns/E.8)).**Non‑duplication note.** Universal Part‑G invariants (tri‑state guard, set-return, penalties→`R_eff`‑only, crossing visibility, typed RSCR triggers, Default Governing Definition Index, P2W split, linkage discipline, shipping boundary) are governed in `G.Core` and are **only cited** here.**Start here when.** You are authoring a reusable generator, selector, or set-result scaffold rather than a one-off plan, one-off comparison, or tool-specific method recipe.**First output.** The six-card chassis `M1…M6` published as a reusable `CGKitId`-bound kit with a scope anchor, local SoTA set, variant pool, shortlist surface, and refresh-ready wiring.**Neighboring FPF patterns.** Use `G.2` for the local SoTA set, `G.5` for governed set-return selection, `G.10` for shipping surfaces, `G.11` for refresh wiring, and `F.17` when the result must also land on a human-facing UTS surface.**Common wrong neighboring-pattern changes.** If the real entry load is only a one-off governed comparison or shortlist, use `A.19`, `G.0`, or `G.5`; if the real entry load is project alignment rather than kit authoring, use `A.15`; if tooling choice is being treated as the first kit candidate, keep the case here only after the chassis and its bindings are explicit.### Problem frameYou are authoring a **CG‑Frame** and want a **repeatable scaffold** that connects:* a declared **scope anchor** (`CG‑FrameContext`, `entityOfConcern`, governing spec refs),* a **local SoTA set** (scoped and provenance‑anchored),* a **variant pool** (candidate ideas / decision options / method variants),* a **shortlist** (a set-result outcome, not a forced singleton),* **publication‑ready bindings** into Part‑F artefacts (UTS rows, Name Cards, RSCR tests, worked examples),* and **refresh readiness** (telemetry hooks + RSCR wiring) without redefining refresh or shipping.This pattern is intentionally **a chassis**, not a method specification:* harvesting semantics are governed by `G.2`,* selection/dispatch semantics are governed by `G.5`,* CHR/CAL payload semantics are governed by `G.3` / `G.4`,* shipping semantics are governed by `G.10`,* refresh orchestration governing definition is `G.11`.### ProblemWithout a chassis, CG‑Frame authoring tends to fail in repeatable ways:* **SoTA is not locally scoped**: inputs are “in the air”, not a reconstructible set.* **Generation is ad‑hoc**: variant candidates are emitted without a stable trace of why/when/how.* **Selection is opaque**: eligibility/acceptance and assurance are not pinned to explicit surfaces.* **Outputs don’t land in reusable surfaces**: no clean hand‑off into UTS / RoleDescription / Concept‑Sets / RSCR.* **No kit‑level snapshot**: the scaffold lacks a versioned manifest, so downstream can’t reliably cite “which chassis edition” was used.* **Refresh is unplanned**: there is no canonical wiring from edits/telemetry/decay to RSCR causes along the P2W path.### Forces* **Breadth vs. precision:** harvest wide enough to avoid local dogma, but keep the artefact actionable.* **Generativity vs. assurance:** encourage novelty while keeping evidence, legality, and trust inspectable.* **Local meaning vs. portability:** keep meaning local by default; crossing must be explicit and auditable.* **Expressiveness vs. parsimony:** resist inventing new types/slots; prefer reuse and explicit wiring.* **Stability vs. evolution:** keep stable IDs and pins while allowing SoTA, policies, and editions to evolve.* **Didactic clarity vs. normative minimalism:** authors need a concrete scaffold, but universal invariants must not be duplicated outside `G.Core`.### Solution#### G.Core linkage (normative)
// Prefer sets; use deltas for pattern‑specific additions.
RSCRTriggerSetIds := { GCoreTriggerSetId.SoTAHarvestSynthesis },
RSCRTriggerKindIds := { RSCRTriggerKindId.BaselineBindingEdit },
// Kit identifiers governed by this pattern (the “six cards”).
CorePinsRequired := {
SoTAPaletteDescriptionId,
SoTA_SetId,
VariantPoolId,
ShortlistId,
CGFrameLibraryId,
RefreshReadinessCardId,
CGKitId,
// Local pointer-map surface for vocabulary + observables-to-CHR anchoring.// (May cite `G.0:CG‑Spec.ReferenceMap`; do not duplicate semantics.)ReferenceMap,// RSCR regression tests used by the chassis (if any).RSCRTestId[]?,// When the chassis is bound into WorkPlanning (P2W): planned baseline refs.SlotFillingsPlanItemRef[]?
**Citation rule (normative):** `CC‑GCORE‑*`, `RSCRTriggerKindId.*`, and `DefaultId.*` semantics are governed by their canonical definitions: primarily `G.Core`, and for the defaults above the definitions listed in `G.Core.DefaultGoverningDefinitionIndex`. `[G.1](/generated/patterns/G.1)` MUST NOT restate or redefine those semantics.#### Six‑module generator chassis (normative)**Core artefact:** `CGFrameReadyGeneratorKit := ⟨M1, M2, M3, M4, M5, M6⟩`, where each `Mi` is a **card** with an explicit I/O surface and stable identifiers.`CGKitId` identifies the versioned **kit manifest** (`CG‑Kit@CG‑Frame`) that lists the six card ids and the minimal wiring pins needed to treat the chassis as a reusable unit (this is **not** a shipping pack; shipping remains governed by `G.10`).The chassis is *view‑friendly*: it is an inventory of “what exists and how it is wired”, not a second specification of CN/CG/CHR/CAL/selection semantics.##### M1 — CG‑FrameContext Card (scope anchor)**Governs (kit surface):*** `CG‑FrameContext` and its **binding pins**: * `entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩` *(pin set: `PartG.AuthoringMinimal`)* * `CNSpecRef.edition`, `CGSpecRef.edition` *(pin set: `PartG.AuthoringMinimal`)* * `ReferenceMap` *(cite `G.0:CG‑Spec.ReferenceMap`; do not duplicate semantics)* * any declared crossing/policy pins *(pin set: `PartG.CrossingVisibilityPins`)***Purpose:** provide the *single scope anchor* used by all downstream cards.**Notes:** any spec-legality content is **cited** via `A.19 (CN‑Spec)` and `G.0 (CG‑Spec)` (delegation target: `CC‑GCORE‑CN‑CG‑1` via `CC‑G1‑CoreRef`); this card does not introduce a local “mini‑spec”.##### M2 — SoTA_Set@CG‑Frame (harvester output card)**Governs (kit surface):*** `SoTAPaletteDescriptionId` and `SoTA_SetId` bound to `CG‑FrameContext`* explicit provenance anchors for the set (via `A.10`), and any published UTS stubs/rows when applicable**Governing pattern:** harvesting discipline and SoTA-pack payload are governed by `G.2`.In `G.1`, M2 is a *slot in the chassis* and a wiring surface; it does not redefine the harvesting method.##### M3 — VariantPool (candidate inventory + emitter trace)**Governs (kit surface):*** `VariantPoolId` bound to `CG‑FrameContext`* per‑candidate minimal traceability fields (emitter identity, `EmitterPolicyRef` (policy‑id/ref; defined by the governing pattern), method/generator refs when declared, edition pins, provenance anchors)* optional, per‑candidate **assurance preview pointers** (e.g., `PathSliceId?` and/or `SCRId?` when early assurance is recorded) and optional **QD/Open‑Ended scaffolding stubs** (only when introduced by explicit `GPatternExtension` blocks)**Guardrails (via G.Core):*** tri‑state eligibility handling, penalties routing, crossing visibility, and set‑return constraints are not defined here; they are enforced via `G.Core` conformance.**Governing pattern for method payload:** method‑specific emitter semantics are governed by `Extensions` (e.g., `C.17`, `C.18`, `C.19`).M3 MUST remain method‑agnostic in its core definition: it is an inventory surface, not an algorithm spec.##### M4 — Shortlist (selector/assurer output)**Governs (kit surface):*** `ShortlistId` bound to `CG‑FrameContext`* a selected set of candidates plus rationale and assurance records (`SCRId` required; `DRRId` optional; cite `PathId/PathSliceId` when applicable)* optional **front metadata or archive metadata** needed for reproducibility when used: ε‑front parameters and/or archive snapshot hooks, with governing-definition assignment through `G.5` / `C.18` / `C.19` (no local semantics in `G.1`)**Governing pattern:** selection/dispatch semantics are governed by `G.5`.M4 MUST preserve *set‑return semantics* (as governed by `G.Core`) and MUST NOT hard‑code a forced singleton outcome.##### M5 — CG‑FrameLibrary (published bindings index)**Governs (kit surface):*** `CGFrameLibraryId` bound to `CG‑FrameContext`* an index of referenced CG‑Frame artefacts ready for reuse: * CHR/CAL/LOG bundles (by their ids; semantics governed by `G.3`, `G.4`, `G.8`) * published identifiers (UTS rows, Name Cards) per Part‑F governing definitions * additional Part‑F binding surfaces (e.g., RoleDescription templates, Concept‑Set rows) by governing definition‑ids only * RSCR test identifiers (e.g., from `F.15`) and worked examples (where applicable)**Boundary:** M5 is a **kit/library surface**, not shipping. If a shipped pack is needed, governing-definition assignment is `G.10`.##### M6 — RefreshReadiness Card (telemetry hooks + wiring)**Governs (kit surface):*** `RefreshReadinessCardId` bound to `CGFrameLibraryId` (and thus to `CG‑FrameContext`)* `CGKitId` (the versioned kit manifest) binding `M1…M6` into a single reusable unit; it MUST enumerate the card ids and MAY carry references to deprecations/edition bumps minted by the canonical governing definitions* declared telemetry hooks (what signals are observed, with what pins)* declared RSCR wiring: which `RSCRTriggerKindId` are relevant (canonical ids), with minimal required payload pins (including `SlotFillingsPlanItemRef[]` when the chassis is bound into WorkPlanning)**Boundary:** orchestration semantics are governed by `G.11`.M6 prepares *refresh‑readiness metadata* and wiring stubs; it does not define scheduling/priority heuristics.#### Minimal I/O surface (normative)| Module | Consumes | Produces || ------ | --------------------------------------------------------------------------- | -------------------------------------------------------------------------------------- || M1 | CG‑Frame brief + `entityOfConcern` + `CNSpecRef/CGSpecRef` (edition‑pinned) | `CG‑FrameContext` + context pins || M2 | discovery inputs + inclusion criteria *(via [G.2](/generated/patterns/G.2))* | `SoTA_SetId` (+ provenance anchors; optional UTS stubs/rows) || M3 | `SoTA_SetId` + local constraints + emitter policy pins *(via Extensions)* | `VariantPoolId` (+ candidate trace/provenance; optional method payload via Extensions) || M4 | `VariantPoolId` + acceptance/eligibility surfaces *(via [G.4](/generated/patterns/G.4)/[G.5](/generated/patterns/G.5))* | `ShortlistId` (selected set / set-result) + rationale refs || M5 | `ShortlistId` + CHR/CAL/LOG bundle refs + UTS/Name refs | `CGFrameLibraryId` (library index; publish‑ready bindings) || M6 | telemetry inputs + freshness/decay policy pins + RSCR tests | `CGKitId` + `RefreshReadinessCardId` (wiring to [`G.11`](/generated/patterns/G.11); no orchestration governance) |#### Extensions (pattern‑scoped; non‑core)All method/discipline/generator specifics MUST be expressed as `GPatternExtension` blocks.> Guard: `G.1:Ext.*` are **PatternScopeId** values (internal, pattern‑scoped), not new patterns and not new `PatternId`.##### GPatternExtension — G.1:Ext.HarvesterWiring**PatternScopeId:** `G.1:Ext.HarvesterWiring`**GPatternExtensionId:** `HarvesterWiring`**GPatternExtensionKind:** `GeneratorSpecific`**GoverningPatternId:** `G.2`**Uses:** `{G.2}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `SoTAPaletteDescriptionId`* `SoTA_SetId`* `ClaimSheetId[]` / `BridgeMatrixId` *(as referenced by the chosen [G.2](/generated/patterns/G.2) pack form)** `CNSpecRef.edition`, `CGSpecRef.edition` *(already required via `GCorePinSetId.PartG.AuthoringMinimal`)***RSCRTriggerSetIds:** `{GCoreTriggerSetId.SoTAHarvestSynthesis}`**Notes (wiring‑only):** harvesting semantics (living review funnels, inclusion policy families, SoS indicator families, etc.) are defined by `G.2` and are not duplicated in `G.1`.##### GPatternExtension — G.1:Ext.ShortlistWiring**PatternScopeId:** `G.1:Ext.ShortlistWiring`**GPatternExtensionId:** `ShortlistWiring`**GPatternExtensionKind:** `MethodSpecific`**GoverningPatternId:** `G.5`**Uses:** `{G.5, G.4}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `ShortlistId`* `SCRId` *(assurance and rationale record by id; semantics governed by the selector and assurance governing definitions)** `DRRId?` *(when a decision‑rationale artefact is minted; otherwise omitted)** `TaskSignatureRef?` *(if selection is task‑templated; otherwise omitted)** `AcceptanceClauseId[]` *(as referenced from `G.4` outputs)** any explicit selector policy pins *(policy‑id/ref; defined by the governing pattern)* when not defaulted (the omitted default cites its governing definition through `G.Core.DefaultGoverningDefinitionIndex`)**Notes (wiring‑only):** `G.1` does not redefine selection: it binds M4’s output surface to the `G.5` selector/dispatcher kernel.##### GPatternExtension — G.1:Ext.CreativityCHR**PatternScopeId:** `G.1:Ext.CreativityCHR`**GPatternExtensionId:** `CreativityCHR`**GPatternExtensionKind:** `DisciplineSpecific`**GoverningPatternId:** `C.17`**Uses:** `{C.17, G.3}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `CHRPackId?` *(if creativity characteristics are published/typed)** edition/policy pins required by the chosen creativity characteristic set (governed by `C.17`)**Notes (wiring‑only):** `G.1` only records which creativity characteristics are used for M3/M4 wiring; legality/typing lives in the CHR governing definitions.##### GPatternExtension — G.1:Ext.NQD**PatternScopeId:** `G.1:Ext.NQD`**GPatternExtensionId:** `NQD`**GPatternExtensionKind:** `MethodSpecific`**GoverningPatternId:** `C.18`**Uses:** `{C.18, C.19}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `DescriptorMapRef.edition`* `DistanceDefRef.edition`* `InsertionPolicyRef` *(policy id / ref, as defined by the governing definition)** `TaskSignatureRef?` *(when QD is enabled via TaskSignature flags/traits rather than by an external switch)** `DHCMethodRef.edition?` *(when illumination/coverage summaries are pinned to a method)** `EmitterPolicyRef` *(policy‑id/ref; points to the exploration governance governing definition, e.g., `C.19` when E/E‑LOG is used)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`**Notes (wiring‑only):** QD/QD‑adjacent algorithm families and their parameterisations belong to `C.18 and C.19`; `G.1` only fixes the pins needed to make the VariantPool and Shortlist reproducible.##### GPatternExtension — G.1:Ext.OpenEndedFamilyWiring**PatternScopeId:** `G.1:Ext.OpenEndedFamilyWiring`**GPatternExtensionId:** `OpenEndedFamilyWiring`**GPatternExtensionKind:** `GeneratorSpecific`**GoverningPatternId:** `G.2` *(family semantics are governed by SoTA cards; this block only wires pins; selector-side wiring is governed by `G.5`.)***Uses:** `{G.2, G.5, C.19, C.23}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `GeneratorFamilyId[]`* `TransferRulesRef.edition` *(mandatory when Open‑Ended is enabled)** `EnvironmentValidityRegionRef?`* `CoEvoCouplerRef[]?`* `SoSLogBranchId[]?` *(when validity of generated tasks is gated by explicit branches)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`**Notes (wiring‑only):** this block enables declared sets of `{Environment, MethodFamily}` pairs without redefining generator semantics in `G.1`; it should cite/align with the selector‑side wiring in `G.5:Ext.OpenEndedFamilyWiring`.##### GPatternExtension — G.1:Ext.RefreshWiring**PatternScopeId:** `G.1:Ext.RefreshWiring`**GPatternExtensionId:** `RefreshWiring`**GPatternExtensionKind:** `GeneratorSpecific`**GoverningPatternId:** `G.11`**Uses:** `{G.11}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `RefreshReadinessCardId`* `RSCRTestId[]`* canonical `RSCRTriggerKindId[]` emitted/recorded (aliases only as labels, if any)**RSCRTriggerSetIds:** `{GCoreTriggerSetId.RefreshOrchestration}`**Notes (wiring‑only):** M6 declares readiness and wiring; orchestration semantics (queueing, prioritisation, cadence) are governed by `G.11`.##### GPatternExtension — G.1:Ext.ShippingWiring**PatternScopeId:** `G.1:Ext.ShippingWiring`**GPatternExtensionId:** `ShippingWiring`**GPatternExtensionKind:** `GeneratorSpecific`**GoverningPatternId:** `G.10`**Uses:** `{G.10}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `CGFrameLibraryId`* `SoTAPaletteDescriptionId`, `SoTA_SetId`* `CHRPackId?`, `CALPackId?`, `SoS‑LOGBundleId?`, `ParityReportId?` *(as present in the library index)** `EvidenceGraphId?`, `BridgeMatrixId?`, `BridgeCalibrationTableId?` *(when cited by the shipped artefacts)** `UTSRowId[]?` *(when any public ids are minted/published)** `SlotFillingsPlanItemRef[]?` *(when planned baseline is bound by id into the shipment surface)***Notes (wiring‑only):** this block does not define shipping; it only records the minimum wiring from the chassis/library index to `G.10` when shipping is performed.### Archetypal Grounding — Tell–Show–Show (informative)**Tell.** Use the six‑card chassis to make a CG‑Frame authoring effort reproducible: a scoped SoTA set, a traceable candidate pool, a set‑return shortlist, a publishable library index, and refresh readiness—without redefining spec-legality/selection/refresh governing definitions.**Show A (R&D multi‑criteria decisions; post‑2015 SoTA practice).*** **M1:** define `CG‑FrameContext` for “R&D decision options”, pin `CNSpecRef/CGSpecRef` editions, and publish `entityOfConcern` + `ReferencePlane`.* **M2:** build `SoTA_SetId` via `G.2` using a living‑review style funnel (e.g., PRISMA‑like trace + update cadence) and publish UTS stubs for reusable constructs.* **M3:** emit a `VariantPoolId` where each candidate cites its emitter policy and provenance; if QD is used, wire `DescriptorMapRef.edition` and `DistanceDefRef.edition` via `G.1:Ext.NQD`.* **M4:** produce `ShortlistId` as a selected-set / shortlist surface via `G.5`, with acceptance predicates sourced from `G.4`.* **M5:** publish a `CGFrameLibraryId` indexing the chosen CHR/CAL/LOG bundles and UTS rows; register RSCR tests.* **M6:** declare refresh readiness (telemetry pins + canonical RSCR trigger kinds) and wire to `G.11`.**Show B (clinical operations; safety‑first acceptability).*** **M1:** scope a CG‑Frame around dose adjustment decisions; pin legality and evidence minima explicitly.* **M2:** harvest SoTA models and safety constraints as a reconstructible set (governed by `G.2`).* **M3:** generate policy‑constrained candidate protocols; emitter trace and evidence pins are mandatory.* **M4:** shortlist remains a set; “choose one” remains an explicit policy decision, not silently baked into the generator.* **M5/M6:** publish and wire refresh (decay events, policy changes, and evidence updates retrigger along the P2W path).### Bias‑Annotation (informative)* **Recency bias:** “newest paper wins” (mitigate with explicit inclusion criteria and update cadence in `G.2` wiring).* **Novelty bias:** over‑rewarding novelty at the expense of legality/assurance (mitigate by making acceptance and assurance pins explicit and governed).* **Algorithmic favoritism:** baking a preferred generator into “the chassis” (mitigate by keeping M3 method‑agnostic and pushing methods into Extensions).* **Scalarisation bias:** collapsing selected sets or partial orders into a single score (mitigate by set‑return discipline pinned through `G.Core`).* **Hidden‑crossing bias:** implicit reuse across contexts (mitigate by explicit crossing pins and Bridge‑only routing via `G.Core`).### Conformance Checklist (normative)| ConformanceId | Statement || ----------------- | ----------- || **CC‑G1‑CoreRef** | The pattern MUST satisfy the **effective** `CoreConformanceIds` implied by `G.1:4.1` (`GCoreConformanceProfileId` expansion + deltas), per `G.Core` expansion rules. || CC‑G1‑01 | The reusable CG-Frame kit MUST include all six cards `M1…M6` with stable ids **and** a versioned kit manifest `CGKitId`, including at minimum: `{CGKitId, CG‑FrameContext, SoTAPaletteDescriptionId, SoTA_SetId, VariantPoolId, ShortlistId, CGFrameLibraryId, RefreshReadinessCardId}`. || CC‑G1‑02 | `M1` MUST bind the kit to a single `CG‑FrameContext` and MUST expose the required pins from `GCorePinSetId.PartG.AuthoringMinimal` (including `entityOfConcern` and `CNSpecRef/CGSpecRef` editions). `M1` MUST also expose (or explicitly cite) a `ReferenceMap` surface and MUST NOT restate its semantics (cite `G.0:CG‑Spec.ReferenceMap`). || CC‑G1‑03 | `M2` MUST be wired to [`G.2`](/generated/patterns/G.2) (or explicitly cite the [`G.2`](/generated/patterns/G.2) artefacts governed by cited patterns) and MUST be reconstructible as a scoped set, including `SoTAPaletteDescriptionId` + `SoTA_SetId` (not free‑floating prose). Provenance MUST be anchored via [`A.10`](/generated/patterns/A.10) for the emitted set. || CC‑G1‑04 | `M3` MUST record emitter provenance as a wiring surface, including `EmitterPolicyRef` (policy‑id/ref), edition pins, and provenance anchors (via [`A.10`](/generated/patterns/A.10)). Any method‑specific fields MUST be introduced only via `GPatternExtension` blocks. || CC‑G1‑05 | `M4` MUST be wired to [`G.5`](/generated/patterns/G.5) (or explicitly cite [`G.5`](/generated/patterns/G.5) artefacts governed by cited patterns) and MUST preserve set-result outcomes. `SCRId` MUST be present (or explicitly cited to the governing definition surface) so assurance is id‑addressable; `DRRId` SHOULD be present when a decision‑rationale artefact is minted. || CC‑G1‑06 | `M5` MUST publish a library/index surface that points to referenced CHR/CAL/LOG artefacts and to any minted public ids (`UTSRowId[]`, Name Cards) via the canonical governing definitions (Part F), without introducing shadow specs (delegation target: `CC‑GCORE‑CN‑CG‑1` via `CC‑G1‑CoreRef`). || CC‑G1‑07 | `M6` MUST publish `CGKitId` and expose refresh‑readiness wiring: canonical `RSCRTriggerKindId[]` applicability + minimal payload pins (including `SlotFillingsPlanItemRef[]` when applicable) and RSCR test ids; orchestration semantics MUST be cited to [`G.11`](/generated/patterns/G.11). || CC‑G1‑08 | Any method/discipline/generator specificity in [`G.1`](/generated/patterns/G.1) MUST be located in `G.1:4.4` as `GPatternExtension` blocks with `PatternScopeId`, `GPatternExtensionKind`, and `GoverningPatternId` (or `governing pattern not yet selected` only for Phase-3 seeds). If QD/illumination or Open‑Ended generator families are declared, the corresponding extension blocks MUST be present and MUST carry the edition and policy pins required by the governing pattern. |### Common Anti‑Patterns and How to Avoid Them (informative)* **Anti‑pattern: “Shadow CN/CG spec inside the chassis.”** *Avoid:* keep CN/CG as cited governing spec refs; use pins and governing definition references only.* **Anti‑pattern: “Chassis hard‑codes a favourite algorithm.”** *Avoid:* keep M3 core method‑agnostic; add algorithm families only via Extensions with explicit governing patterns and edition pins.* **Anti‑pattern: “Shortlist = one winner.”** *Avoid:* preserve selected-set returns; any singleton choice must be an explicit downstream decision rule (policy‑bound).* **Anti‑pattern: “Refresh plan described as prose triggers.”** *Avoid:* record canonical `RSCRTriggerKindId` and payload pins; aliases only as labels and only if docked.* **Anti-pattern: “Packaging implies shipping governance.”** *Avoid:* treat M5 as a library index; treat M6 as readiness wiring; ship only via `G.10`.### Consequences (informative)* **Repeatable authoring:** CG‑Frame work becomes reconstructible: what exists, what it depends on, and how it is refreshed.* **Method pluralism with discipline:** multiple generator/selector families can coexist without turning the chassis into a shadow method spec.* **Better reuse:** outputs land directly in published artefacts (UTS/Name/RSCR‑ready) rather than remaining local notes.* **Lower refactor cost:** method changes localise to Extensions; core invariants remain stable and one governing definition.### Rationale (informative)* **Why six cards?** It matches the minimal decomposition needed to keep scope, harvesting, generation, selection, publication, and refresh **explicitly separable** (and thus auditable and evolvable).* **Why “kit/index” rather than “pack”?** A CG‑Frame authoring effort must stay modular; shipping is a separate governing boundary (`G.10`).* **Why push method content into Extensions?** It prevents conflating (i) universal invariants, (ii) frame‑specific kit surfaces, and (iii) method/generator families—supporting Phase‑2 universalisation goals.* **Why working‑model first?** Many CG‑Frames fail due to premature formalism; a chassis with didactic micro‑examples improves correctness of pins, names, and boundaries before deep formalisation.### SoTA‑Echoing (informative)This chassis is designed to stay compatible with modern (post‑2015) practice without confusing “SoTA” with “currently popular”:* **Evidence synthesis:** living systematic review protocols (e.g., PRISMA‑style traceability and update cadence) map naturally to M2 wiring governed by `G.2`.* **Quality‑Diversity and archives:** modern QD families (MAP‑Elites‑class, CMA‑ME‑class, and related archive‑based exploration) fit as M3/M4 extensions (`C.18`/`C.19`) because they require explicit descriptor/distance/insertion pins and preserve set‑valued outcomes.* **Open‑ended exploration:** post‑2015 open‑endedness systems (POET‑class, paired/adversarial environment generation lines, and modern curriculum‑generation approaches) fit when treated as generator‑family wiring (governed elsewhere) rather than as chassis semantics.* **Set‑valued decision outputs:** modern multi‑objective and set‑valued evaluation practices align with the `G.Core` set‑return discipline, preventing hidden scalarisation.* **Governed traceability:** contemporary reproducibility and accountability norms (mechanism disclosure, provenance anchors, and audit trails) are supported via pinned policies/editions and explicit module boundaries, without introducing data‑governance machinery.### Relations**Builds on:** `G.Core`, `E.8`, `E.10`, `E.19`.**Uses:** `A.10 (Provenance Anchors)`, `A.15.3 (SlotFillingsPlanItem)`, `A.19 (CN‑Spec)`, `G.0 (CG‑Spec)`, `G.2 (SoTA Synthesis Pack)`, `G.3 (CHR Pack@CG‑Frame)`, `G.4 (CAL Pack@CG‑Frame)`, `G.5 (Selector & Dispatch)`, `G.10 (Shipping)`, `G.11 (Refresh Orchestration)`, and (via Extensions) `C.17, C.18, and C.19`.**Publishes to / consumes from:** Part‑F publication surfaces (UTS, naming, RSCR tests, Role/Concept artefacts) as cited by their governing definitions.### G.1:End## SoTA Harvester & Synthesis> **Type:** Architectural (A)> **Status:** Stable> **Normativity:** Normative *(unless explicitly marked informative)*>> **Purpose.** Provide a repeatable, auditable way to **discover**, **triage**, and **synthesize** state‑of‑the‑art (SoTA) across competing `Tradition` lineages *before* minting CHR/CAL/LOG assets for a `CG‑Frame`.> The primary output is a **`SoTA Synthesis Pack@CG‑Frame`** that feeds:>> * naming/publication (UTS),> * CHR authoring ([G.3](/generated/patterns/G.3)),> * CAL authoring ([G.4](/generated/patterns/G.4)),> * method/generator registries and dispatch ([G.5](/generated/patterns/G.5)).>> **Scope note.** This pattern **governs** the harvesting + synthesis *generator* in Part G. Shipping governing-definition assignment is in **[G.10](/generated/patterns/G.10)**, refresh orchestration governing-definition assignment is in **[G.11](/generated/patterns/G.11)**.>> **Terminology note (normative).** In normative clauses below, **`Tradition`** refers to the *Tech* token `Tradition` (a plural lineage with internally coherent commitments). Plain “tradition” is allowed only as a 1:1 synonym.### Problem frameA team extends FPF into a new `CG‑Frame`. The relevant literature is typically:* **plural** (multiple `Tradition` lineages with incompatible commitments),* **context‑sensitive** (results depend on `U.BoundedContext` and declared `entityOfConcern`),* **method‑heterogeneous** (different evidence styles, operator sets, and validity regions),* **time‑sensitive** (rapid drift post‑2015; frequent benchmark/protocol shifts).Downstream Part‑G work (CHR/CAL/selection/shipping/refresh) depends on the team producing **consumable, citation‑ready artefacts** without collapsing semantic boundaries across contexts or planes.### ProblemHow can we systematically assemble a SoTA view that is:1. **pluralist but comparable** (plurality preserved; comparability is achieved only via explicit crossings),2. **evidence‑addressable** (claims cite auditable evidence surfaces and anchors),3. **actionable** (produces inventories and cards that [G.3](/generated/patterns/G.3)/[G.4](/generated/patterns/G.4)/[G.5](/generated/patterns/G.5) can consume),4. **refreshable** (editions/policies/windows are pinned so RSCR/refresh can re‑audit and re‑run without semantic drift)?### Forces* **Pluralism vs. consolidation.** Consolidation is valuable, but unqualified fusion destroys meaning.* **Breadth vs. load‑bearing depth.** Too broad becomes shallow; too deep misses rival lineages.* **Recency vs. stability.** Freshness matters, yet durable “backbone” claims must be identified and kept visible.* **Pedagogy vs. rigour.** Outputs must be teachable enough to support review, while remaining audit‑ready.* **Authoring vs. operations.** This pattern lives in the authoring plane; operational runs and decisions belong to Work planes and to governing patterns.### Solution#### G.Core linkage (normative)**Builds on:** `G.Core` (Part‑G core invariants; citation/delegation hub)**GCoreLinkageManifest (normative).***(Canonical form, Nil‑elision, and Expansion rule are defined in `G.Core`.)*`GCoreLinkageManifest := ⟨ CoreConformanceProfileIds := { GCoreConformanceProfileId.PartG.AuthoringBase, GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted }, RSCRTriggerSetIds := {GCoreTriggerSetId.SoTAHarvestSynthesis}, CorePinSetIds := {GCorePinSetId.PartG.CrossingVisibilityPins}, CorePinsRequired := { // Scope pins (G.2‑specific) CG-FrameContext, Tradition[], entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩, SoTA_SetId, SoTAPaletteDescriptionId, // Evidence / provenance pins (G.2‑specific) CorpusLedgerId, FlowRecordId, EvidenceAnchorRef[], EvidenceGraphId?, // Crossing / synthesis pins (delta beyond CorePinSetIds; only when used) GammaEpistSynthId[]?, // Edition / policy pins (only when used) HarvestPolicyRef?, DistanceDefRef.edition?, InclusionCriteriaId?, ScreeningRubricId? }, DefaultsConsumed := ∅, TriggerAliasMapRef := ∅⟩`*(RSCR payload pins: `ClaimSheetId[]`, `SoTA_SetId`, `SoTAPaletteDescriptionId`, `BridgeMatrixId?`, `GammaEpistSynthId[]?`, `UTSRowId[]?`, `DistanceDefRef.edition?`, `HarvestPolicyRef?`, `InclusionCriteriaId?`, `ScreeningRubricId?`, `PathId/PathSliceId?` when path‑citable evidence or a stable freshness window is pinned.)***Pattern‑local default rules (governed by this pattern; not a Part‑G‑wide `DefaultId`).**`FamilyCoverageFloorK := 3` *(unless explicitly overridden by `HarvestPolicyRef` and recorded in `FlowRecord`)*#### Kit: SoTA Synthesis Pack@CG‑Frame (surface governed by this pattern)A conforming `G.2` publication produces a **notation‑independent pack** whose internal organisation is free, but whose exported **named components and views** are stable and citable:Each named component is addressable via a stable **pack‑local identifier** (e.g., `CorpusLedgerId`, `ClaimSheetId`, `FlowRecordId`) for citation and RSCR scoping. If any component is minted/evolved as a **public id**, it is published and cited via `UTSRowId[]` per `CC‑GCORE‑UTS‑1` (delegation).0. **`SoTA_Set@CG‑Frame`** *(export view; “M2 output” consumed downstream)* A read‑optimised view over the harvested candidate set that downstream generator/selector work treats as the “harvester output set”. **Constraint (normative):** `SoTA_Set@CG‑Frame` **MUST** be reconstructible from pack components by id (no “hidden extra set”).1. **`G.2a CorpusLedger`** Ledger of candidate sources with Context and triage status (e.g., include / park / retire) and explicit rationale hooks.2. **`G.2b ClaimSheets[Tradition]`** Typed Claim Sheets per `Tradition`, each with:* explicit `U.BoundedContext` and `entityOfConcern`,* explicit evidence anchors/citations ([A.10](/generated/patterns/A.10) and/or EvidenceGraph refs when available),* explicit freshness window notes and risk/trust cues *(cite `B.3` governing definitions when using trust/decay language)*.3. **`G.2c OperatorAndObjectInventory`** Inventory of candidate CHR terms (characteristics/scales/coordinates) and candidate CAL operators/flows *as stubs* for downstream authoring.4. **`G.2d BridgeMatrix`** A citable alignment/divergence surface across `Tradition`×`Tradition`, with explicit losses and row scopes. If any row asserts substitution or fusion across sources or across `Tradition` records, the pack **MUST** attach a `GammaEpistSynthId` record (alias: **`G.2‑F`**) per `G.2:Ext.GammaEpistSynthesis` (no silent fusion).5. **`G.2e MicroExamples`** Worked micro‑examples for load‑bearing claims, each citing [A.10](/generated/patterns/A.10) carriers, declaring context + `entityOfConcern`, and annotating assurance type(s) (`TA`/`VA`/`LA`, where applicable).6. **`G.2f UTSProposals`** Draft Name Cards + Minimal Definitional Sheets (MDS) + alias proposals (incl. concept‑set linkage where applicable), with the required publication pins.7. **`G.2g entityOfConcern Map`** Map from key terms/claims/public ids to `GroundingHolon`, `ReferencePlane`, and minimal reference cues for later CHR/CAL authoring.8. **`G.2h PRISMA Flow Record`** A screening/eligibility trail for how sources entered the pack (method‑profile is allowed; see Extensions). *(Name is historical; the artefact remains notation‑independent.)*9. **`G.2i SoSIndicatorFamilies`** Indicator *families* as variants (windows/constraints/assumptions) **with explicit Acceptance branches per variant** (branch ids/labels only; threshold semantics belong to CAL governing definitions).10. **`G.2j MethodFamilyCards`** Candidate method families with a shared signature and a plurality of implementations, each with validity regions, cost/complexity notes, and known failure modes. When the pack targets downstream registry/dispatch, MethodFamily cards **SHOULD** include the declared refs and pins `G.5` needs (eligibility predicate refs, assurance profile cues, and the pack ids that justify the family).11. **`G.2k GeneratorFamilyCards`** *(if applicable)* Candidate generator families for environment/task generation with declared validity regions and transfer hooks.12. **`G.2l Annexes`** *(optional; governing-definition-cited; see Extensions)* For example: QD/NQD annexes, discipline‑specific indicator annexes, interop forms.**SoTAPaletteDescription** *(export view; required downstream)*A view‑friendly description object (pack‑local `SoTAPaletteDescriptionId`) that binds together:* the `SoTA_Set@CG‑Frame` view,* `ClaimSheetId[]`, `OperatorAndObjectInventory`, `BridgeMatrixId?`,* `SoSIndicatorFamilies` (with variant/branch structure),* `MethodFamilyCards` / `GeneratorFamilyCards?`,* `MicroExamples`, `UTSProposals`,* and the `entityOfConcern Map` for citation and later CHR/CAL authoring.**Note (normative intent):** this is the primary “consumable surface” for `G.3/G.4/G.5`; it prevents downstream patterns from scraping free prose.**Editorial template: 1‑page “SoTA Sheet” per Tradition (informative).**When authoring `ClaimSheets[Tradition]`, teams often benefit from a single‑page template: scope + claims + evidence anchors + validity region + failure modes + freshness window + cross‑Tradition reuse notes + pointers to micro‑examples.#### Harvester loop (conceptual choreography; pattern-governed)A conforming `G.2` pack publication is built by iterating the following conceptual loop until the declared gates are satisfied:1. **Declare scope and plurality.** Declare `CG-FrameContext`, the initial `Tradition` set, and the `entityOfConcern` surface for each intended claim region. Record these declarations in the pack pins (not as implicit assumptions).2. **Discover and triage sources (ledger‑first).** Populate `CorpusLedger` via:* seed sources,* expansion via citation chaining and keyword family exploration,* pruning using load‑bearing relevance tests tied to the declared CG‑Frame scope.3. **Distill claims per `Tradition`.** For each `Tradition`, author a Claim Sheet that preserves internal commitments and cites evidence anchors. Do not fuse cross‑`Tradition` claims at this stage.4. **Inventory operators/objects for downstream authoring.** Extract candidate measurement terms and operator stubs for later CHR/CAL authoring (without asserting legality or thresholds locally).5. **Build alignment/divergence surfaces.** Where reuse across `Tradition` is desired, author Bridge‑backed alignment records and explicit loss notes in `BridgeMatrix`. Any consolidation is explicitly marked as requiring alignment proof.6. **(Alias: [G.2](/generated/patterns/G.2)‑F) Produce Γ_epist synthesis records when fusion/substitution is asserted.** If a `G.2` pack publication asserts fusion or substitution across sources or across `Tradition` records (beyond mere “parallel divergent claims”), it **MUST** emit `GammaEpistSynthId` records per `G.2:Ext.GammaEpistSynthesis` (provenance union + explicit object alignment refs + assurance tuple refs), and it **MUST** keep penalties routed to `R_eff` only by delegation (`CC‑GCORE‑PEN‑1`).7. **Publish teachable micro‑groundings.** Attach worked micro‑examples to load‑bearing claims, each tied to [A.10](/generated/patterns/A.10) carriers and declaring context + `entityOfConcern`.8. **Apply gates and record repairs.** Enforce `FamilyCoverageFloorK` (and any optional diversity‑by‑distance gate). If a gate fails, the pack **MUST**: * record the failure and the repair iteration in `FlowRecord` and `CorpusLedger`, * pin the updated `HarvestPolicyRef` / criteria ids (if changed), * iterate the loop rather than silently weakening the gate.9. **Emit hand‑off manifests and export views.** Produce explicit manifests to:* `G.3` (CHR authoring),* `G.4` (CAL authoring),* `G.5` (registry/dispatch), so that downstream work can cite pack components by id rather than re‑authoring them. The pack **MUST** also export `SoTA_Set@CG‑Frame` and `SoTAPaletteDescription` as the default downstream consumption surfaces (ids pinned).#### Interfaces (minimal I/O Standard)| Interface | Consumes | Produces || ----------------- | ------------------------------------------------------------- | --------------------------------------------------------------------------- || **[G.2](/generated/patterns/G.2)‑1 Harvest** | `CG-FrameContext`, initial `Tradition[]`, `HarvestPolicyRef?` | `SoTA Synthesis Pack@CG‑Frame` (G.2a–G.2l) || **[G.2](/generated/patterns/G.2)‑2 Extend** | existing Pack + new sources/anchors + updated policy pins | updated Pack + RSCR‑relevant trigger emissions (canonical kinds) || **[G.2](/generated/patterns/G.2)‑3 HandOff** | Pack | `CHR‑handoff` (to [G.3](/generated/patterns/G.3)), `CAL‑handoff` (to [G.4](/generated/patterns/G.4)), `Registry‑handoff` (to [G.5](/generated/patterns/G.5)) |*Note:* Orchestration of re‑runs is governed by `G.11`; this pattern only defines what a conforming (re)harvest produces and what pins it must expose.#### Extensions (pattern‑scoped; non‑core)`Extensions` are pattern‑scoped annexes. They do not introduce Part‑G‑wide norms; they declare the additional pins required when those semantics are active and cite the corresponding governing patterns.###### GPatternExtension: GammaEpistSynthesis**PatternScopeId:** `G.2:Ext.GammaEpistSynthesis`**GPatternExtensionId:** `GammaEpistSynthesis`**GPatternExtensionKind:** `GeneratorSpecific`**GoverningPatternId:** `G.2`**Uses:** `{G.Core, B.3, F.9, G.6}` *(penalty routing + trust/decay cues + bridges/CL + evidence path citation when used)***⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `GammaEpistSynthId[]` *(pack‑local ids of synthesis records; emitted iff fusion/substitution is asserted)** `EvidenceAnchorRef[]` *(provenance union; [A.10](/generated/patterns/A.10) carriers)** `BridgeMatrixId` and `BridgeCardId[]` *(explicit object alignment references when crossing is involved)** `CL/CL^plane` + `Φ/Ψ/Φ_plane policy-ids` *(ids only; semantics governed by cited definitions; penalties → `R_eff` only by delegation)** `PathId/PathSliceId?` *(only when citing via `G.6`)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.ReferencePlaneEdit, RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.EditionPinChange}`**Notes (normative intent; duplication‑avoidant):*** `Γ_epist^synth` is an auditable record that binds: (i) provenance union, (ii) explicit object alignment refs, (iii) assurance tuple refs (via existing governing definitions) for each asserted fusion/substitution.* This extension **does not** redefine `Γ‑fold`, `Φ`, or penalty semantics; it only requires the pins/refs needed for replayability and auditability (see `G.Core` delegations).###### GPatternExtension: HarvestProtocols**PatternScopeId:** `G.2:Ext.HarvestProtocols`**GPatternExtensionId:** `HarvestProtocols`**GPatternExtensionKind:** `Phase3Seed`**GoverningPatternId:** `G.2`**Uses:** `{B.3, A.10}` *(for freshness/decay and provenance anchors, when protocol requires them explicitly)***⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `HarvestPolicyRef` *(declares the chosen protocol family and its parameters)** `FlowRecordId` *(protocol‑specific profile id or rubric id may be attached here)** `InclusionCriteriaId` / `ScreeningRubricId` *(ids only; semantics remain local to the protocol family)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.FreshnessOrDecayEvent}`**Notes (extension discipline):*** This extension binds a declared protocol profile to the pack’s `FlowRecord` without redefining evidence semantics.###### GPatternExtension: DHCAlignmentHooks**PatternScopeId:** `G.2:Ext.DHCAlignmentHooks`**GPatternExtensionId:** `DHCAlignmentHooks`**GPatternExtensionKind:** `DisciplineSpecific`**GoverningPatternId:** `C.21` *(DHC semantics are governed by [C.21](/generated/patterns/C.21))***Uses:** `{C.21, G.6, G.7}` *(DHC series + evidence path citations + bridge/CL regimes when alignment density is claimed)***⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `DHCMethodRef.edition`* `WindowRef?` *(if the DHC series is windowed)** `DHCSenseCellId[]` *(pack‑local ids for emitted DHC SenseCells; if any are public, cite via `UTSRowId[]`)** `UTSRowId[]?` *(only if any DHC SenseCells / series ids are minted/evolved as public ids)** `PathId[]` / `PathSliceId[]` *(when alignment summaries cite evidence paths via [G.6](/generated/patterns/G.6))***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.TelemetryDelta}`**Notes (extension discipline):*** If DHC alignment summaries are emitted, this extension ensures the DHC method edition and the cited evidence paths are visible.* Units/constraints (governing pattern: `C.21`) must be **pinned, not redefined** here (e.g., `bridges_per_100_DHC_SenseCells`, `CL_min = 2` for cross‑Context counting, and the “CL=3 implies free substitution” interpretation when used).###### GPatternExtension: NQDAnnex**PatternScopeId:** `G.2:Ext.NQDAnnex`**GPatternExtensionId:** `NQDAnnex`**GPatternExtensionKind:** `MethodSpecific`**GoverningPatternId:** `C.18` *(NQD-CAL semantics are governed by [C.18](/generated/patterns/C.18); explore/exploit logging is governed by [C.19](/generated/patterns/C.19) when used)***Uses:** `{C.18, C.19}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `DescriptorMapRef.edition`* `DistanceDefRef.edition`* `InsertionPolicyRef` *(policy‑id/ref)** `EmitterPolicyRef` *(policy‑id/ref)** `TaskSignatureRef?` *(when QD mode is trait‑gated)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`**Notes (extension discipline):*** This extension only pins the required references for replayability; it does not redefine QD semantics, dominance, or acceptance rules.###### GPatternExtension: InteropForms**PatternScopeId:** `G.2:Ext.InteropForms`**GPatternExtensionId:** `InteropForms`**GPatternExtensionKind:** `InteropSpecific`**GoverningPatternId:** `G.13`**Uses:** `{G.13}`**⊑/⊑⁺:** `∅`**RequiredPins/EditionPins/PolicyPins (minimum):*** `ExternalIndexRef.edition`* `ClaimMapperRef.edition`* `MappingPolicyRef` *(policy‑id/ref)** `UTSRowId[]` *(for published external ids/aliases where relevant)***RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TokenizationOrNameChange, RSCRTriggerKindId.EvidenceSurfaceEdit}`**Notes (extension discipline):*** Interop affects only representation and citation routes; it must not introduce alternate legality gates or acceptance semantics.#### Palette first- `SoTAPaletteDescription` is one plurality-preserving palette.- It is not by itself one `Front`, one `Archive`, or one `Shortlist`.- When that palette's members are traditions, `TraditionPalette` is the reader-facing tradition-only palette head over the same palette declaration, not one second governing definition. For methods, hypotheses, or other members, keep `SoTAPaletteDescription` or `Palette + SubjectKind` explicit instead.- Traditions remain in the palette until a later surface declares comparison, retention, or choice semantics explicitly.- `TraditionFront` is one derived view over the declared palette under one declared `Q`; the `Q` basis stays pinned separately and the view does not rename `Tradition` or `SoTAPaletteDescription`.- `TraditionArchive` is one derived retention view over that same palette under one declared reachability or coverage rule; that rule stays pinned separately and the view does not turn the palette into one archive by default.- When one derived tradition view is shown, keep the base palette recoverable at the same time.- When comparison or retention needs richer geometry or atlas language, treat that as support for the derivation rather than as the default meaning of the palette.- A reader should be able to say both `this is the palette` and `this is the derived tradition view currently being shown` without collapsing those two objects.#### Atlas views stay optional neighboring interpretation over one declared palette and declared set results- `TraditionAtlasView` is one declared optional neighboring interpretive view over one palette and any declared front, archive, or shortlist surfaces drawn from it, while the cited substrate-bearing line, the active source set or active set result, and any cited `SearchSpaceRef`, `OutcomeSpaceRef`, or other declared space refs remain recoverable.- `TraditionAtlasView` is the `G.2` use-site specialization of `DeclaredSubstrateAtlasView`; keep the generic interpretive-view declaration in `A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW`.- It is not the default meaning of `Tradition` or `SoTAPaletteDescription`.- Stay palette-first when the harvest or synthesis question can already be judged from the declared palette together with ordinary front, archive, or shortlist surfaces.- Use `TraditionAtlasView` only when the reader must hold several declared derived views or interpretive qualifiers together to see why one tradition grouping, omission risk, or comparison boundary matters.- A conforming `TraditionAtlasView` must keep the same atlas-form interpretation declaration that `A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW` requires by value: recoverable base palette, active source set or active set result, `TypedSetViews` when several declared set views are held together, cited `SearchSpaceRef`, `OutcomeSpaceRef`, or other declared space refs, cited declared map refs such as `OutcomeMapRef`, cited qualifiers such as `SpaceMetricRef`, `TransitionRelationRef`, and `BridgeDistortionNote`, and one explicit reason why thinner `DeclaredSubstrateInterpretiveView` is insufficient here.- It may help explain where one tradition, method family, or retained line sits relative to another, but it should not silently redefine the base palette or one derived front view or archive view.- If one atlas view uses several typed views over the same source set, keep the active set result, any cited `SearchSpaceRef`, `OutcomeSpaceRef`, or other declared space ref, and any `BridgeDistortionNote` recoverable instead of letting `TraditionAtlasView` hide those choices.- Treat the atlas layer as optional neighboring interpretation, not as ordinary palette-first core. Use `SpaceMetricRef` or `TransitionRelationRef` only when one declared comparison, reachability, transition, or cross-scale state-change claim actually depends on that formal support; otherwise leave them unstated.- Use `OutcomeMapRef` only when the atlas must show how one declared set result maps into one outcome-side or effect-side declared space/ref; it does not turn the palette, front, archive, or shortlist into that outcome-side declared space/ref.- If one atlas reading would materially change the base source-to-outcome relation or distortion posture, reopen the substrate declaration instead of treating that change as one local `G.2` convenience.- If one thinner `DeclaredSubstrateInterpretiveView` already keeps the question legible, prefer that thinner interpretation form and leave atlas specialization unused.- `SearchSpaceRef` and `OutcomeSpaceRef` doctrine, transition-aware novelty, metric-transfer loss, and cross-scale geometry belong to a heavier formal layer: keep them outside ordinary palette-first use unless the current comparison, reachability, transition, or multilevel claim explicitly needs them, and do not pull them in merely because one richer comparative reading is mathematically available.- If no declared atlas view is needed, stay with the simpler palette-first and declared-derived-view surfaces.- Different atlas views may rely on different declared spaces, metrics, bridges, or transition supports; keep that plurality visible rather than forcing one geometry monoculture across every neighboring view.- If several mathematical traditions remain plausible, keep that plurality visible rather than pretending the atlas already fixes one final formalism.- If the question is naming-side only, use `F.18` for that wording choice rather than letting atlas-form interpretation language carry the naming decision by itself.### Archetypal Grounding (System / Episteme)| Template element | `U.System` illustration | `U.Episteme` illustration || ------------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- || **Tell** | A safety engineering team needs to choose a control stack across multiple engineering “schools” (robust control, learning‑based control, formal verification), under a declared operational context and a concrete `entityOfConcern` (the vehicle + operating envelope). | A research group must synthesize SoTA on “decision quality” across competing lineages (causal decision theory, evidential variants, bounded rationality, and active‑inference‑style formalisms), each with distinct evidence norms and semantics. || **Show (failure)** | The team merges terms across contexts, treats incompatible test protocols as comparable, and collapses multiple partially ordered trade‑offs into one unqualified score. The resulting design cannot explain why a later safety review disagrees. | The group produces a single “best” metric of decision quality and retrofits definitions to fit it. Later, conflicting claims cannot be traced because evidence anchors and crossing losses were never made explicit. || **Show (repair)** | A conformant [`G.2`](/generated/patterns/G.2) pack keeps parallel Claim Sheets per `Tradition`, publishes explicit alignment/loss notes where reuse is attempted, and emits hand‑offs so CHR/CAL/selection can be authored without re‑inventing semantics. | A conformant [`G.2`](/generated/patterns/G.2) pack preserves plural claims, publishes explicit bridge‑backed alignment where justified, represents indicators as families/variants, and makes evidence anchors and freshness windows visible so downstream re‑audits are possible. |### Bias-Annotation (informative)Lenses tested: **Gov**, **Arch**, **Onto/Epist**, **Prag**, **Did**.* **Selection bias (Gov/Onto).** Any harvesting protocol can over‑represent certain venues, languages, or evidence styles. *Mitigation:* pluralism floor + explicit `CorpusLedger` + explicit protocol pins.* **Consolidation bias (Onto/Epist).** Pressure to “merge” lineages can erase incompatible commitments. *Mitigation:* keep Claim Sheets disjoint by default; require explicit alignment proof for fusion; preserve loss notes.* **Recency bias (Prag).** Overweighting newest papers can hide durable backbone results; underweighting them misses SoTA drift. *Mitigation:* publish freshness windows and make them RSCR‑relevant.* **Didactic bias (Did).** Micro‑examples can steer interpretation toward familiar domains. *Mitigation:* require heterogeneous substrates and explicit [A.10](/generated/patterns/A.10) anchors.### Conformance Checklist (normative) — CC‑G2| ConformanceId | Requirement | Purpose / Notes || ------------------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------- || **CC‑G2‑CoreRef** | A conforming [`G.2`](/generated/patterns/G.2) artefact **MUST** satisfy the **effective** core obligations declared by the `GCoreLinkageManifest` in `G.2:4.1` (per `G.Core` Expansion rule). | Phase‑2 bridge clause: ensures universal invariants are not redefined inside [`G.2`](/generated/patterns/G.2). || **CC‑G2‑Pluralism‑1** | A conforming pack **MUST** include at least **two** `Tradition` lineages and at least **three** distinct declared `U.BoundedContext` entries across the corpus. | Prevents single‑lineage “SoTA” from masquerading as synthesis. || **CC‑G2‑Ledger‑1** | A conforming pack **MUST** include `G.2a CorpusLedger` with inclusion/triage status and explicit rationale hooks per entry. | Makes discovery/triage auditable. || **CC‑G2‑FlowRecord‑1** | A conforming pack **MUST** include `G.2h FlowRecord` that traces identification → screening → eligibility → included at a minimum granularity sufficient to reproduce the corpus boundary. | Prevents “mystery inclusion” and supports refresh. || **CC‑G2‑ClaimSheets‑1** | For each included `Tradition`, a conforming pack **MUST** include a `ClaimSheetId` that declares `U.BoundedContext`, `entityOfConcern`, evidence anchors, and freshness notes; it **MUST NOT** fuse cross‑`Tradition` claims by default. | Keeps plurality explicit and prevents hidden crossings. || **CC‑G2‑Palette‑1** | A conforming pack **MUST** export `SoTA_Set@CG‑Frame` and `SoTAPaletteDescription` as citable views (via `SoTA_SetId`, `SoTAPaletteDescriptionId`) and ensure both are reconstructible from pack components by id (no hidden extra structure). | Prevents downstream scraping of prose; keeps “M2 output” explicit. || **CC‑G2‑Palette‑2** | If the pack exports one derived tradition view such as `TraditionFront` or `TraditionArchive`, it **MUST** keep `SoTAPaletteDescription` explicit as the default base palette, keep that derivation recoverable, and cite the declared `Q` or reachability/coverage rule that disciplined that view. Derived tradition views **MUST NOT** silently replace the palette's default meaning. | Keeps non-default tradition views recoverable without redefining palette-first semantics. || **CC‑G2‑AtlasInterpretation‑1** | If the pack exports `TraditionAtlasView`, it **MUST** satisfy the same interpretive-view declaration required by `A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW`: keep the base palette and active source set or active set result recoverable, name `TypedSetViews` when several declared set views are held together, cite any active `SearchSpaceRef`, `OutcomeSpaceRef`, or other declared space refs, cite any active `OutcomeMapRef`, `SpaceMetricRef`, `TransitionRelationRef`, or `BridgeDistortionNote` only when they do real explanatory work, state why thinner `DeclaredSubstrateInterpretiveView` is insufficient here, and **MUST NOT** use atlas form when palette-first or thinner `DeclaredSubstrateInterpretiveView` is sufficient. | Keeps the [`G.2`](/generated/patterns/G.2) specialization at least as constraining as the general `DeclaredSubstrateAtlasView` declaration and preserves space-role recoverability. || **CC‑G2‑entityOfConcernMap‑1** | A conforming pack **MUST** include `G.2g entityOfConcern Map`, mapping (at minimum) each load‑bearing claim family and each minted/evolved public id to `entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩`, and citing the relevant `ClaimSheetId` and evidence anchors ([A.10](/generated/patterns/A.10) and/or [G.6](/generated/patterns/G.6) paths when used). | Keeps plane/holon boundaries explicit and citable. || **CC‑G2‑Alignment‑1** | Any cross‑`Tradition` consolidation **SHALL** be presented as either (i) disjoint parallel claims with explicit divergence, or (ii) an explicitly justified alignment proof; any reuse across `Tradition` boundaries **MUST** use explicit crossing bundles per `CC‑GCORE‑CROSS‑1` (delegation). | Prevents silent semantic leakage. || **CC‑G2‑GammaSynth‑1** | If the pack asserts **fusion or substitution** across sources or across `Tradition` records (not merely “parallel divergent claims”), it **MUST** emit `GammaEpistSynthId` records satisfying `G.2:Ext.GammaEpistSynthesis` (provenance union + explicit alignment refs + assurance tuple refs). If no fusion or substitution is asserted, the pack **SHALL** state so explicitly. | Restores the load‑bearing synthesis artefact (alias: `G.2‑F`) without shadow specs. || **CC‑G2‑Inventory‑1** | A conforming pack **MUST** include `G.2c OperatorAndObjectInventory`, sufficient for downstream CHR/CAL authoring to begin without re‑harvesting terms. | Ensures the pack is actionable. || **CC‑G2‑Inventory‑2** | `G.2c OperatorAndObjectInventory` entries **MUST** be treated as **stubs** for downstream authoring: they **MUST NOT** embed acceptance thresholds or claim legality decisions locally. If an entry is not a citation of an already governed CHR/CAL artefact, it **MUST** be explicitly marked as `stub` (typing/lawfulness `TBD`) and **MUST NOT** be used as if lawful. Legality/threshold semantics are governed by [`G.3`](/generated/patterns/G.3) for CHR and [`G.4`](/generated/patterns/G.4) for CAL via explicit ids/pins. | Prevents “shadow CHR/CAL” and preserves lawfulness discipline without redefining it locally. || **CC‑G2‑MeasurementLawful‑1** | If any inventory entry is presented as **non‑stub** (i.e., already lawful/typed), the pack **MUST** cite the governing lawfulness discipline (e.g., `A.17–A.19/C.16` as applicable) and provide the minimal evidence anchors needed to justify that typing claim. | Prevents “quietly lawful” measurement claims inside the harvester pack. || **CC‑G2‑MicroExamples‑1** | For every load‑bearing claim family, a conforming pack **MUST** include **at least two** worked micro‑examples on **heterogeneous substrates**, each with explicit [A.10](/generated/patterns/A.10) carrier anchors, declared context + `entityOfConcern`, and an assurance tag (`TA`/`VA`/`LA`, where applicable). | Makes the synthesis teachable and anchor‑grounded. || **CC‑G2‑UTS‑1** | If the pack proposes or evolves any public ids, it **MUST** publish UTS proposals *(Name Cards + MDS where applicable)* and cite them via `UTSRowId[]`, satisfying `CC‑GCORE‑UTS‑1` (delegation). | Keeps naming and evolution disciplined. || **CC‑G2‑Families‑1** | SoS indicators and candidate evaluation constructs **SHALL** be represented as **families/variants** (windows/constraints/assumptions) **with explicit Acceptance branch structure per variant** (branch ids/labels only), not as single unqualified scalars; any scalar summary **MAY** be included only as report‑only unless explicitly promoted by governing patterns. *(Set-return discipline is delegated to `CC‑GCORE‑SET‑1`.)* | Prevents covert scalarization and keeps acceptance governed by downstream patterns. || **CC‑G2‑HandOff‑1** | A conforming pack **MUST** emit hand‑off manifests to [`G.3`](/generated/patterns/G.3), [`G.4`](/generated/patterns/G.4), and [`G.5`](/generated/patterns/G.5) that cite pack components by id and identify which families/operators are intended for downstream formalisation or registry entry. | Prevents downstream re‑authoring and drift. || **CC‑G2‑CoverageGate‑1** | The pack **MUST** declare `FamilyCoverageFloorK` and enforce it as a harvesting gate. It **MUST** either (i) specify `k` explicitly in an explicit `HarvestPolicyRef`, or (ii) use the pattern‑local default rule governed by `CC‑G2‑CoverageGate‑1`. *Default rule (pattern-local):* `k=3`. If the gate fails, the pack **MUST** (a) record the repair iteration in `FlowRecord`, and (b) broaden the search radius (new venues/corpora/contexts/traditions) rather than silently weakening the gate; if an exploration policy is used for this broadening, it **MUST** be pinned as a policy id/ref. | Makes “coverage floor” explicit and prevents “silent narrowing” under failure. || **CC‑G2‑DistanceGate‑1** | If a diversity‑by‑distance gate is used, the pack **MUST** pin `DistanceDefRef.edition` and the declared threshold (δ), and treat edits as RSCR‑relevant per `CC‑GCORE‑TRIG‑*` (delegation). If no such gate is used, the pack **SHALL** explicitly state that it is not used. | Avoids implicit distance defaults and improves refreshability. || **CC‑G2‑RSCR‑1** | A conforming pack **MUST** emit canonical `RSCRTriggerKindId` causes (not free text) for edits to evidence surfaces, name/tokenization surfaces (e.g., UTS proposals/aliases), crossings, planes, edition pins, and harvesting policy pins (`HarvestPolicyRef`), per `CC‑GCORE‑TRIG‑1…TRIG‑4` (delegation). | Keeps refresh reason codes stable and typed. || **CC‑G2‑Ext‑GammaEpist‑1** | If `G.2:Ext.GammaEpistSynthesis` is used (i.e., any fusion/substitution is asserted), the pack **SHALL** expose the required pins listed in that extension and **SHALL NOT** redefine `Γ‑fold/Φ/penalty` semantics locally (cite governing definitions by delegation). | Keeps synthesis auditable without creating shadow specs. || **CC‑G2‑Ext‑HarvestProtocols‑1** | If `G.2:Ext.HarvestProtocols` is used, the pack **SHALL** expose the required pins/criteria ids listed in that extension and **SHALL NOT** redefine evidence/quality semantics outside the declared protocol profile. | Keeps protocol variation explicit and separately citable. || **CC‑G2‑Ext‑DHC‑1** | If `G.2:Ext.DHCAlignmentHooks` is used, the pack **SHALL** (a) expose the required pins listed in that extension, including `DHCSenseCellId[]`, and (b) declare the unit/constraint pins required by [`C.21`](/generated/patterns/C.21) (e.g., `bridges_per_100_DHC_SenseCells`, `CL_min=2`) without redefining their semantics locally (governing pattern: [`C.21`](/generated/patterns/C.21)). | Keeps DHC extension pins auditable and non‑shadowing. || **CC‑G2‑Ext‑NQD‑1** | If `G.2:Ext.NQDAnnex` is used, the pack **SHALL** expose the required pins/editions/policies listed in that extension and **SHALL NOT** redefine QD semantics locally. | Keeps QD/OEE extension pins replayable and non‑shadowing. || **CC‑G2‑Ext‑Interop‑1** | If `G.2:Ext.InteropForms` is used, the pack **SHALL** expose the required interop pins and **SHALL NOT** introduce alternative legality/acceptance semantics. | Prevents “foreign gate” shadowing. |### Common Anti‑Patterns and How to Avoid Them* **AP‑G2‑1: “One true SoTA score.”** **Avoid:** selecting a single unqualified scalar metric as “the” SoTA. **Do instead:** represent evaluation constructs as families/variants; keep partial orders set‑returning (delegated).* **AP‑G2‑2: Fusion without explicit alignment proof.** **Avoid:** merging rival `Tradition` claims into one statement “by common sense.” **Do instead:** preserve parallel Claim Sheets; if consolidation is required, publish explicit alignment proof or keep a divergence record.* **AP‑G2‑3: Hidden protocol drift.** **Avoid:** changing the harvesting protocol (inclusion criteria, windowing, screening rubric) without pins. **Do instead:** pin harvesting policy/profile ids and treat changes as RSCR‑relevant.* **AP‑G2‑4: Unanchored pedagogy.** **Avoid:** micro‑examples without carriers (they become folklore). **Do instead:** bind micro‑examples to [A.10](/generated/patterns/A.10) anchors and declare `entityOfConcern`.* **AP‑G2‑5: Atlas by default.** **Avoid:** writing as if every tradition comparison or NQD/OEE note needs `TraditionAtlasView`, or as if atlas wording renames the palette itself. **Do instead:** keep the base palette and derived front, archive, or shortlist explicit; use atlas form only when several declared views or interpretive qualifiers must be held together, and prefer thinner `DeclaredSubstrateInterpretiveView` when that is enough.### Consequences* **Positive:** Downstream CHR/CAL/dispatch work becomes faster and less ambiguous because the pack is citable and structured.* **Positive:** Plurality is preserved while still enabling disciplined comparability through explicit crossings.* **Positive:** Refresh becomes tractable because pins and typed causes exist.* **Negative:** Adds authoring overhead (ledger, flow record, micro‑examples, explicit pins).* **Negative:** Requires governance discipline to prevent the pack from becoming an uncontrolled “everything bucket”.### RationaleSoTA synthesis is a bottleneck for new `CG‑Frame` work: without a disciplined harvest, downstream formalization (CHR/CAL) and operational selection ([G.5](/generated/patterns/G.5)) either (i) inherit hidden semantic collisions, or (ii) re‑invent incompatible “mini‑standards.”`G.2` resolves this by treating SoTA work as a **publishable kit**: explicit plurality, explicit crossings, explicit evidence anchors, and explicit hand‑offs.### SoTA-Echoing (informative)This pattern aligns its *method options* (via Extensions and authoring practice) with widely used post‑2015 SoTA practices, while keeping FPF’s semantics stable and id‑based:1. **PRISMA 2020 reporting discipline** (Page et al., 2021) *Status:* **Adopt (adapted)** — we adopt the idea of a transparent screening trail as `FlowRecord`, but keep it notation‑independent and concept‑level.2. **Living systematic reviews** (Elliott et al., 2017 and subsequent living‑review practice) *Status:* **Adopt (as optional protocol family)** — the “living” stance is expressed as a harvesting protocol profile (Extension), with explicit freshness windows and RSCR‑relevant change causes.3. **AMSTAR 2 critical appraisal** (Shea et al., 2017) *Status:* **Adapt** — we adapt the idea of structured quality appraisal into Claim Sheet evidence cues, without turning it into a single scalar rating.4. **Science of Science synthesis** (Fortunato et al., 2018) *Status:* **Adopt (as content discipline)** — SoS indicators are treated as families/variants and wired as citable artefacts, not as a single “score”.5. **Disruption / team‑structure indicators** (Wu, Wang & Evans, 2019 and follow‑on work) *Status:* **Adopt (as exemplar family)** — useful as an example of a SoS‑indicator family with material dependence on windowing and corpus definition.6. **Quality‑Diversity and open‑ended generation** (e.g., Fontaine et al., 2020 for CMA‑ME; Wang et al., 2019 for POET) *Status:* **Adopt (as optional annex with explicit pin declarations)** — when QD/OEE is relevant for the `CG‑Frame`, we include generator/method family cards and pin the required edition/policy surfaces via `G.2:Ext.NQDAnnex`, without embedding those semantics into the core pack.### Relations* **Builds on:** * `G.Core` (core invariants, typed RSCR causes, Default Governing Definition Index) * `E.8` (pattern template discipline) * `E.10` (lexical/ontological rules; strict distinction; kind‑suffix discipline) * `E.19` (conformance discipline) * `A.10` (provenance anchors / carriers) * `A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW` (generic interpretive-view and atlas discipline when `TraditionAtlasView` is used) * `A.6.P` (space/view/publication precision restoration when palette/support claims collapse) * `B.3` (trust, freshness/decay as cited governing patterns) * `F.9` (bridges and CL as cited governing patterns) * `F.17` (UTS publication discipline; via delegation) * `G.0` (CG‑Spec legality gate; cited when legality surfaces are referenced) * `G.6` (EvidenceGraph / path citation surfaces when used)* **Used by:** * `G.1` (generator chassis consumes harvested SoTA sets) * `G.3` (CHR authoring consumes operator/object inventory and claim sheets) * `G.4` (CAL authoring consumes operator stubs, acceptance branch scaffolding) * `G.5` (registry/dispatch consumes MethodFamily/GeneratorFamily cards) * `G.10` (shipping cites the pack as payload) * `G.11` (refresh orchestration can re‑invoke harvest via typed causes)* **Relates to:** * `G.13` (interop surfaces when external indices are used) * `F.18` (naming-side support wording when the question is label choice rather than synthesis geometry)### G.2:End---## CHR Authoring for a CG‑Frame: Characteristics, Scales, Levels, Coordinates**Tag.** Architectural pattern (CHR kit; publishes lawful measurement primitives; constrains CAL authoring and selector/dispatch use)**Stage.** *design‑time* (authoring & publication; enables admissible run-time consumption by `G.4` / `G.5`)**Primary output.** `CHR Pack@CG‑Frame` — a notation‑independent, UTS‑published CHR bundle that provides: typed Characteristics/Scales/Levels/Coordinates, legality + guard surfaces, aggregation/comparison specs, RSCR hooks/tests, and provenance pins.**Primary hooks.** `G.1` (CG‑FrameContext), `G.2` (SoTA synthesis inputs), `A.19.CHR` (CHRMechanismSuite boundary + pins), `A.15.3` (SlotFillingsPlanItem baseline), `A.18/C.16` (MM‑CHR legality), `F.1–F.9` (Contexts/UTS/Bridges), `B.3` / `B.3.4` (trust, freshness/decay), `A.10` (provenance anchors/carriers), `G.6` (EvidenceGraph/Path citation), optional `C.18 and C.19` (QD/OEE wiring), `G.11` (refresh orchestration).**Non‑duplication note.** Universal Part‑G invariants (bridge‑only crossings, tri‑state semantics, penalties→`R_eff`‑only, set‑return semantics, P2W split, typed RSCR triggers + alias docking, defaults with one governing definition, linkage discipline) are governed by `G.Core`. This pattern cites them via `G.3:4.1` and delegates where needed.### Problem frameA team is defining or evolving a `CG‑Frame` (via `G.1`) and has plural, competing SoTA traditions and constructs (via `G.2`). The team needs a *admissibility-ready CHR publication* that makes downstream work possible without hidden semantic drift:* **CAL authoring (`G.4`)** needs typed, admissible operands and guard/legality surfaces to build admissibility and acceptance rules (thresholds and policy cut‑offs remain governed by CAL).* **Selector/dispatch (`G.5`)** needs CHR‑typed quantities and explicit provenance pins so selection can remain set-returning and auditable under admissible orders.* **Cross‑context reuse** must be explicit (bridges + loss accounting + pinned policy ids), and refresh must be tractable by typed RSCR causes rather than prose.The resulting publication is a **CHR Pack** that is **CG‑Frame‑scoped**, **notation‑independent**, and **UTS‑published**, with explicit edition/policy pins sufficient for reproducibility and RSCR.### ProblemWithout a disciplined CHR authoring layer, teams repeatedly produce “measurable slots” that are *numerically manipulable but semantically unlawful*:* **Meaning leaks** across contexts (same token, different referent/sense).* **Illicit arithmetic** (e.g., averaging ordinals, mixing units, laundering polarity).* **Hidden normalizations** that silently change scale type, polarity, or admissible transforms.* **Unreproducible comparisons** (missing edition pins for methods/distances/policies; unclear reference plane).* **Unscoped reuse** (no explicit bridge and loss notes; unclear `entityOfConcern` changes).* **Un-auditable aggregation** (no explicit legality surface and guard surface; no proof hooks; unclear Γ‑fold governing-definition assignment).* **Refresh chaos** (changes in names/editions/policies do not map to typed RSCR causes).### Forces| Force | Tension || ------------------------------------------------- | ------------------------------------------------------------------------------ || **Pluralism vs comparability** | Preserve tradition‑specific meaning ↔ enable admissible cross‑tradition use. || **Expressiveness vs legality** | Model rich measurement semantics ↔ block illegal operations “by construction”. || **Portability vs honesty** | Encourage reuse ↔ forbid implicit crossings and hidden loss. || **Ease of authoring vs auditability** | Keep authoring teachable ↔ require explicit pins, provenance, and tests. || **Downstream flexibility vs upstream discipline** | Let CAL/selector choose policies ↔ keep thresholds/policy cut‑offs out of CHR. |### Solution — CHR authoring kit and publication surface#### G.Core linkage (normative)**Builds on:** `G.Core` (Part‑G core invariants; citation/delegation hub)**GCoreLinkageManifest (normative; size‑controlled).**`GCoreLinkageManifest := ⟨CoreConformanceProfileIds := {GCoreConformanceProfileId.PartG.AuthoringBase,GCoreConformanceProfileId.PartG.TriStateGuard,GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted},CorePinSetIds := {GCorePinSetId.PartG.AuthoringMinimal,GCorePinSetId.PartG.CrossingVisibilityPins},// Pins strengthened for CHR authoring (delta over PinSets)CorePinsRequired := {// NOTE: `CG-FrameContext`, `entityOfConcern`, `CNSpecRef.edition`, `CGSpecRef.edition` are already required// by `GCorePinSetId.PartG.AuthoringMinimal` (cite, don’t restate here).UTSRowId[], // required: CHR terms are public ids (Name Cards plus public-id continuity records)PathId[]/PathSliceId[], // required: worked examples/tests and refresh anchoring cite pathsReferencePlane, // required: definitional claims are plane-scopedΦ/Ψ/Φ_plane policy-ids?, // iff crossings/plane moves are exercised in examples or importsΓFoldRef.edition? // iff an explicit Γ-fold artefact is pinned (otherwise use DefaultId)// NOTE: method-/discipline-specific pins (e.g., DescriptorMapRef/DistanceDefRef/DHCMethodRef/InsertionPolicyRef)// are declared only inside Extensions (e.g., `G.3:Ext.QD_OEE_Wiring`) to keep core linkage universal.},// consumed iff any published `CHR.AggregationSpec` relies on default Γ-fold (no explicit override pinned)DefaultsConsumed := { DefaultId.GammaFoldForR_eff },RSCRTriggerKindIds := {RSCRTriggerKindId.EvidenceSurfaceEdit,RSCRTriggerKindId.TokenizationOrNameChange,RSCRTriggerKindId.CrossingBundleEdit,RSCRTriggerKindId.ReferencePlaneEdit,RSCRTriggerKindId.EditionPinChange,RSCRTriggerKindId.PolicyPinChange,RSCRTriggerKindId.DefaultGoverningDefinitionChange,RSCRTriggerKindId.FreshnessOrDecayEvent,RSCRTriggerKindId.LegalitySurfaceEdit,RSCRTriggerKindId.BaselineBindingEdit}⟩`*(Nil‑elision + expansion rule are per `G.Core:4.2`. This pattern does not redefine the semantics of core conformance ids, trigger kinds, or defaults; it only declares applicability and required pins.)*#### Output surface: CHR Pack@CG‑Frame (normative)`CHR Pack@CG‑Frame` is the CHR kit payload that downstream patterns cite and pin (it is not a “shadow spec” for CN/CG).**Minimum exported objects (kit surface):*** `CHR.Characteristic[]`* `CHR.Scale[]`* `CHR.Level[]` *(when the scale type requires explicit level sets / order structure)** `CHR.Coordinate[]` *(encodings + legality annotations; never an implicit “upgrade” of measurement structure)** `CHR.Guards` *(guard macro surface; semantics governed by cited definitions; see `G.Core` and `A.18`)** `CHR.LegalityMatrix` *(admissible operations per scale type / unit / polarity regimes)** `CHR.AggregationSpecs` *(typed aggregators/comparators + proof hooks + edition pins where applicable)** `UTS` publication bundle: Name Cards (twin labels), public-id continuity notes, and (when applicable) bridge and loss notes* RSCR artefacts: `RSCRTestId[]` + worked examples + provenance pins (ReferencePlane, Path/PathSlice, policy ids)**Mandatory provenance pins (conceptual, notation‑independent):*** `ReferencePlane`* `PathId/PathSliceId` citations for worked examples/tests* R‑anchors (conceptual; KD‑CAL lanes when used) realised via `PathId/PathSliceId` and, where applicable, `A.10` anchor/carrier refs* policy pins used by crossings or plane moves (when exercised)* edition pins for any referenced method or metric definitions that affect interpretation#### CHR authoring chassis (S1–S8)**S1 — Charter the measurement scope (scope anchor).**Declare the CHR `U.BoundedContext` and scope for the CG‑Frame, including: `entityOfConcern` boundaries, `ReferencePlane`, freshness/decay expectations, and the list of contested terms likely to require bridging. Output a design‑time `MeasurementCharter` and `KindMap@Context`.If freshness/decay expectations are anything beyond an explicit “non‑decaying” declaration, wire them via`G.3:Ext.DecayWiring` (governing pattern: `B.3.4`) rather than encoding decay semantics in CHR prose.If assurance‑subtype lane tags are used (e.g., TA/VA/LA), declare the lane regime here so downstream evidence discipline can remain lane‑pure (taxonomy/semantics governed by `B.3`; evidence‑path representation & audit governed by `G.6`; this pattern only records wiring).**Lane docking (wiring‑only; normative).**If `EvidenceLanes` are used, the charter MUST:* enumerate the lane tags used (e.g., TA/VA/LA) and cite their governing pattern taxonomy (governed by `B.3`), plus the upstream provenance for their use when available (e.g., `SoTAPaletteDescriptionId` via `G.3:Ext.SoTAPackInputs`);* expose any lane‑dependent tolerances / proof requirements via explicit pins (policy‑id and/or edition‑pinned refs), not prose;* treat lane tags as provenance metadata (not Contexts): they MUST NOT be “bridged away” or silently mixed;* if any cross‑lane comparison/aggregation is claimed, it MUST be explicit and pinned to the governing acceptance/evidence policy (typically `G.4`) and auditable via evidence paths (`G.6`); otherwise downstream consumers treat it as illegal.*Crossing semantics and penalty routing are cited via `G.Core` (do not restate).***S2 — Mint or reuse terms (UTS‑first).**For each candidate characteristic, scale, level, or coordinate term: attempt reuse; otherwise mint via UTS Name Cards with twin labels and public-id continuity notes. When a term is imported across contexts, the import must be explicit and auditable (bridge and loss notes live with the crossing artefacts; CHR only cites them).**S3 — Define `CharacteristicCard` (the CHR unit of meaning).**A CharacteristicCard is the minimum unit CHR publishes for downstream legality. It SHOULD include (field names are indicative; semantics governed by cited definitions):`CharacteristicCard := ⟨ UTSRowId, Context, ReferencePlane, ObjectKind, Intent, Definition (typed), ObservableOf := ⟨instrument/protocol (A.10 anchors/carriers), uncertainty model, validity window⟩, EvidenceLanes? (KD‑CAL lanes; wiring only; semantics governed by `[G.4](/generated/patterns/G.4)` / `[G.6](/generated/patterns/G.6)`), ScaleRef, Polarity ∈ {↑, ↓, ⊥}, Domain/Range, UnitSet, Bounds / zero semantics (as applicable), Freshness / half‑life (or explicit `NonDecayingDecl`; freshness/decay semantics governed by `[B.3.4](/generated/patterns/B.3.4)`), Missingness semantics (typed; include a classification/mapping when non‑trivial; downstream tri‑state handling is per G.Core), Stability/Reliability notes, RoleDecls? := RoleDecl[] (wiring‑only; each role declaration names its governing pattern + required pins; see `G.3:4.5`), QD.Role? ∈ {Q, D, QD-score} (interop alias for `RoleDecl` with `GoverningPatternId = [C.18](/generated/patterns/C.18)`; see `G.3:Ext.QD_OEE_Wiring`), Micro‑examples (R‑anchors: Path/PathSlice cited; lane tags where applicable)⟩`Where `RoleDecl := ⟨ roleLabel, GoverningPatternId, EditionPins?, PolicyPins? ⟩` (wiring-only; the value of `GoverningPatternId` names the FPF pattern that governs the role declaration semantics).Rules (CHR‑governed intent, semantics governed by cited definitions where indicated):* Scale/unit/polarity legality obligations cite MM‑CHR governing definitions (`A.18` and `C.16`) and must be *checkable* by downstream patterns.* Missingness must be typed so downstream can apply tri‑state outcomes without silent coercion (tri‑state semantics are governed by `G.Core`).* If `EvidenceLanes` are recorded, they are only lane tags for downstream evidence discipline (taxonomy governed by `B.3`; audit surface: `G.6`; any cross‑lane policy is governed by `G.4`); this pattern does not introduce lane semantics or invent bridge‑like constructs.* If `RoleDecls` are used, each declaration MUST cite the FPF pattern that governs the declaration, for example `C.18` or `C.19`, and surface the edition and policy pins required by that governing pattern; CHR does not define role semantics locally.* **Role docking (normative, wiring-only):** if any `RoleDecl` is present with `GoverningPatternId = X`, then `G.3` MUST include (or explicitly cite) a corresponding `GPatternExtension` block whose governing definition is `X` (or whose `Uses` includes `X`) and that surfaces the required pins for that role family. Otherwise the role declaration is non-conformant (it is an undocked semantic fragment).* **Freshness docking (normative, wiring-only):** if a characteristic’s freshness/half-life is defined via a named decay model/policy (rather than a pure local statement), the relevant policy/ref MUST be pinned and cited through `B.3.4` via `G.3:Ext.DecayWiring`.* If a characteristic is intended to be *promoted into* `CG‑Spec`, the linkage is explicit and edition‑pinned (wiring lives in an Extension; semantics governed by `G.0`).**S4 — Define `ScaleCard` and `LevelCard` (lawful measurement).**Publish the scale type and admissible transforms, plus levels/orders when applicable. CHR does not invent new legality semantics; it cites MM‑CHR governing definitions and makes the legality surface concrete for the frame’s characteristics.Typical distinctions that must be representable:* **Nominal / categorical:** equality + counting; transforms are permutations.* **Ordinal:** order‑preserving transforms; no arithmetic that presupposes intervals.* **Interval:** affine transforms; differences meaningful; means may be lawful if justified.* **Ratio:** positive scalar transforms; ratios meaningful; products/sums subject to unit discipline.* **Count / rates:** explicit exposure/timebase requirements; rate conversions must be explicit.* **Cyclic:** wrap‑around discipline + principal interval declaration.**S5 — Define `CoordinatePolicy` (encodings without hidden cardinalization).**When a numeric coordinate/embedding is used for convenience or tooling, CHR MUST publish:* what invariants are preserved (order only / ratios / topology / wrap‑around),* what remains illegal,* what proof hooks are required if a structure with higher scale-type commitment is claimed.A coordinate never silently upgrades a scale type; if an upgrade is claimed, the proof requirement is explicit and carried by MM-CHR governing definitions.**S6 — Publish legality + guard surfaces (Guard Macros + LegalityMatrix).**CHR publishes a `CHR.LegalityMatrix` and a `CHR.Guards` surface that downstream operators can reference.Guard macro names are allowed as authoring ergonomics, but their semantics MUST cite governing definitions (no “shadow semantics” in this pattern). Examples of macro intents (governing definitions in parentheses):* `CSLC_PROOF_REQUIRED(x)` (MM‑CHR legality governing definitions: `A.18/C.16`)* `UNKNOWN_TRI_STATE(x)` (tri‑state semantics governed by `G.Core`)* `UNIT_CHECK(x)` (MM‑CHR legality governing definitions)* `RETURN_SET_FOR_PARTIAL_ORDERS()` (set‑return semantics governed by `G.Core`)* `METRIC_EDITION_REF(...)` (edition‑pin discipline governed by `G.Core`; metric semantics governed by `C.18`/`C.21` as applicable)**S7 — Publish `AggregationSpecs` (typed, admissible, reproducible).**CHR may publish typed aggregation/comparison specs that are *safe by construction* and usable as building blocks by `G.4` and `G.5`. For any published spec:* The legality regime is explicit (scale/unit/polarity constraints + required proof hooks).* If a contributor folding policy (Γ‑fold) is used and not explicitly overridden, cite `DefaultId.GammaFoldForR_eff` through `G.Core.DefaultGoverningDefinitionIndex`; do not restate the default here.* If method‑role declarations imply metric‑driven comparisons (e.g., QD roles), the relevant edition/policy pins are surfaced (wiring lives in an Extension; semantics governed by the referenced patterns).**S8 — Publish, test, and evolve (UTS + RSCR readiness).**Publish the CHR pack and associated Name Cards to UTS. Attach:* RSCR tests that check legality and guard coverage and reject illegal ops,* worked examples with Path/PathSlice provenance,* refresh/decay notes and deprecations with lexical continuity.This step prepares the RSCR loop but does not govern orchestration (governing definition: `G.11`).#### Interfaces (normative)| Interface | Consumes | Produces || ----------------------------------- | ------------------------------------------------- | ---------------------------------------------------------------- || **[G.3](/generated/patterns/G.3)‑1 Charter_CHR** | `CG‑FrameContext` ([`G.1`](/generated/patterns/G.1)), SoTA inputs ([`G.2`](/generated/patterns/G.2)) | `MeasurementCharter`, `KindMap@Context` || **[G.3](/generated/patterns/G.3)‑2 MintOrReuse_Terms** | candidate terms + UTS registry | Name Cards + UTS ids for `Characteristic/Scale/Level/Coordinate` || **[G.3](/generated/patterns/G.3)‑3 Define_Characteristic** | `MeasurementCharter`, candidate semantics | `CHR.Characteristic[]` (CharacteristicCards) || **[G.3](/generated/patterns/G.3)‑4 Define_ScaleLevel** | CharacteristicCard + MM‑CHR rules | `CHR.Scale[]`, `CHR.Level[]` || **[G.3](/generated/patterns/G.3)‑5 Define_CoordinatePolicy** | Scale/Level + use‑case constraints | `CHR.Coordinate[]` + legality annotations || **[G.3](/generated/patterns/G.3)‑6 Publish_GuardsAndLegality** | Scale/Level/Coordinate set | `CHR.Guards`, `CHR.LegalityMatrix` || **[G.3](/generated/patterns/G.3)‑7 Publish_AggregationSpecs** | CHR set + legality hooks + (optional) metric refs | `CHR.AggregationSpecs` (+ proofs/refs + pins) || **[G.3](/generated/patterns/G.3)‑8 Publish_CHRPack** | all CHR artefacts + tests/examples | `CHR Pack@CG‑Frame` + UTS rows + RSCR tests |#### Extensions (pattern‑scoped; non‑core)All blocks below are `GPatternExtension` modules (PatternScopeId-scoped; **not** new PatternIds). They store wiring only and cite governing patterns.**GPatternExtension: SuiteBoundaryLinkage*** **PatternScopeId:** `G.3:Ext.SuiteBoundaryLinkage`* **GPatternExtensionId:** `SuiteBoundaryLinkage`* **GPatternExtensionKind:** `InteropSpecific`* **GoverningPatternId:** `A.19.CHR`* **Uses:** `{A.19.CHR, A.15.3}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `CHRMechanismSuiteDescriptionRef.edition?` *(when the suite description is cited as a reproducibility baseline)* * `CHRMechanismSuiteSlotFillingsPlanItem` refs *(when planned baseline binds CHR artefacts into WorkPlanning)** **RSCRTriggerKindIds:** `{RSCRTriggerKindId.BaselineBindingEdit, RSCRTriggerKindId.EditionPinChange}`* **Notes (wiring‑only):** This module binds CHR authoring outputs to the P2W seam (`SlotFillingsPlanItem`); suite semantics and membership are governed by `A.19.CHR`.**GPatternExtension: SoTAPackInputs*** **PatternScopeId:** `G.3:Ext.SoTAPackInputs`* **GPatternExtensionId:** `SoTAPackInputs`* **GPatternExtensionKind:** `DisciplineSpecific`* **GoverningPatternId:** `G.2`* **Uses:** `{G.2}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `ClaimSheetId[]` / operator & object inventory refs (as cited inputs) * `SoTAPaletteDescriptionId?` (when palette/traces are cited; used to dock contested‑term inventory and (if present) lane tags/tolerances) * `BridgeMatrixId?` (when terms/constructs are imported across traditions) * `UTSRowId[]` drafts/aliases from synthesis* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.TokenizationOrNameChange, RSCRTriggerKindId.CrossingBundleEdit}`* **Notes (wiring‑only):** SoTA pluralism inputs are governed by `G.2`; this module only specifies which synthesis artefacts are cited while authoring CHR.**GPatternExtension: CGSpecPromotionWiring*** **PatternScopeId:** `G.3:Ext.CGSpecPromotionWiring`* **GPatternExtensionId:** `CGSpecPromotionWiring`* **GPatternExtensionKind:** `InteropSpecific`* **GoverningPatternId:** `G.0`* **Uses:** `{G.0}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `CGSpecRef.edition` *(when a characteristic is promoted/linked into `CG‑Spec`)* * `CHR.Characteristic.id` pointers included in `CG‑Spec.Characteristics := [...]` *(no shadow ids; CG‑Spec stores pointers, see `G.0`)** **RSCRTriggerKindIds:** `{RSCRTriggerKindId.LegalitySurfaceEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange}`* **Notes (wiring‑only):** Promotion semantics and legality gate governing-definition assignment stays with `G.0`; CHR only pins and cites.**GPatternExtension: MMCHRLegalityWiring*** **PatternScopeId:** `G.3:Ext.MMCHRLegalityWiring`* **GPatternExtensionId:** `MMCHRLegalityWiring`* **GPatternExtensionKind:** `DisciplineSpecific`* **GoverningPatternId:** `A.18`* **Uses:** `{A.17, A.18, C.16}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * CSLC legality proof anchors/carriers (ids/refs as defined by MM‑CHR governing definitions; cite `A.18/C.16`) * Unit coherence references (where units exist)* **RSCRTriggerKindIds:** `{RSCRTriggerKindId.LegalitySurfaceEdit, RSCRTriggerKindId.ReferencePlaneEdit}`* **Notes (wiring‑only):** This module wires CHR artefacts to MM‑CHR legality proof obligations; legality semantics are governed by the referenced patterns.**GPatternExtension: DecayWiring*** **PatternScopeId:** `G.3:Ext.DecayWiring`* **GPatternExtensionId:** `DecayWiring`* **GPatternExtensionKind:** `DisciplineSpecific`* **GoverningPatternId:** `B.3.4` *(freshness/decay semantics)** **Uses:** `{B.3.4, G.6}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `FreshnessWindowDeclRef` *(or equivalent window pin, as defined by the governing definition)* * `DecayPolicyIdRef?` *(policy-bound; if decay model is referenced by id)* * `PathSliceId[]` *(affected evidence carriers / examples that witness drift)** **RSCRTriggerKindIds:** `{RSCRTriggerKindId.FreshnessOrDecayEvent, RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.BaselineBindingEdit}`* **Notes (wiring‑only):** CHR does not define decay semantics; it only pins the defined by the governing pattern window/policy and ensures refresh can be triggered on decay events.**GPatternExtension: QD_OEE_Wiring*** **PatternScopeId:** `G.3:Ext.QD_OEE_Wiring`* **GPatternExtensionId:** `QD_OEE_Wiring`* **GPatternExtensionKind:** `MethodSpecific`* **GoverningPatternId:** `C.18`* **Uses:** `{C.18, C.19}`* **⊑/⊑⁺:** `∅`* **RequiredPins/EditionPins/PolicyPins (minimum):** * `DescriptorMapRef.edition` *(if any Characteristic declares descriptor roles)* * `DistanceDefRef.edition` *(if any Characteristic declares distance roles)* * `DHCMethodRef.edition` *(if any Characteristic is used as Q / QD-score)* * `InsertionPolicyRef?` *(when archive insertion semantics are declared for reproducibility)** **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`* **Notes (wiring‑only):** QD/OEE semantics are governed by `C.18 and C.19`. CHR only surfaces method‑role declarations (via `RoleDecls` or the interop alias `QD.Role`) and the edition/policy pins required for reproducible archive/front interpretation.### Archetypal Grounding**AG‑1 — ML fairness auditing (post‑2015 selective and set‑valued practice).***System:* a CG‑Frame for evaluating deployed classifiers across cohorts with explicit abstention/defer behavior.*CHR authoring:* publish `DemographicParityGap` and `EqualizedOddsGap` as Characteristics with:* explicit ReferencePlane (deployment population + sampling regime),* `ObservableOf` (audit protocol + uncertainty model + window),* interval scale (bounded; zero semantics explicit),* missingness semantics (cohort sparsity and label noise are typed),* legality surfaces and guard surfaces that forbid illicit cohort mixing and require explicit proof hooks for aggregation across cohorts.*Downstream:* CAL acceptance binds thresholds and failure behavior; selector remains set‑returning under partial orders and may treat “defer/abstain” as a first‑class outcome (tri‑state semantics pinned through `G.Core`).**AG‑2 — Clinical diagnostics (post‑2015 evidence‑aware evaluation).***System:* a CG‑Frame for comparing diagnostic pipelines under evolving datasets and protocols.*CHR authoring:* publish `Sensitivity` and `Specificity` as ratio‑scale, dimensionless Characteristics on `[0,1]`, with:* explicit `ObservableOf` (trial protocol, inclusion criteria, uncertainty model),* freshness/decay expectations (protocol drift is modelled as decay),* legality surfaces that forbid averaging incompatible ordinal labels (e.g., severity grades) and require explicit unit/exposure constraints for any derived rate.*Downstream:* CAL acceptance governs thresholds and guard‑bands; evidence wiring is cited via Path/PathSlice to make refresh triggers actionable.**AG‑3 — Quality‑Diversity / Illumination (post‑2015 MAP‑Elites/CMA‑ME lineage).***System:* a CG‑Frame where selection returns archives/fronts rather than a single winner.*CHR authoring:* declare which Characteristics play Q/D/QD‑score roles and pin the metric definitions (descriptor map, distance definition, method editions) so archives are reproducible across runs and refresh can be triggered on edition changes. CHR does not scalarize partial orders; set‑return semantics are pinned through `G.Core`.### Bias‑AnnotationCHR authoring is where many biases become “baked in” as measurement choices. Typical risks:* **Proxy bias:** a convenient observable substitutes for the intended construct. Mitigation: require `ObservableOf` + ReferencePlane + micro‑examples; force explicit “what is being measured” rather than relying on labels.* **Population and protocol shift:** a characteristic’s meaning changes when the sampling regime or protocol changes. Mitigation: explicit validity windows and freshness/decay expectations; edition pins for protocol definitions; RSCR triggers on freshness/decay events and evidence surface edits.* **Ordinal misuse bias:** ordinal ratings treated as interval/ratio by convenience. Mitigation: publish scale type + admissible transforms; legality matrix + guard macros; reject coordinate upgrades without proof hooks.* **Cross‑tradition/cross‑context bias:** imported terms erase local meaning. Mitigation: require explicit imports and loss notes; downstream penalties route to `R_eff` only (pinned through `G.Core`), making loss visible rather than silently altering F/G semantics.* **Metric gaming bias (QD and evaluation):** changing descriptors/distances changes what “diverse” means. Mitigation: edition‑pin metric definitions and make role declarations explicit (wiring via `C.18 and C.19`).### Conformance Checklist (normative)| ConformanceId | Statement || ----------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- || **CC‑G3‑CoreRef** | [`G.3`](/generated/patterns/G.3) is conformant only if the applicable `G.Core` obligations declared in `G.3:4.1` are satisfied (effective expansion of profiles/sets + deltas; explicit pins; typed RSCR triggers; defaults with one governing definition). || CC‑G3‑01 | `CHR Pack@CG‑Frame` is published as a notation‑independent kit payload with the minimum exported objects listed in `G.3:4.2`. || CC‑G3‑02 | Every `CHR.Characteristic` has an explicit declared `Context`, an explicit `ReferencePlane`, and a filled `ObservableOf` field (instrument/protocol + uncertainty model + validity window). || CC‑G3‑03 | Every `CHR.Characteristic` declares its `ScaleRef`, `Polarity`, and `UnitSet` (or an explicit “unitless” declaration), plus bounds/zero semantics where applicable. || CC‑G3‑04 | Missingness is typed in the CHR artefacts such that downstream tri‑state handling is possible without silent coercion. *(Tri‑state semantics are governed by `G.Core`; the typing obligation is CHR‑local.)* || CC‑G3‑05 | `CHR.Scale` / `CHR.Level` artefacts encode the scale type and admissible transforms, and make illicit arithmetic checkable by downstream consumers. || CC‑G3‑06 | Any published `CHR.Coordinate` includes a `CoordinatePolicy` that states preserved invariants and explicit non‑entitlements; coordinates do not silently upgrade measurement structure. || CC‑G3‑07 | `CHR.LegalityMatrix` and `CHR.Guards` exist and are referenced by downstream operator authoring; semantics are governed by cited definitions (MM‑CHR and `G.Core`), not duplicated locally. || CC‑G3‑08 | `CHR.AggregationSpecs` are typed and legality‑constrained; where Γ‑fold is required and no explicit override is pinned, cite `DefaultId.GammaFoldForR_eff` through `G.Core.DefaultGoverningDefinitionIndex`. || CC‑G3‑09 | If any characteristic is intended for promotion into `CG‑Spec`, the linkage is explicit and edition‑pinned (no shadow ids). *(Governing definition: [`G.0`](/generated/patterns/G.0); wiring via `G.3:Ext.CGSpecPromotionWiring`.)* || CC‑G3‑10 | UTS Name Cards exist for public ids minted or evolved by the CHR pack (twin labels plus public-id continuity notes). *(Delegation target: `CC‑GCORE‑UTS‑1` via `CC‑G3‑CoreRef`.)* || CC‑G3‑11 | Worked examples and RSCR tests exist and cite `PathId/PathSliceId`; they cover illegal‑op refusal, unit and scale constraints, polarity invariants, and coordinate non‑entitlements. || CC‑G3‑12 | Thresholds/guard‑bands are not embedded in CHR artefacts; they remain governed by CAL acceptance clauses ([`G.4`](/generated/patterns/G.4)). || CC‑G3‑13 | When method‑role declarations are present (via `RoleDecls` and/or `QD.Role` alias), each declaration is **docked** to its governing pattern via a corresponding `G.3:Ext.*` module, and the edition and policy pins required by the governing pattern are surfaced to make downstream interpretation reproducible. *(QD/OEE governing patterns: [`C.18`](/generated/patterns/C.18) and [`C.19`](/generated/patterns/C.19); wiring via `G.3:Ext.QD_OEE_Wiring`.)* || CC‑G3‑14 | **Evidence wired.** Each `CHR.Characteristic` links to R‑anchors via `PathId/PathSliceId` (and, where applicable, [`A.10`](/generated/patterns/A.10) anchor/carrier refs), so downstream evidence discipline ([`G.6`](/generated/patterns/G.6)) can audit legality and guard claims. || CC‑G3‑15 | An `Archetypal Grounding` section exists with at least two domain‑distinct examples that demonstrate lawful CHR typing/legality and the CHR↔CAL separation (notably: no thresholds in CHR). || CC‑G3‑16 | If `EvidenceLanes` are used, lane tags are declared with a citation to their governing pattern taxonomy ([`B.3`](/generated/patterns/B.3)), and any lane‑dependent tolerances/proof requirements are explicitly pinned (policy‑id / edition refs). Cross‑lane comparison/aggregation is **illegal by default** unless an explicit governing-pattern policy makes it lawful (typically [`G.4`](/generated/patterns/G.4)), and it must be auditable via evidence paths ([`G.6`](/generated/patterns/G.6)). || CC‑G3‑17 | If the CHR outputs are bound into the planned baseline / suite seam, the binding uses `CHRMechanismSuiteSlotFillingsPlanItem` as defined in [`A.19.CHR`](/generated/patterns/A.19.CHR) + [`A.15.3`](/generated/patterns/A.15.3) (no local baseline variants; wiring via `G.3:Ext.SuiteBoundaryLinkage`). || CC‑G3‑18 | **Freshness is explicit.** Each `CHR.Characteristic` declares a validity window and either (i) an explicit `NonDecayingDecl` or (ii) a freshness/half‑life statement that is pinned to the governing pattern ([`B.3.4`](/generated/patterns/B.3.4)) when policy‑bound (`G.3:Ext.DecayWiring`). Changes in decay windows/policies participate in RSCR via canonical trigger kinds declared in `G.3:4.1`. |### Common Anti‑Patterns and How to Avoid Them* **Hidden cardinalization.** Don’t treat ordinal encodings as interval/ratio; do publish coordinate policies that explicitly preserve order‑only invariants and forbid arithmetic upgrades.* **Unit laundering.** Don’t add or average quantities with incompatible units; do force explicit unit discipline and legality checks via MM‑CHR governing definitions.* **Polarity drift.** Don’t rely on “higher is better” implicitly; do publish polarity explicitly and make downstream use auditable.* **Threshold leakage into CHR.** Don’t embed policy cut‑offs in CHR; do keep thresholds in CAL acceptance artefacts.* **Unpinned semantics.** Don’t cite “the metric” or “the distance” without edition pins; do require edition‑pinned references when semantics affect interpretation.* **Unscoped reuse.** Don’t reuse CHR terms across contexts without explicit import and loss notes; do keep crossings explicit and auditable (pinned through `G.Core`).### Consequences* **Legality becomes checkable.** Downstream patterns can reject illegal operations and rely on explicit legality surfaces rather than implicit conventions.* **Comparability without semantic flattening.** Plural traditions remain representable because CHR preserves local meaning while making lawful relations explicit.* **Reproducible downstream behavior.** Edition/policy pins make “why did this change?” answerable and RSCR actionable.* **Authoring overhead.** The pattern shifts effort to up‑front authoring: explicit cards, pins, and tests are non‑optional when CHR becomes a public kit surface.### RationaleCHR is the point where “numbers start moving” *only if* measurement semantics are stable enough to support lawful downstream reasoning. By making scale/unit/polarity explicit, publishing legality and guard surfaces, and requiring provenance pins, CHR authoring prevents downstream mechanisms from silently inventing their own legality assumptions.Separating core invariants into `G.Core` prevents drift and ensures Part‑G‑wide properties (tri‑state, penalty routing, set‑return semantics, RSCR typing, Default Governing Definition Index) cite `G.Core` as their governing definition, while CHR remains responsible for CHR‑specific kit surfaces.### SoTA‑EchoingThis pattern aligns with post‑2015 best practice by:* treating abstention/defer and set‑valued outcomes as first‑class design objects (consistent with modern selective prediction and set‑valued reporting practice),* keeping multiobjective and archive‑based reasoning set‑returning rather than silently scalarizing (consistent with QD/illumination and open‑ended evaluation practice after 2015),* making evaluation semantics reproducible through explicit edition/policy pinning (aligned with the modern emphasis on reproducibility and “specifying the evaluation surface” rather than only reporting metrics),* modularizing method‑family specifics (QD/OEE, explore‑exploit) via explicit wiring and governing-definition assignment rather than embedding method semantics into universal measurement legality.### Relations**Builds on:** `G.Core`, `G.1`, `G.2`, `G.6` (EvidenceGraph / Path citation), `A.19.CHR`, `A.15.3`, `A.17–A.18/C.16` (MM‑CHR), `F.1–F.9` (Contexts/UTS/Bridges), `B.3` / `B.3.4`, `A.10`, `E.10`, `E.5.1–E.5.3`.**Uses (via Extensions):** `G.0` (promotion/linkage to `CG‑Spec`), optional `C.18 and C.19` (QD/OEE wiring).**Publishes to:** `G.4` (admissible operators plus legality and guard macros and freshness pins), `G.5` (role declarations plus pins for reproducibility), `UTS` (Name Cards and public-id continuity notes), RSCR tests and hooks.**Constrains:** any CAL/LOG/selector usage that consumes CHR (must treat CHR artefacts as typed/legal surfaces, not as prose hints).### G.3:End## CAL Authoring for a CG-Frame: Operators, Acceptance Clauses, Evidence Wiring**Tag.** Architectural pattern (publishes `CAL Pack@CG-Frame`; consumes `CHR Pack@CG-Frame`; constrains selector/dispatcher usage; binds GateCrossing discipline; exposes `ReferencePlane` and penalty/guard policy pins to `SCR`)**Stage.** design‑time (authoring & publication; enables lawful run‑time evaluation)**Primary output.** A notation‑independent `CAL Pack@CG-Frame` containing:`CAL.Charter@Context`, `CAL.Operator[]`, `CAL.Acceptance[]`, `CAL.Flow[]`,`CAL.EvidenceProfiles`, `CAL.ProofLedger`, **optional** `CAL.NQD[]` (when declared),UTS entries (Name Cards with twin labels and public-id continuity notes, including deprecations and lexical-continuity notes),RSCR tests, Worked‑Examples, and a `TaskMap@Context` (`TaskMap`; handoff record consumed by `G.5`).**Primary hooks.** `G.Core` (Part‑G invariants + RSCR trigger catalogue + Default Governing Definition Index), `G.1` (CG‑FrameContext), `G.2` (SoTA Synthesis Pack), `G.3` (CHR Pack), `G.0` (CG‑Spec legality gate), `A.19` (CN‑Spec), `A.18` (CSLC), `A.10` (provenance anchors), `B.3` (trust / freshness / decay), `E.18` + `A.21` + `F.9`/`F.17`/`E.17` (GateCrossing / CrossingBundle harnesses), `G.6` (EvidenceGraph / PathId / PathSliceId; wired via Extensions), `G.5` (Selector & Dispatch), `G.10` (shipping), `G.11` (refresh orchestration), plus Contexts/UTS/LEX disciplines already fixed elsewhere in the spec.**Non‑duplication note.** Universal Part‑G invariants (no shadow specs, crossing visibility, tri‑state guard, penalties→`R_eff`‑only, set‑return semantics, P2W split, typed RSCR causes, Default Governing Definition Index, shipping boundary) are governed in `G.Core` and are pulled into `G.4` only through the `G.Core linkage` manifest in **G.4:4.1** (and via explicit delegations in CC).### Problem frameA CG‑Frame has:* a declared `CG-FrameContext` (scope, EntityOfConcern, plane),* a plurality of method traditions and claims (SoTA inputs), and* CHR‑typed measurement constructs (`Characteristic/Scale/Coordinate` + legality guard macros).Before any run‑time selection, comparison, aggregation, or selected-set formation is executed downstream, the CG‑Frame needs an explicit, auditable **CAL Pack** that:1. defines *what operators exist* and what they are allowed to do over CHR types,2. externalizes *fit‑for‑purpose acceptance* as typed predicates (with Context‑local thresholds), and3. binds these choices to an evidence wiring surface (lanes, provenance anchors, policy pins, and refresh triggers) so that downstream selection, logging, parity, and shipping can cite *stable ids* rather than re‑inventing semantics.This pattern provides the design‑time authoring kit and the publication surface for CAL artifacts, while delegating Part‑G‑wide invariants to `G.Core` and CN-Spec and CG-Spec legality to `CG‑Spec`/`CN‑Spec`.### ProblemTeams repeatedly face drift and ambiguity in the CAL Pack that sits between “typed measurements exist” and “a selector/dispatcher runs”:* **Illicit operations** slip in (implicit cardinalization, unit laundering, ordinal arithmetic).* **Acceptance is scattered** (thresholds embedded in code or in CHR prose; predicates not typed; unknown handling inconsistent).* **Evidence wiring is underspecified** (which provenance anchors matter, what policy ids are in force, what is plane‑scoped, what changes must trigger refresh).* **Cross‑context imports are silent** (hidden reuse of constructs across contexts or planes/editions without published GateCrossings and loss accounting).* **Tooling artifacts become semantics** (vendor flags or implementation details substitute for a conceptual specification).### Forces* **Expressiveness vs legality.** CAL must allow useful comparisons/aggregations while staying lawful under CHR typing and legality gates.* **Pluralism vs comparability.** Multiple method traditions must coexist without forcing premature unification, yet remain cross‑citable and auditable.* **Decision support vs auditability.** CAL must support selection and selected-set formation while preserving explicit, reviewable assumptions and proofs.* **Exploration vs assurance.** CAL must support exploratory regimes (probing, novelty, open‑ended search) without letting un‑assured outputs silently become dominance claims.* **Locality vs portability.** CAL must be Context‑local by default but prepared for explicit reuse via Bridges and published crossing bundles.### Solution — CAL authoring kit and publication surface#### G.Core linkage (normative)**Builds on:** `G.Core` (Part‑G core invariants; citation/delegation hub)**GCoreLinkageManifest (normative).** Canonical shape, Nil‑elision, and the Expansion rule are defined in `G.Core`.`GCoreLinkageManifest := ⟨CoreConformanceProfileIds := {GCoreConformanceProfileId.PartG.AuthoringBase,GCoreConformanceProfileId.PartG.TriStateGuard,GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted,GCoreConformanceProfileId.PartG.ShippingBoundary},CorePinSetIds := {GCorePinSetId.PartG.AuthoringMinimal,GCorePinSetId.PartG.CrossingVisibilityPins},CorePinsRequired := {UTSRowId[], // CAL artefacts are public ids (Name Cards plus public-id continuity notes)ΓFoldRef.edition? // only when an explicit Γ‑fold override is pinned (otherwise use DefaultId)},// consumed iff no explicit `ΓFoldRef.edition` override is pinnedDefaultsConsumed := { DefaultId.GammaFoldForR_eff },RSCRTriggerSetIds := { GCoreTriggerSetId.SoTAHarvestSynthesis },RSCRTriggerKindIds := { // deltas (Expansion rule applies) RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.DefaultGoverningDefinitionChange, RSCRTriggerKindId.BaselineBindingEdit}⟩`By the `G.Core` Expansion rule, the effective conformance ids / trigger kinds / pin obligations for `G.4` are the expansions of the referenced profiles/sets/pin‑sets plus the explicit deltas above.Notes (normative intent, delegated semantics):* The semantics of tri‑state outcomes, penalty routing, set‑return discipline, crossing visibility, P2W split, typed RSCR causes, and the Default Governing Definition Index are governed in `G.Core` and are not redefined here.* EvidenceGraph/Path pins (when used) are declared only via **`G.4:Ext.EvidenceGraphWiring`** in **G.4:4.5** (so `G.Core linkage` stays minimal and does not “pull in” `G.6` by default).* Method‑specific pins (e.g., QD descriptor/distance/insert policy pins; open‑ended transfer rules pins) MUST appear only in **Extensions** blocks (see **G.4:4.5**) and MUST NOT introduce competing defaults.#### CAL Pack@CG-Frame surface (kit governed by this pattern)`CAL Pack@CG-Frame` is the CG‑Frame’s published CAL Pack. Minimally, it provides:* `CAL.Charter@Context` — scope anchor for this CAL pack: * cites `CG-FrameContext`, `entityOfConcern`, `ReferencePlane`, * cites the governance card and legality gate (`CNSpecRef`, `CGSpecRef`) by edition pins, * records the “assumption envelope” that acceptance predicates rely on (without minting a new governance card or legality gate). * emits `TaskMap@Context` (`TaskMap`) as the canonical handoff record to `G.5` (task→gates/flows/evidence pins).* `CAL.Operator[]` — typed operator cards (UTS‑published): * explicit signature over CHR types, * explicit preconditions/postconditions (incl. legality guard macros references), * explicit provenance/evidence hooks (by ids/pins, not by tool behavior).* `CAL.Acceptance[]` — typed predicates with Context‑local thresholds: * binds to CHR characteristic ids (and, when inducing numeric comparison/aggregation, to `CG‑Spec.characteristic` ids), * exposes unknown handling and failure behavior via policy pins.* `CAL.Flow[]` — legality‑checked compositions of operator cards: * declares result kind (scalar only when lawful; selected-set / set-result when partial orders remain partial orders), * records which acceptance clauses gate which flows.* `CAL.EvidenceProfiles` — evidence wiring surface: * lane tags (`F/G/R`) / provenance anchors / policy pins needed for `SCR` and audit surfaces, * explicit freshness/decay hooks (freshness window + decay/Γ_time selectors) as pinned policies/refs (not prose). * explicit `ReferencePlane` + penalty routing policy ids (`Φ(CL)`, `Ψ(CL^k)`, `Φ_plane`) as citable pins; any such policy family is justified in `CAL.ProofLedger` (monotone + bounded).* **Optional** `CAL.NQD[]` — QD/OEE‑related calculus surfaces when declared: * descriptor/distance/insertion artifacts are pinned by ids/editions, * semantics are governed by method‑specific governing definitions (e.g., `C.18`, `C.19`) and not redefined by CAL.* `CAL.ProofLedger` — a proof/justification ledger: * links legality, monotonicity, boundedness, and other soundness obligations to operator/flow/clause ids.* Publication artifacts: * UTS Name Cards (twin labels) for all public ids, * RSCR tests ids and Worked‑Examples ids, * deprecation notices and edition bump notes as public-id continuity records.Boundary discipline (normative):* **No shadow specs**: CAL artefacts cite `CN‑Spec`/`CG‑Spec` and do not introduce competing “local specs” (delegated; see `CC‑GCORE‑CN‑CG‑1` via **CC‑G4‑CoreRef**).* **No shipping governance:** CAL does not govern shipping; see `CC-GCORE-SKP-1` via **CC-G4-CoreRef**.* **No refresh governing-definition assignment**: CAL does not govern refresh orchestration; it only publishes pins/payload for refresh (governing definition: `G.11`).**Minimal schema fragments (notation‑independent; fields for citation, not an implementation schema):**
#### CAL authoring chassis C1–C9 (kit governed by this pattern)**C1 — CAL Charter (scope anchor).**Authors declare a `CAL.Charter@Context` that:* anchors CAL to the CG‑Frame scope (`CG-FrameContext`, `entityOfConcern`, `ReferencePlane`),* pins the relevant governance card and legality gate refs (`CNSpecRef.edition`, `CGSpecRef.edition`),* records the local assumption envelope used by acceptance predicates (as explicit statements to be audited, not as hidden algorithmic assumptions),* declares which CAL artifacts are intended to be cited downstream (UTS ids).* emits a `TaskMap@Context` (`TaskMap`) that binds each declared `TaskSignature` (or task family) to: * eligible `CAL.FlowId[]` / `CAL.OperatorId[]`, * gating `AcceptanceClauseId[]` (ids of `CAL.Acceptance` clauses), * required `CAL.EvidenceProfileId[]`, * and any required policy pins/edition pins for reproducibility. This is the canonical “handoff manifest” consumed by `G.5` (thresholds remain only inside `CAL.Acceptance`).**C2 — Operator Cards (typed & lawful).**Each `CAL.Operator` is a UTS‑published, typed unit with:* `OperatorId (UTS)`,* `Signature` over CHR types,* `Preconditions` (including references to CHR guard macros where applicable),* `Postconditions / invariants`,* `EvidenceProfileRef[]` (or an explicit “none”),* `FailureBehaviorRef` (policy‑bound) for safe degradations and non‑catastrophic fallbacks.**C3 — Acceptance Clauses (typed predicates; thresholds live here).**Each `CAL.Acceptance` is a UTS‑published predicate with:* stable `ClauseId (UTS)` for citation,* explicit `CharacteristicRefs` (CHR ids) used by the predicate,* `CGSpecRefs?` required iff the clause induces numeric comparison/aggregation,* `EvidenceProfileRefs?` identifying evidence consulted (so `SCR` can surface the relevant pins),* explicit **freshness envelope** (freshness window + decay/Γ_time selector refs/pins) when evidence recency is part of admissibility,* `UnknownHandling` as a tri‑state choice (via `G.Core` semantics),* `FailureBehaviorRef` (policy‑bound) for degrade/abstain behavior.* `GateCrossingId[]` / `CrossingBundleId[]` **iff** the clause relies on cross-context, cross-plane, or cross-edition imports (no “silent reuse”). Missing required crossing artefacts is a conformance failure and blocks publication of the affected clause/flow (GateCrossing harness: `E.18`/`A.21`/`F.9`/`F.17`/`E.17`; crossing invariants: `G.Core`).**C4 — Aggregation & comparison flows (safe by construction).**`CAL.Flow` composes operators into legality‑checked DAGs and declares:* which acceptance clauses gate the flow,* which operator outputs are decision‑relevant vs report‑only,* what the **result kind** is (scalar only where lawful; otherwise selected-set / set-result).* any thinning/decision‑aid policy (e.g., ε‑front selection) as an explicit policy pin that **does not** silently replace the declared result kind.**C5 — Evidence wiring surface.**`CAL.EvidenceProfile` makes evidence hooks explicit:* provenance anchor references ([A.10](/generated/patterns/A.10)‑style carriers/anchors, cited by id),* lane tags (`F/G/R`) for each evidence contribution (no implicit lane mixing; penalties route only to `R_eff` as governed by `G.Core`),* pinned policy ids for penalty routing and freshness/decay handling (incl. freshness window + decay/Γ_time selector pins; and `Φ(CL)`/`Ψ(CL^k)`/`Φ_plane` policy ids when used),* declared inputs needed for `SCR` fields at run‑time (without embedding run‑time “gate decisions” into design‑time artifacts).**C6 — NQD/OEE surface (optional; method‑specific semantics delegated).**If the CG‑Frame declares QD/OEE‑style regimes, CAL may publish `CAL.NQD[]` as a **surface** that:* declares descriptor space and distance/insertion artifacts by ids and edition pins,* records archive/illumination intent and “report‑only vs dominance” gating as explicit policy pins,* **does not** redefine QD/OEE semantics (those remain governed by method‑specific patterns such as `C.18` / `C.19` and are wired via `Extensions`).**C7 — ProofLedger (soundness & legality obligations).**`CAL.ProofLedger` links each operator/flow/clause to:* legality proof refs (incl. CSLC refs when numeric comparison/aggregation is induced),* monotonicity/boundedness/stability proof refs for penalty/aggregation policies where relevant, * in particular: if an explicit `ΓFoldRef` is pinned (override), ProofLedger includes monotonicity + boundedness/boundary behavior proof refs for that fold.* explicit statements of degradation conditions (what must happen when assumptions fail).**C8 — Publication + RSCR + Bridges.**CAL publication emits:* UTS entries (Name Cards + twin labels) for all CAL ids,* Worked‑Examples that exercise legality and acceptance claims,* RSCR tests ensuring: * illegality is detected (e.g., forbidden ordinal arithmetic), * guard macro use is coherent, * flow legality checks are exercised, * acceptance clauses behave as authored on examples.Any cross-context, cross-plane, or cross-edition import required by CAL publication is handled through GateCrossing/CrossingBundle discipline (as governed by `G.Core`), and CAL publication is blocked if required crossing artifacts are missing.**C9 — Packaging & refresh readiness (without governing orchestration).**CAL pack versions:* record changes as edition‑pinned updates,* publish deprecation notices and public-id continuity notes for public ids,* emit RSCR‑relevant trigger payload pins (editions/policies/UTS ids/paths) for refresh orchestration (governing definition: `G.11`).#### Interfaces (minimal I/O surface)| Interface | Consumes | Produces || ------------------------- | --------------------------------------------------- | ----------------------------------------------------------------------------------------- || `G.4-1 Charter` | `CG-FrameContext`, SoTA inputs, `CHR Pack@CG-Frame` | `CAL.Charter@Context` + `TaskMap@Context` (`TaskMap`) || `G.4-2 Operators` | CHR typing + SoTA operator inventory | `CAL.Operator[]` (UTS ids; typed signatures; refs to evidence profiles & guards) || `G.4-3 Acceptance` | Task intent + policy pins + CHR characteristics | `CAL.Acceptance[]` (typed; thresholds; freshness envelope pins; failure behavior refs) || `G.4-4 Flows` | Operator cards + admissible aggregators | `CAL.Flow[]` (legality‑checked compositions; declared result kind) || `G.4-5 NQD Surface` | Task intent + policy pins + (optional) QD/OEE inputs | `CAL.NQD[]` (descriptor/distance/insertion refs + edition pins; optional) || `G.4-6 Publish` | All above + proofs + examples | Versioned `CAL Pack@CG-Frame`, UTS entries, RSCR tests, Worked‑Examples, public-id continuity notes |#### Extensions (pattern‑scoped; non‑core)`G.4` supports method‑family and discipline‑specific calculus variations exclusively via pattern‑scoped extensions.**GPatternExtension block: `G.4:Ext.EvidenceGraphWiring`**- **PatternScopeId:** `G.4:Ext.EvidenceGraphWiring`- **GPatternExtensionId:** `EvidenceGraphWiring`- **GPatternExtensionKind:** `InteropSpecific`- **GoverningPatternId:** `G.6`- **Uses:** `{G.6}`- **⊑/⊑⁺:** `∅`- **RequiredPins/EditionPins/PolicyPins (minimum):** - `EvidenceGraphId?` - `PathId[]/PathSliceId[]` - `UTSRowId[]` (for cited artifacts)- **RSCRTriggerSetIds:** `∅`- **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange}`- **Notes (wiring‑only):** This block does not define EvidenceGraph semantics; it only fixes that CAL proofs/examples may cite evidence by Path ids.**GPatternExtension block: `G.4:Ext.NQD`**- **PatternScopeId:** `G.4:Ext.NQD`- **GPatternExtensionId:** `NQD`- **GPatternExtensionKind:** `MethodSpecific`- **GoverningPatternId:** `C.18`- **Uses:** `{C.18}`- **⊑/⊑⁺:** `∅`- **RequiredPins/EditionPins/PolicyPins (minimum):** - `DescriptorMapRef.edition` - `DistanceDefRef.edition` - `InsertionPolicyRef` - `ArchiveRef?` - `TaskSignatureRef?` (if activation is TaskSignature‑bound)- **RSCRTriggerSetIds:** `∅`- **RSCRTriggerKindIds:** `{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`- **Notes (wiring‑only):** CAL does not redefine QD semantics; it only pins the descriptor, distance, and insertion records needed for reproducible archive behavior. Any archive/illumination summaries (e.g., coverage / QD‑score / occupancyEntropy / filledCells) are published as report‑only outputs unless an explicit CAL acceptance clause/policy authorizes promotion.**GPatternExtension block: `G.4:Ext.EELog`**- **PatternScopeId:** `G.4:Ext.EELog`- **GPatternExtensionId:** `EELog`- **GPatternExtensionKind:** `MethodSpecific`- **GoverningPatternId:** `C.19`- **Uses:** `{C.19}`- **⊑/⊑⁺:** `∅`- **RequiredPins/EditionPins/PolicyPins (minimum):** - `ExploreExploitBudgetPolicyRef` - `ProbeAccountingRef?` - `FailureBehaviorRef?` (if probe/sandbox is policy‑bound)- **RSCRTriggerSetIds:** `∅`- **RSCRTriggerKindIds:** `{RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`**GPatternExtension block: `G.4:Ext.SoSLogBranches`**- **PatternScopeId:** `G.4:Ext.SoSLogBranches`- **GPatternExtensionId:** `SoSLogBranches`- **GPatternExtensionKind:** `MethodSpecific`- **GoverningPatternId:** `C.23`- **Uses:** `{C.23}`- **⊑/⊑⁺:** `∅`- **RequiredPins/EditionPins/PolicyPins (minimum):** - `SoSLogRuleId[]` - `SoSLogBranchId[]` - `FailureBehaviorPolicyId`- **RSCRTriggerSetIds:** `∅`- **RSCRTriggerKindIds:** `{RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.MaturityRungChange, RSCRTriggerKindId.TelemetryDelta}`- **Notes (wiring‑only):** This block only pins branch/rule ids for degrade/abstain explanation; it does not redefine rule semantics.**GPatternExtension block: `G.4:Ext.AcceptanceRiskControl`** *(Phase‑3 seed)*- **PatternScopeId:** `G.4:Ext.AcceptanceRiskControl`- **GPatternExtensionId:** `AcceptanceRiskControl`- **GPatternExtensionKind:** `Phase3Seed`- **GoverningPatternId:** `governing pattern not yet selected`- **Uses:** `∅`- **⊑/⊑⁺:** `∅`- **RequiredPins/EditionPins/PolicyPins (minimum):** - `RiskControlPolicyRef` - `CalibrationWindowRef?` - `CoverageTargetRef?`- **RSCRTriggerSetIds:** `∅`- **RSCRTriggerKindIds:** `{RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent}`- **Notes (non‑normative seed):** Intended for post‑2015 acceptance families such as conformal risk control / set‑valued selective prediction, distributionally‑robust acceptance envelopes, and calibrated abstention policies; semantics must be governed elsewhere before becoming normative.### Archetypal Grounding**Tell.** A CG‑Frame must choose and justify a set of candidate methods (possibly a selected set or archive) under explicit legality, evidence, and scope constraints. CHR provides the typed measurement basis; CAL turns it into executable, auditable predicates and flows.**Show 1 (in‑context CAL pack skeleton).**Context: R&D selected-set choice. CHR defines `SafetyClass(ord↑)`, `CostUSD_2026(ratio↓)`, `Readiness(nominal)`.* `CAL.Operator: DominatesPareto` Signature over CHR types, precondition references CHR guard macros.* `CAL.AcceptanceClause: AC_SafetyGate` Typed predicate binding `SafetyClass` (and its levels) with Context‑local thresholds; unknown handling uses tri‑state pins.* `CAL.Flow: Flow_ParetoPortfolio` Produces a selected-set result kind; gates by `AC_SafetyGate` and `AC_Budget`.* `CAL.EvidenceProfile: EP_SafetyEvidence` Declares anchor ids and freshness policy pins required for `SCR`.Downstream, `G.5` consumes only the handoff manifest: clause ids, operator ids, and evidence profile ids (no embedded thresholds).**Show 2 (explicit cross‑context import).**A `SafetyClass` value is imported from a different Context or plane. CAL may still author an acceptance clause using that value, but only after the reuse is made explicit as a published crossing bundle and the CAL artifacts cite the relevant ids/pins. The CAL pack remains Context‑local; portability is achieved through explicit crossings and citations, not by silently widening scope.### Bias-AnnotationCAL is where “what counts as acceptable” is encoded. Typical bias vectors include:* threshold‑selection bias (arbitrary floors masquerading as natural laws),* measurement bias amplified by illegitimate arithmetic or hidden scalarization,* survivorship bias in Worked‑Examples and probe telemetry,* Goodhart pressures when report‑only telemetry is accidentally treated as dominance.The pattern mitigates these by requiring typed acceptance clauses, explicit policy pins, and an auditable proof/justification ledger, while keeping cross‑context reuse explicit and penalized only in the explicit assurance lane.### Conformance Checklist (normative)| ConformanceId | Statement || ----------------- | -------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- || **CC‑G4‑CoreRef** | Conformance with [`G.4`](/generated/patterns/G.4) requires satisfying the effective `G.Core` obligations referenced by the `GCoreLinkageManifest` in **G.4:4.1** (profiles, pin sets, consumed defaults, and trigger kinds). || **CC‑G4‑01** | `CAL Pack@CG-Frame` is published as a notation-independent object with stable UTS ids (Name Cards with twin labels) for `CAL.Charter`, `TaskMap`, all operator, acceptance, flow, and evidence carriers, Worked-Examples, and public-id continuity notes, including deprecations and lexical-continuity notes. Tooling/vendor details remain non-normative. || **CC‑G4‑02** | `CAL.Charter@Context` pins `CG-FrameContext`, `entityOfConcern` (incl. `ReferencePlane`), and the relevant governing spec references by edition pins (`CNSpecRef.edition`, `CGSpecRef.edition`). || **CC‑G4‑03** | Every `CAL.Operator` has an explicit CHR‑typed signature and explicit preconditions; any legality guard macros referenced are cited by id (no “implicit legality”). || **CC‑G4‑04** | Every `CAL.Acceptance` binds to CHR ids (`CharacteristicRefs`) and declares unknown handling and failure behavior via pins/refs; thresholds and cutoffs appear only here (not inside CHR artifacts and not inside operator prose). If the clause depends on cross-context, cross-plane, or cross-edition imports, it cites `GateCrossingId[]/CrossingBundleId[]`. || **CC‑G4‑05** | If an acceptance clause, operator, or flow induces numeric comparison/aggregation, it cites the relevant `CG‑Spec.characteristic` ids and links to legality proof refs (CSLC) in the ProofLedger; otherwise it must be authored so that downstream can degrade/abstain rather than perform illegal operations. || **CC‑G4‑06** | Every `CAL.Flow` declares its result kind and the set of gating acceptance clauses; any thinning/selection‑aid policies (e.g., ε‑front selection) are explicitly policy‑bound and do not silently replace the underlying result kind. || **CC‑G4‑07** | Every `CAL.EvidenceProfile` declares: provenance anchors ([A.10](/generated/patterns/A.10)), evidence lanes (`F/G/R`), freshness/decay pins (incl. freshness window + decay/Γ_time selector refs), and any penalty routing policy pins (`Φ(CL)`, `Ψ(CL^k)`, `Φ_plane`) needed for run‑time `SCR` surfacing. It either pins an explicit `ΓFoldRef.edition` override or (if absent) cites `DefaultId.GammaFoldForR_eff` (via `G.Core.DefaultGoverningDefinitionIndex`). Penalty policies affect `R_eff` only and do not define dominance. Any referenced penalty policy family is justified in the ProofLedger (monotone + bounded). || **CC‑G4‑08** | `CAL.ProofLedger` exists and is UTS‑citable; it links each operator/flow/clause to required proof/justification refs and records explicit degradation conditions when assumptions fail. If an explicit `ΓFoldRef` is pinned, it includes monotonicity + boundedness/boundary behavior proof refs for that fold. || **CC‑G4‑09** | CAL publication includes RSCR tests and Worked‑Examples sufficient to detect illegality (incl. unit laundering / ordinal arithmetic), to exercise authored acceptance/flow behavior, and to validate the authored freshness envelope when it is part of admissibility; missing tests/examples are treated as an auditable gap, not as “assumed OK”. || **CC‑G4‑10** | `TaskMap@Context` (`TaskMap`) is present and provides [`G.5`](/generated/patterns/G.5) with acceptance clause ids (`AcceptanceClauseId[]`; selector gates), operator/flow ids, and evidence profile ids required for explainability and audit; selector implementations must not embed thresholds or duplicate acceptance semantics. || **CC‑G4‑11** | Any method/discipline specifics are placed under `G.4:4.5 Extensions` as `GPatternExtension` blocks (stable `PatternScopeId`, explicit governing definition, pins, and RSCR triggers); no extension introduces competing defaults or replaces `G.Core` invariants. || **CC‑G4‑12** | `CAL Pack@CG-Frame` includes public-id continuity records for public ids: deprecations, edition bumps, and lexical-continuity notes. It exposes refresh payload pins, including editions, policies, UTS ids, and, when present, `PathId` and `PathSliceId`, sufficient for [`G.11`](/generated/patterns/G.11) to plan RSCR without inferring semantics from prose. || **CC‑G4‑13** | When `G.4:Ext.NQD` is present, `CAL.NQD[]` is present and is wired only via the declared governing pattern ([`C.18`](/generated/patterns/C.18)): at minimum it pins `DescriptorMapRef.edition`, `DistanceDefRef.edition`, and `InsertionPolicyRef`, and it treats archive/illumination summaries as report‑only unless explicitly promoted by a CAL acceptance clause/policy. || **CC‑G4‑14** | CAL does not mint new universal types to encode “strategy/policy”. Strategy is expressed as authored flows + acceptance clauses + policy/task pins (and downstream registry/composition in [`G.5`](/generated/patterns/G.5)); any specialization is introduced only via `GPatternExtension` wiring blocks or cited governing patterns. |### Common Anti-Patterns and How to Avoid Them* **Hidden thresholds.** Avoid: embedding cutoffs in CHR prose or in operator descriptions. Prefer: `CAL.AcceptanceClause` with explicit ids and pins.* **Untyped “score(x)”.** Avoid: operators with implicit units and untracked legality assumptions. Prefer: explicit CHR‑typed operator signatures + cited legality checks.* **Silent cross‑context reuse.** Avoid: importing constructs across Contexts/planes/editions without published crossings. Prefer: explicit crossing artifacts and citations; keep CAL pack Context‑local.* **Acceptance as implementation detail.** Avoid: acceptance embedded in tool logic. Prefer: publish acceptance as citable CAL artifacts; downstream consumes ids.* **Exploratory telemetry treated as dominance.** Avoid: letting probe/illumination telemetry quietly become a dispatch criterion. Prefer: keep it report‑only unless an explicit policy‑bound acceptance clause authorizes promotion.### Consequences* CAL becomes a stable, citable CAL Pack: operator/acceptance semantics are explicit artifacts, not tacit code behavior.* Legality failures are surfaced as authoring defects (RSCR‑testable) rather than run‑time surprises.* Downstream patterns (`G.5`, `G.8`, `G.9`, `G.10`, `G.11`) can reference stable ids/pins without redefining acceptance or operator semantics.* Method pluralism is supported: multiple calculi can coexist as separate operator/flow/acceptance families, wired via Extensions rather than mixed into the core kit.### RationaleCAL sits at the boundary where typed measurement becomes actionable choice. Making CAL a published, typed, and testable artifact reduces semantic drift and prevents “shadow legality gates” from emerging in tools or in downstream prose.The design separates concerns:* CHR governs measurement typing and legality guard macros,* CG‑Spec and CN‑Spec govern the legality gate and governance card, respectively,* `G.Core` governs Part‑G invariants and trigger/default discipline,* `G.4` governs the CAL kit: authoring objects, publication surface, and handoff manifest.This yields modularity (one governing definition per invariant or default), auditability (pins/ids and proof refs), and extensibility (method families attach through explicit extension modules).### SoTA-EchoingCAL authoring is compatible with post‑2015 best practice families without confusing “popular” with “best‑available”:* **Risk‑controlled acceptance**: modern conformal / selective / set‑valued prediction families where “abstain” is a first‑class, audited outcome (fits tri‑state gating + explicit calibration pins).* **Robust acceptance envelopes**: distribution‑shift‑aware and distributionally‑robust acceptance styles, expressed as policy‑pinned predicates rather than hidden heuristics.* **Modern multi‑objective practice**: preference‑aware, interactive, and set‑returning multi‑objective decision families that preserve partial orders and selected sets.* **Quality‑Diversity after 2015**: archive‑based search families (e.g., CMA‑ME‑class) attach as wiring via edition‑pinned descriptor/distance/insertion artifacts.* **Open‑ended exploration after 2015**: environment‑method co‑evolution families (e.g., POET‑class) attach through explicit generator family wiring and policy‑bound acceptance branches.All of these remain method‑specific semantics and therefore belong in `Extensions` blocks (or their governing patterns), while `G.4` keeps the calculus kit stable and auditable.### Relations**Builds on:** `G.Core` (and the pattern template discipline in `E.8`).**Uses:** `G.1` (CG‑FrameContext), `G.2` (SoTA Synthesis Pack), `G.3` (CHR Pack), `G.0` (CG‑Spec legality gate), `A.19` (CN‑Spec), `A.18` (CSLC), `A.10` (provenance anchors), `B.3` (trust/freshness/decay), `E.18` + `A.21` + `F.9`/`F.17`/`E.17` (GateCrossing harness).**Uses (via Extensions):** `G.6` (EvidenceGraph/Path citation; when `G.4:Ext.EvidenceGraphWiring` is present), `C.18` (NQD), `C.19` (E/E‑LOG), `C.23` (SoS‑LOG).**Used by:** `G.5` (selector/dispatcher), `G.8` (SoS‑LOG bundles), `G.9` (parity), `G.10` (shipping), `G.11` (refresh orchestration).**Publishes to:** UTS (public ids and public-id continuity records), RSCR (tests and trigger emissions), `G.5` (handoff manifest), and, as cited payload, shipped packs governed by `G.10`.**Constrains:** any run‑time LOG implementation that executes CAL operators/flows must treat CAL artifacts as citable specifications and must not re‑invent acceptance semantics.### G.4:End## Multi‑Method Dispatcher & MethodFamily Registry> **Type:** General (G)> **Status:** Stable> **Normativity:** Normative**Plain-name.** Multi-method dispatcher and method-family registry.**Intent.** Govern the dispatcher/registry object set for rival method families and publish selector-facing retained-set outcomes without collapsing plurality into one hidden scalar winner.### Use this when- several method families or generator families can admissibly act on the same declared task family or work target- you need one selector to return a `Shortlist`, `RankedShortlist`, one `SpecialistHandoff`, one other narrowed handoff plan, or one abstain outcome without pretending that there is always one scalar winner- the published result must carry enough basis pins for later comparison, handoff, or escalation without changing its declared outcome kind or any applicable public selected-set label### What goes wrong if missed- rival families are compared under silent comparator drift, hidden baseline changes, or unspoken crossing costs- the selector hides one dogmatic winner even when only a partial order is admissible- selected-set publication gets hidden inside `C.11`, `C.19`, or `C.24`, so the published result no longer makes clear whether it carries local choice, pool policy, enactment, or publication- exploration, open-ended, or specialization pressure leaks in as one architecture convenience rather than one explicit policy-bound choice### What this buys- one registry that keeps rival method families disjoint but dispatchable- one selector result form that can publish candidate sets, `Shortlist`, `RankedShortlist`, one `SpecialistHandoff`, narrowed handoff plans, or abstain outcomes honestly- one `DRR/SCR`-addressable trace with explicit basis pins instead of one hidden selector rationale- one explicit publication closure so the declared outcome kind, any applicable public selected-set label, retained members or handoff content, ordering status, and basis pins are stated directly in the emitted resultRegistry and dispatch remain the primary registry/dispatch selector question here; selected-set publication is the explicit closure record for that selector question, not a replacement for it.### First-minute questions- What selector outcome kind is this result actually emitting: one set-result outcome such as `Shortlist` or `RankedShortlist`, one `SpecialistHandoff` or other narrowed handoff, or one abstain outcome?- Which members are being retained or excluded now?- Does order materially belong to the published result?- Which basis pins or policy pins must the published result carry?### First outputThe first useful output from this dispatcher/registry question is one published selector outcome: one set-result outcome such as `Shortlist` or `RankedShortlist`, one `SpecialistHandoff` or other narrowed handoff plan, or one abstain/escalation result, with the outcome kind, any public selected-set label, retained members or handoff content, ordering status when relevant, and basis pins stated in one place.If that first output still cannot be written honestly, the current publication result is not finished `G.5` publication yet.[G.5](/generated/patterns/G.5) keeps the dispatcher/registry object set here and leaves universal Part-G invariants to `G.Core`; method- or generator-specific semantics stay in their named source patterns and arrive here only through explicit pins.When `C.11` has already emitted one local choice result, `C.19` one pool-policy result, or `C.24` one enactment-facing next move, `G.5` begins where the question becomes selector-facing publication of the retained set or narrowed handoff result rather than one more explanation of why the result looked reasonable. A conformant `G.5` pass should therefore publish the retained set, narrowed handoff, or abstain result directly, with its declared outcome kind, any applicable public selected-set label, and basis pins explicit in the result itself.A publication result remains unfinished if the declared outcome kind, any applicable public selected-set label, retained members or handoff content, ordering status, abstain or escalation condition, or basis pins are still only implicit in upstream notes.### Problem frameA `CG‑FrameContext` (from **[G.1](/generated/patterns/G.1)**) and a `SoTA Synthesis Pack@CG‑Frame` (from **[G.2](/generated/patterns/G.2)**) expose multiple rival, internally coherent **method families** (and sometimes **generator families**) that can plausibly act on the same `EntityOfConcernRef` and ReferencePlane.At the same time, the typed slot/scale/coordinate definitions from **[G.3](/generated/patterns/G.3)/[G.4](/generated/patterns/G.4)** yield admissible calculi and acceptance clauses—enough to formulate *eligibility*, *assurance*, and *legality* constraints, but not enough to pick “the method” without collapsing plurality.You need a **notation‑independent** way to:1. register method/generator families as *auditable, versioned* entries,2. select/compose/fallback among them at run time for a concrete task instance,3. publish stable selected-set results and stable identities to UTS, and4. emit RSCR‑relevant triggers and pins without inventing new “shadow specs”.### ProblemHow to design a **general, auditable dispatcher** that:* preserves **pluralism** (families from competing Traditions stay disjoint) while remaining **dispatchable** (selection is possible and explainable);* does **not embed algorithmic dogma** in the core selector kernel;* respects Context boundaries and crossing discipline (Bridge‑only; explicit pins);* produces **set‑valued outcomes** when only partial orders are admissible;* cleanly separates: * **selector object set/components** (registry + selector facade + publication records), * **universal Part‑G invariants** (carried by `G.Core`), * **method/generator specifics** (wired only via `Extensions` blocks).### Forces* **Pluralism vs. forced totalisation.** Many selection regimes are inherently partial‑order; forcing a scalar winner often creates illegal semantics.* **Evidence realism vs. hard gates.** Eligibility/acceptance frequently depends on incomplete evidence; selection must remain auditable under tri‑state unknowns.* **Reuse vs. leakage.** Cross‑Context reuse is valuable but must be explicit (Bridge + loss notes) and must not silently re‑ground semantics.* **Exploration vs. exploitation.** Dispatch sometimes must probe alternatives under explicit policy/risk envelopes, but probing must not become an implicit fourth status.* **Evolvability vs. churn.** Registries evolve (new families, deprecations, edition bumps); continuity must not be broken by “rename by meaning”.### Solution#### Causal method dispatch declarationsMethod selection involving causal methods must declare whether a compared method is an observational predictor, an intervention optimizer, a counterfactual strategy, a causal fairness estimator, a causal-RL policy, or a simulation-only method.Optional `MethodFamily.causalUseDispatchSpec?`:```textMethodFamily.causalUseDispatchSpec? { causalUseQuestionRef?: U.CausalUseQuestion targetCausalityLadderRung: CausalityLadderRung causalUseClaimKind: CausalUseClaimKind causalActionPolicyClass?: CausalActionPolicyClass causalEvidenceSupportBasis?: CausalEvidenceSupportBasis causalUseSupportRecordRef?: CausalUseSupportRecordRef causalUseSupportVerdict?: CausalUseSupportVerdict causalMethodUseClassification: observationalPredictor | interventionOptimizer | counterfactualStrategy | causalFairnessEstimator | causalRLPolicy | simulationOnlyMethod supportedUse: CausalUseSupportStatement unsupportedUse: CausalUseUnsupportedStatement}
causalMethodUseClassification is a selector-facing method-use classification, not a U.Role, role assignment, responsibility, or actor position. simulationOnlyMethod maps to CausalEvidenceSupportBasis = simulationOnlyCounterfactualOutputBasis, bounded simulation-supported use, and unsupported intervention-effect or realized-counterfactual-sample use unless another [C.28](/generated/patterns/C.28) support basis is cited.
What changes in practice: a selector must not compare "methods that improve outcome" unless each causal method declares the causality-ladder rung, causal method-use classification, and [C.28](/generated/patterns/C.28) support record and verdict when causal-use support is being consumed.
What this does not authorize: [G.5](/generated/patterns/G.5) does not identify causal effects, decide fairness, certify off-policy causal evaluation, or compare cross-rung causal methods as one undifferentiated improvement set; it keeps method dispatch and selected-set publication while [C.28](/generated/patterns/C.28) governs causal-use support.
Builds on:G.Core (Part‑G core invariants; Default Governing Definition Index citation)
GCoreLinkageManifest (normative; size‑controlled via profiles/sets).
Effective obligations/pins/triggers are computed by union expansion of the referenced ids (per G.Core:4.2.1). Profiles/sets + explicit deltas; Nil‑elision applies.
GCorePinSetId.PartG.CrossingVisibilityPins(crossing‑aware use; pins from this set may be intentionally strengthened (optional→required) via CorePinsRequired)
CorePinsRequired :=(delta over PinSets; pins/refs are id‑only; prefer strengthening optional→required over restating pins already covered by PinSets)
TaskSignatureRef(see G.5:4.2 / S2)
MethodFamilyId[](registry keys in scope)
GeneratorFamilyId[]?(when generator families are in scope)
PathId[](audit citations for “why” and for evidence)
PathSliceId[](audit citations for “why” and for evidence)
UTSRowId[](published identities for selected/registered families and selector policy records)
FailureBehaviorPolicyId?(only when degrade/abstain behavior is explicitly policy‑bound)
SoSLogBranchId?(only when degrade/abstain behavior is explicitly policy‑bound)
#Dispatcher & Registry object set (notation‑independent)
G.5 defines the object-set components below. Their purpose is to make dispatch possible and auditable without embedding any method-family semantics in the selector kernel.
S1 — MethodFamily Registry (design‑time; per CG‑Frame).
A registry row represents a family, not a single implementation. Minimal fields (conceptual, notationally independent):
Identity: MethodFamilyId, ContextId, lineage/Tradition notes, UTSRowId (twin labels where applicable).
EligibilityStandardRef: a typed predicate record (tri‑state per G.Core), expressed in CHR/CAL terms and pinned to the relevant editions.
AssuranceProfileRef: evidence‑lane expectations and assurance-lane pins (SCR‑addressable).
LegalityBindings: explicit references to the single governance card and legality gate (CNSpecRef, CGSpecRef) and to any required legality constraints (e.g., scale/unit legality via CSLC).
EvidencePins: citations to G.6 (PathId/PathSliceId) for claims/guarantees where such claims are asserted.
CrossingAllowance: explicit Bridge/CL allowance pins only if cross‑Context operation is claimed.
PolicyHooksRef?: optional pointers to policy records (not defined here; wired via Extensions).
S1′ — GeneratorFamily Registry (design‑time; optional; per CG‑Frame).
A registry row for families that generate tasks/environments and/or co‑evolve solver families. G.5 carries the registry-entry shape, not the generator semantics:
Identity: GeneratorFamilyId, ContextId, UTSRowId.
GeneratorSignatureRef: conceptual I/O and budget semantics.
EnvironmentValidityRegionRef?: pinned constraints for generated environments/tasks.
TransferRulesRef.edition?: required when the Open-Ended mode is enabled (semantics come from the cited extension refs).
CouplerRefs?: which MethodFamilyId[] can be coupled with this generator family.
S2 — TaskSignature façade (design‑time + run‑time).
A minimal typed record the dispatcher consumes. Its role is pinning and auditability, not over‑specification. It must be CHR/CAL‑typed and provenance‑aware.
G.5 treats TaskSignatureRef as an input record; it does not define CHR/CAL semantics.
returns one declared selector outcome: most often one set-result outcome such as Shortlist or RankedShortlist, but sometimes one SpecialistHandoff, one other narrowed handoff, one abstain outcome, or one escalation outcome (per DefaultId.PortfolioMode and explicit overrides),
emits audit records (DRR/SCR‑addressable pins).
S3.A — TaskFamilySpecializationProfile@Context (run‑time; conditional).
When the real selector question is acquisition of usable specialization on a declared task family, the selector may publish one TaskFamilySpecializationProfile@Context for each candidate, one SpecialistHandoff, or one narrowed handoff plan. Here profile means one selector-time comparison record for bounded specialization, not a new kernel type and not a generic narrative profile. G.5 carries this selector-time specialization question here; it does not re-govern the adaptation-signature field vocabulary from C.22.1.
The profile should therefore cite one AdaptationSignatureRef or equivalent pinned field set carrying the declared TaskFamilyRef or TaskSignature, the work-measure threshold target, prior exposure declaration, time-to-threshold, budget-to-threshold, post-threshold efficiency when relevant, any declared transfer or retention claim, any downside cost or downside on adjacent tasks, and any specialization-entry baseline, specialization-entry evidence, or stepping-stone evidence item that materially affects comparison.
Admission rule for SpecialistHandoff: use that handoff kind only when the truthful published result is one heterogeneous handoff bundle whose members occupy different specialization roles that still need to travel together. Do not use it when one ordinary Shortlist, RankedShortlist, ExplorationArchive, or another narrower named result kind already states the result more precisely.
When the declared task family is heterogeneous, the selector may return one SpecialistHandoff, one other narrowed handoff plan, or one small admissible set that preserves rival specialists rather than collapsing them into a fake single winner. Low-human-overlap candidates remain admissible only when the profile, evidence basis, and policy constraints are explicit.
S4 — Composition & fallbacks templates (design‑time).
A library of composition shapes (preconditioner → solver → verifier; cascades; meta‑selectors) as templates, legality‑checked and pinned. Concrete strategy semantics stay in the referenced method families; G.5 only carries the composition template.
S5 — Publication & telemetry interface (run‑time).
A standard publication interface to publish:
DRR (decision rationale) + SCR (evidence/confidence citation) with explicit pins,
declared selector / selected-set records,
telemetry pins to refresh orchestration (G.11), without governing orchestration.
When the current publication question is selected-set publication rather than one generic registry trace, Shortlist is the public selected-set label, RankedShortlist is the ordered specialization when order materially belongs to the published result, ShortlistId is the emitted public identity, and ChoiceSet stays one mathematical gloss rather than the public selected-set label.
S6 — Governance & evolution interface (design‑time).
Versioning, deprecation, and registry evolution discipline (UTS publication; continuity), without minting new Part‑G‑wide types.
Selection/dispatch stays one generic selector head. Narrower selector families may refine it, but they do not redefine the universal invariants pinned through G.Core, do not add hidden mandatory inputs beyond pinned policy or edition refs, and do not mutate SlotKinds.
Method- and generator-specific pressures such as QD archives, open-ended declared sets, explore/exploit lenses, or preference comparators do not become part of the selector head. They arrive only through explicit extension declarations and the pins those extensions require.
CandidateSet (set‑returning), declared selector result with PortfolioMode recorded, DRR + SCR pins; if no admissible candidate exists: return CandidateSet=∅ plus an escalation hint (ActionHint) and the pins required to plan next steps (P2W split applies)
A catalyst-search team is choosing among three method families for the same declared TaskSignature and C.22.1 adaptation signature.
The shared profile pins one work-measure threshold target, one freshness window, one prior-exposure declaration, and one adaptation budget. One family reaches threshold quickly but carries high downside on adjacent tasks. One family is slower but transfers cleanly. One family never clears MinimalEvidence and must abstain.
An admissible G.5 result therefore publishes a set-return shortlist or a narrowed handoff plan, with DRR/SCR citing why the third family was excluded and why the first two remain non-dominated. The selector does not invent one scalar winner and does not hide the specialization profile in auxiliary side notes.
When one upstream C.19 pass has already narrowed the live pool to one internal retained subset over registered families, G.5 may publish that result as one Shortlist with one ShortlistId and explicit basis pins only when selector-facing publication is now the question. Until that emission occurs, the internal retained subset is not yet one public shortlist result.
When one upstream C.11 pass has already fixed one local choice over one declared source set, or one C.24 pass has already produced one enactment-facing narrowed handoff, G.5 may publish the selected-set or narrowed-handoff result only when selector-facing publication is now the question. Until this G.5 emission occurs, the ChoiceResult, CallPlan, or CheckpointReturn is not itself one public Shortlist, RankedShortlist, or ShortlistId-bearing result.
A finished G.5 pass should publish one explicit selected-set result from the dispatcher/registry question rather than one selector trace that leaves the public result implicit.
Publication here is the closure record for selector work over registered families. It does not replace registry maintenance, dispatcher comparison law, or the upstream pool-policy and local-choice pattern authorities that supplied the retained members.
The admissible selector outcome families here are:
SelectorOutcomeKind = SetResultOutcome, with SetResultFamily = Shortlist when one retained set is published without one material internal order and SetResultFamily = RankedShortlist when ordering materially belongs to the result;
SelectorOutcomeKind = HandoffOutcome, with HandoffKind = SpecialistHandoff or one other narrowed handoff plan when heterogeneity is the truthful downstream result;
SelectorOutcomeKind = AbstainOutcome when no admissible candidate exists and the truthful result is one abstain;
SelectorOutcomeKind = EscalationOutcome when no admissible candidate exists and the truthful result is one escalation.
SetResultFamily belongs only inside SetResultOutcome. Shortlist and RankedShortlist are public selector results over registered rows. They are not merely one upstream internal retained subset copied forward under one prettier label. G.5 is the governing pattern that turns selector state into one public result with one explicit outcome kind, one explicit selected-set label when applicable, one explicit member set or handoff content, and one explicit basis-pin set.
A publication result should state at least these fields:
the selector outcome kind being emitted;
the public selected-set label when the outcome is one set-result outcome;
retained members, or the narrowed handoff content, or the abstain/escalation condition;
ordering status when ordering matters;
basis pins and policy pins sufficient to justify the result;
one explicit next downstream use boundary when the result is a handoff rather than one terminal publication.
Close as SelectorOutcomeKind = SetResultOutcome with SetResultFamily = Shortlist when several retained members survive admissibly but no public internal order belongs to the result. Close as SelectorOutcomeKind = SetResultOutcome with SetResultFamily = RankedShortlist when order materially belongs to the published result. Close as SelectorOutcomeKind = HandoffOutcome with HandoffKind = SpecialistHandoff or one other narrowed handoff when heterogeneity itself is the truthful downstream result. Close as SelectorOutcomeKind = AbstainOutcome or EscalationOutcome when no admissible candidate exists under the pinned constraints.
If the publication still does not state what public result was emitted, who remained in it, whether order belongs to it, and which pins justify it, then the selector has not yet published one finished [G.5](/generated/patterns/G.5) result.
If the card does not already state what was published, who survived, whether order belongs to the result, and which pins justify it, the publication is still unfinished [G.5](/generated/patterns/G.5) work.
#Derived tradition-view publication stays derived over one declared palette
If selector work consumes one declared source set such as Front, Archive, or one source-set composition through one derived tradition view such as TraditionFront or TraditionArchive, treat that derived view as one interpretation view over one declared SoTAPaletteDescription, not as the default meaning of Tradition or of the palette itself.
When SelectorOutcomeKind = SetResultOutcome, the public selected-set label still closes as Shortlist or RankedShortlist; when SelectorOutcomeKind = HandoffOutcome, the result closes as one SpecialistHandoff or one other narrowed handoff. The derived tradition view disciplines the source, not the emitted outcome family.
When such a derived tradition view is active, publish SourceSetFamily, use DerivedViewKind when the distinction matters to interpretation or later shipping, use SourceSetComposition only when several source-set families were genuinely composed, and keep BasePaletteRef=SoTAPaletteDescriptionId recoverable alongside the emitted result.
If the derivation depends on one declared Q or one reachability/coverage rule, cite that declared basis directly in DRR/SCR or equivalent basis pins rather than leaving the derivation implicit.
If no derived tradition view is active, stay with the declared palette, front, archive, or shortlist families already named by the selector record.
Three short contrasts keep the publication law practical.
Several survivors, no public order belongs to the result.
When the selector has retained more than one admissible family but no downstream public order belongs to the published result, G.5 should close as one Shortlist over the registered surviving rows:
Order now materially belongs to the published result.
When one ordered public handoff is required, [G.5](/generated/patterns/G.5) should say so directly instead of leaving order implicit:
No admissible candidate survives.
When no family clears the pinned legality or evidence gates, [G.5](/generated/patterns/G.5) should close as one abstain or escalation result rather than as one empty shortlist pretending to be progress:
The practical distinction is simple: an internal retained subset can remain real upstream without yet being one public selector result. [G.5](/generated/patterns/G.5) begins only when that selector-facing publication question starts, and it closes only after the declared outcome kind, any applicable public selected-set label, surviving members or handoff content, and basis pins are emitted directly.
Most selector-side use can stop after G.5:4.4d. The blocks below are extension declarations used only when the corresponding mode is actually active.
All blocks below are extension declarations: they declare Uses and required pins, but do not redefine semantics already defined in the referenced patterns.
This block activates exploration/exploitation‑governed dispatch.
Post‑2015 examples that typically land here: modern bandit‑style or Bayesian selection under explicit risk budgets; adaptive evaluation/probing regimes; safe‑exploration variants where “abstain/degrade” is policy‑bound.
G.5 core remains QD‑agnostic; QD semantics are governed by [C.18](/generated/patterns/C.18).
Post‑2015 families that typically dock here: MAP‑Elites‑class QD (incl. later archive‑centric refinements), CMA‑ME‑class hybrids, modern illumination/coverage telemetry regimes where legality and edition pinning matter.
This block enables declared sets of {Environment, MethodFamily} pairs without redefining generator semantics in G.5.
Post‑2015 examples typically referenced via [G.2](/generated/patterns/G.2) family cards: POET‑class and later open‑ended/co‑evolutionary regimes, including enhanced variants where transfer policies and validity gates must be edition‑pinned.
SelectionSlot returns one selector outcome, not one forced single winner.
The emitted result should declare its SelectorOutcomeKind.
SetResultFamily is required only when SelectorOutcomeKind = SetResultOutcome.
HandoffKind is required only when SelectorOutcomeKind = HandoffOutcome; SpecialistHandoff is one handoff kind, not one set-result family head.
Front names the non-dominated source set under the declared DominanceSet.
Archive names the retained exploration archive under the declared retention policy.
Shortlist names the lens-declared selected set emitted from SelectionSlot.
RankedShortlist names one ordered specialization of that shortlist result.
ShortlistId is the emitted public token when the shortlist publication must be carried or cited.
ChoiceSet may be used only as the mathematical set gloss for that shortlist when the set object itself is under analysis; it does not replace the public shortlist head.
PortfolioMode states how the selector operated; it does not rename the emitted set result.
The default PortfolioMode=Archive means that an unspecified selector/generator operating mode must preserve retained exploration evidence rather than pretending one current front or selected shortlist has already been emitted. It does not make every returned object an Archive, does not override SetResultFamily, and does not change the declared DominanceSet.
If one selector consumes both a front and an archive, say so explicitly rather than blurring them into one generic portfolio.
If one selector consumes one derived tradition view, keep that derived view explicit rather than silently treating it as the default meaning of Tradition.
SetResultFamily, SourceSetFamily, SourceSetComposition, SubjectKind, DerivedViewKind, BasePaletteRef, PromotionPolicy, and RetentionIntent=steppingStone are declaration fields, refs, or policy pins around the returned outcome; they are not additional emitted set results.
SourceSetFamily names the immediate declared source-set family.
SourceSetComposition is used only when the selector genuinely consumed more than one source-set family such as Front+Archive.
If that source set is one derived tradition view, keep the base palette recoverable alongside it.
DerivedViewKind may name which derived tradition view is active when that distinction matters to interpretation or later publication.
DerivedViewKind does not replace SourceSetFamily, SetResultFamily, or Shortlist.
BasePaletteRef is one cited ref/id, not one kind.
If one selected result comes from one declared source set, publish that SourceSetFamily rather than asking the reader to infer it from one mode flag.
PromotionPolicy is required when tie-break or telemetry signals are promoted into dominance.
The selector may consume one declared source set and one declared choice lens without trying to explain the whole reason why another probe was worth its cost.
When CostToProbe, ValueOfInformation, ValueOfComputation, explore_share, backstop_confidence, or sequencing pressures matter, keep them explicit in the surrounding choice doctrine instead of smuggling them into set-result declaration fields.
Selector-facing results should name the set-result kind, source-set kind, derived-view declaration when needed, the emitted shortlist family, and promotion/default declaration.
Those selector-facing field values should use controlled tokens, cited ids, or already-declared head labels rather than selector-local prose values.
Tell (archetype).System must choose among rival families without lying about measurement legality, crossings, or evidence. Episteme insists that what is chosen must remain comparable, auditable, and stable under refresh.
Show 1 (multi-Tradition dispatch; unordered shortlist).
A CG-Frame includes multiple decision-theoretic families with different admissibility assumptions. Evidence for some CHR traits is incomplete.
System registers families (S1), then runs Select (S3) on a pinned TaskSignatureRef. Eligibility is tri-state; some families abstain due to missing minimal-evidence pins. Among remaining candidates, only a partial order is admissible, so the selector publishes one Shortlist with explicit basisPins instead of inventing one scalar winner. No shadow acceptance logic appears in the selector; it consumes pinned acceptance and legality records.
Show 2 (specialist handoff; ranked publication).
A bounded-specialization comparison keeps two method families live, but downstream handoff now requires one ordered public result rather than one merely unordered retained set.
The admissible G.5 result is therefore one RankedShortlist with explicit ordering, ShortlistId, and handoff-facing nextUse, so the publication itself states whether the order is public.
Show 3 (no admissible survivor; abstain or escalation).
A frame fails one legality gate and one minimal-evidence gate at the same time.
The truthful G.5 result is one abstain or escalation publication that names the blocking pins and the next downstream use boundary, not one empty shortlist that leaves downstream users unsure whether selection silently failed or admissibly stopped.
Potential biases and failure modes this pattern explicitly guards against:
Monoculture bias (single Tradition dominance by default). Mitigation: registry requires explicit eligibility/assurance records; selection is set‑returning under partial orders; method‑specific policies stay explicit pins rather than hard-coded defaults.
Hidden scalarisation bias. Mitigation: set‑return semantics is core‑routed; dominance regimes are explicit and each default cites one declared governing definition.
“Tool equals method” bias. Mitigation: notation independence + prohibition of tool keywords in core registry/eligibility fields; tool choices are outside the core.
Cross‑Context leakage bias. Mitigation: explicit crossing pins only; Bridges + CL are required when crossings occur; no implicit crossings.
Survivorship bias in refresh. Mitigation: RSCR triggers are typed/id‑based; freshness/decay and telemetry deltas are first‑class causes with canonical ids.
Core conformance bridge.G.5 is conformant only if the effectiveG.Core obligations referenced by G.5:4.1 (GCoreLinkageManifest) are satisfied (after profile/set expansion and explicit deltas).
CC‑G5.0
Core standards SHALL remain notation‑independent; vendor/tool keywords are forbidden in registry, eligibility, assurance, or selector‑kernel obligations (E.5.*).
CC‑G5.1
Every MethodFamilySHALL declare an EligibilityStandardRef using CHR/CAL terms (typed; edition‑pinned where applicable). Standards SHALL NOT rely on tool‑specific keywords.
CC‑G5.2
Selection SHALL be a pure function of TaskSignatureRef + pinned policy/edition refs; side effects are limited to emitting DRR/SCR pins and telemetry/RSCR triggers (no hidden mutation of constraint-bearing spec refs).
CC‑G5.3
Delegated (ID‑continuity). Cross‑Context use MUST follow G.Core crossing visibility and penalty routing. Delegation targets:CC‑GCORE‑CROSS‑1, CC‑GCORE‑PEN‑1.
CC‑G5.4
Default rule forDefaultId.GammaFoldForR_eff. The selector MUST default to the weakest‑link rule for R_eff and record contributors in SCR; it MAY use an alternative Γ‑fold only when provided by an explicitly pinned policy/profile with proof obligations satisfied (monotonicity; boundary behavior).
CC‑G5.5
Ordinal scales MUST NOT be averaged/subtracted; any aggregation/comparison must respect CHR scale typing and legality constraints (incl. CSLC where applicable).
CC‑G5.6
Method and generator family identities SHALL be published to UTS with the required naming discipline (twin labels where applicable; deprecations follow lexical continuity rules). (Core conformance applies; G.5 adds the registry‑specific publication obligation.)
CC‑G5.7
Conditional. If G.5:Ext.EELog is present, exploration MUST be budgeted under the pinned E/E‑LOG policy; probe outcomes MUST feed refresh via canonical RSCR trigger kinds.
CC‑G5.8
CG‑Frame gate enforced. Selection rejects or abstains from candidates that do not meet the pinned CG‑Spec.MinimalEvidence requirements for the characteristics they cite.
CC‑G5.9
Delegated (ID‑continuity). Set‑return semantics are pinned through G.Core. Delegation target:CC‑GCORE‑SET‑1. Candidate ordering MUST be admissible over typed traits and legality constraints. If only a partial order is available, selection MUST return one declared selector outcome (for example one SetResultOutcome with Shortlist/RankedShortlist, one HandoffOutcome with SpecialistHandoff, or another pinned outcome result), with no forced totalisation via illegal scalarisation.
CC‑G5.10
SCR completeness. SCR MUST enumerate Γ‑fold contributors (when used), referenced constraint-bearing spec editions, the evidence citations (PathId/PathSliceId) used in gating/rationale, and MinimalEvidence gating verdicts (by lane & carrier, when such gating is relied upon).
CC‑G5.11
Delegated (ID‑continuity). Tri‑state eligibility/acceptance semantics and unknown handling are pinned through G.Core. Delegation target:CC‑GCORE‑GUARD‑1. (Includes the rule that degrade(...) is expressed via a pinned FailureBehavior/SoS‑LOG branch id — not as a fourth status.)
CC‑G5.12
No “universal” cross‑Tradition scoring. Cross‑Tradition selection MUST NOT rely on a single numeric formula not justified by pinned CHR/CAL constraints and the constraint-bearing spec refs. If a triad or selected set claims universality, it MUST satisfy explicit, pinned heterogeneity gates (ids/pins), e.g., FamilyCoverage ≥ k and MinInterFamilyDistance ≥ δ_family, where k and δ_family are declared by the pinned policy/TaskSignature/SoTA pack, and cite the relevant Context Card id (F.1) in DRR/SCR; otherwise treat the outcome as Context‑local.
CC‑G5.13
Conditional. If the selector consumes admissibility/maturity records (e.g., via G.5:Ext.SoSLOG), it MUST NOT recompute thresholds; it consumes pinned admissibility ledger rows and cites clause/rung ids in audit pins.
CC‑G5.14
Φ(CL) / Φ_plane discipline. If crossing or plane penalties are applied, the active penalty policy ids (e.g., Φ(CL), Φ_plane) MUST be explicit in audit pins, and the pinned policies MUST satisfy the monotone & bounded requirements asserted by their cited constraint-bearing spec refs and be published via those same cited spec refs (e.g., CG‑Spec). SCR MUST record the policy‑id in use; penalty routing semantics remain pinned through G.Core.
CC‑G5.15
Unit and scale legality MUST be established via CSLC (A.18) before any aggregation or Γ‑fold; unit and scale mismatches are a fail‑fast defect.
CC‑G5.16
Hidden thresholds are forbidden. Thresholds live in explicitly pinned acceptance/eligibility policy records, not in selector prose, LOG shells, or code.
CC‑G5.17
ReferencePlane MUST be declared (pinned) for any claim that is used in dispatch, and the selector’s audit records must cite it (including plane‑crossing pins when applicable).
CC‑G5.18
Numeric comparisons/aggregations used by dispatch MUST cite an admissible, edition‑pinned comparator/spec publication (as provided by the constraint-bearing spec refs); illegal mixes of scale types are forbidden.
CC‑G5.19
Conditional (QD). If G.5:Ext.NQD is present, the required QD telemetry triple (quality/diversity/QD summary) MUST be computable and publishable under the pinned descriptor/distance definitions and archive policy, without redefining their semantics in G.5.
CC‑G5.20
Conditional (QD). QD/illumination summaries are treated as telemetry unless explicitly promoted by a pinned acceptance/policy record; the selector must record the promoting policy id in audit pins.
CC‑G5.21
Conditional (Archive/QD). Any use of archives MUST declare InsertionPolicyRef and pin the required editions for reproducibility (e.g., descriptor/distance definitions and any method editions they depend on).
CC‑G5.22
Conditional (QD). Twin‑naming discipline for descriptor vs plain space (if used) must be respected (distinct objects; no aliasing).
CC‑G5.23
Default rule forDefaultId.PortfolioMode. The selector MUST expose PortfolioMode ∈ {Pareto, Archive} with default = Archive, and echo it in DRR/SCR and declared selector results when not explicitly overridden by pinned policy/TaskSignature. The default is a retention/evidence-preservation policy, not a public selected-set label, not a dominance default, and not a substitute for SetResultFamily. ε‑fronts are allowed as local decision aids under CG‑Spec when explicitly pinned.
CC‑G5.23a
Parity‑run publication. If parity harness is in use, a selector/generator MUST publish a parity run and ParityCard to UTS (see G.9). This obligation remains mandatory irrespective of dominance/PortfolioMode policy.
CC‑G5.24
Conditional (Open‑Ended). If G.5:Ext.OpenEndedFamilyWiring is present, the selector MUST return declared sets of {Environment, MethodFamily} pairs as set‑valued outcomes under explicit pins.
CC‑G5.25
Conditional (Open‑Ended). In Open‑Ended mode, TransferRulesRef.edition is mandatory and MUST be visible to telemetry and RSCR triggers.
CC‑G5.26
Conditional (Archive/QD). Within any archive niche/cell, ordering and tie‑breaks MUST remain admissible over compatible scales; illegal mixed‑scale weighted sums are forbidden.
CC‑G5.27
If the selector cites any GateCrossing, the corresponding CrossingBundle publication MUST be present and conformant; missing/non‑conformant CrossingBundle blocks downstream consumption.
CC‑G5.28
Default rule forDefaultId.DominanceRegime. DominanceRegimeSHALL default to ParetoOnly. Any inclusion of additional telemetry dimensions into dominance (e.g., illumination) requires an explicitly pinned acceptance/policy record and must be recorded in audit pins. Parity‑run publication (CC‑G5.23a) remains mandatory irrespective of dominance policy.
CC‑G5.29
Conditional (QD/Open‑Ended). Any telemetry event that materially changes an archive / retained-set state MUST log PathSliceId, the active policy id, and the active editions of the relevant definition pins (DescriptorMapRef.edition, DistanceDefRef.edition, and TransferRulesRef.edition when applicable) and expose them to RSCR triggers.
CC‑G5.30
No Strategy minting. Within G.5, “strategy” is a policy‑bound composition template; the pattern SHALL NOT mint a new universal U.Type named Strategy (E.10 discipline). If a stable reference is needed, publish composition/policy ids (e.g., UTS entries) rather than minting a universal type.
CC‑G5.31
Strategy hint on non‑admissible sets. If selection yields CandidateSet = ∅, the selector SHALL emit an explicit escalation hint (ActionHint) that is DRR/SCR‑compatible and auditable: include (at minimum) the top‑3 blocking constraints as cited ids/pins, and (where applicable) the relevant edition pins (e.g., TransferRulesRef.edition in Open‑Ended mode) to guide exploration under explicitly pinned lenses (e.g., E/E‑LOG).
CC‑G5.32
Parity‑run publication + admissible roll‑ups. If parity harness is in use, parity publication is required per CC‑G5.23a (ID‑continuity). Any scalar roll‑up or summary view MUST be admissible under CG‑Spec (no mixed‑scale sums), and published views must preserve set‑return semantics (no single‑score leaderboards as authoritative outputs without an explicit, admissible comparator publication).
CC‑G5.33
Conditional (bounded specialization). When the selection question is acquisition of usable specialization on a declared TaskFamilyRef or TaskSignature, selector outputs SHALL either publish TaskFamilySpecializationProfile@Context or cite equivalent pins carrying the C.22.1 adaptation-signature fields needed for comparison: work-measure threshold target, prior exposure declaration, time-to-threshold, budget-to-threshold, post-threshold efficiency when relevant, and any declared transfer, retention, downside, or specialization-entry notes.
CC‑G5.34
Selected-set publication label. When SelectorOutcomeKind = SetResultOutcome, the published selected-set label MUST be explicit. Use Shortlist as the public selected-set label, RankedShortlist only when ordering materially belongs to the result, publish ShortlistId when one public identifier is emitted, and do not silently let ChoiceSet replace that public label.
CC‑G5.34a
Selector outcome typing. Published selector results MUST declare SelectorOutcomeKind. SetResultFamily is required only when SelectorOutcomeKind = SetResultOutcome; HandoffKind is required only when SelectorOutcomeKind = HandoffOutcome. Non-set outcomes MUST NOT masquerade as one public selected-set label.
CC‑G5.35
Publication closure. Any published selector result MUST state the declared SelectorOutcomeKind, any applicable public selected-set label, retained members or narrowed handoff content, ordering status (when applicable), and basis pins directly in the emitted result rather than relying on upstream C.11, C.19, or C.24 notes.
CC‑G5.36
Neighboring-pattern boundary. If the current question is still local choice among already-available options, pool policy over still-live candidate lines, or enactment planning after choice, G.5MUST consume the published result from C.11, C.19, or C.24 rather than restating those patterns as if publication itself decided the matter.
CC‑G5.37
Derived tradition-view publication discipline. If the selector publishes one result through a derived tradition view such as TraditionFront or TraditionArchive, it MUST keep the declared base SourceSetFamily explicit, keep SoTAPaletteDescription recoverable through BasePaletteRef, and MUST NOT let the derived view become the default meaning of Tradition, TraditionPalette, or the base palette.
CC‑G5.38
Causal method dispatch declarations. If method selection involves causal methods, each compared method MUST declare causalMethodUseClassification as observational predictor, intervention optimizer, counterfactual strategy, causal fairness estimator, causal-RL policy, or simulation-only method, and MUST carry causalUseSupportRecordRef and causalUseSupportVerdict when it consumes C.28 causal-use support rather than treating method dispatch as causal certification.
Anti‑pattern: “Selector as a shadow spec.”Symptom: local acceptance/legality rules appear in selector prose/code, diverging from CN/CG/CAL.
Avoid: route all constraint semantics via CNSpecRef/CGSpecRef and pinned CAL records; keep G.5 core as a facade.
Anti‑pattern: “Implicit crossings.”Symptom: cross‑Context reuse is claimed without Bridge/CL pins, or without cited CrossingBundle.
Avoid: require explicit crossing pins; block consumption without publication.
Anti‑pattern: “Hidden scalarisation.”Symptom: partial orders are flattened into single winners “for convenience”.
Avoid: return declared sets; make dominance regimes explicit; keep telemetry report‑only unless promoted by explicit policy.
Anti‑pattern: “Method specifics in the selector head.”Symptom: QD/OEE/preference models become mandatory for basic dispatch.
Avoid: keep them in G.5:Ext.* blocks with explicit pins and Uses.
Anti‑pattern: “Churn by meaning.”Symptom: registry entries are “renamed” to reflect updated interpretation, breaking continuity.
Avoid: version/deprecate; keep stable ids; use explicit edition pins and deprecation notices.
Anti‑pattern: “Publication hidden in upstream reasoning.”Symptom: the retained set exists only as one implication inside C.11, C.19, or C.24, while G.5 never names the published selected-set label.
Avoid: publish the selected-set result directly, with explicit label, members, and basis pins, instead of leaving the shortlist implicit in neighboring doctrine.
Anti‑pattern: “Published result without closure record.”Symptom: a Shortlist, narrowed handoff, or abstain result is named, but the emitted result still does not state its members, ordering status, or basis pins.
Avoid: publish the head, retained members, ordering status, abstain or escalation condition, and basis pins directly in G.5.
Auditable plurality. Multiple Traditions can co-exist without forced semantic flattening; dispatch remains explainable and evidence-pinned.
Core stability. Universal invariants are pinned through G.Core; method/generator innovation does not churn the selector head.
Evolvability. Registries allow growth, retirement, and refresh with typed RSCR causes and explicit payload pins.
Composability. Strategy templates and fallbacks remain legality-checked and portable across implementations.
Recoverable publication. Selected-set results can now travel downstream as explicit shortlist-family, ranked-shortlist, or abstain/escalation results rather than one hidden implication inside upstream reasoning.
Why registries? Dispatch requires stable, auditable family objects with explicit eligibility and assurance records; otherwise selection collapses into ad-hoc tooling.
Why separation via Extensions? QD/OEE/preference-learning and similar families are fast-moving and method-specific; making them part of the selector head would force a universal semantics and violate strict distinction.
Why set-return? Partial orders are common and often the only admissible representation under heterogeneous scales; set-return preserves semantics and makes tie criteria explicit.
Why explicit defaults with one declared source? Defaults are unavoidable; single-source indexing prevents competing defaults from silently diverging across patterns.
Why selected-set publication here? Once the current question is to publish one retained set for downstream use, the selector should publish that result directly instead of leaving it implicit in local choice, pool-policy, or enactment notes written for other purposes.
This pattern is designed to carry extension declarations for, not redefine, post-2015 SoTA families via Uses plus edition and policy pins:
Quality-Diversity / illumination (post-2015 refinements). Archive-centric QD families fit naturally as G.5:Ext.NQD extension declarations with explicit descriptor, distance, and insertion pins. The practical implication is to keep publication honest about whether the selector is returning one admissible set, one ranked result, or no admissible survivor at all.
Open-Endedness (post-2015 line). POET-class and later open-ended or co-evolutionary families dock via generator registries plus TransferRulesRef.edition pins. The practical implication is to publish pair- or retained-set-shaped results explicitly rather than silently squeezing them into one false single-family winner.
Algorithm selection and meta-selection. Modern selection under uncertainty, robust evaluation, and policy-driven probing dock via explicit policy records and typed telemetry pins, rather than hard-coded scoring rules. The practical safeguard is that the publication label and basis pins must still remain explicit after those policies have acted.
Budgeted specialist acquisition. Current agentic search lines compete on time or budget to threshold plus truthful selected-set return when heterogeneous specialists remain non-dominated, so G.5 keeps specialization profiles and set-return semantics explicit instead of forcing one static breadth winner.
Preference-learning comparators. Interactive and learned-preference regimes are treated as comparator or policy records with explicit editions when they are actually declared.
SoTA here is treated as best-known practice for a declared goal and constraint regime, not whatever is currently popular.
Evidence-source clarification: peer-reviewed source references carry the most direct citation strength for typed comparison, budget-to-threshold, and truthful selected-set return. Faster-moving workshop, poster, or frontier-exploration lines remain explicit source references for specialization-entry or open-ended pressure, not silently equal evidence for every selector claim.
Optional method/generator extensions via G.5:Ext.*: C.18, C.19, C.23, plus any future extension-bearing patterns that add extra selector pins.
Mathematical-lens use: apply C.29 when a selector input depends on a claim-relevant comparator, distance, descriptor geometry, embedding, normalization, surrogate model, learned representation, QD archive descriptor, model-family label, or model-selection basis whose mathematical object, mapping mode, preserved/lost structure, or stop condition is not yet recoverable. C.29 may return NoMathLensUseNeeded, MathLensUse.LensCandidateNote, MathLensUse.OneLine, MathLensUse.MiniCard, MathLensUse.FullCard, or NeighborGoverningPatternNote for the stated selector use. It does not publish the selected set, selector policy, registry row, shortlist, ranked shortlist, or selector evidence pins; those stay in G.5 and its governing refs.
Publishes to:UTS (family ids, selector policy records, and selected-set identities such as ShortlistId when one public result is emitted), G.6 (audit citations), RSCR emission records (typed triggers + payload pins), and downstream packs via G.10 shipping publications.
Coordinates with:C.11 for local choice results, C.19 for pool-policy records, C.24 for enactment-facing next-move records, and the accepted Q-Front shortlist-family continuity line when the published selected-set label is one shortlist-family result.
SoTA claims, operators, and method families are admitted (or gated) using assurance signals derived from diverse artefacts and anchors. FPF already mandates Evidence Graph Referring (A.10), lane discipline, and the assurance skeleton (B.3). What is often still missing in practice is a first‑class, citable object that makes the provenance of an admission/decision addressable:
exactly which anchors and bindings were used,
under whichReferencePlane and BoundedContext,
with which explicit crossings and penalty policies,
for which time window (freshness/decay),
in a way that selectors, audits, and maturity transitions can cite without copying tables or re‑telling a story.
This pattern introduces the missing kit: a typed, lane‑aware EvidenceGraph plus stable PathId / PathSliceId addresses that downstream LOG, UTS, parity, and refresh can cite.
Why here (not in G.4)?G.4 governs CAL artefacts (EvidenceProfiles, ProofLedger, acceptance policies). G.6 packages cross‑artefact provenance as a graph and mints path identities that downstream surfaces can cite without duplicating CAL tables or re‑inventing legality rules.
GCoreLinkageManifest := ⟨ CoreConformanceProfileIds := { GCoreConformanceProfileId.PartG.AuthoringBase, GCoreConformanceProfileId.PartG.UTSWhenPublicIdsMinted }, RSCRTriggerSetIds := { GCoreTriggerSetId.EvidenceGraphKit }, CorePinSetIds := { GCorePinSetId.PartG.AuthoringMinimal, GCorePinSetId.PartG.CrossingVisibilityPins }, CorePinsRequired := { EvidenceGraphId, EvidenceGraphRef.edition?, // iff editioned as a published artefact PathId[]/PathSliceId[], // strengthened (unconditional for G.6) UTSRowId[], // strengthened (UTS Name Cards + PathCards are required outputs) Γ_timePolicy?, // iff empirical legs exist (or equivalently: window id carried by PathSliceId) ΓFoldRef.edition?, // iff an explicit Γ-fold artefact is pinned CAL.ProofLedgerId[]? // iff Γ-fold is overridden (cite CAL ProofLedger ids; governed by G.4) }, DefaultsConsumed := { DefaultId.GammaFoldForR_eff }, TriggerAliasMapRef? := G.Core.TriggerAliasMap.G6 ⟩
Conditional add‑on (tri‑state guard). If G.6 is used to publish or consume guard outcomes (e.g., via G.6:Ext.SoSLOGPathCitationWiring), additionally require:
CoreConformanceProfileIds += { GCoreConformanceProfileId.PartG.TriStateGuard }.
(Nil‑elision + expansion rule are per G.Core:4.2.)
#EvidenceGraph (object; surface governed by the kit)
Definition (object). An EvidenceGraph is a typed DAG whose nodes are resolvable to A.10 anchors/carriers and evidencing roles, and whose edges represent minimal, normative provenance relations suitable for audit and path citation.
Nodes. Each node is an A.10‑anchored evidence carrier or evidence role (e.g., a proof carrier, a measurement record carrier, a tool‑qualification carrier). Nodes MUST remain grounded in A.10 anchors and MUST NOT introduce mereological structure (A.10 firewall).
Node kinds (explicit; stable). Nodes MUST have an explicit kind tag nodeKind ∈ {U.EvidenceRole, SymbolCarrier, TransformerRole, MethodDescription, Observation} (as used in the existing Part‑G vocabulary), so downstream projections can remain notation‑independent and audit‑checkable.
Extension pins. Method‑family‑specific pins (e.g., QD/OEE) MUST NOT be introduced as new “core node kinds”; they are carried as additional pins only when the relevant GPatternExtension is in use and are recorded on UTS PathCards / SCR projections as required by that extension.
Edges (minimal normative vocabulary). The pattern admits a small set of provenance edges sufficient for audit:
verifiedBy (formal line),
validatedBy (empirical line),
fromWorkSet (run‑time trace provenance),
happenedBefore (temporal ordering),
derivedFrom (controlled derivation).
(Informative only)usedCarrier, interpretedBy MAY appear as authoring aids, but MUST NOT be relied on for conformance checks (their semantics remain non‑normative in G.6).
Additional narrative edges MAY exist as informative annotations but MUST NOT be relied on for conformance checks.
Lane tags. Every binding on a path is lane‑typed with assuranceUse ∈ {TA, VA, LA} (lane separation remains explicit through to SCR projections; no silent cross‑lane averaging).
Externality (no self‑evidence). Any evidencing TransformerRole that would certify the evaluated holon MUST be modelled as external (or model a meta‑holon explicitly); G.6 does not permit reflexive “self‑evidence” shortcuts.
Context and plane attachment. Nodes and claims carry BoundedContext and ReferencePlane. Any movement across context/kind/plane/design↔run/edition boundaries is represented via explicit GateCrossing/CrossingBundle artefacts (with crossing pins routed per G.Core).
#PathId and PathSliceId (citable justification addresses)
PathId (address for justifications). A PathId is a stable identifier minted for a claim‑local, lane‑typed path in an EvidenceGraph under a declared scope slice (including a time selector where applicable) and a declared ReferencePlane. A PathId is meant to be citable from downstream artefacts (LOG, UTS, parity, shipping) without duplicating evidence tables.
A PathId citation surface SHALL include, at minimum:
the lane split (TA/VA/LA) for the path,
the explicit crossing pins (when crossings are traversed),
the freshness/time attachment status for empirical legs (when present), including any explicit validUntil/expiry marker when one is declared (or a decay/freshness policy pin that implies expiry),
the pinned policy identifiers relevant to the path’s penalty/trust wiring (policy ids are cited; policies remain governed elsewhere),
the effective crossing‑trust “bottleneck” information when crossings exist (e.g., lowest CL/CL^k/CL^plane encountered on the cited slice),
the effective Γ‑fold in force for any published/relied‑upon R_eff projection (default or explicit override), and (when overridden) the cited CAL ProofLedger ids that justify the override,
the EvidenceGraphId and enough addressability to resolve the path to SCR/RSCR anchors.
PathSliceId (time‑ & plane‑lifted snapshot). A PathSliceId denotes a release‑quality snapshot key for a path under explicit time/plane binding (e.g., window policy + ReferencePlane) and is intended as the address used when refresh/RSCR wants path‑granular recomputation.
The universal definition of “what kinds of changes force refresh” is governed by G.Core (typed trigger kinds). G.6 only makes the slice addressable and pin‑complete.
When downstream methods require additional edition/policy pins for reproducibility (e.g., archive/illumination/QD surfaces), such pins are specified by the relevant GPatternExtension module(s) and are treated as required pins when that extension is used.
#Assurance and legality binding (delegation‑first; no shadow specs)
G.6 does not redefine B.3 or legality rules; it binds evidence paths to existing governing definitions:
Assurance skeleton. Lane separation and the F/G/R skeleton are as per B.3. Any statement about penalty routing or default Γ‑fold is delegated to G.Core and the Default Governing Definition Index (do not restate).
CAL linkage. When a path claims a proof obligation or an override (e.g., an explicit Γ‑fold override), it MUST cite the relevant CAL ProofLedger / EvidenceProfiles artefacts (G.4) rather than inventing local semantics.
Legality binding. If a path includes numeric comparisons/aggregations, the legality surface MUST be cited via CG‑Spec (G.0) rather than re‑implemented in G.6 prose.
These are conceptual shapes, not tool APIs (E.5 discipline).
Explain(pathId | pathSliceId) → returns a citation‑ready explanation bundle: lane split, relevant pins (crossings/policies/editions), freshness binding, and links to contributing anchors (A.10) and any CAL evidence/profile refs.
PathsFor(claim, scopeSlice, referencePlane) → enumerates admissible paths, returning PathId[] with enough metadata to support selection/audit queries.
Snapshot(pathId | pathSliceId) → emits a release‑grade snapshot record (SCR/RSCR‑grade) whose keys are citable and whose pins are explicit.
Notes (wiring‑only): This module preserves ergonomics/back‑compat by allowing G.6:H3:* labels, while requiring that recorded causes use canonical RSCRTriggerKindId (per CC‑GCORE‑TRIG‑3).
GPatternExtension: SoSLOGPathCitationWiring
PatternScopeId:G.6:Ext.SoSLOGPathCitationWiring
GPatternExtensionId:SoSLOGPathCitationWiring
GPatternExtensionKind:InteropSpecific
GoverningPatternId:C.23
Uses:{C.23, C.19, G.5, G.11}(SoS‑LOG decisions cite paths; optional lens/attribution wiring is governed by C.19; refresh consumes triggers)
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum):
SoSLogRuleId[] / BranchId[](as cited labels; semantics governed by C.23)
FailureBehaviorPolicyId(when degrade(mode=...) is used)
PathId[] | PathSliceId[] (the cited justification addresses)
LensId?(when a C.19 lens is used for attribution/explainability; id only; semantics governed by C.19)
Notes (wiring‑only): This module requires that bridge/sentinel changes re‑trigger RSCR path‑locally for affected PathId/PathSliceId scopes, without redefining sentinel semantics (governed by G.7) and without inventing new trigger kinds (governed by G.Core).
GPatternExtension: QD_OEE_TelemetryPins
PatternScopeId:G.6:Ext.QD_OEE_TelemetryPins
GPatternExtensionId:QD_OEE_TelemetryPins
GPatternExtensionKind:MethodSpecific
GoverningPatternId:C.18(QD artefact semantics); uses C.19 for exploration/logging/lens wiring as needed
Uses:{C.18, C.19}
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum; conditional on use):
DescriptorMapRef.edition
DistanceDefRef.edition
InsertionPolicyRef(policy id or pinned policy ref, per governing definition semantics)
EmitterPolicyRef?
LensId?(when a C.19 lens is used in selection/telemetry attribution)
TransferRulesRef.edition? / EnvironmentValidityRegionRef?(when open‑ended / transfer events are in scope)
Notes (wiring‑only): This module enforces reproducibility of archive/illumination and open‑ended telemetry when those surfaces are used, without pulling QD/OEE semantics into the EvidenceGraph core.
System (Γ_sys):Autonomous brake envelope claim.
Claim: “Stop within 50 m from 100 km/h.” EvidenceGraph nodes include proof carriers (TA/VA), instrumented track tests (LA/VA), calibration carriers, and an external test lab as an external evidencing role (no self‑evidence). A PathId provides a stable justification address; empirical legs are bound to explicit windows; crossings (if any) are explicit and pinned.
Episteme (Γ_epist):Benchmark parity/replication lineage (post‑2015 practice).
Claim: “Method family M attains parity on ImageNet‑style tasks under a declared evaluation protocol.” EvidenceGraph nodes include replication carriers (LA), legality/metric‑soundness carriers (VA), and tool‑qualification carriers (TA). The cited PathId binds the ReferencePlane, the scope slice, and the pinned evaluation/legal surfaces (by edition/policy ids rather than prose). When refresh triggers occur (edition pin change, evidence surface edit, decay events), downstream artefacts can re‑cite or re‑compute using the same PathSliceId addressing discipline.
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did.
Scope: Universal for the EvidenceGraph kit; any method‑specific telemetry / PortfolioMode wiring is modularized as Extensions and cited to its governing patterns.
G.6 is conformant only if it satisfies the effectiveCC‑GCORE‑* set expanded from the GCoreLinkageManifest in §4.1 (explicit crossings & pins, penalties→R_eff only, P2W split, typed RSCR trigger kinds, defaults with one governing definition, UTS discipline, Δ‑discipline).
Cite core invariants
CC‑G6‑1 (Anchor & lanes)
Every citable path MUST resolve to A.10 anchors (SCR/RSCR addressable) and MUST declare lane tags (TA/VA/LA) on bindings.
Ground auditability
CC‑G6‑2 (No self‑evidence)
Any evidencing TransformerRole that certifies the evaluated holon is external; reflexive cases MUST be modelled as a meta‑holon.
Avoid reflexive evidence
CC‑G6‑3 (Context/Plane & crossings)
Paths MUST declare BoundedContext and ReferencePlane, and MUST expose explicit crossing pins when crossings are present. (Delegation target: CC‑GCORE‑CROSS‑1.)
Make crossings explicit
CC‑G6‑4 (Penalty routing)
Any crossing/plane penalty wiring visible in G.6 artefacts MUST route penalties to R_eff only and MUST preserve F/G invariance under penalties. (Delegation target: CC‑GCORE‑PEN‑1.)
If a Γ‑fold is not explicitly overridden by pinned CAL artefacts, G.6 MUST cite the governing definition of DefaultId.GammaFoldForR_eff rather than asserting a local default. If a Γ‑fold is explicitly overridden, the path/SCR surface MUST cite the relevant CAL ProofLedger ids and publish the override as an auditable pin (not as prose). (Delegation: CC‑GCORE‑DEF‑1; override semantics governed by G.4.)
Keep folding auditable
CC‑G6‑6 (Time/decay/validity binding)
Empirical legs MUST expose freshness/time binding (window selector or policy pin) and MUST support an explicit validUntil/expiry marker when one is declared (or an equivalent decay/freshness policy pin that implies expiry). Expiry/decay MUST be representable as refresh/RSCR‑relevant change using typed canonical causes. (Delegation intent: typed causes are governed by G.Core; see CC‑GCORE‑TRIG‑*.)
Enable refresh readiness
CC‑G6‑7 (DesignRunTag split)
Design‑time method descriptions and run‑time work traces MUST NOT be fused into one undifferentiated node; the graph MUST preserve the design↔run boundary via explicit carriers/bridges. (Delegation intent: P2W split is governed by G.Core; see CC‑GCORE‑P2W‑1.)
Preserve P2W boundary
CC‑G6‑8 (SCR projection completeness)
For any cited PathId/PathSliceId, the Assurance SCR view MUST expose at least: lane split, scope/plane pins, freshness/validity binding, explicit crossing pins (and the effective bottleneck CL/CL^k/CL^plane when crossings exist), the effective Γ‑fold in force for any R_eff folding (default or override, plus CAL ProofLedger ids when overridden), and links to contributing A.10 anchors and any CAL evidence/profile refs.
Make decisions auditable
CC‑G6‑9 (Citable PathIds)
Any SoS‑LOG admit/degrade/abstain decision or maturity rung transition that relies on provenance MUST cite PathId(s) (or PathSliceId(s) when snapshot‑binding is required).
Decision traceability
CC‑G6‑10 (SpanUnion justification note)
If a SpanUnion/non‑interaction claim is made across evidence lines, an explicit independence justification MUST be published (as an addressable artefact linked to the path).
Non‑interaction audit
CC‑G6‑11 (UTS hooks)
Evidence carriers and paths minted for citation MUST be UTS‑citable with twin labels and edition pins. (Delegation target: CC‑GCORE‑UTS‑1.)
Stable citations
CC‑G6‑12 (IndependenceCertificate)
Independence for SpanUnion claims MUST be carried by an IndependenceCertificate (per the relevant certificate pattern) and referenced from SCR/paths.
Certificate surface
CC‑G6‑13 (Mandatory provenance pins)
Any published/cited path surface MUST expose: EvidenceGraphId, PathId/PathSliceId, lane split, scope/plane pins, freshness/validity pins when applicable, crossing pins when applicable, and the minimal pin set required by §4.1. When R_eff folding is published/relied upon, the effective Γ‑fold in force MUST be exposed (default or override, plus CAL ProofLedger ids when overridden). When QD/OEE telemetry pins are in use, the extension‑required edition/policy pins MUST also be exposed.
Pin completeness
CC‑G6‑14 (Legality binding; no shadow specs)
If numeric operations are cited/used in a path, legality MUST be pinned/cited via CG‑Spec rather than asserted locally, and the path/SCR surface MUST fail fast on illegal arithmetic/typing (e.g., CSLC/scale violations); do not “promote” ordinal to cardinal by convention inside G.6. (Delegation target for “no shadow specs”: CC‑GCORE‑CN‑CG‑1.)
Prevent illicit arithmetic
CC‑G6‑15 (Conditional: QD/OEE telemetry pins)
(Conditional) If G.6:Ext.QD_OEE_TelemetryPins is used, the required edition/policy pins from that extension (at minimum DescriptorMapRef.edition, DistanceDefRef.edition, and the relevant insertion/emitter/transfer policy pins when applicable) MUST be recorded for reproducibility and must participate in RSCR triggering using canonical trigger kind ids.
Obligation. Publish a UTS PathCard with twin labels, listing the explicit pins required by §4.1 (context, plane, and time binding, crossing pins if any). If an extension requires additional pins for reproducibility (e.g., G.6:Ext.QD_OEE_TelemetryPins), those pins MUST be present when the extension is in use.
Invariants. Crossing visibility and penalty routing are delegated to G.Core (CC‑GCORE‑CROSS‑1, CC‑GCORE‑PEN‑1).
#H3 — RSCR Trigger on Evidence‑Impacting Edit (typed; alias‑dockable)
Trigger. Any edit in G.6 that can change a path’s audit‑relevant surface (evidence structure, crossing pins, penalty policy pins, plane binding, freshness binding, edition/policy pins, or telemetry‑bound fields).
Obligation. Emit RSCR triggers using canonical RSCRTriggerKindId (from G.Core) and record affected scope (PathId/PathSliceId) plus payload pins required for downstream refresh. If a deprecated G.6:H3:* label is recorded, it is recorded as an alias label and docked via G.Core.TriggerAliasMap.G6. When G.6:Ext.BridgeSentinelWiring is used, include the bridge/sentinel payload pins required by that extension.
Publishes/Consumes. Publishes: RSCR triggers and any associated RSCR test ids. Consumes: relevant pins/refs and CAL artefact references where applicable.
Invariants. Trigger typing and alias docking are delegated to G.Core (CC‑GCORE‑TRIG‑*). Penalty routing invariants are delegated (CC‑GCORE‑PEN‑1).
Trigger. A SoS‑LOG rule yields a tri‑state decision for a selection‑relevant pair (e.g., (TaskSignature, MethodFamily)), and the decision is justified by evidence.
Obligation. The branch record MUST cite the relevant PathId/PathSliceId(s) and the minimal pins required to re‑audit the justification. Any method‑specific attribution fields are handled via Extensions (e.g., G.6:Ext.SoSLOGPathCitationWiring for LensId/FailureBehavior wiring, G.6:Ext.BridgeSentinelWiring for bridge‑monitoring payload pins when cross‑context reuse is invoked, G.6:Ext.QD_OEE_TelemetryPins for QD/OEE pins).
Publishes/Consumes. Publishes: an SCR‑visible branch record with cited paths. Consumes: EvidenceGraph path queries.
Invariants. Tri‑state semantics are governed by G.Core (CC‑GCORE‑GUARD‑1); G.6 does not add a new decision value.
Trigger. A maturity rung transition is proposed and justified by evidence.
Obligation. The transition MUST cite one or more PathId/PathSliceId(s) and MUST publish an updated maturity entry with those citations. Missing path citations forbid rung advance.
Publishes/Consumes. Publishes: updated UTS entry for maturity artefacts. Consumes: cited paths and A.10 anchors.
Invariants. Any thresholding policy remains governed by CAL/LOG governing definitions; G.6 provides citation, not policy.
Trigger. An EvidenceGraph edge traverses a declared GateCrossing boundary (context/kind/plane/design↔run/edition).
Obligation. Publish a CrossingBundle‑checkable crossing record with explicit crossing pins (UTS row id, Bridge id/card id if applicable, CL regime pins if applicable, and plane pins if applicable).
Trigger. A path binds across different reference planes.
Obligation. Publish the relevant policy identifiers (ids only; not tables) required to audit plane effects, alongside the path’s pins.
Publishes/Consumes. Publishes: SCR/UTS fields containing policy ids. Consumes: the governing definition’s policy registries as cited publications or records (do not duplicate tables).
Invariants. Penalty routing is delegated (CC‑GCORE‑PEN‑1); no shadow specs (CC‑GCORE‑CN‑CG‑1).
Trigger.G.6 artefacts are exported for release or consumed by downstream patterns that require GateCrossing checks.
Obligation. Provide harness‑readable ids/pins so GateCrossing checks can verify: required crossing records exist, lexical constraints hold, and crossing pins are explicit.
Trigger. A downstream artefact cites a path for audit/selection/maturity.
Obligation. Expose the required provenance fields in SCR views: lane split, context or plane pins, freshness binding, crossing pins (when present), and links to A.10 anchors and CAL refs.
Publishes/Consumes. Publishes: SCR view(s). Consumes: EvidenceGraph paths and cited artefacts governed by cited patterns.
Invariants. Each cited default resolves to its governing definition (CC‑GCORE‑DEF‑1).
Trigger. A proof obligation or evidence role is attached to a claim and is represented in G.4 artefacts.
Obligation. Link EvidenceGraph nodes/edges to CAL ProofLedger/EvidenceProfiles entries and to A.10 carriers via the minimal provenance edge vocabulary.
Publishes/Consumes. Publishes: CAL proof refs as pins in the path explanation surface. Consumes: CAL artefacts.
Invariants.G.6 does not redefine CAL proof semantics; it only cites them.
Trigger. Run‑time outcomes (selection, probes, parity runs, measurement updates) produce observations that bear on previously asserted claims.
Obligation. Ingest the observation as a run‑time evidence line (anchored in A.10), with explicit lane typing and explicit scope/time binding. If method‑specific telemetry pins are required, they are governed by Extensions (e.g., G.6:Ext.QD_OEE_TelemetryPins).
Publishes/Consumes. Publishes: new EvidenceGraph nodes/edges + any required UTS rows + typed RSCR triggers when impacts occur. Consumes: run‑time carriers/attestations as conceptual anchors.
Invariants. P2W split is respected (CC‑GCORE‑P2W‑1); typed trigger discipline is respected (CC‑GCORE‑TRIG‑*).
Narrative‑only provenance (“because story”).Avoid: mint PathId/PathSliceId and require citation for any decision that claims evidence‑based justification (CC‑G6‑9).
Implicit crossings (“same entity, different context”).Avoid: represent crossings only via explicit crossing artefacts/pins; treat edition/plane/context changes as explicit crossing‑relevant edits and trigger RSCR (governed by G.Core crossing discipline).
Smuggling legality rules into EvidenceGraph prose.Avoid: cite/pin legality surfaces (CG‑Spec and CAL artefacts); do not introduce local “mini‑CG” rules in G.6 (cite CC‑GCORE‑CN‑CG‑1).
Unpinned editions/policies (“it’s obvious which version”).Avoid: require explicit edition/policy pins on citable paths; treat changes as typed triggers.
Alias‑only RSCR causes (“H3: something changed”).Avoid: record canonical RSCRTriggerKindId as the cause; aliases are labels only and must dock via G.Core.TriggerAliasMap.G6.
Benefits. Path‑addressable provenance; crossing/plane effects are auditable by pins rather than folklore; selectors and auditors read the same path-addressable evidence graph; refresh becomes localized (path‑scoped) rather than global “rerun everything”.
Trade‑offs. Authors must declare (or pin) time/plane/scope and keep pins explicit; mitigated by reusing CAL EvidenceProfiles and by modularizing method‑specific telemetry as Extensions.
G.6 concretizes the “because‑graph” implicit in A.10 into a typed, lane‑aware DAG with stable path addresses. It relies on canonical governing definitions for semantics:
A.10 for anchoring discipline and carrier reality,
This pattern aligns with post‑2015 best practice in reproducibility and evaluation governance by:
treating provenance and versioning/pinning as first‑class audit surfaces (rather than informal “methods” prose),
enabling selective re‑evaluation (path‑scoped refresh) rather than global reruns whenever one policy/edition changes,
separating design‑time specifications from run‑time traces/telemetry, matching modern reproducibility and “lineage” practice in complex ML/scientific pipelines,
keeping method‑family specifics (e.g., archive/illumination/QD pins or open‑ended telemetry pins) modular via extension wiring instead of embedding them into the universal provenance core.
SoTA synthesis (G.2) can legitimately preserve pluralism by exporting a BridgeMatrix: a Tradition×Tradition inventory of “comparable constructs” with preliminary notes (candidate correspondences, likely losses, tentative levels). Downstream patterns (CHR/CAL/selector/logging/shipping) cannot consume this safely unless cross‑Context reuse is:
materialised as explicit bridge artefacts (not implied by prose),
calibrated with a small, auditable procedure (so CL/CL^k/plane routing is not a narrative),
published as checkable crossing bundles (UTS + GateCrossing harness),
refreshable in a targeted way (path‑scoped RSCR rather than whole‑pack reruns).
G.7 packages this into a kit: BCT + BridgeCard publication + RegressionSet/SentinelSet wiring, so that later patterns can satisfy core invariants without re‑inventing cross‑Tradition machinery.
Cross‑Tradition comparisons are frequently attempted via informal “synonymy” or ad‑hoc mappings, causing silent meaning drift and hidden crossings.
Plane mismatches (world ↔ concept ↔ episteme, or other ReferencePlane shifts) are often ignored, or conflated with “semantic sameness”, causing wrong downstream confidence.
Calibration changes (CL/CL^k/plane or their policy pins) must trigger targeted re‑checks; pack‑wide reweaves are too costly and too slow.
If bridges are involved in QD/illumination or other edition‑sensitive telemetry, edition pins must be tracked (otherwise comparisons become irreproducible after a map/distance/policy update).
Row‑level summaries (for matrix rows / comparable construct groups) tend to be averaged or “smoothed”, which is incompatible with bottleneck semantics and loss honesty.
Enable comparisons across Traditions ↔ avoid overriding Context‑local meaning.
Auditability vs authoring throughput
Require explicit artefacts, losses, and pins ↔ keep the calibration procedure light enough to be used.
Targeted refresh vs safety
Emit path‑local RSCR triggers ↔ ensure triggers are typed and carry enough payload pins for audit and rerun planning.
Plane awareness vs “one story”
Explicitly surface ReferencePlane and plane penalties ↔ avoid turning plane discussion into a second semantics of “sameness”.
QD comparability vs metric drift
Enable cross‑context reporting of archive/illumination telemetry ↔ enforce edition‑aware pins for descriptor/distance/policies only when those modes are actually in use.
Expansion rule. Effective CoreConformanceIds, RSCRTriggerKindIds, and CorePinsRequired are obtained by expanding the cited profile/set ids and unioning with the explicit ids above (see G.Core nil‑elision + expansion rule).
Conditional pins.
BridgeCardRef.edition is required iff BridgeCards are published as editioned artefacts.
Sentinel scopes MAY be recorded as PatternScopeId[] when path surfaces are not available (and SHALL then be present in sentinel records and emitted trigger payload pins).
CN/CG note.CC‑GCORE‑CN‑CG‑1 is included via GCoreConformanceProfileId.PartG.AuthoringBase and is exercised only when the governance card and legality gate (e.g., CNSpecRef.edition / CGSpecRef.edition) are explicitly pinned; penalty/guard policy ids (Φ(CL), Ψ(CL^k), Φ_plane) are policy pins, not governance cards or legality gates.
(payload pins, minimum: affected members of the effective CorePinsRequired (after expansion) plus any pins introduced by active extensions (e.g., QD parity pins), scoped to the watched PathSliceId[]/PathId[]/PatternScopeId[].)
This pattern defines the bridge calibration kit as a set of minimal, checkable surfaces. Semantics of BridgeCard and CL typing are governed by F.9; G.7 adds calibration records and publication/wiring surfaces.
(A) BridgeCalibrationTable (BCT) — object.
A BridgeCalibrationTable is a per‑Tradition‑pair registry of calibrated bridge entries.
Source provenance (when sourced from G.2). If the BCT is derived from a G.2 BridgeMatrix, publish BridgeMatrixId (+ BridgeMatrixRef.edition when editioned) and row‑level linkage via G.7:Ext.MatrixIntake (wiring‑only), rather than duplicating G.2 semantics in core.
(B) CalibrationLedger — object.
A CalibrationLedger is the auditable “row narrative” that remains pin‑first: it records what was calibrated, what was lost, and which artefacts/policies witness that.
Minimal fields:
CalibrationLedger := ⟨ LedgerId, TradPairId, Entries[] // each entry cites RowEntryId, BridgeCardId(s), CL‑minima, waivers (if any), loss notes, counterexamples, UTS rows, and (when run) regression-run/delta refs ⟩
(C) RegressionSet — object.
A RegressionSet is a small set of regression probes/checks that are runnable against the BCT row entries. It exists to detect drift (bridge edits, policy edits, plane edits, edition pin changes) and to provide the evidential payload for RSCR triggers.
#CL / CL^k admissibility regime and plane guard (kit‑local; normative)
This subsection is kit-governed (G.7) and complements (but does not duplicate) G.Core penalty routing and tri‑state guard semantics.
Admissibility regimes (row‑level, minimal).
RowCL_min MUST take a value in {3,2,1,0} (value set and CL meaning are governed by F.9; G.7 governs the admissibility regime).
Default admissibility for cross‑Tradition reuse:
RowCL_min ≥ 2 ⇒ admissible for reuse (subject to downstream guards/policies).
RowCL_min = 1 ⇒ NOT admissible unless an explicit WaiverRef[] is cited; any reuse under waiver is guarded-only (no substitution semantics).
RowCL_min = 0 ⇒ forbidden for reuse; it MAY remain in BCT as a documented non‑bridge with loss notes/counterexamples.
Honesty rule (row‑level):
if RowCL_min ≤ 2, at least one CounterExampleRef[] MUST be cited;
if RowCL_min = 3 and CounterExampleRef[] is empty, a citable CounterExampleAbsenceRef MUST be provided (explicit “searched‑none found / no known counterexample” disclosure);
if any LossNoteRef[] is present, the row MUST NOT be presented as “free substitution” in any consumer surface.
Kind channel (CL^k) (conditional).
If a row relies on bridges in the Kind channel, then RowCL_k_min and Ψ(CL^k) pin MUST be present, and the same admissibility regimes apply to RowCL_k_min.
Plane guard (CL^plane) (conditional).
If ReferencePlane(src) and ReferencePlane(tgt) differ (or plane routing is explicitly invoked), then:
RowCL_plane_min and Φ_plane pin MUST be present;
if either plane pin is absent, the row is non‑conformant (no implicit plane defaulting);
any “blocking” outcome must be representable downstream via G.Core tri‑state guard (abstain or a policy‑bound degrade(mode=…)), without introducing additional statuses in G.7;
plane effects MUST NOT rewrite CL/CL^k; their impact is routed via the pinned policy ids and G.Core penalty semantics.
(D) SentinelSet & BridgeSentinel — object.
A SentinelSet is a watch‑list that connects bridge calibration changes to RSCR‑ready triggers scoped to downstream consumption.
For each Tradition‑pair and each comparable construct row from G.2:
Materialise bridge artefacts. Produce (or reuse) F.9BridgeCards for the concrete SenseCell‑level alignments required by the row scope.
Note. “SenseCell anchoring” is a kit requirement: if a row is authored at a coarser token level, the SenseCell anchors must be explicitly cited (F.3 discipline).
Record row scope and losses. Author a RowScopeId and record loss notes as first‑class citations (e.g., LossNoteRef[]), not as informal footnotes.
Also record RowCL_min (and RowCL_k_min?, RowCL_plane_min? when applicable) and cite WaiverRef[] if any row is intentionally kept at =1 for guarded-only reuse.
Plane pins (no hidden plane mixing). Record source ReferencePlane pins and target ReferencePlane pins and the relevant policy id pins for plane routing (ids only; do not duplicate policy tables).
Policy pins for penalty routing. Record the policy id pins needed to audit penalty routing (ids only). Penalty semantics cite CC‑GCORE‑PEN‑1 through G.Core; G.7’s responsibility is to make the pins explicit and published.
Row bottleneck discipline. When a row aggregates multiple bridge cells, row summarisation uses bottleneck semantics (F.7) and carries a counterexample citation whenever any cell is loss‑noted.
Regression and sentinel wiring. Create/update the RegressionSet and SentinelSet. Any calibration change that can affect downstream audit (CL/CL^k/plane pins, relevant policy ids, edition pins for involved telemetry surfaces, freshness window) emits typed RSCR triggers (canonical ids; scope + payload pins).
If the regression harness is run, record a citable RegressionRunRef (or equivalent run/delta reference) and attach it to the relevant ledger entries (pin‑first; no narrative-only deltas).
publishes UTS‑citable identifiers for BridgeCards and any GateCrossing/crossing rows that rely on them,
ensures crossing bundles are checkable via E.18/A.21 harnesses (lexical SD, lane purity, required pin presence),
emits RSCR triggers using canonical RSCRTriggerKindId and attaches the minimum payload pins listed in §4.1.
ensures evidence-facing citations are pin-complete: whenever bridge calibration is cited in SCR/Evidence surfaces, the citation MUST include {BCT.id, RegressionSetId} and the active policy id pins {Φ(CL), Ψ(CL^k)?, Φ_plane?} (ids only; representation is governed by G.6/SCR).
#Worked mini‑examples (informative; post‑2015; row scopes + loss notes)
These are working models, not equivalence claims. They illustrate how row scope + loss notes constrain safe reuse.
Preference‑learning objective (Method; RowScope = “training‑objective‑intent”).Cells:RLHF@Context‑A ↔ DPO@Context‑B ↔ IPO@Context‑CRowCL_min: 2 (guarded)
Loss notes: different inductive biases (reward model vs direct preference likelihood; sensitivity to preference noise model; implicit regularisation forms).
Use: cross‑Tradition didactic alignment and eligibility hints; thresholds/acceptance remain governed by CAL.
Robustness evaluation (Measurement; RowScope = “metric‑family‑intent”).Cells:Accuracy@IID ↔ Robustness@ShiftBench (e.g., distribution‑shift benchmarks common in post‑2019 practice)
RowCL_min: 2
Loss notes: shift taxonomy differs; comparability depends on pinned protocol editions and window selection; “robustness” is not a scalar substitute for accuracy.
Quality‑Diversity archive comparability (Measurement; RowScope = “DescriptorMap‑only”).Cells:MAP‑Elites grid indices ↔ CVT‑MAP‑Elites centroids ↔ CMA‑ME archiveRowCL_min: 2
Loss notes: discretisation vs centroidal tessellation; archive pressure differs; drift occurs if DistanceDef or insertion policy changes.
Use: admissible cross-reporting of QD telemetry when edition pins are explicit.
Open‑ended transfer semantics (Method; RowScope = “transfer‑rule intent”).Cells:POET‑class transfer rule ↔ Enhanced‑POET‑class transfer rule ↔ “modern open‑ended transfer variants”
RowCL_min: 2
Loss notes: environment validity region differs; transfer timing and selection pressures differ; pinning transfer rule editions is mandatory for audit.
Extensions carry wiring only (pins/editions/policy‑ids + which governing patterns are applied). They MUST NOT redefine core invariants or defaults.
GPatternExtension: MatrixIntake
PatternScopeId:G.7:Ext.MatrixIntake
GPatternExtensionId:MatrixIntake
GPatternExtensionKind:InteropSpecific
GoverningPatternId:G.2(BridgeMatrix semantics and comparable-construct inventory)
Uses:{G.2, F.9}
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum):
BridgeMatrixId (and, if editioned: BridgeMatrixRef.edition)
BridgeMatrixRowRef[](row‑level anchors for intake; defined by the governing pattern; e.g., PatternScopeId / UTSRowId / row ids)
ComparableConstructId[](row keys; if the source does not supply a stable id, G.7 mints one while preserving BridgeMatrixRowRef as the provenance anchor)
LossNoteRef[]?(if exported by G.2; otherwise authored in G.7 and cited from the CalibrationLedger)
G.7 stores the counts and declared units as a surface; C.21 governs the meaning and legality constraints.
When reporting AlignmentDensity, the counted bridge set is typically restricted to CL ≥ 2 (treat CL=3 as “free substitution”, CL=2 as “guarded” for reporting); conformance is enforced by CC‑G7‑DHC‑Units‑1 while semantics remain governed by C.21.
GPatternExtension: QDParityPins
PatternScopeId:G.7:Ext.QDParityPins
GPatternExtensionId:QDParityPins
GPatternExtensionKind:InteropSpecific
GoverningPatternId:C.18(QD artefact semantics; uses C.19 for exploration/logging pins as needed)
Uses:{C.18, C.19}
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum; conditional on use):
DescriptorMapRef.edition
DistanceDefRef.edition
InsertionPolicyRef(policy id or pinned policy ref, per governing definition semantics)
Notes (wiring‑only): Enforces reproducibility of cross‑Context archive/illumination comparisons without pulling QD semantics into the core bridge kit.
The pins from this module should be attached via RowEntry.ExtensionPins[QDParityPins] (or an equivalent extension‑pin map) and included in BridgeSentinel.payloadPins whenever the watched scope consumes QD telemetry.
GPatternExtension: SoSLogClauses
PatternScopeId:G.7:Ext.SoSLogClauses
GPatternExtensionId:SoSLogClauses
GPatternExtensionKind:InteropSpecific
GoverningPatternId:C.23(SoS‑LOG rule and branch semantics; G.7 does not redefine meaning)
Uses:{C.23, G.6}
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum; conditional on use):
Notes (wiring‑only): Ensures cross‑Tradition bridge reuse decisions can be justified by citing SoS‑LOG clauses and evidence paths, without embedding SoS‑LOG semantics into G.7.
GPatternExtension: AcceptanceHooks
PatternScopeId:G.7:Ext.AcceptanceHooks
GPatternExtensionId:AcceptanceHooks
GPatternExtensionKind:MethodSpecific
GoverningPatternId:G.4(Acceptance/threshold/unknown handling; G.7 does not define thresholds)
Uses:{G.4}
⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum; conditional on use):
Notes (wiring‑only): When bridges are used as selector gates, thresholds and unknown-handling remain governed by Acceptance; this module only pins the linkage and refresh relevance.
System (Γ_sys):Cross‑standard safety assurance comparison (bridge‑first).
A team must compare a safety assurance claim across two regulatory Traditions (e.g., a “functional safety case” tradition and a “ML system testing” tradition) for the same physical system scope. G.7 forces explicit SenseCell‑level bridges (what exactly is the “hazard”, what is the “evidence carrier”, what is the “pass criterion”), records losses, pins planes, and provides sentinels so that changes in the safety evidence protocol editions trigger path‑local RSCR rather than re‑authoring the entire safety case.
Episteme (Γ_epist):Benchmark protocol pluralism (post‑2015 evaluation practice).
A research group wants to compare “state‑of‑the‑art” across multiple evaluation Traditions (IID performance, shift robustness, preference‑based evaluation). G.7 turns “these are comparable” into explicit BridgeCards with declared row scope, pins the evaluation protocol editions, and emits sentinels so that when a benchmark protocol or policy pin changes, downstream selector decisions can be re‑audited by re‑citing the same PathSlice‑scoped evidence.
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did.
Scope: Universal for the bridge calibration kit; any method‑family or discipline‑specific calibration technique is modularized as GPatternExtension and cited to its governing patterns.
G.7 is conformant only if it satisfies the effective G.Core obligations declared by the GCoreLinkageManifest in §4.1 (after nil‑elision and expansion of profile/set/pinset ids), including any explicit deltas listed there.
Make universal invariants one governing definition and enforce citation‑based reuse.
CC‑G7‑BCT‑1
For any active TradPairId with cross‑Tradition reuse, a BridgeCalibrationTable (BCT)MUST exist, declare a FreshnessWindowRef, and provide RowEntry records that cite, at minimum: RowEntryId, ComparableConstructId, RowScopeId, BridgeCardId[], RowCL_min, PlanePins {ReferencePlane(src), ReferencePlane(tgt)}, PolicyPins {Φ(CL)} (and Ψ(CL^k)?, Φ_plane? when applicable), plus {RegressionSetId, SentinelSetId}.
Ensure the kit exists as an auditable object rather than a prose matrix.
CC‑G7‑BridgeCard‑1
Any bridge published by G.7MUST be consumable as an F.9BridgeCard and MUST be SenseCell‑anchored (directly or via explicit SenseCell anchor refs).
Prevent “Context‑only” or ambiguous bridges.
CC‑G7‑UTS‑1
G.7 outputs MUST mint/publish UTS‑citable ids (NameCards/twin labels as applicable) for (a) each BridgeCard (or its NameCard) and (b) each GateCrossing/crossing row that makes bridge use checkable; and MUST expose the resulting UTSRowId[] in the BCT/Ledger/crossing bundles. (UTS discipline is delegated to CC‑GCORE‑UTS‑1.)
Make bridge calibration externally citable and checkable.
CC‑G7‑RowScope‑1
Every BCT row MUST declare its RowScopeId (what notion of “sameness” is claimed), and any loss notes MUST be recorded as citable artefacts (refs/ids), not only narrative text.
Keep reuse honest and locally bounded.
CC‑G7‑CLRegime‑1
Every BCT row MUST record RowCL_min (and RowCL_k_min?, RowCL_plane_min? where applicable) and apply the admissibility regime from §4.2.1: ≥2 admissible; =1 only with cited WaiverRef[]; =0 forbidden for reuse. The honesty rule must be satisfied: ≥1 counterexample for ≤2, and an explicit stated‑absence disclosure for =3 when no counterexample is cited.
Make CL/waiver/plane regimes explicit and auditable at kit level.
CC‑G7‑SCRLinkage‑1
Whenever bridge calibration is cited in SCR/Evidence surfaces, the citation MUST include {BridgeCardId[]} (or UTSRowId[] for the bridge artefacts), an explicit row locator (RowEntryId or equivalent), {BCT.id, RegressionSetId}, and the active policy id pins {Φ(CL), Ψ(CL^k)?, Φ_plane?} (ids only; representation governed elsewhere).
Prevent “pins exist but are not visible/auditable” failure mode.
CC‑G7‑SoSLOG‑Pins‑1
When G.7:Ext.SoSLogClauses is in use, G.7 outputs MUST expose the cited SoS‑LOG rule ids and the relevant PathId/PathSliceId evidence citations; any change in those pins MUST be RSCR‑relevant per CC‑GCORE‑TRIG‑1…TRIG‑4.
Keep cross‑Tradition reuse explainable without embedding C.23 semantics.
CC‑G7‑Acceptance‑1
When G.7:Ext.AcceptanceHooks is in use, G.7 outputs MUST expose the Acceptance clause ids/policy ids used as gates; thresholds/unknown handling remain governed by Acceptance; any change MUST be RSCR‑relevant per CC‑GCORE‑TRIG‑1…TRIG‑4.
Keep thresholds and unknowns out of bridges while preserving auditability.
CC‑G7‑RowBottleneck‑1
If a comparable construct row aggregates multiple bridge cells, row summaries (e.g., RowCL_min) MUST follow bottleneck discipline (F.7) and cite a counterexample whenever a cell carries a loss note.
Forbid “CL averaging” and enforce loss‑aware summaries.
CC‑G7‑PolicyPins‑1
G.7 outputs MUST publish the policy id pins required to audit penalty routing and plane effects (ids only), as required by CC‑GCORE‑LINK‑1/2 and CC‑GCORE‑PEN‑1. G.7 MUST NOT duplicate policy tables or redefine penalty semantics.
Keep penalty routing auditable while preserving single‑governing-pattern policy semantics.
CC‑G7‑GateCrossing‑1
Any published crossing rows that rely on bridges MUST be checkable via GateCrossing/CrossingBundle harnesses (E.18/A.21): required pins are present; lexical constraints and lane purity checks are runnable.
Make crossings checkable, not narrative.
CC‑G7‑Sentinels‑1
G.7MUST register BridgeSentinel entries for bridges used by live scopes and MUST emit typed RSCR triggers (canonical RSCRTriggerKindId; see CC‑GCORE‑TRIG‑1…TRIG‑4) on calibration‑relevant edits, scoped to the watched PathSliceId[] or PatternScopeId[], with the minimum payload pins from §4.1.
Enable targeted refresh rather than pack‑wide reruns.
CC‑G7‑QD‑Pins‑1
When G.7:Ext.QDParityPins is in use, G.7 outputs MUST include {DescriptorMapRef.edition, DistanceDefRef.edition, InsertionPolicyRef} and treat any change to those pins as RSCR‑relevant per CC‑GCORE‑TRIG‑1…TRIG‑4.
Prevent silent QD telemetry drift.
CC‑G7‑DHC‑Units‑1
When AlignmentDensity (or related DHC accounts) are reported, G.7 outputs MUST (a) restrict the counted bridge set to rows with RowCL_min ≥ 2 (treat CL=3 as “free substitution”, CL=2 as “guarded” for reporting), (b) include declared units, and (c) cite the relevant DHC method semantics (C.21). G.7 MUST NOT invent arithmetic over ordinal/illegal surfaces.
Keep dashboards and discipline‑health metrics lawful and interpretable.
Bridge‑by‑prose (“they have the same sense”).Avoid: publish BCT rows + BridgeCards + UTS rows; require SenseCell anchoring and row scopes.
SenseFamily jump (scope‑bridge used as kind‑bridge).Avoid: keep channel/sense‑family constraints governed by F.9 visible; use RowScopeId to state which channel is claimed, and require CL^k + Ψ(CL^k) pins when a kind‑channel bridge is invoked (do not “upgrade” a scope‑channel bridge into kind substitution).
Plane blindness (“concept = world”).Avoid: record plane pins and policy id pins; keep plane effects auditable and separable from CL/CL^k semantics.
CL smoothing / averaging.Avoid: enforce row bottleneck summaries and counterexample citations for loss‑noted cells.
Pack‑wide refresh on a local bridge edit.Avoid: register sentinels scoped to PathSliceId and emit typed RSCR triggers with minimal payload pins.
QD metric drift by unpinned artefacts.Avoid: enable G.7:Ext.QDParityPins only when needed and require edition/policy pins when enabled.
Why a kit (not a new governance card or legality gate)? Bridge calibration must support many downstream consumers without becoming a competing legality gate; governing-spec semantics remain governed by CG‑Spec/CN‑Spec.
Why BCT + RegressionSet + SentinelSet? Because calibration without regression tests drifts silently, and regression without sentinels is operationally unusable (refresh becomes global).
Why row scopes? Because “comparable” is not one thing; scope must be explicit to avoid accidental substitution.
#SoTA‑Echoing (post‑2015, for orientation; non‑normative)
Edition‑aware evaluation and dataset shift practice. Post‑2018 evaluation culture (robustness and shift benchmarks, protocol pinning, reproducibility checklists) motivates treating protocol versions and “what changed” as first‑class pins rather than prose.
Preference‑based optimisation families. Modern preference‑learning lines (late‑2010s → 2020s) show how neighbouring objectives can share intent but diverge in assumptions—an archetypal case for row scope + loss notes.
Quality‑Diversity and differentiable QD. MAP‑Elites successors (CVT variants, CMA‑ME line, differentiable QD ecosystems) emphasise archive/descriptor/distance artefacts whose editions must be pinned for comparability.
Open‑ended evolution and transfer‑rule portfolios. POET‑class work motivates explicit transfer rule editions and environment validity regions as pins when bridges are used for cross‑tradition reporting.
Builds on:G.Core, G.2, F.3, F.7, F.9, B.3, E.10, E.18, A.21, G.6, C.21.
Optionally uses via Extensions:G.4 (Acceptance hooks), C.23 (SoS‑LOG clauses), C.18 and C.19 (QD/OEE pins).
Used by / prerequisite for:G.5 (cross‑Tradition eligibility/selection), G.11 (refresh orchestration), G.9 (parity across Traditions where bridges are required), G.10 (shipping surfaces that must cite bridge calibration ids), G.12 (DHC dashboards when bridge counts/units are surfaced).
Publishes to:UTS (bridge and crossing rows; twin labels as applicable) and emits RSCR‑ready telemetry/trigger payloads for G.11.
Constrains: Any downstream consumer that claims cross‑Context/Tradition reuse must use the calibrated bridge artefacts/pins surfaced by this kit (governed by G.Core crossing invariants apply).
Non‑duplication note (Phase‑2 universalization). This pattern introduces kit-governed packaging surfaces for SoS‑LOG bundles and maturity ladders. All Part‑G‑wide invariants (no shadow specs, Bridge‑only crossings + visibility, tri‑state guard domain, penalties→R_eff‑only, set‑return semantics, P2W split, typed RSCR triggers + alias docking, defaults with one governing definition, shipping boundary) are pinned through G.Core and are not restated here.
Modularity note (policy‑id pins are reference‑only). This kit may pin/cite policy ids (e.g., Φ/Ψ/Φ_plane policies, FailureBehaviorPolicyId, illumination‑promotion policy ids, and E/E‑LOG policy ids) as references only. Conformance relies on the policy‑pin resolvability discipline of F.8:8.1 (i.e., policy ids are not “inlined”; and when newly minted, they are backed by resolvable PolicySpecRef + MintDecisionRef). G.8 does not define policy semantics and MUST NOT silently mint policy ids.
Method families compete within a CG‑Frame, but dispatch is only lawful if (i) admissibility decisions remain tri‑state and auditable, (ii) evidence and crossings are explicitly citable (by ids, not prose), and (iii) selection preserves set-return semantics under partial orders. In practice, SoS‑LOG rules (C.23) and “maturity stories” are often distributed across prose, dashboards, and ad‑hoc checklists, with thresholds embedded where they do not belong and with missing pins for evidence paths, crossings, and editions.
This pattern provides the missing packaging kit: a selector‑facing, UTS‑citable bundle that binds (a) rule ids (semantics governed by C.23), (b) an ordinal/poset maturity ladder (published as a citable card), and (c) explicit wiring to Acceptance (G.4), EvidenceGraph (G.6), selection/registry (G.5), and refresh (G.11)—without creating any shadow governing spec refs.
Selector needs a stable input artefact.G.5 cannot consume “maturity narratives” and scattered SoS‑LOG snippets without re‑authoring semantics or inventing implicit defaults.
Thresholds leak into LOG. Numeric gates are often embedded directly into rule text or ladder rungs, blurring the boundary between LOG decisions (C.23) and Acceptance thresholds (G.4).
Auditability is brittle. Decisions (pass/degrade/abstain) lack stable, citable links to evidence paths (G.6) and crossing pins (Bridge/CL/Φ policy ids), so later re‑checks and RSCR become ad‑hoc.
Telemetry contaminates decision semantics. QD/OEE/illumination signals are frequently treated as dominance inputs without explicit policy pins; edition drift then silently changes outcomes.
Refresh is under‑specified. Bundle evolution (rules, ladders, pins, policies, editions) must be RSCR‑addressable via typed trigger kinds, not by free‑text “reasons”.
GCoreLinkageManifest (normative; size‑controlled).(Canonical shape, Nil‑elision, and Expansion rule are per G.Core:4.2.)
Separation rule (Phase‑2). Method‑/generator‑specific pins are normatively specified only inside Extensions as GPatternExtension modules (see G.8:5.*). The bundle/ledger schema may mention such fields only as extension‑gated optionals, with the authoritative pin/edition/policy requirements stated in the corresponding extension block. The core linkage manifest lists only base‑kit pins and Part‑G‑wide linkage.
CorePinsRequired := {
// Public ids governed by this pattern (strengthen conditional pins where G.8 publishes UTS publication units)
UTSRowId[], // bundle/ledger/card rows + any referenced UTS rows
SoS‑LOGBundleRef,
SoSLogRuleId[],
MethodFamilyId,
RegistrationContext,
// Closed value sets (ids only; UTS-registered)
DegradeModeEnum,
MaturityRungs,
// Maturity ladder pins
MaturityCardRef, // required; recommended: published as separate UTS artefact
MaturityRungId?, // iff a specific rung is asserted at packaging/run-time
// Evidence / provenance pins
A10EvidenceGraphRef?[], // packaging-time A.10 carriers (when PathId/PathSliceId not yet available)
EvidenceGraphId?, // iff resolvable to G.6 EvidenceGraph
PathId[]/PathSliceId[]?, // run-time ledgers typically have them
(RSCR payload pins typically include: SoS‑LOGBundleRef, SoSLogRuleId[], MaturityRungId?, and EvidenceGraphId/PathId/PathSliceId?.
Crossing payload pins (Bridge/CL/Φ/Ψ/Φ_plane) are introduced only when reuse is asserted, via G.8:Ext.BridgeReuseWiring.
Method-/generator‑specific payload pins are listed only inside the relevant GPatternExtension blocks in G.8:5.)
(Conditionality note for defaults.) Include DefaultId.GammaFoldForR_eff in DefaultsConsumedonly if the bundle/ledger exports aggregated R_eff summaries (otherwise Nil‑elide it).
#Kit: objects and naming discipline (LEX heads; twin‑register safe)
Objects / surfaces (pattern-governed).
SoS‑LOG.Rule
A rule id that denotes an executable tri‑state decision schema {pass | degrade(mode) | abstain} for (TaskSignature, MethodFamily). (“pass” may be described as “admit” in prose, but the normative tri‑state vocabulary is G.Core’s {pass|degrade|abstain}.)Semantics are governed by C.23.G.8 only packages rule ids and binding pins.
SoS‑LOGBundle@Context
A selector‑facing, notation‑independent packaging object published to UTS.
AdmissibilityLedger@Context
A run‑time ledger view that records admissibility outcomes, cited evidence paths, branch tokens, and the pins required for audit/refresh.
MethodFamily.MaturityCardDescription@Context
A maturity ladder description published as a citable artefact: ordinal/poset, closed rungs, ReferencePlane declared; no thresholds inside.
SoS‑LOGBundle@Contextdoes not introduce new legality or normalization rules; it cites the pinned references above.
Thresholds and numeric gates are cited by id from [G.4](/generated/patterns/G.4) Acceptance (no embedding inside the bundle).
If cross-context or cross-plane reuse is asserted, crossing pins are made explicit (Bridge/CL/Φ policy ids), and evidence paths are citable when available.
B1 — Evidence wiring. At packaging time the bundle SHOULD provide resolvable evidence refs (typically A10EvidenceGraphRef?[] and/or EvidenceGraphId?). At run time, admissibility outcomes SHOULD cite PathId/PathSliceId when available ([G.6](/generated/patterns/G.6)), so rung transitions and degrade/abstain traces are audit‑stable.
B2 — CL/plane routing pins. When reuse across Context or plane is asserted, the bundle/ledger MUST pin the relevant Bridge/CL/Φ/Ψ/Φ_plane policy ids (reference‑only; resolvable per [F.8:8.1](/generated/patterns/F.8#mintreuse-discipline-for-policy-ids-normative-addendum)) and MUST respect the core penalty routing (penalties affect R_eff only; F/G invariance via G.Core).
B3 — PortfolioMode/QD fields. If the bundle/ledger exposes PortfolioMode/QD fields (e.g., PortfolioMode=Archive), it MUST pin the descriptor/distance/insertion/emitter artefacts (editions/policies as applicable). Illumination remains report‑only unless explicitly promoted by a [G.4](/generated/patterns/G.4) governing-pattern policy id that is pinned and recorded in the run‑time trace.
B4 — Open‑ended fields. If the bundle binds an open‑ended generator family, it MUST pin GeneratorFamilyId and TransferRulesRef.edition (and any validity region/coupler policy ids when used). Unknown transfer validity MUST be recorded as degrade/branching, not as an ad‑hoc fourth status.
B5 — Telemetry hooks. On any material telemetry event (illumination increase, archive insertion, probe accounting update, open‑ended coverage/regret proxy update), the emitted telemetry pins SHOULD include the controlling policy ids plus the relevant edition pins (e.g., DescriptorMapRef.edition, DistanceDefRef.edition, TransferRulesRef.edition) and, when available, PathSliceId to keep RSCR planning auditable.
Where EvidencePathRefs are typically PathId[]/PathSliceId[] when G.6 is in use (or resolvable), and “CrossingPins” are the explicit Bridge/CL/Φ policy pins when reuse is asserted.
#Maturity ladder as a citable poset (published card)
MethodFamily.MaturityCardDescription@Context is published with:
closed rungs (UTS‑registered identifiers),
Scale kind = ordinal and a declared ReferencePlane,
EvidenceProfileId[]?(if the ledger/bundle cites evidence profile ids rather than only paths)
PromotionPolicyId?(only if telemetry may be promoted into dominance by explicit CAL policy)
RSCRTriggerKindIds (optional delta):{RSCRTriggerKindId.PolicyPinChange}(only if acceptance policies are pinned as ids in the bundle/ledger)Notes (wiring‑only):
Thresholds remain governed by G.4 Acceptance; this module carries only clause ids and policy pins.
Show‑A — Tri‑state admissibility with set‑valued selection (multi‑criteria).
A CG‑Frame carries multiple offline/robust decision families (e.g., conservative offline RL and transformer‑based policy models post‑2020). The bundle publishes RuleId[] (SoS‑LOG semantics in C.23), cites AcceptanceClauseId[] for any floors (governed by G.4), and emits an AdmissibilityLedger whose rows cite PathSliceId (when available) for each pass/degrade/abstain. G.5 consumes the ledger and returns a selected set under the declared partial order—no scalar “winner”.
Show‑A — Tri‑state admissibility with set‑valued selection (multi‑criteria).
A CG‑Frame carries multiple offline/robust decision families (e.g., conservative offline RL and transformer‑based policy models post‑2020). The bundle publishes SoSLogRuleId[] (SoS‑LOG semantics in C.23), cites AcceptanceClauseId[] for any floors (governed by G.4), and emits an AdmissibilityLedger whose rows cite PathSliceId (when available) for each pass/degrade/abstain. G.5 consumes the ledger and returns a selected set under the declared partial order—no scalar “winner”.
Show‑B — QD archive dispatch with edition‑pinned descriptors (post‑2015 QD families).
A method family uses a modern QD line (e.g., CMA‑ES‑driven archives, differentiable QD variants, and large‑scale JAX‑style QD toolchains). The bundle pins DescriptorMapRef.edition and DistanceDefRef.edition, plus insertion/emitter policies. Illumination metrics are logged as telemetry; any promotion into dominance is only via explicit CAL policy pins (recorded in the admissibility trace).
Show‑C — Open‑ended environment–method co‑evolution (post‑2018 open‑ended families).
A generator family operates in an open‑ended setting (e.g., POET‑style and PAIRED‑style regimes). The bundle carries TransferRulesRef.edition and validity region pins; unknown transfer validity triggers a degrade branch rather than an ad‑hoc fourth status. Telemetry (coverage/regret proxies) is emitted for refresh planning, not silently turned into dominance.
CC‑G8‑CoreRef (G.Core conformance bridge).
A conforming G.8 SHALL satisfy the effective set of CC‑GCORE‑* obligations implied by G.8:4.1 (expanded per G.Core:4.2), including required pins, trigger sets, and Default Governing Definition Index citation.
CC‑G8‑1 (No thresholds in LOG).
Any numeric gate, maturity floor, or threshold SHALL be authored as a G.4 Acceptance artefact and cited by id; the LOG bundle/ladder SHALL NOT embed thresholds.
CC‑G8‑2 (Tri‑state discipline; delegated).
Guard outcomes SHALL obey the tri‑state domain and unknown handling defined in G.Core (delegation to CC‑GCORE‑GUARD‑1).
Any sandbox/probe‑only behaviour SHALL be represented as an explicit C.23 branch and MUST pin (and record) the controlling policy id (typically an E/E‑LOG policy id via C.19), rather than inventing a fourth status or silently coercing unknowns.
CC‑G8‑3 (Path citation when evidence is path‑addressable).
When G.6 is in use (or resolvable), every recorded pass/degrade/abstain outcome in the AdmissibilityLedger MUST cite PathId/PathSliceId (run‑time). At packaging time, the bundle/ledger SHALL at minimum provide resolvable evidence refs (e.g., EvidenceGraphId? + anchor refs).
CC‑G8‑4 (Crossing visibility and penalty routing; delegated).
Any cross-Context or cross-plane reuse asserted by the bundle/ledger SHALL satisfy the core crossing visibility and penalty routing invariants (delegation to CC‑GCORE‑CROSS‑1 and CC‑GCORE‑PEN‑1).
CC‑G8‑5 (PortfolioMode/dominance hygiene; delegated).
The bundle/ledger SHALL treat PortfolioMode and dominance fields as pinned inputs and SHALL cite the governing definition for each omitted default through G.Core.DefaultGoverningDefinitionIndex (delegation to CC‑GCORE‑DEF‑1 and CC‑GCORE‑SET‑1; governing definitions include CC‑G5.23 for DefaultId.PortfolioMode and CC‑G5.28 for DefaultId.DominanceRegime). It MUST NOT restate default values locally.
If the bundle/ledger records telemetry that could influence dispatch (e.g., illumination/QD/OEE/open‑ended proxies), such telemetry SHALL remain report‑only unless explicitly promoted by a G.4 governing-pattern policy id that is pinned and recorded in the run‑time trace.
CC‑G8‑6 (QD/OEE edition discipline).
When QD/OEE surfaces are declared, the bundle/ledger MUST pin the relevant editions and policies (DescriptorMapRef.edition, DistanceDefRef.edition, insertion/emitter policies, and TransferRulesRef.edition when applicable).
CharacteristicSpaceRef.edition is required iff cell boundaries / de‑dup rules / parity depend on the space definition, and MUST NOT be used as a substitute for DescriptorMapRef.edition.
CC‑G8‑7 (Maturity is ordinal/poset).
Maturity ladders SHALL be authored as ordinal/poset descriptions with closed rung ids (MaturityRungs, UTS‑registered) and a declared ReferencePlane, and SHALL be published as a citable UTS artefact (editioned; twin‑register safe).
Rung transitions, when asserted, MUST be justifiable by citable evidence paths (when available).
CC‑G8‑8 (Spaces ≠ Maps).CharacteristicSpace and DescriptorMap SHALL remain strictly distinct kinds; naming and twin‑register discipline must be respected.
CC‑G8‑9 (Notational independence).
The bundle, ledger, and maturity card SHALL remain notation‑independent (per E.5.2); any serialization choice is non‑normative and belongs outside Part‑G core.
CC‑G8‑10 (MOO cross‑reference).
When a LOG bundle is used to drive or justify a produced selected-set outcome, the producing Work/Audit artefact SHOULD cite the controlling mechanism ids (e.g., parity/shipping/refresh artefact ids) and relevant policy pins; no “black box” provenance.
CC‑G8‑11 (SoTA‑of‑description trace).
If authoring methods (e.g., discovery, clustering, summarisation) materially shaped rule text or rung definitions, the bundle/card SHOULD cite their method description refs (edition‑pinned) to support cross‑stance traceability.
Anti‑pattern: Embedding thresholds inside SoS‑LOG rules or ladder rungs.
Avoid: thresholds live in G.4 Acceptance; bundle only cites clause ids.
Anti‑pattern: Treating illumination/QD telemetry as a hidden scalar score that changes dominance.
Avoid: keep telemetry report‑only unless explicitly promoted by a governing-pattern policy pin.
Anti‑pattern: Publishing a bundle that “implies” cross‑context reuse without Bridge/CL/Φ pins.
Avoid: if reuse is asserted, publish the crossing pins; otherwise downstream must abstain from reuse.
Anti‑pattern: Re‑defining PortfolioMode/DominanceRegime defaults in the bundle text.
Avoid: cite each default's governing definition through G.Core.DefaultGoverningDefinitionIndex.
Anti‑pattern: Recording RSCR “reasons” as prose labels only.
Avoid: emit canonical RSCRTriggerKindId values per G.Core.
Negative: If evidence paths are not maintained (G.6 absent), auditability degrades and downstream must rely on references with lower evidence-support class, or abstain.
C.23 governs rule semantics, G.4 governs thresholding/acceptance, G.6 governs path‑addressable provenance, and G.5 governs selection/registry semantics. Without a dedicated packaging kit, projects either (i) duplicate semantics inside ad‑hoc “decision bundles” (creating shadow specs), or (ii) leave dispatch un‑auditable. G.8 keeps these boundaries strict while providing a single, consumable surface.
#SoTA‑Echoing (informative; post‑2015 practice alignment)
This pattern’s separation of decision rules, acceptance thresholds, provenance paths, and set‑valued outputs echoes post‑2015 practice in:
Quality‑Diversity and archive‑based evaluation (post‑2015 QD variants emphasize edition‑pinned descriptors/distances and telemetry‑driven refresh).
Open‑endedness / curriculum generation (post‑2018 lines emphasize explicit transfer rules, safe degrade branches, and telemetry‑driven orchestration rather than hidden gates).
Reproducibility‑aware publishing (explicit identifiers, pinned editions/policies, citable traces rather than prose‑only decision rationales).
(Examples are illustrative; they do not introduce new Part‑G‑wide norms.)
RuleId[] are ids only; rule semantics are governed by C.23 (no re-definition in this bundle).
SoSLogRuleId[] are ids only; rule semantics are governed by C.23 (no re-definition in this bundle).
Any numeric gates/thresholds are G.4 Acceptance artefacts cited by id (no thresholds embedded in LOG or rungs).
Evidence is citable: at run time use PathId/PathSliceId when available; at packaging time provide resolvable A10EvidenceGraphRef?[] / EvidenceGraphId?.
Any cross-Context or cross-plane reuse is explicit: BridgeId/BridgeCardId, CL/CL^k/CL^plane, and Φ/Ψ/Φ_plane policy ids are pinned (policy ids resolvable per F.8:8.1).
PortfolioMode and dominance defaults are not restated: cite each default's governing definition through G.Core.DefaultGoverningDefinitionIndex (governing definitions live outside G.8, typically G.5).
QD pins are edition/policy pinned (DescriptorMapRef.edition, DistanceDefRef.edition, insertion/emitter policies); CharacteristicSpaceRef.edition is pinned iff cell boundaries/de‑dup/parity depend on it; Spaces ≠ Maps.
If open‑ended surfaces are declared, pin GeneratorFamilyId, TransferRulesRef.edition, and any validity/coupler policy ids; unknown transfer validity is recorded as degrade/branching (no “fourth status”).
MaturityRungs is a closed, UTS‑registered set; the maturity ladder is ordinal/poset with a declared ReferencePlane; rung transitions cite evidence.
RSCR triggers are emitted as canonical RSCRTriggerKindId values (no prose-only “reasons”).
Notation independence (E.5.2) and twin‑register discipline (E.10) are respected for all published heads/ids.
If authoring tools materially shaped rule/rung content, cite AuthoringMethodDescriptionRefs?[] (edition‑pinned) for cross‑stance traceability.
one ParityPlan@Context that fixes baseline, freshness, comparator, and bridge discipline up front
one ParityReport@Context that echoes the active pins, outcomes, and evidence trace by value
one harness that downstream selection can consume without inventing a G.9-local CSLC gate or a shadow governance card
Illumination, coverage, and regret remain telemetry by default. If they are promoted into dominance, that promotion must be one explicit policy-bound choice rather than one hidden scoring convenience.
Pluralism vs comparability. Multiple Traditions must be comparable without semantic collapse.
Partial orders. Many targets are only partially ordered; parity reporting must preserve CSLC-admissible outcome shape (often selected sets or archives rather than a single scalar).
Edition sensitivity. Parity must be robust to silent drift in measurement/comparator definitions. When DHC/QD/OEE modes are used, the required definition pins are introduced only via the corresponding Extensions blocks (nil‑elision when unused).
Telemetry vs objectives. IlluminationSummary and coverage/regret are telemetry: report‑only by default; dominance changes require explicit CAL policy ids (recorded in audit pins).
GateCrossing visibility. Any crossings/gates used by parity must be visible and auditable via CrossingBundle + GateCrossing checks; failures block parity publication/consumption.
Cross‑Context reuse. Any reuse across contexts or reference planes must carry explicit crossing pins, audit evidence relation, and R-channel penalty placement.
Refreshability. Parity must emit RSCR‑relevant causes as canonical ids, with enough pins to re‑run.
This pattern is core‑invariant and therefore binds to G.Core by declaration (not by restating invariants here).
GCoreLinkageManifest (G.9)(normative; expands per G.Core:4.2)
Effective obligations/pins/triggers are computed as union(expand(sets), explicit deltas) under Nil‑elision.
All objects below are notation‑independent; serialisations (if any) are handled in shipping and interop publication forms, not here.
(1) ParityPlan@Context(WorkPlanning record)
A plan that fixes what is being compared and under what pinned conditions.
Minimal fields (conceptual; ids/pins only):
ParityPlan@Context := ⟨ ParityPlanId(UTS), CGFrameId?, // or CG-FrameContext id/scope reference cited by the referenced frame records entityOfConcernRef := EntityOfConcernRef, groundingHolonRef := GroundingHolonRef, referencePlaneRef := ReferencePlane, UNM_id?, NormalizationMethodId[]?, NormalizationMethodInstanceId[]?, // when “normalize, then compare” is required (ids only; semantics come from CN‑Spec / UNM) EpsilonDominance?, // optional ε-front thinning (ε≥0; id/param; pinned when used) PortfolioMode?, DominanceRegime?, // may be explicit or inherited via DefaultGoverningDefinition (semantics follow G.5) ParityContextId, BaselineSet, // method-family / generator-family baseline scope (ids; notation-independent) BaselineBindingRef, // evidence-backed baseline-set reference that says what counts as baseline FreshnessWindows, CNSpecRef.edition, CGSpecRef.edition, ComparatorSpecRef.edition, // edition-pinned refs SCPRef.edition?, // optional (when a specific SCP profile must be pinned/cited) MinimalEvidenceRef.edition?, // optional (when CG-Spec exposes minima profiles by ref) Budgeting?, ParityPinSet, PlanItemRefs[]? // references to A.15.3 SlotFillingsPlanItem (planned baseline), when parity depends on planned slot fillings ⟩
(2) ParityPinSet(pin set)
A declared set of pins required for reproducibility and audit (editions + policy‑ids + UTS/Path pins).
The concrete contents are pattern-local (G.9 declares the pin set), but must satisfy the core pin discipline via G.Core.
(3) ParityReport@Context(UTS publication record; work-result or audit-facing publication record only when the neighboring source exists)
A UTS-publishable parity publication record produced by running a ParityPlan@Context. By itself it is not a dated U.Work occurrence, audit performance, evidence path, assurance result, or gate decision; those claims require A.15/A.15.1, A.10/G.6, B.3, or A.21 respectively.
ParityReport@Context := ⟨ ParityReportId(UTS), ParityPlanId, BaselineSet, FreshnessWindows, CNSpecRef.edition, CGSpecRef.edition, ComparatorSpecRef.edition, SCPRef.edition?, MinimalEvidenceRef.edition?, // echoed iff used/pinned in the plan UNM_id?, NormalizationMethodId[]?, NormalizationMethodInstanceId[]?, // echoed iff used in the plan OutcomeRefs, // selected-set / archive outcomes (as refs to selector outputs) EpsilonDominance?, // echoed when used AbstainReasons[]?, // ids/labels (policy-bound) for abstain/degrade; refusal paths included TelemetrySummary? := ⟨IlluminationSummary?, coverage?, regret?⟩, // report-only by default; promotion requires CAL policy-id pins GuardOutcomeTraceRef?, // pass/degrade/abstain trace + cited reasons (policy-bound) EvidenceTrace := ⟨EvidenceGraphId, PathId[], PathSliceId?⟩, CrossingPins?, // Bridge/CL/Φ/Ψ/Φ_plane pins, when crossings are invoked EditionPinsDelta?, // explicit list of edition pins actually active during the run PolicyPinsDelta?, // explicit list of policy-ids actually active during the run RSCRRefs[] // parity RSCR test ids / trigger emissions ⟩
Naming discipline.
Heads reuse existing U‑types and LEX discipline; no new “strategy” primitive is minted here.
Tech/Plain twins follow E.10 rules (no drift‑inducing synonyms in Tech).
Planning is the act of making the parity run reproducible by construction:
Fix the baseline set. Choose the BaselineSet (MethodFamilies, and optionally GeneratorFamilies) to compare; where parity context matters, cite SoS‑LOGBundleId? and source-maturity ids by reference (acceptance-gate thresholds remain in G.4 Acceptance).
Bind scope. Fix entityOfConcernRef, groundingHolonRef, and referencePlaneRef = ReferencePlane and record all three in the plan (no silent widening/narrowing or EoC/grounding-holon collapse).
Define baseline-set reference. Declare what counts as “baseline set” and how it is cited (e.g., BaselineBindingRef, the evidence-backed baseline-set reference, pointing to an EvidenceGraph path slice or an upstream shipped package or publication-record id).
Equalise window (and budget, if pinned). Declare a single FreshnessWindows and apply it across all baselines; if Budgeting is used/pinned, it MUST be shared/pinned across baselines as well.
When specialization is part of the parity claim, the same plan should also hold constant the declared task family or target scope cut, the work-measure threshold target, adaptation budget, prior exposure declaration, and freshness window; if transfer, retention, downstream exploitation efficiency, downside field, or corridor entry are part of the claim, those pins should be explicit as well, including the baseline relative to which corridor entry is being claimed.
Pin governance, CSLC comparability and admissibility references, and comparator references.CNSpecRef, CGSpecRef, and ComparatorSpecRef are referenced with explicit edition pins.
Pin measurement/comparator definitions (conditional). Where parity depends on mode‑specific definition records (e.g., DHC/QD/OEE), pin the relevant definition ids/editions/policies. The minimum required pins are declared by the applicable Extensions blocks (e.g., G.9:Ext.DHCParityPins, G.9:Ext.QDArchiveParity, G.9:Ext.OEEParity) and the referenced records they cite.
Bind comparator choice to CG-Spec (CSLC comparability and admissibility). Any numeric comparison or aggregation MUST be CSLC‑admissible and cite the corresponding CG‑Spec entry (via ComparatorSpecRef). If Characteristics differ by unit, scale, or space, the plan MUST declare the ids used for “normalize, then compare” (UNM_id?, NormalizationMethodId[]?, NormalizationMethodInstanceId[]?) — ids only; semantics are defined elsewhere.
Declare order & PortfolioMode semantics. Parity MUST preserve set‑return semantics; PortfolioMode and DominanceRegime are either explicitly pinned or cited through G.Core.DefaultGoverningDefinitionIndex. IlluminationSummary/coverage/regret remain telemetry unless a CAL policy explicitly promotes them (policy‑id pinned & recorded).
Attach planned baselines (when applicable). If parity depends on planned slot fillings, the plan cites the relevant SlotFillingsPlanItem refs (A.15.3) via PlanItemRefs[] rather than embedding a competing baseline object (nil‑elision when unused).
Publish crossing pins (when invoked). Cross-Context or cross-plane/Kind reuse requires explicit Bridge/CL/Φ pins; penalties affect R_eff only (invariants pinned through G.Core).
Validate CSLC references and pins. Validate the cited CSLC comparability and admissibility references, active pins, and witnesses; run eligibility or acceptance checks under the plan’s TaskSignature (S2) and refuse or abstain on non-admissible operations (record trace; no “fourth status”). If a live A.21 gate consumes this check, cite its GateDecisionRef/DecisionLogRef; do not create a G.9-local CSLC gate.
Invoke selection/dispatch. Apply G.5 under the plan’s pinned refs and emit selector outputs in a form consistent with G.5’s PortfolioMode and selected-set semantics.
When parity is comparing bounded specialization, the report should echo the active specialization profiles or equivalent pins so readers can recover the work-measure threshold target, prior exposure, budget-to-threshold, post-threshold efficiency when relevant, transfer, retention, downside field, and any corridor-entry baseline or evidence note from the parity object itself rather than from later narrative explanation.
Record comparability mapping (when used). If UNM_id? / NormalizationMethodId[]? / NormalizationMethodInstanceId[]? were declared, echo them in ParityReport@Context (or in its explicit pins deltas) and record their ids (and any scoped notes required by the cited governing spec ref) in audit pins/SCR; cite the applicable PathIds.
Publish trace. Emit ParityReport@Context with EvidenceGraph citations and all active pins (editions/policy‑ids), so the run can be re‑checked and re‑run.
Emit telemetry hooks (optional, report‑only). When telemetry is produced, it is emitted as telemetry pins/events for refresh wiring (not as a silent change in dominance interpretation).
Two agentic search setups both claim bounded specialization on the same declared task family.
The ParityPlan pins the same freshness window, threshold target, adaptation budget, prior-exposure declaration, comparator editions, and corridor-entry baseline. One setup reaches threshold sooner but shows low retention and no transfer. The other reaches threshold later, but carries reusable transfer and lower downside field.
A CSLC-admissible ParityReport@Context therefore states what was held constant, which signals remained telemetry, and why the outcome stays a governed selected set or partial order rather than collapsing into a scalar winner. The reader can recover the practical comparison from the parity slice itself before reading any optional wiring blocks.
Use this conditional extension only when a parity report compares causal methods or causal-use claims. The parity report starts with a cheap screen and may stop at degraded parity or abstain when methods plainly answer different causal uses.
Open the full CausalMethodRungParityRecord only when CausalRungParityScreenOutcome = comparableEnoughForFullRecord. Other outcomes are admissible cheap stops: degraded parity, abstain, or apply [C.28](/generated/patterns/C.28), without fabricating a full parity record.
targetCausalityLadderRungSet is the first parity check. Here CausalityLadderRung is a cited causal-use taxonomy value, not a maturity level, upgrade ladder, or superiority scale. If the set has more than one causality-ladder rung and no declared bridge and loss makes the comparison meaningful, the screen returns crossRungDegrade rather than treating the methods as peers.
causalEvidenceSupportBasisSet is the second parity check. If methods depend on different causal support bases and no declared support-loss or bridge makes the comparison meaningful, the screen returns crossSupportBasisDegrade.
sameEstimand = no returns differentEstimandAbstain unless the report names a shared estimand, a bridge and loss relation, or a reason the comparison is intentionally non-parity. A scalar parity result is not admissible across different estimands by default.
sameOutcomeWindow = no returns differentOutcomeWindowAbstain unless the report pins a common follow-up window or declares the window loss. A method that wins at one horizon is not parity-superior at another horizon by default.
Parity reports comparing causal methods then carry a CausalMethodRungParityRecord:
Parity reports comparing causal methods fill this record so the "same" claims are checkable by fields rather than prose:
comparedMethodsRef;
targetCausalityLadderRung;
targetCausalUseClaimKind: CausalUseClaimKind;
estimandRef;
interventionBudgetOrActionSetRef;
causalEvidenceSupportBasis;
causalUseSupportRecordRef and causalUseSupportVerdict when a [C.28](/generated/patterns/C.28) support record or verdict is being consumed;
causalFollowUpWindowRef;
outcomeMeasureRef;
declaredCausalityLadderBridgeOrLossRef where causality-ladder rungs differ;
causalTransportabilityProfileRef where source population, target population, domain, context, or evidence regime differs;
causalParameterEstimationProfileRef where estimation validity, uncertainty, nuisance handling, or sensitivity differs;
degraded parity or abstain result where parity cannot be established.
Causality-ladder parity is a degrade/abstain condition, not a universal comparison ban. Cross-rung method comparisons must name declaredCausalityLadderBridgeOrLossRef and cannot become superiority claims by default.
What changes in practice: one benchmark cannot compare a predictive model, an interventional action/effect question optimizer, and a counterfactual comparison question strategy as one undifferentiated "method improvement" set.
What this does not authorize: [G.9](/generated/patterns/G.9) does not decide causal identification, causal fairness, or counterfactual sampling realizability; it keeps parity and benchmark harness authority and sends causal-use support to [C.28](/generated/patterns/C.28).
Most working readers can stop after G.9:4.3a. The blocks below are binding-only wiring records used only when the corresponding parity mode is actually active.
The following blocks store wiring only (pins/refs/policy‑ids, relevant triggers, and Uses), while semantics remains defined in the referenced patterns.
RSCRTriggerSetIds:{GCoreTriggerSetId.BridgeCalibrationKit}(preferred; expands in G.Core)
RSCRTriggerKindIds (delta, if any):∅
Notes (wiring-only): This block does not define CL/Φ/Ψ semantics; it only requires the pins needed to cite calibration records and crossing visibility bundles.
CC‑G9‑CoreRef (normative; mandatory).G.9 conforms only if it satisfies the effective set of CC‑GCORE‑* declared in G.9:4.0 GCoreLinkageManifest (including trigger typing, Default Governing Definition Index links, and P2W split).
CC‑G9.1 — Equal windows (and budgets) & pinned spec editions (local).
A ParityPlan SHALL declare a single FreshnessWindows shared across baselines. If Budgeting is used/pinned, it SHALL be shared across baselines as well. ParityPinSetSHALL include the edition pins required by the referenced governing spec and comparator refs (at minimum CNSpecRef.edition, CGSpecRef.edition, ComparatorSpecRef.edition).
If the parity run depends on planned slot fillings (WorkPlanning baseline), the plan SHALL cite the relevant SlotFillingsPlanItem refs via PlanItemRefs[] (nil‑elision when not applicable).
CC‑G9.2 — Mode‑specific definition pins are declared via Extensions (local; conditional).
When parity depends on mode‑specific definition records beyond the pinned governing spec refs (e.g., DHC/QD/OEE), the ParityPlan/Report SHALL include the corresponding GPatternExtension blocks and satisfy their RequiredPins/EditionPins/PolicyPins (typically carried inside ParityPinSet, and echoed via pins deltas in audit):
DHC parity → G.9:Ext.DHCParityPins
QD archive parity → G.9:Ext.QDArchiveParity
OEE parity → G.9:Ext.OEEParity
CC‑G9.3 — CSLC-admissible orders and arithmetic (delegation point + local constraint).
Delegated to CC‑GCORE‑SET‑1 (and the relevant G.5PortfolioMode / selected-set semantics). Additionally: any numeric comparison or aggregation invoked by parity SHALL be CSLC-admissible and cite the corresponding CG‑Spec entry; non-admissible operations (e.g., ordinal means / mixed‑scale weighted sums) SHALL be refused or abstained with path‑cited trace (citation only; arithmetic admissibility comes from CG‑Spec/MM‑CHR).
CC‑G9.4 — Normalization discipline (local citation only).
If Characteristics differ by unit, scale, or space, the ParityPlan SHALL cite the CSLC-admissible comparability mapping by id (UNM_id?, NormalizationMethodId[]?, NormalizationMethodInstanceId[]?) and compare only after that mapping is applied (“normalize, then compare”).
If such mapping ids are used, the ParityReport SHALL echo the same ids (directly or via explicit pins deltas) so the run is reproducible/auditable without out‑of‑band context.
The harness SHALL NOT define a local mapping.
CC‑G9.5 — Dominance/PortfolioMode interpretation & telemetry separation (local).
ParityPlan/ParityReport SHALL either (i) explicitly pin the applicable regime/mode via refs/policy‑ids, or (ii) cite the corresponding defaults for DefaultId.DominanceRegime and DefaultId.PortfolioMode via G.Core.DefaultGoverningDefinitionIndex. Any non‑default “promotion” behaviour must be policy‑bound and recorded via policy‑id pins.
IlluminationSummary/coverage/regret SHALL be treated as telemetry (report‑only by default); any promotion into dominance is an explicitly pinned CAL policy and MUST be recorded in audit pins/SCR.
5a. CC‑G9.5a — Adaptation parity disclosure (local; conditional).
When the parity claim concerns bounded specialization, the ParityPlan and ParityReport SHALL pin the declared task family or target scope cut, the work-measure threshold target, adaptation budget, prior exposure declaration, and any transfer, retention, downstream exploitation efficiency, downside field, or corridor-entry baseline/evidence note that materially affects comparison.
CC‑G9.6 — Epsilon‑front thinning (local; conditional).
If ε‑front thinning is used, EpsilonDominance (ε≥0)SHALL be explicit in the plan/report and pinned (param/id) such that the same ε is reproducible.
CC‑G9.7 — Crossing visibility (delegation point).
Delegated to CC‑GCORE‑CROSS‑1 and CC‑GCORE‑PEN‑1. This item remains as a stable delegation point for Bridge and reference-plane crossing visibility plus R-channel penalty placement discipline.
CC‑G9.8 — Evidence trace completeness (local).
A ParityReport SHALL include an EvidenceTrace with EvidenceGraphId and the relevant PathId[] (and PathSliceId? when needed), covering both inclusions and refusals/abstains/degrades.
CC‑G9.9 — Telemetry hooks are emitted with pins (local).
When parity emits telemetry for refresh, emitted telemetry SHALL carry the active edition pins and policy‑ids needed to re‑run parity (including the active subset of ParityPinSet relevant to the emitted event).
In particular, telemetry items SHOULD cite PathSliceId when available, and SHALL include the policy id governing the telemetry interpretation.
Mode‑specific definition pins SHALL be included as declared by the active Extensions blocks (e.g., G.9:Ext.QDArchiveParity, G.9:Ext.OEEParity, including EnvironmentValidityRegionId when OEE parity is in scope).
CC‑G9.10 — RSCR parity tests are published (local).
Parity publication SHALL include RSCR parity tests (via F.15 harness refs) that cover negative/refusal paths relevant to this plan (missing pins, edition drift, missing bridge calibration refs, etc.).
CC‑G9.11 — GateCrossing visibility (delegation point).
Delegated to CC‑GCORE‑CROSS‑1 and the applicable GateCrossing/CrossingBundle harness checks (E.18, A.21, F.9, and relevant Part G bridge or crossing wiring). This remains a stable delegation point.
CC‑G9.12 — Tech‑register lexical discipline (local).
Tech prose and heads SHALL follow E.10: do not introduce drift‑prone primitives (e.g., “metric” as a Tech primitive); reference the source pattern's canonical terms and pinned refs.
CC‑G9.13 — MOO disclosure for parity (local).Run_Parity / Publish_ParityReportSHALL record the ParityHarness identity (UTS ids) and the active pins required to interpret the outcome (editions + policy‑ids), so parity remains auditable without relying on “decision logs”.
CC-G9-CLP-1 - Causal method rung parity. If a parity report compares causal methods, it SHALL first run CausalRungParityScreen; when full parity remains plausible, it SHALL declare target causality-ladder rung, causal-use claim kind, estimandRef, interventional-action basis, causal evidence support basis, transportability basis for the source population and target population when needed, estimation-validity basis when needed, bridge and loss relation where rungs differ, causalUseSupportRecordRef and causalUseSupportVerdict when relevant C.28 support is consumed, and degraded parity or abstain result where parity cannot be established.
AP‑1 Hidden edition drift. Remedy: require edition pins in ParityPinSet; treat changes as RSCR‑relevant via canonical trigger kinds.
AP‑2 Baseline set is informal prose. Remedy: require BaselineBindingRef and EvidenceTrace pins.
AP‑3 Comparator semantics are “whatever the code did”. Remedy: ComparatorSpecRef.edition (and any normalization/comparability refs) must be cited and pinned.
AP‑4 Cross‑Context reuse without visible crossing pins. Remedy: cite Bridge/reference-plane records and crossing visibility records (delegated to G.Core).
AP‑5 Parity report becomes a hidden scoring sheet. Remedy: preserve CSLC-admissible outcome shape and keep telemetry as telemetry unless explicitly policy‑promoted by the governing policy pattern.
AP‑6 “Metric” as a primitive in Tech. Remedy: use DHCMethodRef/U.Measure/DistanceDefRef with editions; “metric” may appear only in Plain with an explicit pointer to canonical terms.
AP‑7 Hidden spec drift (spec edition pins missing). Remedy: pin DHCMethodSpecRef.edition and register RSCR tests that fail on spec edition changes; refuse parity reuse on unpinned spec editions.
Show‑A — Multi‑tradition parity for decision systems (post‑2015 practice).
ParityPlan pins a rolling evidence window and comparator refs; ParityReport publishes a selected-set outcome plus the evidence trace. Family labels such as preference-learning comparators, causal decision pipelines, offline-RL evaluation pipelines, and robust BO-style selectors remain illustrative until a G.2 SoTA pack or named current source pins the exact family being compared; the parity report still must preserve the selected set or partial order rather than collapse everything into a single scalar.
Show‑B — QD parity (MAP‑Elites lineage → CMA‑ME / DQD / QDax JMLR 2024, with QDHF or QDAIF refs only when a feedback-guided QD claim is live).
ParityPlan pins descriptor/distance definitions and archive insertion policy editions. ParityReport includes archive outcomes and telemetry deltas needed for refresh, without silently converting illumination summaries into dominance.
Show‑C — Open‑ended parity (POET as lineage; current generator-family claims require a named G.2 SoTA pack or exact current source).
ParityPlan pins transfer rule editions and exploration policy refs. ParityReport publishes selected-set outcomes plus transfer‑keyed traces (PathSlice), enabling refresh reruns when any pinned policy changes.
Show-D — Causal method rung parity.
A team compares an observational predictor, an intervention optimizer, and a counterfactual policy strategy under one "best causal method" headline. G.9 first runs CausalRungParityScreen: if rungs, support bases, estimands, or outcome windows differ, the screen returns degraded parity or abstain before a full record is fabricated. When full parity remains plausible, G.9 requires CausalMethodRungParityRecord: each method declares targetCausalUseClaimKind, target CausalityLadderRung, estimandRef, interventional-action basis, CausalEvidenceSupportBasis, relevant C.28 support record and verdict when consumed, follow-up window, outcome measure, source population and target population basis, and estimation-validity basis. If those fields differ, the parity report names declaredCausalityLadderBridgeOrLossRef, transportability or estimation refs where available, and degraded parity or abstain result. The admissible output may be a selected set by comparable rung, not one scalar winner.
#G.9:9 — Cited Records (what this pattern publishes)
Exports (UTS‑publishable, edition‑pinned):
ParityPlan@Context (WorkPlanning plan item)
ParityReport@Context (UTS publication record; work-result or audit-facing publication record only when the neighboring source relation is live)
DRR+SCR refs (by id) and (when applicable) PortfolioPackRef?/selector output refs (by id), for downstream consumption.
Telemetry pins/events (by id), for refresh wiring (G.11) and RSCR harnesses (F.15).
C.27 may flag: dynamic parity when a benchmark actually compares rate-change, rhythm change, recovery speed, intervention effect, effort budget, or dynamic outcome.
This pattern keeps: baseline, freshness, comparator edition, effort/budget parity, bridge discipline, parity plan, parity report, and reproducible benchmark publication.
Non-admissible use: faster improvement is not benchmark superiority, and dyn2BenchmarkParityBlock? is a benchmark input declaration, not a benchmark harness.
Exit: when live, recover dynOrderCompared, baseline window, adaptation/intervention window, effort or budget parity reference, rate/rate-change measure, G9ParityPlanRef, and optional G9ParityReportRef; G.5 is relevant only if selector publication consumes such a benchmark result.
C.29 may flag: parity or benchmark input whose comparator, distance, descriptor geometry, embedding, normalization, surrogate model, learned representation, parity measure, model-family label, or model-selection basis depends on a mathematical lens that changes the parity claim and is missing, under-specified, or overread.
This pattern keeps: baseline set, freshness, comparator edition, normalization ids, bridge discipline, parity plan, parity report, and reproducible benchmark publication.
Non-admissible use: a C.29 output does not publish a benchmark report, create benchmark superiority, supply selector output, or supply parity-measure admissibility by itself.
C.29 application: for an under-lensed or overread parity input, cite the applicable C.29 output for the stated use: NoMathLensUseNeeded, MathLensUse.LensCandidateNote, MathLensUse.OneLine, MathLensUse.MiniCard, MathLensUse.FullCard, or NeighborGoverningPatternNote. Use the cheap output that changes the next admissible parity move; full-card work is only required when the live parity or benchmark claim needs it.
Builds on:G.Core, G.5, G.6, G.4, F.15, E.17, E.18, A.21, F.17, E.5.2, E.10.
Publishes to:UTS (plan/report ids), G.11 (refresh wiring), G.10 (shipping publication form; parity records are cited records).
Uses:G.0, A.19, F.9, and C.28 when parity compares causal methods or causal-use claims.
Uses (optional, via Extensions):G.7, C.18 and C.19 (QD/OEE wiring), C.23 (SoS‑LOG narration and failure‑policy pins).
If two baselines are being compared under different freshness windows, comparator editions, or silent normalization rules, this pattern has not yet been satisfied.
If parity cannot tell the reader what was held constant, what remained telemetry, and what crossings or penalties were active, the report is not yet usable.
If a scalar winner is being claimed where only a selected set or partial order is CSLC-admissible, parity is overclaiming and should publish the CSLC-admissible outcome shape instead.
Tag: Architectural pattern (conceptual; notation‑independent; pack‑boundary governing definition)
Stage: release‑time composition and publication; edition‑aware; GateCrossing‑gated via E.18 CrossingBundle (and the relevant GateCrossing harness patterns).
Builds on:G.Core (Part‑G core invariants and delegation); upstream pack/kit governing definitions as cited publications or records (not redefined here).
Governs (scope boundary):shipping of Part‑G outputs as a pack (SoTA‑Pack(Core)), including the pack‑level publication kit: (i) selector‑facing selection/parity roster, (ii) PathId/PathSlice citation surface, (iii) telemetry pins for refresh planning, and (iv) optional interop ingestion as citation‑only notes.
Does not govern: governing spec refs (CN‑Spec, CG‑Spec), CHR/CAL semantics, selection semantics, evidence semantics, bridge calibration semantics, refresh orchestration (these remain with their governing definitions and are cited).
#Problem frame — Shipping without smuggling semantics
Part G produces many kit-governed and suite-governed publications or records (harvest packs, CHR/CAL packs, evidence graphs, bridge calibration records, log bundles, parity reports). Without an explicit pack-boundary governing definition, “shipping” tends to become:
an ad‑hoc folder/export ritual (tool‑locked, not citable), or
a silent re-specification step (shipping accidentally redefines legality, defaults, or selection semantics), or
a brittle hand‑off that cannot support RSCR/refresh (no actionable pins/editions/policies attached).
G.10 fixes the pack boundary: it defines the single, normative shipping surface for Part‑G outputs — SoTA‑Pack(Core) — and a minimal choreography for making shipped artefacts selector‑ready and audit‑citable, while delegating all Part‑G‑wide invariants to G.Core (citation/delegation, not restatement).
#Problem — Why naive shipping breaks reuse, legality, and refresh
Naive shipping fails (conceptually) when any of the following occurs:
Format-as-governing-spec. A concrete export format is treated as “the pack,” turning a tool choice into a governing pack definition.
Editionless hand‑offs. Shipped artefacts omit the edition/policy pins required to replay or compare outcomes, so parity and RSCR become non‑actionable.
Invisible crossings. Cross-context or cross-plane reuse is present, but the pack does not expose the crossing bundles and penalty policy pins needed for audit and refresh planning.
No method‑of‑obtaining‑output disclosure. Consumers receive outcomes without a minimal, citable trail of which mechanisms/policies/editions produced them.
Refresh orphaning. Telemetry and decay signals exist, but the shipped artefact provides no stable scope keys (PathId / PathSliceId) and no payload pins for RSCR triggers.
Make packs portable across tools ↔ still make them concrete enough to be used.
Completeness vs minimality
Ship enough to be selector‑ready ↔ avoid duplicating governing definition semantics.
Continuity vs evolvability
Preserve public IDs across edition bumps ↔ allow legitimate upgrades and deprecations.
Cross‑context reuse vs honesty
Enable reuse across Traditions/contexts ↔ keep crossings explicit and auditable.
Telemetry usefulness vs semantic contamination
Export useful signals ↔ avoid turning telemetry into dominance/acceptance without pinned policy.
Fast shipping vs refreshability
Ship quickly ↔ ensure RSCR triggers can be planned and scoped (P2W‑path aware).
#Solution — SoTA‑Pack(Core) as the shipping object and publication kit
G.10 defines a pack-governed shipping surface: a notation‑independent object that cites all upstream artefacts by stable ids/refs and exposes the minimum pins required to (a) consume the result via selection, (b) audit it via path citations and crossing bundles, and (c) refresh it via typed RSCR triggers.
Builds on:G.Core (Part‑G core invariants; Default Governing Definition Index citation)
GCoreLinkageManifest (G.10)(normative; expands per G.Core:4.2; Nil‑elision applies)
Effective obligations/pins/triggers are computed as union(expand(sets), explicit deltas) under Nil‑elision.
DefaultsConsumed := {
DefaultId.PortfolioMode,
DefaultId.DominanceRegime,
DefaultId.GammaFoldForR_eff
}
(Governing definitions are resolved through G.Core.DefaultGoverningDefinitionIndex and are not restated here.)
MOOManifestId?(method‑of‑obtaining‑output disclosure; conceptual object id)
}
(Optional pins from CrossingVisibilityPins MAY be strengthened to unconditional by listing them above; G.10 typically strengthens UTSRowId[] and path/crossing bundles when the pack is publicly shipped.)
TriggerAliasMapRef := ∅(no local trigger tokens in Phase‑2)
Mode‑specific definition pins. Any additional pins required for QD/OEE/interop shipping are introduced only by GPatternExtension blocks in G.10:4.6 (never smuggled into the core linkage).
#SoTA‑Pack(Core) object model (normative; notation‑independent)
SoTA‑Pack(Core) is a shipment object (a pack, not a kit and not a suite) that cites upstream artefacts and exposes pack‑level pins required for downstream use.
SoTA‑Pack(Core) :=⟨ PackId(UTS), publicationScopeId, contextSliceId?, CG-FrameContext, entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩, // Governing spec refs (refs + edition pins; semantics governed by their patterns) CNSpecRef := ⟨A.19 ref, CNSpecRef.edition⟩, CGSpecRef := ⟨G.0 ref, CGSpecRef.edition⟩, // Selector-facing selection/parity roster token (conceptual; no formats mandated) PortfolioRosterId?, // produced by `G.10‑1` as part of composition; may cite ε and the applicable pinned regime/mode refs // Cited payload packs/kits (ids only; semantics governed by the cited governing patterns) SoTAHarvestPackId? // e.g., G.2 output id CHRPackId? // G.3 output id CALPackId? // G.4 output id EvidenceGraphId? // G.6 output id BridgeMatrixId? // G.2/G.7 cited id BridgeCalibrationTableId? // G.7 output id SoSLOGBundleId? // G.8 output id ParityReportId? // G.9 output id DashboardSliceId? // G.12 output id (optional) InteropSurfaceId? // G.13 output id (optional) // Path citation surface (ids only; semantics governed by A.10/G.6) PathIds := PathId[]?, PathSliceIds := PathSliceId[]?, // Planned baseline + audit pins (P2W-aware; ids only) PlanItemRefs := SlotFillingsPlanItemRef[]?, AuditPins := { id pins… }, // editions only on `…Ref.edition`; includes policies, UTS/Path pins, crossing pins // Crossing visibility surface (per GateCrossing; ids only) CrossingBundleIds := CrossingBundleId[]?, // Telemetry hooks for refresh planning (ids only; PathSlice-keyed; policy-id pinned) TelemetryPinIds := TelemetryPinId[]?, // Method-of-obtaining-output (MOO) disclosure (conceptual; ids only) MOOManifestId?, Notes?⟩
PortfolioRosterId identifies the selector‑facing pack roster token. The corresponding PortfolioRoster@Context is one citation-and-binding roster record inside the shipped publication form, not a publication face kind, publication form kind, interop publication form kind, or carrier kind:
it MUST NOT redefine selection / selected-set semantics (governed by G.5) or parity semantics (governed by G.9).
Mode‑specific definition pins (QD/OEE/interop) are introduced only via G.10:Ext.* blocks.
PortfolioRoster@Context :=⟨ PortfolioRosterId, PackId(UTS), CG-FrameContext, entityOfConcern, // Selector operation and default-resolution support portfolioMode?, dominanceRegime?, ε?, // Published selector outcome and set-result declaration (metadata fields, not local semantics) selectorOutcomeKind?, setResultFamily?, handoffKind?, subjectKind?, sourceSetFamily?, derivedViewKind?, sourceSetComposition?, basePaletteRef?, lensId?, shortlistId?, promotionPolicyRef?, retentionIntent?, // Selector-facing roster + provenance hooks (ids only) MethodFamilyIds := MethodFamilyId[]?, GeneratorFamilyIds := GeneratorFamilyId[]?, ParityReportId?, SCRId[]?, DRRId[]?, // Pin reuse: prefer referencing the enclosing pack’s AuditPins bundle AuditPins?, Notes?⟩
Presence rule:PortfolioRosterId MAY be omitted only when the shipped pack is inputs‑only
(e.g., shipping CHR/CAL/evidence without any selector‑consumable selected-set/shortlist output).
The selectorOutcomeKind, setResultFamily, handoffKind, sourceSetFamily, sourceSetComposition, derivedViewKind, basePaletteRef, lensId, and shortlistId fields in this roster are payload metadata fields or refs inside the shipped publication form. They do not define publication face kinds, publication form kinds, interop publication form kinds, or carrier kinds, and they do not let [G.10](/generated/patterns/G.10) re-govern [G.5](/generated/patterns/G.5), [C.18](/generated/patterns/C.18), [C.19](/generated/patterns/C.19), or [G.2](/generated/patterns/G.2) semantics.
Interpretation constraints (normative by delegation). Any universal invariants governing (i) CN/CG spec-ref governing-definition assignment, (ii) crossing visibility and penalty routing, (iii) tri‑state guards, (iv) set‑return semantics, (v) P2W split, (vi) defaults, and (vii) RSCR trigger typing are not restated here and are enforced via G.Core conformance (see CC‑G10‑CoreRef).
G.10 prescribes a minimal, governing-definition delegating sequence for composing a shipped pack:
S‑1 — Gather & pin. Collect upstream artefact ids and verify the required pins implied by the linkage manifest (edition pins, policy pins, UTS/Path pins).
S‑2 — Compose SoTA‑Pack(Core) + MOO disclosure. Assemble the pack object and attach a MOOManifest that lists the referenced mechanisms/policies/editions that produced the shipped outcomes (ids only; semantics stay with governing definitions).
S‑3 — Publish selection/parity roster (selector‑facing). Produce a selector‑readable PortfolioRosterId with the parity/definition pins required for reproducibility; do not mandate formats.
S‑4 — Anchor and publish path citations. Ensure A.10 anchors exist and publish/record PathId/PathSliceId citations required for downstream explainability (e.g., C.23/H4) and maturity rung changes.
S‑5 — Expose CrossingBundle. For each GateCrossing relevant to the shipped artefacts, expose the required CrossingBundle references (fail fast on missing or non‑conformant bundles when required).
S‑6 — Emit telemetry pins for refresh planning. Whenever illumination increases or archive/OEE pin state changes, emit PathSlice‑keyed telemetry with policy‑id and the active …Ref.edition pins (and QD EmitterPolicyRef/InsertionPolicyRef when applicable).
S‑7 — Publish to UTS (twin labels). Mint/refresh UTS Name Cards needed to cite the pack and shipped heads (Tech/Plain twins when required); cross‑Context identity travels only via Bridges with CL and loss notes.
S‑8 — Optional: ingest interop surface. If G.13 interop is in use, ingest/cite InteropSurface@Context as annotation-only notes, pinning external index editions; do not redefine interop semantics.
Surfaces remain conceptual per E.5.2; RO‑Crate/ORKG/OpenAlex mappings belong to Annex/Interop and do not affect Core conformance.
Note. Any concrete serialisation/export is not part of this interface set. Serialisation belongs to interop/annex governing-definition assignment and must not become the governing definition.
#Consequence of governing-definition assignment (normative boundary statement)
G.10 is the one governing definition of “shipping” in Part G (by delegation to CC‑GCORE‑SKP‑1).
Other G.x patterns may produce artefacts that are shipped, but they must not embed shipping obligations; they cite G.10 shipping surfaces instead.
EnvironmentValidityRegion?(id/ref; iff an explicit region is declared as part of generator-family support)
PathSliceId[](scope key for refreshable generator telemetry when present)
RSCRTriggerSetIds:∅(covered by the core trigger set)Notes (shipping-pin discipline):
“Open‑endedness” semantics remain defined by the governing pattern; the pack only carries the pins required to make the shipped claim replayable/auditable.
RSCRTriggerSetIds:∅(covered by the core trigger set)Notes (shipping-pin discipline):
This block only records that an interop surface contributed to the shipped pack’s provenance; it does not redefine any crosswalk semantics.
#Published surfaces must ship kind, source, derivation, lens, and shortlist token
Published surfaces should carry the selector outcome kind and, when applicable, the set-result kind or handoff kind, plus the subject kind, source set kind, and relevant declared surface pins.
These are publication payload metadata fields inside SoTA-Pack(Core), not publication face kinds, publication form kinds, interop publication form kinds, or carrier kinds.
Good publication fields include selectorOutcomeKind, setResultFamily, handoffKind, subjectKind, sourceSetFamily, sourceSetComposition, dominanceRegime, lensId, shortlistId, and any declared archive or promotion-policy ids that the reader needs to interpret the visible set.
Those payload fields should use controlled tokens, cited ids, or already-declared head labels rather than shipping-local prose values.
When the visible surface or the shortlisted source is one derived tradition view, also publish the derivation explicitly.
Useful additional fields there include derivedViewKind, basePaletteRef, and the declared qId or reachability rule id that disciplined that derivation.
portfolioMode may remain as one support field about selector operation, but it should not stand in for the public set label.
A published surface should mirror semantics that are already declared in the governing palette, front, archive, or shortlist language.
It should not redefine that semantics locally.
When one shipped surface still needs a plain-language label, use the declared set-result kind and source set rather than falling back to portfolioMode.
If the visible surface is one tradition front under the declared Q, publish selectorOutcomeKind=SetResultOutcome, setResultFamily=Front, sourceSetFamily=Front, derivedViewKind=TraditionFront, and keep basePaletteRef=SoTAPaletteDescriptionId recoverable instead of pretending that the palette itself already was that front.
If one shortlist is emitted from that derived tradition front, publish selectorOutcomeKind=SetResultOutcome, setResultFamily=Shortlist, sourceSetFamily=Front, derivedViewKind=TraditionFront, basePaletteRef=SoTAPaletteDescriptionId, and the named lensId together.
If that same shortlisted surface is emitted as one stable public object, also publish shortlistId=<...> and keep it recoverable that the token names that shortlist rather than replacing it.
If one retained tradition archive view is shown, publish selectorOutcomeKind=SetResultOutcome, setResultFamily=Archive, sourceSetFamily=Archive, derivedViewKind=TraditionArchive, and keep the same basePaletteRef recoverable.
If the shortlist is later ordered, publish setResultFamily=RankedShortlist and keep the declared source set visible.
Do not publish setResultFamily=ChoiceSet unless the shipped object is explicitly one mathematical analysis artifact rather than the public selected set.
Do not publish sourceSetFamily=TraditionPalette alone when the visible object is already one derived tradition view; readers need to know which view is on the surface and which base palette it depends on.
Do not publish TraditionFront or TraditionArchive as if they were the default meaning of Tradition.
Do not ask portfolioMode to tell the reader whether they are seeing one palette, one front, one archive, or one shortlist.
A shipped result becomes selector‑ready and audit‑citable without turning file formats into governing specifications.
Shipping is no longer a semantic “backdoor”: pack‑level semantics remain governing-definition delegated.
RSCR/refresh becomes operationally viable because pack‑level scope keys and payload pins are present.
Costs / trade‑offs
Shipping becomes more explicit (more pins and explicit surfaces), which raises authoring overhead.
If upstream governing definitions fail to provide citable ids/pins, G.10 cannot paper over the gap; shipping will block or ship a visibly incomplete pack (depending on policy‑bound failure behaviour, governed by cited definitions).
Format bias (Arch/Prag). A popular export format is tempting to treat as “the pack”.
Mitigation: keep Core surfaces conceptual (E.5.2); move serialisation recipes to Annex/Interop; keep conformance on semantics.
Centralisation bias (Gov). A single pattern governing shipping semantics can become a bottleneck.
Mitigation: keep shipping as one explicit governing-pattern responsibility, but push mode/method specifics into explicit G.10:Ext.* extension blocks and cite governing patterns.
Telemetry→dominance bias (Onto/Prag). Shipping pipelines often “promote” telemetry proxies (illumination/coverage) into ranking.
Mitigation: preserve the telemetry/order separation and require explicit CAL policy‑id for any promotion; record the policy‑id in audit pins/telemetry.
Interop authority bias (Onto/Epist). External indexes can silently override local legality/typing.
Mitigation:G.10‑6 ingests interop only as cited notes (editions + mapping policy refs), never as a replacement governing spec ref.
World‑plane (benchmark shipping).
A CG‑Frame ships a selected set that includes a QD archive (e.g., MAP‑Elites‑class / CMA‑ME‑class families) and a generator family (e.g., POET‑class environment generation). The shipped SoTA‑Pack(Core) cites the CHR/CAL packs and records the QD/OEE extension-required pins through the extension blocks so that downstream parity and refresh can be scoped to the affected PathSliceIds rather than forcing a global rebuild.
Episteme‑plane (synthesis shipping).
A CG‑Frame ships a pluralistic set of admissible methods gathered from post‑2015 literature streams (living review + synthesis pack). The shipped pack carries explicit CN/CG spec refs, evidence path citations, and method‑of‑obtaining‑output disclosure; downstream selection uses set‑valued outcomes and can schedule refresh when the synthesis pack or key pins change.
This pattern inherits order/illumination, evidence, and bridge/penalty legality from the cited governing patterns (not restated here). Shipping‑specific requirements:
ID
Statement
Verification notes (conceptual)
CC‑G10‑CoreRef
The pattern satisfies the effectiveG.Core obligations declared by G.10:4.1 (after profile/set/pin‑set expansion under Nil‑elision).
Check that the linkage manifest is present and that the expanded obligations are not contradicted.
CC‑G10.1 (Notation‑independent).
The pack MUST NOT rely on any specific file syntax; cards/tables are conceptual; tool serialisations are informative only.
Look for format‑free conceptual fields; any serialisation is explicitly non‑normative.
CC‑G10.2 (Pack parity pins).
If QD/OEE fields are present, pin DescriptorMapRef.edition, DistanceDefRef.edition, (optional) DHCMethodRef.edition / DHCMethodSpecRef.edition when used, and (OEE) TransferRulesRef.edition; include CharacteristicSpaceRef (+ CharacteristicSpaceRef.edition when it affects partitioning reproducibility); for QD archive semantics also pin EmitterPolicyRef and InsertionPolicyRef.
Verify the corresponding G.10:Ext.* block is present and the pins appear in AuditPins and (when relevant) in telemetry pins.
CC‑G10.3 (Telemetry discipline).
Any illumination increase or archive edit SHALL log PathSliceId, the active policy‑id, the active editions of the pinned …Ref fields (incl. OEE TransferRulesRef.edition), and the active EmitterPolicyRef/InsertionPolicyRef when applicable.
Verify emitted telemetry is PathSlice‑keyed and carries the required pins; ensure causes are recorded using canonical trigger kinds (alias labels optional only).
CC‑G10.4 (UTS publication & twins).
All shipped heads appear on UTS with Tech/Plain twins per delegated UTS discipline; cross‑Context identity (when present) is routed via Bridges with CL and loss notes per delegated crossing discipline.
Verify UTS rows exist and that any cross‑Context identity is routed via Bridge artefacts with visible CL/loss notes.
CC‑G10.5 (MOO surfaced in shipping).
For every declared selector set-result or archive published, the pack SHALL list the applicable generation/parity mechanism ids (e.g., QD EmitterPolicyRef/InsertionPolicyRef, parity harness ids, method refs where the method definition is generative) and the active policy‑id(s) in SCR‑visible bindings and telemetry pins (ids only; governing-definition delegating).
Verify MOOManifestId is present when outcomes are intended for downstream use and does not redefine semantics.
CC‑G10.6 (Pack completeness as a citation surface).
The pack cites all included upstream artefacts by id/ref and exposes the required pins (AuditPins, UTS/Path pins, CrossingBundleIds when required).
Verify all present payload artefacts have ids and the pins needed to cite/replay them.
CC‑G10.7 (CrossingBundle exposure).
For each GateCrossing relevant to shipped artefacts, the pack exposes the relevant CrossingBundleIds (or records that no such crossings exist) per delegated crossing visibility discipline, and shipping fails fast on missing/non‑conformant crossing bundles when required.
Verify crossing bundle presence/absence is honest and aligned with the shipped artefacts’ declared crossings.
CC‑G10.8 (Baseline binding is explicit when used).
If the shipped pack claims a planned baseline, PlanItemRefs := SlotFillingsPlanItemRef[] are present (WorkPlanning plan items, cited; no execution logs).
Verify plan items are cited by id and the pack does not treat decision records or execution logs as authoritative plan items.
CC‑G10.9 (Extension‑scoped pin declaration).
If QD/OEE/interop fields are present, the corresponding GPatternExtension block is present and its required pins/editions/policies are recorded in AuditPins and in emitted telemetry pins when those pins affect refreshability.
Verify conditional extension pins are not silently omitted when the mode is used.
CC‑G10.10 (Derived tradition-view shipping).
If the visible shipped surface or shortlisted source is one derived tradition view such as TraditionFront or TraditionArchive, the pack MUST publish the declared sourceSetFamily, keep basePaletteRef=SoTAPaletteDescriptionId recoverable, and carry the derivation basis (derivedViewKind, declared Q, or reachability/coverage rule id) with enough explicitness that the visible surface cannot be mistaken for the default palette semantics.
Verify derived tradition views are shipped as derived views, not as silent redefinitions of the base palette.
AP‑2 Hidden edition drift. Remedy: require …Ref.edition pins in AuditPins and treat edition changes as RSCR‑relevant via canonical trigger kinds.
AP‑3 “QD archive present” but missing definition pins. Remedy: enforce CC‑G10.2 and the G.10:Ext.QDArchiveShippingPins pin declarations.
AP‑4 Telemetry silently becomes dominance. Remedy: keep telemetry report‑only unless an explicit CAL policy promotes it; require policy‑id recorded (ties to CC‑G10.3 and MOO discipline).
AP‑5 No PathSlice key → refresh becomes global. Remedy: enforce PathSlice‑keyed telemetry and path citations (G.10‑4, G.10‑5).
AP‑6 Cross‑Context reuse without visible crossing pins. Remedy: require CrossingBundleIds + Bridge/CL policy pins; fail fast on missing/non‑conformant bundles (CC‑G10.7).
AP‑7 Interop ingestion rewrites semantics. Remedy: ingest interop as cited notes only; semantics remain in G.13 (G.10‑6, G.10:Ext.InteropCitation).
AP‑8 Derived-view collapse. Remedy: ship sourceSetFamily, derivedViewKind, basePaletteRef, and the declared Q or reachability basis with enough explicitness that one derived tradition view cannot masquerade as the default palette meaning.
Research‑object packaging & provenance. Post‑2015 practice increasingly treats “release artefacts” as packages with explicit provenance, versions, and minimal replay pins (e.g., modern research‑object and RO‑Crate‑class approaches). G.10 mirrors the “package‑as‑citation‑surface” idea while keeping semantics governing-definition delegated.
Reproducibility regimes in ML/AI. Contemporary reproducibility checklists, artifact evaluation/badging, and benchmark reporting norms motivate: explicit version pins, explicit method disclosure, and separating telemetry summaries from decision criteria unless policy‑promoted.
Scholarly KG interoperability. ORKG/OpenAlex‑class ecosystems highlight the need to treat external mappings as interop notes with editions, not as replacement governing spec refs — matching the G.10‑6 and G.10:Ext.InteropCitation stance.
Stage. run-time + maintenance-time (selective re-computation, republication, and controlled deprecation)
Primary outputs (kit publication units and records).RefreshQueue, RefreshPlan@Context (WorkPlanning plan item), RefreshReport@Context (Work or Audit record), DeprecationNotice@Context, EditionBumpLog@Context.
Non-duplication note (Phase-2).
This pattern does not (i) define the meaning of RSCR trigger kinds, (ii) introduce “shadow specs” for CN/CG legality, (iii) redefine tri-state guards / penalties / set-return semantics, (iv) re-govern shipping or harvesting, or (v) mint new RSCRTriggerKindId / default governing definitions (design-time changes live in G.Core and are recorded via DRR, E.9).
All such universal norms are cited via G.Core and enforced through delegation in this pattern’s conformance checklist.
#Problem frame — Keeping shipped SoTA current without global rebuilds
Part G produces shipped, selector-ready publication units and records: packs, bundles, evidence graphs, parity reports, and dashboards. Once shipped, they are exposed to:
bridge evolution (CL/plane penalties or calibrations update).
Without an explicit orchestration kit, refresh becomes either:
a brittle set of ad-hoc “full rerun” rituals, or
an audit-only refresh result that silently accumulates drift.
G.11 is the Part G governing definition of the refresh orchestration kit: it turns typed refresh causes into scoped plans and auditable execution reports, while delegating all cause semantics and universal invariants to G.Core.
#Problem — Why naive refresh breaks comparability and legality
A refresh loop fails (conceptually) when any of the following happens:
Full-rerun mania. Minor edits (e.g., a single Bridge calibration) trigger pack-wide rebuilds without a traceable scope rationale.
Editionless telemetry. Telemetry signals are recorded without edition pins, making reruns non-comparable and parity-unreplayable.
Alias-as-semantics. Deprecated trigger labels (e.g., T0…T7) are treated as if they define meaning, fragmenting refresh semantics across patterns.
Silent crossings. Refresh actions implicitly change crossing assumptions (UTS/Path/policy pins) without a visible CrossingBundle.
Orchestration smuggles semantics. Refresh introduces new default behaviors (dominance/PortfolioMode/Γ-fold) or coerces partial orders into scalars “for convenience.”
#Forces — Minimal recomputation under strict invariants
Minimal scope vs. completeness. Refresh must be as local as possible (slice-scoped), but still include a defensible dependency closure over evidence and crossings.
Operational urgency vs. auditability. Refresh is triggered by run-time telemetry and decay, yet must remain auditable as Work (pins, refs, paths), not as opaque “decisions.”
Alias stability vs. semantic unification. Existing trigger labels must remain usable, but their meaning must be one governing definition and id-based.
Modularity vs. orchestration power.G.11 must coordinate harvesting/parity/shipping without re-implementing them or importing discipline-specific method semantics into core.
Policy-bound behavior vs. “smart defaults.” Ordering of refresh, priority heuristics, and budget handling are valuable—but must live as policy-bound extensions, not as hidden universal rules.
#Solution — RSCR-driven refresh as a P2W-scoped orchestration kit
By the G.CoreExpansion rule, the effective conformance ids / trigger‑kinds / pin‑obligations for G.11 are the manifest expansions (profiles/sets/pin‑sets) plus the explicit deltas above.
LegacyTriggerAliasIds (visible; labels only).{G.11:T0…T7} (docked via TriggerAliasMapRef; aliases are never semantic authorities).
G.11 defines a minimal kit of authoring-plane artefacts that make refresh explicit and auditable.
RefreshQueue (conceptual queue).
A queue of refresh candidates keyed by scope (PathSliceId preferred; PatternScopeId permitted).
Ordering, prioritization, and batching are policy-bound (and therefore extension-scoped), but every queue item carries canonical trigger kind ids.
RefreshPlan@Context (WorkPlanning plan item).
A planned refresh is a WorkPlanning object that does not execute Work and does not embed gate decisions. It declares:
RefreshPlanId (UTS-published id; editioned)
EntityOfConcernRef and ReferencePlane pins (by ref; no implicit widening)
The closure is a planning-time claim (“these slices are affected”), not a Work-time output.
4.3.3 Planning (P2W boundary).
Produce RefreshPlan@Context that schedules actions of the form:
RerunHarvest (delegates to G.2/G.1/governing definition; if used)
RerunParity (delegates to G.9)
RecomputeSelectionOrSetPublication (delegates to G.5)
RebindBridgeOrCrossing (delegates to G.7 and visibility harnesses)
UpdateEvidenceBindings (delegates to G.6)
ReshipPack (delegates to G.10)
UpdateBundle (delegates to G.8)
UpdateDashboardSlice (delegates to G.12)
EmitDeprecationNotice / EmitEditionBumpLog (publication units governed by this pattern)
4.3.4 Execution + audit.
Execute planned actions as Work (or Work-bound audit) and publish RefreshReport@Context.
Gating outcomes (admit / degrade / abstain) follow G.Core tri-state semantics and are recorded via policy ids and cited evidence paths, rather than as local bespoke statuses.
When a shipped pack, parity report, evidence path, dashboard slice, fairness audit, policy evaluation, or selector output consumes C.28, refresh planning includes causal-use sentinel causes when they can change supported use, unsupported use, support verdict, or downstream assurance:
profile refs, action-primitive refs, work-plan refs, physical, ethical, and operational constraint refs, target counterfactual distribution refs, admissible-use refs, and unadmissible-use refs
counterfactual-data identification/bounding shift
CausalIdentificationProfile, identifiedCounterfactualEstimateSupportBasis, bounds or partial-identification result
available data regime set refs, realized counterfactual data refs, counterfactual-data identification method refs, counterfactual-data bound refs, assumption refs
target-trial reporting shift
TargetTrialProtocolRecord, TargetTrialEmulationMappingRecord, applied intervention-effect support verdict
protocol refs, observational data source refs, eligibility, treatment, time-zero, and assignment mappings, follow-up and outcome mappings, emulation-gap refs, residual-confounding and sensitivity refs and additional-analysis refs
causal-fairness shift
CausalFairnessUseAuditCard, causal fairness support verdict, fairness assurance
protected-variable refs, decision-variable refs, and outcome-variable refs, permitted-path refs and prohibited-path refs, fairness estimand refs, causal-use question refs, support basis refs, support record refs and verdict refs
causal-representation-validation shift
CausalVariableRepresentationRecord, learned causal-variable admissible use
behavior-policy refs and evaluation-policy refs, sequential horizon refs, adaptive policy class refs, unit-history conditioning refs, overlap refs and support-basis refs, policy transportability refs, estimator and uncertainty refs
simulation-validation shift
simulationOnlyCounterfactualOutputBasis, bounded model-supported counterfactual use
counterfactual model assumption refs, simulation validation refs, CausalUseSupportStatement / CausalUseUnsupportedStatement refs, sensitivity and rival-cause refs
These sentinels do not mint new RSCRTriggerKindId values. They are domain-facing payload distinctions carried under the canonical trigger kinds governed by G.Core, usually evidence-publication edit, edition-pin change, policy-pin change, telemetry delta, freshness/decay event, or tokenization/name change.
Discipline-specific refresh strategies and generator-specific wiring live as GPatternExtension blocks. Scheduling, ordering, priority, and budget policy for the refresh queue are not a separate extension semantics: G.11 governs the required policy pins on RefreshQueue and RefreshPlan@Context, while A.15 keeps WorkPlanning separate from executed Work.
RSCRTriggerKindId[] (canonical ids recorded on triggers)
RSCRTriggerAliasId? (e.g., G.11:T0…T7 as labels only)
scope: PathSliceId[] | PatternScopeId
RSCRTriggerKindIds:{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent, RSCRTriggerKindId.CrossingBundleEdit, RSCRTriggerKindId.PenaltyPolicyEdit, RSCRTriggerKindId.MaturityRungChange, RSCRTriggerKindId.EvidencePathOrSourceRelationEdit}Notes (wiring-only): This block does not define what T0…T7 mean; it only preserves the labels and requires docking via G.Core.TriggerAliasMap.G11.
PathSliceId (archive/illumination scope) + policy-id for emitted telemetry triggers
RSCRTriggerKindIds:{RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange}Notes (wiring-only):G.11 does not restate QD semantics; it ensures pins are present so reruns are comparable.
TransferRulesRef.edition, EnvironmentValidityRegion (when OEE is declared by the governing patterns)
GeneratorFamilyId / TransferRulesRef wiring pins (as published by the governing definitions)
telemetry scope pins (PathSliceId, policy-id)
RSCRTriggerKindIds:{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.PolicyPinChange}Notes (wiring-only): Any OEE method semantics live with the governing definition; this module only wires refresh triggers to comparable reruns.
Scheduling strategies (bandit-style allocation, queueing, cadence policies, early stopping, or manual priority rules) may influence the order and budget of refresh work, but they do not define trigger meaning, action semantics, parity semantics, shipping semantics, or Part-G-wide defaults.
G.11 therefore treats scheduling as policy-bound refresh planning:
RefreshPriorityPolicyIdRef names the policy used to order or prioritize queue items.
BudgetDeclRef names the time, compute, cost, risk, or cadence boundary for the planned refresh.
RSCRTriggerKindId[] still comes from G.Core; scheduling policy does not mint trigger kinds.
planned refresh remains RefreshPlan@Context under WorkPlanning; executed refresh remains RefreshReport@Context or Work-bound audit.
If no priority or budget policy is declared, no scheduling heuristic is admissible by appearance; the plan must either use the ordinary queue order or state the missing policy pin as a blocker.
#Archetypal Grounding — System / Episteme (informative; Tell–Show–Show)
U.System illustration — Safety-critical maintenance loop (pump + calibration).
A centrifugal pump is serviced under a documented procedure (method description). Sensors report vibration drift (telemetry), and a calibration standard is updated (edition bump). G.11 does not “rebuild the whole maintenance doctrine”: it emits a refresh plan scoped to the affected inspection slices (paths) and publishes a refresh report with pins to the updated standard edition and the evidence paths. Deprecation notices are issued for obsolete thresholds in the procedure’s acceptance clauses (by governing pattern), preserving ID continuity.
U.Episteme illustration — Living review and benchmark pack (claims + parity).
A claim sheet behind a shipped SoTA pack changes (new evidence, retraction, or revised measurement definition). Bridges are recalibrated, affecting CL/plane penalties. G.11 ingests canonical trigger kinds, computes the minimal closure over affected PathSliceIds, schedules targeted parity reruns, then re-ships the pack through the pattern governing shipping semantics while publishing an edition bump log that makes the evolution replayable.
Arch bias (toward explicit wiring). Risk: authors feel “over-pinned.” Mitigation: keep the minimum pin set small; push scheduling sophistication into extensions/policies.
Gov bias (toward audit over speed). Risk: refresh becomes bureaucratic. Mitigation: the kit is intentionally thin (queue/plan/report), while action semantics remain delegated to governing definitions.
Onto/Epist bias (toward one governing definition semantics). Risk: teams try to localize trigger meaning for convenience. Mitigation: alias docking is allowed, but semantics stay in G.Core.
Prag bias (toward minimal recomputation). Risk: under-refresh if closure is too narrow. Mitigation: require closure rationale and allow explicit “scope wideners” as policy-bound pins.
Did bias (toward readable, reusable artefacts). Risk: oversimplified examples. Mitigation: maintain System+Episteme grounding and keep SoTA-echoing explicit.
A conforming G.11 artefact MUST satisfy the effective core conformance set implied by the GCoreLinkageManifest in G.11:4.1 (profile expansion + explicit deltas; delegated to G.Core).
Phase‑2 bridge clause: G.11 is conformant only if the relevant G.Core invariants and trigger discipline are satisfied.
CC‑G11.1 (Slice-scoped planning).
A conforming RefreshPlan@ContextSHALL be scoped to PathSliceId[] (preferred) or PatternScopeId[] and SHALL record canonical RSCRTriggerKindId for each planned cause. Pack-wide reruns MAY occur only if the declared dependency closure spans all slices; the closure rationale SHALL be recorded.
Prevents full-rerun mania while keeping a safety escape hatch explicit and auditable.
CC‑G11.2 (Edition discipline; QD/OEE wiring).
When QD and/or OEE are active, a conforming RefreshPlan@Context and RefreshReport@ContextSHALL satisfy the required pin/edition/policy wiring of the applicable extension blocks (G.11:Ext.QDRefreshWiring and/or G.11:Ext.OEERefreshWiring). .edition SHALL apply only on …Ref. Missing required pins SHALL block publication.
Keeps replayability strict while moving method‑specific pin lists into Extensions (Phase‑2 modularity).
CC‑G11.3 (Telemetry‑metric legality).
If a refresh publishes Illumination/QD/OEE outcomes, it SHALL publish Q/D/QD‑score (and any coverage/regret) as telemetry metrics and IlluminationSummary as a telemetry summary; these values SHALL be excluded from dominance unless a CAL policy explicitly promotes them, and the promoting policy‑id SHALL be recorded in SCR‑visible evidence bindings (via the cited governing patterns).
Prevents covert scalarisation and keeps “telemetry vs order” separation explicit.
CC‑G11.4 (Bridge penalties).
Any refresh reacting to Bridge/plane changes SHALL satisfy CC‑GCORE‑PEN‑1 (delegation), and SHALL publish CL/CL^k/CL^plane and the relevant Φ/Ψ/Φ_plane policy‑ids with loss notes so penalties route to R_eff only (F/G invariant).
Keeps penalty routing auditable during refresh.
CC‑G11.5 (Selector invariants).
Any orchestrated re‑selection or selected-set/archive update SHALL (i) satisfy CC‑GCORE‑SET‑1 (delegation), and (ii) cite the selector governing definition (G.5) under an unchanged admissible ComparatorSet (edition‑pinned where applicable), returning sets (Pareto/Archive) and introducing no scalarisation inside G.11.
Prevents refresh from changing order semantics.
CC‑G11.6 (Crossing visibility).
All refresh actions that touch cross‑context reuse SHALL satisfy CC‑GCORE‑CROSS‑1 (delegation) and the GateCrossing visibility harness (e.g., E.18): CrossingRef + BridgeCard + UTS + CL/Φ_plane policy‑ids. Missing/non‑conformant crossings SHALL block publication.
Prevents “silent crossings” under refresh.
CC‑G11.7 (Decay governance).
When refresh is triggered by freshness/decay events, the refresh outputs SHALL choose and record a governance outcome (Refresh / Deprecate / Waive) with budget notes (policy‑bound), and SHALL publish the decision via DeprecationNotice@Context (and related pins) and SCR‑visible evidence bindings (via G.6 / cited governing patterns).
Turns epistemic debt into explicit, comparable governance artefacts.
CC‑G11.8 (No default smuggling).
A conforming G.11 refresh artefact SHALL NOT introduce new defaults for PortfolioMode/dominance/Γ‑fold/guard behavior. If orchestrated steps rely on defaults, the artefact SHALL cite each default's governing definition (via G.Core.DefaultGoverningDefinitionIndex and the applicable governing patterns) rather than restating defaults inside G.11.
Protects default definition-citation discipline under orchestration pressure.
CC‑G11.9 (Targeted RSCR before republication).
Before any refresh result is republished downstream (e.g., parity report updates, pack re‑shipping, dashboard slice updates), the execution SHALL run or cite a targeted RSCR/regression check for the affected scope and record RSCRRefs[] (or equivalent) in RefreshReport@Context; exceptions SHALL be expressed as degrade/abstain outcomes (policy‑bound) rather than silent skips.
Preserves “refresh ≠ vibes” by making regression gating explicit and slice‑scoped.
CC-G11.10 (Causal-use refresh sentinels).
When a refreshed publication or output consumes C.28, a conforming RefreshPlan@ContextSHALL include causal-use sentinel payload distinctions when counterfactual realizability, counterfactual-data identification/bounding, target-trial reporting, causal fairness, causal representation validation, off-policy/causal-RL evaluation, or simulation validation can change supported use, unsupported use, support verdict, assurance, parity, or downstream selection.
Keeps moving causal SoTA from silently invalidating shipped causal-use results while preserving G.Core trigger governance.
#Common Anti-Patterns and How to Avoid Them (informative)
Anti-pattern
Symptom
Why it fails
Repair
Full-rerun mania
Any edit triggers a global rebuild
Costs explode; drift hides (no scope rationale)
Enforce slice-scoped plans (CC‑G11.1); require closure rationale for global scope
Editionless telemetry
Telemetry lacks …Ref.edition
Reruns are non-comparable; parity breaks
Block publication on missing pins (CC‑G11.2)
Alias-as-semantics
T* labels are treated as meaning
Trigger meaning fragments; regressions become untestable
Dock aliases via G.Core.TriggerAliasMap.G11; record canonical ids
Silent crossing during refresh
Refresh changes context or plane assumptions without crossings
Violates crossing visibility; penalties become hidden
Selective, replayable upkeep. Refresh becomes a controlled planning/execution loop rather than an implicit “maintenance vibe.”
Stable semantics with flexible operations. Trigger meaning is centralized (G.Core), while scheduling sophistication can evolve as policy-bound extensions.
Clear governing-definition assignment boundaries. Orchestration coordinates governing definitions; it does not redefine their semantics (shipping remains G.10, selection remains G.5, etc.).
Cost: pin discipline overhead. Authors must carry enough ids/editions/policies to make refresh comparable. This is intentional: it replaces hidden drift with explicit wiring.
G.11 is intentionally a thin orchestration governing definition:
The refresh loop is powerful enough to coordinate reruns and republishing, but too thin to become a second spec. That is why trigger semantics, invariants, and defaults are delegated to G.Core.
The kit is split across the P2W planning-to-work boundary so that WorkPlanning plan items remain planning references and executed work remains auditably executed work.
Alias stability is maintained by allowing trigger aliases (T0…T7) while prohibiting them from becoming semantic authorities.
Each entry follows: claim → practice → source → alignment → adoption status.
Continuous refresh is necessary in deployed evaluation pipelines.
Practice: production ML systems use monitoring + retraining / reevaluation triggers and insist on reproducibility hooks.
Source: Breck et al., The ML Test Score (2017); Amershi et al., Software Engineering for Machine Learning (2019).
Alignment: G.11 formalizes triggers as typed causes and forces edition/policy pins for replay.
Adoption: Adopt/Adapt (adapted to id-based, PathSlice-scoped refresh rather than “retrain everything”).
Non-stationarity requires explicit drift/decay handling, not ad-hoc updates.
Practice: continual learning emphasizes non-stationarity as a first-class maintenance condition.
Source: Parisi et al., Continual Lifelong Learning with Neural Networks (2019); De Lange et al., A Continual Learning Survey (2021).
Alignment: B.3.4 supplies decay semantics; G.11 wires decay events into refresh planning and controlled deprecation.
Adoption: Adapt (refresh of conceptual artefacts and evidence closures, not untracked model mutation).
Quality-Diversity requires archive semantics and comparability under descriptor/distance evolution.
Practice: QD methods treat the archive as the primary result and track changes under policy/edition conditions.
Source: contemporary QD families such as CMA‑ME (post‑2018) and differentiable QD lines (post‑2019).
Alignment: QD-specific meaning lives with the governing patterns; G.11:Ext.QDRefreshWiring ensures edition pins and scope pins exist so targeted archive refresh is admissible.
Adoption: Adopt (set/archive preservation; no covert scalarization).
Open-endedness co-evolves environments and agents; transfer rules must be versioned.
Practice: POET-class open-ended systems require explicit transfer rules and environment validity constraints.
Source: Wang et al., POET (2019) and subsequent POET extensions (2020+).
Alignment: G.11:Ext.OEERefreshWiring requires TransferRulesRef.edition and scope pins so refresh reruns remain comparable and auditable.
Adoption: Adopt/Adapt (adapted to Part‑G pin/UTS publication discipline).
Efficient orchestration benefits from bandit/early-stopping scheduling—but it must not become semantics.
Practice: modern hyperparameter/experiment scheduling uses bandit-style resource allocation and asynchronous early stopping.
Source: Async Hyperband / BOHB-style work (2018+) as representative post‑2015 scheduling practice.
Alignment: scheduling is expressed as G.11 queue/plan policy pins (RefreshPriorityPolicyIdRef, BudgetDeclRef) so core semantics remain stable and WorkPlanning stays separate from executed Work.
Adoption: Adapt (useful practice, but quarantined outside core norms).
Why this exists.C.21 defines what lawful “discipline health” slots are (CHR‑typed; scale/legality aware; freshness‑windowed), but it does not, by itself, provide a generation‑first method for producing edition‑pinned, evidence‑citable DHC time series that remain refreshable under RSCR.
G.12 is that dashboard method: it defines the dashboard kit surfaces (DHCSeries@Context, DHCRow@Context, DashboardSlice@Context, telemetry pins) and a pipeline for computing and publishing DHC readings without shadow specs, without illicit arithmetic, and without smuggling scalar winners out of partial orders or telemetry.
Modularity note.G.12 governs dashboard publication units and wiring only. It does not govern CN-Spec, CG-Spec, CHR, CAL, selection semantics, evidence semantics, shipping, or refresh heuristics. It binds to those governing definitions via refs/pins/editions/policy‑ids and keeps any method‑/generator‑specific panels strictly inside Extensions (GPatternExtension blocks).
Dashboards routinely drift or become illegal when they:
mix scales (ordinal treated as interval; “average maturity level”),
hide normalization and re‑parameterization (“normalized score” with no CN‑Spec pins),
silently cross Contexts or planes (implicit reuse without explicit Bridge/Plane routing),
fail to pin editions of computation methods, descriptor spaces, or distances,
turn selected sets or archives into a single scalar “winner” by dashboard fiat,
cannot refresh selectively (no actionable telemetry pins; only narrative “this changed”).
We need a dashboard kit that makes the method of obtaining dashboard values explicit and auditable, while keeping universal invariants governed in G.Core.
Legality and comparability are governed by CN-Spec and CG-Spec. Dashboards must not invent local legality/acceptance/normalization “mini‑specs”; they pin and cite CN‑Spec and CG‑Spec surfaces as required by G.Core conformance.
Ordinal discipline is non‑negotiable. The most common dashboard failure mode is illicit arithmetic on ranks/categories; the kit must make “compare‑only” enforceable.
Set‑returning discipline survives into views. Dashboards must not silently scalarize partial orders or selector selected-set results; any scalarization/promotion is an explicit governing-pattern policy cited through G.Core conformance; semantics are governed by the relevant pattern or policy.
Edition‑awareness is the difference between “trend” and “drift”. If the method definition changes, the dashboard must either (i) fork series edition, or (ii) emit telemetry and refresh slices under pinned conditions.
RSCR must be actionable. Causes are emitted as canonical ids (typed trigger kinds + id‑valued pins), not prose.
#G.12:4 — Solution — Compute and publish DHC series admissibly, with RSCR-ready telemetry
This pattern is core‑invariant‑bearing and therefore binds to G.Core by declaration (not by restating invariants here).
GCoreLinkageManifest (G.12)(normative; expands per G.Core:4.2)
Effective obligations/pins/triggers are computed as union(expand(sets), explicit deltas) under Nil‑elision.
RSCRTriggerKindIds := {
RSCRTriggerKindId.LegalitySurfaceEdit
}
(Any additional causes required by optional dashboard panels MUST be introduced only by the corresponding GPatternExtension blocks in G.12:4.9.)
DefaultsConsumed := ∅(Default-citation discipline for DefaultId.PortfolioMode and DefaultId.DominanceRegime is only relevant when selection outputs with PortfolioMode are consumed; see G.12:Ext.PortfolioTelemetry.)
CorePinsRequired(pattern delta; pin names only; all are id‑valued unless noted) := {
DHCSeriesId,
TargetSlice(USM tuple; varies only by Γ_time across rows; no implicit “latest”),
Γ_time(time selector / freshness window; required per row; series MAY additionally declare a window‑family spec),
DHCSlotId[](typed DHC slots governed by C.21; each resolves to CharacteristicId + scale/unit/polarity + reference plane binding + lane discipline),
DHCMethodSpecRef.edition,
DHCMethodRef.edition,
PathSliceId[]
}
(Nil‑elision applies. All other definition pins are conditional: they MUST appear only when actually used and when their governing pattern/extension is present (e.g., UNM/normalization pins, QD/OEE telemetry pins, transfer rules pins, pack inclusion pins).)
All objects below are notation‑independent; serialisations (if any) live under shipping or interop governance, not here.
(1) DHCSeries@Context(UTS‑published dashboard series; C.21‑grounded)
A time‑indexed publication of computed DHC readings for a Discipline × ContextSlice, aligned with U.DHCSeries semantics from C.21 and pinned to method/governing spec refs.
Minimal fields (conceptual; ids/pins only):
DHCSeries@Context := ⟨ DHCSeriesId, CG-FrameContext, entityOfConcern := ⟨GroundingHolon, ReferencePlane⟩, TargetSlice, // USM tuple; time series varies Γ_time across rows (explicit, no implicit “latest”) DHCSlotId[], // slot set selected from C.21 (typed DHC slots; not “just Characteristic ids”) DHCPackRef.edition?, DHCMethodSpecRef.edition, WindowSpec?, // optional window-family spec used to generate per-row Γ_time CNSpecRef.edition, CGSpecRef.edition, EvidenceGraphId?, // if resolvable; else row-level Path pins suffice DashboardSliceId[]?, // published view slices (optional) TelemetryPinSetId? // wiring to refresh (conceptual) ⟩
(2) DHCRow@Context(one timepoint / window reading; Work/Audit‑citable)
A single computed row of the series.
(3) DashboardSlice@Context(view; non‑semantic)
A view‑friendly grouping over one or more series/rows. It MUST NOT introduce new aggregation/legality semantics; it is a projection over already computed, pinned, citable rows.
DashboardSlice@Context := ⟨ DashboardSliceId(UTS), DHCSeriesId(UTS)[], SliceAnnotations?, // labels, grouping metadata, explanatory text ViewSpecId?, // view template id (policy‑bound; no semantics implied) IncludedRowIds? ⟩
(4) DHCTelemetryPin(refresh wiring pin; id‑based causes)
A conceptual telemetry pin emitted to refresh/orchestration (governed by G.11) with canonical trigger kind ids.
A1. Select the DHC slot set (governed by C.21).
Choose DHCSlotId[] from C.21 (typed DHC slots), and declare the series scope explicitly as TargetSlice (USM tuple) plus an explicit time selector (Γ_time per row; optionally a WindowSpec that generates the row windows). Do not restate slot semantics in the dashboard kit; cite the C.21 governing definitions.
A2. Bind governance card and legality gate (governing definitions: A.19, G.0).
Pin CNSpecRef.edition and CGSpecRef.edition. Any normalization or numeric comparability assumptions are expressed by explicit CN‑Spec artefacts (ids/refs) and any numeric legality requirements cite CG‑Spec artefacts (SCP / MinimalEvidence / Γ‑fold pins as applicable). The dashboard does not introduce local “shadow specs”.
If the dashboard series/slice actually uses cross‑Context or cross‑plane routing, it MUST additionally pin the relevant crossing and penalty‑policy surfaces as ids (Bridge/CL/plane ids, Φ/Ψ/Φ_plane policy‑ids, PlaneMapRef.edition?) and cite their governing patterns (typically G.7 for bridge calibration/CL kits, pinned through G.Core). The dashboard MUST NOT encode a dashboard‑local “penalty regime”.
A3. Pin computation methods (governed by C.21).
For each slot/method used to compute a time series value, record DHCMethodSpecRef.edition and DHCMethodRef.edition (table‑backed, per C.21). The dashboard series is edition‑aware: if a method spec changes, the dashboard either forks the series edition or emits telemetry and refreshes under explicit pins.
A4. Declare optional panels via Extensions only.
If the dashboard depends on (i) selector set-result outputs, (ii) QD illumination / archive telemetry, (iii) open‑endedness telemetry, (iv) maturity ladder views, or (v) pack inclusion, then the relevant GPatternExtension block(s) in G.12:4.9 MUST be present and their pins MUST be satisfied.
Stage B — Compute rows (run‑time; Work/Audit)
B1. Resolve evidence by Path (governed by G.6).
Compute rows from evidence cited as PathSliceId[] (and PathId[] when needed), under the declared window/freshness regime. Preserve lane discipline and handle missingness using tri‑state stances governed by G.Core.
B2. Compute slot values using pinned methods (governed by C.21).
Compute each slot value by applying the pinned DHCMethodRef.edition/DHCMethodSpecRef.edition under the pinned governance card and legality gate. Enforce “no illicit arithmetic” for ordinals/categoricals as a dashboard‑kit obligation (see CC‑G12.*).
Any cross-Context or cross-plane use is expressed only via explicit crossing pins (Bridge/Plane routing) and policy ids governed by G.Core.
B3. Emit RSCR‑actionable telemetry pins (governing definition: G.11).
When any of the declared pins/editions/policies/windows/evidence slices change, emit DHCTelemetryPin events with canonical RSCRTriggerKindId and payload pins sufficient for slice‑scoped refresh planning.
Stage C — Publish series & slices (run‑time; publication)
C1. Publish DHCRow@Context and DHCSeries@Context as UTS publication units.
Mint/publish UTS rows with Tech/Plain twins and include the required pins (window, reference plane, method editions, evidence paths).
C2. Publish DashboardSlice@Context as a view‑only projection.
Slices are groupings/annotations over already computed rows; they must not redefine legality, acceptance, or scalarization.
C3. Wire refresh via telemetry pins (no orchestration governance).
Dashboards emit pins; refresh orchestration remains governed by G.11.
Extension rule (Phase‑2). Anything method‑, generator‑, or view‑family‑specific belongs here, as GPatternExtension modules. These modules may add mode‑specific definition pins and additional RSCR trigger kinds, but MUST NOT redefine Part‑G‑wide invariants or defaults.
#G.12:Ext.SoTAPalette — SoTA palette & DHC alignment hooks (optional)
PatternScopeId:G.12:Ext.SoTAPaletteGPatternExtensionId:SoTAPaletteGPatternExtensionKind:InteropSpecificGoverningPatternId:G.2(SoTA palette + DHC alignment hooks semantics are governed by G.2; G.12 only wires them)Uses:{G.2}⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum):
SoTA_PackRef.edition?
DHC-SenseCellId[]?(when series pins to DHC alignment hooks / sense‑cell inventories)
PatternScopeId:G.12:Ext.PortfolioTelemetryGPatternExtensionId:PortfolioTelemetryGPatternExtensionKind:MethodSpecificGoverningPatternId:G.5(PortfolioMode citation plus selected-set semantics and set‑return discipline)Uses:{G.5, G.6}⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum):
TaskSignatureRef?(when PortfolioMode semantics depend on TaskSignature traits)
DominanceRegime(cite the governing definition for DefaultId.DominanceRegime; publish the resolved regime, do not invent a local default)
PortfolioMode(cite the governing definition for DefaultId.PortfolioMode; publish the resolved mode)
SCRId/DRRId(or equivalent selector evidence pins, when dashboard row depends on selector outcomes)
DefaultsConsumed: {DefaultId.DominanceRegime, DefaultId.PortfolioMode} (cite governing definitions through G.Core.DefaultGoverningDefinitionIndex; no local defaults)
RSCRTriggerKindIds (delta):∅(base triggers suffice; any extra triggers must be explicit)
Notes (wiring‑only):
The dashboard may visualise selected-set / Archive telemetry, but MUST keep set‑returning semantics; any scalar “headline number” is a view projection, not a legality‑bearing decision.
CharacteristicSpaceSpecRef.edition?(iff the descriptor or characteristic space is editioned as a published surface; required for view reproducibility)
InsertionPolicyRef
EmitterPolicyRef?
ArchiveSnapshotRef?(id/pin for the published archive snapshot, if any)
PathSliceId[](scope for refresh; slice‑keyed)
RSCRTriggerKindIds (delta):∅(base trigger set already includes RSCRTriggerKindId.TelemetryDelta; add only genuinely additional kinds here)
Notes (wiring‑only):
Illumination/coverage signals are treated as telemetry. Any promotion of telemetry into selection dominance is governed elsewhere (typically CAL policy; pinned through G.Core).
If descriptor characteristics are surfaced as published identifiers (not just local UI text), they MUST follow the Tech/Plain twin-label discipline (UTS Name Cards); otherwise they remain non-normative view annotations.
#G.12:Ext.OpenEndedTelemetry — open‑endedness / transfer telemetry panel
PatternScopeId:G.12:Ext.PackInclusionGPatternExtensionId:PackInclusionGPatternExtensionKind:InteropSpecificGoverningPatternId:G.10(shipping semantics are governed by G.10)Uses:{G.10}⊑/⊑⁺:∅
RequiredPins/EditionPins/PolicyPins (minimum):
SoTA‑PackId
DashboardSliceId(UTS)(or DHCSeriesId(UTS) when shipping series directly)
CNSpecRef.edition, CGSpecRef.edition(as shipped pins, per G.10 wiring)
RSCRTriggerKindIds (delta):∅
Notes (wiring‑only):
This module is a wiring stub: it does not define shipping behaviour; it only states which dashboard artefacts may be cited by SoTA‑Pack(Core).
PatternScopeId:G.12:Ext.ViewFamilySeedGPatternExtensionId:ViewFamilySeedGPatternExtensionKind:Phase3SeedGoverningPatternId:governing pattern not yet selectedUses:{}⊑/⊑⁺:∅
Notes (Phase‑3 seed; non‑normative):
Placeholder for advanced dashboard view families (e.g., embedding‑based similarity panels, predictive drift detectors, change‑point overlays). Any such module must remain policy‑bound and must not introduce new Part‑G‑wide norms.
The pattern satisfies the effectiveG.Core obligations declared by GCoreLinkageManifest (G.12) (profiles/sets/deltas expanded per G.Core:4.2).
Evidence: the manifest is present; required pins/defaults/triggers are accounted for; no local restatement overrides core governing definitions.
CC‑G12.1
DHC slot typing (C.21‑grounded). Every published dashboard value is indexed by a C.21‑authoredDHCSlotId (typed DHC slot: CharacteristicId + scale/unit/polarity + reference plane binding + lane discipline) and is scoped by an explicit TargetSlice + Γ_time.
Evidence: row/series references DHCSlotId and pins ReferencePlane and Γ_time (or a series WindowSpec that yields row Γ_time).
CC‑G12.2
Edition discipline (no drift). Every published time‑series value carries DHCMethodRef.edition and any other definition‑pins actually used to obtain it (e.g., DescriptorMapRef.edition, DistanceDefRef.edition, UNM_id, NormalizationMethodInstanceId[], ComparatorSetRef.edition?). No free‑text versioning.
Check that .edition appears only on …Ref; check presence of all definition pins used by the pipeline; extension pins appear only when their extension blocks are present.
CC‑G12.3
Spec citation for numeric operations (no shadow specs; no illicit arithmetic). Any numeric operation in the dashboard pipeline is legal only under explicit CG‑Spec and CN‑Spec pins (e.g., SCPRef.edition, MinimalEvidenceRef.edition, ΓFoldRef.edition? when used), and any normalization is explicit (UNM_id + NormalizationMethodInstanceId[] etc). Ordinal/categorical slots remain compare‑only (no illicit arithmetic).
Check that operations cite pinned governing definitions; reject “normalize, then compare” without explicit UNM pins; reject arithmetic over ordinal slots unless the governing definition declares an admissible mapping.
CC‑G12.4
Set‑returning selection is preserved. If the dashboard consumes selection / set-result outputs, it MUST preserve set‑return semantics and MUST publish the resolved DominanceRegime and PortfolioMode by citing each default's governing definition (via G.Core.DefaultGoverningDefinitionIndex) rather than inventing local defaults. Any promotion of illumination/telemetry into dominance MUST cite the governing-pattern policy (typically CAL) and be auditable via evidence paths.
Check for set-result outputs; check that any scalar headline is view‑only; check citations to default governing definitions/policies.
CC‑G12.5
UTS publication discipline.DHCSeries@Context and its rows (and any published slices) are published as UTS publication units with Tech and Plain twins plus stable identifiers; deprecations and edition bumps follow the canonical UTS discipline.
Check stable ids and twin labels; check that publication does not smuggle GateDecision values as authoritative UTS publication content.
CC‑G12.6
Bridge/plane routing is explicit when used. If a series crosses contexts or planes, the rows MUST cite the Bridge/PlaneMap routing (BridgeId[], CL/CL^k/CL^plane, Φ/Ψ/Φ_plane policy‑ids, PlaneMapRef.edition?) and respect penalty routing to R_eff only (semantics pinned through G.Core).
Check presence of crossing pins when contexts or planes differ; check that any loss is expressed via R‑lane impact only.
CC‑G12.7
Telemetry sufficiency for slice‑scoped RSCR. Emitted dashboard telemetry pins MUST (i) use canonical RSCRTriggerKindId, (ii) include scope (PathSliceId[] or PatternScopeId) and the touched …Ref.edition/policy/window pins, and (iii) block publication when required pins are missing. Each published row is evidence‑citable by PathSliceId[] under explicit Γ_time.
Check: no free‑text causes; payload includes path/window/editions/policies; missing pins block publish; row has PathSliceId[] and Γ_time.
CC‑G12.8
Extension gating. If any fields and pins governed by the extension appear, the corresponding G.12:Ext.* module is present and satisfied.
Dashboards become reproducible artefacts, not screenshots. A DHCRow@Context is re‑derivable under pinned editions and evidence windows.
Selective maintenance becomes possible. Telemetry pins let G.11 refresh what changed (path slice / window / method edition), rather than rerunning the entire pipeline.
Illicit scalarization is structurally discouraged. Set‑returning and CN/CG-governed semantics are preserved into the dashboard layer.
Builds on:G.Core, C.21, G.6, G.11, A.19, G.0, F.17/F.18, E.5.2, E.10.
Coordinates with:G.5(when selector set-result outputs are consumed), G.7(when crossings/plane routing or CL/Φ/Ψ/Φ_plane policy pins are used), G.8(when maturity ladder view is included), G.10(when dashboard slices are shipped).
Constrains: dashboard consumers: dashboards are projections over pinned, evidence‑citable rows; they do not mint new governing-spec semantics.
Declare the dashboard series scope: TargetSlice (USM tuple), ReferencePlane, and an explicit Γ_time regime (per‑row; optionally a WindowSpec that yields the row windows).
Select DHCSlotId[] and cite C.21 (do not restate slot semantics).
Pin DHCMethodSpecRef.edition and DHCMethodRef.edition for every computed slot/value (plus any other definition pins actually used).
Ensure rows are evidence‑citable by PathSliceId[] and include explicit Γ_time (row is run‑time: DesignRunTag = run).
Publish UTS publication units with twins and the required pins.
If SoTA palette hooks / selection / QD / OEE / maturity / shipping panels are needed, add the corresponding G.12:Ext.* blocks and satisfy their pins.
#G.12:11 — Worked micro‑examples (informative; SoTA‑oriented)
(A) Decision‑making discipline dashboard (multi‑tradition).
Slots (from C.21): ReproducibilityRate (freshness‑windowed), StandardisationLevel (ordinal), AlignmentDensity (bridge density over DHC‑SenseCells), MetaDiversity (operator family diversity), DisruptionBalance (target‑band metric).
Evidence: citation graphs, benchmark traces, and bridge calibrations are referenced via PathSliceId[].
Optional panels:
G.12:Ext.PortfolioTelemetry to visualise set‑returning method selected sets without forcing a scalar winner.
G.12:Ext.QDTelemetry to include illumination/archive telemetry using modern QD families (e.g., CMA‑ME / policy‑gradient QD variants / surrogate‑assisted illumination lines) as telemetry.
G.12:Ext.OpenEndedTelemetry to include open‑endedness telemetry (environment diversity / transfer events) using POET‑style and related post‑2015 open‑ended generation families, while keeping such signals in telemetry unless an explicit governing-pattern policy promotes them.
Status. Stable (Phase‑2 universalized; G.Core linkage explicit)
Normativity. Normative when used (when any G.13 surface is authored/emitted/consumed); informative otherwise.
Non‑duplication note (Phase‑2 universalization). This pattern does not restate Part‑G‑wide invariants (CN/CG spec-ref governing-definition assignment, crossing visibility, penalty routing, set‑return discipline, typed RSCR triggers, Default Governing Definition Index, Δ‑discipline). Those are governed in G.Core and referenced here via the linkage manifest and CC delegations (cite, don’t duplicate).
FPF already supports lawful characterization, evidence wiring, selector‑side set returns, parity, shipping, dashboards, and refresh. What remains frictionful in practice is interoperability with external scholarly indexes and discipline repositories (concept registries, paper/claim graphs, dataset registries, taxonomy stores, “science‑of‑science” indicator feeds), which teams routinely use as inputs when authoring a SoTA discipline pack.
Without an explicit conceptual interop kit, authors tend to build one‑off pipelines whose “implied semantics” leak into the framework: edition drift becomes invisible, cross‑plane/context reuse becomes implicit, and external signals quietly start acting like a shadow governing spec ref.
G.13 provides the missing kit: conceptual registration, alignment, and telemetry hooks that let external sources be wired into the Part‑G pipeline (G.2 → G.5 → G.9 → G.10 → G.11, and optionally G.12) while preserving Part‑G invariants via G.Core.
External sources publish claim‑adjacent signals (citations, concept graphs, “task/method” tags, replication links, dataset usage, disruption‑style indicators, benchmark metadata). These are useful for generation (palette building, declared set-result exploration, candidate bridge discovery), not only for audit. But typical interop practices create predictable failure modes:
CN/CG spec-ref leakage. External numeric signals get treated as if they were lawful “scores” without explicit binding to CHR/CAL/CG surfaces.
Implicit crossings. Cross‑context and cross‑plane reuse happens through opaque transformations, without explicit exposure of the crossing bundle pins needed downstream.
Edition drift + refresh brittleness. Snapshots change, schemas drift, indicator definitions get revised; without edition‑pinned interop surfaces and typed trigger causes, parity and dashboard stability degrade.
Evidence disconnect. “Derived features” are produced without explicit EvidenceGraph anchoring, making later refutation/repair expensive.
Format‑as‑norm. A convenient serialisation (KG export, JSON schema, RO‑Crate, etc.) becomes treated as the specification, undermining notation independence.
Payload‑pin note (informative). When emitting RSCR triggers for interop‑driven changes, payload pins should include the edited edition/policy identifiers, the impacted scope, and the applicable crossing‑visibility pins (per GCorePinSetId.PartG.CrossingVisibilityPins) when crossings/UTS/paths are involved.
Intent. Create a stable, citable “source card” so downstream artefacts can pin the card edition via ExternalIndexRef.edition, while the provider snapshot remains visible as ExternalEdition (do not echo provider snapshot ids into downstream cards; cite refs instead).
ClaimMapperCard@Context — a conceptual “mapping recipe” that yields FPF‑native artefacts from an external source.
This is not a shadow legality gate. It is an interop surface that cites governing definitions (A.19, G.0, G.3, G.4) and publishes the required pins for downstream audit/refresh.
When cross‑plane or cross‑context reuse is implicated, the alignment outputs must use the existing crossing bundles (see G.Core linkage).
Avoid “edition echo”: downstream artefacts cite ExternalIndexRef.edition and ClaimMapperRef.edition (and optional PlaneMapRef.edition / ScaleEmbeddingSpecRef.edition) rather than copying snapshot ids/editions as free fields.
SoSFeatureTransform@Context — declares how external signals become CHR‑typed SoS features (for DHC/dashboard usage and/or SoS‑LOG rule evaluation).
Design intent. Make any representation alignment explicitly constrained and edition‑pinned, instead of silently “creating a new scale”.
LEX/UTS note (informative).ScaleEmbeddingSpec is a new LEX head; when it mints a public id it must be published to UTS with twin labels (see G.Core / UTS profile).
IndexTelemetryPin — an emitted refresh input that makes interop changes RSCR‑visible.
Register source editions. Author ExternalIndexCard@Context for each external source/snapshot used for SoTA authoring, including ExternalEdition and the entityOfConcern plane anchor.
Author mapping recipes. Create ClaimMapperCard@Context describing which FPF artefacts are produced (ClaimSheets, BridgeHints, feature sets, UTS proposals), and which policies/specs constrain the mapping (policy refs + optional PlaneMapRef / ScaleEmbeddingSpecRef).
Produce FPF‑native inputs. Use the alignment recipe outputs as inputs to:
G.3 CHR typing (when numeric signals are formalized as CHR characteristics/scales/coordinates),
G.4 acceptance/threshold policies (when a downstream decision requires explicit CAL policy rather than telemetry),
G.12 dashboards (when derived SoS features are used as DHC slots).
Feed selection/parity/shipping without smuggling semantics.
G.5 consumes the produced artefacts under its own governing spec refs and returns set‑valued outcomes (selector semantics remain governed by G.5 + G.Core).
G.9 parity consumes pinned editions/windows and produces traceable parity reports.
G.10 shipping may include interop surfaces as cited publications or records; G.13 does not govern shipping.
Emit telemetry and refresh causes. Any change in external editions, alignment policies, plane maps, or embedding specs emits:
a canonical RSCRTriggerKindId (per G.Core),
a scope (PathSliceId[] and/or PatternScopeId),
payload pins (editions/policies/UTS rows),
enabling G.11 to plan slice‑scoped refresh.
#Interfaces — minimal I/O standard (conceptual; kit‑only)
G.13 keeps provider/method specifics out of the kit core. Any such specificity appears as GPatternExtension blocks with stable PatternScopeIds. These modules are wiring‑only: they bind pins/editions/policies and cite the governing pattern rather than redefining semantics.
PatternScopeId:G.13:Ext.ExternalIndexProviderWiringGPatternExtensionId:ExternalIndexProviderWiringGPatternExtensionKind:Phase3SeedGoverningPatternId:governing pattern not yet selected(Annex/Interop or a future dedicated interop-governing pattern)Uses:{G.13}⊑/⊑⁺:∅RequiredPins/EditionPins/PolicyPins (minimum):
ExternalIndexType
ExternalEdition(as published on ExternalIndexCard@Context)
RSCRTriggerSetIds / RSCRTriggerKindIds:∅(covered by G.13:4.1)Notes (seed; wiring‑only):
Provider‑specific ingestion choices (e.g., OpenAlex‑class, Crossref‑class, ORKG‑class, discipline repositories) must not become Part‑G‑wide norms in Phase‑2. This module only records which provider cards exist and which editions/policies are pinned.
PatternScopeId:G.13:Ext.EmbeddingBasedAlignmentGPatternExtensionId:EmbeddingBasedAlignmentGPatternExtensionKind:Phase3SeedGoverningPatternId:governing pattern not yet selected(Annex/Interop or a future dedicated interop-governing pattern; Phase-3 governing-pattern decision required)Uses:{G.13, A.19, E.5.2}⊑/⊑⁺:∅RequiredPins/EditionPins/PolicyPins (minimum):
ScaleEmbeddingSpecRef.edition
NormalizationMethodRef.edition?(when a declared normalization/representation transform is used)
MappingPolicyRef
EvidenceGraphId?(when evidence paths for alignment decisions are published)
RSCRTriggerSetIds / RSCRTriggerKindIds:∅(covered by G.13:4.1)Notes (wiring‑only; post‑2015 practice orientation):
“Embedding‑based” techniques are treated as declared transforms constrained by ScaleEmbeddingSpec and/or NormalizationMethod references, rather than as implicit semantics.
The module binds editions and policies; it does not define what is “similar enough”.
RSCRTriggerSetIds / RSCRTriggerKindIds:∅(covered by G.13:4.1)Notes (seed; wiring‑only):
This module exists to prevent “ID drift by renaming” for externally sourced entities. It is intentionally a Phase‑3 seed until its governing pattern is selected.
System.Software architecture portfolio design.
Register an external scholarly index edition for “software architecture” concept neighborhoods. Align extracted technique/tactic claims into ClaimSheets and derive a CHR‑typed feature set (e.g., evidence depth, maturity). Use G.5 to select a set of tactics under multi‑objective tradeoffs, and ship a SoTA pack that cites the interop surface.
Episteme.Science‑of‑science discipline dashboard.
Align external claim graphs (replication, standardisation, disruption‑style proxies) into CHR‑typed features for DHC series. Publish a dashboard slice that cites the external edition and alignment policy; refresh triggers fire when the external edition updates.
OEE/QD.Open‑ended environment generation.
Register external environment/task taxonomies as index cards. Align them into generator‑family registries (as cited publications or records), keeping coverage/regret strictly as telemetry inputs. Use refresh to re‑align when the taxonomy edition changes.
Vendor/tool bias. The kit names conceptual surfaces only; it avoids vendor‑specific file formats or tooling claims.
Metric‑authority bias. External indicators are treated as inputs that must be typed, pinned, and evidenced; they are not authority by default.
Representation bias. Representation/embedding choices are forced into explicit Spec + edition pins (no hidden semantics).
Discipline bias. Interop supports pluralism by preserving explicit crossings and versioned alignments instead of forcing a single canonical external ontology.
#Conformance Checklist (CC‑G13; applies when G.13 surfaces are used)
CC‑G13‑CoreRef.(normative)G.13 implementations MUST satisfy the effectiveG.Core obligations declared by G.13:4.1 (GCoreLinkageManifest), including trigger typing, Default Governing Definition Index citation, and crossing‑visibility pin discipline.
CC‑G13‑InteropIsNotASpecRefSurface.(delegated) Interop surfaces MUST NOT introduce shadow legality/comparability gates; they cite CN‑Spec/CG‑Spec/CHR/CAL governing definitions and publish pins instead.
→ delegate to CC‑GCORE‑CN‑CG‑1.
CC‑G13‑CrossingsAreExplicitWhenInteropTouchesPlanesOrContexts.(delegated) Any cross‑plane/context reuse implied by alignment MUST be made explicit through the crossing visibility discipline.
→ delegate to CC‑GCORE‑CROSS‑1.
CC-G13-PlanePenaltyPoliciesArePinned.(local; governing-definition citing) If PlaneMapRef is used (or alignment implies plane‑level penalties), interop surfaces MUST publish the relevant policy‑id pins via the crossing‑visibility discipline, and any such policies MUST satisfy the constraints governed by CG‑Spec (cite CC‑G0‑Φ). Interop surfaces MUST NOT define interop‑local penalty functions.
CC‑G13‑SetReturnPreserved.(delegated) Interop MUST NOT introduce hidden scalarisation or forced single‑winner selection.
→ delegate to CC‑GCORE‑SET‑1.
CC‑G13‑DefaultClaimsAreCitationsOnly.(delegated) Any mention of defaults (e.g., dominance regime, PortfolioMode) is a citation to the default's governing definition through G.Core.DefaultGoverningDefinitionIndex, not a local default statement.
→ delegate to CC‑GCORE‑DEF‑1.
CC‑G13‑EditionDisciplineForInteropCards.(local)ExternalIndexCard@Context and ClaimMapperCard@ContextMUST expose edition pins (ExternalIndexRef.edition, ClaimMapperRef.edition). Any interop surface published to UTS MUST cite the relevant …Ref.edition values (incl. PlaneMapRef.edition?, ScaleEmbeddingSpecRef.edition?) when present.
FPF edition keys MUST appear only on …Ref.edition pins when a reference is present. Provider snapshot labels (e.g., ExternalEdition on ExternalIndexCard@Context) may exist on the source card, but MUST NOT be copied into downstream artefacts as free‑floating “edition fields”; downstream artefacts cite the corresponding …Ref.edition pins instead.
In particular, interop transforms MUST NOT perform illicit arithmetic on ordinal/compare‑only scales (e.g., averaging or subtraction); any aggregation must be via lawful CAL operators with explicit scale legality (cite A.18 / CC‑G0‑CSLC).
CC‑G13‑SoSFeaturesAreCHRTypedAndLegal.(local; governing-definition citing) If SoSFeatureTransform@Context is used, produced SoS features MUST be CHR‑typed via FeatureTypingRefs{CharacteristicId/ScaleId/CoordinateId} (governed by G.3) and any legality/units obligations must be satisfied via CSLC/CG governing definitions (cite A.18 / G.0 / G.4; do not invent interop‑local legality gates).
CC‑G13‑TelemetryEmitsCanonicalTriggerKinds.(delegated) Interop‑driven changes (external edition bumps, mapping policy changes, plane‑map edits, embedding‑spec edits) MUST emit canonical RSCRTriggerKindId causes with explicit scope and payload pins.
→ delegate to CC‑GCORE‑TRIG‑1, CC‑GCORE‑TRIG‑2, CC‑GCORE‑TRIG‑3, CC‑GCORE‑TRIG‑4.
CC‑G13‑IDContinuityForExternallySourcedIdentifiers.(delegated) Interop publication MUST follow Δ‑discipline: no “renaming by meaning”; use aliases/deprecations as required.
→ delegate to CC‑GCORE‑ID‑1, CC‑GCORE‑ID‑2.
CC‑G13‑NotationIndependence.(local) Conformance is judged on the conceptual objects in G.13:4.2. Any serialisation is non‑normative and must not redefine semantics.
(Cites E.5.2 for notation independence.)
Anti‑pattern: “Format == spec”. Treating an export schema (KG dump, JSON, RO‑Crate, etc.) as the normative definition.
Remedy: Keep ExternalIndexCard / ClaimMapperCard / InteropSurface as the conceptual specification; treat serialisation as an appendix/tooling concern.
Anti‑pattern: Hidden scale invention. An embedding similarity becomes a “score” without explicit typing/binding.
Remedy: Require ScaleEmbeddingSpecRef + edition pins and bind any derived features through CHR/CAL governing definitions.
Anti‑pattern: Implicit plane/context reuse. Reusing external concept graphs across contexts without explicit crossing pins.
Remedy: Publish crossing visibility pins and cite bridge/plane governing definitions; never fuse contexts “inside the aligner”.
Anti‑pattern: Edition‑free dashboards. Feeding externally derived rows into dashboards without pinned editions/policies.
Remedy: Pin ExternalIndexRef.edition and ClaimMapperRef.edition; emit RSCR triggers on changes.
Anti‑pattern: Interop asserts defaults. “Interop decides dominance regime / PortfolioMode.”
Remedy: Treat defaults as citations only (the relevant governing definition is cited through G.Core.DefaultGoverningDefinitionIndex).
Interop becomes refresh‑ready. External source drift produces typed RSCR causes with scopes/payload pins; refresh becomes slice‑scoped rather than global guesswork.
Generation‑first authoring becomes cheaper. External sources become controlled inputs into SoTA synthesis and declared set-result exploration, not ad‑hoc audit decoration.
FPF is a conceptual framework for disciplined creative work, not a data governance system. External scholarly infrastructure is valuable precisely because it provides fast, wide coverage—but without an explicit interop kit, that value is purchased by silently importing semantics (implicit comparisons, unpinned editions, hidden transformations).
G.13 resolves the tension by turning “interop” into first‑class conceptual wiring: cards/surfaces that pin editions, cite governing patterns, expose provenance hooks, and produce typed refresh causes, while leaving domain/tool specifics in Extensions (or Phase‑3 governing definitions).
#SoTA‑Echoing (post‑2015, for orientation; non‑normative)
Scholarly claim graphs & open indexes. Open research KGs and open scholarly indexes encourage claim‑level representations and concept taxonomies as interop substrates (post‑2015 ecosystem: KG‑style contribution graphs; open indexing initiatives). Treat these as sources registered via ExternalIndexCard, not as governing patterns.
Neural representations for scientific text. Transformer‑based scientific encoders (e.g., SciBERT‑class; citation‑aware paper representations such as SPECTER‑class; later retrieval‑oriented scientific embedding families) are useful as alignment heuristics. In FPF terms, they belong behind ScaleEmbeddingSpec + pinned editions/policies (see G.13:Ext.EmbeddingBasedAlignment).
Schema matching & entity resolution (deep‑learning era). Modern matcher families (deep entity matching, contrastive representation alignment, GNN‑assisted graph alignment) help populate interop cards, but must not become “implicit semantics”; record their use as policy‑bound wiring in extensions.
Systematic review process modernisation. PRISMA‑2020‑class review records (post‑2015 practice) are valuable as evidence anchors and coverage telemetry; treat them as evidenced inputs (EvidenceGraph anchors + pinned editions/windows), not as legality gates.
QD / Illumination and OEE declared set results. Post‑2015 QD (MAP‑Elites successors, CMA‑ME line, differentiable QD toolkits) and OEE (POET‑class and related environment/method co‑evolution lines) often rely on external taxonomies and environment corpora. Interop should expose those as pinned external editions and keep coverage/regret as telemetry inputs—never as implicit dominance.