G.4:4 - Solution — author the smallest lawful CAL pack
G.4:4.0 - Practitioner authoring path C1–C9
Complete these actions in order. Extend a step only when the task needs the additional input named there.
- C1 — Charter the scope. Name the exact
CG‑Frame,EntityOfConcern,ReferencePlane, task,CNSpecRef.edition, andCGSpecRef.edition. State the assumption envelope in ordinary language. - C2 — Declare one typed operator. Give it a stable id, CHR-typed signature, preconditions, result kind, and failure behavior. The card declares the operation under
A.6.1. Evidence for an application comes from its execution (§4.4a). - C3 — Declare one acceptance clause. Name the exact Characteristic and the A.6.1 argument declaration that admits the corresponding C.16 measurement-result episteme. Declare the predicate or threshold,
ClaimScope, any evaluation window required by the predicate or receiving use, any separate qualification window that limits use, unknown handling, and the stated stop, degrade, or abstain behavior. Keep the exact current result episteme for the later application. If the clause claims statistical risk or coverage control, also name the loss, target, calibration population and window, sampling or exchangeability assumptions, declared treatment of shift, and the exact policy that states the guarantee. - C4 — Compose only a legal flow. Cite the operators and gating clauses, preserve the lawful result kind, and keep a selected set when no lawful scalarization exists. A declared DAG is possible composition, not performed work.
- C5 — Name the minimum evidence/currentness need. Cite the exact A.10 source/provenance anchors and G.11 currentness conditions needed to judge the clause. Do not turn an evidence profile, citation, or graph membership into a verdict or actual reliance.
- C6 — Add an extension only when the task needs one. Select its current subject pattern first, then pin only the descriptor, distance, insertion, exploration, branch, or path records that change the present CAL action. Otherwise omit the extension.
- C7 — Record proof or an explicit gap. For every operator, flow, or clause, cite each required justification for legality, monotonicity or boundedness. If any required justification is missing, publish the gap and the consequent degrade/abstain behavior.
- C8 — Exercise declaration behavior. Provide one worked authoring example and focused conformance tests for illegal operations,
pass | fail | unknown, currentness conditions when they are part of admissibility, and failure behavior. The example and test remain declarations/test records unless separately grounded dated work is named. - C9 — Publish and hand off. Mint stable ids and continuity notes, then emit the smallest immutable
TaskMapedition. It cites the exact charter edition, the already constituted C.22TaskSignatureRef, the task, and edition-bearing operator, flow, gating-clause, and evidence-profile refs; the cited evidence profiles carry the needed currentness pins. It neither constructs the TaskSignature nor copies clause thresholds. Use G.11 for change refs; G.4 defines no refresh rule or runtime occurrence or result.
The path is complete when a reader unfamiliar with the author’s work can reconstruct the acceptance statement from the published ids and identify what must happen at runtime. The manifests, schemas, interfaces and optional extensions below make that same pack machine-citable. The order of work is C1–C9.
G.4:4.1 - G.Core linkage (normative)
Builds on: G.Core (Part-G core invariants)
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? // pin an actual numerical composition model/policy when used; otherwise cite the governing rule
},
// consumed iff no explicit `ΓFoldRef.edition` override is pinned
DefaultsConsumed := { 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):
- Apply
G.Corefor tri-state outcomes, penalty routing, set-return discipline, crossing visibility, the P2W split and typed RSCR causes. Its Default Governing Definition Index identifies the rule for each default. - EvidenceGraph/Path pins, when used, are declared only via
G.4:Ext.EvidenceGraphWiringin G.4:4.5. - 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.
G.4:4.2 - 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— identification and assumption basis for this CAL pack:- cites the exact
CGFrameId,EntityOfConcernRef, andReferencePlane, - cites the governance and legality records (
CNSpecRef,CGSpecRef) by edition, - records the assumption envelope on which the acceptance predicates rely without minting another governance or legality record.
- cites the exact
-
TaskMap— the conditional G.4 handoff record toG.5when CAL gates are current; one exact edition names the task, cites the already constituted C.22TaskSignatureRefand exact charter edition, and cites the acceptance-clause, operator, flow, and evidence-profile refs that selection consumes. It does not constitute the TaskSignature or contain threshold values. -
CAL.Operator[]— UTS‑published typed operation declarations governed byA.6.1; a card declares possible arguments, result kinds, and conditions but does not assert that an operation ran:- declared signature over CHR types,
- declared preconditions and postconditions, including references to legality guard macros,
- provenance and evidence hooks identified by ids or pins independently of tool behavior.
-
CAL.Acceptance[]— typed predicate declarations whose use is bounded by the declaredClaimScope, any evaluation window required by the predicate or receiving use, and any separate qualification window that limits use; a clause declares how an actual application is judged but is not itself a verdict:- binds to CHR characteristic ids and to exact A.6.1 argument declarations for admissible C.16 measurement-result epistemes (and, when inducing numeric comparison or aggregation, to
CG‑Spec.characteristicids), - keeps the exact current result episteme in the later application binding rather than in the reusable clause,
- exposes unknown handling and failure behavior via policy pins.
- binds to CHR characteristic ids and to exact A.6.1 argument declarations for admissible C.16 measurement-result epistemes (and, when inducing numeric comparison or aggregation, to
Each resultInputDeclarationRef resolves an A.6.1 ArgumentDeclaration. Its meaning identifies the C.16 measurement-result episteme expected by the clause. The declaration states the ValueKind and binding designation rule and requires a result for the named Characteristic with the admissible shape. A one-off clause may also cite an already existing episteme in fixedResultEpistemeRefs[]?; mark that clause one-off instead of presenting it as reusable.
-
CAL.Flow[]— legality‑checked declarations of possible operator composition; a declared DAG is not performed work:- 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 under their declared regime / provenance anchors / policy pins needed for
SCRand audit surfaces, - currentness conditions needed by the receiving use, with freshness-window and decay/Γ_time policy refs pinned only when those mechanisms are used.
- explicit
ReferencePlaneand any used penalty-policy refs (Φ(CL),Ψ(CL^k),Φ_plane); the ProofLedger supplies the receiving quantity, scale, input meanings, assumptions, and derivation or calibration. Monotonicity and boundedness alone do not justify a numerical loss.
- lane tags under their declared regime / provenance anchors / policy pins needed for
-
Optional
CAL.NQD[]— QD/OEE‑related calculus surfaces when declared:
A CAL clause that consumes G.7 calibration states its exact receiving use and premises. A locally justified CL threshold is an additional policy condition; the ProofLedger and named authority must support that condition. It does not replace the bounded-use claim, target classification or reliance result. A policy waiver changes only the authorized policy condition.
-
CAL.ProofLedger— a proof/justification ledger:- links operator/flow/clause ids to their needed legality and soundness results; a numerical support fold includes the B.3/C.2.2 receiving model, compatible scales and inputs, dependence assumptions, and boundary behavior.
-
Publication artifacts:
- UTS Name Cards under F.17/F.18 for all public ids,
- ids for RSCR tests and worked examples,
- deprecation notices and edition bump notes as public-id continuity records.
Boundary discipline (normative):
- No shadow specs: CAL artefacts cite
CN‑Spec/CG‑Specand do not introduce competing “local specs” (delegated; seeCC‑GCORE‑CN‑CG‑1via CC‑G4‑CoreRef). - Shipping boundary:
G.10governs shipping; seeCC-GCORE-SKP-1via CC-G4-CoreRef. - Refresh boundary: CAL publishes pins/payload for refresh;
G.11governs refresh orchestration.
Minimal schema fragments (notation‑independent; fields for citation, not an implementation schema):
CAL.Charter :=
⟨ charterId, charterEdition, cgFrameId, entityOfConcernRef, referencePlaneRef,
CNSpecRef.edition, CGSpecRef.edition, assumptionEnvelope ⟩
CALCharterRef := <charterId, charterEdition>
TaskMap :=
⟨ taskMapId, taskMapEdition, charterRef := CALCharterRef,
taskRef, taskSignatureRef := TaskSignatureRef,
acceptanceClauseRefs[], operatorRefs[], flowRefs[], evidenceProfileRefs[] ⟩
TaskMapRef := <taskMapId, taskMapEdition>
CAL.Pack@CG-Frame :=
⟨ calPackId, charterRef, taskMapRef, operatorIds[], acceptanceClauseIds[], flowIds[],
evidenceProfileIds[], proofLedgerId, nqdIds[]?,
utsRowIds[], workedExampleIds[], rscrTestIds[], publicIdContinuityNoteIds[] ⟩
CAL.Operator :=
⟨ operatorId(UTS), signature(CHR-typed), preconditions[], postconditions[],
evidenceProfileRefs[]?, failureBehaviorRef?, crossingRefs[]? ⟩
CAL.Acceptance :=
⟨ clauseId(UTS), characteristicRefs[], resultInputDeclarationRefs[],
fixedResultEpistemeRefs[]?, // deliberately one-off clause only
cgSpecCharacteristicRefs[]?, predicateRef, claimScopeRef,
evaluationWindow?, qualificationWindow?, unknownHandlingRef,
failureBehaviorRef, evidenceProfileRefs[]?, crossingRefs[]? ⟩
CAL.Flow :=
⟨ flowId(UTS), dag(operatorIds, edges), gateClauses(acceptanceClauseIds),
resultKind, decisionAidPolicyRef? ⟩
CAL.EvidenceProfile :=
⟨ evidenceProfileId(UTS), lanes(declared tags), anchors(A.10)[],
freshnessPolicyPins[]?, penaltyPolicyPins[]?, ΓFoldRef.edition? ⟩
lanes carries the tags and meanings of the declared evidence-lane regime; when a CHR charter supplies that regime, retain its tags and meanings. The assurance claim, receiving use and selected contributions follow B.3/B.3.3. Keep any consumed C.2.2:4.1 tuple, with its exact claim and F, G and R_eff values, separately recoverable from the lane tags.
CALCharterRef and TaskMapRef each resolve one immutable edition. A changed charter, task, TaskSignature edition, clause, operator, flow, evidence profile, or edition-bearing cited list creates a new taskMapEdition; an old TaskMapRef continues to resolve its old values. The C.22 TaskSignature remains a separately constituted episteme. The map relates that exact signature to the CAL declarations used by selection but neither derives the signature nor duplicates their thresholds.
When CAL authoring relies on SoTA coverage, consume G.2’s pack CoverageJudgementRef with its HarvestPolicy basis and receiving question. Preserve the distinction between family coverage and lineage/material-entry plurality. A CAL clause does not turn a combined method/generator count into method-only coverage.
G.4:4.4 - Interfaces (minimal I/O surface)
| Interface | Consumes | Produces |
|---|---|---|
G.4-1 Charter | exact CGFrameId, EntityOfConcernRef, ReferencePlane, CNSpecRef.edition, CGSpecRef.edition, assumption envelope, SoTA inputs, CHR Pack@CG-Frame | one immutable CAL.Charter edition and its CALCharterRef |
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, exact Characteristic and A.6.1 result-input argument declarations, ClaimScope, any evaluation window required by the predicate or receiving use, any separate qualification window that limits use, policy pins, and CHR characteristics; exact result-episteme refs only for a clause explicitly marked one-off | CAL.Acceptance[] (typed predicate or threshold; admissible result-input declarations; scope; applicable evaluation and qualification windows; currentness pins when used; unknown and 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, exact task, C.22 TaskSignatureRef, proofs, and examples | versioned CAL Pack@CG-Frame, exact CALCharterRef, and the smallest immutable TaskMap edition plus TaskMapRef, citing the task, matching TaskSignature, and acceptance-clause, operator, flow, and evidence-profile refs; also UTS entries, RSCR tests, Worked-Examples, and public-id continuity notes |
G.4:4.4a - Declaration-to-runtime evaluation boundary (normative)
A CAL pack is a reusable design-time declaration. A stored operator card, clause, flow, TaskMap, proof-ledger row, test, or evidence-profile reference establishes neither an actual participant nor performed evaluation. When a CAL declaration is applied, recover the following runtime chain:
- Name one exact
EvaluationMethod(U.Method). ItsU.MethodDescriptionmay state generic participants, parameters, effects, and evaluation conditions, but it carries no actual-participant slots and no intrinsic claim that a test, proof, or acceptance event occurred. - Cite the exact
CAL.Operator,CAL.Flow, andCAL.Acceptancedeclarations asA.6.1operation semantics. Resolve the clause’sresultInputDeclarationRef, then bind the exact current C.16 measurement-result episteme in this application and test it against the declaration’s Characteristic and admissible result shape. Use the exactA.6.1declaration and application bindings; do not infer them from a compatible signature,TaskMap, or stored reference. - First recover every precise performer’s A.13 core for the exact evaluation action, scope, working situation, and window, including the same obtaining assignment later used by any attribution. A.15.1 then independently admits one dated
EvaluationWork : U.Workfrom its performance history, enacted Method, extent, and containing-System relation. Add F.6 afterward only when the receiving claim needs exact assignment-bound attribution through that same assignment. Recover the evaluated or affected referent, actual resources, and every concrete participant through its direct subject relation or anA.6.1application binding. A compact attribution account may omit only an assignment identifier unused by its receiving claim; it omits no consumed fact. Ordinary activity not claimed asU.Workdoes not enter this branch. - State the local result under its direct predicate and pattern. A
CAL.Acceptanceapplication yields its exactpass | fail | unknownverdict; use A.19 for comparison and selection results, C.16 for measurement results, and C.11 for a decision result. No generic evaluation-result or work-result field substitutes for these objects. - When a durable assertion is needed, constitute one
C.2.1result episteme whose ClaimGraph states that local result, evaluated subject, interpretation basis, polarity or domain status, and uncertainty when current. The episteme is not the domain result and does not create it. - Attach source recovery and provenance through A.10/G.6 and currentness through G.11. State the A.10 evidence-provenance account and local
RelianceDispositionfor the bounded use, citing the direct rule for any reliance relation. Enter B.3 when an actual named assurance claim is current; a consequential use without one retains its direct governing rule. A citation, ledger edge, evidence profile, disposition, or assurance record does not establish the work, participant, application, or local result it describes. - A later selector, acceptance action, or decision is another governed occurrence. It relies on the result episteme through an exact premise, reference, decision-use, or operation-argument relation; mere storage, citation, or graph membership does not establish actual use.
This chain keeps declaration, execution, local result, result episteme, provenance, bounded reliance, currentness, acceptance, and decision independently recoverable.
G.4:4.5 - 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 - Entry: use when this CAL pack needs to cite an addressable G.6 path or slice, whether one receiving use requires it or several consumers share it.
- Stop: omit the block when a local A.10 source-to-use account is sufficient; remove it when no current clause, proof, or example cites the path.
- Uses:
{G.6} - ⊑/⊑⁺:
∅ - RequiredPins/EditionPins/PolicyPins (minimum):
EvidenceGraphId?PathId[]/PathSliceId[]UTSRowId[](for cited artifacts)
- RSCRTriggerSetIds:
∅ - RSCRTriggerKindIds:
{RSCRTriggerKindId.EvidenceSurfaceEdit, RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange} - Notes: CAL proofs and examples may cite G.6 evidence paths by these ids.
GPatternExtension block: G.4:Ext.NQD
- PatternScopeId:
G.4:Ext.NQD - GPatternExtensionId:
NQD - GPatternExtensionKind:
MethodSpecific - GoverningPatternId:
C.18 - Entry: use only when the current task applies a C.18 quality-diversity/archive method and its descriptor, distance, insertion, or archive policy must be pinned for CAL use.
- Stop: omit or retire the block when the task has no current archive/QD clause or when those refs no longer change a CAL action.
- Uses:
{C.18} - ⊑/⊑⁺:
∅ - RequiredPins/EditionPins/PolicyPins (minimum):
DescriptorMapRef.editionDistanceDefRef.editionInsertionPolicyRefArchiveRef?TaskSignatureRef?(if activation is TaskSignature‑bound)
- RSCRTriggerSetIds:
∅ - RSCRTriggerKindIds:
{RSCRTriggerKindId.EditionPinChange, RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.TelemetryDelta, RSCRTriggerKindId.FreshnessOrDecayEvent} - Notes: C.18 defines QD semantics. CAL pins the descriptor, distance and insertion records needed to reproduce 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 - Entry: use only when the current task has a C.19-governed exploration/exploitation budget or probe-accounting rule that changes a CAL clause or failure branch.
- Stop: omit or retire the block when no current CAL action consumes those C.19 refs.
- Uses:
{C.19} - ⊑/⊑⁺:
∅ - RequiredPins/EditionPins/PolicyPins (minimum):
ExploreExploitBudgetPolicyRefProbeAccountingRef?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 - Entry: use only when C.23-governed SoS-LOG branches currently explain a CAL degrade/abstain path.
- Stop: omit or retire the block when those branch/rule ids no longer change a current CAL clause, flow, or explanation.
- Uses:
{C.23} - ⊑/⊑⁺:
∅ - RequiredPins/EditionPins/PolicyPins (minimum):
SoSLogRuleId[]SoSLogBranchId[]FailureBehaviorPolicyId
- RSCRTriggerSetIds:
∅ - RSCRTriggerKindIds:
{RSCRTriggerKindId.PolicyPinChange, RSCRTriggerKindId.MaturityRungChange, RSCRTriggerKindId.TelemetryDelta} - Notes: The pinned C.23 branches and rules explain the clause’s degrade/abstain behavior.