{'fraction_non_alphanumeric': 0.015283842794759825, 'fraction_numerical': 0.004366812227074236, 'mean_word_length': 4.215909090909091, '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}}
Sacks of Dice with Fair Totals

Abstract A fair sack is a finite set of independent dice, not required to be fair and allowed to have any number of sides, for which all totals are equally likely. These have been studied for over 60 years. Most results restrict the possible orders of dice in such a sack and almost no examples were known. Building on a rather different approach due to Gasarch and Kruskal, we give a canonical construction of all such sacks.