{"id":"W2092811992","doi":"10.1016/j.dam.2011.11.026","title":"Some bounds on global alliances in trees","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Graph; Upper and lower bounds; Offensive; Cardinality (data modeling); Simple graph; Alliance; Closed set; Simple (philosophy); Discrete mathematics; Computer science; Operations research; Data mining","routes":{"ca_aff":true,"ca_fund":true,"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.0003444672,0.0001971147,0.0002476034,0.00009426427,0.00007516221,0.0000819383,0.001286351,0.00006553769,0.0000200144],"category_scores_gemma":[0.00003179624,0.0001630964,0.00005865045,0.0005151575,0.0001453556,0.0003077323,0.000270638,0.0001625653,0.0002216221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006578412,"about_ca_system_score_gemma":0.00003448487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005350589,"about_ca_topic_score_gemma":0.00002177647,"domain_scores_codex":[0.9984227,0.00002176864,0.0003000637,0.0003852981,0.0004101901,0.0004600141],"domain_scores_gemma":[0.9988695,0.0001044552,0.00009731104,0.0008040375,0.000020194,0.000104452],"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.00001612205,0.0001320625,0.00008354291,0.00002794701,0.000009455423,0.00001362252,0.001348483,0.00002621632,0.0002161573,0.9947867,0.00004469171,0.003295031],"study_design_scores_gemma":[0.0003006967,0.00007279705,0.0008553871,0.00003629272,0.000002489915,0.000003174807,0.0002635279,0.003191046,0.002469409,0.9924613,0.0001352596,0.0002086476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1187668,0.0003211194,0.5856313,0.0003074703,0.0002906886,0.001163108,0.00002139489,0.0005919783,0.2929061],"genre_scores_gemma":[0.7713836,0.0000398853,0.2281111,0.0001735781,0.00004080702,0.0001030815,0.000002049217,0.00001807178,0.0001278769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6526167,"threshold_uncertainty_score":0.665088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04438951782124714,"score_gpt":0.302027125385454,"score_spread":0.2576376075642069,"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."}}