MétaCan
Menu
Back to cohort
Record W1930124199 · doi:10.26493/1855-3974.196.0df

Gray code numbers for graphs

2011· article· en· W1930124199 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.

Bibliographic record

VenueArs Mathematica Contemporanea · 2011
Typearticle
Languageen
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsCombinatoricsMathematicsGray codeVertex (graph theory)GraphDiscrete mathematicsAlgorithm

Abstract

fetched live from OpenAlex

A graph H has a Gray code of k -colourings if it is possible to list all of its k -colourings in such a way that consecutive elements in the list differ in the colour of exactly one vertex. We prove that for any graph H , there is a least integer k 0 ( H ) such that H has a Gray code of k -colourings whenever k ≥ k 0 ( H ). We then determine k 0 ( H ) whenever H is a complete graph, tree, or cycle.

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: Methods · Consensus signal: none
Teacher disagreement score0.730
Threshold uncertainty score0.675

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
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.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.062
GPT teacher head0.254
Teacher spread0.192 · 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