Reversing the cut tree of the Brownian continuum random tree
  Consider the Aldous--Pitman fragmentation process [Ann Probab, 26(4):1703--1726, 1998] of a Brownian continuum random tree ${\cal T}^{\mathrm{br}}$. The associated cut tree cut$({\cal T}^{\mathrm{br}})$, introduced by Bertoin and Miermont [Ann Appl Probab, 23:1469--1493, 2013], 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 ${\cal T}^{\mathrm{br}}$ to cut$({\cal T}^{\mathrm{br}})$. 
Nicolas Broutin and Minmin Wang
math.PR