Skip to content

The Test

An evaluation set is a typed, versioned object, not a folder of traces. Its card explains the set. Its records carry provenance. A lint gate checks both before the set is used.

An evaluation result is meaningful only when a reader can recover the exact set it came from. The contract therefore binds a card, a schema, and immutable records into one versioned object. It says what the object is, not where it is stored or how a vendor transports it.

Reading. The card lets a reader understand the set. The schema lets software read it. The records supply the evidence. Change any of the three and mint a new version.

Evaluation set contract and version pin card, schema, and records pass one gate card purpose, owner, split schema fields and allowed values typed records source, label, raw or edited provenance travels with evidence lint gate card, schema, integrity set version immutable, content-addressed old versions remain readable scoring run records this exact set version a readable collection becomes a test only when its identity is pinned
Figure 1.Structural contract for one evaluation set. The figure shows ownership and pinning, not a storage architecture or a measured result.

The labels on a record are produced under the LLM Judge calibration protocol. The card declares the split tier and provenance fields that make later leakage and lineage checks possible. The scoring path is separate: this page defines the test object it consumes.

The card says what the set is for. The schema says which fields a record may contain. Each record carries enough lineage to explain where it came from and which choices could have changed it.

ObjectMust stateWhy it matters
Cardname, owner, purpose, source, license, split tier, and related setsA reader can identify the set and its intended use.
Schemarequired fields, allowed values, and expected evidenceA loader can reject malformed records.
Recordunique, never-reused record identifier; source event; generating model and prompt version; labeler; and raw-versus-edited flagA result can be traced to the evidence and labeling procedure that produced it.

The schema exists before records are accepted. Records move from captured, to typed against it, to labeled, to promoted into a set. A blank expected field is refused. A value a person edited is flagged as edited, never silently mixed with raw capture. Displayed fields may not contain raw nulls, serialized blobs, local paths, or unmasked personal data.

The card declares one split tier: public, private, or held-out. Related sets link explicitly. A set is immutable once versioned: any change to its card, schema, or records mints a new version, and the old version remains addressable. The card declares a versioned hash profile: digest algorithm, canonical UTF-8 serialization, Unicode normalization form, canonical field order, and record order by the never-reused record identifier. The version is the digest of the card, schema, and records under that profile, so every scoring run can pin exactly what it judged.

The card follows dataset-documentation practice (Gebru et al. 2021) and exports shared metadata so sets can interoperate with public tooling (Akhtar et al. 2024).

The lint gate checks the contract before a set reaches a scorer. It runs on every set change in continuous integration and can run locally on demand. Conforming loaders also verify stored row hashes on the ordinary load path: a set cannot be read, joined, or reported until that check passes. These checks are structural. They pass or fail; this page defines no estimator.

Check familyGate
NamingRequire a content-describing name and named owner. Reject duplicates, model configurations, operator instructions, and personal names.
StructureRequire card fields and schema-conformant records. Reject raw nulls, serialized blobs, and absolute paths in displayed fields.
SafetyDetect and mask personal data by default, or refuse the record.
IntegrityVerify stored row hashes on ordinary load. Scan held-out versus training overlap by hash and near duplicate. Require explicit links between sets that share content.
AttributionRequire each label file to bind its schema, rubric, and taxonomy versions at labeling time.
ReportingRequire a denominator and side-by-side judged, total, and pending counts for every reported number. Reject a lone success rate.
FailureContract response
Lint failureBlock the change.
Personal data detectedMask it by default, or refuse the record.
Held-out and training overlapFail the set and report the overlapping record.
Missing specification bindingRefuse the label file. Do not infer a version from its name.

Limit. The two controls below are requirements, not current guarantees. Until both are enforced, a readable set is not necessarily a conforming set.

Schema evolution remains open: a breaking schema change may mint a schema version, a set version, or both, and migration of old sets is not specified. The near-duplicate scan also has no validated default window or threshold. Those choices need evidence before they become release rules.

WorkBears on
Gebru, T. et al. (2021). Datasheets for datasets. Communications of the ACM 64(12), 86-92.The documentation practice the card follows.
Akhtar, M. et al. (2024). Croissant: a metadata format for ML-ready datasets. arXiv:2403.19546.The shared metadata format a card exports.