{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008193147,0.0004641748,0.0006075945,0.001467875,0.001116679,0.002023102,0.001033548,0.001189801,0.01102506],"category_scores_gemma":[0.006089066,0.0005224292,0.0008709963,0.00215403,0.0006988985,0.004601196,0.0016174,0.00188987,0.002301969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007106616,"about_ca_system_score_gemma":0.0007255494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009267896,"about_ca_topic_score_gemma":0.002539603,"domain_scores_codex":[0.9991,0.000292055,0.00006241513,0.0001681189,0.0002292749,0.0001482518],"domain_scores_gemma":[0.9973791,0.001635882,0.0001948405,0.0003578636,0.000259682,0.0001727166],"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.000167295,0.0001988706,0.002104058,0.0005827706,0.0000643579,0.0002798773,0.0004897924,0.01255459,0.004617528,0.7566311,0.04002946,0.1822803],"study_design_scores_gemma":[0.00002050691,0.00001994886,0.0005184353,0.00008663498,0.00002658741,0.0004038917,0.0001422495,0.03843344,0.001140067,0.9451784,0.01401735,0.00001238329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1114299,0.00238815,0.792665,0.002649853,0.0003423468,0.0002420632,0.00347056,0.001517965,0.08529418],"genre_scores_gemma":[0.5662253,0.002579237,0.3749011,0.001093591,0.0004677421,0.0004527299,0.009817483,0.0006212534,0.04384151],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01102506,"threshold_uncertainty_score":0.03688246,"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."}}