Cross-reference Relation¶

Connect two controlled-vocabulary entries with a typed directed half-edge drawn from a small closed inventory (USE, UF, BT, NT, RT, SA), each carrying a stipulated direction, symmetry, inverse-pairing obligation, and system action — turning a flat term list into a maintainable navigable graph.

Core Idea¶

A cross-reference relation is a typed directed pointer between two entries in a controlled vocabulary telling both user and system how to move between them — what the relationship is, in which direction it runs, and what to do when it is followed. Thesaural standards define a small closed inventory: USE, UF, BT, NT, RT, SA, each with stipulated semantics. The closure is load-bearing: a fixed set can be consistently applied by indexers and reliably interpreted by systems, converting a flat list into a typed navigational graph.

Scope of Application¶

The cross-reference relation lives within controlled-vocabulary navigation — the thesaural subfields where a closed inventory of typed directional half-edges governs how a searcher moves among curated descriptors.

Library and thesaural indexing (LCSH) — USE/UF route searchers to preferred descriptors, BT/NT establish the browse hierarchy.
Biomedical indexing (MeSH) — the same closed inventory drives PubMed retrieval.
Domain thesauri (AAT, ERIC) — essentially the same set with minor terminological variation.
Thesaurus maintenance practice — the inverse-pairing discipline of repointing incident half-edges on add, rename, or retire.

Clarity¶

Naming the cross-reference relation makes legible that a thesaurus's pointers are typed and closed, not generic "related" links — the closure being what separates a thesaurus from a tag list. The question stops being "are these connected?" and becomes "which defined type holds, in which direction, and what is the system contracted to do?" It sharpens that directionality and symmetry are part of the type, and separates navigation within a scheme from equivalence between schemes.

Manages Complexity¶

The relationships among a large vocabulary's terms are an open-ended tangle. Closing the inventory to a fixed set collapses that space to a finite stipulated one where every pointer carries a defined direction, symmetry, and system effect. Maintenance reduces to enforcing a known table of inversions; navigability reduces to one checkable property; and the recall problem collapses to USE's silent routing, keeping the indexed heading space finite and canonical without combinatorial bloat.

Abstract Reasoning¶

Treating every pointer as a typed directional half-edge licenses a diagnostic reading maintenance faults off the graph (unpaired inverse, dangling USE, unrouted variant, duplicated descriptor), an interventionist prediction of a pointer edit's navigational effect (retyping changes the system contract, not just a label), a boundary-drawing adjudication of which type holds and navigation-versus-equivalence, and navigability and recall guarantees that follow from closure as their precondition.

Knowledge Transfer¶

Within controlled-vocabulary navigation the concept transfers as mechanism with its closed inventory and diagnostics intact, carrying across LCSH, MeSH, AAT, and ERIC as co-instances of one navigation-design discipline. Beyond thesaural practice a genuine shared mechanism recurs wherever pointers are typed and curated from a closed inventory (man-page SEE ALSO, ISO cross-references, legal-citation typologies), carried by the parent typed-directed-graph primes network, hierarchy, equivalence_relation, and dependency; generic untyped web "see also" links are mere analogy, and the specific USE/UF/BT/NT/RT/SA inventory stays home. dag_edges:

Relationships to Other Abstractions¶

Current abstraction Cross-reference Relation Domain-specific

Parents (5) — more general patterns this builds on

Cross-reference Relation is a kind of Governed Relation Vocabulary Domain-specific

USE/UF/BT/NT/RT/SA is the intra-scheme retrieval species of a governed relation vocabulary, with direction, inverse maintenance, and follow action per type.
Cross-reference Relation is a kind of Relation Prime

Cross-reference Relation is a specialization of Relation, retaining the parent's defining structure while adding the child's specific commitments.
Cross-reference Relation is part of, conditional Hierarchy Prime

The BT/NT branch contains a Hierarchy: asymmetric broader/narrower levels with inverse-paired upward and downward traversal.
Cross-reference Relation is part of, conditional Alias-to-Authority Mapping Prime

The USE/UF branch contains Alias-to-Authority Mapping: non-preferred terms resolve asymmetrically to one preferred descriptor and aggregate there.
Cross-reference Relation is a decomposition of Network Prime

Removing thesaurus vocabulary leaves curated nodes joined by directed, typed edges whose whole connection pattern determines reachability and navigability.

Children (1) — more specific cases that build on this

Authority Record Domain-specific is part of, typical Cross-reference Relation

Cross-reference Relation is typically an internal constituent of Authority Record; removing that role breaks part of the child's defining mechanism.

Hierarchy paths (12) — routes to 9 parentless roots

Cross-reference Relation → Governed Relation Vocabulary → Schema → Abstraction

Show alternative paths (11)

Neighborhood in Abstraction Space¶

Cross-reference Relation sits in a crowded region of the domain-specific corpus (33^rd percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Surface Form & Underlying Structure (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12