When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure

Excerpt

arXiv:2610.01149v1 Announce Type: cross Abstract: Given a fixed set of pending deletion requests, retraining from scratch after each request is prohibitive, so a prescribed request-wise policy processes them sequentially. The resulting terminal model can depend on their order. Rather than prescribing an ordering rule, we study the permutation objective induced by the fixed policy and ask when it admits simpler structure. We identify two independent reductions: position additivity represents the