{"id":"W3130171556","doi":"10.37236/8219","title":"Cycle Decompositions of Complete Digraphs","year":2021,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; BETA (programming language); Graph; Decomposition; Complete graph; Alpha (finance); Discrete mathematics; Computer science; Statistics","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.0004137846,0.00008825996,0.0002242097,0.00006919814,0.00006846854,0.00001426648,0.0002579432,0.00003592265,0.00001457349],"category_scores_gemma":[0.00001531179,0.00006815614,0.000170747,0.0004124554,0.00003817291,0.00007203485,0.00001462632,0.0003760909,0.000003334282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006492099,"about_ca_system_score_gemma":0.00008411839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001077588,"about_ca_topic_score_gemma":0.000003064003,"domain_scores_codex":[0.9990542,0.0001026796,0.0003534967,0.00004206903,0.0001890387,0.0002585333],"domain_scores_gemma":[0.9993793,0.0001337829,0.0001259162,0.0001921414,0.0001257241,0.00004316546],"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.00001207643,0.00007440092,0.0001151883,0.00002895981,0.0002478956,0.00001138124,0.0002476838,0.003002581,0.01549709,0.9801521,0.0004373509,0.0001732513],"study_design_scores_gemma":[0.0007071706,0.0002099571,0.0004145914,0.00005929313,0.0001073821,0.0006700225,0.0002822629,0.0007616206,0.02724647,0.9586464,0.01075672,0.0001381263],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9682151,0.01428813,0.01263648,0.0001952472,0.0008183346,0.00005605635,0.000003719498,0.00002964107,0.003757258],"genre_scores_gemma":[0.9992725,0.0006145667,0.000008269099,0.00001622282,0.0000378107,0.000001024399,0.000001092117,0.00001447341,0.00003401917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03105739,"threshold_uncertainty_score":0.2779326,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004021153063682866,"score_gpt":0.1846072796983089,"score_spread":0.180586126634626,"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."}}