1 problem

Non-classification conjecture. The analogue of the doodle-concordance correspondence for $k=1$ is false for every $r\geq 4$.