What a Deletion Certificate Covers, and Where It Expires: Auditable Removal from a Support-Vector Memory

תקציר מקורי באנגליתarXiv:2607.12204v4 Announce Type: replace Abstract: We study deletion in a context memory that fits a support-vector boundary around stored keys and uses the resulting nonnegative coefficients to weight their values. An exactly zero coefficient lets us remove a key without changing the current normalized readout. In a three-key construction, however, a later admission makes the discarded key active in a solve over the full history. For a positive-weight key, a decremental update targets a refit on the remaining keys at the original coefficient cap, under its stated assumptions. Earlier standalone comparisons show close typical gate-score agreement, while similar keys with different values can yield larger readout differences. The journal extension tests chained deletions and admissions, ch