{'fraction_non_alphanumeric': 0.042483660130718956, 'fraction_numerical': 0.0, 'mean_word_length': 3.2054794520547945, '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}}
On Random Hard Sets for NP

The problem of whether NP has a random hard set (i.e., a set in RAND) is investigated. We show that for all recursive oracle A such that PA ≠ NPA, NPA has no hard set in RAND. On the other hand, we also show that for almost all oracle A, PA ≠ NPA and NPA has a hard set in RAND.