{"id":"W2573525493","doi":"","title":"Upper bound on the diameter of a total domination vertex critical graph.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Upper and lower bounds; Graph; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001183831,0.001381509,0.001500363,0.003249972,0.001853486,0.003161567,0.002210504,0.001269969,0.0116441],"category_scores_gemma":[0.01077736,0.0006195637,0.0008010471,0.001684744,0.001845937,0.003557364,0.003045237,0.002559703,0.001746145],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002252242,"about_ca_system_score_gemma":0.0008555207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00148604,"about_ca_topic_score_gemma":0.002527538,"domain_scores_codex":[0.9990913,0.0001397504,0.0000319745,0.0002182769,0.0002561942,0.0002625994],"domain_scores_gemma":[0.9863063,0.009955593,0.0005380678,0.000840504,0.0009081414,0.00145137],"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.001105616,0.0002385675,0.005933555,0.001433728,0.0002819111,0.0008057115,0.0009878592,0.05534196,0.04490629,0.7592381,0.06821394,0.06151275],"study_design_scores_gemma":[0.0001123567,0.0002252496,0.006073973,0.000375883,0.0003211724,0.001826379,0.0004187504,0.166524,0.01531904,0.75837,0.05034265,0.00009042079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3513368,0.01767243,0.2993039,0.009125399,0.001474391,0.0002849764,0.005937128,0.00240671,0.3124582],"genre_scores_gemma":[0.9200442,0.00521746,0.04966455,0.001168375,0.001125526,0.0002883448,0.001963218,0.000523269,0.02000504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0116441,"threshold_uncertainty_score":0.03895336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01629713636731867,"score_gpt":0.2845714168881815,"score_spread":0.2682742805208629,"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."}}