{'fraction_non_alphanumeric': 0.02564102564102564, 'fraction_numerical': 0.0, 'mean_word_length': 5.248, '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}}
A theory of information network analyzer PPN

This paper proposed an information network analyzer PPN (Parallel Processing Network) which is composed of the same processing capabilities as that of the object network, and presented properties of a PPN with node-potential or the minimum number of edges from the base-node. Algorithms of node-potential decision and modification (NPD/NPM) for any system change (extension or reduction) of an information network are presented. As an application of node-potential, a rooted-tree finding algorithm is introduced, that gives a protocol for the multicast routing in an information network. Utilizing the solutions of these fundamental and experimental results, it is shown that PPN can provide useful means for various network analyses.