Typed Identity-Relation Edge¶
Graph construct — instantiates Aspect-Scoped Identity Projection
Represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules.
A Typed Identity-Relation Edge models the connection between a bearer and one of its aspects as an explicit, named edge in a graph — (person) —[:ACTS_AS]→ (student), (company) —[:LICENSED_AS]→ (operator) — where the edge itself is a first-class object with a type, properties, and rules. Its defining idea is that the linkage is the mechanism: it does not store the aspect's data, name it, or grant it rights; it makes the relationship between bearer and aspect queryable, typed, and rich enough to carry its own metadata — including which aspect's claims take precedence when two edges disagree, and a label announcing what kind of link this is. Where other siblings build the aspect, this one builds the edge that binds it to the bearer without collapsing them into one node.
Example¶
An identity-graph platform models people, organizations, and their many roles as nodes, and every bearer-to-aspect relationship as a typed edge. A single person-node connects by [:EMPLOYED_AS] to an employee node at one company, by [:BOARD_MEMBER_OF] to a director node at another, and by [:AUTHORS_UNDER] to a pen-name node. Each edge is typed, so a query can ask "show every organization where this person is a director" by traversing only BOARD_MEMBER_OF edges, ignoring the rest.
Because the edge is first-class, it carries its own properties. The EMPLOYED_AS edge holds the start date and a precedence marker; when the employee aspect and the person's public profile assert different contact emails, the edge's rule says the employer node wins for work contact while the person node wins for personal — a conflict resolved on the link, not by overwriting either node. And the edge's type label is itself informative: traversing the graph, a reviewer sees not a bare arrow but "employed-as," "board-member-of," "authors-under," so the nature of each bearer-aspect bond is legible. The person node stays single; the aspects stay linked and distinct; nothing collapses.
How it works¶
- Reify the relationship. Make the bearer-aspect link an edge object in its own right (a labeled relationship in a property graph, or a reified statement in RDF), not an implicit foreign key.
- Type the edge. Give it a relationship type that names the kind of aspectual bond, so traversals can filter by kind and the graph stays semantically legible.
- Hang rules and metadata on it. Because it is first-class, the edge carries properties — validity dates, precedence, provenance — that describe the linkage rather than either endpoint.
- Resolve clashes at the edge. When two aspects assert conflicting facts, the edge's precedence rule decides which claim wins in which context, keeping the resolution attached to the relationship.
Tuning parameters¶
- Edge type vocabulary — how many distinct relationship types the model uses. A rich vocabulary makes traversals precise but grows the schema everyone must learn.
- Reification depth — whether the edge carries a handful of properties or is a full node-like object with its own edges. Deeper reification captures more about the link but complicates queries.
- Direction and cardinality — whether edges are directed, and how many aspects of a type one bearer may have. Constraints catch bad data; looseness models messy reality.
- Precedence expressiveness — how nuanced the conflict rule on the edge can be (a flat priority versus per-context resolution). More nuance resolves subtler clashes but is harder to reason about.
- Label discipline — whether type labels come from a controlled ontology or are ad hoc. Controlled labels keep traversals reliable; ad hoc ones drift into synonyms that fragment queries.
When it helps, and when it misleads¶
Its strength is that it makes the web of aspects explicit and navigable. Any question about how a bearer relates to its capacities — and how those capacities relate to each other — becomes a typed traversal, and because the link is first-class it can carry the precedence rule that stops conflicting aspect-claims from silently overwriting one another. This is reification in the classic sense: turning a relationship into an addressable object so you can say things about it.[n1] When the hard part of a domain is the relationships rather than the records, this is the archetype's sharpest instrument.
It misleads when the graph grows faster than its discipline. Untyped or synonym-typed edges (ACTS_AS, IS_A, PLAYS_ROLE all meaning the same thing) fragment traversals so queries silently miss data — the graph looks rich but answers wrong. The classic misuse is letting the edge accrete so much data that it quietly becomes the aspect's record, duplicating what a record type should own and drifting from it. And precedence rules scattered across thousands of edges become impossible to audit. The guarding discipline is a controlled relationship vocabulary, keeping the edge to linkage and precedence rather than aspect payload, and centralizing conflict policy so the rules on edges are instances of a few reviewed patterns rather than one-offs.
How it implements the components¶
cross_aspect_linkage— the typed edge is the linkage: an explicit, queryable bond between bearer and aspect (and between aspects) that keeps them related without merging them.aspect_conflict_resolution_rule— the precedence metadata on the edge decides which aspect's claim wins in which context, resolving clashes on the relationship itself.aspect_visibility_label— the edge's relationship type is a visible label announcing what kind of bearer-aspect bond it is as the graph is traversed.
It does not implement underlying_bearer_anchor, aspect_or_role_selector, or property_inheritance_and_exclusion_map — this edge connects a bearer to an aspect but does not itself constitute the bearer, pick the aspect's role, or distribute properties across levels; that layered property structure belongs to its nearest twin, Work / Expression / Manifestation / Item Model, which arranges aspects into a fixed abstraction ladder rather than free-form typed edges.
Related¶
- Instantiates: Aspect-Scoped Identity Projection — the relationship-side mechanism that makes bearer-to-aspect bonds explicit, typed, and navigable.
- Sibling mechanisms: Work / Expression / Manifestation / Item Model · Aspect Lifecycle Register · Legal Capacity or Status Record · Role-Based Access Profile · Role-Scoped Record Type · Scoped Namespace Suffix · Database View or Entity Projection
Editorial Notes¶
Form Classification¶
Form family: Structure, Architecture & Configuration
Rationale: Typed Identity-Relation Edge operates as a configured physical, technical, or logical arrangement whose structure creates the effect because it represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules.
Independent corroboration: The frozen evidence defines Typed Identity-Relation Edge as 'Represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules', so its operative form is Structure, Architecture & Configuration.
Nearest alternative: Representation, Specification & Plan — Typed Identity-Relation Edge includes features of a static representation, map, specification, schema, or prospective plan that externalizes information, but its defining operation is a configured physical, technical, or logical arrangement whose structure creates the effect.
Review outcome: Independent reviewer agreement; medium confidence.
Origin Attribution¶
Primary origin: Computer Science & Software Engineering
Origin pattern: Cross-disciplinary synthesis
Present-day reach: Specialized
Rationale: Representing entity-aspect identity as a first-class typed edge is graph and ontology modeling. RDF defines predicates as binary relations with domain and range typing, while PROV distinguishes specialization and alternate aspects of the same thing; management supplies review policy, not the representation lineage.
Related originating lineages:
- Engineering & Design — Engineering design, reliability, and systems-safety practice supplies a parallel or contributing lineage for the mechanism's defining operation: represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules.
- Library & Information Science — Library and information-science stewardship supplies a parallel or contributing lineage for the mechanism's defining operation: represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules.
- Organizational & Management Science — organizational_management contributes organizational design, management, and operational governance to this mechanism's defining operation—Represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules—without displacing the selected primary historical lineage.
- Philosophy — Philosophical logic, epistemology, and normative reasoning supplies a parallel or contributing lineage for the mechanism's defining operation: represents the bond between an underlying entity and one of its aspects as a single typed, first-class edge that can carry its own precedence and conflict rules.
- Systems Thinking & Cybernetics — Feedback, system boundaries, stocks, flows, and regulation supplies a distinct formative lineage for the mechanism's typed identity relation edge logic.
Review resolution: The blind reviewers disagree on primary lineage (organizational_management versus computer_science). Authoritative or primary research supports computer_science as the best historical origin: Representing entity-aspect identity as a first-class typed edge is graph and ontology modeling. RDF defines predicates as binary relations with domain and range typing, while PROV distinguishes specialization and alternate aspects of the same thing; management supplies review policy, not the representation lineage. The cited W3C Recommendation, RDF 1.1 Primer; W3C, Semantics of the PROV Data Model directly supports the mechanism's defining operation. All independently supported contributing domains are retained without an arbitrary cap. origin_mode=cross_disciplinary_synthesis records lineage, while domain_reach=specialized records later applicability separately from provenance.
Encyclopedia synthesis: The exact catalogued form synthesizes established practice rather than reproducing a single standard historical label.
Review outcome: Researched adjudication after independent review; high confidence.
Sources consulted:
Notes¶
[n1] Reification is the modeling move of treating a relationship or statement as an object you can describe — in RDF, turning a triple into a resource so properties (source, confidence, validity) can be attached to it. A typed identity-relation edge is reification applied to the bearer-aspect bond. ↩