{"id":"W1878158968","doi":"10.37236/689","title":"A New Upper Bound on the Global Defensive Alliance Number in Trees","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Upper and lower bounds; Mathematics; Alliance; Vertex (graph theory); Graph; Tree (set theory); Order (exchange); Dominating set; Discrete mathematics; Geography","routes":{"ca_aff":true,"ca_fund":false,"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.001447751,0.0001608819,0.0002121199,0.00004887985,0.0001457517,0.00007518162,0.002566726,0.00005184405,0.00003171563],"category_scores_gemma":[0.0001936488,0.00008912318,0.0001318263,0.001093774,0.0001073664,0.0003407628,0.0001732926,0.0009948029,0.00005475127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005282087,"about_ca_system_score_gemma":0.000742042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002278004,"about_ca_topic_score_gemma":0.00005362155,"domain_scores_codex":[0.9977883,0.0003593734,0.00032221,0.0001685304,0.0006213686,0.0007402414],"domain_scores_gemma":[0.9984314,0.0004002454,0.0002572123,0.0005940328,0.000211937,0.0001051361],"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.00009741267,0.00007958349,0.001944131,9.824353e-7,0.00003704879,0.000025872,0.0006714165,0.00002451405,0.00001266841,0.9952613,0.0004924225,0.001352686],"study_design_scores_gemma":[0.0005551201,0.0004427063,0.003617073,0.00002650232,0.000006792443,0.0002098396,0.0001088315,0.0001185097,0.0006061571,0.9923373,0.001869207,0.0001019222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7403447,0.005777708,0.2260836,0.008867888,0.001070161,0.0005208097,9.371795e-7,0.00005019349,0.01728399],"genre_scores_gemma":[0.9985897,0.0004550322,0.0002292367,0.0003350775,0.00004614077,0.000002887669,4.027321e-8,0.000009986926,0.0003319317],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.258245,"threshold_uncertainty_score":0.4769659,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02319584475108637,"score_gpt":0.2794500783205623,"score_spread":0.2562542335694759,"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."}}