Deletion Certificates for Support-Vector Memory: What They Cover and When They Expire

This paper examines how to verifiably delete stored items from a memory that places a support-vector boundary around keys and weights their values by the resulting coefficients. It shows that when a coefficient is exactly zero, the key can be removed without altering the current normal, and identifies the conditions under which such deletion guarantees stop holding. The work aims toward auditable removal in memory-based learning systems.