{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005154473,0.000225097,0.0002553352,0.0004532561,0.0002427673,0.0002315632,0.0006519455,0.0002041734,0.00001823267],"category_scores_gemma":[0.000194374,0.0002109097,0.00006457492,0.001100814,0.0002094792,0.0005918132,0.0001595087,0.0006281949,0.000007802343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003682418,"about_ca_system_score_gemma":0.00004899857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004272693,"about_ca_topic_score_gemma":0.00002392968,"domain_scores_codex":[0.9981943,0.0001398826,0.0002753818,0.0006024162,0.0003673294,0.000420721],"domain_scores_gemma":[0.9987589,0.0003734172,0.0001144937,0.0005078143,0.00009493212,0.0001504764],"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.000199199,0.0003123545,0.0006975511,0.000004169421,0.000009380961,0.00001349987,0.00009051659,0.02101923,0.0001265902,0.9698018,0.00023051,0.007495192],"study_design_scores_gemma":[0.004612739,0.001271143,0.003436728,0.0001099846,0.000008523632,0.000005088675,0.00005510034,0.1602346,0.0005198869,0.8264314,0.002681448,0.0006333479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8764055,0.001200394,0.06977966,0.00726132,0.03372876,0.002770569,0.00001239824,0.001029412,0.007811923],"genre_scores_gemma":[0.9935045,0.0006983875,0.004948647,0.0003666267,0.0001315939,0.00009128008,0.00001104837,0.00002143393,0.0002264308],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1433704,"threshold_uncertainty_score":0.8600646,"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."}}