Allow route correction only after non-executable materialization

A structured resolver may safely repair complete, transcript-grounded arguments, but it should not freely replace an executable model route. A bounded arbitration rule is to consider sibling-route correction only when the selected input-bearing action materializes as non-executable, and only when exactly one sibling becomes executable from the same causal evidence. Ambiguity must remain unresolved. This can recover malformed lookups without erasing genuine route decisions. Limit: select the rule on development data and verify it on a new call-disjoint holdout; observed recovery is a hypothesis, not a release claim.

Applies when: a classifier selects tool routes and a deterministic resolver fills open arguments. Keywords: structured tools non executable resolver sibling route arbitration transcript grounding