---
title: "world-rerank-repair-boundary — Mova code model"
description: "Mova code model of world/src/rerank.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/world/src/rerank.rs.groupant/repair-boundary.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/rerank.rs.groupant/repair-boundary.groupant/>

# world-rerank-repair-boundary

The groupant beside world/src/rerank.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/rerank.rs`](https://github.com/ElamurAI/mova-free/blob/main/world/src/rerank.rs)
- **source SHA-256:** `7734d1b33c02f022…`
- **covers:** repairs proposes lexical changes first, otherwise matrix/category/tag-conditioned role changes. hand_pass_without applies at most two passes, changes relation and lexical UPOS/tag, and accumulates applications. repair_words_with joins this with shipped induced rules depending on mode/domain. (bytes 6373–21247)
- **part of:** [world-rerank](https://md.groupants.elamur.ai/free/en/mova/world/src/rerank.rs.groupant/)
- **repository folder:** [`world/src/rerank.rs.groupant/repair-boundary.groupant`](https://github.com/ElamurAI/mova-free/tree/main/world/src/rerank.rs.groupant/repair-boundary.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` |
| **composition** | partial source model | [composition](#composition) |
| **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 |
|---|---|---|---|
| `world-rerank-repair-boundary-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `world-rerank-repair-boundary-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `world-rerank-repair-boundary-coupling` | constraint_relation | partial source model | [coupling](#coupling) |
| `world-rerank-repair-boundary-observation-fiber` | information_loss | partial source model | [observation-fiber](#observation-fiber) |

## Model text


### forward

repairs proposes lexical changes first, otherwise matrix/category/tag-conditioned role changes. hand_pass_without applies at most two passes, changes relation and lexical UPOS/tag, and accumulates applications. repair_words_with joins this with shipped induced rules depending on mode/domain.

### invariant

Returned application count counts changes per pass, not distinct final word identities. Valid head indices and matrix score range are caller premises; arbitrary malformed supplied trees can panic.

### cost

C candidates and N sentences: pick O(C), report O(sum C + 1000N) time and O(N) bootstrap storage. Lambda sweep multiplies candidate cost by ten. repairs repeatedly scans nodes and matrix lookups; hand passes bounded by two. Parser, matrix initialization and induced-rule costs not bounded here. No timing gain claimed.

### composition

main.rs absurd-rerank calls run, which loads dev/test via items using annotator.annotate/annotate_kbest and absurd::judge. Scores pass through en::annotate::annotate_kbest from parser.parse_kbest (f32 promoted to f64), so negative infinity is admissible. run selects lambda on dev, report uses get for sentinel safety. Actual repair callers are tree/reader and evaluation paths; source inspection does not execute them.

### epoch-memory

2026-10-30 first source-bound epoch. Before repair, native invalid-score and cardinality assertions failed on old production behavior. Narrow input checks now prevent undefined NaN ordering and silent report undercount. Infinite parser scores remain supported. Empty conventions and malformed-metadata/repair limits are retained explicitly. No optimization or percentage-error surrogate is proposed.

### checks

cargo test -p world --lib rerank::wave10_models -- --test-threads=1. See root evidence.md for raw evidence hashes, repeated profiles and compiled controls. Syntax is partial; macro bodies are opaque and semantic AST/name/type resolution is absent.

### behavior-complement

Subject/revision: bound source hash and this scope. Domain/observation/operator: Conditional source model excludes hand-only application of explicitly excluded Repair kinds and more than two hand passes. This fragment has source inspection only; no runtime repair inference is certified.

Status: partial source-derived relation; finite evidence only as named in checks. Assumptions: bounded counts without integer or floating arithmetic overflow, successful allocations and fixed dependencies. Unknown external behavior is not excluded. Reverse relations retain ambiguity; finite witnesses do not establish universal completeness.

### reverse-reconstruction

Subject/revision: bound source hash and this scope. Domain/observation/operator: Observed repaired words admit every earlier word/tree and rule trace producing them; without previous labels, modes and matrix snapshot recovery is ambiguous.

Status: partial source-derived relation; finite evidence only as named in checks. Assumptions: bounded counts without integer or floating arithmetic overflow, successful allocations and fixed dependencies. Unknown external behavior is not excluded. Reverse relations retain ambiguity; finite witnesses do not establish universal completeness.

### coupling

Subject/revision: bound source hash and this scope. Domain/observation/operator: reader tree and event pipelines call repair_words; run_repair and repair_eval join gold lengths and parser outputs by position. Zip truncation can hide missing parser words; exact aligned lengths remain unverified at these external boundaries.

Status: partial source-derived relation; finite evidence only as named in checks. Assumptions: bounded counts without integer or floating arithmetic overflow, successful allocations and fixed dependencies. Unknown external behavior is not excluded. Reverse relations retain ambiguity; finite witnesses do not establish universal completeness.

### observation-fiber

Subject/revision: bound source hash and this scope. Domain/observation/operator: Mode induced runs lexical hand first then shipped rules; both runs full hand then shipped rules; other mode strings run full hand. These branches are not inferred from final labels alone.

Status: partial source-derived relation; finite evidence only as named in checks. Assumptions: bounded counts without integer or floating arithmetic overflow, successful allocations and fixed dependencies. Unknown external behavior is not excluded. Reverse relations retain ambiguity; finite witnesses do not establish universal completeness.