# Argument selection Quantity: the power-only finite part F_(n,j) of the balanced unit-scale order-zero Bessel product, with its compactly supported period convention G_(n,j). Parameter order is n, j, normalization. The two conventions determine one another by a nonzero elementary factor and share the same domains and computational range. - n (Z, discrete_index): total factor count n=4m, m>=1. Chuang–Yu, Lemma 21 separates this logarithm-free branch from n=4r+2. The integer symmetric-power index supplies a natural family, without a continuous scale or coupling. Initial m=1,2,3,4 is a practical, noncanonical cutoff: four successive symmetric powers, two through eight balanced pairs, with the complete divergent basis slice at each size. It is not a famous-values restriction. - j (Z, discrete_index): half the integration power, j>=m. For each selected m enumerate all m<=j<=2m-1, exactly the divergent balanced positions of Proposition 25 (k'=floor((n-1)/2)). The ten underlying finite parts include polynomial counterterms through degree seven. Larger j beyond this basis slice are mathematically defined but not claimed complete. - normalization (Symbolic, documented_application): bessel gives the finite part of Lemma 21; period gives the actual compactly supported pairing of Proposition 25. Retain the sign (-1)^m and multiply by 2^(n-2j)*pi^(2m). Both keys appear for every (n,j), bessel then period. These are cheap invertible conventions of one scalar, not different quantities. No continuous parameter, exploratory grid, quantile, logarithmic insertion, arbitrary scale or odd power is selected. Coverage is complete: no, with the exact triangular range and both normalization keys. Source equations (10), (12), Lemma 21, Proposition 25, Corollary 28 are checked against the archived primary-source HTML, not a sibling table. Higher n may extend this same family later; the cutoff does not enter parameter constraints. Archived skill manifest: ../20261117T154138Z-build-skills/manifest.json; matching bundle SHA-256 889383d95f882353fc09d210af003abe6edcf0331f27c377d7acdabafa344208. Measured cost: the full certified ten-finite-part computation took about 724 seconds on this builder; individual n=16 finite parts took about 138–160 seconds. This supports treating n<=16 as a practical first extent while retaining every source-selected divergent basis position at each included factor count. It is not a claimed mathematical upper bound.