The hypergraph 1-2-3 Conjecture

Let $H$ be a hypergraph whose edges have orders between $2$ and $r$, with no edge consisting of twins. A weighting $\omega:E(H)\to\{1,2,\ldots,r+1\}$ induces vertex weights

$$\omega(v):=\sum_{e\ni v}\omega(e).$$

Hypergraph 1-2-3 Conjecture. There is such a weighting for which the induced vertex weights properly color $V(H)$.

The conjecture proposes that the bound proved for linear hypergraphs extends to all hypergraphs under the stated exclusion of edges consisting of twins. The source gives no resolution status.