ROUTEAUDIT presents a framework for identifying and attributing performance in adaptive multi‑verifier routing systems. It treats routing as a contract‑conditioned identification problem, adding measurable objects such as a contract lattice, a policy‑independent response tape, and request‑level bounds to capture path sensitivity and finite‑population intervals. Experiments on held‑out caches and task requests demonstrate improved quality metrics and precise attribution with low reconstruction error.
arXiv:2609.36958v1 Announce Type: cross Abstract: Repeated verifier calls are useful only when they contribute conditional information. We introduce VStress, an auditable replay contract, and VStress...
arXiv:2608. 07583v1 Announce Type: cross Abstract: Multi-agent LLM systems route among model-backed advisors, yet a deployer rarely knows before shipping whether routing will help at all.
The paper proposes invalidation contracts to manage cached recovery suggestions in LLM agents, attaching version stamps and cacheability hints to each suggestion so stale entries can be evicted without trial and error. The protocol separates realized savings into validity (protocol‑dependent) and compliance (planner‑dependent), showing that row‑level invalidation can significantly improve first‑try compliance and recover a substantial portion of token costs across multiple models, while table‑level invalidation can be detrimental. The study evaluates the approach across seven models, three serving paths, two domains, and about 9,400 episodes, demonstrating deterministic validity and high eviction precision.
arXiv:2610.20532v1 Announce Type: cross Abstract: A multimodal agent must decide whether visual evidence is worth acquiring, which candidate or resolution to query, and when further interaction can n...
arXiv:2607. 29400v1 Announce Type: new Abstract: A routing decision can be revised at the next transaction, but a latched source exclusion persists across later decisions.
arXiv:2607. 08665v1 Announce Type: new Abstract: Routing among large language models (LLMs) trades response quality against serving cost, motivated by the reported gap between deployed routers and a per-instance oracle.
The paper audits whether routing entropy in Attention‑Residual transformer variants (Swin‑Tiny and DeiT‑Small) trained on CIFAR‑10/100 can signal prediction uncertainty beyond model confidence. Three tests examine the presence, consistency, and predictive power of routing signals, while a sensitivity audit measures how much injected effect the probes recover. Results show no significant improvement over confidence alone, with only modest recovery of injected signals and no consistent gains across seeds or metrics.
arXiv:2610.00385v1 Announce Type: cross Abstract: Replay selectors often rank cached trajectories by format feedback, confidence, freshness, or response length, although cache-level correctness and d...
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.
arXiv:2608. 14927v1 Announce Type: new Abstract: Multi-agent large language model (LLM) systems can improve reasoning by spending more computation, but deployment requires deciding when extra collaboration is worth its cost.
The paper introduces Audit-First VAPO, a method that separates directional admission from magnitude control for selective updates under imperfect verification. It employs an observation-only accept‑appeal‑abstain policy with a finite secondary‑verification budget, freezing the action trace before clean labels are added, and uses finite‑sample bounds to certify harmful risk, coverage, and verifier‑call rate. Experiments on Qwen3.5‑0.8B and GSM8K show that RC‑VAPO achieves high accuracy while maintaining low selected harmful risk and modest verifier cost compared to baseline methods.
CascadeLedger is a counterfactual execution‑audit framework designed for budgeted language‑model cascades. It enforces call‑before‑read semantics, records service and cache identities, and freezes event traces before scoring, ensuring that two executions can share a final answer and resource projection only if their routing decisions used legitimately observable information. The framework introduces counterfactual prefix non‑interference (CPNI), counterfactual influence frontier (CIF), and projection‑preserving adversarial mutation (PPAM) to detect and localize violations, achieving a clean false‑positive rate and high detection rates for serialized and hidden‑read faults while quantifying overhead for online and offline audits.