{"id":"W68296954","doi":"","title":"The number of independent sets intersecting the set of leaves in trees.","year":2007,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Set (abstract data type); Combinatorics; Computer science; Programming language","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001801885,0.0006594437,0.001295495,0.004580314,0.002504769,0.00496842,0.002651226,0.002015397,0.01098063],"category_scores_gemma":[0.02059197,0.0007239784,0.0007985131,0.003258739,0.003121461,0.006447119,0.002098105,0.002205848,0.00165809],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001167238,"about_ca_system_score_gemma":0.0007199788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000563159,"about_ca_topic_score_gemma":0.0008154798,"domain_scores_codex":[0.9978022,0.0004788805,0.0002154091,0.0004932208,0.0006457355,0.0003645129],"domain_scores_gemma":[0.9768963,0.01612193,0.002255931,0.00163037,0.001237497,0.001857982],"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.001277101,0.0002260464,0.02712763,0.0008610246,0.0003487915,0.0008509678,0.001292765,0.01614556,0.01417164,0.8367772,0.02215304,0.07876819],"study_design_scores_gemma":[0.0001098721,0.0001499652,0.01526037,0.0002003291,0.0003342572,0.004508227,0.0008865106,0.04023664,0.01080211,0.9040263,0.02340035,0.00008495471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7969609,0.004824886,0.08642228,0.003014595,0.000669399,0.0001370344,0.009977594,0.0008643394,0.09712876],"genre_scores_gemma":[0.9607508,0.001728701,0.02337709,0.0002120216,0.0004512777,0.0001894899,0.003612176,0.0001928634,0.009485763],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01098063,"threshold_uncertainty_score":0.03673387,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02028516209727581,"score_gpt":0.3224003603183159,"score_spread":0.3021151982210401,"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."}}