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

# onto-hsmap-selection

The groupant beside onto/src/hsmap.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:** [`onto/src/hsmap.rs`](https://github.com/ElamurAI/mova-free/blob/main/onto/src/hsmap.rs)
- **source SHA-256:** `7ae1e9362cb8f9ce…`
- **covers:** score(c)=WSD(c)+1[preferred]+chapter_share(lf(c)); best replaces only >old+1e-9 (bytes 3692–7964)
- **part of:** [onto-hsmap](https://md.groupants.elamur.ai/free/en/mova/onto/src/hsmap.rs.groupant/)
- **repository folder:** [`onto/src/hsmap.rs.groupant/selection.groupant`](https://github.com/ElamurAI/mova-free/tree/main/onto/src/hsmap.rs.groupant/selection.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 | [approximant](#approximant) |
| **ast** | partial | `../syntax.json` |
| **composition** | partial | [composition](#composition) |
| **cost** | partial | [cost](#cost) |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [invariant](#invariant) |
| **tests** | executed bounded checks | [tests](#tests) |

## 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 |
|---|---|---|---|
| `behavior_complement` | behavior_complement | partial source derived model | [behavior_complement](#behavior-complement) |
| `reverse_reconstruction` | reverse_reconstruction | partial source derived model | [reverse_reconstruction](#reverse-reconstruction) |
| `phrase_order` | phrase_order | partial source derived model | [phrase_order](#phrase-order) |
| `state_priority` | state_priority | partial source derived model | [state_priority](#state-priority) |
| `singleton_margin` | singleton_margin | partial source derived model | [singleton_margin](#singleton-margin) |
| `candidate_domain` | candidate_domain | partial source derived model | [candidate_domain](#candidate-domain) |

## Model text


### descriptant

#### onto-hsmap-selection

score(c)=WSD(c)+1[preferred]+chapter_share(lf(c)); best replaces only >old+1e-9

##### Epoch 2026-10-31

Specialized source fragment bytes [3692,7964); shared parent AST. Excludes unrelated parent operations and added test module.

### approximant

#### Scoped forward

score(c)=WSD(c)+1[preferred]+chapter_share(lf(c)); best replaces only >old+1e-9

##### Domain

This byte-scoped operator uses the parent valid-state domain plus the following local restrictions:

Longest matching preference-fit phrase wins

Live before food in prefer/ckey

One sense→9.99 sentinel, not measured separation

Nonempty scored and valid Cid/lexfile required

No executable percentage surrogate established.

### invariant

#### Local observations

Improvement<=1e-9 excludes replacement; negative state excludes bonus

Longest matching preference-fit phrase wins

Live before food in prefer/ckey

One sense→9.99 sentinel, not measured separation

Nonempty scored and valid Cid/lexfile required

### cost

#### Scoped cost

O(S) score scan per candidate list plus phrase lookup/WSD work.

Restriction to this operator's traversed inputs; parent total is not charged to every fragment. No standalone measurement.

### composition

#### Parent join

selection supplies the parent relation: score(c)=WSD(c)+1[preferred]+chapter_share(lf(c)); best replaces only >old+1e-9

Output compatibility is conditional on the local domain and earlier-branch exclusions. Other parent branches are outside this fragment.

### models

### behavior_complement

Improvement<=1e-9 excludes replacement; negative state excludes bonus

### reverse_reconstruction

Score vector preimage constrained by sequential threshold and reported margin; common shifts preserve winner

### phrase_order

Longest matching preference-fit phrase wins

### state_priority

Live before food in prefer/ckey

### singleton_margin

One sense→9.99 sentinel, not measured separation

### candidate_domain

Nonempty scored and valid Cid/lexfile required


### tests

#### Evidence

Parent tests.md identifies selected actual-code checks. Fragment is a source-scoped partial model; parent finite fixtures do not establish exhaustive branch coverage or every local equation.