The merge sequence records the ordered tokens created by repeated pair counting. Each round displays its source segmentation, chosen pair, and resulting segmentation so the counts remain inspectable.
highlighted = computed this step
The merge sequence
The sequence diagram shows the source corpus for each round, the pair counts, the chosen merge, and the resulting segmentation. That makes each count derivable from visible rows. The diagram is deliberately self-contained: round state in, integer counts out, one merge chosen.
corpus→counts→merge→new corpus
Two deterministic rounds
Round 1 merges (u,g) with count 5. Round 2 merges (h,ug) with count 3. The second round depends on the segmentation produced by the first, so the order matters.
r1:(u,g),r2:(h,ug)
Summary
BPE's state is the current segmentation plus the ordered merge list. No probabilities or decimals are needed for this toy run; exact integer counts and a deterministic argmax fully specify the mechanics.