{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003648107,0.0005095282,0.0004681243,0.001693542,0.0008613724,0.00130716,0.0005396566,0.0005161768,0.007176793],"category_scores_gemma":[0.00173303,0.0004858537,0.0006594502,0.001210001,0.0007764834,0.001699397,0.001151663,0.001005742,0.0007267773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001105198,"about_ca_system_score_gemma":0.0006982334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001620612,"about_ca_topic_score_gemma":0.003005439,"domain_scores_codex":[0.9995365,0.00007406038,0.00003224197,0.0001135019,0.0001085013,0.0001351243],"domain_scores_gemma":[0.9991513,0.0002801836,0.0001009599,0.0001060204,0.0001446311,0.0002168219],"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.0001297262,0.00007764353,0.001154901,0.0003371752,0.00005437057,0.0004242806,0.0005300345,0.02625,0.007147139,0.9037198,0.005275919,0.05489897],"study_design_scores_gemma":[0.00005464208,0.00004788884,0.000689947,0.0001004704,0.00003527463,0.0002660119,0.0003119804,0.05368941,0.003313432,0.917199,0.0242684,0.00002366157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4362875,0.001815359,0.4724653,0.0009794927,0.000180967,0.0004383128,0.002471091,0.0005045825,0.08485735],"genre_scores_gemma":[0.8344551,0.001313991,0.1323953,0.00041556,0.0001148373,0.0003775239,0.003953615,0.0001500707,0.02682411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007176793,"threshold_uncertainty_score":0.02400875,"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."}}