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 OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

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 $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Γ</mml:mi> </mml:math> 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 )$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>μ</mml:mi> <mml:mo>(</mml:mo> <mml:mi>Γ</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> is the smallest size of a resolving set for $$\Gamma $$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>Γ</mml:mi> </mml:math> . We consider the metric dimension of the dual polar graphs , and show that it is at most the rank over $$\mathbb {R}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>R</mml:mi> </mml:math> 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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.027
Threshold uncertainty score0.418

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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