{'fraction_non_alphanumeric': 0.018259935553168637, 'fraction_numerical': 0.0, 'mean_word_length': 5.609929078014185, '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}}
Generic Reliability Trust Model

Economic and social activity is increasingly reflected in operations on digital objects and network-mediated interactions between digital entities. Trust is a prerequisite for many of these interactions, particularly if items of value are to be exchanged. In this paper the probabilistic model and computational approaches found in some network reliability models are applied to modelling computational trust. The result is a new generalized trust model called the Generic Reliability Trust Model or GRTM and a new transitive trust metric called Hop-Count Limited Transitive Trust (HLTT). A conservative approximation heuristic is defined which leads to more practical algorithm performance. Results from a JAVA-based implementation, utilizing an XMLbased trust-graph representation and a random power-law trust graph generator, demonstrate potential for application to large ad-hoc trust networks.