The mixed Nine Dragon Tree conjecture for spanning mixed arborescences

Let $H=(V,E,A)$ be a mixed graph, let $\mathcal{D}(V)$ denote the relevant family of subpartitions, and let $d_A^-(X)$ count arcs entering $X$. Let $k\geq0$ and $d\geq1$ be integers. Mixed Nine Dragon Tree conjecture. If, for every $\mathcal{P}\in\mathcal{D}(V)$,

$$\frac{E(\mathcal{P})+\sum_{X\in\mathcal{P}}d_A^-(X)}{|\mathcal{P}|-1}>k+\frac{d-1}{d},$$

then $H$ contains edge- and arc-disjoint $k$ spanning mixed arborescences and another mixed branching $F$ satisfying

$$|E(F)|+|A(F)|>\frac{d-1}{d}(|V|-1).$$

If $F$ is not a spanning arborescence, then $F$ has a component with at least $d$ edges and arcs. Moreover, the bound is sharp. This would extend the spanning-arborescence packing results from graphs and digraphs to mixed graphs; no resolution is supplied in the text.