{"id":"W2401251957","doi":"","title":"Enumeration for no-trivial spanning forests of complete bipartite graphs.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Spanning tree; Discrete mathematics; Graph","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.0007649004,0.0004679122,0.0005941939,0.001208876,0.001394485,0.002098523,0.001396513,0.001195407,0.01134397],"category_scores_gemma":[0.007266499,0.0005566879,0.0008468651,0.001540901,0.0009599087,0.004618731,0.001876823,0.001975169,0.001985425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006522608,"about_ca_system_score_gemma":0.0007271646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008405029,"about_ca_topic_score_gemma":0.002490343,"domain_scores_codex":[0.9990453,0.0003161776,0.00006570319,0.0001811556,0.000216838,0.0001747353],"domain_scores_gemma":[0.9958636,0.00267993,0.0002742983,0.0005665042,0.0003292747,0.0002862901],"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.0002285402,0.0002535407,0.002493205,0.0006256083,0.0000642329,0.0003590412,0.0005288135,0.0113705,0.004683867,0.8211755,0.02902373,0.1291935],"study_design_scores_gemma":[0.00002185059,0.00001808312,0.0004943697,0.00005867194,0.0000243096,0.0003638496,0.0001440542,0.02966735,0.001063521,0.9615976,0.006534747,0.00001159851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.223903,0.002184919,0.6550946,0.003519106,0.0004013656,0.0002479488,0.002964093,0.001487255,0.1101977],"genre_scores_gemma":[0.7465529,0.001413006,0.2084595,0.0009338111,0.0003444836,0.0003068398,0.005737521,0.0004469848,0.0358049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01134397,"threshold_uncertainty_score":0.03794944,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02250903153387597,"score_gpt":0.2956067320429401,"score_spread":0.2730977005090641,"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."}}