cs.LOJan 22, 2026

Referential Regimes: Transformation-Based Identity Profiles for Neutral Substrates

Authors: Denise M. Case

Organizations: Northwest Missouri State University, Computer Science and Information Systems, Maryville, MO, USA

Abstract

Data systems operating under persistent legal, institutional, and analytic disagreement require shared reference without presupposing agreement about interpretation. This paper investigates identity preservation under transformation, building on the conditional neutrality result of Neutral Substrates (arXiv:2601.14271). We pair candidate identity bases with families of record transformations and classify each family as preserving, breaking, neutral, or inapplicable for a basis. Using invariant-defined identity bases and explicit effect models, we derive and certify six classification cells in Lean 4 for scope decomposition, rule refinement, and forking. The derivations show how classifications depend on field granularity, admissible transformation steps, and explicit continuity warrants. We also characterize the identity relations generated by invariant-preserving steps. Two bases generate equal relations exactly when they agree on the preservation of every admissible step in a shared comparison domain, and a single separating step witnesses a difference. The formalization makes identity claims auditable, provides testable conditions for systems that transform records, and exposes the assumptions behind each classification. The results are conditional on the declared bases, models, and warrants, whose adequacy for particular referents requires independent justification.

Figures & tables

Explore similar work

Jul 22, 2026

Operational Identity: A Finite Audit of Declared and Implemented Rules of Sameness

A record system declares when two records refer to the same entity, occurrence, scope, or rule. Its disclosed implementation mechanisms induce a corresponding operational identity relation. The declared and implemented relations may diverge systematically without producing a provenance gap or detectable contradiction. A system can apply, consistently and with every record individually correct, a rule of sameness that no artifact declares. This paper formalizes that implemented relation. A declared identity regime partitions a finite record domain into co-reference classes; a disclosed mechanism, through its typed identity-relevant outcomes, induces an operational identity partition of the same domain. The audit compares these partitions in the refinement lattice. A mechanism is faithful when the declared partition refines the operational partition, so no declared class is split. A divergence witness is a pair the declaration merges and the mechanism separates; such witnesses are decidable by pair enumeration. When an imported sibling basis also splits a declared class, local comparison with its partition yields sibling-aligned, sub-sibling, super-sibling, or sibling-incomparable divergence. This result reports only the relationship; it does not identify the basis carried by the mechanism. Global equality of the operational and sibling partitions is defined separately as regime substitution and does not follow from sibling alignment. A version field incremented on every textual edit inhabits the sub-sibling case by splitting declared classes more finely than either imported basis. The audit is three-valued and relative to the disclosed artifacts, evaluated surfaces, and identified uses; each boundary has a finite refuting witness. A passing verdict is non-monotone because extending the transformation history can merge declared classes and create a witness among records already examined.
Jan 8, 2026

Neutral Substrates: A Design Constraint for Shared Records Under Persistent Interpretive Disagreement

Shared accountability records must often remain useful to parties who disagree about causation, responsibility, and normative interpretation. Suppressing these claims would erase information needed for accountability; asserting one disputed interpretation as foundational would privilege it. A neutral substrate instead separates shared referential commitments from attributed interpretive assertions. This paper formalizes that separation through admissible frameworks, referential commitments, permitted attributions, interpretive non-commitment, and extension stability. Under Referential Common Ground, restricting every substrate-layer commitment to a referential commitment or a permitted attribution proposition is sufficient for semantic neutrality relative to every admissible framework. It is not a design-time guarantee: such a guarantee requires a permitted basis establishing the neutrality result, rather than only its truth. The essential assumption is joint compatibility of the complete referential commitment set with each admissible framework. Separate compatibility of individual commitments is not sufficient, and admissible frameworks need not be mutually consistent. Furthermore, the formal referential interfaces do not independently establish the identity criteria, denotation relations, attributional bases, or interpretive adequacy required by a particular application. When those premises cannot be justified, neutrality cannot be certified by the present construction. The contribution is a precise conditional layer restriction and an explicit account of its semantic and scientific boundaries. Attribution and provenance are established representational mechanisms; their presence alone cannot establish referential fixing.
Jun 30, 2026

A Category Theory Account of AI Identity

Artificial intelligence (AI) systems are routinely modified after deployment through retraining and changes in their environments. These transformations raise a metaphysical question: under what conditions does an AI system remain the same system over time or across deployments? Earlier work formulates synchronic and diachronic identity propositionally, by relating identity within a fixed AI system type to equality of trustworthiness levels. Such criteria specify when identity statements are true, but leave implicit the structure of the states compared, the transformations connecting them, and the temporal organization of persistence. We develop a category-theoretic formalization of AI identity. An AI system type is specified by a datum consisting of a techno-function, a trustworthiness profile, and a trustworthiness-level function. Profile-relative states are connected by admissible lifecycle paths, which are restricted to trustworthiness-level-preserving transformations and quotiented to obtain a reachability category. Temporally admissible functors represent AI system histories, while time-synchronous natural transformations compare realized histories. The formalization yields two categorical interpretations of the earlier AI identity criteria. A weak interpretation recovers identity as equality of trustworthiness level. A strong interpretation requires mutual trustworthiness-preserving reachability, expressed through state isomorphism or natural isomorphism of realized histories. Category theory therefore replaces a single AI identity relation with a structured hierarchy of diachronic and synchronic criteria. The resulting framework identifies identity-related preconditions for transferring responsible-AI claims, evidence, and governance procedures across versions or deployments, without treating categorical identity as sufficient by itself for such transfer.