{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004877963,0.0001852191,0.0003616564,0.0007880866,0.0001369083,0.000104155,0.001445742,0.00007017438,0.00009902564],"category_scores_gemma":[0.0004527589,0.0001003134,0.0004452418,0.001848588,0.0004003113,0.0004989637,0.0002002024,0.0006933884,0.000006341074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002906008,"about_ca_system_score_gemma":0.0001448552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001637671,"about_ca_topic_score_gemma":0.000001277707,"domain_scores_codex":[0.9971876,0.0007456185,0.000666886,0.0002285189,0.0008553468,0.0003159909],"domain_scores_gemma":[0.9955133,0.00300135,0.000425467,0.000513975,0.0004468166,0.00009907798],"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.0002122499,0.0001266834,0.00011555,0.00008996578,0.0002499109,0.000112258,0.00216714,0.0001862369,0.01723556,0.9527295,0.0003042886,0.02647066],"study_design_scores_gemma":[0.0003435784,0.0005076968,0.0005153447,0.0005771522,0.00002510056,0.000167547,0.0002376722,0.0009269977,0.02028437,0.9756257,0.0006525923,0.0001362691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.828029,0.004297855,0.1613744,0.001454832,0.0007587729,0.000299247,0.00001543211,0.00004111477,0.003729285],"genre_scores_gemma":[0.9954352,0.0001667577,0.004039452,0.0001388214,0.0000515342,0.000004309925,2.724713e-7,0.00001548855,0.0001481193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1674062,"threshold_uncertainty_score":0.4090661,"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."}}