A. Numerical search SMARTS searching on Q 0 occurs at the primitive level using compositions of single bits over all primitives in the graphs. Let the manipulation bi represent an automorphic graph of Q 0 where only bit i is set across all nodes and edges such that bi = 1, where • is the population count over the nodes and edges in the graph. We construct a split b as