{"id":"W2962698493","doi":"10.1016/j.dam.2017.06.006","title":"A coloring algorithm for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-free line graphs","year":2017,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Claw; Algorithm; Discrete mathematics; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504918,0.001958809,0.0009928232,0.001609852,0.002075888,0.003164708,0.002948459,0.001788788,0.05551575],"category_scores_gemma":[0.004247962,0.001046744,0.002065168,0.002737225,0.0008684178,0.003161433,0.002208515,0.002740135,0.02112288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002931108,"about_ca_system_score_gemma":0.003431779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009212878,"about_ca_topic_score_gemma":0.01464838,"domain_scores_codex":[0.9990435,0.0001459968,0.00006250029,0.0003172998,0.0002545037,0.0001761128],"domain_scores_gemma":[0.9972098,0.001162079,0.0001222192,0.0007463832,0.0005601957,0.0001992964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004919291,0.0007039489,0.001244079,0.0006641055,0.0001239742,0.0002818757,0.00050197,0.03950705,0.01516581,0.1559917,0.2829557,0.5023679],"study_design_scores_gemma":[0.0005531894,0.000239282,0.00128488,0.0002095623,0.0001462902,0.0007309435,0.0004447257,0.3589526,0.02240773,0.4360369,0.1788353,0.0001585361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01057536,0.0002061698,0.9299612,0.001353576,0.0003586239,0.0006248404,0.004473649,0.01438507,0.0380615],"genre_scores_gemma":[0.06460612,0.0003420792,0.8764686,0.0004162189,0.0001331689,0.0006614568,0.009134904,0.004039749,0.04419779],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05551575,"threshold_uncertainty_score":0.1857187,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02548238459607097,"score_gpt":0.2721571614832467,"score_spread":0.2466747768871757,"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."}}