Accession Numbering Protocol¶
Numbering protocol — instantiates Durable Identifier Binding
A rule for minting structured, sequential identifiers whose shape encodes collection, order, and hierarchy, so the number itself is human-readable and self-locating.
Accession Numbering Protocol is the rule that defines a meaningful handle shape — the deliberate opposite of an opaque random token. It specifies the grammar of the identifier (what fields, what separators, what order) and the rule for deriving the next value, so that the resulting number carries information: which collection an item belongs to, when it arrived, and where it sits in a hierarchy. Its defining move is that the identifier's structure is a coordinate, not merely a label — a reader can locate and order the referent from the handle alone, without any lookup.
Example¶
When a museum acquires an object, it assigns an accession number like 2024.15.3: the year of accession (2024), the fifteenth acquisition lot of that year, the third item within that lot. The protocol generates it by reading the current year, taking the next lot number in sequence, and appending the item index — then composing them under the fixed dotted-numeric grammar. Anyone who reads 2024.15.3 can place the object in the collection's provenance without opening a database: it sorts naturally among its neighbours, and its position is legible on sight. A random UUID would be equally unique but would say nothing at all — no year, no order, no place.
The protocol also fixes the shape so downstream systems can parse and validate it: exactly three numeric fields, dot-separated. That shape is a promise about every handle the protocol will ever mint.
How it works¶
The protocol has two moving parts. The first is a field grammar: the parts of the identifier, their order, their separators, and their allowed characters — the fixed template every minted handle must fit. The second is a derivation rule for the next value: increment within a scope (a per-year counter, a per-collection counter, a per-parent counter) and encode the referent's position in a hierarchy as a path, parent.child.grandchild. Together they yield handles that are meaningful, parseable, and orderable — with the meaning baked in at the moment of minting.
Tuning parameters¶
- Meaning density — how much semantics to encode (a bare sequence versus year + collection + medium + item). More meaning aids humans and self-location but bakes in facts that can later go stale.
- Field width / zero-padding — fixed-width fields sort lexically and look uniform but cap the range; variable-width fields scale but break naive sorting.
- Hierarchy depth — how many path levels the handle carries. Deeper paths locate more precisely but grow brittle when the hierarchy is reorganized.
- Sequence scope — global versus per-collection versus per-year counters. Per-scope counters keep numbers short and meaningful but complicate cross-scope uniqueness.
- Human vs. machine legibility — separators, casing, and a trailing check digit for people, versus compactness for machines.
When it helps, and when it misleads¶
Its strength is that the identifier doubles as a coordinate: sortable, human-readable, self-locating, and helpfully guessable (you can find the next item in the series). Where humans routinely handle the identifiers and provenance matters — archives, legal filings, taxonomies, museum collections — a well-designed accession scheme is far more useful than an opaque token.
Its failure is that the encoded meaning goes stale. This is the classic database-design caution against intelligent (or "smart") keys[n1]: bake the collection or department into the handle and the handle starts to lie the moment the object is re-catalogued or the department renamed, and renumbering to fix it breaks every existing reference. The classic misuse is overloading the identifier with mutable attributes — owner, shelf location, status — that were never safe to encode. The discipline is to encode only facts that are permanent by construction (the year of accession, the order of arrival) and never mutable state; when in doubt, keep the handle dumb and put the meaning in the record.
How it implements the components¶
Accession Numbering Protocol realizes the handle-shape side of the archetype — the structure of the identifier, not the checks or records around it:
handle_shape_rule— the protocol is the shape rule: it fixes the field grammar, separators, and allowed values every minted handle must conform to.path_encoded_hierarchical_identifier— it encodes the referent's position in a hierarchy directly into the handle as a segmented path.
It does NOT verify that a given number is well-formed or catch transcription errors (that's Check-Digit or Format Validation), guarantee that two records don't denote the same entity (that's Collision Detection Review), or generate opaque random tokens for cases where encoded meaning is undesirable (that's UUID or Random Token Generator).
Related¶
- Instantiates: Durable Identifier Binding — the protocol supplies the meaningful, structured handle shape the minting workflow issues.
- Sibling mechanisms: Check-Digit or Format Validation · Identifier Minting Workflow · Identifier Registry · Alias Redirect Table · Persistent Identifier Resolver · Collision Detection Review · Identifier Lifecycle Register · Identifier Reservation Queue · Namespace Prefix Registry · UUID or Random Token Generator
Editorial Notes¶
Form Classification¶
Form family: Rule, Policy & Commitment
Rationale: The mechanism is a rule for minting structured, sequential identifiers whose shape encodes collection, order, and hierarchy, so the number itself is human-readable and self-locating, so its operative form is a standing rule, policy, threshold, or commitment.
Independent corroboration: The frozen evidence defines Accession Numbering Protocol as 'A rule for minting structured, sequential identifiers whose shape encodes collection, order, and hierarchy, so the number itself is human-readable and self-locating', so its operative form is Rule, Policy & Commitment.
Nearest alternative: Protocol, Workflow & Routine — It defines a reusable identifier-minting rule rather than an ordered multi-step workflow.
Review outcome: Independent reviewer agreement; medium confidence.
Origin Attribution¶
Primary origin: Material Culture & Museum Studies
Origin pattern: Single lineage
Present-day reach: Specialized
Rationale: Accession numbers encoding year, acquisition lot, item order, and collection hierarchy are canonical museum collection-management practice.
Related originating lineages:
- Library & Information Science — Cataloging, identifier design, authority control, and machine-parseable metadata provide the neighboring information-management lineage.
Review resolution: Museum accession practice is the agreed direct lineage, with library and information science as the adjacent cataloging tradition. Computing is an implementation substrate rather than a materially independent origin.
Review outcome: Reconciled after independent review; high confidence.
Notes¶
Accession numbering and the UUID / random-token generator are the two poles of handle design — meaningful-and-guessable versus opaque-and-stable. Mature systems often run both: a dumb internal key that never has to change carries the durable binding, while a structured accession number serves as the human-facing label mapped onto it. Choosing between them is an architectural decision about who reads the identifier and how much the encoded meaning is expected to move.
[n1] The database-design caution against intelligent keys (also "smart keys") — identifiers that embed meaningful attributes rather than being arbitrary. The standard warning is that any attribute encoded into a key becomes expensive to change, so a key should encode only what is truly immutable. It is the exact risk an accession scheme takes on in exchange for legibility. ↩