Researchers at Apple demonstrate that UMAP's internal k-nearest-neighbor graph contains more accurate manifold data than its final 2D projection. By applying PageRank and k-core decomposition to this graph, they identify representative points and dense clusters. This approach lets practitioners extract structural insights from high-dimensional data without the distortion typical of dimensionality reduction.