{'fraction_non_alphanumeric': 0.025602409638554216, 'fraction_numerical': 0.004518072289156626, 'mean_word_length': 4.683760683760684, '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 Novel Dynamic Graph Software Watermark Scheme

A novel two-dimensional IPPCT (2D_IPPCT) and a multi-dimensional IPPCT (MD_IPPCT) are presented in this paper. 2D_IPPCT structure has greater data rate. It is proved that under the circumstances of the same number of leaf nodes, the data rate of MD_IPPCT will increase to a limit with dimension number n increasing and this limit is also computed. Moreover, we prove that there exists a two dimensional area, when the data rate is in this area, the DGW system will have a higher overall performance. In a word, 2D_IPPCT structure not only inherits the stability of PPCT structure, but also has higher encoding rate.