Given a positive integer $n$, an unlabeled graph $G$ on $n$ vertices, and a vertex $v$ of $G$, let $N_G(v)$ be the subgraph of $G$ induced by vertices of $G$ of distance at most one from $v$. We show that there are universal constants $C,c>0$ with the following property. Let the sequence $(p_n)_{n=1}^\infty$ satisfy $n^{-1/2}\log^C n\leq p_n\leq c$. For each $n$, let $Γ_n$ be an unlabeled $G(n,p_n)$ Erdös-Rényi graph. Then with probability $1-o_n(1)$, any unlabeled graph $\tilde Γ_n$ on $n$ vertices with $\{N_{\tilde Γ_n}(v)\}_{v}=\{N_{Γ_n}(v)\}_{v}$ must coincide with $Γ_n$. This establishes $\tilde Θ(n^{-1/2})$ as the transition range for the density parameter $p_n$ between reconstructability and non-reconstructability of Erdös-Rényi graphs from their $1$-neighborhoods, and resolves a problem of Gaudio and Mossel.