{"id":"W600271645","doi":"10.1007/s00373-015-1582-x","title":"A Cyclic Solution for an Infinite Class of Hamilton–Waterloo Problems","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Class (philosophy); Factorization; Integer (computer science); Combinatorics; Composition (language); Algorithm; 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.0006018801,0.0005982989,0.0006579066,0.0009150896,0.001963332,0.001891645,0.001644715,0.00297005,0.01449788],"category_scores_gemma":[0.005493735,0.0004495686,0.0007974861,0.00128965,0.00177872,0.002028492,0.001777379,0.002628563,0.0006500153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366247,"about_ca_system_score_gemma":0.001701697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003939308,"about_ca_topic_score_gemma":0.004763728,"domain_scores_codex":[0.9995407,0.0001345774,0.00001826078,0.000080784,0.00009700711,0.0001287105],"domain_scores_gemma":[0.9980468,0.0011938,0.0001645146,0.000163663,0.0001773339,0.0002538982],"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.00004828713,0.0000439521,0.0002057037,0.00007966639,0.0000198046,0.0001165428,0.0001553128,0.01111542,0.0008247996,0.9700631,0.008734544,0.008592913],"study_design_scores_gemma":[0.0000492636,0.00001750778,0.0001368508,0.00002545031,0.000009422713,0.000067128,0.00008991872,0.05961161,0.0003280684,0.9355957,0.004054197,0.00001493469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4301299,0.00168733,0.3094713,0.009817546,0.0006302485,0.0002533188,0.0008135948,0.0003953545,0.2468014],"genre_scores_gemma":[0.8743215,0.001014423,0.06221865,0.001441105,0.0005781068,0.000346396,0.0008617,0.0001815913,0.05903662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01449788,"threshold_uncertainty_score":0.04850024,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02871495167170536,"score_gpt":0.217056275594567,"score_spread":0.1883413239228616,"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."}}