For spin systems on a tree, the reconstruction problem is to determine whether correlations persist between vertices deep inside the tree and the root. The problem has been studied in probability, statistical physics, information theory, computational biology and computer science.

I will talk about results establishing the threshold for reconstruction and give an overview of the connection of the problem to reconstruction and constraint satisfaction in sparse random graphs.