{"id":"W2939719063","doi":"10.1007/s00373-019-02123-1","title":"The Intersection of Two Vertex Coloring Problems","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Induced subgraph; Graph coloring; Complete coloring; Chordal graph; Greedy coloring; Graph; Discrete mathematics; Graph power; Line 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.001994452,0.0009672854,0.001532313,0.002320333,0.00302679,0.007918907,0.002963037,0.003670766,0.01740651],"category_scores_gemma":[0.0137402,0.001016846,0.001463089,0.003499552,0.002942373,0.009279268,0.004347775,0.005675112,0.001338856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002591469,"about_ca_system_score_gemma":0.001831867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001759367,"about_ca_topic_score_gemma":0.001140612,"domain_scores_codex":[0.9964169,0.001394342,0.000153632,0.0007002829,0.0006483251,0.0006865807],"domain_scores_gemma":[0.9873081,0.009103951,0.0006954847,0.0008687092,0.0009062272,0.001117495],"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.0007453188,0.0002936215,0.00179068,0.0002832931,0.00008021649,0.0003601348,0.0006851832,0.009243359,0.001372463,0.9343381,0.01202239,0.03878525],"study_design_scores_gemma":[0.00007838889,0.00004094064,0.0005770767,0.00007002331,0.00004858465,0.000257895,0.0005890495,0.03178864,0.001508405,0.9581136,0.006903253,0.00002432839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5585744,0.002400042,0.2123688,0.01113431,0.0005990902,0.0002085113,0.002025274,0.0006859291,0.2120036],"genre_scores_gemma":[0.9159165,0.001207148,0.05394821,0.0007028463,0.0003906088,0.0001740018,0.00290097,0.0002555083,0.02450424],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01740651,"threshold_uncertainty_score":0.05823064,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02231037702462028,"score_gpt":0.2768498994107605,"score_spread":0.2545395223861402,"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."}}