MétaCan
Menu
Back to cohort
Record W2400938207

Sharp Bounds for Spectral Radius of Graphs Presented by K-Neighbour of the Vertices

2016· article· en· W2400938207 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAdvances in natural science/Advances in natural sciences · 2016
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsCombinatoricsSpectral radiusMathematicsEigenvalues and eigenvectorsInteger (computer science)GraphUpper and lower boundsSequence (biology)RADIUSConnectivitySimple (philosophy)Discrete mathematicsSimple graphPhysicsMathematical analysisComputer scienceQuantum mechanics
DOInot available

Abstract

fetched live from OpenAlex

Let G = (V, E) be a simple connected graph with V (G) = {v1, v2, …, vn} and degree sequence d1, d2, …, dn. Denote , where k is a positive integer number and vi∈V(G) and note that t0(i)=di. Let ρ(G) be the largest eigenvalue of adjacent matrix of G. In this paper, we present sharp upper and lower bounds of ρ(G) in terms of mk(i) (see theorem (2.1)). From which, we can obtain some known results, and our result is better than other results in some case.

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.002
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies, Open science
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.319
Threshold uncertainty score0.999

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.007
Science and technology studies0.0010.006
Scholarly communication0.0000.010
Open science0.0070.001
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.006
GPT teacher head0.282
Teacher spread0.276 · 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