arXiv — cs.AI preprintsInternational2 October 2026
When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
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 objective by request--position costs, reducing optimization to assignment and, with a shared positio
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Heavy-Tailed Memory Traces in Long-Horizon Language Agents2 October 2026
- When Do Causal World Models Help Modular LLM Agents2 October 2026
- From Proposal to Verified Effect: Praxa, an Evidence-Bound Harness for Governed AI Agent Execution2 October 2026
- What Do Rationales Communicate? A Message-Intervention Study in Role-Specialized QA2 October 2026
- Measuring the Microtask Eligibility Gap: When Is an Off-the-Shelf SLM Enough for an Agent Harness?2 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.