advanced29 min studyLesson 610 in Engineering

An immutable release identifies what ran and how affected data can be retired

Build reproducible corpus manifests and dependency records, then distinguish historical identity, future-use retirement, physical deletion, and changes to trained models.

On this page

What you’ll understand

  • Identify the artifacts and configuration required to reproduce a corpus release.
  • Trace dependency closure without double-counting shared descendants.
  • Explain why retiring a dataset version does not automatically delete every copy or remove learned influence from models.

A training run labeled latest-data is difficult to reproduce or repair. The name can resolve to different files tomorrow, and a later source retirement may leave no way to tell which runs consumed it. A release manifest should identify immutable content and the decisions that produced it. Retirement then becomes a controlled change in availability and future use, with explicit handling of derivatives, rather than rewriting history or assuming that deleting one storage object automatically reverses every consequence of previous training.

Bind content, processing, and loader policy to one release identity

Record ordered shard identifiers, integrity digests, source snapshot identifiers, document and token counts, tokenizer revision, extraction and normalization versions, deduplication rules, language and quality models, sensitive-data transformations, and overlap exclusions. Include mixture weights, sampling policy, seeds where meaningful, packing, and relevant loader behavior. Different orders or loader policies can create different training sequences from identical files. A seed alone does not guarantee bitwise reproducibility across nondeterministic kernels, changed libraries, or distributed scheduling. State the reproducibility level and retain the actual artifacts needed to support it.

A manifest digest can identify a canonical serialization of those records, while shard digests verify the referenced byte content. Specify the digest algorithm and serialization rather than assuming any JSON formatting produces the same bytes. Practical cryptographic content addressing relies on suitable collision assumptions; it does not certify that provenance is truthful or processing was correct. Do not publish raw sensitive text or guessable personal identifiers merely to make a manifest detailed. Access-controlled references and minimal audit metadata can preserve necessary traceability without exposing every underlying document to every manifest consumer.

hM=H(canon⁡(M)),hj=H(bj)h_M=H(\operatorname{canon}(M)),\qquad h_j=H(b_j)
M is a release manifest, canon its specified deterministic serialization, and b_j the exact bytes of shard j. H is a declared suitable cryptographic digest for integrity/content addressing under its assumptions. These identifiers have no physical units and do not prove semantic quality, permission, privacy, or authenticity without additional mechanisms.↔ Scroll wide equations horizontally.

Retirement follows dependencies and records the action's scope

Maintain relationships among raw captures, extracted documents, duplicate representatives, shards, mixtures, and training runs. W3C PROV provides a primary model family for describing entities, activities, and derivations; a useful local implementation still needs complete, truthful records. If a source is retired under the project's decision process, find the union of its affected descendants and identify each consumer. Shared shards or mixtures can be reached along several paths, so do not add path counts as though every path represented a distinct artifact. Distinguish an affected artifact from one that must necessarily be deleted unchanged.

Define the action: block new sampling, publish a replacement release, revoke access, delete specified storage copies, purge caches, or investigate trained models. Historical release identity can remain stable while an external status record marks it retired and prevents future use; immutability does not require indefinite storage of disallowed content. Keep only the audit metadata that the applicable process permits. Deleting a dataset file does not automatically remove learned influence from model weights, revoke every downloaded copy, or demonstrate successful unlearning. Those are separate dependencies and technical or policy questions with their own evidence.

A(S)=⋃s∈SDesc⁡(s)\mathcal A(S)=\bigcup_{s\in S}\operatorname{Desc}(s)
S is the set of retired source nodes in a recorded derivation graph and A(S) the set of reachable affected descendants, counting each node once. This set operation identifies review scope; graph completeness and edge meaning matter, and reachability alone does not prescribe the appropriate retirement or remediation action.↔ Scroll wide equations horizontally.

Publish replacements rather than silently mutating a referenced corpus

A replacement manifest should name its predecessor, explain the changed scope, and give new shard digests and counts. Recompute mixtures if available domain mass changes, distinguishing natural proportions from intentionally maintained sampling targets. Verify that caches and loading jobs cannot silently resolve the retired alias to old bytes. Test reconstruction from the manifest and audit whether known affected records are excluded from the replacement. Dataset cards such as Dolma and FineWeb show why source and processing documentation belongs with usable releases; a card alone still cannot substitute for artifact-level identity and dependency records.

The modular lab illustrates why a tiny identifier space cannot uniquely label arbitrary artifacts. Reset, explicitly set BOTH modulus m=8 and stride a=4, predict an orbit of only two residues, then Play or Step. Reset and re-set BOTH m=8 and a=3; predict eight distinct residues before repetition. Edits retain t, and n=min(2000000,floor(2t)) selects the capped step. This additive orbit is not a cryptographic digest, manifest validator, or dependency engine. Its unavoidable repeats demonstrate only the limits of small finite identifiers, not an attack or collision-rate estimate for a real cryptographic hash.

Replace a corpus version after a scoped retirement

A fictional release has one hundred thousand available tokens: sixty thousand in domain A and forty thousand in B. A documented retirement removes twelve thousand A tokens. Assume no overlaps, unchanged tokenizer, and natural token-proportional sampling for the replacement.

  1. The retired mass is 12000/100000=0.12 of the old release. Preserve the old manifest's identity and mark its future-use status according to the project's process rather than changing its recorded counts.

  2. The replacement contains 60000−12000=48000 A tokens and 40000 B tokens, totaling 88000. New bytes, shard identities, and derivation records belong to a new manifest.

  3. Natural token weights become 48000/88000=6/11≈0.5455 for A and 40000/88000=5/11≈0.4545 for B. Separately review affected training runs and copies; these new counts do not establish that old model weights have forgotten the retired data.

The result

The replacement is a distinct, reproducible release, while retirement and downstream remediation remain explicitly scoped actions.

Explore the model

Interactive lab

Interactive lab · modular

Small identifiers repeat rather than uniquely name unlimited artifacts

For EACH run Reset, set BOTH m and a, predict, then Play or Step. With m=8, a=4 visits two residues before repetition; a=3 visits eight. Edits retain t; step n=min(2000000,floor(2t)). This is an additive modular orbit, not hashing, a cryptographic collision model, corpus retirement, or provenance-graph analysis.

Small identifiers repeat rather than uniquely name unlimited artifactsAddition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Current readings: Residue r0: 0; Orbit period · m/gcd(m,a): 12; Distinct residues visited: 1 of 12. All parameters are adjustable with the labeled controls below.Repeated addition modulo 12: the current residue is 0, and the orbit period is 12.01234567891011+ 5mod 12An additive orbitn = 0rₙ = 0Period = 12Cycle starts at 0:0 → 5 → 10 → 3 →8 → 1 → 6 → 11 →4 → 9 → 2 → 7 → 0Exact residues · two additions per second
Additive orbitCurrent residue / next edge
Residue r0
0
Orbit period · m/gcd(m,a)
12
Distinct residues visited
1 of 12
t = 0 s

Addition modulo m starts at zero: rₙ = na mod m. Playback advances two additions per second. The orbit has period m/gcd(m,a), including period one for a = 0. This is not a cryptographic security test or a primality algorithm. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forArtifact identity needs an appropriate integrity mechanism, and identity alone cannot establish source quality or complete dependency handling.

Check your understanding

What follows when a source is retired and its dataset shard is deleted from one storage location?

Try it yourself

Retired source A affects shards {1,2}; retired source B affects shards {2,3}. How many distinct shards need review? Why does that count not prescribe deleting every artifact downstream of them?

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Use a set union, then distinguish affected scope from the remediation decision.

Compare with the solution

The union is {1,2,3}, so three distinct shards need review, not four. Shared descendants are counted once. Affected mixtures may be rebuilt, references retired, copies removed, or models investigated under a documented process; reachability identifies where to assess impact rather than proving one identical remedy is correct for every node.

Take it with you

  • Manifests bind immutable artifact identities to processing and sampling decisions.
  • Retirement traverses a dependency graph and must define the scope of each action.
  • Replacing a corpus, deleting copies, and changing a trained model's learned influence are distinct operations.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.