Before revision:  This implies that the general center problem for persistence diagrams  , when P_i's possibly have different sizes, is also NP-hard when m\geq 3.
After revision:  This implies that the general center problem for persistence diagrams under the bottleneck distance , when P_i's possibly have different sizes, is also NP-hard when m\geq 3.