MétaCan
Menu
Back to cohort
Record W7128185748 · doi:10.55016/ojs/cdm.v8i2.62187

The exact maximal energy of integral circulant graphs with prime power order

2014· article· W7128185748 on OpenAlexvenueno aff
Juergen Sander, Torsten Sander

Bibliographic record

VenueContributions to Discrete Mathematics · 2014
Typearticle
Language
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
Fundersnot available
KeywordsCirculant matrixCirculant graphVertex (graph theory)Eigenvalues and eigenvectorsAdjacency listPrime powerGraph energyPrime (order theory)

Abstract

fetched live from OpenAlex

The energy of a graph was introduced by {\sc Gutman} in 1978 as the sum of the absolute values of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs, which can be characterized by their vertex count n and a set D of divisors of n in such a way that they have vertex set Z/nZ and edge set {{a,b}:a,b∈Z/nZ,gcd(a−b,n)∈D}. Given an arbitrary prime power ps, we determine all divisor sets maximising the energy of an integral circulant graph of order ps. This enables us to compute the maximal energy \Emaxps among all integral circulant graphs of order ps.

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 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.002
metaresearch head score (Gemma)0.003
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.934
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.002
Science and technology studies0.0010.001
Scholarly communication0.0000.000
Open science0.0010.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.009
GPT teacher head0.264
Teacher spread0.256 · 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 teacher head, not a consensus.

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
Published2014
Admission routes1
Has abstractyes

Explore more

Same venueContributions to Discrete MathematicsSame topicGraph theory and applicationsFrench-language works237,207