2 problems

Weak 3-weighting conjecture. For each $r\geq 3$, every $r$-uniform hypergraph without isolated edges is weakly 3-weighted.

Strong weighting conjecture. For every $r\geq 3$, there is a constant $w=w(r)$ such that each nice $r$-uniform hypergraph is strongly $w$-weighted.