MétaCan
Menu
Back to cohort
Record W4413186177 · doi:10.55016/ojs/cdm.v5i2.62061

Bounds and constructions for n-e.c. tournaments

2010· article· en· W4413186177 on OpenAlexfundvenueno aff
Anthony Bonato, Przemysław Gordinowicz, Paweł Prałat

Bibliographic record

VenueContributions to Discrete Mathematics · 2010
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsnot available
FundersNatural Sciences and Engineering Research Council of CanadaMemorial University of NewfoundlandMitacs
KeywordsCombinatoricsMathematics

Abstract

fetched live from OpenAlex

Few families of tournaments satisfying the n-e.c.\ adjacency property are known. We supply a new random construction for generating infinite families of vertex-transitive n-e.c.\ tournaments by considering circulant tournaments. Switching is used to generate exponentially many n-e.c.\ tournaments of certain orders. With aid of a computer search, we demonstrate that there is a unique minimum order 3-e.c.\ tournament of order 19, and there are no 3-e.c.\ tournaments of orders 20, 21, and 22.

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.001
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.359
Threshold uncertainty score0.404

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
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.014
GPT teacher head0.335
Teacher spread0.321 · 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.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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
Published2010
Admission routes2
Has abstractyes

Explore more

Same venueContributions to Discrete MathematicsSame topicFormal Methods in VerificationFrench-language works237,207