{"id":"W3159107677","doi":"10.1007/s00373-023-02637-9","title":"Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Partition (number theory); Fractional coloring; Vertex (graph theory); Greedy coloring; Complete coloring; Graph; Edge coloring; List coloring; Discrete mathematics; Upper and lower bounds; 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.005895558,0.003838516,0.003706913,0.004214867,0.003335163,0.009244972,0.008807278,0.00318446,0.01207509],"category_scores_gemma":[0.04320165,0.002323113,0.002993899,0.005411983,0.004234291,0.01488516,0.005635863,0.006555555,0.001718628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007150395,"about_ca_system_score_gemma":0.002695064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002937252,"about_ca_topic_score_gemma":0.006909271,"domain_scores_codex":[0.9919778,0.001840447,0.0004521934,0.002127422,0.001682427,0.001919727],"domain_scores_gemma":[0.8896797,0.08567567,0.003398735,0.01265998,0.003991476,0.004594516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.004678485,0.001359232,0.01804998,0.002060212,0.000710298,0.0004829263,0.00084541,0.4844328,0.03874558,0.3021844,0.02491841,0.1215323],"study_design_scores_gemma":[0.000168731,0.0002209224,0.005168212,0.0001619419,0.000282685,0.0005877904,0.0002713964,0.6330258,0.009291183,0.344994,0.005699508,0.0001278493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3945062,0.01324931,0.4942505,0.008516044,0.001231546,0.0002564036,0.005880967,0.003537246,0.07857177],"genre_scores_gemma":[0.8479874,0.004554046,0.1300281,0.001341633,0.001265332,0.0003579477,0.003535939,0.001608797,0.009320693],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01207509,"threshold_uncertainty_score":0.05188,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01736158579766832,"score_gpt":0.2434718591512492,"score_spread":0.2261102733535809,"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."}}