Metraipolis › archive › dc_c3f8097dbc4e
ROUTEAUDIT: Interaction-Aware Identification for Budgeted Multi-Verifier Routing — arXiv:2610.02808
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.02808
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-05T22:49:15.118Z
- SHA-256 of the archived text
e19194579e1b3400877ea1bd29311b5f2131a407c576dbb7b4d1f21604aeb202- Stable URL of this page
https://metraipolis.com/documento/dc_c3f8097dbc4e
How to cite
ROUTEAUDIT: Interaction-Aware Identification for Budgeted Multi-Verifier Routing — arXiv:2610.02808 — arXiv, https://arxiv.org/abs/2610.02808 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c3f8097dbc4e (Metraipolis archive dc_c3f8097dbc4e, sha256 e19194579e1b3400877ea1bd29311b5f2131a407c576dbb7b4d1f21604aeb202)
BibTeX
@misc{dcc3f8097dbc4e,
title = {ROUTEAUDIT: Interaction-Aware Identification for Budgeted Multi-Verifier Routing — arXiv:2610.02808},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.02808},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c3f8097dbc4e; sha256 e19194579e1b3400877ea1bd29311b5f2131a407c576dbb7b4d1f21604aeb202},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.02808. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Adaptive multi-verifier systems are commonly compared through endpoint quality-cost gaps, even when the verifier catalog, availability, accounting, information filtration, or scorer changes with the policy. We formulate verifier routing as a contract-conditioned identification problem. The contract records request support, verifier catalog, realized availability, resource accounting, online filtration, and post-trace scoring; a matched route contrast changes only the policy coordinate. ROUTEAUDIT adds three measurable objects to this contract. A contract lattice averages coordinate increments over every admissible bridge order and reports the resulting attribution together with its path sensitivity. A policy-independent response tape identifies paired sequential contrasts when adaptive policies reveal different observations. For incomplete matching, request-level bounds use whichever potential outcome remains observed and give a sharp finite-population interval. The protocol commits paid observations and ledger events before the oracle join and returns an attribution certificate for each comparison. On two held-out raw-tail caches, matched static SF+SA equals the cascade, assigning the apparent gains of 0.1797 and 0.1250 over full static to the verifier-set edge. On 1,319 held-out task requests, the learned and RLVR studies report quality 0.9522 and 0.9553 versus 0.9484 for matched static; the RLVR-static paired difference is +0.0068 with a request-paired interval $[0.0015,0.0122]$ and a training-seed-by-request hierarchical interval $[0.0006,0.0131]$. Controlled attribution recovery yields route mean absolute error 0.0011 and endpoint reconstruction error 0.0004. Factorial, bridge-order, and stochastic-provider studies evaluate the certificate interface; RLVR supplies a learned-policy stress test under the same identification contract. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI) ; Computation and Language (cs.CL); Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.02808 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-05T22:45:55.633Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).