{"id":"W4399739735","doi":"10.1002/jgt.23143","title":"A tight upper bound on the average order of dominating sets of a graph","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Prince Edward Island; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Order (exchange); 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455749,0.001098421,0.00202242,0.003244033,0.001798399,0.005605194,0.002817346,0.001509379,0.005219829],"category_scores_gemma":[0.01667143,0.0009744304,0.0008265899,0.003394361,0.00209221,0.007975671,0.001878057,0.002595522,0.0006233199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002750678,"about_ca_system_score_gemma":0.0007654804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001846777,"about_ca_topic_score_gemma":0.002337577,"domain_scores_codex":[0.9972847,0.0003345619,0.0001273983,0.0008412366,0.0007307671,0.0006813357],"domain_scores_gemma":[0.9754694,0.01655481,0.001558109,0.002620799,0.001891634,0.001905365],"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.001983383,0.0004129008,0.03130303,0.0009204811,0.0003510167,0.0005302343,0.001076357,0.3112169,0.04893289,0.5139715,0.0134313,0.07587004],"study_design_scores_gemma":[0.00005496234,0.0002913945,0.009596643,0.0001383449,0.0001299182,0.0007504309,0.0003437516,0.5244259,0.01765298,0.435945,0.01057335,0.00009732738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.618271,0.00461026,0.3331556,0.002211669,0.0002727109,0.00006528175,0.003282598,0.001401852,0.036729],"genre_scores_gemma":[0.9730687,0.000940005,0.0226446,0.0002125083,0.000226936,0.0000359687,0.0008323989,0.0001787983,0.001860182],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005605194,"threshold_uncertainty_score":0.01995766,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01648931936099883,"score_gpt":0.2957467529953223,"score_spread":0.2792574336343235,"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."}}