Paley-type matrices and $1$-factorizations of complete graphs

Ball, Ortega–Moreno, and Prodromou asked whether, for every odd prime $p$, one can find a $1$-factor of the complete graph $K_{p+1}$ with some arithmetic restrictions related to quadratic residues. This problem is motivated by $1$-factorizations that are compatible with the sign pattern of certain Paley-type matrices. Recently, Afifurrahman et al. made some partial progress. In this paper, we completely resolve the problem.