{'fraction_non_alphanumeric': 0.029893924783027964, 'fraction_numerical': 0.0, 'mean_word_length': 6.061224489795919, '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}}
NWHy: A Framework for Hypergraph Analytics: Representations, Data structures, and Algorithms

This paper presents NWHypergraph, (NWHy), a parallel high-performance C++ framework for both exact and approximate hypergraph analytics. NWHy provides data structures for various representations of hypergraphs and their associated graph projections (lower order approximations), including a new technique for hypergraph representation called adjoin graphs. We present a set of hypergraph algorithms for exact and approximate hypergraph analytics implemented in NWHy and demonstrate scalability and performance, operating on a variety of hypergraph representations, that is competitive with the state of the art. In addition, we propose two new queue-based algorithms for s-line graph construction, a lower-order approximation of hypergraphs, to demonstrate the effectiveness and versatility of work queue-based algorithm design. Our queue-based algorithms demonstrate similar performance to the non-queue-based algorithms for bipartite graphs.