{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007889363,0.0001122746,0.0001952744,0.00004882871,0.0003076987,0.0001323389,0.0008163924,0.00006764025,0.00001102728],"category_scores_gemma":[0.00007631312,0.0000788247,0.0001169572,0.0003454509,0.0001116211,0.0001874788,0.0001504391,0.0002250306,0.00002315447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009859631,"about_ca_system_score_gemma":0.00003187473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000133116,"about_ca_topic_score_gemma":0.0001527603,"domain_scores_codex":[0.998844,0.0001584515,0.000296753,0.0002302,0.0002230563,0.0002475485],"domain_scores_gemma":[0.9984403,0.0003606355,0.0001736187,0.0007647563,0.0001906447,0.00007003805],"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.00000532945,0.0000295642,0.001596428,0.000003100432,0.00002042298,0.000001293633,0.0001229336,0.000009665198,0.006774751,0.9880568,0.0024431,0.0009366201],"study_design_scores_gemma":[0.0009811789,0.0001410646,0.006853165,0.00001552916,0.000006972952,0.00002688951,0.00002289083,0.04403117,0.005636231,0.8900211,0.05202245,0.0002413541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9811924,0.00007670245,0.002891007,0.0005498268,0.01254097,0.0001744906,0.000001877643,0.00009652757,0.002476169],"genre_scores_gemma":[0.9993388,0.000009450341,0.0003858367,0.00007959222,0.00001811352,0.00001962966,7.108645e-7,0.000007208412,0.0001406811],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09803569,"threshold_uncertainty_score":0.3214378,"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."}}