<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Christian Serrano</title>
    <description>The latest articles on DEV Community by Christian Serrano (@caivratech).</description>
    <link>https://dev.to/caivratech</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4216914%2F91f29861-d1c3-46dc-acfb-6da655bd755d.png</url>
      <title>DEV Community: Christian Serrano</title>
      <link>https://dev.to/caivratech</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/caivratech"/>
    <language>en</language>
    <item>
      <title>An AI Agent Was Authorized. Then the Permission Changed. What Happens Next?</title>
      <dc:creator>Christian Serrano</dc:creator>
      <pubDate>Sat, 31 Oct 2026 04:35:39 +0000</pubDate>
      <link>https://dev.to/caivratech/an-ai-agent-was-authorized-then-the-permission-changed-what-happens-next-5f5h</link>
      <guid>https://dev.to/caivratech/an-ai-agent-was-authorized-then-the-permission-changed-what-happens-next-5f5h</guid>
      <description>&lt;h1&gt;
  
  
  An AI agent can be authorized at planning time—and still be unsafe at execution time
&lt;/h1&gt;

&lt;p&gt;Imagine an autonomous agent receives permission to perform an action. It collects evidence, plans its steps, and prepares an external write.&lt;/p&gt;

&lt;p&gt;Before that write occurs, something changes: a permission is revoked, the target resource changes, or the evidence used to admit the action is no longer applicable.&lt;/p&gt;

&lt;p&gt;Should the original approval still be enough?&lt;/p&gt;

&lt;p&gt;My technical preprint, &lt;strong&gt;Authority-Bound Execution for Agentic Systems: A Formal Architecture for Provenance-Validated Admission, Revocation Fencing, and Recoverable Effects&lt;/strong&gt; (CC-RP-001, v0.5), investigates this problem as one of authority, provenance, time, and recoverability.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Read the paper:&lt;/strong&gt; &lt;a href="https://doi.org/10.5281/zenodo.23823408" rel="noopener noreferrer"&gt;Zenodo DOI: 10.5281/zenodo.23823408&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Author:&lt;/strong&gt; Christian Serrano, Caivra Tech LLC&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Preprint version:&lt;/strong&gt; v0.5, October 30, 2026&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Status:&lt;/strong&gt; Public theoretical research preprint, not independently peer reviewed.&lt;/p&gt;
&lt;h2&gt;
  
  
  Why a valid approval can become insufficient
&lt;/h2&gt;

&lt;p&gt;An action can appear authorized when planned yet be inadmissible when executed.&lt;/p&gt;

&lt;p&gt;For example:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;A security review approves a change for one repository revision, but the underlying code changes afterward.&lt;/li&gt;
&lt;li&gt;A capability is granted with a limited scope, but the proposed effect targets a resource outside that scope.&lt;/li&gt;
&lt;li&gt;A delegated permission is revoked while a job is waiting in a queue.&lt;/li&gt;
&lt;li&gt;A network operation times out after the remote system may already have committed the effect.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Each example requires more than asking whether an AI's initial request was plausible. It requires checking &lt;strong&gt;which authority applies to which exact action, based on which evidence, at what point in the workflow, and how outcomes are recovered&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;The paper proposes an architectural vocabulary for reasoning about these boundaries.&lt;/p&gt;
&lt;h2&gt;
  
  
  1. Provenance-validated admission
&lt;/h2&gt;

&lt;p&gt;A provenance record is not automatically evidence that a proposed operation is admissible.&lt;/p&gt;

&lt;p&gt;Suppose a test result was produced for revision A. An agent now wants to mutate revision B. The fact that a test passed is real historical evidence—but whether it applies to the new target is a separate question.&lt;/p&gt;

&lt;p&gt;The proposed approach treats admission as dependent on evidence that is:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Authentic:&lt;/strong&gt; Who or what produced it?&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Applicable:&lt;/strong&gt; Does it refer to this operation, resource, revision, and context?&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Fresh enough:&lt;/strong&gt; Has a relevant dependency changed since it was produced?&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Within scope:&lt;/strong&gt; Does the evidence support this requested decision, rather than a broader claim?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;A model-generated explanation cannot resolve these questions by assertion alone. Admission must be tied to the relevant authoritative mechanisms.&lt;/p&gt;
&lt;h2&gt;
  
  
  2. Revocation fencing near consequential effects
&lt;/h2&gt;

&lt;p&gt;A common timing problem appears when authorization is checked upstream, but execution happens later.&lt;/p&gt;

&lt;p&gt;Conceptually:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Agent proposes action
        |
Resolve applicable authority
        |
Validate evidence and admission conditions
        |
Prepare candidate operation
        |
Check revocation/freshness at the effect boundary
        |
Commit permitted effect OR refuse/hold
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;The important idea is that &lt;strong&gt;an earlier permission check should not automatically survive a material authority change&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;A design intended to enforce this property needs a reliable relationship between the authoritative revocation state and the consequential effect boundary. Otherwise, a race between a revocation and an operation can leave the system acting on stale authority.&lt;/p&gt;

&lt;p&gt;The manuscript explores a proposed fencing approach and related conditional safety properties. The challenge is to show, under explicit assumptions, that a relevant revocation cannot be bypassed by queued work, alternate execution routes, or stale authorizations.&lt;/p&gt;

&lt;h2&gt;
  
  
  3. Recoverable effects and unknown outcomes
&lt;/h2&gt;

&lt;p&gt;Now consider a different failure.&lt;/p&gt;

&lt;p&gt;An agent asks a remote service to create a resource. The request times out. The agent cannot tell whether the remote operation committed.&lt;/p&gt;

&lt;p&gt;Blindly repeating the request may create duplicates. Assuming it failed may be wrong. Assuming it succeeded may also be wrong.&lt;/p&gt;

&lt;p&gt;Recoverable execution needs to distinguish:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;An effect that is known not to have happened.&lt;/li&gt;
&lt;li&gt;An effect that is known to have happened.&lt;/li&gt;
&lt;li&gt;An effect whose outcome remains unknown.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;That third state matters. The research discusses durable reconciliation of uncertain outcomes rather than treating every timeout as a safe opportunity to retry.&lt;/p&gt;

&lt;p&gt;Depending on the external service, a practical strategy may involve stable operation identifiers, idempotency support, state queries, or controlled recovery workflows. No single mechanism works universally across all APIs.&lt;/p&gt;

&lt;h2&gt;
  
  
  4. Authority is not the same as trust, evidence, or execution
&lt;/h2&gt;

&lt;p&gt;The paper emphasizes boundaries that are often collapsed in agent discussions:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;
&lt;strong&gt;Intent:&lt;/strong&gt; What a caller or agent wants.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Authority:&lt;/strong&gt; Who can permit the consequential action.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Admission:&lt;/strong&gt; Whether the specific candidate satisfies applicable conditions.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Capability:&lt;/strong&gt; What bounded operation has actually been granted.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Execution:&lt;/strong&gt; What effect was attempted.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Evidence:&lt;/strong&gt; What can be substantiated about that attempt.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Reconciliation:&lt;/strong&gt; How uncertain or partial outcomes are resolved.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Keeping these concepts distinct helps reveal where systems otherwise confuse a caller's claim with a governing decision or a successful tool call with an approved final state.&lt;/p&gt;

&lt;h2&gt;
  
  
  A research agenda—not a declaration of proof
&lt;/h2&gt;

&lt;p&gt;The preprint proposes an architecture, conditional safety propositions, and a falsifiable evaluation plan.&lt;/p&gt;

&lt;p&gt;It does &lt;strong&gt;not&lt;/strong&gt; report completed machine-checked proofs, controlled comparative benchmarks, independent peer review, or production validation. The proposed properties still need rigorous implementations, explicit threat models, failure-injection tests, and comparative evaluation.&lt;/p&gt;

&lt;p&gt;Useful negative tests include:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Revocation committed immediately before effect-time checks.&lt;/li&gt;
&lt;li&gt;Revocation racing with execution.&lt;/li&gt;
&lt;li&gt;Replayed or duplicated requests.&lt;/li&gt;
&lt;li&gt;Evidence that is genuine but stale or inapplicable.&lt;/li&gt;
&lt;li&gt;Alternate entry points that bypass expected checks.&lt;/li&gt;
&lt;li&gt;Remote timeouts after a possibly committed effect.&lt;/li&gt;
&lt;li&gt;Process restart during unresolved reconciliation.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;A design should be assessed by the failures it can rule out under specified assumptions—not just by successful demonstration paths.&lt;/p&gt;

&lt;h2&gt;
  
  
  Why publish this work?
&lt;/h2&gt;

&lt;p&gt;Agent tooling is rapidly increasing the number of systems capable of making consequential external changes. The difficult engineering problem is not simply generating better decisions; it is preserving valid decision authority across the full path from proposal to effect and recovery.&lt;/p&gt;

&lt;p&gt;This preprint contributes a proposed framework and an explicit set of questions that can be examined, challenged, and experimentally tested.&lt;/p&gt;

&lt;h2&gt;
  
  
  Read and cite
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Paper:&lt;/strong&gt; &lt;em&gt;Authority-Bound Execution for Agentic Systems: A Formal Architecture for Provenance-Validated Admission, Revocation Fencing, and Recoverable Effects&lt;/em&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Identifier:&lt;/strong&gt; CC-RP-001&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Version:&lt;/strong&gt; v0.5&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Published:&lt;/strong&gt; October 30, 2026&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;&lt;a href="https://doi.org/10.5281/zenodo.23823408" rel="noopener noreferrer"&gt;Full versioned preprint — Zenodo&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://orcid.org/0009-0009-8778-5800" rel="noopener noreferrer"&gt;Author ORCID&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://github.com/caivra-tech/CEOS-Research-Papers" rel="noopener noreferrer"&gt;Related CEOS research publication corpus&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Citation:&lt;/strong&gt; Serrano, C. (2026). &lt;em&gt;Authority-Bound Execution for Agentic Systems: A Formal Architecture for Provenance-Validated Admission, Revocation Fencing, and Recoverable Effects&lt;/em&gt; (Version 0.5). Zenodo. &lt;a href="https://doi.org/10.5281/zenodo.23823408" rel="noopener noreferrer"&gt;https://doi.org/10.5281/zenodo.23823408&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;em&gt;Research integrity note: This is an independent explanatory article about a theoretical preprint, not an announcement of completed verification or deployment. The Zenodo version DOI identifies the authoritative archival manuscript. The related CEOS repository is contextual material, not the source repository for this distinct CaivraCore preprint.&lt;/em&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>security</category>
      <category>architecture</category>
      <category>research</category>
    </item>
    <item>
      <title>Who Authorizes the AI Agent? A Systems Architecture for Governed Autonomous Software Engineering</title>
      <dc:creator>Christian Serrano</dc:creator>
      <pubDate>Sat, 31 Oct 2026 04:35:13 +0000</pubDate>
      <link>https://dev.to/caivratech/who-authorizes-the-ai-agent-a-systems-architecture-for-governed-autonomous-software-engineering-27j6</link>
      <guid>https://dev.to/caivratech/who-authorizes-the-ai-agent-a-systems-architecture-for-governed-autonomous-software-engineering-27j6</guid>
      <description>&lt;h1&gt;
  
  
  When an AI agent can act, who decides what it is allowed to change?
&lt;/h1&gt;

&lt;p&gt;An AI model can propose a patch, choose a tool, or recommend a deployment. That does &lt;strong&gt;not&lt;/strong&gt; mean it should possess the final authority to change a repository, infrastructure environment, or canonical system state.&lt;/p&gt;

&lt;p&gt;This is the central engineering question explored in my technical research preprint, &lt;strong&gt;CEOS Infrastructure as a Governed Transactional Assurance Substrate for Autonomous Software Engineering&lt;/strong&gt; (CEOS-RP-001, v1.0).&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Read the versioned research preprint:&lt;/strong&gt; &lt;a href="https://doi.org/10.5281/zenodo.22991325" rel="noopener noreferrer"&gt;Zenodo DOI: 10.5281/zenodo.22991325&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Author:&lt;/strong&gt; Christian Serrano, Caivra Tech LLC&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Publication date:&lt;/strong&gt; September 26, 2026&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Status:&lt;/strong&gt; Technical research preprint; not independently peer reviewed.&lt;/p&gt;

&lt;h2&gt;
  
  
  The problem is bigger than a model's reasoning quality
&lt;/h2&gt;

&lt;p&gt;Consider an agent that discovers an issue, generates a fix, runs tests, and proposes applying the change.&lt;/p&gt;

&lt;p&gt;A useful result may still be unauthorized. Tests can pass against the wrong revision. Permissions can expire between planning and dispatch. An external API can time out after performing the requested effect. A merged commit can be mistaken for evidence that a system was deployed.&lt;/p&gt;

&lt;p&gt;The agent's confidence is not an authority decision. A passing check is not a capability grant. A request to mutate state is not proof that the requested transition is admissible.&lt;/p&gt;

&lt;p&gt;These are systems-engineering distinctions, not merely prompt-design considerations.&lt;/p&gt;

&lt;h2&gt;
  
  
  The architectural proposal: separate reasoning from authority
&lt;/h2&gt;

&lt;p&gt;CEOS studies an architecture in which probabilistic intelligence participates in engineering while deterministic mechanisms govern consequential effects.&lt;/p&gt;

&lt;p&gt;At a conceptual level:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;
&lt;strong&gt;Propose:&lt;/strong&gt; An agent produces a candidate action and supporting rationale.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Resolve authority:&lt;/strong&gt; A designated authority owner determines whether the proposed action is within the applicable scope.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Bind scope and state:&lt;/strong&gt; Capabilities, exact target state, freshness constraints, and preconditions are made explicit.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Admit and execute:&lt;/strong&gt; Only a permitted transition reaches the controlled effect boundary.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Validate and record:&lt;/strong&gt; Results are checked against the intended transition and retained with provenance.&lt;/li&gt;
&lt;li&gt;
&lt;strong&gt;Reconcile uncertainty:&lt;/strong&gt; If a timeout or partial failure leaves the external outcome unknown, the system does not simply assume success or retry without considering duplicate effects.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;This is a research model, not a claim that every aspect of the full design is already enforced in a production system.&lt;/p&gt;

&lt;h2&gt;
  
  
  Several distinctions matter
&lt;/h2&gt;

&lt;h3&gt;
  
  
  1. Intent is not authorization
&lt;/h3&gt;

&lt;p&gt;A user request, agent plan, or tool invocation can describe a desired outcome without supplying the authority to perform it. Authority should be resolved by the relevant governing mechanism, rather than inferred from the language of the request.&lt;/p&gt;

&lt;h3&gt;
  
  
  2. Evidence is not authority
&lt;/h3&gt;

&lt;p&gt;A successful build, a green CI pipeline, and a clean code review are important evidence. They do not independently authorize merge, release, migration, or deployment. These remain separate decisions.&lt;/p&gt;

&lt;h3&gt;
  
  
  3. A candidate is not canonical state
&lt;/h3&gt;

&lt;p&gt;A model-generated proposal should remain a candidate until the governing process admits it. Historical execution evidence must remain distinguishable from current live truth.&lt;/p&gt;

&lt;h3&gt;
  
  
  4. Time is part of correctness
&lt;/h3&gt;

&lt;p&gt;Approval may have been valid when a plan was formed but no longer applicable when a consequential action is dispatched. A system that relies on stale permission or state assumptions can violate its own intended controls.&lt;/p&gt;

&lt;h3&gt;
  
  
  5. Unknown outcomes need reconciliation
&lt;/h3&gt;

&lt;p&gt;Suppose an API call times out. Did the operation fail, or did the operation succeed while the acknowledgment was lost? Blind retries can duplicate effects. A transactional design needs an explicit strategy to classify and reconcile such ambiguity.&lt;/p&gt;

&lt;h2&gt;
  
  
  The testable research question
&lt;/h2&gt;

&lt;p&gt;The research asks whether &lt;strong&gt;integrated enforcement&lt;/strong&gt; of exact mutation, exact state, current authority, bounded capability, dispatch freshness, evidence, validation, and canonical disposition can improve assurance—or reduce the burden of integrating assurance mechanisms—relative to a correctly configured composite of existing technologies.&lt;/p&gt;

&lt;p&gt;That is a &lt;strong&gt;falsifiable hypothesis&lt;/strong&gt;, not an empirically demonstrated competitive advantage.&lt;/p&gt;

&lt;p&gt;The paper outlines a formal systems architecture, security model, candidate invariants, and an adversarial evaluation program. Further work is needed to test the design and compare it with established approaches.&lt;/p&gt;

&lt;h2&gt;
  
  
  For engineers building autonomous workflows
&lt;/h2&gt;

&lt;p&gt;A practical design review can start with questions like:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Which component owns the final decision to permit an effect?&lt;/li&gt;
&lt;li&gt;Can a caller bypass that component through a different entry point?&lt;/li&gt;
&lt;li&gt;What happens if permissions change after planning?&lt;/li&gt;
&lt;li&gt;How does the system know it is acting on the exact intended revision?&lt;/li&gt;
&lt;li&gt;What happens after a timeout where the external outcome is unknown?&lt;/li&gt;
&lt;li&gt;Can logs distinguish a proposed change, an admitted change, and an observed effect?&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;These questions apply to coding agents, infrastructure automation, CI/CD orchestration, and other systems where model output has real consequences.&lt;/p&gt;

&lt;h2&gt;
  
  
  Read, cite, and review the research
&lt;/h2&gt;

&lt;p&gt;&lt;strong&gt;Paper:&lt;/strong&gt; &lt;em&gt;CEOS Infrastructure as a Governed Transactional Assurance Substrate for Autonomous Software Engineering&lt;/em&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Subtitle:&lt;/strong&gt; &lt;em&gt;Formal Systems Architecture, Security Model, and Falsifiable Research Program&lt;/em&gt;&lt;br&gt;&lt;br&gt;
&lt;strong&gt;Version:&lt;/strong&gt; 1.0&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;&lt;a href="https://doi.org/10.5281/zenodo.22991325" rel="noopener noreferrer"&gt;Archival preprint — Zenodo (version DOI)&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://github.com/caivra-tech/CEOS-Research-Papers" rel="noopener noreferrer"&gt;CEOS research publication repository&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://github.com/caivra-tech/CEOS-Research-Papers/tree/main/papers/CEOS-RP-001" rel="noopener noreferrer"&gt;CEOS-RP-001 supporting documentation&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://orcid.org/0009-0009-8778-5800" rel="noopener noreferrer"&gt;Author ORCID&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Citation:&lt;/strong&gt; Serrano, C. (2026). &lt;em&gt;CEOS Infrastructure as a Governed Transactional Assurance Substrate for Autonomous Software Engineering&lt;/em&gt; (Version 1.0). Zenodo. &lt;a href="https://doi.org/10.5281/zenodo.22991325" rel="noopener noreferrer"&gt;https://doi.org/10.5281/zenodo.22991325&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;em&gt;Research integrity note: This article is an accessible summary of a technical preprint, not a report of independent peer review, completed comparative benchmarks, or established production deployment. The linked versioned preprint is the authoritative research artifact.&lt;/em&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>security</category>
      <category>architecture</category>
      <category>research</category>
    </item>
  </channel>
</rss>
