No AI summary available for this article.
Why It Matters
Evaluations of graph reconstruction by language models typically report a single aggregate distance between the original and the reconstructed graph.
Provenance
Discovered via ArXiv and published by ArXiv.
Key Claims
Original description
Evaluations of graph reconstruction by language models typically report a single aggregate distance between the original and the reconstructed graph. We prove that for the Wasserstein distance between Laplacian spectra such a summary is bracketed by two edge counts, the net change in edge number from below and the symmetric difference from above, each scaled by $2/n$ where $n$ is the number of vertices. The bracket is sharp: its two ends coincide exactly when the reconstruction only adds edges or only deletes them, and on that class the distance is a rescaled edge count that says nothing about...
Discovered via ArXiv
Research papers and preprints from arXiv.
Publisher: arxiv.org
ID: http://arxiv.org/abs/2609.38161v1 · Indexed about 1 hour ago