Reversing the cut tree of the Brownian continuum random tree

Consider the Aldous–Pitman fragmentation process of a Brownian continuum random tree T^{br}. The associated cut tree cut(T^{br}), introduced by Bertoin and Miermont, is defined in a measurable way from the fragmentation process, describing the genealogy of the fragmentation, and is itself distributed as a Brownian CRT. In this work, we introduce a shuffle transform, which can be considered as the reverse of the map taking T br to cut(T^{br}).