By sorting KV-caches via mean K-norm ordering, cache merging becomes a commutative, associative, idempotent CvRDT that delivers identical results under any permutation and absorbs duplicates.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Cache Merging as a Convergent Replicated State for Multi-Agent Latent Reasoning
By sorting KV-caches via mean K-norm ordering, cache merging becomes a commutative, associative, idempotent CvRDT that delivers identical results under any permutation and absorbs duplicates.