{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008218156,0.0001591782,0.0002567881,0.00006306518,0.0003353791,0.0002249191,0.0006087715,0.00007638576,0.00002743106],"category_scores_gemma":[0.00004990376,0.00008935745,0.0001086411,0.00004954447,0.0000761649,0.0002676793,0.0000130801,0.0003667133,0.00002639128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004022994,"about_ca_system_score_gemma":0.00002813419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005789816,"about_ca_topic_score_gemma":0.000001930519,"domain_scores_codex":[0.998973,0.0001085033,0.0003065297,0.00007504906,0.000326119,0.000210824],"domain_scores_gemma":[0.9989623,0.0001739447,0.0002557822,0.0004097772,0.0001067876,0.0000913687],"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.0007725563,0.000245427,0.0005413423,0.0001124209,0.0006271621,0.0002338157,0.002541414,0.007664295,0.01210326,0.9626077,0.01117217,0.001378411],"study_design_scores_gemma":[0.008569652,0.004378218,0.00287705,0.001378342,0.0002589751,0.0004682532,0.0005531573,0.001572706,0.06256067,0.8909826,0.02539204,0.001008388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9794473,0.00009125084,0.0008745456,0.000192686,0.005076333,0.0002322728,0.000002046138,0.00004707157,0.01403648],"genre_scores_gemma":[0.9992483,0.0000181611,0.00006979669,0.00001810682,0.0004765966,0.000006167325,1.604617e-7,0.00003066806,0.0001320798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07162518,"threshold_uncertainty_score":0.3643891,"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."}}