---
title: "answer-span-routing — Mova code model"
description: "Mova code model of world/src/span.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/world/src/span.rs.groupant/routing.groupant/"
---
Elamur: [Mova](https://md.mova.elamur.ai/free/en/) · [Dictionary](https://md.dictionary.elamur.ai/free/en/) · [Research](https://md.research.elamur.ai/free/en/) · **Groupants**

This page as HTML: <https://groupants.elamur.ai/free/en/mova/world/src/span.rs.groupant/routing.groupant/>

# answer-span-routing

The groupant beside world/src/span.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.

## Facts

- **kind:** groupant_fragment
- **status:** partial source bound model
- **source:** [`world/src/span.rs`](https://github.com/ElamurAI/mova-free/blob/main/world/src/span.rs)
- **source SHA-256:** `4d215ccd57884f41…`
- **covers:** Source scope beginning pub enum Want {; selected node envelope, partial semantic coverage. (bytes 1156–2476)
- **part of:** [answer-span](https://md.groupants.elamur.ai/free/en/mova/world/src/span.rs.groupant/)
- **repository folder:** [`world/src/span.rs.groupant/routing.groupant`](https://github.com/ElamurAI/mova-free/tree/main/world/src/span.rs.groupant/routing.groupant)
- **repository commit:** `855da7bd4a7b`

> **Implementation material.** A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.

## Components

| component | label | where |
|---|---|---|
| **approximant** | partial source model | [forward](#forward) |
| **ast** | partial | `../syntax.json` |
| **cost** | partial source model | [cost](#cost) |
| **descriptant** | partial source model | [epoch-memory](#epoch-memory) |
| **invariant** | partial source model | [invariant](#invariant) |
| **tests** | partial source model | [checks](#checks) |

## Obernants

The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.

| id | type | label | where |
|---|---|---|---|
| `answer-span-routing-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `answer-span-routing-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `answer-span-routing-sub-presence` | counterfactual | partial source model | [sub-presence](#sub-presence) |
| `answer-span-routing-name-code` | encoding_relation | partial source model | [name-code](#name-code) |

## Model text


Subject: world/src/span.rs, whole-file SHA-256 in manifest, baseline 4279da541. Domain: finite acyclic valid trees with consistent child lists, valid indices and terminating dependencies. Observation: a single call return, not semantic truth or reachability. Hold Tree, ans::lemmas and types::FEELING dependencies fixed; parser/model loading and external caller wiring are gaps. All entries are source-derived partial models. Exact-target definitions are not executable inverses; finite tests cannot establish universal correspondence.

### forward

Pure kind routing with sub-presence branch for Happen/HappenTo.

### invariant

Routing never reads sub contents or tree.

### cost

O(1), no name allocation.

### epoch-memory

2026-10-29: initial source-bound epoch. Preserve Num bypass, global Feel selection, early-return cleanup suppression, and verb_kids comment mismatch: code expands Xcomp only and checks no shared subject. No source changes or task-accuracy claim. Partial syntax has no semantic analysis or macro expansion.

### checks

Structural inventory checks hashes, references, types and node bounds only. Proposed oracle: enumerate small annotated acyclic trees and compare literal expected returns, including None and labels; mutate priority or echo inequality to obtain a red control. Any executed bounded evidence is recorded separately in root evidence.md; catalog examples remain proposed until recorded there.

### composition

Leaf scope shares immutable tree/question/helper contracts. Overlap with parent is not extra runtime work. Dependencies outside range remain opaque.

### behavior-complement

U=QFrame x Want; R=want_of graph. Exact source-derived U minus R excludes every alternative to kind/sub-presence table result. Happen with absent sub cannot produce After.

Assumptions/evidence/status: common domain above; source-derived partial relation at bound revision. Approximation and held-fixed inputs are stated in the relation. Oracle: finite literal fixtures exercising both membership and nonmembership against the actual function, preserving ambiguous preimages. No linguistic correctness or universal proof inferred.

### reverse-reconstruction

Recover all kind/sub-presence pairs mapping to observed Want; other fields arbitrary. Say/Think and object/subject groups preserve ambiguity; Clause admits Generic and Happen/HappenTo with absent sub.

Assumptions/evidence/status: common domain above; source-derived partial relation at bound revision. Approximation and held-fixed inputs are stated in the relation. Oracle: finite literal fixtures exercising both membership and nonmembership against the actual function, preserving ambiguous preimages. No linguistic correctness or universal proof inferred.

### sub-presence

Switch only sub None to Some(any Clause): Happen/HappenTo changes Clause to After; every other kind is unchanged. Sub payload content is unobserved.

Assumptions/evidence/status: common domain above; source-derived partial relation at bound revision. Approximation and held-fixed inputs are stated in the relation. Oracle: finite literal fixtures exercising both membership and nonmembership against the actual function, preserving ambiguous preimages. No linguistic correctness or universal proof inferred.

### name-code

name maps the 13 Want variants injectively to their lowercase names. Inversion is defined only on those names, not extract rule labels or arbitrary text.

Assumptions/evidence/status: common domain above; source-derived partial relation at bound revision. Approximation and held-fixed inputs are stated in the relation. Oracle: finite literal fixtures exercising both membership and nonmembership against the actual function, preserving ambiguous preimages. No linguistic correctness or universal proof inferred.