{"id":"W4409341382","doi":"10.1142/s179383092550079x","title":"Strong edge coloring algorithm for K4-minor free graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Minor (academic); Edge coloring; Greedy coloring; Graph coloring; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph; Computer science; Line graph; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002900283,0.0001859327,0.0002349801,0.0001716296,0.0004673219,0.0002455421,0.0006655311,0.00007368741,0.000002124323],"category_scores_gemma":[0.00003110495,0.0001666506,0.00009733131,0.0005217299,0.0000939673,0.0001508131,0.0003178912,0.0000997079,0.000004906829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000146411,"about_ca_system_score_gemma":0.00004502887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001195488,"about_ca_topic_score_gemma":0.000002508679,"domain_scores_codex":[0.9987344,0.00001075353,0.000363129,0.0004439128,0.0001552583,0.0002925993],"domain_scores_gemma":[0.9985808,0.0002045877,0.0001558295,0.0008066898,0.0001477541,0.0001043782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[2.984603e-7,0.00006709029,0.000008369218,0.00006445141,0.00003093628,1.963832e-7,0.0001290367,0.00001289726,0.0001108854,0.8926497,0.0005784447,0.1063477],"study_design_scores_gemma":[0.0004321993,0.00002731886,0.00002984661,0.00004615148,0.00003494001,0.000002758702,0.0001393784,0.3709751,0.0005379954,0.6218482,0.005753817,0.0001723108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003298596,0.0005097233,0.9950845,0.0007325851,0.0001103395,0.0008930393,0.00006735729,0.0001877236,0.002084912],"genre_scores_gemma":[0.005129413,0.00006873118,0.9921595,0.0001560978,0.00002258536,0.001473082,0.00002372528,0.00001722649,0.0009496641],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3709622,"threshold_uncertainty_score":0.6795813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01625894790405058,"score_gpt":0.2693119762721733,"score_spread":0.2530530283681227,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}