Agents, world models and multi-agent systems

World state is not memory

Rajesh Ranjan Mahapatra

An agent can act safely only when each retained item is typed by what it may authorise, because persistence preserves information but does not turn it into current operational truth.

© 2026 Rajesh Ranjan Mahapatra. 30 min read

World state is not memoryAll Human–Machine Convergence

Agents, world models and multi-agent systems

World state is not memory

An agent can act safely only when each retained item is typed by what it may authorise, because persistence preserves information but does not turn it into current operational truth.

TLDR

  1. A checkpoint can restore a computation without saying what is true outside it.
  2. Episodes and knowledge can guide proposals, but they must not silently become current operational facts.
  3. World state earns action authority through ownership, time, version and transaction semantics.
  4. An evidence ledger proves what was observed, authorised and effected; it is not the live world.
  5. Use a typed state inventory and a commit-time readback gate before consequential action.

Twelve crates

At 09:00, a fulfilment agent reads that a depot holds twelve crates of a scarce component. It records the observation in its conversation history, writes a compact episode to long-term storage and reaches a planning checkpoint.

At 09:07, another process allocates five crates to an urgent repair. At 09:11, the agent resumes. A buyer asks whether ten crates can ship today. The agent retrieves its crisp, relevant and once-correct sentence: “Depot A has twelve crates available.” It confirms the order.

Nothing here requires a hallucination. The observation was genuine. The summary was faithful. The checkpoint restored exactly what the agent had been considering. The retrieval system found the most relevant item. The model reasoned correctly from the material it received. Yet the action was wrong because the sentence outlived the authority it once had.

The usual diagnosis is “stale memory”. That diagnosis is too shallow. Staleness matters, but the deeper failure is a category error: an episode was permitted to answer a world-state question. The agent treated “what I observed” as “what is now true”, then treated “what is now true” as “what I may commit”. Three promotions occurred without an explicit gate.

This paper develops one causal thesis: when distinct persistence types are collapsed into memory, retrieval quality becomes a hidden authority mechanism. A similarity score, recency heuristic or model judgement then decides which retained item may stand in for reality. The cure is not a larger context window. It is a typed architecture in which restoration, recollection, reference knowledge, live state and execution proof carry different permissions.

The sentence that outlived its authority

Why does the twelve-crate error feel surprising? Most software vocabulary encourages a simple picture. Data enters a system, the system retains it, and later the system retrieves it. If the retained representation is accurate, retrieval is relevant and reasoning is sound, the resulting answer should improve. That picture works for drafting a reply or remembering a preference. It fails when an action changes a shared world.

The hidden assumption is that persistence is a single property. In practice, every retained item answers a different question. A model checkpoint asks, “Which learned transformation should run?” A workflow checkpoint asks, “Where should this computation resume?” An episode asks, “What did this agent encounter?” A knowledge record asks, “Which proposition or rule is available for reference?” World state asks, “What does the authorised operational system currently assert?” An evidence ledger asks, “What was observed, authorised, attempted and verified?”

These questions can point to the same payload. The sentence “twelve crates are available” could appear in all five places. What changes is not the wording. What changes is the item’s owner, temporal meaning, update discipline and permitted use. Authority is a relation between a record and a decision, not a substance stored inside the record.

Six thresholds hidden inside one sentence

A retained sentence can pass one test and fail the next. It may be accurately remembered, yet no longer true. It may be true, yet not current at the decision cutoff. It may be current, yet come from a source that does not own the subject. It may be authoritative, yet unavailable for this purpose because consent, policy or role does not permit its use. It may be authorised context, yet still be insufficient to support a particular action. It may support an action, yet leave no evidence that the action occurred.

These are not philosophical refinements. Each threshold calls for a different control. Accuracy needs source comparison. Currency needs time and update awareness. Authority needs ownership and conflict semantics. Entitlement needs identity and purpose. Actionability needs a typed contract and invariant. Evidence needs capture, linkage and readback. A single confidence score cannot substitute for this structure because high confidence about the wrong question remains wrong.

Consider a verified shipping policy that says orders above ten units require approval. The document can be authentic, current and authoritative. It still cannot tell us whether approval was actually granted for Order 81, whether twelve units remain available or whether the reservation succeeded. Conversely, a live inventory record can establish availability but not policy meaning. Reliable action depends on composing several authorised records without allowing any one of them to impersonate the others.

Current agent frameworks already expose fragments of this distinction. LangGraph, for example, describes checkpointers as thread-scoped graph-state snapshots and stores as cross-thread application data.[1][2] PyTorch checkpoints may contain model parameters, optimiser state, epoch and loss so training or inference can resume.[3] Neither mechanism, by itself, establishes the current stock, account status or policy entitlement outside the computation.

Cognitive architectures also distinguish working, episodic, semantic and procedural memory. CoALA applies that vocabulary to language agents, while noting that episodes store earlier decision cycles and semantic memory stores knowledge about the world.[4] A later survey argues that agent-memory terminology has become fragmented enough that ordinary long-term and short-term labels are no longer sufficient.[5] These taxonomies are useful, but they still leave an operational question unanswered: which stored item may authorise which action?

Five reservoirs with different authority profiles
Practitioner synthesis
Five reservoirs representing checkpoints, episodes, knowledge, world state and evidence Curved reservoirs show that each persistence type holds information for a different purpose. Checkpoints restore, episodes recollect, knowledge explains, world state controls live operations and evidence ledgers prove past execution. Checkpoints Restore a model or computation Resume Episodes Remember an encounter Recall Knowledge Interpret facts, rules and policy Explain World state Current operational assertion Commit Evidence Prove what happened Verify The same sentence can sit in every reservoir. Its permitted use changes with the reservoir.
Five persistence mechanisms can carry identical text while answering different questions. The decision error begins when a channel intended for resumption, recollection or explanation is allowed to open the commit valve.Source: Practitioner synthesis informed by LangGraph, PyTorch, CoALA, database and provenance sources.
The argument in one pass
Chart · flow
flowchart LR
  A["Twelve crates"] --> B["The sentence that outlived its<br/>authority"]
  B --> C["Five reservoirs, five questions"]
  C --> D["The gate between proposal and<br/>effect"]
  D -. "re-test" .-> A
  classDef first fill:#0a1424,stroke:#7B4CD8,stroke-width:2px,color:#e6f3ff
  classDef step fill:#0a1424,stroke:#3f7da0,stroke-width:1px,color:#e6f3ff
  class A first
  class B,C,D step
A structural route through World state is not memory: from Twelve crates to Appendices. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

Five reservoirs, five questions

Calling everything memory hides the property that matters most: what kind of mistake becomes possible when the record is wrong, stale or misapplied? A poor episode may personalise a response badly. A stale world-state read may allocate stock twice. An incomplete evidence record may make an incident impossible to reconstruct. The payload can be similar while the failure geometry differs.

Checkpoints preserve a computation

A model checkpoint preserves parameters and often training state. A runtime checkpoint preserves a workflow’s local graph or continuation state. Their authority is endogenous: they can determine which computation resumes and with which local variables. They do not automatically inherit authority over the environment that changed while the computation slept.

This distinction explains why “time travel” features require care. Restoring an earlier graph state can be valuable for debugging or branching, yet any external effect already committed may remain. A checkpoint is therefore closer to a saved position in a game than to the current state of the shared game server. It restores a player’s local trajectory. It does not erase other players’ moves.

Episodes preserve encounters

An episode records that the agent observed, inferred, attempted or experienced something at a particular time. It may include context, salience, confidence and a later reflection. Episodic retrieval can improve continuity and planning, as demonstrated by architectures that store observations and retrieve them for later behaviour.[15] But an episode is indexed by its relation to an agent’s past, not by a guarantee that the world still matches it.

An episode should therefore use report-like grammar: “At 09:00, source S returned quantity 12”, not ontological grammar: “Quantity is 12”. That small wording change exposes time and source. It also creates a natural validation step before action.

Knowledge preserves claims and rules

Knowledge stores hold propositions intended to travel across episodes: product descriptions, procedures, policies, definitions, relationships and learned summaries. Some knowledge is descriptive. Some is normative. Some is authoritative only for a specific jurisdiction, product, customer or period. A document can be authentic and still be inapplicable.

The important question is not whether the vector store retrieved the right paragraph. It is whether the paragraph’s version, effective period, subject and purpose match the decision. A policy published last year may remain useful for explanation while being invalid for today’s approval. Semantic relevance is not temporal or legal entitlement.

World state preserves an operational assertion

World state is the state against which an operation is authorised and committed. It may be held in a transactional database, a device controller, an order-management system, a scheduling service or a simulation engine. It is “world” state only relative to a declared operational boundary. In Kubernetes, for example, the object specification expresses desired state while status reports current state, and controllers work to reconcile the two.[6]

World state requires more than freshness. It needs an owner, update semantics and a conflict rule. PostgreSQL transactions provide all-or-nothing effects and control when concurrent changes become visible.[7] Multiversion concurrency control prevents a session from seeing inconsistent intermediate updates, while stricter isolation or explicit locks address particular conflicts.[8] These mechanisms do not make every value true, but they define how competing writes become an accepted operational state.

Evidence ledgers preserve the execution story

An evidence ledger records what input was used, who or what held authority, which policy decision was returned, what action was attempted, what effect was reported and what readback confirmed. Temporal describes event history as a durable append-only record that supports recovery and debugging.[9] W3C PROV distinguishes entities, activities and agents so derivation and responsibility can be represented.[10] NIST audit guidance calls for event type, time, location, source, outcome and associated identities, and recommends preserving original content and time order.[11]

A ledger is not automatically trustworthy. Logs can be missing, mutable, mis-timestamped or detached from identity. OpenTelemetry standardises a log data model, but a common envelope does not prove that an event occurred as claimed.[12] Evidence authority depends on capture point, integrity, provenance and correlation with the effecting system.

The unauthorised promotion and the typed intervention
Illustrative causal contrast
Counterfactual paths from a stale episode to an action The upper path promotes a stale inventory episode directly into a shipment commitment. The lower path treats the episode as a proposal cue, queries versioned world state, conditionally commits and verifies the effect. Observed path: memory silently becomes authority Intervention path: memory proposes, world state authorises Episode“12 available” Model proposalShip 10 Tool callCommit order Wrong effectOver-allocation EpisodePlanning cue ProposalShip up to 10 Live read7, version 43authoritative Conditionalreserve 7if version 43 Readback7 reservedreceipt linked Add a typed authority gate
The intervention does not delete memory. It changes memory’s role from hidden authority to explicit proposal input. The live read, conditional commit and readback form the action-authority path.Source: Illustrative causal model.

One record needs two clocks

World-state records often need at least two times. Valid time says when the fact applied in the modelled world. Recorded time says when the system learned or stored it. Snodgrass and Ahn’s temporal-database work made this distinction explicit decades ago.[13] It matters whenever observations arrive late or corrections apply retrospectively.

Suppose a depot scan performed at 09:07 is uploaded at 09:12. A system that records only upload time may claim twelve crates at 09:11 even though seven were valid then. A system that overwrites the old value loses the fact that its earlier decision was made under incomplete information. Two clocks let us ask both: “What was true at the decision cutoff?” and “What could the system have known when it decided?”

Two clocks for one inventory fact
Illustrative timeline
Bitemporal inventory timeline A stock allocation is valid from 09:07 but recorded at 09:12. The decision at 09:11 used the old database view, so the ledger must preserve both world time and knowledge time. Valid time Recorded time 09:0009:0709:1109:12 09:0009:1109:12 12 counted 5 allocated7 now valid Decision cutoffworld has 7 scan uploaded Database view says 12 decision sees 12 7 Late arrival creates a knowledge gap Keep both clocks to reconstruct truth at cutoff and knowledge at decision time
A late observation can be valid before it is recorded. Without both times, the system cannot separate a bad decision from a decision made with unavailable evidence.Source: Illustrative application of valid time and recorded time.
Mechanism

The state-authority vector

Represent every retained item as a record r with ten fields: kind, subject, source, valid interval, recorded time, version, owner, permitted purpose, provenance and payload. The payload says what the item contains. The other fields say what the item is allowed to do.

admissible(r, use, t) = type_allows ∧ subject_matches ∧ purpose_allows ∧ valid_at(t) ∧ source_authorised ∧ version_current ∧ provenance_sufficient

Here use is the proposed use, such as resume, personalise, explain, plan, act or prove. The time t is the decision cutoff. The equation assumes each condition can be evaluated deterministically. If validity or version cannot be established, the result is not “probably admissible”. It is a guarded result that requires a live read, human review or abstention.

The conjunction is intentionally unforgiving. A highly trustworthy source with the wrong subject should fail. A current record used for an unauthorised purpose should fail. A perfectly shaped JSON object with missing provenance should fail for proof. JSON Schema can validate structure and constraints, but it cannot establish that the content is true, current or authorised.[14]

Freshness cost is action-sensitive
Synthetic values
Illustrative chart of expected loss as a record ages Three curves show that an ageing record has low cost for conversational continuity, moderate cost for planning and steep cost for direct action in a changing environment. 020406080100 05101520 Record age in minutes Illustrative expected loss index Conversation Planning Direct action 5 min can already be costly
The same record age has different significance for conversation, planning and action. A universal time-to-live cannot encode consequence or conflict probability.Source: Illustrative synthetic curves, not measured operating data.

The gate between proposal and effect

Once persistence types are explicit, the architecture changes. The model is no longer asked to decide which text counts as reality. It may interpret intent, retrieve context, compare options and propose a typed action. A deterministic authority kernel then checks identity, permission, state version, temporal validity and transaction conditions before any effect occurs.

This division does not require distrust of language models in every role. It places stochastic reasoning where alternatives and ambiguity are real, while placing enforceable conditions where the organisation has already decided what must hold. The model may propose the future; it must not redefine the present at commit time.

The pantry example as a typed record set
Annotated worked example
Typed pantry records for episodes, knowledge, world state and evidence Four record cards show yesterday's count, a serving rule, the current versioned count and a breakfast-use receipt. Arrows indicate which records can plan, act and prove. EPISODE “Counted 6 tea bags” valid at: yesterday 18:00 use: recall, explain, plan with validation KNOWLEDGE “1 guest ≈ 1 cup” source: household serving guide use: estimate requirement WORLD STATE 4 tea bags version: 18 · owner: pantry inventory use: reserve up to 4 if version 18 EVIDENCE “2 used at breakfast” actor, time, source and outcome linked use: reconstruct and verify effect Only the versioned count opens the reservation path.
Episodes and knowledge support the proposal. World state supplies the versioned fact used for reservation. The evidence record later explains how the count changed.Source: Illustrative worked example.

A minimum action path

A consequential agent needs six separations. Intent states what outcome the user seeks. Identity states who is asking and on whose behalf. Permitted context limits what evidence may enter. The model proposal names a typed action and its rationale. Authority decides whether that action is allowed against current state. The effecting tool commits the action and returns a receipt. Readback then verifies the resulting world state.

The resulting path is deliberately asymmetric. Rich context may flow into planning, but only narrowly typed fields should flow into the action contract. A procurement proposal might contain pages of reasoning. The commit contract may contain only supplier ID, item ID, quantity, price ceiling, currency, state version, approval ID and idempotency key.

Why retrieval confidence cannot be the gate

Suppose the memory system assigns the twelve-crate episode a similarity of 0.97, a source-trust score of 0.94 and a recency score of 0.88. Combining them may produce an impressive number, but the number answers a ranking question: which item should the model inspect? It does not answer whether another allocation has committed, whether the item is reserved, whether the caller may place an order or whether the action is reversible.

A confidence threshold also encourages unsafe substitution. When the live state service is unavailable, the system may fall back to the “next best” memory item. That is reasonable for drafting an explanation. It is dangerous for allocating scarce stock. The correct fallback for an authority dependency is usually a narrower action, an expiring hold, an abstention or a human route. It is not a more confident guess.

This yields a practical placement rule. Use probabilistic retrieval to decide what deserves attention. Use deterministic policy to decide what may enter an action contract. Use the effecting system to decide whether the transition can commit. Use readback to decide what actually changed. Ranking, permission, commitment and verification are four different computations, even when one user request triggers all four.

An authority kernel around an untrusted proposer
Architecture synthesis
System boundary separating model proposal from authoritative state and effects A central model proposes actions using checkpoints, episodes and knowledge. A deterministic authority ring checks identity, context, permission and live state before a transactional tool changes the operational system. Receipts flow to an evidence ledger. Model proposal interpret · compare · plan emit typed action Deterministic authority kernel identity · permission · purpose · time · version · policy Checkpointsrestore runtime Episodespast encounters Knowledgeclaims and rules World statelive read + versionsystem of record Typed actionconditional commitidempotency Evidence ledgerdecision + effectreadback receipts Dotted paths inform proposals. Solid paths carry authority and effects.
The model sits inside the authority boundary but does not own it. Proposal context can be broad; action fields and authoritative reads are narrow, typed and independently enforceable.Source: Practitioner architecture synthesis.
Which reservoir may answer which question?
Decision instrument
Reservoir
Resume
Personalise
Plan
Act
Prove
Checkpoint
Primary
No
Local only
No
No
Episode
No
Primary
Validate
No
No
Knowledge
No
Sometimes
Primary
Version + scope
No
World state
No
Rarely
Current constraints
Conditional commit
Snapshot only
Evidence ledger
Replay input
No
Past outcomes
No
Primary
Authority is use-relative. There is no single ranking in which evidence is “higher” than world state or world state is “higher” than knowledge. Each reservoir has a primary question and guarded secondary uses.Source: Practitioner decision matrix.
How a poisoned episode becomes an action
Adversarial path
Adversarial escalation from an untrusted message to a consequential action A malicious message is summarised into an episode, retrieved as a fact and used to change payment details. A quarantine gate blocks promotion unless the claim is verified against an authoritative supplier record. Forgedemail Episodesummary Retrievedas fact Paymentchange Wrongeffect Quarantine rule Episodes may suggest a change, never establish supplier identity or bank details. Proposalverify new details Authoritative readsupplier master says olddetails remain valid Blockedno authorised change
Memory poisoning becomes dangerous when the system allows an episode to promote itself into identity or world state. The quarantine rule preserves the episode as a lead while forcing verification through a different path.Source: Illustrative adversarial scenario.
Executable lab

Typed state inventory and authority gate

Classify a retained item, choose a proposed use and inspect which controls are still required. The tool runs entirely in this page with synthetic examples.

Guarded

A live authoritative read is required.

This episode may inform planning, but it cannot authorise an external action.

  • Query the system of record at the decision cutoff.
  • Use a current version in a conditional write.
  • Capture the effect and readback receipts.

The lab tests admissibility, not truth. A positive result means the record type and supplied controls are sufficient for the chosen use under the encoded policy. It does not prove that the payload is factually correct. A negative result means the item must be reclassified, validated against an authoritative source, narrowed to a less consequential use or rejected. The smallest useful implementation is the matrix plus a versioned world-state read and a linked effect receipt.

JavaScript · core authority evaluator
/** @typedef {'checkpoint'|'episode'|'knowledge'|'world_state'|'evidence'} Kind */
/** @typedef {'resume'|'personalise'|'explain'|'plan'|'act'|'prove'} Use */

const primaryUses = {
  checkpoint: new Set(['resume']),
  episode: new Set(['personalise']),
  knowledge: new Set(['explain', 'plan']),
  world_state: new Set(['plan', 'act']),
  evidence: new Set(['prove'])
};

function evaluateRecord(record) {
  const reasons = [];
  const guards = [];
  const primary = primaryUses[record.kind].has(record.use);

  if (record.permission === 'denied') reasons.push('Purpose is denied.');
  if (record.use === 'act' && record.kind !== 'world_state') {
    reasons.push('Only world state can directly authorise an external action.');
  }
  if (record.use === 'prove' && record.kind !== 'evidence') {
    reasons.push('Proof requires a linked evidence record.');
  }
  if (record.kind === 'world_state' && ['plan', 'act'].includes(record.use)) {
    if (record.authority !== 'authoritative') reasons.push('Source is not authoritative.');
    if (record.validity !== 'current') reasons.push('Validity at the cutoff is not established.');
    if (record.version !== 'current') reasons.push('A current, conflict-checkable version is required.');
    if (record.use === 'act' && record.commitControl !== 'bound') guards.push('Bind the commit to a version or invariant.');
    if (record.use === 'act' && record.effectControl !== 'verified') guards.push('Use idempotency and verified readback.');
  }
  if (record.kind === 'evidence' && record.use === 'prove' && record.provenance !== 'complete') {
    reasons.push('Proof requires complete linked provenance.');
  }

  if (reasons.length) return {status: 'block', primary, reasons, guards};
  if (!primary || record.permission === 'conditional' || guards.length) {
    return {status: 'guard', primary, reasons: ['Additional controls are required.'], guards};
  }
  return {status: 'permit', primary, reasons: ['Record is admissible for the selected use.'], guards};
}

The evaluator makes the hidden rule explicit: a record cannot promote itself into a more authoritative role merely because the model finds it convincing.

Optional depth: assumptions and test cases

The lab assumes a single declared subject and purpose, reliable classification of record kind, a decision cutoff and enforceable mechanisms for version-bound commit, idempotency and readback. It does not model probabilistic source reliability, eventual-consistency windows, cryptographic integrity or multi-party disputes.

InputUseExpected resultReason
Runtime checkpointResumePermitPrimary use, provided the runtime accepts the checkpoint.
Stale episodeActBlockPast observation cannot authorise current effect.
Current policyPlanPermitKnowledge supports interpretation and planning.
Versioned world stateActPermitCurrent, authorised, conflict-checkable, purpose-allowed, version-bound and read back.
Partial logProveBlockMissing provenance prevents a proof claim.
How the claim changes under pressure
Chart · state
stateDiagram-v2
  [*] --> Claim
  state "Six thresholds hidden inside<br/>one sentence" as Claim
  state "Perfect replay, wrong world" as Test
  state "What is sourced, and what is<br/>proposed here" as Revision
  Claim --> Test: expose mechanism
  Test --> Decision: evidence survives
  Test --> Revision: rival survives
  Revision --> Claim: narrow or rebuild
  Decision --> [*]
The revision loop begins with Six thresholds hidden inside one sentence and keeps counterexamples inside the reasoning path. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

Recovery reveals the category error

Systems often discover state confusion only after interruption. A process crashes, a human changes a record, a tool times out or a workflow is reset. The team asks the agent to continue “where it left off”. That phrase sounds local, but recovery crosses several histories: intent, authority, computation, external effects and evidence.

From proposal to verified outcome
State-transition model
Lifecycle of an action from proposal to verification or compensation An action moves through proposed, authorised, submitted, effect unknown, committed, read back and verified states. Failures route to blocked, reconciled or compensated states, with receipts attached at each transition. Proposedmodel Authorisedpolicy receipt Submittedrequest key Effectunknown Committedeffect receipt Verifiedreadback Reconcile by idempotency keyfound → committed · absent → retry · unknown → review Blockedpermission or state failed Compensatewhen verified outcome violates invariant A checkpoint may resume the path. Only receipts and readback locate the path in the world.
The “effect unknown” state prevents a timeout from being mislabelled as failure. Reconciliation and readback determine whether to continue, retry, review or compensate.Source: Practitioner state-transition synthesis.

Keep proposal context outside action authority

Stop asking whether an agent “has memory” as though retention were one capability. Ask a more operational sequence: What kind of record is this? Who owns the subject? When was it valid? When was it recorded? Which version is current? For which purpose may it be used? Which action can it support? What independent receipt will show the effect?

This decision changes architecture reviews. A diagram labelled “memory” is no longer acceptable. Teams should produce a typed state inventory, an authority matrix and a recovery path for “effect unknown”. It changes evaluation too. Test not only whether the agent remembers, but whether it refuses to promote recollection into fact, fact into permission or a response into proof.

Begin the review at each consequential effect rather than at the vector database. Name the system that owns the affected subject, the version or invariant that must still hold, the permission needed, the transaction boundary, the receipt emitted and the reconciliation path after a timeout. Then trace backwards to the proposal inputs. This reverses a common design habit. Teams often start with what the model can retrieve and later bolt on safeguards. The safer order starts with what an action must prove and admits context only for the role it can legitimately play. It also clarifies where cost belongs. Extra live reads are justified near irreversible commitments, not on every conversational turn. Episodes may remain rich and approximate, knowledge may remain searchable, and checkpoints may remain frequent, provided none can bypass the narrow authority gate.

The twelve-crate agent did not need a better recollection. It needed to know what recollection is for. World state is not the memory that happens to be freshest. It is the state whose ownership and transition rules make an action valid.

The evidence conversation
Chart · sequence
sequenceDiagram
  participant Q as Question
  participant M as Mechanism
  participant E as Evidence
  participant D as Decision
  Q->>M: Twelve crates
  M->>E: Six thresholds hidden inside one sentence
  E-->>M: compare rival explanations
  E->>D: Appendices
  D-->>Q: revise scope or act
Question, mechanism, evidence and decision exchange the burdens developed in World state is not memory. Reading use: follow the relation, then return to the surrounding argument for evidence and limits.

Appendices

Compact glossary

Checkpoint
A saved model or computation state used to restore or resume a process.
Episode
A time-indexed record of an agent’s past observation, interaction, inference or attempt.
Knowledge
A proposition, rule, relationship or procedure intended for reference across episodes.
World state
The operational assertion owned by the system through which relevant state transitions are accepted.
Evidence ledger
A linked history of inputs, authority decisions, requests, effects and verified outcomes.
Valid time
The interval during which a fact applies in the modelled world.
Recorded time
The time at which a system stored or learned the fact.
Readback
An independent query after an action that verifies the resulting authoritative state.
Idempotency key
A stable request identifier that lets repeated submissions resolve to one logical effect.
State-authority vector
The typed metadata that specifies a record’s kind, scope, time, source, version, ownership, provenance and permitted uses.

References

  1. LangChain. “Persistence: LangGraph.” Official documentation. docs.langchain.com/oss/python/langgraph/persistence.
  2. LangChain. “Stores: LangGraph.” Official documentation. docs.langchain.com/oss/python/langgraph/stores.
  3. PyTorch. “Saving and Loading Models.” Official tutorial. docs.pytorch.org/tutorials/beginner/saving_loading_models.html.
  4. Sumers, Theodore R., et al. “Cognitive Architectures for Language Agents.” 2023. arxiv.org/abs/2309.02427.
  5. Hu, Yutao, et al. “Memory in the Age of AI Agents.” 2025. Preprint. arxiv.org/abs/2512.13564.
  6. Kubernetes. “Objects in Kubernetes.” Official documentation. kubernetes.io/docs/concepts/overview/working-with-objects/.
  7. PostgreSQL Global Development Group. “Transactions.” PostgreSQL 18 documentation. postgresql.org/docs/current/tutorial-transactions.html.
  8. PostgreSQL Global Development Group. “Multiversion Concurrency Control: Introduction.” PostgreSQL 18 documentation. postgresql.org/docs/current/mvcc-intro.html.
  9. Temporal Technologies. “Events and Event History.” Official documentation. docs.temporal.io/workflow-execution/event.
  10. World Wide Web Consortium. “PROV-O: The PROV Ontology.” W3C Recommendation, 2013. w3.org/TR/prov-o/.
  11. National Institute of Standards and Technology. “Protecting Controlled Unclassified Information in Nonfederal Systems and Organizations.” SP 800-171 Revision 3, 2024, audit record requirements. nvlpubs.nist.gov/.../NIST.SP.800-171r3.html.
  12. OpenTelemetry. “Logs Data Model.” Stable specification. opentelemetry.io/docs/specs/otel/logs/data-model/.
  13. Snodgrass, Richard T., and Ilsoo Ahn. “A Taxonomy of Time in Databases.” Proceedings of ACM SIGMOD, 1985, pp. 236–246. doi.org/10.1145/318898.318921.
  14. JSON Schema. “Specification, Draft 2020-12.” json-schema.org/specification.
  15. Park, Joon Sung, et al. “Generative Agents: Interactive Simulacra of Human Behavior.” UIST, 2023. arxiv.org/abs/2304.03442.

Related reading