Sharp Low-Degree Thresholds for Planted-vs-Planted Testing

In three linesFirst sharp thresholds for low-degree polynomial tests in planted-vs-planted settings. Matching upper and lower bounds for community counting in planted submatrix and planted dense subgraph models. Testing threshold coincides with known low-degree recovery threshold down to sharp constant.

Summary generated by Claude — human-verified