state_init ∈ {0, 1}N	Initial Boolean state (N dimensional vector of 0’s and 1’s, where N is the number of TFs)
f: {0, 1}N ↦ [0, 1]N	Probabilistic update rules mapping the current state ∈ {0, 1}N to a probability (value between 0 and 1) for each TF to flip (ON to OFF, or OFF to ON)
$d:{\{0,1\}}^N\times {\{0,1\}}^N\mapsto \mathbb{R}$	Function to calculate distance between two states (we use the Hamming distance)
R	Maximum radius to search from state_init
PT	Threshold probability used to define pseudo-attractors (we used PT = 0.5 so that pseudo-attractors are defined to have out-transitions with probability less than 50%.)