{'fraction_non_alphanumeric': 0.02372479240806643, 'fraction_numerical': 0.0, 'mean_word_length': 5.298507462686567, '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}}
Theory of Multi-Path Maxmin Rate Allocation

This paper provides a foundation theory for maxim in rate allocation over a communications network. This paper is the first one to provide a comprehensive multi-path and multi-level (due to line lexicographic multi-objective nature) optimization theory. The multi-path maxmin problem is orders of magnitude harder than the single-path problem. The main problem is the non-uniqueness of lower level solutions; since higher level solutions depend on lower level solutions, the non-uniqueness makes the problem highly complex. This paper also introduces the concepts of over-provisioned links and efficient paths and their inter-relationship with bottlenecks. The results of this paper also show the usefulness of linear programming duality theory in multi-objective lexicographic optimization problem