Two peers edit the SAME node at the SAME time — one moves it (drag it, or ⤢ Move node, in peer A), the other renames it (✎ Rename, in peer B) — offline from each other. Their status chips disagree. Hit ⇄ Exchange and both converge with both edits intact. A whole-entity last-writer-wins would keep one and silently throw the other away; a per-property CRDT keeps both because position and label are different registers.