memory-systems

Implements agent memory architectures using vector stores, knowledge graphs, and temporal validity tracking.

Updated Feb 21, 2026
One-click install
npx skills add https://github.com/joySUSY/violet-plugin-place --skill memory-systems-joysusy
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: memory-systems
Source: https://github.com/joySUSY/violet-plugin-place/tree/main/plugins/developer-tool/ai-agent-memory/v3-expansion/memory-systems
Command: npx skills add https://github.com/joySUSY/violet-plugin-place --skill memory-systems-joysusy

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill requires numpy, and includes scripts (resource) and references (resource) components.

What problem does it solve? AI agents lose all state when sessions end, forcing users to repeat context and preventing long-term knowledge accumulation. This Skill guides the design and implementation of persistent memory systems so agents retain entities, facts, and relationships across sessions. ## Core Features & Use Cases - Framework Comparison: Compares production memory frameworks (Mem0, Zep/Graphiti, Letta, LangMem, Cognee) with benchmark data from LoCoMo, LongMemEval, DMR, and HotPotQA to support architecture decisions. - Layered Memory Design: Provides decision tables for working, short-term, long-term, entity, and temporal knowledge graph layers, plus retrieval strategies (semantic, entity-based, temporal, hybrid). - Working Implementations: Ships Python code for vector stores with metadata indexing, property graphs with entity registries, temporal knowledge graphs with validity intervals, and memory consolidation. - Use Case: When building a support agent that must remember a customer's preferences and history across conversations, use this Skill to choose a framework, design the memory layers, and implement temporal fact tracking. ## Quick Start Ask the agent to design a memory architecture for a chatbot that must remember user preferences across sessions and recommend a suitable framework.

Frequently Asked Questions about memory-systems

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I add long-term memory to an AI agent?▼

Start with file-system memory storing facts as structured JSON with timestamps, then move to a vector store like Mem0 when you need semantic search. Add a temporal knowledge graph such as Zep/Graphiti only when you need relationship traversal or time-based queries.

Mem0 vs Zep vs Letta: which agent memory framework should I choose?▼

Mem0 offers the fastest path to production with managed infrastructure and broad integrations. Zep/Graphiti fits enterprise use cases needing temporal reasoning over relationships, while Letta provides the deepest agent self-editing and introspection through tiered memory storage.

What is a temporal knowledge graph for agent memory?▼

A temporal knowledge graph stores facts as relationships with valid_from and valid_until timestamps, letting agents query what was true at a specific point in time. This prevents stale facts from poisoning context when information changes over time.

Does agent memory need a knowledge graph or is a vector store enough?▼

A vector store is enough for direct factual queries, but retrieval degrades on multi-hop reasoning. Benchmarks show Letta's simple filesystem agents scored 74% on LoCoMo, so add graph structure only when retrieval quality demands it.

How do I handle conflicting or outdated facts in agent memory?▼

Prefer the fact with the most recent valid_from timestamp and surface conflicts to the user when confidence is low. Consolidate memories periodically by invalidating outdated facts rather than deleting them, preserving history for temporal queries.

Why does agent memory retrieval return empty or stale results?▼

Empty results usually mean overly narrow filters, so fall back to broader searches by removing entity filters or widening time ranges. Stale results indicate expired valid_until timestamps, which should trigger memory consolidation before retrying.