{"id":"W2978207776","doi":"10.1016/j.entcs.2019.08.033","title":"On Coloring a Class of Claw-free Graphs","year":2019,"lang":"en","type":"article","venue":"Electronic Notes in Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Chordal graph; Split graph; Graph coloring; 1-planar graph; Discrete mathematics; Line graph; Pathwidth; Vertex (graph theory); Edge coloring; Indifference graph; Graph; Graph power","routes":{"ca_aff":true,"ca_fund":true,"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":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003032911,0.0002315619,0.0003494446,0.0007105001,0.0001385903,0.0001298282,0.005918766,0.00007851821,0.00004475909],"category_scores_gemma":[0.0005420587,0.0002018151,0.0001047627,0.003441275,0.002349641,0.0006318927,0.001792862,0.0007204626,0.00006518716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002556681,"about_ca_system_score_gemma":0.0003689155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003184672,"about_ca_topic_score_gemma":0.000003764298,"domain_scores_codex":[0.9957421,0.000232742,0.0003946993,0.001033309,0.001176536,0.001420643],"domain_scores_gemma":[0.9956101,0.00194369,0.0001016572,0.002003568,0.0001658177,0.0001751595],"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":[0.00005244986,0.00009915306,0.000452522,0.00001148564,0.000004453402,0.000006484213,0.000140012,0.001893557,0.002658764,0.9824999,0.000002627005,0.01217858],"study_design_scores_gemma":[0.0005198424,0.00102103,0.0004433788,0.00005073629,9.307503e-7,0.00001057483,0.000002013219,0.1929677,0.02174878,0.7830309,0.00001910405,0.0001849791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3840642,0.00005417264,0.6124892,0.000468473,0.000292267,0.0003212785,7.927542e-7,0.00008326439,0.002226352],"genre_scores_gemma":[0.9696909,0.00001077341,0.02999235,0.0002531571,0.00001965098,0.00001377536,2.484999e-7,0.00001243469,0.000006703895],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5856267,"threshold_uncertainty_score":0.9994597,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007934784732203454,"score_gpt":0.270987125787603,"score_spread":0.2630523410553996,"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."}}