{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002783652,0.00009329873,0.0001452782,0.00008231101,0.0001102261,0.0000296447,0.001427043,0.00004551445,0.000004326146],"category_scores_gemma":[0.0002605904,0.00005809959,0.00006286936,0.0007273291,0.000227175,0.0001900549,0.0004968838,0.0003145207,0.00000655586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004763776,"about_ca_system_score_gemma":0.00004310241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006905146,"about_ca_topic_score_gemma":0.00015451,"domain_scores_codex":[0.9985043,0.00019107,0.0003501206,0.0001925799,0.0004346058,0.0003272939],"domain_scores_gemma":[0.997636,0.001385436,0.0001642308,0.0006618944,0.0001119799,0.00004042458],"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.00003377542,0.00004257923,0.04349001,0.000007277895,0.00001713652,0.000009029442,0.002934704,0.00002217294,0.0007064148,0.9395482,0.00004269686,0.013146],"study_design_scores_gemma":[0.0005827022,0.00006469608,0.05320343,0.00004003951,0.000001972511,0.00001363202,0.001724055,0.0006423374,0.02122531,0.9222499,0.0001571406,0.00009486017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9949954,0.0001031749,0.001469359,0.0002259689,0.0006269037,0.0001663465,8.199399e-7,0.00001795594,0.002394072],"genre_scores_gemma":[0.9995853,0.00001198079,0.0003107096,0.00001755726,0.000003302771,0.000005075794,2.112516e-7,0.000007250818,0.00005864476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02051889,"threshold_uncertainty_score":0.2651824,"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."}}