MétaCan
Menu
Back to cohort
Record W7118051148

Two-Distance Sets over Finite Fields

2025· article· W7118051148 on OpenAlexfundno aff
Jozsef Solymosi

Bibliographic record

VenueArXiv.org · 2025
Typearticle
Language
FieldMathematics
TopicLimits and Structures in Graph Theory
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaNemzeti Kutatási Fejlesztési és Innovációs Hivatal
KeywordsQuadratic equationUpper and lower boundsFinite fieldLorentz transformationField (mathematics)Finite set
DOInot available

Abstract

fetched live from OpenAlex

We study two-distance sets in standard $d$-dimensional quadratic spaces over finite fields. In characteristic $3$, we construct sets attaining the full Larman--Rogers--Seidel bound, showing that Blokhuis' Euclidean bound $\binom{d+2}{2}$ need not hold over finite fields. We prove a rank-sensitive replacement which precisely measures the failure of positive definiteness. We also show that the Blokhuis bound $\binom{d+2}{2}$ is attained over a suitable finite field exactly for each $d\neq6$; in the exceptional dimension $d=6$, the exact maximum is $27$.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.006
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.007
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.006
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.002
Science and technology studies0.0030.005
Scholarly communication0.0040.009
Open science0.0020.005
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0070.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.029
GPT teacher head0.313
Teacher spread0.284 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueArXiv.orgSame topicLimits and Structures in Graph TheoryFrench-language works237,207