arXiv (All)
open access
When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
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 objec
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Order-Optimal Systematic Permutation Codes for Correcting t Deletions#1141895
- Ordering Without Priority (The Non-Modal Structural System XXVIII)#71678
- Retroactive Monotonic Priority Queues via Range Searching#144345
- Nested Regime Composition: Certified Interfaces, Obligation Flow, and the Soundness of Level Ascent#690950
- Population Protocols over Ordered Agents#175206
Record · ID 1156084
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive