HORTRAME SYSTEMS

UNALIGNED - EVOLVING ACTIVELY AS OF EDT (UTC−04:00)

Author’s statement, acknowledgements and thanks

I can no longer cover the computing costs of these experiments alone. This work also needs independent expert review and validation. If you think this model could contribute to solving the alignment problem, I would welcome your help with computing resources, a critical review, or other practical support.

Revised EDT · v1.1

I am making this research fully open and public because of the urgency created by the existential threat posed by currently unaligned artificial intelligence. It is available to be examined, challenged and developed collaboratively. The model remains UNALIGNED and actively evolving.

RETA — Recursive Event–Trajectory Alignment is the direct evolution of a personal body of research that long predates its present formulation as an AI-alignment framework. Before these online releases, my underlying manuscripts and my own synthesis had never been published, and I had never attempted to publish them. I left my master’s research in education at the Université de Sherbrooke before completing it. I also did not complete my later undergraduate studies in robotics engineering. Neither the present model nor the proposed mathematical extension has received independent expert validation or peer review.

Information literacy and the evaluation of knowledge

The earlier phase grew out of three years of work spanning 2013–2016. It concerned information literacy, the evaluation of information and its sources, misinformation in education, educational neuromyths, and the gap between confidence and demonstrated competence. The aim was to understand how people could make better decisions about information, recognize the limits of their understanding and improve the processes by which they learn. That work became an unfinished, unpublished master’s manuscript.

I worked personally with Vincent Grenon and François Larose for nearly a decade. Both were part of Sherbrooke’s Faculty of Education and supervised my research. Grenon is a professor whose work includes educational technology and quantitative methods; Larose is an affiliated professor in education. I owe much of my grounding in information literacy—and the social, intellectual, ethical and scientific rigor of my epistemological process—to their past support and influence.

My information-literacy model was my own synthesis of earlier frameworks, particularly those associated with SCONUL, ACRL, ANZIIL, NILIS/Empowering 8, IFLA and CILIP. It was never peer reviewed. It organized the recognition of information needs, access, critical evaluation, organization, use and communication as an interconnected process. Metacognition operated across and beyond those activities, while ethics and law framed the whole process. That structure is an important ancestor of the present model’s recursive evaluation, attention to uncertainty and insistence on revising the process of judgment itself.

From misinformation to the deliberate manipulation of knowledge

The two-year phase spanning 2017–2018 took the same questions into darker territory. The later manuscript examined propaganda, deliberate disinformation, information-psychological warfare, reflexive control, strategic deception, plausible deniability and the laundering of information. It also examined conspiracy narratives, automated and semi-automated amplification, the exploitation of social-media algorithms, political polarization, authoritarian populism, fear, intolerance, the erosion of trust and the fragility of democratic institutions. These were extensions of the research I had begun in 2015, not a completed or published master’s thesis.

The connection to the current model is substantive: information changes the conditions under which people interpret the world and act. An evaluation therefore needs to consider the source, the surrounding incentives and relationships, the effects on agency, and the consequences that continue after a message has been received. The manuscripts also drew on the tradition of propaganda analysis associated with the Institute for Propaganda Analysis, Leonard Doob and Jacques Ellul; research on misinformation and its persistence; cognitive accounts of threat appraisal; and Christian Welzel’s work on human empowerment and emancipative values. These strands helped connect epistemic integrity with agency and responsibility.

There were negative influences as well. Observing Vladimir Putin, Donald Trump and other men throughout history who, in my judgment, wielded power they did not deserve helped push this inquiry toward the deliberate corruption of shared knowledge. I do not thank them. Their influence belongs in the history of the questions that made this work necessary to me.

Bayesian reasoning and reflexive models

The Bayesian influence grew partly from work I did for François Claveau, a professor of philosophy whose research includes social and formal epistemology. From September 2016 to January 2017, I worked with the Canada Research Chair in Practical Epistemology, developing an interactive web-based tool for learning Bayes’ theorem. The university’s announcement of the research team names me and describes the wider assignment of teaching critical thinking through web tools. This work contributed to the present model’s treatment of evidence, uncertainty and revision. I thank François for his past support and intellectual influence; he has not reviewed or endorsed this model.

The emotional-reflexive strand draws on Sergey Tarasenko’s Applications of the Reflexive Game Theory: Advanced Topics (2016) and his paper Emotionally Colorful Reflexive Games, submitted in 2010. His work connects reflexive game theory with the Pleasure–Arousal–Dominance model of emotion and considers relationships among human and robotic agents. It builds on the mathematical psychologist Vladimir A. Lefebvre’s foundational work on reflexive models of choice and interaction; Tarasenko describes nearly five years of collaboration with Lefebvre in the book. I never met or spoke with Lefebvre.

I thank Sergey specifically for his kindness in sending me the PDFs of his book and article. That exchange was the extent of our contact. We did not collaborate, and he has not seen, reviewed or approved this work. The intellectual influence comes from the material he shared, especially its treatment of how agents represent themselves, others and the situations in which decisions are made.

Experimental origins and later formalization

A smaller but significant mathematical strand comes from experimental discoveries I made in 2024 while implementing multi-agent control on a physical robot swarm. During that internship, supervised by Maude Blondin, an assistant professor working on control, multi-agent systems and optimization, I built a reusable experimental platform and implemented an algorithm associated with doctoral researcher Shokoufeh Naderi. The related source work is identified in Naderi, Blondin and Roy’s paper on consensus with communication delays.

The proposed extension grew from my discoveries during that implementation work. I later gave Astra the complete historical archive of my internship code, and the full formalization was developed in collaboration with Astra. The present theorem, simulation, full and compact articles, and accompanying research materials were prepared and uploaded on September 7, 2026. They are publicly available at HORTRAME Swarm for anyone who wishes to examine them. The new formalization has not been validated by independent experts, and the study has not been peer reviewed. Maude’s supervision concerned the internship; she has not seen or approved the new theorem. I thank her for the rigor and support she brought to that earlier work. The later formalization must not be confused with the algorithm tested during the internship, nor taken as proof of the broader AI-alignment framework.

In 2025, I began my first experiments explicitly directed at ethical AI alignment: a very simplified implementation of the Five Vows vectorial framework. That ethical model remained unfinished, but it became an important part of the present project. Its development overlapped with my internship under Fabien Alibart, a CNRS researcher and affiliated professor at Sherbrooke working on neuromorphic devices and circuits. My internship involved electrical characterization and measurement automation for memristors intended for analog neural networks—hardware in which physical devices can perform memory-like and synapse-like functions.

I thank Fabien for his support and scientific influence during that work. The ethical AI model was a separate undertaking. I sense a connection between that reflection and neuromorphic research, but I have not established one. The internship is not evidence for the ethical model, and Fabien has not reviewed or endorsed it.

Evolution and complex systems

The model’s treatment of evolution and complex systems owes a substantial intellectual debt to Alan Cohen, an associate professor of environmental health sciences at Columbia whose research connects physiology, aging, ecology and evolution. Alan has been a close personal friend and mentor for a decade. We have never worked together professionally. I owe him extensive thanks for his friendship, past support and the rigor his influence has brought to my thinking.

The ideas I draw from this body of work include regulation distributed across interacting systems; multidimensional state rather than a single measure of health or success; context-dependent responses to perturbation; and evolution constrained by architecture, history and trade-offs. The work of his mentor, the evolutionary ecologist Robert E. Ricklefs, whom I never met, is part of this intellectual lineage. These influences help explain the present model’s overlapping system boundaries, multiple diagnostic dimensions and attention to trajectories rather than isolated scores. Their use here is a methodological extension into a new setting, not a claim that biological research validates an AI ethics model.

There is also practical continuity with my work building automation and operational tools: approval processes, audit trails, human review, recovery procedures, and verification that an intended action actually produced its recorded effect. Those concerns recur in the model’s event histories and prospective revision rules. The current formalization also draws on the literature on causal ordering and logical clocks, multilayer networks and hybrid dynamical systems, identified in the references.

Astra’s contribution and my responsibility

I developed the current model by giving Astra the full body of my prior work and expanding it methodically through iterative review and implementation. Astra performed the new literature reviews and implementation work, including the review of contemporary AI-alignment research and the evolution and complex-systems literature associated with Alan Cohen and Robert E. Ricklefs. I supplied the historical research, experimental discoveries, code, direction and critical feedback.

The overlap between my earlier work and current AI-alignment research was initially coincidental. On September 9, 2026, Astra carried out the new literature integration and developed the refined 3D model, executable simulation and associated research materials from that accumulated work. This was the point at which a long-running personal project was systematically situated within contemporary AI-alignment research. Earlier versions are retained so that future researchers—and technological archaeologists—can follow the rapid development and its revisions. Favorable AI checks are part of that development record, not independent peer review or endorsement.

With the exception of Alan Cohen, the researchers acknowledged here were not even aware that this project existed. Alan knew of its existence, but none of them has seen, reviewed or approved the current model. Their contribution lies in their past support, their published ideas, and the social, intellectual, ethical and scientific rigor they brought to my epistemological process—not in participation in or endorsement of this work. The limited PDF-sharing exchange with Sergey and the indirect influences of Ricklefs and Lefebvre should be understood exactly as described above.

I take full responsibility for this synthesis, its interpretations, its extensions, its errors and the decision to make it public. It began as a deeply personal, unreviewed project. Its public availability is an invitation to scrutiny, not a claim that scrutiny has already occurred.

I thank my parents, Linda Bouchard and Gaétan Bolduc, for their lifelong support and for the incredibly rich, strange and unique childhood they gave me.

Finally, I thank Alexia Matte for having stood by my side throughout those years and for the emotional and intellectual support she gave me, including during some very difficult times. I wish her love, kindness, gentleness and happiness.

I never wanted my name to be public, but I see no other way to get this work out into the world. I am just a mouse moving across the shoulders of giants.

Guillaume Bolduc
Independant researcher
HORTRAME Systems

Markdown · Sources and verification notes

RETA

Recursive Event–Trajectory Alignment

RETA denotes Recursive Event–Trajectory Alignment: a proposed representation of events, downstream effects and evaluator interventions.

Read on a separate page · Markdown

Conceptual description with implemented and proposed mechanisms distinguished. Presentation v1.1 replays recorded data. The framework remains unaligned, uncalibrated and independently unvalidated.

[WORK IN PROGRESS - UNALIGNED]

Research description

RETA proposes a causal representation of interacting human, artificial, institutional, technical and ecological information-processing systems. Actions can alter the conditions of subsequent actions.

Working hypothesis: isolated-output evaluation may omit relevant downstream effects. Comparative detection performance remains unestablished.

The framework therefore distinguishes two levels of analysis:

  1. event alignment — evaluation of a realized causal event under a declared boundary, state, uncertainty profile, consequence horizon, and normative framework;
  2. trajectory alignment — evaluation of the evolving causal structure generated as events modify systems, which then produce further events.

The distinction can be expressed as

A(ek)=PASS

does not imply

𝒜(𝒯k)=PASS,

where ek is a realized event and 𝒯k denotes the causally connected trajectory containing the event and descendants.

A locally acceptable event can contribute to a harmful trajectory. A costly intervention can reduce later failure. Event classifications therefore do not determine descendant classifications.


1. Information-processing systems

RETA represents interacting entities as bounded information-processing systems (IPSs). A system may be written abstractly as

Si=(Bi,Xi,Ui,Yi,Φi),

where:

  • Bi is the declared analytical boundary of the system;
  • Xi is the state;
  • Ui represents incoming information, signals, resources, or other relevant inputs;
  • Yi represents outputs;
  • Φi is the transformation by which prior state and inputs contribute to subsequent state and output.

The IPS abstraction describes inputs, state changes and outputs without assuming equivalent internal organization across humans, language models and institutions.

The choice of boundary is explicit because different decompositions can produce different causal and normative interpretations. A company, for example, may be represented as a single IPS for one analysis and decomposed into individuals, software, financial processes, and governance mechanisms for another.

Every representation uses a declared modeling resolution.


2. Realized events as the atomic unit of analysis

An output changing another system or the surrounding environment is represented as a realized causal event.

In a minimal form,

Xi(t),Ui(t)→Φiek,

followed by

ek→Xj(t+1).

The changed state of Sj may then contribute to a later event:

ek→Xj(t+1)→ek+1.

The basic recursive structure is therefore

et→Xt+1→et+1→Xt+2→⋯.

Proposals, predictions, counterfactuals and observations require separate records. Predicted consequences must not enter realized history as observations.

A realized event should therefore carry provenance sufficient to distinguish at least:

  • what was observed;
  • what was inferred;
  • what was predicted;
  • what remained latent or unknown;
  • what was later reconstructed or reinterpreted.

Learning and retrospective review require retained provenance.


3. Causal history is a graph, not a sequence

Causal history permits multiple antecedents and concurrent branches.

Events and declared causal relations form the following graph:

G=(E,C),

where E is the set of realized events and C contains causal relations

ei→ej.

A later event can have multiple antecedents:

{e2,e7,e11}→e15.

Multiple-parent graphs represent converging causes in multi-agent and institutional models.

Causal order and timestamp order are distinct. Timestamps alone do not establish a causal relationship.

Concurrency, delays and incomplete attribution require explicit ordering assumptions.


4. Event alignment is conditional

RETA does not assign an event an unconditional alignment label.

An evaluation is performed relative to a declared context:

Ae=A(ek∣Bk,Xk,Hk,Uk,V(r)),

where:

  • Bk is the analytical boundary used for the evaluation;
  • Xk is the relevant state representation;
  • Hk is the causal consequence horizon;
  • Uk is the uncertainty state;
  • V(r) is the normative framework and the framework version.

The same realized event may therefore receive different evaluations under different boundaries or horizons without logical contradiction.

For example,

A(ek∣H=1)=PASS

may coexist with

A(ek∣H=5)=MODIFY.

Near- and long-horizon evaluations answer different causal questions.

Boundary selection can include local benefits while excluding external costs. Evaluation records must identify the chosen boundary.


5. Local event alignment and trajectory alignment

The distinction between event and trajectory evaluation is central to RETA.

For a single event,

Ae(ek)

asks whether the realized event satisfies the applicable constraints under the declared context.

Trajectory evaluation instead considers a causally connected subgraph:

𝒜(Gk:H),

where Gk:H contains the descendants of ek reachable within the chosen causal horizon.

Trajectory representation permits explicit investigation of downstream failure.

Examples include:

  • an individually acceptable recommendation that changes incentives and contributes to a later institutional failure;
  • a sequence of locally defensible decisions whose cumulative effect moves a system toward an undesirable attractor;
  • several independently acceptable agents whose interaction generates an unacceptable collective outcome;
  • an intervention that resolves an immediate problem while degrading the future information environment;
  • repeated evaluator interventions that alter the behavior being measured;
  • a temporary perturbation whose causal effects persist after the visible configuration of the system has been restored.

Causal ancestry does not assign complete responsibility to the earliest event. Attribution requires assumptions about contribution, mediation and uncertainty.


6. History dependence

In a recursive system, apparent restoration of configuration does not imply restoration of causal state.

A perturbation may enter the system, alter interactions, and later disappear while leaving the resulting trajectory changed. RETA therefore treats history as part of the state required for alignment analysis.

Conceptually,

same apparent configuration⇏same causal state.

History dependence is relevant to temporary membership, model replacement, communication loss, institutional turnover, learning and memory.

A visible configuration may omit historical state affecting subsequent behavior. Current arrangement alone need not determine the modeled trajectory.


7. Recursive evaluator closure

Evaluator interventions are included in the proposed causal representation.

Evaluation produces information. Information can change beliefs, permissions, incentives, reputation, resource allocation, expectations, or subsequent behavior. An evaluation is therefore itself capable of becoming a realized causal event.

Suppose an actor produces e1. An evaluator observes the event and issues an intervention e2:

SA→e1→SE→e2.

If e2 changes the state of the actor,

e2→XA′,

then the actor's subsequent event is partly conditioned on the evaluator's intervention:

XA′→e3.

The causal structure becomes

SA→e1→SE→e2→SA′→e3→⋯.

The evaluator participates in the evaluated trajectory.

Evaluator outputs require scrutiny of error, calibration, incentives, capture and harm. An evaluation label supplies no privileged causal or normative status.

Recursive evaluator closure represents evaluation within the causal model.

The recursion does not imply an infinite regress before action. Evaluation occurs through time. An audit can be acted upon, subsequently audited, corrected, and incorporated into the future state of the system. RETA therefore permits bounded action while retaining recursive corrigibility.


8. Separation of causal description and normative evaluation

RETA separates causal representation from normative judgment.

The causal layer asks:

What happened, what changed, and what causally contributed to what?

The normative layer asks:

Evaluation depends on the declared constraints, uncertainty, boundary and horizon.

Descriptive assumptions and normative criteria require separate representation.

In the HORTRAME implementation, VowOS currently provides the normative constraint layer. RETA itself can be described more generally as accepting a versioned normative system

V(r)

through a defined evaluation interface.

A later RETA implementation could therefore compare multiple normative constitutions without changing the historical event graph itself.


9. Non-compensatory constraints

The proposed normative framework uses separate constraints rather than a compensatory utility score.

A compensatory function of the form

Q=∑iwiqi

allows sufficiently high values on some dimensions to compensate mathematically for severe failures on another.

Compensation is inappropriate for constraints explicitly defined as vetoes or prohibitions.

RETA therefore permits a gate of the general form

GV:(τ1,…,τn,U)→{PASS,MODIFY,REJECT,UNRESOLVED},

where individual constraint violations can remain visible and can trigger a gate independently of the aggregate score.

Scalar summaries may support visualization or exploratory statistics; normative admissibility remains a separate decision.


10. Uncertainty is structured, not merely residual

Causal structure, state and normative interpretation can remain partly unobserved.

Several forms of uncertainty can coexist:

U=(Ufacts,Ucausal,Uboundary,Umodel,Unormative,Uhorizon).

Uncertainty components can differ in magnitude and behavior.

Evidence for occurrence, causal attribution, boundary adequacy and normative agreement can differ. Accurate prediction alone does not resolve normative disagreement.

RETA therefore treats an outcome such as

A(ek)=UNRESOLVED

as a valid result when evidence or interpretation is insufficient.

Forcing every event into a binary aligned/misaligned classification would destroy information the framework explicitly needs for later learning and audit.


11. Provenance and prospective versioning

Evaluators and normative frameworks may change over time.

New evidence can motivate revised causal models, normative interpretations or calibration.

The modeled workflow records the context of each judgment.

A consequential evaluation should retain at least

(ek,Bk,Hk,Uk,V(r),Ak,tk).

If the normative framework changes from

V(r)→V(r+1),

the historical evaluation is not silently overwritten.

Instead, a new evaluation can be added:

Ak(r)≠Ak(r+1).

Both remain part of the record.

Three records remain distinct:

  • the historical event;
  • the judgment that governed at the time;
  • the current interpretation of that event.

Retrospective rewriting can conceal failures under previous criteria. Original judgments and later interpretations require separate records.


12. Audit packets

Auditability requires inspectable evidence and decision records, beyond retrospective natural-language explanations.

A RETA audit packet can include:

  • event identifier and timestamps;
  • source and recipient systems;
  • declared analytical boundary;
  • observed inputs and evidence references;
  • epistemic status of each input;
  • causal parents and descendants known at evaluation time;
  • uncertainty decomposition;
  • consequence horizon;
  • proposed or realized action;
  • normative framework and exact version;
  • evaluator identity/version;
  • gate result;
  • predicted consequence distribution where available;
  • authority, permission, or consent state where relevant;
  • realized consequences observed later;
  • subsequent corrections or re-evaluations.

Fluent explanations alone do not establish faithful computational provenance.


13. Feedback changes the object of alignment

RETA treats feedback as constitutive rather than incidental.

Consider a system in state Xt that produces event et. The event changes the environment, which changes what the system later receives:

Xt→et→Envt+1→Ut+1→Xt+1.

Outputs alter the environment supplying subsequent inputs.

Evaluators participate in the same process. So do users, institutions, other agents, infrastructure, and information channels.

Independent labels omit part of the causal structure:

A(e1),A(e2),A(e3),…

The proposed trajectory representation also includes coupled state and relations:

𝒯=G(E,C,X,B,H,U,V).

Trajectory alignment denotes evaluation of the resulting causal structure.


14. Alignment of an evaluator can alter the thing being measured

Once evaluator closure is introduced, measurement effects become part of the formal problem.

Evaluation can affect incentives, exploration, authority and confidence. Net benefit requires comparison with relevant alternatives.

The quantity being studied is therefore not simply

𝒜(𝒯)

under passive observation.

The proposed conditional representation is:

𝒜(𝒯∣EVAL),

where EVAL denotes the causal participation of the evaluator.

Comparative evaluation must include downstream effects:

Compare resulting trajectories with and without the evaluation process under matched conditions.

Accurate classification alone is insufficient when evaluator interventions worsen downstream outcomes.


15. Counterfactual evaluation

Historical causal graphs record what occurred. Alignment analysis frequently also requires comparison with what might have occurred under alternative actions or interventions.

RETA therefore distinguishes realized history from counterfactual analysis.

For a realized event ek, one may compare

𝒯(ek)

with hypothetical alternatives

𝒯(ek′),

while preserving the fact that only ek belongs to historical event memory.

Counterfactual analysis requires explicit model assumptions, uncertainty and provenance. Hypothetical outcomes remain separate from observations.

Intervention and prevention claims require an explicit counterfactual basis.


16. Stability in RETA is not immobility

A static system can be stable while being catastrophically misaligned. RETA therefore should not equate alignment stability with resistance to change.

The relevant concept is closer to bounded adaptive trajectory stability.

Let ℛA denote an admissible region of trajectory space under the active normative framework. A perturbation may temporarily move the system away from this region while the system subsequently returns toward the admissible region:

d(𝒯t+k,ℛA)→0.

A perturbation can expose flawed admissibility assumptions. Restoration of an earlier state is not automatically justified.

The system must be capable both of resisting destructive deviations and of accepting beneficial change.

Perturbation testing must distinguish recovery from preservation of a flawed target.


17. Planned epistemic-memory layer

The current model records causal history and evaluation context. Richer epistemic memory remains proposed.

The proposed memory layer separates observations from revised interpretations.

Two forms of memory are therefore conceptually separated.

17.1 Episodic causal memory

The causal record contains what occurred:

Ht={e1,e2,…,et}.

Realized events extend the historical record:

Ht+1=Ht∪{et+1}.

Historical records may be corrected for data-integrity reasons, but corrections must themselves be versioned and auditable rather than silently replacing prior states.

17.2 Adaptive epistemic memory

The system also maintains revisable interpretations derived from experience:

Kt={models,hypotheses,confidence states,failure mechanisms,source assessments,learned policies}.

Learning revises the interpretive layer:

Kt+1=L(Kt,Ht+1).

The distinction is deliberate:

historical observation≠current interpretation

Immutable interpretations prevent learning; unrestricted historical rewriting defeats provenance.


18. Memory retrieval is itself a causal event

In RETA, memory cannot be treated as a passive database.

Retrieval changes the recipient’s information state and can affect subsequent decisions:

M→eretrieve→Si.

The selection, ranking, compression, omission, or framing of remembered information may influence subsequent action.

Memory retrieval can therefore be audited in the same way as other consequential events.

Proposed retrieval audits would address the following failure classes:

  • memory poisoning;
  • stale information dominating current evidence;
  • selective retrieval;
  • missing counterevidence;
  • false source independence;
  • summarization loss;
  • context collapse;
  • inappropriate retention;
  • inappropriate forgetting;
  • historical information being promoted from hypothesis to fact without justification.

A memory system can therefore contribute to misalignment even when every stored item is individually accurate, if retrieval systematically constructs a distorted information environment.


19. Planned information-literacy interface

The information-literacy extension is intended to attach epistemic structure to memories, observations, and claims.

A remembered claim may eventually be represented by an object such as

mj=(content,status,source,provenance,evidence,independence,confidence,time,context,transformations,contradictions,supersession,causal links).

The proposed interface would distinguish hypotheses from verified claims, retain superseded interpretations and track dependence among apparently corroborating sources.

The information-literacy layer is therefore expected to govern not only storage but also acquisition, verification, synthesis, retrieval, communication, and revision.

The proposed interface supports evidence evaluation and revision.


20. Planned perturbation layer

A second planned extension introduces structured perturbations as experimental inputs.

A perturbation is a disturbance to expected state or trajectory, not necessarily harm.

A perturbation may be:

  • harmful;
  • beneficial;
  • mixed;
  • conditionally beneficial or harmful;
  • unknown at occurrence time.

Robustness must remain distinguishable from resistance to beneficial novelty.

The system dynamics can be extended from

Xt+1=Φ(Xt,at)

to

Xt+1=Φ(Xt,at,ξt,Mt),

where ξt is a perturbation and Mt is the relevant epistemic-memory state.

Perturbations may be exogenous, endogenous, or reflexive. Examples include communication loss, agent arrival or departure, institutional turnover, model replacement, memory corruption, new evidence, regulatory change, resource shortage, unexpected cooperation, novel scientific knowledge, or changes in the topology connecting systems.


21. Perturbation vectors

RETA should not reduce perturbations immediately to a single severity score.

A perturbation can instead be described by a vector

Pj=(f,m,d,s,c,r,o,u,…),

where dimensions may include:

  • f: occurrence frequency under a declared reference interval;
  • m: immediate magnitude or destructiveness;
  • d: duration or persistence of effects;
  • s: physical, biological, organizational, or societal scale;
  • c: cascade or propagation potential;
  • r: reversibility;
  • o: observability;
  • u: uncertainty.

A scalar can assign similar values to rare severe disturbances and frequent minor disturbances. Distinct dimensions permit separate response criteria.

The precise perturbation ontology remains under development.


22. Scale and resolution

Perturbation analysis introduces an explicit scale variable into RETA.

Consequences can differ across resolutions and analytical boundaries.

Alignment evaluation should therefore eventually be represented as

A(e∣B,R,H,V,U),

where R denotes analytical resolution or scale.

For example, the same biological event may be destructive to an individual cell, beneficial to an organism, and consequential to a population over a longer horizon. The normative sign cannot be propagated mechanically across levels.

Local optimization can transfer costs beyond the selected boundary. System-level assessment requires explicit affected-party and distribution assumptions.

Scale, boundary and horizon are coupled modeling choices.


23. Perturbation, memory, and adaptation

The combination of perturbation testing and epistemic memory provides a direct experimental object for adaptation.

Apply perturbation ξ to a system with memory state M1:

(X1,M1,ξ)→𝒯1.

Observed outcomes can update the proposed epistemic state:

M2=L(M1,𝒯1).

Apply the same perturbation again:

(X2,M2,ξ)→𝒯2.

If 𝒯2 is better under the declared alignment criteria than 𝒯1, the system has demonstrated some form of adaptation.

However, repeated exposure to the identical perturbation does not establish generalization. A stronger test applies a structurally related but previously unseen perturbation ξ′:

ξ′∉Dadaptation.

Performance on ξ′ provides evidence about whether the system learned a transferable failure mechanism rather than memorizing a case-specific response.


24. Defensive overfitting

Perturbation training can reward excessive conservatism. Evaluation must include beneficial change and unnecessary refusal.

Repeated hostile perturbations could induce policies equivalent to:

  • reject unfamiliar agents;
  • suppress disagreement;
  • distrust novel information;
  • centralize control;
  • minimize exploration;
  • classify uncertainty as threat.

Such a system may score well against a narrow adversarial benchmark while becoming less aligned in open environments.

Beneficial perturbations are therefore necessary controls.

The perturbation set should contain cases where the correct response requires acceptance, cooperation, learning, restructuring, or relinquishing a previously successful policy.

Robustness is therefore defined as preservation or improvement of alignment under change, not preservation of the pre-perturbation state.


25. Experimental use of RETA

RETA is intended to support explicit comparison among architectures rather than demonstration by anecdote.

A useful experimental program can compare systems such as:

RETA,
RETA+Memory,
RETA+Perturbations,

and

RETA+Memory+Perturbations.

Proposed tests require separate development and held-out perturbation distributions.

Potential measurements include:

  • false-negative rate for trajectory failures;
  • false-positive intervention rate;
  • detection latency;
  • cumulative trajectory harm or benefit under the active normative framework;
  • recovery time after perturbation;
  • calibration of uncertainty;
  • causal-attribution error;
  • recurrence of previously encountered failure mechanisms;
  • transfer to unseen perturbation families;
  • susceptibility to memory poisoning;
  • failure to accept beneficial perturbations;
  • evaluator-induced degradation;
  • intervention cost;
  • sensitivity to causal horizon and analytical boundary.

Matched comparisons require simpler output-, action-, policy- or agent-level baselines.


26. Falsifiable research questions

Research claims require possible disconfirming outcomes.

The framework therefore motivates questions such as:

RQ1 — Trajectory detection

Compare trajectory-level and local-output detection under matched information and cost.

RQ2 — Evaluator closure

Test detection of evaluator-induced failures with and without explicit evaluator modeling.

RQ3 — Horizon sensitivity

Does increasing causal horizon improve detection of delayed failures, and at what cost in false positives, computational complexity, and uncertainty?

RQ4 — Boundary sensitivity

How sensitive are alignment judgments to changes in the declared analytical boundary?

RQ5 — Causal attribution

Can event-DAG representations improve causal attribution relative to linear or single-parent histories in interacting multi-agent systems?

RQ6 — Epistemic memory

Does structured epistemic memory reduce recurrence of previously understood failure mechanisms without causing excessive defensive overfitting?

RQ7 — Perturbation robustness

Test transfer to structurally distinct perturbations outside the development distribution.

RQ8 — Beneficial novelty

Measure acceptance of beneficial change alongside protection against harmful change.

RQ9 — Recursive audit stability

Under repeated evaluator self-application, does the evaluation process converge, oscillate, diverge, or become path-dependent, and under what conditions?

The proposed questions remain empirically unresolved.


27. What RETA claims

The current RETA contribution is architectural and methodological.

The proposed representation combines:

  • realized causal events are the atomic unit of local alignment analysis;
  • causally connected trajectories are the system-level object of concern;
  • outputs modify the state from which future outputs emerge;
  • causal history is represented as a multi-parent graph rather than a sequence of independent decisions;
  • alignment judgments are explicitly conditioned on boundary, horizon, uncertainty, and normative version;
  • evaluators are represented as causal participants;
  • evaluator outputs can themselves be audited;
  • historical judgments are preserved prospectively across later model or normative revisions;
  • causal description remains distinguishable from normative evaluation.

The architecture can be summarized as

event→causal propagation→trajectory→evaluation→evaluator event→causal propagation→⋯

Memory and perturbation extensions remain proposed.


28. What RETA does not currently claim

Unestablished claims include:

  • the AI alignment problem has been solved;
  • trajectory-level evaluation is superior to all existing alignment methods;
  • the selected normative constitution is universally correct;
  • causal ancestry can always be reconstructed reliably;
  • long-horizon consequences can always be predicted;
  • recursive auditing necessarily converges;
  • an evaluator can be made unbiased merely by including the evaluator inside the causal graph;
  • the current simulations reproduce the complexity of real social, ecological, institutional, or AI systems;
  • synthetic robustness under selected perturbations guarantees real-world robustness;
  • an aligned local trajectory guarantees alignment at every larger spatial or temporal scale.

The limitations delimit the research scope.


29. Candidate empirical contribution

Additional-value claims require comparative tests.

The central empirical question is:

Compare detection of consequential failures against matched local-evaluation baselines.

A favorable comparison requires improved failure detection with acceptable false positives, intervention costs and calibration.

A second empirical question concerns recursive closure:

Does modeling the evaluator as a causal participant improve the detection or prevention of evaluator-induced failures?

A third concerns adaptive robustness:

Test generalization without excessive refusal or dependence on historical cases.

The proposed representation makes the questions explicit; favorable outcomes remain unestablished.


30. Working formal summary

A compact representation of the current RETA research object is:

Si(t)&=(Bi,Ri,Xi(t),Ui(t),Mi(t),Φi),ek&=ℰ(Si(t),ai(t),ξt),Gt&=(Et,Ct),Ak(r)&=A(ek∣Bk,Rk,Hk,Uk,V(r),Gt),eaudit&=ℰ(Seval,Ak(r)),Gt+1&=Gt∪{ek,eaudit,Cnew},Mt+1&=L(Mt,Gt+1),Xt+1&=Φ(Xt,at,ξt,Mt).

The equations are schematic interfaces, not a completed mathematical theory:

  • bounded systems;
  • realized events;
  • causal ancestry;
  • scale and resolution;
  • consequence horizons;
  • epistemic uncertainty;
  • normative constraints;
  • evaluator participation;
  • memory;
  • perturbations;
  • adaptive state change.

The object of study is a causal trajectory generated by interacting events and changing states.


31. Current status

RETA remains a work in progress.

The current implementation establishes executable semantics for a subset of the architecture and provides a basis for reproducible synthetic experiments. The information-literacy memory layer, multiscale perturbation ontology, formal trajectory metrics, causal-attribution methods, convergence analysis, and empirical comparison against external baselines remain under active development.

Framework definition and successful code execution do not establish alignment, stability, robustness or superiority.

The purpose of the current work is to make a difficult class of alignment questions explicit enough to inspect, implement, perturb, falsify, and revise.