{'fraction_non_alphanumeric': 0.02148997134670487, 'fraction_numerical': 0.0, 'mean_word_length': 4.5476190476190474, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
ON THE CLASSIFICATION OF NONSIMPLE GRAPH

We prove that a graph C-algebra with exactly one proper nontrivial ideal is classified up to stable isomorphism by its associated six-term exact sequence in K-theory. We prove that a similar classification also holds for a graph C-algebra with a largest proper ideal that is an AF-algebra. Our results are based on a general method developed by the first named author with Restorff and Ruiz. As a key step in the argument, we show how to produce stability for certain full hereditary subalgebras associated to such graph C-algebras. We further prove that, except under trivial circumstances, a unique proper nontrivial ideal in a graph C-algebra is stable.