{"id":"W2761333931","doi":"10.1002/jcd.21586","title":"On the Hamilton–Waterloo problem with odd cycle lengths","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Lexicographical order; Graph; Graph factorization; Complete graph; Factorization; Hamiltonian path; Discrete mathematics; Line graph; Graph power; Algorithm","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.0009345285,0.0007295499,0.00086571,0.0007365065,0.001313795,0.00181803,0.001148284,0.001475911,0.01131953],"category_scores_gemma":[0.005830382,0.00053316,0.0005944477,0.001007444,0.001318002,0.004267904,0.001440306,0.001327796,0.0009385782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445971,"about_ca_system_score_gemma":0.001395043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006544964,"about_ca_topic_score_gemma":0.006838325,"domain_scores_codex":[0.9990963,0.0002927135,0.00003999276,0.0001694622,0.0001301256,0.0002713238],"domain_scores_gemma":[0.9967532,0.002240461,0.0002909473,0.000244051,0.0002104065,0.0002608925],"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.0008165,0.0002704848,0.00160751,0.0005029711,0.00007481476,0.0006506782,0.0006301125,0.113391,0.00565664,0.7770193,0.02787993,0.07150008],"study_design_scores_gemma":[0.000150731,0.0001068015,0.0004175612,0.00008776747,0.00002931479,0.0002158829,0.0003556373,0.1608251,0.00196784,0.8263129,0.0094818,0.00004867951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5677091,0.001885866,0.3340388,0.004884493,0.0002957281,0.000486858,0.001985575,0.0004458356,0.08826768],"genre_scores_gemma":[0.8574541,0.001577017,0.117927,0.0007847427,0.0002949743,0.0003051466,0.001561966,0.0001646653,0.01993026],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01131953,"threshold_uncertainty_score":0.03786755,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01419316015051537,"score_gpt":0.2110433987292366,"score_spread":0.1968502385787212,"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."}}