Complete lists of elliptic curves defined over $\Q$ for a given conductor $N$ were computed by John Cremona using the modular symbols method described in [Cremon97, MR:1628193] , as implemented in his eclib package [10.5281/zenodo.29671] . The additional data for each curve and isogeny class was also computed by John Cremona using eclib or Sage unless otherwise specified.
Isogeny classes were computed using with eclib or Sage, which uses methods of Cremona, Tsukazaki and Watkins to compute isogenies of prime degree. The ranks and generators were mostly computed using mwrank (part of eclib), with larger generators of rank 1 curves computed using either Pari/GP's ellheegner function (implemented by Bill Allombert using his enhancements of the algorithm developed by John Cremona, Christophe Delaunay and Mark Watkins) or Magma's HeegnerPoint function (implemented by Steve Donelly and Mark Watkins, based on the same method). Integral points were computed using the Sage implementation of the method based on bounds on elliptic logarithms and LLL-reduction, implemented by John Cremona with Michael Mardaus and Tobias Nagell. Modular degrees were computed using Mark Watkins's sympow library via Sage. Special values of the L-function were computed by Pari/GP via Sage. Information on mod-$l$ Galois representations was computed by Andrew Sutherland using the method of [10.1017/fms.2015.33, arXiv:1504.07618] . Information on 2-adic Galois Representations was computed using Jeremy Rouses's Magma implementation of the algorithm of Rouse and Zureick-Brown [10.1007/s40993-015-0013-7, arXiv:1402.5997] . The graphs of the real locus were computed using David Roe's function implemented in Sage.