{"id":"W2892600074","doi":"10.1002/jcd.21792","title":"Resolvable cycle decompositions of complete multigraphs and complete equipartite multigraphs via layering and detachment","year":2021,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Security Agency","keywords":"Combinatorics; Matching (statistics); Mathematics; Multigraph; Variable (mathematics); Vertex (graph theory); Graph; Mathematical analysis","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008705584,0.000420929,0.00115738,0.0004421278,0.0001558567,0.0001695797,0.000319668,0.0002882539,0.00001676937],"category_scores_gemma":[0.00003718871,0.0004364748,0.0003585492,0.0002251977,0.000160034,0.0002168742,0.0002255689,0.0008196443,7.739524e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000584769,"about_ca_system_score_gemma":0.00005135412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005909236,"about_ca_topic_score_gemma":0.00001469251,"domain_scores_codex":[0.9973554,0.0003344813,0.001251889,0.0002766989,0.0004228177,0.0003586945],"domain_scores_gemma":[0.998087,0.0003389048,0.000593858,0.0003736976,0.000312662,0.0002938877],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005719726,0.0006514405,0.005261087,0.003993355,0.003423963,0.0003530229,0.004776043,0.08162046,0.8806732,0.01668325,0.0003617782,0.001630411],"study_design_scores_gemma":[0.03678258,0.004863414,0.05847688,0.02267533,0.005146635,0.003801595,0.004002765,0.3565378,0.1496974,0.3425332,0.007682195,0.00780017],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9635507,0.007676791,0.02300485,0.00002515992,0.004958993,0.0004232353,0.00007109267,0.00006153315,0.0002276865],"genre_scores_gemma":[0.9948389,0.0005794615,0.004281479,0.000009321446,0.0002078082,0.00001637942,0.00001214925,0.00005171175,0.000002797558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7309758,"threshold_uncertainty_score":0.9998087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02493946873722629,"score_gpt":0.2431952486385966,"score_spread":0.2182557799013703,"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."}}