MemStrata maintains temporal validity in retrieval memory via deterministic (s,r,o) supersession, matching RAG on static recall while reaching 0.95-1.00 accuracy on evolving knowledge where RAG scores 0.20-0.47 and cutting stale-fact errors from 15-40% to near zero.
A survey on temporal knowledge graph: Represen- tation learning and applications
3 Pith papers cite this work. Polarity classification is still indexing.
years
2026 3verdicts
UNVERDICTED 3representative citing papers
The paper identifies three pathologies of probabilistic RAG in legal retrieval (mereological blindness, diachronic blindness, causal opacity) and derives four deterministic architectural commitments to address the hierarchical, temporal, and institutional structure of legal knowledge.
OIDA is a proposed framework that represents organizational knowledge as epistemic Knowledge Objects with class-specific importance decay and signed contradictions, plus a QUESTION mechanism that surfaces modeled ignorance via inverse decay.
citing papers explorer
-
Temporal Validity in Retrieval Memory: Eliminating Stale-Fact Errors for AI Agents over Evolving Knowledge
MemStrata maintains temporal validity in retrieval memory via deterministic (s,r,o) supersession, matching RAG on static recall while reaching 0.95-1.00 accuracy on evolving knowledge where RAG scores 0.20-0.47 and cutting stale-fact errors from 15-40% to near zero.
-
Beyond Probabilistic Similarity: Structural, Temporal, and Causal Limitations of Retrieval-Augmented Generation in the Legal Domain
The paper identifies three pathologies of probabilistic RAG in legal retrieval (mereological blindness, diachronic blindness, causal opacity) and derives four deterministic architectural commitments to address the hierarchical, temporal, and institutional structure of legal knowledge.
-
Retrieval Is Not Enough: Why Organizational AI Needs Epistemic Infrastructure
OIDA is a proposed framework that represents organizational knowledge as epistemic Knowledge Objects with class-specific importance decay and signed contradictions, plus a QUESTION mechanism that surfaces modeled ignorance via inverse decay.