| Affine--centered NNS workload | statement | lemma 23 | arxiv |
| Transfer of an entire execution | statement | lemma 13 | arxiv |
| Smoothing and shifted mass | statement | lemma 8 | arxiv |
| Complete catalogue and exact SVP | statement | theorem 0.7 | arxiv |
| Exact SVP | statement | corollary 1 | arxiv |
| Bounds on counts in the center list | statement | lemma 14 | arxiv |
| Shell populations | statement | lemma 2 | arxiv |
| Complete affine catalogue in the terminal lists | statement | lemma 22 | arxiv |
| Random-target CVP | statement | corollary 2 | arxiv |
| Output distribution and acceptance probability | statement | lemma 27 | arxiv |
| Affine minimum | statement | lemma 5 | arxiv |
| Affine initialization at the common radius | statement | lemma 21 | arxiv |
| Transference | statement | lemma 6 | arxiv |
| Bounds on the expected filtering cost | statement | lemma 18 | arxiv |
| Uniformity and independence with exhaustive pair search | statement | theorem 0.5 | arxiv |
| Finding all eligible pairs efficiently | statement | theorem 0.6 | arxiv |
| Weighted shell errors and the joint batch law | statement | lemma 28 | arxiv |
| Efficient initialization and ideal iid coupling | statement | theorem 0.3 | arxiv |
| Constant acceptance probability | statement | lemma 15 | arxiv |
| Exact critical short-vector catalogue | statement | proposition 1 | arxiv |
| Uniformity and independence in the affine case | statement | corollary 5 | arxiv |
| Aligned iid outer-shell lists | statement | lemma 24 | arxiv |
| Rejection sampling from independent group streams | statement | lemma 26 | arxiv |
| Adaptive reuse of preprocessing | statement | corollary 6 | arxiv |
| Constructive Seysen reduction | statement | lemma 7 | arxiv |
| Uniformity and independence of the output list | statement | theorem 0.4 | arxiv |
| Ideal iid affine branch and GPV coupling | statement | theorem 0.8 | arxiv |
| One nearly uniform sample from the initial shell | statement | lemma 12 | arxiv |
| Specialized GFH search procedure | statement | lemma 19 | arxiv |
| Bounding the search cost for dependent queries | statement | lemma 20 | arxiv |
| Complete catalogue and exact SVP | statement | corollary 3 | arxiv |
| One-dimensional tails and recursive DGS | statement | lemma 9 | arxiv |
| Siegel mean-value theorem | statement | lemma 1 | arxiv |
| Preprocessing basis quality | statement | lemma 10 | arxiv |
| High-parameter discrete Gaussian sampling | statement | lemma 11 | arxiv |
| Small parameters and the uniform upper tail | statement | lemma 25 | arxiv |
| Typical shortest-vector scale | statement | lemma 16 | arxiv |
| Critical-ball difference coverage | statement | lemma 4 | arxiv |
| Joint batch DGS at every width | statement | theorem 0.2 | arxiv |
| Complete-shell count bounds | statement | lemma 3 | arxiv |
| Exhaustive-search fallback | statement | corollary 4 | arxiv |
| Complete coverage by the terminal lists | statement | lemma 17 | arxiv |
| Complete centered and affine catalogues | statement | theorem 0.1 | arxiv |
