MétaCan
Menu
Back to cohort
Record W35075569 · doi:10.1007/s00604-022-05173-0

Eccentricity sequences and eccentricity sets in digraphs.

2008· article· en· W35075569 on OpenAlexvenueno aff
Joan Gimbert, Nacho López

Bibliographic record

VenueArs Combinatoria · 2008
Typearticle
Languageen
FieldMathematics
TopicGraph theory and applications
Canadian institutionsnot available
FundersNational Research Council of Thailand
KeywordsDigraphEccentricity (behavior)MathematicsCombinatoricsSequence (biology)Vertex (graph theory)EccentricSet (abstract data type)Order (exchange)Discrete mathematicsPhysicsGraphComputer scienceBiology

Abstract

fetched live from OpenAlex

The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its vertices given in nondecreas-ing order. A sequence of positive integers is a digraphical eccentric sequence if it is the eccentricity sequence of some digraph. A set of positive integers S is a digraphical eccentric set if there is a digraph G such that S = {e(v), v ∈ V (G)}. In this paper, we present some necessary and sufficient conditions for a sequence S to be a digraph-ical eccentric sequence. In some particular cases, where either the minimum or the maximum value of S is fixed, a characterization is derived. We also characterize digraphical eccentric sets.

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.000
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: none
Teacher disagreement score0.007
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
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.035
GPT teacher head0.284
Teacher spread0.249 · 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

Citations4
Published2008
Admission routes1
Has abstractyes

Explore more

Same venueArs CombinatoriaSame topicGraph theory and applicationsFrench-language works237,207