WorldDB: A Vector Graph-of-Worlds Memory Engine with Ontology-Aware Write-Time Reconciliation

• URL: http://arxiv.org/abs/2604.18478v1
• Date: Mon, 20 Apr 2026 16:30:53 GMT
• Title: WorldDB: A Vector Graph-of-Worlds Memory Engine with Ontology-Aware Write-Time Reconciliation
• Abstract summary: WorldDB is a memory engine built on three commitments: (i) every node is a world, (ii) nodes are content-addressed and immutable, and (iii) edges are write-time programs.<n>On LongMemEval-s (500 questions, 115k-token conversational stacks), WorldDB with Claude Opus 4.7 as answerer achieves 96.40% overall / 97.11% task-averaged accuracy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Persistent memory is the bottleneck separating stateless chatbots from long-running agentic systems. Retrieval-augmented generation (RAG) over flat vector stores fragments facts into chunks, loses cross-session identity, and has no first-class notion of supersession or contradiction. Recent bitemporal knowledge-graph systems (Graphiti, Memento, Hydra DB) add typed edges and valid-time metadata, but the graph itself remains flat: no recursive composition, no content-addressed invariants on nodes, and edge types carry no behavior beyond a label. We present WorldDB, a memory engine built on three commitments: (i) every node is a world -- a container with its own interior subgraph, ontology scope, and composed embedding, recursive to arbitrary depth; (ii) nodes are content-addressed and immutable, so any edit produces a new hash at the node and every ancestor, giving a Merkle-style audit trail for free; (iii) edges are write-time programs -- each edge type ships on_insert/on_delete/on_query_rewrite handlers (supersession closes validity, contradicts preserves both sides, same_as stages a merge proposal), so no raw append path exists. On LongMemEval-s (500 questions, ~115k-token conversational stacks), WorldDB with Claude Opus 4.7 as answerer achieves 96.40% overall / 97.11% task-averaged accuracy, a +5.61pp improvement over the previously reported Hydra DB state-of-the-art (90.79%) and +11.20pp over Supermemory (85.20%), with perfect single-session-assistant recall and robust performance on temporal reasoning (96.24%), knowledge update (98.72%), and preference synthesis (96.67%). Ablations show that the engine's graph layer -- resolver-unified entities and typed refers_to edges -- contributes +7.0pp task-averaged independently of the underlying answerer.

Related papers

• A Graph-Native Bitemporal Memory Store for Conversational AI Agents [0.0]
  We describe an agent-local Neo4j property graph augmented with HNSW vector indexes and a full bitemporal data model.<n>Each memory is stored as an immutable identity node linked to versioned content nodes carrying two closed-open time intervals.<n>We evaluate the system on LongMemEval, a 500-question benchmark spanning six question types designed to stress long-term memory.
  arXiv  Detail & Related papers  (2026-07-29T06:40:52Z)
• MemOps: Benchmarking Lifecycle Memory Operations in Long-Horizon Conversations [50.24315431387575]
  We introduce MemOps, a benchmark that reformulates conversational memory as a sequence of lifecycle operations.<n>MemOps represents each memory event with a structured trace specifying its trigger, target, scope, state transition, and supporting evidence.<n>Across long-context, retrieval-based, parametric and managed-memory systems, MemOps disentangles failure modes that final-answer accuracy alone conceals.
  arXiv  Detail & Related papers  (2026-07-14T15:33:44Z)
• Scaling Author Identity Disambiguation to the World of Code: A Methodology [2.788646205877688]
  We describe the methodology used to alias the World of Code (WoC) collection (version V2604, 107M distinct author strings over 6B commits) into canonical persons.<n>At this scale the central problem is over-merge, not missed merges.<n>We report the full experimental record (more than twenty experiments, including unsuccessful ones) behind the deployed design.
  arXiv  Detail & Related papers  (2026-07-08T02:30:26Z)
• Fractional Verkle Trees: A Hypertree Decomposition and Verified Proof Serialization Architecture for High-Performance Blockchain State Accumulators [0.0]
  We present Fractional Verkle Trees (FVT), a hypertree serialization decomposition global state into N independent sub-accumulators coordinated by a Merkle commitment tree.<n> Benchmarks on Apple M1 Pro show 57% heap allocation reduction (566,760 to 242,004 bytes per 10K$), parallel insertion at 2,433 ns/op, and network-wide elimination of 4.85 PB/year across 6,000 full nodes.
  arXiv  Detail & Related papers  (2026-06-15T07:16:07Z)
• Less Context, More Accuracy: A Bi-Temporal Memory Engine for LLM Agents Where a Lean Retrieved Context Beats the Full History [2.5401434059780468]
  Engram is a dual-process memory engine on a bi-temporal data model.<n>A fast write path appends episodes with no LLM on the critical path.<n>A hybrid read path fuses dense, lexical, graph, and recency/salience signals.
  arXiv  Detail & Related papers  (2026-06-05T11:43:56Z)
• EvoMemNav: Efficient Self-Evolving Fine-Grained Memory for Zero-Shot Embodied Navigation [81.54723508469617]
  EvoMemNav is an efficient, self-evolving, fine-grained memory framework for zero-shot embodied navigation.<n>VSMGraph organizes views with semantic cues and topological relations into a room-view-object hierarchy.<n>Experiments on GOAT-Bench and HM3D across object, text-description, and image-goal modalities show consistent gains in SR/SPL.
  arXiv  Detail & Related papers  (2026-06-02T11:27:44Z)
• Time is Not a Label: Continuous Phase Rotation for Temporal Knowledge Graphs and Agentic Memory [22.19616466232313]
  RoMem is a drop-in temporal knowledge graph module for structured memory systems.<n>It learns from data that evolving relations should rotate fast while persistent ones should remain stable.<n>On temporal knowledge graph completion, RoMem achieves state-of-the-art results on ICEWS05-15.
  arXiv  Detail & Related papers  (2026-04-13T14:35:47Z)
• GAAMA: Graph Augmented Associative Memory for Agents [0.0]
  GAAMA is a graph-augmented associative memory system that constructs a concept-mediated hierarchical knowledge graph.<n>On the LoCoMo-10 benchmark (1,540 questions across 10 multi-session conversations), GAAMA achieves 78.9% mean reward, outperforming a tuned RAG baseline.
  arXiv  Detail & Related papers  (2026-03-29T23:33:38Z)
• Graph-Native Cognitive Memory for AI Agents: Formal Belief Revision Semantics for Versioned Memory Architectures [0.6091702876917279]
  Kumiho is a graph-native cognitive memory architecture grounded in formal belief revision semantics.<n>The architecture implements a dual-store model (Redis working memory, Neo4j long-term graph) with hybrid fulltext and vector retrieval.
  arXiv  Detail & Related papers  (2026-03-18T00:59:49Z)
• Selective Memory for Artificial Intelligence: Write-Time Gating with Hierarchical Archiving [0.0]
  Parametric approaches compress knowledge into weights, precluding selective updates.<n>We introduce write-time gating that filters incoming knowledge objects using composite salience scores.
  arXiv  Detail & Related papers  (2026-03-16T23:06:44Z)
• $G^2$-Reader: Dual Evolving Graphs for Multimodal Document QA [53.491241153213565]
  $G2$-Reader is a dual-graph system for multimodal question answering.<n>$G2$-Reader with Qwen3-VL-32B-Instruct reaches 66.21% average accuracy, outperforming strong baselines and a standalone GPT-5 (53.08%)<n>On VisDoMBench across five multimodal domains, $G2$-Reader with Qwen3-VL-32B-Instruct reaches 66.21% average accuracy, outperforming strong baselines and a standalone GPT-5 (53.08%)
  arXiv  Detail & Related papers  (2026-01-29T17:52:54Z)
• Full-History Graphs with Edge-Type Decoupled Networks for Temporal Reasoning [16.53173953073833]
  We introduce a full-history graph that instantiates one node for every entity at every time step.<n>We evaluate it on driverintention prediction (Waymo) and Bitcoin fraud detection (Elliptic++)<n>These gains demonstrate the benefit representing structural and temporal relations as distinct edges in a single graph.
  arXiv  Detail & Related papers  (2025-08-05T09:29:07Z)
• Respecting Temporal-Causal Consistency: Entity-Event Knowledge Graphs for Retrieval-Augmented Generation [69.45495166424642]
  We develop a robust and discriminative QA benchmark to measure temporal, causal, and character consistency understanding in narrative documents.<n>We then introduce Entity-Event RAG (E2RAG), a dual-graph framework that keeps separate entity and event subgraphs linked by a bipartite mapping.<n>Across ChronoQA, our approach outperforms state-of-the-art unstructured and KG-based RAG baselines, with notable gains on causal and character consistency queries.
  arXiv  Detail & Related papers  (2025-06-06T10:07:21Z)
• SG-Tailor: Inter-Object Commonsense Relationship Reasoning for Scene Graph Manipulation [73.76691480257851]
  We introduce SG-Tailor, an autoregressive model that predicts the conflict-free relationship between any two nodes.<n>For edge modification, SG-Tailor employs a Cut-And-Stitch strategy to solve the conflicts and globally adjust the graph.
  arXiv  Detail & Related papers  (2025-03-23T09:11:04Z)
• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• Rethinking Space-Time Networks with Improved Memory Coverage for Efficient Video Object Segmentation [68.45737688496654]
  We establish correspondences directly between frames without re-encoding the mask features for every object. With the correspondences, every node in the current query frame is inferred by aggregating features from the past in an associative fashion. We validated that every memory node now has a chance to contribute, and experimentally showed that such diversified voting is beneficial to both memory efficiency and inference accuracy.
  arXiv  Detail & Related papers  (2021-06-09T16:50:57Z)
• Iterative Context-Aware Graph Inference for Visual Dialog [126.016187323249]
  We propose a novel Context-Aware Graph (CAG) neural network. Each node in the graph corresponds to a joint semantic feature, including both object-based (visual) and history-related (textual) context representations.
  arXiv  Detail & Related papers  (2020-04-05T13:09:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.