{"id":"W1512105312","doi":"10.1016/j.disc.2015.12.030","title":"Bounds on the maximum number of minimum dominating sets","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Mathematics; Combinatorics; Lexicographical order; Domination analysis; Dominating set; Graph; Discrete mathematics; Upper and lower bounds; 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.0105329,0.005114261,0.004089666,0.006175401,0.00282626,0.009674771,0.009147403,0.00441332,0.01408667],"category_scores_gemma":[0.07045722,0.002501433,0.002962306,0.005838804,0.005309346,0.0178647,0.008797157,0.01108058,0.002978252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006248699,"about_ca_system_score_gemma":0.002252977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008771301,"about_ca_topic_score_gemma":0.00209819,"domain_scores_codex":[0.9924617,0.002229695,0.0003575854,0.001650169,0.00206549,0.001235438],"domain_scores_gemma":[0.8800413,0.1018802,0.002943043,0.006148748,0.004323096,0.004663676],"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.003013529,0.0005532465,0.004072684,0.003874976,0.0006085621,0.0004239249,0.0009047859,0.1756926,0.01778279,0.6438011,0.04288248,0.1063892],"study_design_scores_gemma":[0.0001776473,0.0002395707,0.002106881,0.0006244145,0.0002997897,0.0006150564,0.0001858292,0.2116055,0.005209587,0.764325,0.01450354,0.0001071729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0920998,0.03206511,0.6621202,0.02808587,0.002686213,0.0003168643,0.005035794,0.00175694,0.1758333],"genre_scores_gemma":[0.6943297,0.01963663,0.2430883,0.004779112,0.005340314,0.001382425,0.003976244,0.001761055,0.02570631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01408667,"threshold_uncertainty_score":0.055704,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02807488096265937,"score_gpt":0.3196065664226326,"score_spread":0.2915316854599732,"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."}}