{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009811132,0.002943927,0.006344751,0.007925462,0.006268099,0.01218918,0.008737802,0.005124908,0.03195368],"category_scores_gemma":[0.0560206,0.002874273,0.004010128,0.01318266,0.00955795,0.03816282,0.01324631,0.01970248,0.003532267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005161638,"about_ca_system_score_gemma":0.002010229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001767887,"about_ca_topic_score_gemma":0.002935241,"domain_scores_codex":[0.9946234,0.001615829,0.0003062443,0.0009854413,0.001239167,0.001229852],"domain_scores_gemma":[0.8711656,0.1046935,0.004118809,0.006008047,0.00380268,0.01021129],"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.0001918997,0.00009732713,0.0007268477,0.0003250763,0.00006855889,0.00008205331,0.000891869,0.008576219,0.0005601275,0.968142,0.008295749,0.01204232],"study_design_scores_gemma":[0.00003427672,0.00003783113,0.0004402137,0.0001069509,0.00009025908,0.0001002823,0.0002430086,0.01631145,0.0002394815,0.9791273,0.003239083,0.00002977632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1984201,0.01723779,0.4721415,0.02158656,0.001008315,0.0003710771,0.003987791,0.001330559,0.2839162],"genre_scores_gemma":[0.8534454,0.01421048,0.0775249,0.003423565,0.002650221,0.001087601,0.002670702,0.001252065,0.04373511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03195368,"threshold_uncertainty_score":0.1068957,"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."}}