{"id":"W124588306","doi":"","title":"Enumeration for spanning forests of complete bipartite graphs.","year":2004,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Bipartite graph; Mathematics; Enumeration; Combinatorics; Complete bipartite graph; Spanning tree; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003918728,0.0001145634,0.0001802025,0.0001824176,0.0001551935,0.00005112287,0.0006507959,0.00004589452,0.00000204645],"category_scores_gemma":[0.0001176185,0.0001170299,0.00009427626,0.0005873008,0.00009541322,0.000501905,0.0001399825,0.00009960809,0.00001115735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003988522,"about_ca_system_score_gemma":0.00006372276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001368771,"about_ca_topic_score_gemma":0.00001054644,"domain_scores_codex":[0.9988095,0.00004508124,0.0002445803,0.0002918834,0.0002836167,0.0003253418],"domain_scores_gemma":[0.9989128,0.0001703253,0.0001148341,0.0005009754,0.0002155111,0.00008555465],"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.00001685386,0.00005591544,0.001436246,0.00001993982,0.00001383512,0.000002195207,0.000265551,0.0007557634,0.005298196,0.9907909,0.00005278792,0.001291804],"study_design_scores_gemma":[0.001168016,0.0002444228,0.003028066,0.000029913,0.000003301133,0.000002926176,0.000008625317,0.002613964,0.02067921,0.9717081,0.0003928343,0.000120663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.637719,0.0001550706,0.360019,0.0003947573,0.000828783,0.0005131451,0.000007229935,0.0001208528,0.0002421752],"genre_scores_gemma":[0.9769435,0.000005206397,0.02291075,0.00004183274,0.000004343817,0.00005361249,0.000006306378,0.00001259791,0.00002182721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3392245,"threshold_uncertainty_score":0.477234,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03077571109802385,"score_gpt":0.3004455467256993,"score_spread":0.2696698356276754,"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."}}