MétaCan
Menu
Back to cohort
Record W2768173427 · doi:10.1007/s00013-023-01829-2

Metric dimension of dual polar graphs

2023· article· en· W2768173427 on OpenAlexafffund
R. A. Bailey, Pablo Spiga

Bibliographic record

VenueArchiv der Mathematik · 2023
Typearticle
Languageen
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsMemorial University of Newfoundland
FundersNatural Sciences and Engineering Research Council of CanadaMemorial University of Newfoundland
KeywordsDimension (graph theory)MathematicsVertex (graph theory)CombinatoricsAlgorithmRank (graph theory)Graph

Abstract

fetched live from OpenAlex

Abstract A resolving set for a graph $$\Gamma $$ Γ is a collection of vertices S, chosen so that for each vertex v, the list of distances from v to the members of S uniquely specifies v. The metric dimension $$\mu (\Gamma )$$ μ ( Γ ) is the smallest size of a resolving set for $$\Gamma $$ Γ . We consider the metric dimension of the dual polar graphs, and show that it is at most the rank over $$\mathbb {R}$$ R of the incidence matrix of the corresponding polar space. We then compute this rank to give an explicit upper bound on the metric dimension of dual polar graphs, as well as the halved dual polar graphs.

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.001
metaresearch head score (Gemma)0.003
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.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0030.002
Science and technology studies0.0010.002
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0090.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.020
GPT teacher head0.245
Teacher spread0.225 · 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

Citations5
Published2023
Admission routes2
Has abstractyes

Explore more

Same venueArchiv der MathematikSame topicGraph Labeling and Dimension ProblemsFrench-language works237,207