{"id":"W2322634158","doi":"10.37236/4634","title":"Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs","year":2016,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Disjoint sets; Complete bipartite graph; Cograph; Edge-transitive graph; Matching (statistics); Graph; Discrete mathematics; Robertson–Seymour theorem; Line graph; 1-planar graph; Voltage graph","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.000375316,0.0004856525,0.0003844661,0.0009626911,0.0004622749,0.0009973604,0.0004632242,0.000362988,0.004630815],"category_scores_gemma":[0.001507367,0.0005540169,0.0006622589,0.0006254587,0.0006317337,0.001508382,0.0008015671,0.0007268061,0.0007440733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005088237,"about_ca_system_score_gemma":0.0004110472,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009208662,"about_ca_topic_score_gemma":0.002056888,"domain_scores_codex":[0.9994847,0.0001169079,0.00003158118,0.0001391203,0.0001110794,0.0001166782],"domain_scores_gemma":[0.9989198,0.0003343571,0.000229017,0.0002183931,0.0001338095,0.0001645877],"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.000540018,0.000191647,0.004294639,0.0003678312,0.00009902233,0.0008474431,0.0008560476,0.05352735,0.03975427,0.8352239,0.0089872,0.05531075],"study_design_scores_gemma":[0.00008450688,0.0001169473,0.004043656,0.00006743641,0.00006627899,0.0008462967,0.0004421573,0.135336,0.01088186,0.8324594,0.01561775,0.00003769813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4821393,0.0005139449,0.4696997,0.0003920764,0.00005994634,0.0002299892,0.001779552,0.0006592215,0.0445263],"genre_scores_gemma":[0.8406243,0.0004229117,0.1390032,0.0002765284,0.00006517136,0.0002534084,0.003313338,0.0002042455,0.01583697],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004630815,"threshold_uncertainty_score":0.0154916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004331584858769278,"score_gpt":0.1863225849603992,"score_spread":0.18199100010163,"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."}}