{"id":"W2743273005","doi":"","title":"Counting the Number of Non-Equivalent Vertex Colorings of a Graph","year":2013,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Upper and lower bounds; Degree (music); Discrete mathematics; Graph; Vertex (graph theory)","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.002152889,0.0009322091,0.0009536475,0.00250785,0.001877299,0.002861903,0.002880377,0.001555885,0.005301488],"category_scores_gemma":[0.01524152,0.0005700671,0.0009448359,0.002098623,0.003471704,0.004660933,0.001496106,0.0015418,0.0004514834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001756934,"about_ca_system_score_gemma":0.0009070482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009358182,"about_ca_topic_score_gemma":0.001782231,"domain_scores_codex":[0.9965687,0.0007770308,0.0002012072,0.0009200926,0.0008651284,0.0006678592],"domain_scores_gemma":[0.9814574,0.01177671,0.002209529,0.002643227,0.0009050131,0.001008204],"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.001119253,0.0003106018,0.0411558,0.0006206897,0.000270634,0.0006831586,0.001394769,0.08258808,0.04513156,0.7220237,0.005965196,0.09873666],"study_design_scores_gemma":[0.0001343286,0.0003846911,0.01042006,0.00007674101,0.0001857902,0.001794842,0.0005179712,0.2247773,0.0273003,0.725232,0.009019401,0.0001564472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8096517,0.0004432976,0.1747135,0.0006634386,0.000120027,0.00009028699,0.0006593148,0.0004908172,0.01316764],"genre_scores_gemma":[0.9326397,0.0003307489,0.06032845,0.0001334987,0.0001220633,0.0001323172,0.000983526,0.0002679709,0.005061759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005301488,"threshold_uncertainty_score":0.01773518,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0173763702336796,"score_gpt":0.2725153298099485,"score_spread":0.2551389595762689,"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."}}