Pith. sign in

REVIEW 13 cited by

Collaborative Memory: Multi-User Memory Sharing in LLM Agents with Dynamic Access Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.18279 v1 pith:3TUOJQJX submitted 2025-05-23 cs.MA cs.AIcs.CLcs.LG

Collaborative Memory: Multi-User Memory Sharing in LLM Agents with Dynamic Access Control

classification cs.MA cs.AIcs.CLcs.LG
keywords memoryagentspoliciesasymmetricfragmentssharingaccesscollaborative
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Complex tasks are increasingly delegated to ensembles of specialized LLM-based agents that reason, communicate, and coordinate actions-both among themselves and through interactions with external tools, APIs, and databases. While persistent memory has been shown to enhance single-agent performance, most approaches assume a monolithic, single-user context-overlooking the benefits and challenges of knowledge transfer across users under dynamic, asymmetric permissions. We introduce Collaborative Memory, a framework for multi-user, multi-agent environments with asymmetric, time-evolving access controls encoded as bipartite graphs linking users, agents, and resources. Our system maintains two memory tiers: (1) private memory-private fragments visible only to their originating user; and (2) shared memory-selectively shared fragments. Each fragment carries immutable provenance attributes (contributing agents, accessed resources, and timestamps) to support retrospective permission checks. Granular read policies enforce current user-agent-resource constraints and project existing memory fragments into filtered transformed views. Write policies determine fragment retention and sharing, applying context-aware transformations to update the memory. Both policies may be designed conditioned on system, agent, and user-level information. Our framework enables safe, efficient, and interpretable cross-user knowledge sharing, with provable adherence to asymmetric, time-varying policies and full auditability of memory operations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 13 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. MemTX: Transactional Belief Commit for Stateful Agent Memory

    cs.AI 2026-07 conditional novelty 7.0

    Staging agent-memory writes through a validate-and-commit pipeline with maturity-gated irreversible actions and typed cascading repair yields zero realized downstream harm on five LLM backbones, where eight baselines ...

  2. EquiMem: Calibrating Shared Memory in Multi-Agent Debate via Game-Theoretic Equilibrium

    cs.AI 2026-05 unverdicted novelty 7.0

    EquiMem calibrates shared memory in multi-agent debate by computing a game-theoretic equilibrium from agent queries and paths, outperforming heuristics and LLM validators across benchmarks while remaining robust to ad...

  3. Self-Evolving Multi-Agent Systems via Decentralized Memory

    cs.MA 2026-05 unverdicted novelty 6.0

    DecentMem is a decentralized dual-pool memory framework for self-evolving multi-agent systems that provides O(log T) regret guarantees and yields up to 23.8% accuracy gains over centralized baselines.

  4. MemForest: An Efficient Agent Memory System with Hierarchical Temporal Indexing

    cs.DB 2026-05 reject novelty 6.0

    MemForest speeds up agent memory writes about 6x by parallelizing extraction and using a hierarchical temporal index, while matching or beating stateful baselines on LongMemEval-S.

  5. State Contamination in Memory-Augmented LLM Agents

    cs.AI 2026-05 unverdicted novelty 6.0

    Toxic context can be laundered into memory summaries that stay below toxicity thresholds while still driving higher downstream toxicity in LLM agents compared to neutral baselines.

  6. Always-OnAgents:A Survey of Persistent Memory, State, and Governance in LLMAgents

    cs.MA 2026-06 unverdicted novelty 5.0

    Survey mapping persistent state in LLM agents along six axes and proposing the AOEP-v0 protocol to evaluate governance and recovery obligations.

  7. Governed Shared Memory for Multi-Agent LLM Systems

    cs.AI 2026-06 unverdicted novelty 5.0

    The paper defines four governance primitives for shared memory in multi-agent LLM fleets and reports evaluation results from a live production service.

  8. When Agents Handle Secrets: A Survey of Confidential Computing for Agentic AI

    cs.CR 2026-05 unverdicted novelty 5.0

    A survey providing a taxonomy of TEE platforms, an agent-centric threat model, and open challenges for applying confidential computing to secure agentic AI systems.

  9. MemForest: An Efficient Agent Memory System with Hierarchical Temporal Indexing

    cs.DB 2026-05 unverdicted novelty 4.0

    MemForest reformulates agent memory as a temporal data management problem using a hierarchical index (MemTree) for parallel construction and localized updates, reporting 79.8% accuracy and 6x throughput on LongMemEval...

  10. From Storage to Experience: A Survey on the Evolution of LLM Agent Memory Mechanisms

    cs.AI 2026-05 unverdicted novelty 4.0

    LLM agent memory is organized into Storage (preserving trajectories), Reflection (refining them), and Experience (abstracting into reusable knowledge) stages driven by needs for long-range consistency, dynamic adaptat...

  11. When Agents Handle Secrets: A Survey of Confidential Computing for Agentic AI

    cs.CR 2026-05 unverdicted novelty 4.0

    A structured survey of confidential computing for agentic AI that catalogs TEE platforms, agent-specific threats, transferable defenses, and remaining gaps in end-to-end frameworks.

  12. Detailed analysis of possible new-physics effects in the semileptonic decay $B_s \to D_s^{(*)}\tau\bar{\nu}$

    hep-ph 2026-03 unverdicted novelty 4.0

    Constraints on beyond-SM Wilson coefficients in B_s → D_s(*) τ ν̄ are derived from data using covariant-quark-model form factors, with full observable predictions for future experiments.

  13. Toward Efficient Agents: Memory, Tool learning, and Planning

    cs.AI 2026-01 conditional novelty 3.0

    A survey that organizes efficiency techniques for LLM agents into memory, tool learning, and planning, and consolidates benchmarks and metrics for measuring cost-performance trade-offs.