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

# world-qa3-story-order

The groupant beside world/src/qa3.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/qa3.rs`](https://github.com/ElamurAI/mova-free/blob/main/world/src/qa3.rs)
- **source SHA-256:** `63bb16a3727128a4…`
- **covers:** Event descriptions resolve across worlds, filter verbs/roles/anchor ranges, and sort by (sentence,line,ID). order uses TimeGraph ordering and explanatory paths, then independently compares telling (sentence,line), with explicit equal-coordinate wording. Anachronies require real branches, shared world, strict endpoint relation and qualifying own announcement; rank by descending hit count then ID. (bytes 5241–14280)
- **part of:** [world-qa3](https://md.groupants.elamur.ai/free/en/mova/world/src/qa3.rs.groupant/)
- **repository folder:** [`world/src/qa3.rs.groupant/story-order.groupant`](https://github.com/ElamurAI/mova-free/tree/main/world/src/qa3.rs.groupant/story-order.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-qa3-story-order-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `world-qa3-story-order-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `world-qa3-story-order-projection-boundary` | observation_constraint | partial source model | [projection-boundary](#projection-boundary) |

## Model text


### forward

Event descriptions resolve across worlds, filter verbs/roles/anchor ranges, and sort by (sentence,line,ID). order uses TimeGraph ordering and explanatory paths, then independently compares telling (sentence,line), with explicit equal-coordinate wording. Anachronies require real branches, shared world, strict endpoint relation and qualifying own announcement; rank by descending hit count then ID.

### invariant

Telling ties must not assert either event told earlier. Event-ID tie breaking in selection is deterministic but does not establish chronological priority. Empty sort dispatch is rejected before indexing; valid sorting still uses predecessor count and sentence tie key.

### cost

Event selection O(E log E) plus role checks. Anachrony pairs O(E²) after graph closure; closure cost belongs to story. Sort O(N² log N) comparator-key recomputation plus closure; paths and output add their own work. New tie/empty checks are constant cost.

### composition

Public joins: World::apply on constructed Cmd/Line values -> answer -> verdict; read_questions -> answers_md on supplied frozen expectations. No neural parser, teacher, corpus, CLI persistence or courses executed.

### behavior-complement

Domain/universe: terminating calls on consistent supplied worlds and well-formed observations in this scope. Inner absent-behavior relation excludes transitions violating the invariant above. This is a source-derived partial exclusion; unknown paths and malformed world states remain outside it. It is not a complement of merely sampled tests.

### reverse-reconstruction

Text order answer admits many distinct time graphs yielding the same relation/path display. Equal telling coordinates can denote distinct simultaneous descriptions or the same event; they do not imply story-time equality.

### projection-boundary

Constructed v3 World::apply event stream joins graph ordering with public answer and report. Tie fixture changes only telling coordinates, preserving story BEFORE; a named assertion rejects invented earlier narration. Empty sort is an old-code panic witness and fallback regression. Complete malformed-story topology validation is not claimed.

All three typed entries bind the manifest revision and scope. Operators are invariant exclusion, output preimage and observation constraint respectively; status is partial source modeling with finite native evidence. Reverse relations preserve all described ambiguity; no complete solver or universal inverse is provided.

### checks

cargo test -p world --lib qa3::wave12_models -- --test-threads=1. See the file evidence.md for actual repeated profiles and compiled controls. Partial syntax projection leaves macro bodies opaque; no semantic AST proof.

### epoch-memory

2026-10-30: prospective constant-cost guards and tie comparison predicted rejection without changing valid selection or signatures. Four old-code witnesses failed: empty holder success, malformed interval broadening, empty sort panic and invented earlier narration for a tie. Narrow repairs retain ordinary substring scoring and existing historical explanation behavior. Future epistemic explanations and metadata consistency remain explicit limitations. No optimization or general percentage guarantee is inferred.