Skip to content
GREEN FUTURETECH.
Explore

Research libraryThe Industrial Data Spine

Chapter 10 of 14 · Part III · Draft web edition

Reproducible training turns experiments into auditable candidates

A model becomes a release candidate only when another competent person can reconstruct what data, code, configuration and evaluation produced it.

Sections
7
Exhibits
4
Minutes
22
Sources
9
EX 43 · Code, features, run. From Snapshot and splits. Leads to Fixed evaluation.

The cloth is woven from this chapter's 4 exhibits: each weft is one exhibit's own data, normalised; each warp group is a section. The probe reads the exhibit's own value where it crosses. Procedural visualisation, not a measurement.

The chapter as a draft: 7 sections, 2 exhibit wefts, one shuttle.

Lead exhibit · 42LayersillustrativeSmall capabilities keep the experiment reconstructable
AuthorityRegistry stateDecision evidenceExecutionRun logArtefact manifestDataFrozen partitionsQuality recordDefinitionVersion controlEnvironment lock

Read-outAuthority: Registry state, Decision evidence

Method and source

Illustrative GFT design informed by execution lineage and incremental MLOps. Layers describe responsibilities, not an implemented system or mandatory software products.

Unit: proposed capability layers. Status: illustrative. Sources: S15, S16, S20. Illustrative figures are teaching examples, not measured factory results.

The chapter's warpBar: share of the reading · square: an exhibit

Section 10.0 · Opening · 1 min · no exhibit of its own · one movement Go to section ↓

Overture · 1 min

Reproducible training means preserving an inspectable chain from the factory record to the candidate artefact and its evaluation. GFT proposes that a candidate cannot enter release review until a competent colleague can retrieve that chain, rerun the agreed checks and explain any unresolved difference. A successful training job is evidence of execution. It does not establish operational fitness or permission to deploy. The preceding chapter determines whether modelling should begin; the following chapter determines whether a candidate may affect operations. This chapter defines the evidence package between those decisions.

¶ 01

10.12 min · 7 paragraphs · 1 exhibit

Version the complete experiment, not only the model file

Google's MLOps architecture connects pipeline execution metadata with lineage, reproducibility and comparison. The research overview by Kreuzberger and colleagues treats MLOps as practices, concepts and development culture as well as architecture. Together they support preserving the experiment as a connected record rather than handing over an unexplained model file.[S15][S20]

GFT's proposed experiment record starts with the admitted purpose and intended output. It identifies the code revision, configuration file, dependency lock, data manifest, feature definitions and evaluation procedure. The execution environment records the operating system, runtime, relevant numerical libraries, processing device and driver where material. Parameters include stopping rules and initialisation settings, including random seeds where used. References point to retrievable artefacts, rather than to somebody's recollection of what was on a laptop. Credentials remain outside this record.

¶ 02

Separate an experiment plan from a run and from a candidate. The plan describes the comparison being attempted. A run records an actual execution, including interruption or failure. A candidate is the immutable artefact bundle selected for review. A rerun receives its own run identifier even if every declared input matches. An exported, quantised or otherwise transformed model receives a linked candidate identity because its actual operating artefact has changed. Retaining the parent prevents a conversion step from disappearing between training and evaluation.

¶ 03

Allocate the candidate identifier before results are reviewed, then bind it to a manifest of content digests. The manifest should cover weights, preprocessing, label mapping, configuration and scoring wrapper. GFT recommends keeping both a readable identifier and digests: the identifier supports conversation, while the digests make later integrity checks explicit. A digest is an integrity comparison, not proof that the training data were correct or that the person claiming approval had authority. Permissions and approval records remain separate controls.

¶ 04

Define what a reconstruction must match. GFT recommends exact agreement for inputs, partition membership, parameter files and stored artefact digests. For newly executed numerical outputs, the experiment plan should specify whether exact agreement is required or a declared tolerance is acceptable. Record the reason for any tolerance and compare the operating decision as well as the summary metric. Never introduce a wider tolerance after an inconvenient rerun. An unresolved discrepancy leaves the package incomplete even when the original score remains attractive.

¶ 05

The minimum stack in Exhibit 42 is an illustrative design, informed by the sources, rather than a claim that GFT operates a deployed training platform. It separates durable records from the authority to change their status.[S15][S16]

¶ 06 · 2 sourcesExhibit 42

S15S16

The layers may share a modest storage service. Their separation is logical: editing a descriptive note must not replace a model, and completing a run must not grant release authority. This distinction gives the factory a practical way to review work without purchasing a separate product for every function.

¶ 07

10.23 min · 10 paragraphs · 1 exhibit

Dataset snapshots prevent silent training-set change

Step 1 of 5Source and quality

Exhibit 43 · derivedCandidate identity connects the record to review

Source and qualitySnapshot and splitsCode, features, runFixed evaluationCandidate record
Source and qualitySnapshot and splitsCode, features, runFixed evaluationCandidate record

Source and quality

Source and quality. Starting point. Leads to Snapshot and splits. · derived

The public description of the data-quality management standard covers managing data used in analytics and machine learning.

Snapshot and splits

Snapshot and splits. From Source and quality. Leads to Code, features, run. · derived

Code, features, run

Code, features, run. From Snapshot and splits. Leads to Fixed evaluation. · derived

Fixed evaluation

Fixed evaluation. From Code, features, run. Leads to Candidate record. · derived

Candidate record

Candidate record. From Fixed evaluation. End point. · derived

Method and source · Exhibit 43

Derived mapping: provenance entities and activities from S09 plus pipeline execution records from S15 map to source, snapshot, run, evaluation and candidate records. Arrows show dependencies, not approval or elapsed time.

Unit: evidence dependencies. Status: derived. Sources: S09, S15.

10.2 · the bodyExhibit 43 above; its figures are illustrative where marked.

The public description of the data-quality management standard covers managing data used in analytics and machine learning. The provenance ontology provides a vocabulary for tracing entities, activities and responsibility. GFT applies these ideas to snapshots: the extract, its creation activity and the accountable roles should remain identifiable together.[S04][S09]

A snapshot should preserve the actual records used, subject to approved retention and access rules. A saved query alone is insufficient for the proposed control because its underlying tables may subsequently change. Retain the query, extraction time, source versions, schema, row identifiers, exclusions and quality-rule version alongside the immutable extract or an equivalent reconstructable historical source. Record reconciliation totals at the same grain as the extract. If later correction changes a label, create a successor snapshot and explain its relationship to the earlier version.

¶ 02

Define prediction time before defining partitions. For an order-planning model, specify what the planner could have known when issuing the forecast. GFT recommends recording both the event time and the time a record became available to the decision process. An event that occurred earlier but arrived after the forecast cannot silently enter the historical input. This rule applies equally to corrections, final quality disposition and later cancellations. Keep the target's eventual outcome separate from the inputs available when the decision was made.

¶ 03

Leakage is a documented reproducibility concern in machine-learning research. Kapoor and Narayanan examine methodological failures and propose reporting that exposes how information enters model development. Their research is a warning about evaluation design, not a measured failure rate for textile factories in Cameroon.[S1001]

¶ 04 · 1 source

S1001

For the factory protocol proposed here, use chronological partitions for forecasting and define any gap around the prediction horizon. Keep overlapping target windows from transferring future outcomes into earlier training examples. For visual inspection, allocate related images at the physical entity boundary, such as a roll or production lot, before generating crops or augmentations. Record the grouping key and check its intersections across partitions. If the intended claim concerns a new style or machine, reserve that entity accordingly; otherwise describe the narrower scope actually tested.

¶ 05

Fit imputers, scalers, feature selection and other learned preparation only on the training partition. Apply their frozen outputs to validation and test records. Tune using validation evidence and keep the final test sealed until the selection procedure is complete. GFT recommends logging each opening of the test set. If its results lead to another tuning decision, retain those results but withdraw the claim that the set remains untouched. Obtain a new independent evaluation boundary before making that stronger claim again.

¶ 06

The lineage in Exhibit 43 is a derived mapping of provenance and pipeline-metadata concepts into proposed factory records. Its inputs are identifiable source entities, recorded transformation activities and execution artefacts. It is a traceability checklist, not evidence that a particular dataset has passed it.[S09][S15]

¶ 07 · 2 sourcesExhibit 43

S09S15

Reconstruction should stop at a broken dependency. A missing snapshot cannot be cured by a screenshot of its row count, and a reproducible training script cannot establish which labels were supplied. Preserve uncertainty in the candidate record and repair the missing link before describing the package as complete.

¶ 08

Label history deserves its own boundary in this proposed design. Keep the annotation instructions, vocabulary version, adjudication process and correction history with the snapshot. Record whether a label represents an initial operator judgement, a later laboratory result or a final customer disposition. Those outcomes answer different questions. If disputed examples are excluded, preserve their identifiers and reasons so a reviewer can assess the resulting scope. A tidy extract should not conceal an unresolved disagreement about what the target means.

¶ 09

For a supplier-generated dataset, GFT recommends obtaining a manifest that makes permitted use and provenance inspectable without demanding unnecessary personal information. Establish whether duplicate material can appear across deliveries and whether the evaluation records were previously available to the supplier for tuning. Where that cannot be established, qualify the independence claim. Preserve the restriction in the candidate record rather than relegating it to a procurement conversation that the eventual release reviewer may never see.

¶ 10

10.33 min · 8 paragraphs · read with a related exhibit

Features inherit governed operational definitions

Related · chapter 098 paragraphs step it

Related exhibit 38 · chapter 09Decision mapillustrativeAn admission scorecard can reject a technically attractive use case
Postpone: fix data or baselineAdmit to shadow candidateStop: low value and unreadyKeep simple rule comparatorData, baseline and rights readiness →Net operational decision value →Bought roll-vision ch…Dyebath shade alertCold-start SKU foreca…Loom bearing acousticsShift bundle balancingOperator speed ranking

Read-outBought roll-vision check: Data, baseline and rights readiness 7.8, Net operational decision value 8.2. Quadrant: Admit to shadow candidate

Method and source

Illustrative admission scoring of six candidate factory use cases across data, baseline and rights readiness (x-axis, 0 to 10) and net operational decision value after lifecycle cost (y-axis, 0 to 10). Evaluation dimensions derive from S04, S11, S14, S36 and S44; coordinates are illustrative method examples, not measured factory results.

Unit: illustrative score (0 to 10). Status: illustrative. Sources: S04, S11, S14, S36, S44. Illustrative figures are teaching examples, not measured factory results.

Read this exhibit in its chapter ↗
10.3 · Introduction · paragraph 1 of 8

The manufacturing KPI standard describes indicators through their formula, elements, time behaviour and units. GFT extends that definition discipline to model features, while distinguishing a model input from a management indicator. A feature may be useful without being a KPI, but it still needs a stable operational meaning.[S38]

Define each feature's source event, entity key, unit, aggregation window, time basis and missing-value treatment. Include its admissible range, correction policy and owner. A feature called recent downtime should state whether it measures stopped minutes, stop counts or lost scheduled time. It should also state whether changeover and planned maintenance are included. Avoid allowing a model notebook to create an alternative meaning for a term that production managers already use. A changed definition becomes a new feature version with an impact review.

GFT recommends distinguishing an observed zero from an unavailable value. A machine that reported no stoppage and a machine that sent no report provide different evidence. Preserve a missingness indicator where appropriate and define what the scorer does when information is late or absent. If the operating procedure requires the model to abstain, training and evaluation should retain that path. Do not fill every blank merely to make the input matrix acceptable to an algorithm. The reason for absence may matter more than the imputed value.

Retain the preparation artefacts that convert governed fields into numerical inputs. These include category dictionaries, normalisation parameters, vocabulary, image transformations and the order of output classes. GFT's proposed rule is that inference consumes the same versioned transformation as evaluation. A separate implementation requires an equivalence check on agreed fixtures before it can replace the original. Otherwise the candidate record would identify the weights precisely while leaving their input interpretation uncertain. The wrapper belongs in the artefact bundle for this reason.

For example, an illustrative feature calculates unplanned-stop share from an assumed 24 stopped minutes and 480 scheduled minutes: 24 divided by 480 equals 0.05, or 5 percent. Its unit is a fraction of scheduled time, its grain is the completed shift, and its assumed denominator excludes planned shutdown. This is a constructed definition example, not a GFT factory observation. If the decision occurs midway through the shift, its final totals are unavailable and this completed-shift feature is ineligible for that decision.

Use that example to challenge timing as well as arithmetic. A feature with the right formula can still have the wrong availability boundary. GFT recommends storing an availability rule alongside every lookback window: the newest record must be usable by the scoring cut-off, rather than merely carry an earlier event date. Where historical availability cannot be reconstructed, flag the evaluation limitation explicitly and collect prospective evidence. Do not substitute a convenient finalised history and call it an exact replay of a past decision.

Feature ownership should remain with the operational definition owner, supported by the model builder. The builder may propose a different window or encoding, but should not silently change what a stoppage or accepted unit means. This keeps the data spine connected to factory work when a later experiment replaces the algorithm.

10.43 min · 8 paragraphs · 1 exhibit

Execution metadata make comparison possible

Exhibit 448 paragraphs step it

Exhibit 44Bar chartillustrativeMean error alone favours the peak-period failure
05101515Comparator7.5Candidate A7Candidate B

Read-outComparator: 15 illustrative mean absolute error, units

Method and source

Illustrative assumed actuals [100,120,80,140]. Comparator predictions [110,100,90,120]; A [105,110,85,130]; B [100,120,80,112]. Mean absolute errors are 60/4=15, 30/4=7.5 and 28/4=7. B's final-period shortfall is 28 units. No observed factory result or forecast benefit is claimed.

Unit: illustrative mean absolute error, units. Status: illustrative. Illustrative figures are teaching examples, not measured factory results.

10.4 · Introduction · paragraph 1 of 8

Execution records provide the link between an intended pipeline and what actually ran. Google's architecture explicitly uses pipeline metadata for comparison and diagnosis as well as lineage. GFT adopts that principle and requires a run to record its start, completion state, inputs, outputs and diagnostic references, including unsuccessful executions.[S15]

In the proposed log, distinguish completed, failed, cancelled and invalid executions. A completed job may still be invalid for comparison if it used the wrong snapshot or an undeclared feature. Retain the reason and superseding run rather than deleting the inconvenient entry. Record material manual intervention, including a resumed checkpoint, changed resource allocation or a corrected configuration. Never overwrite an earlier run's metrics after repairing a bug. The repair creates new evidence and should preserve the link to the defect it resolves.

Lock the comparison protocol before selecting the winner. Candidate, simple comparator and existing planning rule should face identical evaluation records, target definitions, horizons and weighting. Record the metric implementation as code, including exclusions and handling of missing predictions. GFT recommends a prediction ledger containing the evaluation key, actual outcome, prediction, abstention state and candidate identifier. This lets a reviewer recompute a summary and investigate a local failure without trusting a chart exported by the builder.

The illustrative mean errors in Exhibit 44 use only the assumptions and calculations above. Lower bars show smaller mean error; they do not show the distribution, uncertainty or permission to act.

GFT recommends keeping computational cost and elapsed duration in the same run record, with units and measurement boundaries. Treat estimated costs as estimates and distinguish active processing from queueing or human preparation. These records support later lifecycle costing without turning this chapter into a business-case approval. A cheaper run is not necessarily a cheaper operating system, and a faster experiment does not justify weaker evidence retention.

Preserve the selection history as well as the selected run. GFT proposes an experiment summary that lists the candidate families explored, the tuning boundary and the rule used to choose the submitted artefact. If several random initialisations are evaluated, retain their results and explain how the reported candidate was chosen. Do not present the most favourable observed run as though it were the predetermined procedure. The summary need not reproduce every diagnostic message, but it should make discretionary choices visible enough to challenge.

A reconstruction discrepancy should open a bounded investigation. First compare the declared inputs and artefact digests, then compare feature outputs and record-level predictions before interpreting the summary metric. Identify the earliest point of disagreement and retain the original package. GFT recommends distinguishing a documentation defect, an environment dependency and a genuine difference in the model's decisions. Each needs a different repair. A new successful execution resolves the issue only when the reason for the earlier disagreement is recorded or its remaining uncertainty is explicitly accepted for the stated scope.

Interlude · the cloth half-woven

4 exhibits carry this chapter's argument.

Woven: sections 10.0 to 10.4Still to weave: 10.5 to 10.7

  1. 42Small capabilities keep the experiment reconstructableLayers
  2. 43Candidate identity connects the record to reviewFlow
  3. 44Mean error alone favours the peak-period failureBar chart
  4. 45The candidate record separates knowledge from authorityRegister
Hover or focus an exhibit to light its weft; select it to jump to it.
Key figures from chapter 01 · Exhibit 01Key figuressourcedLocal-processing ambition raises the cost of untrusted evidence
  • 95%Raw cotton fibre exportedApproximate inherited sector baseline (R06; original date unrecorded)
  • 5%Cotton fibre processed locallyApproximate inherited sector baseline (R06; original date unrecorded)
  • 50%National processing targetSND30 local-processing target by 2030 (R07; policy target, not realised output)

Read-outRaw cotton fibre exported: 95%. Approximate inherited sector baseline (R06; original date unrecorded)

Method and source

Inherited GFT programme evidence base prepared 31 January 2024. R06 and R07 were not refreshed in 2026 and their original publication dates are unrecorded. Figures describe sector-level baseline and policy ambition, not a current GFT factory measurement or causal productivity claim.

Unit: percent of cotton fibre. Status: sourced. Sources: R06, R07.

Read this exhibit in its chapter ↗

10.52 min · 6 paragraphs · 1 exhibit

A registry records status and authority

The AI lifecycle standard describes processes for managing AI systems and explicitly covers acquisition as well as development. GFT's proposed registry translates lifecycle control into named candidate states. The state names below are a factory design choice; they are not a certification claim or a prescribed state machine taken from the standard.[S13]

Candidate means the bundle has been registered, including known gaps. Validated means the agreed checks passed for a stated scope, with the evidence linked. Approved means the authorised owner accepted a particular scope and set of conditions. Deployed means that an identified operating endpoint has confirmed that version is active. Suspended means use is halted while the record is retained. Retired means the candidate is withdrawn from further authorised use, subject to the retention policy. GFT recommends recording rejection as a decision outcome against a candidate, rather than erasing the candidate itself.

¶ 02

Keep release readiness distinct from active use. An approval record should specify the candidate digest, permitted line or planning process, conditions, approver and effective window. A deployment record should identify the actual service, device or batch job and confirm its loaded wrapper and configuration. An approved model can have no deployment, and a deployment may fail to activate the approved bundle. Until endpoint confirmation exists, report the state that is evidenced. Do not infer production status from a registry label alone.

¶ 03

For a small factory, GFT proposes a current-state table backed by an append-only transition history. Every transition records the prior state, new state, reason, actor, time and supporting evidence. Corrections append a resolving entry instead of rewriting the original decision. The technical custodian protects storage and access; the operating owner controls scope and acceptance. Where a person holds overlapping roles, record the arrangement and obtain the review required by the consequence of the intended use. The next chapter defines release scrutiny in detail.

¶ 04

The model-record fields in Exhibit 45 are a derived design checklist. Their inputs are lifecycle control, provenance, data-quality management, indicator definition and human judgement over thresholds. Mapping each principle to an inspectable record does not establish that a candidate already satisfies it.[S04][S09][S11][S13][S38]

Exhibit 45RegisterderivedThe candidate record separates knowledge from authority
Record group
Purpose and scope
Inspectable evidence
Decision, owner, exclusions

Read-outRecord group: Purpose and scope. Inspectable evidence: Decision, owner, exclusions

Open the full register (6 rows)
Purpose and scopeDecision, owner, exclusions
Data and rightsSnapshot, quality, access basis
Feature meaningDefinition, window, unit
Run and artefactCode, environment, digests
EvaluationProtocol, predictions, limitations
Authority and exitState history, approval, fallback
Method and source

Derived mapping of source principles to GFT record groups: data quality to scope and snapshots; provenance to lineage; human judgement to approval; lifecycle control to status and exit; KPI definitions to feature meaning. This is a proposed template, not an implemented registry or standard-conformity claim.

Unit: required record groups in a proposed design. Status: derived. Sources: S04, S09, S11, S13, S38.

Retention is part of the model record. GFT recommends recording whether worker-level information is present, where restricted evidence is held and who may access it. Do not copy personal records into an unrestricted registry to make lineage convenient. Preserve the minimum permitted evidence needed to explain decisions, and link to controlled material where appropriate. If deletion or contractual limits prevent later reconstruction, record what can no longer be reproduced and reassess continued use. Legal applicability and retention periods require qualified advice; this chapter supplies an engineering record design, not legal advice.

¶ 01

10.63 min · 8 paragraphs · read with a related exhibit

A lightweight stack avoids platform sprawl

Microsoft's maturity model recommends gradual capability development and describes both organisational and technical dimensions. GFT uses that advice to separate necessary evidence from optional automation. A factory should choose software only after defining which recurring record or decision it must sustain.[S16]

The proposed starting stack comprises version control for code and definitions, controlled storage for snapshots and artefacts, a structured run log and a registry with transition history. These are capabilities, not a mandatory procurement list. A disciplined directory structure and validated structured files may initially provide several capabilities together. Give the custodian a documented export and restoration procedure. If a platform is adopted later, preserve the identifiers and relationships so historical candidates remain intelligible outside its interface.

¶ 02

Plain portable records need an explicit schema. GFT recommends mandatory fields for identity, parent identity, record type, creation time, responsible role, content location, digest and access classification. Domain-specific records then add partitions, metrics or approval conditions. State the schema version in every export. Validate references before accepting an import and flag a missing dependency rather than dropping it silently. A portable model file without its label mapping, feature contract or evaluation keys is an incomplete transfer under this proposed protocol.

¶ 03

Make recovery part of the reconstruction exercise. Ask a colleague to start from an approved identifier on a clean permitted environment, retrieve the package, verify integrity and rerun its evaluation. Record missing instructions, inaccessible files and unexpected manual choices. The colleague need not repeat a costly full training job every time to reveal a broken evidence chain. Define when training reruns are warranted, such as an unexplained result difference or material environment change, and distinguish that exercise from rescoring the stored artefact.

¶ 04
Note

Automation should remove repeated transcription and enforce declared rules. GFT recommends beginning with manifest generation, reference validation and automatic capture of actual run inputs. Leave disputed operational meaning and acceptance with the responsible people. A scheduler can repeat a mistaken query more efficiently; it cannot resolve who owns the definition. Similarly, an automatic registry update should not transform completion of training into approval. Record the automation's own version because it participates in the evidence chain it creates.

¶ 05

The factory should also define an exception route. If an urgent investigation uses an incomplete experimental package, label it exploratory and prohibit it from acquiring release status through convenience. Assign an owner and a clear condition for completing or abandoning the record. Preserve whatever learning is reusable without presenting the investigation as an accepted candidate. This keeps the system workable during operational pressure while retaining a meaningful distinction between exploratory work and evidence suitable for a release decision.

¶ 06

Close the reconstruction exercise with an evidence receipt. GFT proposes a short record stating who attempted it, which package and environment they used, what they could retrieve, which checks they executed and what remains unresolved. Record whether they rescored a stored artefact, rebuilt the wrapper or repeated training, because those exercises support different claims. The receipt gives the release reviewer a bounded statement of work actually performed. It should never be titled independent validation unless the assigned reviewer also performed the separate validation work.

¶ 07

10.72 min · 7 paragraphs · read with a related exhibit

Bought models face the same evidence discipline

Acquiring a model changes which evidence the factory can obtain, but does not remove lifecycle responsibility. The AI lifecycle standard's public abstract explicitly includes acquired systems. GFT therefore recommends applying the same candidate identity and local evaluation discipline to a bought model while recording the limits of access to its internal development process.[S13]

For a bought inspection system, record supplier, product, model identifier, wrapper version, input requirements, class mapping, licence terms and update channel. Preserve the documentation version supplied with the product and distinguish supplier claims from locally observed results. Record whether training data, training code and weights are accessible. Unknown should remain unknown. Do not infer local reproducibility from a vendor's training claim or describe a local test as independent reconstruction of an inaccessible training pipeline.

¶ 02

The procurement requirement should specify notification of material changes and the evidence needed for revalidation. GFT recommends defining materiality to include preprocessing, defect taxonomy, thresholds, model weights and the service contract that determines outputs. Where an update cannot be pinned, log the provider's available version markers and dates, then describe the remaining uncertainty. An endpoint name that stays constant while behaviour changes is not sufficient candidate identity for the proposed protocol. The owner must decide whether that uncertainty is tolerable for the intended decision.

¶ 03

Keep the locally used configuration inside the package. A purchased model may still be tuned through thresholds, calibration, prompts or operating recipes. Preserve those inputs and any local adaptation data with their rights and lineage. A tuned derivative gets a new identity linked to its supplier base. GFT recommends running the same fixed local evaluation on the actual delivered interface, including its preprocessing and abstention behaviour. This tests the system the factory will receive rather than a selectively exported component.

¶ 04

Agree an exit route before dependency becomes difficult to reverse. Where rights permit, retain the last approved local artefact and the environment required to read it. Where a remote licence or service prevents that, document the feasible fallback, including a return to the approved manual procedure. Do not promise recovery of a supplier service the factory cannot restore. Link the fallback evidence to the candidate record; the following chapter addresses the operational rehearsal and authority needed before release.

¶ 05

The handover should expose contractual dependencies alongside technical ones. GFT recommends recording whether access to historical predictions, model versions or evaluation exports ends when a subscription lapses. Obtain an export before that boundary and verify that its identifiers still resolve to the retained local evidence. If a service cannot provide the evidence required for the intended use, the owner can narrow the scope, negotiate a different arrangement or decline the candidate. Recording that constraint early protects the factory from mistaking a convenient interface for a controllable operating asset.

¶ 06

GFT's programme sequence connects early bought vision and later history-dependent forecasting through the same record discipline. This chapter proposes that common discipline; it does not claim either system has been trained, validated or deployed by GFT. The practical distinction is evidence availability. A bought system may offer limited training visibility but still needs a traceable local test. A locally trained forecaster must preserve its historical information boundary as well as its code. Both hand the release reviewer an identifiable artefact, an explicit scope and an honest account of what remains unknown.

¶ 07

Check the record

The chapter keeps its sources within reach.

Every knot is a source this chapter cites; select one to read its record, or filter the register by grade. Publication dates and inherited-source limits stay explicit. Read the paper's full evidence summary.

9 sources · 29 citation marks on this pageMost cited: S15, 5 times

Grade AGrade BGrade CKnot size: citations on this page

All 9 records shown

c10-S04 · Grade A

ISO/IEC

ISO/IEC 5259-3:2024: Artificial intelligence, Data quality for analytics and machine learning, Part 3: Data quality management requirements and guidelines

ISO/IEC 5259-3 defines the requirements and guidance for managing the quality of data used in analytics and machine learning (ML).

2024. Register access date: 2026-10-30. Source provenance is supplied by the paper evidence register.

Open the recorded source ↗
Chapter source notes

S15 Google Cloud. 2024-08-28.

S20 arXiv, author version of an IEEE Access article. 2022-05-14.

S16 Microsoft Learn, Azure Architecture Center. 2026-06-03.

S04 ISO/IEC. 2024.

S09 World Wide Web Consortium. 2013-04-30.

S1001 arXiv, Sayash Kapoor and Arvind Narayanan. 2022-07-14.

S38 International Organization for Standardization. 2014.

S11 National Institute of Standards and Technology. 2023-01-26.

S13 ISO/IEC. 2023.

Keep the thread · chapter 10 of 14

Chapter 11 picks up the thread.

Move the shuttle along the rack to preview any chapter: its sections, exhibits and reading time. Draft web edition. This research is not investment, legal or tax advice; illustrative models are not measured factory results.

The paper's rack · 14 boltsBolt length: reading time

11Part III: Control models as production change

Validation and staged release keep models subordinate to operations

Release authority follows demonstrated local fitness, safe fallback and accountable acceptance, not a strong aggregate validation score.

  • 11.1People set the acceptance metrics and thresholds
  • 11.4Local slices reveal aggregate success that hides failure
  • 11.7Operational comparison includes the cost of being wrong
  • 11.10Shadow and assisted modes earn autonomy gradually
Reading time
26 min
Exhibits
5
Sections
8
Continue to chapter 11
← Previous: chapter 09, A use case earns admission only when a decision and baseline existContinue the threadChapter 11 · Validation and staged release keep models subordinate to operations

Find a thread.

Type to search.