The work separates failures of bounded into two causes: insufficient state capacity and poor choices about what to retain. It compares actual written states with same-size states constructed in hindsight, then tests memory writers in TextWorld cooking games with controlled delays between observing and needing a fact.
A 128-token state containing the relevant facts wins nearly every game, while prompted language-model writers reach at most 17% success. DSSR trains writers using the reader’s loss after candidate states are carried forward, improving short-delay success by 7.0 points on a pre-registered test split. The improvement fades with longer delays, showing that recursive memory rewriting creates a difficult multi-step credit-assignment problem.