{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004072189,0.001534767,0.0007499544,0.0008838344,0.003791586,0.003631032,0.007379985,0.002610611,0.1215959],"category_scores_gemma":[0.002882571,0.002742087,0.002548548,0.001673162,0.003275445,0.00252499,0.006578492,0.002579184,0.001947843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003503621,"about_ca_system_score_gemma":0.001765879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004903413,"about_ca_topic_score_gemma":0.0008628585,"domain_scores_codex":[0.9853034,0.0003767591,0.002898163,0.003007583,0.004164725,0.004249343],"domain_scores_gemma":[0.9840834,0.003320438,0.003712218,0.006683631,0.0003728164,0.001827463],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001266128,0.0005509984,0.000003903108,0.002537781,0.001871169,0.001100157,0.003190725,0.001149525,0.003056062,0.8337398,0.1443159,0.007217905],"study_design_scores_gemma":[0.003266238,0.001680593,0.00002345352,0.001623235,0.001323789,0.0008063793,0.002059828,0.2544069,0.7235786,0.00543499,0.00351033,0.002285681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2333135,0.001875587,0.09844854,0.001427956,0.004813068,0.0003348567,0.002208869,0.0007858796,0.6567917],"genre_scores_gemma":[0.9044217,0.001605259,0.0824946,0.00119964,0.002555049,0.00392945,0.001588146,0.001431998,0.0007741277],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8283048,"threshold_uncertainty_score":0.9997401,"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."}}