{"id":"W2963166896","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":"article","venue":"Institutional Research Information System (Università degli Studi di Brescia)","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"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":"Mathematics; Combinatorics; Hamiltonian path; Discrete mathematics; Graph","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.001653168,0.001164892,0.00139704,0.00122026,0.002324843,0.002633765,0.001906893,0.002462329,0.01075126],"category_scores_gemma":[0.01086757,0.0009111289,0.0008852122,0.002194916,0.002899344,0.007567995,0.002203541,0.002843452,0.001046186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002477931,"about_ca_system_score_gemma":0.00218149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01046959,"about_ca_topic_score_gemma":0.009837182,"domain_scores_codex":[0.9984415,0.0005728896,0.00007114528,0.0003374266,0.0001864982,0.0003904994],"domain_scores_gemma":[0.9901849,0.007698795,0.000785194,0.0005309823,0.0003483868,0.0004517339],"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.0007304647,0.0003007411,0.001815972,0.0005364798,0.00009918901,0.0006050136,0.0008698896,0.1049556,0.002449886,0.8058431,0.02606364,0.05573001],"study_design_scores_gemma":[0.0001456989,0.00006707756,0.0004217966,0.00006261195,0.0000287207,0.0001359792,0.0003002922,0.09920245,0.0006363064,0.8935922,0.005361118,0.0000455496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5341334,0.004493785,0.3447517,0.01192048,0.0004723752,0.0005569439,0.002304813,0.0005062376,0.1008603],"genre_scores_gemma":[0.8104655,0.004857865,0.1484357,0.001473834,0.001018858,0.0005233753,0.002942251,0.0003286896,0.02995383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01075126,"threshold_uncertainty_score":0.03596652,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02751061785749115,"score_gpt":0.2363655279420002,"score_spread":0.2088549100845091,"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."}}