E.18.3:4.2a - Admit network-aware demonstration mappings

A network-aware demonstrative slice is post-admission only. First select and verify one E.18.NET-conforming network. Then recover the one selected A.22.CGUS, its E.18.3 transformation-position mapping rows, and every required relation-reference episteme. Only then may the E.18.3 slice add its network demonstration mapping rows; those rows supply no missing member, position, relation, constraint, or admission.

For each selectedNetworkPositionMappingRows[] entry, resolve the finite member path to its leaf TFS. A FlowPositionRef names that TFS; an ExposedFlowPositionRef also repeats this network and the complete path. includedLocusBindingRef must be the same CGUSLocusBinding already present in the E.18.3 mapping and the slice’s includedLocusBindingRefs[]. The network ref maps that binding to a flow position; it creates no copied position or constituent binding.

For each selectedCrossFlowRelationReferenceRows[] entry, require its NetworkCrossFlowRelationRowRef to name a current record edition whose EntityOfConcern is this slice’s selected network, then resolve exactly one row by occurrence and complete ordered endpoint-binding identity. Pair that row with one relation-reference episteme already cited by this E.18.3-qualified structure and with its matching networkEndpointBindingSets[] entry. Verify occurrence, kind, predicate-definition source, optional signature, participant order, endpoint members, flow positions and bindings by value. If the record describes another network, zero or several rows resolve, any field differs, or the relation reference is not already current, omit the mapping and name the exact missing or ambiguous network, row, position, occurrence, predicate definition or binding.

The complete top-level one-TFS locator is absent from a network slice. FlowValuation, PathSliceId and DesignRunTag remain member- or leaf-local; Work, actual transformations, boundaries and currentness also remain with their exact member and applicable definitions or tests. Member paths are finite and membership is acyclic, while exact cross-flow feedback occurrences may cycle when their predicates and constraints admit them.

Every selected cross-flow relation remains the exact occurrence whose predicate-definition source fixes its kind and participant meanings and whose applicability conditions and current facts show that it obtains. Do not substitute universal creates, produces, uses, input, output, result, handoff or transfer edges. One C.32.CONWAY result may contribute one exact architecture-influence and transformed-architecture correspondence row after its direct occurrence and endpoint bindings are recovered; it never constitutes the network.

A source phrase or graph enters only through an exact source-to-use claim or relation. A separately identified BoundedModelUseStructure participates only when the current assertion or use selects it and its organization changes interpretation of that claim; shared wording, adjacency, or a crossing display is evidence of neither model-use qualification nor crossing.

Positive case. A four-level build-the-builder demonstration follows one finite member path to an established leaf position, maps it to the same included CGUS locus binding, cites an admitted cross-flow relation-reference episteme, and keeps path slice and tag in one leaf-local row. Near miss. A graph supplies raw positions or an edge label, mixes locator families, duplicates bindings, assigns one tag to the network, or cites a row without endpoint bindings; keep that demonstration provisional or return the missing member, relation, position, or binding.