Title: On the uniqueness of network identification of Boolean networks

Abstract: Finding conditions on input data that guarantee a wiring diagram has been an open problem since the introduction of algebraic geometry techniques to Boolean network analysis. In this talk, we characterize the data sets that identify a wiring diagram before conducting experiments. We show that the geometric features of the discrete data on an n-dimensional hypercube completely determine if network inference is guaranteed to be unique. This approach also provides a heuristic to minimize the number of candidate wiring diagrams, offering concrete criteria for experiment design.