{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874043,0.0001198688,0.0001832546,0.000112896,0.00004752275,0.00002295276,0.00009249493,0.00009563648,4.603923e-7],"category_scores_gemma":[0.000006553062,0.0001127056,0.00005184654,0.0002244236,0.0000411485,0.0001378176,0.000010198,0.00006867525,0.000001078024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000127187,"about_ca_system_score_gemma":0.000007552122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002672458,"about_ca_topic_score_gemma":0.00001354183,"domain_scores_codex":[0.9993542,0.00002715829,0.0002106328,0.0001187141,0.0001027147,0.0001865152],"domain_scores_gemma":[0.9995674,0.00002162848,0.00004139723,0.0001709665,0.00007905963,0.0001195583],"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.00005790232,0.0002129522,0.008264726,0.0008365256,0.0001209111,0.000001485266,0.006626785,0.001200023,0.009389856,0.9677725,0.001613783,0.003902573],"study_design_scores_gemma":[0.002530772,0.001058607,0.001245487,0.00008776476,0.00006137291,0.0000151245,0.000677488,0.03296766,0.003181729,0.939886,0.01781827,0.0004697387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9952495,0.000873383,0.001557,0.000006455659,0.000642199,0.0002785277,0.00001446151,0.0001481833,0.001230343],"genre_scores_gemma":[0.9996976,0.00006588695,0.00006213949,0.000007861458,0.00001207175,0.00005721427,0.00001526518,0.00002021681,0.00006172874],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03176764,"threshold_uncertainty_score":0.4596001,"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."}}