Before revision:  For simple graphs, we demonstrate that learning algorithms defined onLE s tie with their performance on the original graphs, implying that no loss of information occurs in the expansion .
After revision:  LE s tie with their performance on the original graphs, implying that no loss of information occurs in the expansion .