MemoRepair formalizes the cascade update problem in agentic memory and solves it via a min-cut reduction that eliminates invalidated memory exposure to 0% while recovering 91-94% of valid successors at 57-76% of baseline repair cost.
Maximal closure of a graph and applications to combinatorial problems,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Presents a polynomial-time s-t cut algorithm for minimum Riesz s-energy k-subset selection on ordered 1D points via Monge property and submodularity, extending to ℓ1-staircases.
citing papers explorer
-
MEMOREPAIR: Barrier-First Cascade Repair in Agentic Memory
MemoRepair formalizes the cascade update problem in agentic memory and solves it via a min-cut reduction that eliminates invalidated memory exposure to 0% while recovering 91-94% of valid successors at 57-76% of baseline repair cost.
-
Polynomial-Time Riesz-Energy Subset Selection for Ordered Point Sets on Lines and $\ell_1$-Staircases
Presents a polynomial-time s-t cut algorithm for minimum Riesz s-energy k-subset selection on ordered 1D points via Monge property and submodularity, extending to ℓ1-staircases.