{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007044816,0.00009755187,0.0001856341,0.00004189075,0.0001386425,0.0000949692,0.0001545273,0.00005816222,0.000001317348],"category_scores_gemma":[0.00002991253,0.00006324804,0.00008929809,0.00006494809,0.00002641219,0.0001385024,0.000003312724,0.0001241672,0.000001140808],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001977763,"about_ca_system_score_gemma":0.00001306933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.571677e-7,"about_ca_topic_score_gemma":3.781988e-7,"domain_scores_codex":[0.9992803,0.00005302627,0.0003187204,0.00004821285,0.0001286123,0.000171121],"domain_scores_gemma":[0.9994418,0.0002209989,0.00009162221,0.00008598986,0.00008669226,0.00007287351],"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.001165125,0.0002194696,0.000192381,0.0002077447,0.0004937449,0.00003901371,0.0043365,0.003611058,0.1100602,0.8241971,0.02007381,0.03540386],"study_design_scores_gemma":[0.002576047,0.001324741,0.0004150596,0.00009702628,0.00006297335,0.000100011,0.0001847362,0.0009726163,0.01417144,0.9344632,0.04542323,0.0002089375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9772218,0.003779286,0.007102338,0.0003745697,0.008732831,0.0006055639,0.000004062653,0.00009437827,0.002085137],"genre_scores_gemma":[0.9990303,0.0001198171,0.0003004745,0.0000139045,0.000452489,0.000004229576,1.816581e-7,0.00001191653,0.00006669921],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.110266,"threshold_uncertainty_score":0.2579181,"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."}}