{'fraction_non_alphanumeric': 0.018276762402088774, 'fraction_numerical': 0.0, 'mean_word_length': 4.907692307692308, '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}}
RESIN, A Desktop-Computer Program for Finding Cut-Sets

This paper describes an efficient algorithm for finding the minimal cut-sets for the output nodes of any network. The advantages over previously published algorithms are that it can be used on a desktop computer, and it requires simpler input data preparation hence providing for rapid testing of the effect of network changes.