{"id":"W1418567529","doi":"10.1016/j.dam.2015.09.015","title":"Counting the number of non-equivalent vertex colorings of a graph","year":2015,"lang":"en","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":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Degree (music); Vertex (graph theory); 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":[],"consensus_categories":[],"category_scores_codex":[0.001046895,0.0001447449,0.0003039461,0.00006687381,0.00006195141,0.00003445958,0.001289123,0.00004599589,0.000008549927],"category_scores_gemma":[0.00009871602,0.0000988392,0.00008815118,0.0006042948,0.0002782206,0.0001406903,0.0005419035,0.0001484451,0.00003287222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002329201,"about_ca_system_score_gemma":0.00006972165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005816165,"about_ca_topic_score_gemma":6.72295e-7,"domain_scores_codex":[0.9983416,0.0000208151,0.0004258903,0.0002114583,0.0007056625,0.0002945887],"domain_scores_gemma":[0.9981914,0.0003505789,0.0003161479,0.0008731382,0.0001804518,0.00008829349],"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.00001417056,0.00007104419,0.0001244686,0.0001688613,0.00003513842,0.000001270615,0.003885461,0.00009737443,0.005706532,0.9892235,0.0001171439,0.0005549828],"study_design_scores_gemma":[0.0006669365,0.00005903289,0.0001289105,0.00009358642,0.00002446326,0.00001202074,0.002731323,0.01675992,0.03014195,0.9489302,0.0002367152,0.000214913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2306872,0.00003436112,0.7007431,0.0001208501,0.00007064292,0.0005654778,0.000005584857,0.00006043422,0.0677123],"genre_scores_gemma":[0.8827704,0.000007209057,0.1170592,0.00002527816,0.000007979726,0.00004438161,0.000001000974,0.00001605882,0.00006855602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6520832,"threshold_uncertainty_score":0.4030546,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03439792062034031,"score_gpt":0.3151338333837076,"score_spread":0.2807359127633673,"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."}}