The n-solvable filtration of the link concordance group, defined by Cochran, Orr, and Teichner in 2003, is a tool for studying smooth knot and link concordance that yields important results in low-dimensional topology. We focus on the first two stages of the n-solvable filtration, which are the class of 0-solvable links and the class of 0.5-solvable ...