SafeRoute-MAS: Coverage-Aware and Risk-Calibrated Message Routing for Multi-Agent Scientific Reasoning
Organizations: College of Engineering Northeastern University Boston, USA · Independent Researcher Austin, USA · Independent Researcher Santa Clara, USA · Independent Researcher San Jose, USA ·
Abstract
We introduce SafeRoute-MAS, a coverage-aware, risk-calibrated procedure that keeps all specialist messages or removes one using only pre-integration information. On a sealed cache of 5,328 committees, its source-compatible operating point gains +1.80 percentage points (95% CI [+1.13, +2.52]) while removing 12.76% of message tokens. We also run 4,580 controlled integrations over a stratified 458-committee sample on a public gpt-oss-120b endpoint. The sample estimate is -0.09 points; design weighting to the original workload gives +0.94 points (95% CI [-1.31, +3.50]) and 18.72% acted-input reduction. A weighted token-matched comparison likewise does not establish a selector advantage (+1.68 points, CI [-1.27, +5.10]). Only 13 of 88 cached non-neutral labels (14.8%) retain direction by repeated-call majority. Expected-corruption UCL is 4.60% after weighting, but only 2 of 11 prespecified marginals pass the support/risk rule. We therefore propose a numerical qualification with Keep-All fallback, applied here retrospectively rather than validated prospectively.
Figures & tables
| Method | Acc. | pp | Rec./Corr. | Cov. | Tok. | UCL |
|---|---|---|---|---|---|---|
| Keep-All | 74.89 | 0.00 | 0/0 | 0.0 | 0.0 | – |
| SafeRoute-MAS | 76.69 | +1.80 | 164/68 | 43.5 | 12.76 | 3.61 |
| Lowest self-conf. | 76.63 | +1.75 | 205/112 | 40.2 | 12.07 | 6.14 |
| Completeness | 76.13 | +1.24 | 142/76 | 39.8 | 11.08 | 4.34 |
| Longest | 76.11 | +1.22 | 145/80 | 40.1 | 13.59 | 4.50 |
| Minority answer | 75.51 | +0.62 | 164/131 | 39.4 | 12.75 | 7.28 |
| Scope | Cov. | Risk | UCL | Corr. | LOBO pp |
|---|---|---|---|---|---|
| JEEBench | 50.0 | 0.49 | 1.46 | 0.24 | +0.05 |
| LAB-Bench | 74.2 | 4.78 | 6.79 | 3.55 | +8.76 |
| MaScQA | 36.2 | 2.13 | 4.44 | 0.77 | -0.04 |
| Omni-MATH-2 | 41.2 | 2.97 | 3.88 | 1.23 | -0.45 |
| SciBench | 22.8 | 0.95 | 2.75 | 0.22 | -0.09 |
| 0.0 | – | – | 0.00 | – |
| Estimand | Units | pp (95% CI) | Tok. | Risk UCL |
|---|---|---|---|---|
| Frozen 458 sample | 2,290 | 12.63 | 5.37 a | |
| Wtd. full workload | 5,328 | 18.72 | 4.60 b | |
| Validator branch | 790 | 3.97 | 7.23 b | |
| Balanced learned tail | 1,500 | 16.81 | 4.94 b | |
| Wtd. tail vs matched | 3,599 | +1.63 | – |
Multi-Agent Communication
Multi-agent communication studies how autonomous agents exchange information to coordinate decisions, share knowledge, and act together under constraints.
See all 394 papers