{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008669215,0.0001474415,0.0003053317,0.0002128451,0.00009537551,0.00001291187,0.0004925059,0.0000566049,0.00001603908],"category_scores_gemma":[0.00001951334,0.00008585407,0.0002362101,0.0005018586,0.0001230913,0.0001503524,0.00001980013,0.0002753482,0.000007596361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001053886,"about_ca_system_score_gemma":0.00005892329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000306103,"about_ca_topic_score_gemma":0.000005553842,"domain_scores_codex":[0.9986086,0.0001420475,0.0005212515,0.00006730106,0.0002731655,0.0003875633],"domain_scores_gemma":[0.9990288,0.000206965,0.0002239086,0.0002959528,0.000168597,0.00007580385],"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.00003101347,0.00004634907,0.000397944,0.00002793371,0.0002478306,0.000002719685,0.0002007798,0.0002111709,0.06417644,0.9338657,0.0003486748,0.0004433974],"study_design_scores_gemma":[0.0007891192,0.0003366461,0.0004135859,0.0001104271,0.00008406172,0.0001355517,0.0000705133,0.00008930179,0.02372713,0.9691725,0.004934395,0.0001367507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9656281,0.008473733,0.02426722,0.0002856918,0.0007377708,0.0001125522,0.000004126525,0.00004451764,0.0004462655],"genre_scores_gemma":[0.998944,0.0009394971,0.00001072771,0.000009797787,0.00003666912,0.000003224485,4.940925e-7,0.00002413416,0.00003139928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04044931,"threshold_uncertainty_score":0.3501027,"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."}}