The conjecture for the number of left braces of order $4p$

Let $b(n)$ denote the number of non-isomorphic left braces of size $n$. Let $p>3$ be a prime. The order-$4p$ counting conjecture.

$$b(4p)=\begin{cases} 11 & \text{if } m\equiv1\bmod4,\\ 9 & \text{if } m\equiv3\bmod4. \end{cases}$$

The statement is presented as a conjecture suggested by the computed table of values. The variable $m$ in the congruence conditions is not defined in the supplied context, so the formulation requires checking against the source.