Harary and Lauri's class reconstruction conjecture for trees

Let $T$ be a finite tree, and let $\operatorname{crn}(T)$ denote its class reconstruction number. For the class of trees, write $\operatorname{crn}(\mathcal{T})=\max_T\{\operatorname{crn}(T)\}$, where $\mathcal{T}$ is the class of finite trees. Harary and Lauri's conjecture. The class reconstruction number of the class of trees is 2:

$$\operatorname{crn}(\mathcal{T})=2.$$

Harary and Lauri had shown that the class reconstruction number is at most 3; the conjecture asserts that the upper bound can be improved to 2. The supplied text gives no evidence that this conjecture has been resolved.