{'fraction_non_alphanumeric': 0.024216524216524215, 'fraction_numerical': 0.0, 'mean_word_length': 4.9576271186440675, '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}}
Location constrained jamming: Surgical link removal using local graph partitioning

Knowing the topology of an adversarial network, heuristics exist based on spectral graph theory for calculating which edges, when removed, will partition the network. Knowing these weak links in the network under attack, a surgical jammer may be used to conduct man-in-the-middle attacks or to maximally affect the adversary network's connectivity. However, it is not always possible to control where the jammer is located with respect to the network. This paper describes a method to find a graph partition when, due to limited jammer range, we cannot affect all the links in the network, but the links are all known.