{'fraction_non_alphanumeric': 0.031024531024531024, 'fraction_numerical': 0.006493506493506494, 'mean_word_length': 4.638211382113822, '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}}
Short Paths on the Voronoi Graph and Closest Vector Problem with Preprocessing

Improving on the Voronoi cell based techniques of [28, 24], we give a Las Vegas O(2n) expected time and space algorithm for CVPP (the preprocessing version of the Closest Vector Problem, CVP). This improves on the O(4n) deterministic runtime of the Micciancio Voulgaris algorithm [24] (henceforth MV) for CVPP at the cost of a polynomial amount of randomness (which only affects runtime, not correctness). 
 
As in MV, our algorithm proceeds by computing a short path on the Voronoi graph of the lattice, where lattice points are adjacent if their Voronoi cells share a common facet, from the origin to a closest lattice vector. Our main technical contribution is a randomized procedure that, given the Voronoi relevant vectors of a lattice -- the lattice vectors inducing facets of the Voronoi cell -- as preprocessing, and any "close enough" lattice point to the target, computes a path to a closest lattice vector of expected polynomial size. This improves on the O(2n) path length given by the MV algorithm. Furthermore, as in MV, each edge of the path can be computed using a single iteration over the Voronoi relevant vectors. 
 
As a byproduct of our work, we also give an optimal relationship between geometric and path distance on the Voronoi graph, which we believe to be of independent interest.