{"id":"W4412582201","doi":"10.55016/ojs/cdm.v12i2.62550","title":"Bounds for the m -Eternal Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"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.002085415,0.001242862,0.001117671,0.002699649,0.001533261,0.002505842,0.002761835,0.001091635,0.008969643],"category_scores_gemma":[0.01253871,0.000604576,0.001052227,0.001725241,0.002805882,0.005820076,0.002698517,0.003128778,0.001123496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003342691,"about_ca_system_score_gemma":0.001170703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002227046,"about_ca_topic_score_gemma":0.004155265,"domain_scores_codex":[0.9981813,0.0002642704,0.00008068798,0.0004906028,0.0004096334,0.0005734536],"domain_scores_gemma":[0.9820869,0.01298906,0.001083454,0.00167643,0.0007535563,0.001410572],"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.001969711,0.0004329869,0.01852458,0.001109835,0.0003033968,0.0006984979,0.0009821171,0.1703721,0.04403918,0.6422429,0.02229464,0.09703007],"study_design_scores_gemma":[0.0001082181,0.0002671001,0.009809924,0.0002342915,0.000172499,0.001012134,0.0002138422,0.3437919,0.0144202,0.6085564,0.02126844,0.0001449674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5110115,0.008432386,0.2920738,0.01017872,0.0003770775,0.0001832317,0.004263767,0.001433622,0.1720458],"genre_scores_gemma":[0.9417681,0.002260133,0.04151628,0.000678806,0.0003935786,0.0001970435,0.0009970829,0.0002543666,0.01193465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008969643,"threshold_uncertainty_score":0.03000641,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02591874329974248,"score_gpt":0.3828073789562483,"score_spread":0.3568886356565059,"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."}}