STRank: A Multi-Domain Robustness Metric

• STRank is a robust metric that measures effective dimensionality in transformers by comparing the Frobenius norm to the dominant spectral norm.
• In spatial transcriptomics, STRank leverages relative expression orderings through pairwise and listwise losses to mitigate noise and batch effects.
• For Steiner triple systems, STRank studies the incidence matrix rank over finite fields, aiding in the enumeration and classification of combinatorial designs.

Searching arXiv for papers using the term “STRank” and closely related references. STRank is a context-dependent research term that denotes at least three distinct technical constructs in recent arXiv literature: a stable-rank signal on transformer hidden states for LLM alignment, a count-aware learning-to-rank loss for spatial transcriptomics, and rank-based enumeration machinery for Steiner triple systems (Tang et al., 2 Dec 2025, Nishimura et al., 7 Dec 2025, Jungnickel et al., 2017). In all three settings, the shared lexical core is “rank,” but the underlying objects differ sharply: effective dimensionality of neural representations, relative expression orderings across tissue spots, and $p$-rank of incidence matrices in combinatorial design theory. This suggests that STRank is best understood as a family resemblance across domains rather than a single unified formalism.

1. STRank as stable rank in LLM alignment

In "SR-GRPO: Stable Rank as an Intrinsic Geometric Reward for LLM Alignment" (Tang et al., 2 Dec 2025), Stable Rank (STRank) is the core geometric signal proposed to score the quality of an LLM’s response directly from its internal representations and to drive reinforcement-learning alignment without external supervision. The matrix definition is

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$

Here, the numerator aggregates total variance across all directions, and the denominator is the variance along the single dominant direction. $\operatorname{sr}(A)$ is near $1$ when the representation collapses into one direction; it approaches $\operatorname{rank}(A)$ when variance is spread relatively evenly across dimensions.

For a hidden-state matrix $H\in\mathbb{R}^{T\times d}$, where rows are token activations in $d$-dimensional feature space, the same quantity is written as

$$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$

If one centers $H$ across tokens to obtain $H_c$, then with the scaled covariance $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$0,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$1

In both forms, STRank measures an effective dimensionality: the ratio of total variance to dominant-direction variance. Higher stable rank means information is distributed across multiple semantic directions; lower stable rank indicates representational collapse into a narrow cone, often associated with poor or repetitive generations.

The implementation in this work uses the final-layer hidden state activation matrix $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$2 from the reference transformer’s last layer, described as the residual stream after the block. Inputs are formatted with the model’s native chat template, and STRank is computed on the response tokens only, excluding prompt and padding tokens. The default implementation uses uncentered $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$3, so the raw reward is the scalar $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$4 computed per sample rather than a globally normalized statistic. Cross-layer ablations show that final-layer STRank yields the best quality signal, while earlier layers carry weaker quality signals (Tang et al., 2 Dec 2025).

Computationally, STRank is obtained by a frozen-reference forward pass to produce $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$5, followed by a one-pass computation of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$6 and an estimate of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$7 via power iteration. The Frobenius term is $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$8, and each power-iteration step is also $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$9; a small number of iterations, such as $\operatorname{sr}(A)$0–$\operatorname{sr}(A)$1, suffices in practice. Full SVD is described as memory-heavy, whereas power iteration is the standard efficient choice. Truncating to $\operatorname{sr}(A)$2 tokens preserves nearly all RewardBench accuracy, while $\operatorname{sr}(A)$3-token windows degrade substantially, especially for code (Tang et al., 2 Dec 2025).

2. SR-GRPO and the use of STRank as an intrinsic reward

The same work introduces Stable Rank Group Relative Policy Optimization, or SR-GRPO, which uses stable rank as a reward signal for reinforcement learning without external supervision (Tang et al., 2 Dec 2025). The setup uses a frozen reference model $\operatorname{sr}(A)$4 and a trainable policy $\operatorname{sr}(A)$5 initialized from that reference. Given a prompt $\operatorname{sr}(A)$6, the policy samples $\operatorname{sr}(A)$7 responses $\operatorname{sr}(A)$8, and the frozen reference model computes a reward $\operatorname{sr}(A)$9 for each response from its final-layer hidden states. The use of a frozen reference is described as critical because it makes the reward stationary and prevents the policy from manipulating the reward via its own hidden states.

Within each sampled group, rewards are standardized to produce scale-invariant learning signals:

$1$0

The training loop samples prompts, generates $1$1 candidate responses per prompt, computes STRank rewards by forwarding prompt-response pairs through the frozen reference model, standardizes those rewards within each group, and updates the policy with KL regularization toward the reference policy. The reported final configuration uses group size $1$2, KL coefficient $1$3, sampling temperature $1$4, top-$1$5 $1$6, learning rate $1$7 with cosine schedule, LoRA adapters with rank $1$8 and $1$9, bfloat16 precision, gradient accumulation to an effective batch size of $\operatorname{rank}(A)$0, and gradient checkpointing. Reward computation disables LoRA adapters so that the reward depends only on reference geometry (Tang et al., 2 Dec 2025).

Empirically, STRank serves both as a zero-shot reward proxy and as an alignment signal. On RewardBench, it achieves $\operatorname{rank}(A)$1 accuracy on Qwen3-8B, outperforming the self-evaluation baselines Pointwise at $\operatorname{rank}(A)$2 and IPO at $\operatorname{rank}(A)$3. On smaller models, the gap is larger; for example, on Qwen2.5-1.5B the reported numbers are $\operatorname{rank}(A)$4 for STRank and $\operatorname{rank}(A)$5 for IPO. In Best-of-$\operatorname{rank}(A)$6 decoding, selecting the highest-STRank response improves over greedy decoding by an average of $\operatorname{rank}(A)$7 percentage points across STEM and mathematics benchmarks. At $\operatorname{rank}(A)$8, the gains are reported as $\operatorname{rank}(A)$9 pp for Llama-3.2-1B, $H\in\mathbb{R}^{T\times d}$0 pp for Qwen2.5-1.5B, $H\in\mathbb{R}^{T\times d}$1 pp for DeepSeek-R1-1.5B, and $H\in\mathbb{R}^{T\times d}$2 pp for Phi-3.5-mini (Tang et al., 2 Dec 2025).

The alignment results are likewise reported without external labels. On Qwen2.5-1.5B-Instruct, SR-GRPO improves performance by $H\in\mathbb{R}^{T\times d}$3 on STEM and $H\in\mathbb{R}^{T\times d}$4 on mathematical reasoning relative to base, with gains across GPQA, MMLU, MATH, OlympiadBench, and AMC. On DeepSeek-R1-Distill-Qwen-1.5B, the method yields consistent improvements on math and STEM and higher WB-Elo on WildBench. The paper states that SR-GRPO surpasses learned reward models and self-evaluation methods such as Self-Reward, Perplexity, and IPO across tasks, and notes that learned reward models can hurt specialized reasoning, including GPQA drops under RM, whereas STRank-based training improves or maintains performance broadly (Tang et al., 2 Dec 2025).

3. Behavioral analyses, robustness, and failure modes of stable-rank STRank

The stable-rank formulation is accompanied by correlation analyses intended to characterize what the reward is actually measuring (Tang et al., 2 Dec 2025). Across RewardBench responses, STRank correlates positively with progression score, with Spearman $H\in\mathbb{R}^{T\times d}$5; QA alignment consistency, with $H\in\mathbb{R}^{T\times d}$6; and adjacent similarity, with $H\in\mathbb{R}^{T\times d}$7. It correlates negatively with coherence variability, defined as the standard deviation of adjacent similarity, with $H\in\mathbb{R}^{T\times d}$8. These results are presented as evidence that STRank tracks semantic coherence and prompt alignment while being sensitive to abrupt topic shifts and incoherence.

The same analyses indicate a preference for information density over verbosity. Token count and sentence count are negatively correlated with STRank, at $H\in\mathbb{R}^{T\times d}$9 and $d$0, respectively, while lexical diversity and compression ratio are positively correlated, at $d$1 and $d$2. Paired-difference analysis further shows that overuse of additive, conditional, and enumerative discourse markers correlates negatively with STRank, whereas the presence of contrastive markers such as “however” and causal markers such as “because” has a mild positive effect. This is interpreted in the source as being consistent with emphasizing key reasoning steps rather than stylistic filler (Tang et al., 2 Dec 2025).

The ablations also situate STRank among other intrinsic metrics. Final-layer STRank substantially outperforms earlier layers, and prompt format variations change RewardBench accuracy by at most $d$3 percentage points, which the paper presents as robustness to prompt sensitivity that plagues self-eval rewards. Accuracy saturates by approximately $d$4 tokens, with negligible gains beyond that threshold. The metric is also reported to outperform effective rank, condition number, and PCA $d$5 variance for preference prediction. The stated rationale is that the ratio form balances richness, from the Frobenius term, with coherence, from the spectral norm, and is therefore more robust for quality discrimination (Tang et al., 2 Dec 2025).

The limitations are explicit. High STRank is not guaranteed correctness: a response may spread variance across many directions yet still be wrong, including confidently but incorrectly reasoned or off-topic text. Stylistic biases are also noted, because STRank mildly rewards contrastive and causal markers but penalizes enumerative and additive overuse; structured tutorials or step-by-step lists may therefore be undervalued. Domain-specific caveats include sensitivity of code tasks to truncation and the possibility that long-form creative writing may achieve high STRank for diversity even if task demands brevity. Suggested mitigations include maintaining KL regularization, using response-only tokens, capping the evaluated window to the first $d$6–$d$7 tokens or the answer region, and combining STRank with lightweight verifiers or simple filters in domains where exact correctness can be checked (Tang et al., 2 Dec 2025).

4. STRank as a count-aware learning-to-rank loss for spatial transcriptomics

In "Learning Relative Gene Expression Trends from Pathology Images in Spatial Transcriptomics" (Nishimura et al., 7 Dec 2025), STRank denotes a different construct: a loss for learning relative expression patterns rather than absolute expression levels from pathology images aligned to spatial transcriptomics. The setting is spot-level image-to-expression prediction, where a model receives an H&E image patch $d$8 and predicts a gene-expression-related output for a spot. The motivation is that observed counts are affected by batch effects and intrinsic stochasticity, while point-wise losses such as L1/L2, Poisson, and Negative Binomial negative log-likelihoods attempt to match absolute levels and can therefore be sensitive to patient-specific scalings, offsets, and low-signal noise.

The central assumption is that relative ordering of expression within a tissue is more stable than absolute levels across independent experiments. Formally, if $d$9 is the observed count for gene $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$0 in spot $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$1 of tissue $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$2, then the assumption is that

$$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$3

where $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$4 is a scale-invariant rank score. The model $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$5 predicts rank scores $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$6 such that their relative order reflects the relative order of the observed counts within the same tissue (Nishimura et al., 7 Dec 2025).

The pairwise STRank objective uses two spots $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$7 from the same tissue and defines a total per-gene count $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$8. With predicted rank scores $$\operatorname{sr}(H)=\frac{\operatorname{tr}(H^\top H)}{\lambda_{\max}(H^\top H)}.$$9, the pairwise probabilities are

$H$0

Assuming a Binomial$H$1 process, the negative log-likelihood becomes

$H$2

Equivalently, with empirical frequency $H$3, it is a cross-entropy between empirical and predicted split, weighted by $H$4. Ties are handled naturally: if $H$5, then $H$6, and the loss encourages $H$7 (Nishimura et al., 7 Dec 2025).

The listwise variant generalizes this to a list of $H$8 spots from one tissue. If $H$9 and

$H_c$0

then under a Multinomial model the loss is

$H_c$1

An optional detectability correction weights the softmax by library size $H_c$2:

$H_c$3

The loss is integrated with a rank-score predictor $H_c$4, using any CNN or Transformer over H&E patches. In the real-data experiments, CONCH features are extracted per patch and a single fully connected layer maps features to $H_c$5. The gradients are standard cross-entropy gradients over softmax scores, and log-softmax is recommended for numerical stability (Nishimura et al., 7 Dec 2025).

5. Empirical properties, robustness, and scope of transcriptomic STRank

The transcriptomic STRank formulation is explicitly designed to be robust to multiplicative scaling of counts within tissue, because empirical frequencies $H_c$6 are unchanged when $H_c$7 while the loss is merely rescaled by $H_c$8. The predicted probabilities are also shift-invariant, since $H_c$9. The source further argues that STRank leverages order statistics rather than absolute levels and adaptively downweights noisy, low-count events while emphasizing high-signal genes and spots (Nishimura et al., 7 Dec 2025).

Synthetic stress tests use two patients with Negative-Binomial-sampled counts under strong batch effects, with patient $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$00 defined by $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$01 and patient $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$02 by $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$03, and report Spearman correlation coefficient between predicted ranks and the ground-truth $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$04. In the uniform setting, the reported mean SCC values are PairSTRank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$05, ListSTRank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$06, Rank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$07, MSE $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$08, Poisson $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$09, NB $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$10, and PCC $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$11. In the imbalanced setting, the corresponding numbers are PairSTRank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$12, ListSTRank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$13, Rank $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$14, MSE $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$15, Poisson $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$16, NB $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$17, and PCC $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$18. The paper states that listwise generally exceeds pairwise, reflecting the value of global context across spots (Nishimura et al., 7 Dec 2025).

On real data, the evaluation uses the HEST-1k benchmark across seven cohorts—IDC, PRAD, PAAD, COAD, READ, ccRCC, and IDC-Lymph Node—with Visium and Xenium data. The setup fixes the CONCH feature extractor, trains only a single fully connected head, uses $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$19 highly variable genes, AdamW with learning rate $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$20, batch size $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$21, and up to $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$22 epochs with early stopping. The reported average SCC across datasets is approximately $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$23 for ListSTRank and approximately $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$24 for PairSTRank, better than MSE, Poisson, and NB on average, though not uniformly best on every dataset (Nishimura et al., 7 Dec 2025).

Robustness to sparsity is assessed by downsampling counts with binomial sampling rates $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$25. STRank, in both pairwise and listwise form, consistently outperforms Rank and PCC, with the largest gains at extreme sparsity $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$26. Ablations show that increasing list size $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$27 beyond $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$28 improves performance and that stable operation occurs around $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$29, although extremely large $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$30 may add numerical and computational overhead. The paper also states that swapping STRank into Hist2Gene-like setups on HER2ST improves SCC versus hinge rank and PCC (Nishimura et al., 7 Dec 2025).

The limitations delimit the scope of the method. If disease processes or cell-type composition shifts invert within-tissue orderings for a gene, rank consistency may fail. STRank can underperform MSE or PCC when cohort-specific noise dominates low-signal genes and image features also shift. Convergence can be slower than listwise correlation objectives such as PCC in single-patient, low-sample settings because the updates are conservative and count-weighted. Suggested future directions include heteroscedastic uncertainty heads, factorized multi-gene heads, domain adaptation, spatial priors through graph or transformer modules, and hybrid objectives blending STRank with NB or Poisson heads for genes with reliable absolute calibration (Nishimura et al., 7 Dec 2025).

6. STRank in Steiner triple systems and prescribed $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$31-rank

In the combinatorial-design setting summarized from "Counting Steiner triple systems with classical parameters and prescribed rank" (Jungnickel et al., 2017), STRank refers to rank questions for Steiner triple systems (STS), especially the binary $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$32-rank and ternary $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$33-rank of their incidence matrices. An $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$34 is a $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$35-$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$36 design on a $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$37-point set, and for a prime $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$38 the $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$39-rank is the rank over $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$40 of the block-point incidence matrix.

The Doyen–Hubaut–Vandensavel bound in the binary case states that for an $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$41,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$42

with equality if and only if the system is the classical point-line design $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$43. The ternary analogue states that for an $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$44,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$45

with equality if and only if the system is the classical point-line design $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$46 (Jungnickel et al., 2017).

A central structural device is the code $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$47. In the binary case, for $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$48, deleting $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$49 rows from the parity-check matrix $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$50 of the classical $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$51 yields $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$52 and a binary linear code $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$53 of parameters $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$54. The theorem stated in the overview is that $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$55 contains representatives of all isomorphism classes of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$56 with $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$57-rank at most $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$58. Writing $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$59 and $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$60, the columns of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$61 consist of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$62 copies of the all-zero vector and $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$63 groups of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$64 identical nonzero columns. The corresponding automorphism group has order

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$65

The main binary enumeration theorem states that the number of distinct $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$66 with $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$67-rank at most $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$68 contained in $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$69 is

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$70

where $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$71 is the number of distinct $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$72, $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$73 the number of distinct $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$74-factorizations of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$75, and $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$76 the number of distinct $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$77 on three specified groups of size $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$78 (Jungnickel et al., 2017).

The same framework recovers previously known closed forms. For $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$79,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$80

For $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$81,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$82

For $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$83,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$84

The ternary analogue uses a parity-check matrix $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$85 obtained by deleting $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$86 rows from the nonconstant part of the classical ternary construction. With $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$87 and $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$88, the automorphism group has order

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$89

and the number of distinct $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$90 with $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$91-rank at most $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$92 in $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$93 is

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$94

For $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$95,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$96

and for $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$97,

$$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$98

The paper further derives lower and upper bounds on the number of isomorphism classes with rank at most, or exactly, a prescribed value, and presents this as the first two infinite families of $$\operatorname{sr}(A)=\frac{\|A\|_F^2}{\|A\|_2^2}=\frac{\sum_i \sigma_i^2}{\sigma_1^2}.$$99-designs for which one has non-trivial lower and upper bounds for the number of non-isomorphic examples with a prescribed $\operatorname{sr}(A)$00-rank in almost the entire range of possible ranks (Jungnickel et al., 2017).

7. Comparative interpretation across domains

Across these literatures, the word “rank” refers to three different invariants: effective dimensionality of hidden-state geometry, relative ordering of spot-level gene expression, and linear-algebraic rank of incidence structures over finite fields (Tang et al., 2 Dec 2025, Nishimura et al., 7 Dec 2025, Jungnickel et al., 2017). The commonality is therefore structural rather than definitional. Each STRank formalism replaces direct dependence on a noisy or difficult-to-supervise absolute target with a rank-like quantity that is more stable under the nuisance transformations emphasized by the corresponding field.

In the LLM setting, the nuisance factors are annotation scarcity, reward hacking, and prompt sensitivity; STRank therefore uses a stationary geometric statistic extracted from a frozen reference model. In spatial transcriptomics, the nuisance factors are batch effects, stochastic count noise, and inter-cohort scaling; STRank therefore uses empirical within-tissue frequencies and relative orderings instead of absolute counts. In Steiner triple systems, the nuisance factor is not observational noise but combinatorial complexity; the relevant “rank” becomes a classification parameter that organizes enumeration through ambient codes and automorphism groups (Tang et al., 2 Dec 2025, Nishimura et al., 7 Dec 2025, Jungnickel et al., 2017).

This suggests a broader editorial characterization of STRank as a “rank-mediated robustness” pattern: each use privileges an invariant or approximately invariant ordering, dimension, or code property over raw magnitudes. A plausible implication is that the recurrence of the label reflects a shared methodological preference for quantities that survive scaling, collapse, or symmetry transformations, even though the mathematical objects and application domains are otherwise unrelated.