Complex realization numbers of minimally rigid graph in higher dimensions

This is a complete data set of the complex realization numbers of all minimally d-rigid graphs with minimum degree d+1 and certain number of vertices, both for space and sphere.Each file contains a list of pairs with the first entry to be the graph in integer representation and the second entry the realization number. Values have been computed by a Gröbner basis approach with random edge lengths. Though, all values have been double checked, there is a slight chance of errors caused by the randomness (non-genericity). Files can be loaded into python with the function in get.py. Integer representations of graphs can be converted for instance in PyRigi (doi:10.5281/zenodo.15537828).