{"id":"W2245479836","doi":"10.1016/j.dam.2016.06.025","title":"A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"Fédération Wallonie-Bruxelles; Polytechnique Montréal","keywords":"Combinatorics; Mathematics; Partition (number theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.003613842,0.001968371,0.001411718,0.0006125427,0.001785141,0.001243456,0.003652028,0.002304099,0.0005285735],"category_scores_gemma":[0.001178995,0.00211632,0.002232635,0.001813766,0.003090961,0.001413494,0.003834478,0.001912099,0.001587004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005374529,"about_ca_system_score_gemma":0.001338751,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006856855,"about_ca_topic_score_gemma":0.0002404936,"domain_scores_codex":[0.9857366,0.0002876137,0.004029134,0.002868734,0.004122195,0.002955699],"domain_scores_gemma":[0.9862037,0.002879661,0.00471827,0.004469979,0.0005535354,0.001174869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001569239,0.001447648,0.00002129115,0.003418881,0.002005934,0.00036394,0.003946798,0.000871818,0.01131916,0.9705694,0.003207806,0.001258097],"study_design_scores_gemma":[0.004642693,0.002416747,0.00007301786,0.005048214,0.002353214,0.0008441667,0.002152422,0.8555369,0.09767289,0.02511257,0.001665805,0.002481322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9808844,0.0007725614,0.004955602,0.0006847407,0.001746435,0.0004016066,0.001030104,0.0003593266,0.009165189],"genre_scores_gemma":[0.9757752,0.001366746,0.01873269,0.001105429,0.0004487748,0.001156807,0.0003990611,0.000784878,0.0002304068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9454568,"threshold_uncertainty_score":0.9997934,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02050798474540309,"score_gpt":0.2445616787994044,"score_spread":0.2240536940540013,"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."}}