{"id":"W2920329972","doi":"","title":"A New Lower Bound on the Total Domination Number of a Tree.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Domination analysis; Combinatorics; Upper and lower bounds; Mathematical analysis; Graph","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004436969,0.0001034107,0.000116839,0.00006082696,0.0001379989,0.00007087985,0.0008088671,0.00004546903,0.0001241749],"category_scores_gemma":[0.0001702599,0.00007469809,0.00006409777,0.0006024448,0.0001774239,0.0002826515,0.0002184269,0.0001420445,0.0002826721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004185613,"about_ca_system_score_gemma":0.00008584785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001516358,"about_ca_topic_score_gemma":0.000003042087,"domain_scores_codex":[0.9987975,0.0001224068,0.0001548294,0.0002517442,0.0004303341,0.0002431259],"domain_scores_gemma":[0.9985825,0.0003609391,0.00007846578,0.0007270897,0.0001730217,0.00007796236],"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.00003819549,0.00006914144,0.0001136537,0.000001791506,0.00001135401,0.000002893664,0.0003658724,0.000001165789,0.0008062717,0.9880754,0.002578141,0.00793617],"study_design_scores_gemma":[0.0005411952,0.0003120115,0.001908359,0.00001827132,0.000002269498,0.000008036605,0.00001639483,0.001127884,0.01075023,0.9844219,0.0007992512,0.00009416561],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9529224,0.00001869654,0.01402926,0.001402624,0.001965687,0.0002798367,8.438623e-7,0.00007219234,0.02930848],"genre_scores_gemma":[0.9957754,0.000001591837,0.001867589,0.00008352134,0.00002152252,0.000009865883,3.439353e-7,0.000009373302,0.002230766],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04285305,"threshold_uncertainty_score":0.3633272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0152070450812571,"score_gpt":0.2931586158511737,"score_spread":0.2779515707699166,"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."}}