Brimkov's propagation time interval conjecture for hypercubes

Let $Q_d$ be the $d$-dimensional hypercube graph, and let $\operatorname{pt}(G)$ and $\operatorname{PT}(G)$ denote the minimum and maximum propagation times over minimum zero forcing sets of a graph $G$. The graph $G$ has a full propagation time interval when every integer in $[\operatorname{pt}(G),\operatorname{PT}(G)]$ is realized by some minimum zero forcing set.

Brimkov's conjecture. For every integer $d\geq 2$,

$$\operatorname{pt}(Q_d)=1\quad\text{and}\quad \operatorname{PT}(Q_d)=2^{d-2}.$$

Moreover, $Q_d$ has a full propagation time interval.

Only a few graph families are known to have full propagation time intervals, so the conjecture predicts both extremal propagation times and the realization of every intermediate time for hypercubes.