1 problem

A witness tree is built from bad-event labels, with children of a node labeled $B$ required to have distinct labels $B_1,\dots,B_s$ whose set is orderable to $B$. For a tree-struct…