MétaCan
Menu
Back to cohort
Record W4409341382 · doi:10.1142/s179383092550079x

Strong edge coloring algorithm for K4-minor free graphs

2025· article· en· W4409341382 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

VenueDiscrete Mathematics Algorithms and Applications · 2025
Typearticle
Languageen
FieldComputer Science
TopicGraph Labeling and Dimension Problems
Canadian institutionsSt. Francis Xavier University
Fundersnot available
KeywordsMathematicsCombinatoricsMinor (academic)Edge coloringGreedy coloringGraph coloringEnhanced Data Rates for GSM EvolutionDiscrete mathematicsAlgorithmGraphComputer scienceLine graphArtificial intelligence

Abstract

fetched live from OpenAlex

The strong chromatic index [Formula: see text] of a graph [Formula: see text] is the smallest integer [Formula: see text] such that [Formula: see text] has a proper edge [Formula: see text]-coloring with the condition that any two edges at distance at most 2 receive distinct colors. It is known that [Formula: see text] for any [Formula: see text]-minor-free graph [Formula: see text] with [Formula: see text] where [Formula: see text] denotes the maximum degree of [Formula: see text]. We give a polynomial algorithm in order [Formula: see text] to strong color the edges of a [Formula: see text]-minor free graph with [Formula: see text] colors where [Formula: see text].

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.000
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: Methods
Teacher disagreement score0.371
Threshold uncertainty score0.680

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
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.016
GPT teacher head0.269
Teacher spread0.253 · 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