{'fraction_non_alphanumeric': 0.018556701030927835, 'fraction_numerical': 0.012371134020618556, 'mean_word_length': 5.942857142857143, '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}}
Strengthening Topological Conditions for Relabeling Algorithms in Evolving Graphs

We use the framework of relabeling algorithms over evolving graphs by Casteigts, Chaumette and Ferreira in 2012 to ground our contributions to the domain of distributed algorithms, which are twofold: (1) we provide a sufficient condition for the decentralized counting algorithm proposed by Casteigts in its PhD dissertation, (2) we define a tightness criterion for sufficient and necessary conditions.