when `is_training=False`
        *   (since v2.7) `tf.image.adjust_contrast` forward
        *   (since v2.7) `tf.image.resize` with `method=ResizeMethod.NEAREST`
            backprop
        *   (since v2.7) `tf.linalg.svd`
        *   (since v2.7) `tf.math.bincount`
        *   (since v2.7) `tf.nn.depthwise_conv2d` backprop to `filter` when not

- Kubeadm: upgrade supports fallback to the nearest known etcd version if an unknown k8s version is passed ([#88373](https://github.com/kubernetes/kubernetes/pull/88373), [@SataQiu](https://github.com/SataQiu)) [SIG Cluster Lifecycle]

uint32(c) * uint32(d) return fieldReduce(x) } // compress maps a field element uniformly to the range 0 to 2ᵈ-1, according to // FIPS 203, Definition 4.7. func compress(x fieldElement, d uint8) uint16 { // We want to compute (x * 2ᵈ) / q, rounded to nearest integer, with 1/2 // rounding up (see FIPS 203, Section 2.3). // Barrett reduction produces a quotient and a remainder in the range [0, 2q), // such that dividend = quotient * q + remainder. dividend := uint32(x) << d // x * 2ᵈ quotient := uint32(uint64(dividend)...

uint32(c) * uint32(d) return fieldReduce(x) } // compress maps a field element uniformly to the range 0 to 2ᵈ-1, according to // FIPS 203, Definition 4.7. func compress(x fieldElement, d uint8) uint16 { // We want to compute (x * 2ᵈ) / q, rounded to nearest integer, with 1/2 // rounding up (see FIPS 203, Section 2.3). // Barrett reduction produces a quotient and a remainder in the range [0, 2q), // such that dividend = quotient * q + remainder. dividend := uint32(x) << d // x * 2ᵈ quotient := uint32(uint64(dividend)...