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