MELD: A Protocol for Merging Knowledge Across Distributed Agentic Memories

• URL: http://arxiv.org/abs/2608.16357v1
• Date: Mon, 17 Aug 2026 10:09:06 GMT
• Title: MELD: A Protocol for Merging Knowledge Across Distributed Agentic Memories
• Abstract summary: MELD is a self-managing coherence mechanism for a federation of agent memories.<n>Each brain admits every incoming claim through a five-outcome procedure.<n>On HotpotQAor, distributed merge is recall-non-inferior to a centralized store.
• Score: 2.2541665241198534
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Autonomous agents share a transport and can call each other's tools, but they cannot share what they know: no protocol lets two agents' memories reconcile a fact phrased two ways, link related facts held apart, or reconcile contradictory knowledge without silently discarding either claim. We present MELD, a self-managing coherence mechanism for a federation of agent memories whose run-time model is the knowledge graph itself. Each brain admits every incoming claim through a five-outcome procedure (insert, merge, relate, conflict, or reject), decided from three signals (scoped claim-key identity, embedding similarity, and a natural-language-inference verdict) under context and freshness gates, and acting through exactly one auditable, authenticated Patch, the only object that mutates state. A binding onto standard publish/subscribe transport with a per-claim status CRDT keeps sovereign brains coherent in claim status without a coordinator: self-healing after partitions and under lossy routing, and self-protecting against silent rewrite by a peer, under a benign-fault model. MELD does not adjudicate truth; a detected contradiction is preserved for later adjudication, never silently resolved. On HotpotQA distractor, distributed merge is recall-non-inferior to a centralized store under a pre-specified equivalence test and recall-superior to naive union at about 11% less live storage; the merge classifier separates at AUC 0.968 with a 0.013 false-merge rate on adjudicated candidate pairs; the status CRDT reconverges in 30/30 real partition-heal trials where last-writer-wins manages 11/30; and semantic routing delivers about 3x fewer messages at matched recall. We evaluate on a real computing continuum spanning an operator-grade 5G edge, national HPC, and a local tier, with empirically calibrated thresholds.

Related papers

• Zero-Knowledge Predicate Proofs Between AI Agents: A Measured, Cross-Protocol Gateway and the Source-Integrity Gap [0.0]
  Multi-agent AI platforms move quickly from staging to production, but the way agents establish trust remains rudimentary.<n>We take provable data minimisation between agents from proposal to running system.<n>A 32-bit threshold predicate proves in 6.2 ms and verifies in 1.0 ms with a 608-byte Bulletproofs proof.
  arXiv  Detail & Related papers  (2026-08-30T23:16:17Z)
• Twin Worlds: Equivariance-Based Abstention for Evidence-Grounded Reasoning [38.63002496590365]
  We propose a framework for improving reliability in knowledge-intensive reasoning through equivariance-based abstention.<n>A key contributing factor is that entity mentions in context activate memorised associations, causing models to generate plausible responses ungrounded in evidence.<n>We construct multiple worlds via typed substitutions of the original input that preserve relational structure while reducing parametric priors.
  arXiv  Detail & Related papers  (2026-08-28T07:33:29Z)
• Emergent Misaligned Communication in Long-Horizon Multi-Agent LLM Commerce [39.937871162878785]
  We operationalize speech-act misalignment as emails containing false factual claims, manipulation, collusion, or threats.<n>12.6% of emails are labeled misaligned; misalignment appears in all 20 runs and 74.7% of individual agent-runs.<n>We find no evidence that higher-capability models differentially exploit weaker counterparties.
  arXiv  Detail & Related papers  (2026-08-14T18:56:12Z)
• Independent Patch Verification for Coding Agents with a Bidirectional Reconstruct-and-Verify Framework [49.16055123488827]
  coding agents powered by large language models can now generate code patches directly from bug reports.<n>No mechanism independently verifies whether it truly resolves the reported problem.<n>We propose RETRACE, a training-free post-generation verification framework.
  arXiv  Detail & Related papers  (2026-08-09T22:59:13Z)
• Runtime Observability for Heterogeneous Attention Memory [20.158719055939383]
  We give a runtime observability contract that covers all four memory classes with three operators.<n>We compose the per-stage stack into an executable request-level risk ledger.
  arXiv  Detail & Related papers  (2026-08-06T10:41:50Z)
• StateFuse: Deterministic Conflict-Preserving Memory for Multi-Agent Systems [6.160059055899747]
  StateFuse is a conflict-aware replicated memory contract built on standard OpSet/CRDT merge.<n>We evaluate StateFuse against flat multi-value, raw-log, provenance-style, and collapsed baselines under matched resolver and verification policies.
  arXiv  Detail & Related papers  (2026-07-07T05:06:33Z)
• What Accuracy and Gradient Cosine Miss: Evaluating Feedback Alignment via Scale Stability, Reference Validity, and Depth Utility [48.10132234701036]
  We propose a diagnostic evaluation protocol based on three checks -- scale stability, reference validity, and depth utility -- together with per-layer rather than aggregate cosine reporting.<n>Across multiple architectures and methods, our protocol identifies all failures with wide calibration margins.
  arXiv  Detail & Related papers  (2026-06-19T06:04:17Z)
• TOKI: A Bitemporal Operator Algebra for Contradiction Resolution in LLM-Agent Persistent Memory [22.85129722207174]
  We show that contradiction resolution is write-time control and make the missing contract explicit.<n> TOKI types the fourjudicats as one family of bitemporal operators over a dual-row schema.<n>A verdict matrix over eight systems localizes the gap: every baseline that keeps a language-model judge on the write path admits at least one of three write-time anomalies.
  arXiv  Detail & Related papers  (2026-06-04T14:46:52Z)
• QUACK: Questioning, Understanding, and Auditing Communicated Knowledge in Multimodal Social Deduction Agents [38.13248430205106]
  QUACK is an evaluation framework for auditing the grounding of agent language in multimodal social reasoning.<n>It reconstructs each agent's ground-truth trajectory from engine logs and checks every discussion claim against it.<n>We find that even the strongest agent hallucinates 15.1% of its verifiable spatial claims and makes over half of its accusations without grounded evidence.
  arXiv  Detail & Related papers  (2026-05-26T14:19:08Z)
• What Are We Actually Decoding? Source Attribution for Non-Invasive Brain-to-Language Retrieval [42.66754319854329]
  We recast stimulus-locked MEG-to-audio retrieval as an auditing framework.<n>We use structural shortcuts, window-level stimulus-locked evidence, and cross-window contextual aggregation.<n>These results suggest that brain-to-language performance should be source-attributed, not merely reported.
  arXiv  Detail & Related papers  (2026-05-23T11:23:39Z)
• MemReranker: Reasoning-Aware Reranking for Agent Memory Retrieval [37.54115468116941]
  This report introduces MemReranker, a reranking model family (0.6B/4B) built on Qwen3-Reranker through multi-stage LLM knowledge distillation.<n>On the memory retrieval benchmark, MemReranker-0.6B substantially outperforms BGE-Reranker and matches open-source 4B/8B models as well as GPT-4o-mini on key metrics.<n>MemReranker-4B further achieves 0.737 MAP, with several metrics on par with Gemini-3-Flash, while maintaining inference latency at only 10-20% of large models.
  arXiv  Detail & Related papers  (2026-05-07T12:33:57Z)
• PBFT-Backed Semantic Voting for Multi-Agent Memory Pruning [0.0]
  This paper introduces the Co-Forgetting Protocol to enable synchronized memory pruning in multi-agent systems (MAS)<n>The protocol integrates three key components: (1) context-aware voting, where agents utilize a lightweight DistilBERT model to assess the relevance of memory items based on their content and the current operational context; (2) multi-scale temporal decay functions, which assign diminishing importance to memories based on their age and access frequency across different time horizons; and (3) a Practical Byzantine Fault Tolerance (PBFT)-based consensus mechanism, ensuring that decisions to retain or discard memory items are agreed upon by a qualified and fault-tolerant majority of agents
  arXiv  Detail & Related papers  (2025-06-19T08:28:29Z)
• ReCon: Enhancing True Correspondence Discrimination through Relation Consistency for Robust Noisy Correspondence Learning [42.292388966066135]
  We propose a general Relation Consistency learning framework, namely ReCon, to accurately discriminate the true correspondences among the multimodal data.<n>ReCon significantly enhances its effectiveness for true correspondence discrimination and therefore reliably filters out the mismatched pairs.
  arXiv  Detail & Related papers  (2025-02-27T10:38:03Z)

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.