Generic bipartite reconstruction by low-order type constraints

Let $G=(U,V,E)$ be a bipartite graph with $|U|=u$ and $|V|=v$, and let $\mathcal{D}(G)$ denote its vertex-deletion deck. Assume that $G$ is 2-connected, not regular, and has minimum degree at least $6$. For each vertex define its type by $\tau=(\deg,P)$, where $P$ is its neighbor-degree profile, and let $R(\cdot,\cdot)$ denote the resulting type-count constraints. Generic bipartite reconstruction conjecture. For generic such $G$, the deck determines $G$ uniquely up to bipartite isomorphism, and $G$ can be reconstructed in polynomial time by recovering degrees and profiles, imposing the type-count constraints, and selecting the unique feasible adjacency using two-deletion compatibility. This is an experimentally motivated claim restricted to a generic, moderately dense regime; neither the genericity condition nor the asserted polynomial-time reconstruction is established in the supplied text.