{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009638162,0.0001184447,0.0001813435,0.0001911685,0.0001429342,0.00004708641,0.0006034536,0.0000563658,0.000003042643],"category_scores_gemma":[0.00002984734,0.00006911547,0.00009569526,0.002286942,0.0001495778,0.00006990712,0.0001588412,0.0001697985,0.000005743218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000614182,"about_ca_system_score_gemma":0.00002557647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008119227,"about_ca_topic_score_gemma":0.000002773962,"domain_scores_codex":[0.9988142,0.00008429516,0.000265986,0.000218651,0.0003904131,0.0002265102],"domain_scores_gemma":[0.9989654,0.0003422042,0.0001175307,0.0004601384,0.00007769341,0.00003704408],"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.00000656023,0.0001166337,0.0192116,0.00002296231,0.00001217542,0.000005581512,0.00132304,0.00003297353,0.0001107383,0.978023,0.001013474,0.0001212357],"study_design_scores_gemma":[0.000512026,0.0002469303,0.03255441,0.00005787666,0.000007578756,0.000005025139,0.0003006778,0.001143793,0.0006394684,0.9639385,0.0004812235,0.0001124557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9959523,0.00007375872,0.00004249506,0.001072979,0.0002418545,0.0001825576,0.000002259201,0.00003509342,0.002396666],"genre_scores_gemma":[0.9993611,0.000230809,0.00004245557,0.0002544719,7.289245e-7,0.0000286597,8.54055e-7,0.000005526515,0.00007541672],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01408448,"threshold_uncertainty_score":0.2818447,"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."}}