{"id":"W2962898528","doi":"","title":"The generalized connectivity of complete bipartite graphs","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Spanning tree; Bipartite graph; Disjoint sets; Graph; Integer (computer science); Discrete mathematics; Computer science","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.0004855699,0.0004818874,0.0005568314,0.001809537,0.0008039672,0.001469027,0.0007632239,0.0006424718,0.002486405],"category_scores_gemma":[0.004034585,0.0003992024,0.0003986016,0.001931926,0.001332517,0.002760362,0.001076039,0.0006825995,0.0001516838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000930895,"about_ca_system_score_gemma":0.0003679715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001210563,"about_ca_topic_score_gemma":0.001263512,"domain_scores_codex":[0.9991996,0.0002082508,0.00004180648,0.0002336317,0.0001755714,0.0001411943],"domain_scores_gemma":[0.997466,0.001177269,0.0005456753,0.0002767741,0.0002925498,0.0002418124],"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.0004726766,0.00007280072,0.01136215,0.0006777667,0.0001612852,0.0008857904,0.001562201,0.07032985,0.01515779,0.8127879,0.009810626,0.07671926],"study_design_scores_gemma":[0.00008677022,0.0001206189,0.01470634,0.0001512395,0.0001048166,0.001866217,0.000590253,0.2005226,0.003632528,0.7517391,0.02641618,0.00006330911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8137069,0.002432347,0.1421834,0.001094293,0.00008397223,0.0001235619,0.002348541,0.0003012391,0.03772567],"genre_scores_gemma":[0.9734563,0.001435126,0.02097793,0.000163476,0.0002007099,0.0001995146,0.001453888,0.00004691475,0.002066061],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002486405,"threshold_uncertainty_score":0.008317888,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01519056727110667,"score_gpt":0.2369342640556601,"score_spread":0.2217436967845535,"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."}}