  We study limits of the largest connected components (viewed as metric spaces)
obtained by critical percolation on uniformly chosen graphs and configuration
models with heavy-tailed degrees. For rank-one inhomogeneous random graphs,
such results were derived by Bhamidi, van der Hofstad, Sen [Probab. Theory
Relat. Fields 2018]. We develop general principles under which the identical
scaling limits as the rank-one case can be obtained. Of independent interest,
we derive refined asymptotics for various susceptibility functions and the
maximal diameter in the barely subcritical regime.
