arXiv AI
When Is Deletion Ordering Tractable? From Update Dynamics to Permutation Structure
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv Computation and Language
Sep 15
Prefix Sharing Is a Sorting Problem
arXiv:2609.13692v1 Announce Type: cross Abstract: LLM serving reuses KV cache by exact prefix match, so when a prompt is assembled from a set of reusable pieces -- retrieved passages, tool definition...
arXiv AI
Sep 16
Execution Flexibility in Automated Planning: A Comparative Evaluation of Deordering and Reordering Strategies
The paper evaluates strategies for increasing plan‑execution flexibility by converting sequential plans into partial‑order plans through deordering and reordering. It compares block deordering methods, which restructure causal dependencies, with MaxSAT‑based approaches that optimize within existing causal structures. The study finds that block deordering consistently outperforms MaxSAT in both effectiveness and efficiency, offering anytime solutions and higher flexibility gains per computation time.
arXiv AI
Aug 13
Terminal Symmetry as a Decision Resource: Statewise Refinement for Anytime Verified Construction
arXiv:2608. 11318v1 Announce Type: cross Abstract: Many sequential construction tasks exhibit exact symmetry at completion while their execution remains directed and history-dependent.
arXiv Machine Learning
Jul 31
Subtract or Replay? Exact Deletion from Language-Model Memory
arXiv:2607. 27539v1 Announce Type: new Abstract: Exact deletion from persistent language-model memory depends on how that memory represents a record.
arXiv AI
Aug 6
The Order Is the Guarantee: Verifier-Budgeted Code Deletion with Static-First Learned Proposals
arXiv:2608. 04611v1 Announce Type: cross Abstract: Frontier coding models now match or exceed strong human reference points on programming benchmarks, yet benchmark success does not imply maintainable software.
arXiv Machine Learning
Sep 24
From Reasoning Strings to Partial Orders: Verifier-Certified Rule Transport through Quotient Policy Optimization
The paper introduces Verifier-Certified Rule Transport (VCRT), a method that uses native verifiers to replay adjacent operation pairs and identify commutation certificates or anti-diamonds, thereby distinguishing true logical dependencies from mere serialization choices in reinforcement learning with verifiable rewards. VCRT assigns policy credit based on the total probability mass of each certified orbit and imposes constraints on post-swap consistency, source retention, and policy drift. In leave-one-environment-out transfer experiments across ProofWriter, CLRS, and Lean, VCRT achieves a 77.60% macro pass rate, outperforming the strongest baseline by 13.06 points, with the largest gains observed in Lean.