{'fraction_non_alphanumeric': 0.021883920076117985, 'fraction_numerical': 0.0, 'mean_word_length': 5.188235294117647, '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 Limits of Distributed Agreement between Correlated Sources

The work of Witsenhausen explores conditions under which two non-interactive users observing different coordinates of an i.i.d random process, can reach asymptotic agreement. Witsenhausen considers two scenarios: one in which both users observe a finite sequence with an error probability in the limit, and the second in which both users observe infinite-length sequences. In both cases, it turns out that perfect agreement is possible if and only if the joint distribution has a special decomposable structure known as a Gács-Körner common part. This paper revisits Witsenhausen's work and makes two contributions. First, we show that both results are equivalent, that each implies the other. Second, we offer a new proof of the second result, that unlike the others, avoids any tensorizing arguments or manipulations of multi-letter information measures. We explain how this new converse might overcome some of the obstacles commonly encountered in the classical converse arguments.