{"id":"W154300135","doi":"","title":"Some Bounds on Alliances in Trees.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Dominating set; Mathematics; Cardinality (data modeling); Graph; Simple graph; Alliance; Offensive; Upper and lower bounds; Simple (philosophy); Discrete mathematics; Computer science; Data mining","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.005744938,0.002177378,0.002431536,0.004069531,0.003466296,0.00638512,0.003691952,0.003066906,0.01845473],"category_scores_gemma":[0.03809096,0.001215727,0.002461664,0.006178228,0.003665953,0.01826881,0.005370378,0.007557742,0.002872628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0035359,"about_ca_system_score_gemma":0.0009175398,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009396529,"about_ca_topic_score_gemma":0.001515795,"domain_scores_codex":[0.9949522,0.001485417,0.0003015742,0.0009113607,0.001227121,0.001122271],"domain_scores_gemma":[0.9569749,0.03264196,0.002861125,0.002480361,0.001918948,0.003122743],"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.0004184156,0.0001831933,0.002972568,0.0009149406,0.0001640938,0.0002262441,0.001044929,0.03243377,0.00331371,0.8892186,0.01990875,0.0492009],"study_design_scores_gemma":[0.00005529851,0.0001470748,0.002030311,0.0002863261,0.0001633151,0.0006768357,0.0003615907,0.04727397,0.001436122,0.9251447,0.02237195,0.00005246489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1606058,0.03670339,0.5171904,0.01302519,0.001319949,0.0003734441,0.005784849,0.001005376,0.2639917],"genre_scores_gemma":[0.8079404,0.02536166,0.132241,0.002332814,0.002850103,0.001107687,0.004318444,0.000909186,0.02293864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01845473,"threshold_uncertainty_score":0.06173724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01303673254637098,"score_gpt":0.2734150912754956,"score_spread":0.2603783587291246,"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."}}