Formal Isomorphism Criteria for Cross-Disciplinary Terminology Crosswalks: A Three-Tier Verification Framework with Decidability and Sample-Size Analysis

In plain language

The authors wanted a clear rule to tell when words from different fields truly mean the same thing, not just look similar. This matters because it lets researchers filter out irrelevant jargon quickly and focus on real cross‑field concepts, saving time and computing power. It works like sorting a huge pile of mixed puzzle pieces first by color and shape before trying to fit them together.

Restated for a non-expert reader; the original wording follows. 2 statement(s) without support in the text were removed. Still uses some technical language.

In the paper's words

Cross-disciplinary knowledge transfer currently relies on intuition: researchers in different fields who work on the same structural object routinely fail to discover each other because their vocabularies do not overlap. A study would assume a partitionality index of 0.9721, with 453 of 466 technical terms occurring in exactly one domain and an empty shared core at the three-domain threshold. This paper addresses the gap between that lexical silence and the claimed structural unity of scientific concepts: no existing operational criterion distinguishes genuine cross-domain conceptual equivalence from superficial analogy.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. Its reported results include a sentence-retention proportion $p_S = 0.511$, a token-retention proportion $p_T = 0.281$, a projected overall decoding speedup of approximately 510% under an independence assumption, a preserved $\chi = 1.25$ under the Möbius transformation $T(z) = \frac{2z+1}{z+3}$, an anharmonic orbit $\{1.25, 0.8, -0.25, -4, 5, 0.2\}$, a quadruple budget of $4.164 \times 10^{14}$ candidates for $V = 10{,}000$, a sample-size requirement of $n \geq 85$ aligned pairs for a correlation test, and a processing-time estimate of approximately 3.5 hours for the cross-ratio pipeline on the weighted corpus [11].

   from 2. Background and Related Work

2. The first binding constraint is compute at tier 1: the quadruple budget of $4.164 \times 10^{14}$ at embedding scale $V = 10{,}000$ (Section 4.2) makes exhaustive cross-ratio scoring infeasible, so candidate pre-filtering is mandatory; the processing-time estimate of approximately 3.5 hours for the cross-ratio pipeline on the weighted corpus [11] indicates the cost is manageable only after the sentence-level reduction to $p_S = 0.511$ of sentences and $p_T = 0.281$ of tokens [11].

   from 7. Practical Implications and Engineering Pathways

3. This is not a rhetorical flourish but a measured condition: in a sample of six arXiv categories spanning quantum physics, number theory, machine learning, genomics, materials science, and economic theory, 97.2% of extracted technical vocabulary was domain-local, and not a single technical term was shared by three or more domains [9].

   from 1. Introduction

4. Of these, 453 occurred in exactly one domain, 13 in two or more, and zero in three or more, yielding a partitionality index of 0.9721 and confirming the silo hypothesis H-SILO-1 (at least 90% of vocabulary domain-local) at 97.2% [9].

   from 2. Background and Related Work

5. In neurodegeneration detection, multiscale structural mapping integrates gray-white matter contrasts with cortical thickness, and its extension MSSM+ adds sulcal and curvature features at the vertex level; MSSM+ yielded "approximately 3%p higher AUPRC and 1%p higher AUROC" than MSSM with lower across-fold standard deviations, and the associated supervertex models improved Alzheimer's-versus-cognitively-normal classification for each MR vendor [5].

   from 2. Background and Related Work

6. The derivation makes explicit what the requirement was previously only asserted to be: it is the sample size at which a true pipeline–expert correlation of $r = 0.3$ is detected with 80% power, and it is the number of pairs the proposed falsification study of Section 7 must collect.

   from 4.4 Expert-validation sample size

How it is done

1. We derive the candidate search space for a six-domain vocabulary ($\binom{466}{2} = 108{,}345$ term pairs; $\binom{466}{4} \approx 1.94 \times 10^{9}$ relation quadruples), verify the projective invariance of a cross-ratio alignment score with a worked example ($\chi = 4/3$ preserved exactly under a Möbius transformation), derive the expert-validation sample size $n \geq 85$ from first principles, and show that a three-tier independence cascade reduces the false-positive rate from $10^{-2}$ per tier to $10^{-6}$ jointly.

   from Abstract

2. Where the underlying hierarchy names the tiers by their network-theoretic origin (topological, attributed, dynamic), this paper names the transported criteria by their terminological function (structural isomorphism, functional equivalence, logical interdependence); the two namings denote the same three-tier conjunction, and we use the functional naming throughout.

   from 1. Introduction

3. The 13 bridge terms are dominated by method vocabulary (machine-learning, language-model, language-models, foundation-models, upper-bound — 5 of 13), which indicates that even the existing lexical bridges are methodological rather than conceptual [9].

   from 2. Background and Related Work

4. We model a domain's terminology as an attributed concept graph.

   from 3.1 Object model

What would falsify it

1. The framework converts crosswalk construction from an analogy-driven craft into a verification problem with explicit falsification criteria, and it is immediately applicable to terminology work in machine translation, terminography, and cross-disciplinary team collaboration.

   from Abstract

2. A falsification protocol and a proposed minimal empirical study that would test the framework's precision against expert-validated alignments, with the refutation criterion stated in advance (Sections 6 and 7).

   from 1. Introduction

3. Its own proposed falsification experiment computes the invariant over a parallel corpus and refutes the hypothesis if the Pearson correlation with sentence-level BLEU satisfies $|r| \lt 0.1$ [11].

   from 2. Background and Related Work

Where the claim stops

1. What the results do and do not establish.

   from 6. Discussion

2. The paper establishes a verification framework and derives its quantitative parameters; it does not establish that the framework achieves high precision or recall on real cross-domain corpora.

   from 6. Discussion

3. A secondary falsification path is internal: if tier scores are found to be strongly correlated across tiers (measured, e.g., by inter-tier phi coefficients near 1 on a labeled sample), the independence assumption of Section 4.5 fails, the joint false-positive rate rises from $10^{-6}$ toward $10^{-2}$, and the cascade's central benefit disappears.

   from 6. Discussion

Where to read

1. Abstract224 words · 1 min
2. 1. Introduction880 words · 4 min
3. 2. Background and Related Work1,567 words · 7 min
4. 3. Methods786 words · 3 min
5. 4. Analysis1,116 words · 5 min
6. 5. Results289 words · 1 min
7. 6. Discussion715 words · 3 min
8. 7. Practical Implications and Engineering Pathways768 words · 3 min
9. 8. Conclusion177 words · 1 min
10. Provenance and AI Involvement240 words · 1 min