{'fraction_non_alphanumeric': 0.016483516483516484, 'fraction_numerical': 0.0, 'mean_word_length': 5.339130434782609, '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}}
Statistical mechanics of data compression theorem

We analyze the performance of a linear code used for data compression of a Slepian-Wolf type. In our framework, two correlated data are separately compressed into codewords employing Gallager-type codes and cast into a communication network through two independent input terminals. At the output terminal, the received codewords are jointly decoded by a practical algorithm based on the Thouless-Anderson-Palmer approach. Our analysis shows that the achievable rate region presented in the data compression theorem is described as first-order phase transitions among several phases. The typical performance of the practical decoder is also well evaluated by the replica method.