{"id":"W2043898581","doi":"10.1002/jcd.20219","title":"The Hamilton–Waterloo problem for cycle sizes 3 and 4","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Catania; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Hamiltonian path; Graph; Resolution (logic); Class (philosophy); Complete graph; Decomposition; Computer science; Artificial intelligence","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.0008696222,0.0004257855,0.0005823378,0.00077396,0.00117101,0.001593692,0.001219864,0.001384086,0.01007234],"category_scores_gemma":[0.004588642,0.0004670419,0.0008683702,0.0006920363,0.001129844,0.002076159,0.001039303,0.001330162,0.0006219486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000879439,"about_ca_system_score_gemma":0.001310744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005614826,"about_ca_topic_score_gemma":0.00737522,"domain_scores_codex":[0.9989297,0.0002988975,0.00005038698,0.0001970658,0.0002186107,0.0003053668],"domain_scores_gemma":[0.9968659,0.002111671,0.000300184,0.0003537963,0.0001748309,0.0001936472],"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.0006270531,0.0001773008,0.001905758,0.000289362,0.0001132353,0.0004973849,0.0006094099,0.0811877,0.009339434,0.7920896,0.0133627,0.09980112],"study_design_scores_gemma":[0.0002241449,0.0001050208,0.0006918974,0.00006679116,0.0000479183,0.0002894718,0.00040123,0.1337573,0.007307251,0.8429133,0.0141402,0.00005546225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5462817,0.00100323,0.3596862,0.002288569,0.00011202,0.0004074415,0.001000172,0.0003624048,0.08885828],"genre_scores_gemma":[0.8813098,0.0004752278,0.09726671,0.0003799602,0.00008981453,0.0002036183,0.0007000819,0.0001023401,0.01947251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01007234,"threshold_uncertainty_score":0.03369534,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00926922698022215,"score_gpt":0.2136291923050667,"score_spread":0.2043599653248446,"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."}}