{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384229,0.001229389,0.001476678,0.001956754,0.00144819,0.003293388,0.00176069,0.001114119,0.008286742],"category_scores_gemma":[0.006256461,0.0005615724,0.0009974365,0.00187273,0.001601499,0.007657384,0.00298276,0.003124281,0.001385152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001506781,"about_ca_system_score_gemma":0.0006098618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003884601,"about_ca_topic_score_gemma":0.001079327,"domain_scores_codex":[0.9986275,0.0002079035,0.00008729891,0.0003385502,0.0003910383,0.000347643],"domain_scores_gemma":[0.9919354,0.005158802,0.0005495518,0.0007962643,0.0005329223,0.001027175],"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.0009501892,0.0003260678,0.008326466,0.001459017,0.0002318672,0.0007180214,0.001472586,0.1355873,0.07015567,0.645713,0.02224167,0.1128181],"study_design_scores_gemma":[0.0000868034,0.0006957729,0.006809189,0.0002896873,0.0003587266,0.002788259,0.0007194213,0.2772856,0.0229901,0.6355175,0.05229867,0.000160197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.27623,0.007334684,0.5933474,0.002537065,0.0003652181,0.0002242983,0.00242296,0.0007698366,0.1167686],"genre_scores_gemma":[0.8385584,0.004593737,0.1359417,0.0005896678,0.000501379,0.0003365807,0.001644438,0.000314911,0.01751916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008286742,"threshold_uncertainty_score":0.02772194,"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."}}