{
  "annotation_id": "8b0704f0-abfb-46cc-b5e4-25dd4db7a633",
  "date_created": "2026-02-17T05:53:15.042000Z",
  "date_modified": "2026-02-17T05:53:15.042000Z",
  "file_hash": "24983ed0262e6003f5c0c6bb3bf854d55a3d9e2ff5be0b6c5efb90ee05062535",
  "private": false,
  "record": {
    "abstract": "Distributed multi-agent systems (DMAS) based on large language models (LLMs) enable collaborative intelligence while preserving data privacy. However, systematic evaluations of long-term memory under network constraints are limited. This study introduces a flexible testbed to compare mem0, a vector-based memory framework, and Graphiti, a graph-based knowledge graph, using the LoCoMo long-context benchmark. Experiments were conducted under unconstrained and constrained network conditions, measuring computational, financial, and accuracy metrics. Results indicate mem0 significantly outperforms Graphiti in efficiency, featuring faster loading times, lower resource consumption, and minimal network overhead. Crucially, accuracy differences were not statistically significant. Applying a statistical Pareto efficiency framework, mem0 is identified as the optimal choice, balancing cost and accuracy in DMAS.",
    "arxiv_id": "2601.07978",
    "authors": [
      "Benedict Wolff",
      "Jacopo Bennati"
    ],
    "categories": [
      "cs.IR"
    ],
    "license": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
    "title": "Cost and accuracy of long-term memory in Distributed Multi-Agent Systems based on Large Language Models",
    "url": "https://arxiv.org/abs/2601.07978",
    "version": "v2"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "461f8045-8332-4aee-afd4-aa040de89cb5",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}