{"id":"W1601784190","doi":"10.1002/jgt.21806","title":"Bipartite 2‐Factorizations of Complete Multipartite Graphs","year":2014,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Multipartite; Mathematics; Combinatorics; Bipartite graph; Factorization; Complete bipartite graph; Discrete mathematics; Disjoint sets; Graph; Edge-transitive graph; Line graph; Graph power; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007000177,0.0006449484,0.0005848765,0.001259449,0.001037033,0.001404287,0.0003791645,0.000540925,0.008608459],"category_scores_gemma":[0.002127165,0.0005219023,0.000777599,0.0006985082,0.0009526722,0.001802001,0.0009563644,0.0007875706,0.001076646],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006217986,"about_ca_system_score_gemma":0.0004009618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001576396,"about_ca_topic_score_gemma":0.001861293,"domain_scores_codex":[0.9991197,0.0002189275,0.00004289683,0.0001977278,0.0001781782,0.0002425545],"domain_scores_gemma":[0.9981632,0.0006219682,0.0003355167,0.0002944803,0.0002668328,0.0003181314],"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.0006832396,0.0001819361,0.002336343,0.0002467622,0.00007051848,0.0007974062,0.001155186,0.05275553,0.02204309,0.88124,0.008472587,0.03001735],"study_design_scores_gemma":[0.00007183648,0.000139802,0.001744454,0.00007552129,0.00002731207,0.0005214727,0.0003558769,0.1075472,0.004338941,0.8709825,0.0141316,0.00006366229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6254746,0.0008093484,0.3322826,0.0005413707,0.0001281933,0.0002184168,0.001414384,0.0005319601,0.03859905],"genre_scores_gemma":[0.9412321,0.0002879876,0.04785178,0.0001672645,0.00008401354,0.0001388686,0.0009071421,0.0001200225,0.009210642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008608459,"threshold_uncertainty_score":0.02879816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009481002985737785,"score_gpt":0.1954505032521271,"score_spread":0.1859695002663893,"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."}}