{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045778,0.0001926613,0.0002597983,0.0001461874,0.0002124631,0.0001888892,0.001261943,0.0001156671,6.902087e-7],"category_scores_gemma":[0.00004371554,0.0001467524,0.0001188625,0.0005126668,0.0001654364,0.0001521206,0.002024988,0.000663495,0.000002819284],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006038933,"about_ca_system_score_gemma":0.00009313178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004330734,"about_ca_topic_score_gemma":0.000008595171,"domain_scores_codex":[0.9984612,0.0001218813,0.0002811964,0.000454088,0.0003792445,0.0003023208],"domain_scores_gemma":[0.9982413,0.0003018501,0.00022407,0.0009347126,0.0002267673,0.00007130209],"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.000008655558,0.00003485263,0.001888352,0.0001171767,0.00004106288,0.000001378505,0.0002926606,0.0003058731,0.00007631031,0.9882318,0.00006439556,0.008937464],"study_design_scores_gemma":[0.0003330466,0.0001520786,0.0008265028,0.0001018741,0.0000074858,0.000004495338,0.00004827663,0.01602799,0.0003808712,0.9814014,0.0005558876,0.0001600681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7461659,0.007058844,0.225105,0.0004215688,0.01125477,0.001999325,0.00001124433,0.0003376807,0.007645621],"genre_scores_gemma":[0.9985294,0.000765098,0.0003952146,0.00001060677,0.000006593171,0.00005690907,0.000001697297,0.00001341294,0.0002210426],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2523635,"threshold_uncertainty_score":0.5984388,"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."}}