{"id":"W2788555957","doi":"10.1609/aaai.v32i1.12076","title":"A Recursive Algorithm to Generate Balanced Weekend Tournaments","year":2018,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; League; Schedule; Corollary; Scheduling (production processes); Computer science; Directed graph; Hamiltonian path; Simple (philosophy); Mathematics; Graph; Mathematical economics; Operations research; Algorithm; Combinatorics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true,"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.0008271923,0.0007258907,0.0007933914,0.0008229174,0.001001241,0.0009726991,0.001863929,0.0009234603,0.01064557],"category_scores_gemma":[0.003443902,0.000511794,0.0009348828,0.0007113446,0.0006121691,0.00125737,0.001700139,0.001078071,0.002131678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008076444,"about_ca_system_score_gemma":0.00142586,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002189494,"about_ca_topic_score_gemma":0.004694173,"domain_scores_codex":[0.9991931,0.0002245638,0.00004527996,0.0001996156,0.0001484056,0.0001890617],"domain_scores_gemma":[0.9987656,0.0006205193,0.00009718596,0.0002509527,0.0001684492,0.00009736278],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004685044,0.000702573,0.00387913,0.000396352,0.000116235,0.0003200058,0.000791821,0.2196798,0.01691343,0.1158497,0.01949085,0.6213917],"study_design_scores_gemma":[0.0003325941,0.0002474009,0.000686018,0.0000396184,0.00004908314,0.0001959629,0.0002014746,0.897438,0.006812355,0.07228848,0.02166721,0.00004181501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03476708,0.00007489001,0.9559544,0.0001531241,0.0000420519,0.0003344276,0.0002332146,0.00212793,0.006312997],"genre_scores_gemma":[0.1473396,0.00005079118,0.8470871,0.00008272157,0.00001978968,0.0003439303,0.0009878365,0.0003791727,0.003709085],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01064557,"threshold_uncertainty_score":0.035613,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2290007459228856,"score_gpt":0.4119095838618458,"score_spread":0.1829088379389602,"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."}}