{"id":"W2784736218","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Mathematics; Factorization; Graph; BETA (programming language); Hamiltonian path; Complete graph; Computer science; 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.0004007147,0.0003846148,0.0005111791,0.00006391122,0.00008054647,0.00008179917,0.0005076754,0.0001738311,0.00007459654],"category_scores_gemma":[0.00002459665,0.0002188673,0.0001474159,0.00008182095,0.0002438798,0.0000349797,0.0001173872,0.0003854103,0.00004299066],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002594812,"about_ca_system_score_gemma":0.00001522621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001491642,"about_ca_topic_score_gemma":0.00001963221,"domain_scores_codex":[0.9986629,0.0000626005,0.0004800482,0.0002140623,0.0003131667,0.0002672056],"domain_scores_gemma":[0.9985203,0.0002498378,0.0001908822,0.0009310776,0.00006042365,0.00004749253],"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.00008934838,0.0002878803,0.0002682339,0.02888089,0.001832037,0.00002169217,0.06731706,0.02784865,0.000344731,0.868526,0.004244293,0.0003392133],"study_design_scores_gemma":[0.0004876682,0.0003430262,0.0001428457,0.009132229,0.0003741324,0.00002898983,0.005311154,0.0633458,0.00949654,0.9091808,0.0008248202,0.001332018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9409114,0.0001390632,0.006196855,0.00003713509,0.0003015882,0.0008995695,0.000202273,0.0002910266,0.05102117],"genre_scores_gemma":[0.9976273,0.00001777331,0.001546585,0.00000871273,0.00008211912,0.0001667534,0.00003240217,0.00009390487,0.0004245172],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06200591,"threshold_uncertainty_score":0.892515,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0105022115662468,"score_gpt":0.2015890767946226,"score_spread":0.1910868652283758,"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."}}