{"id":"W292355835","doi":"10.1609/aaai.v28i1.9031","title":"Solving the Traveling Tournament Problem by Packing Three-Vertex Paths","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Quest University Canada","funders":"","keywords":"Tournament; Schedule; Mathematical optimization; Vertex (graph theory); Integer programming; TRIPS architecture; Computer science; Scheduling (production processes); Job shop scheduling; Graph; Benchmark (surveying); Mathematics; Theoretical computer science; Combinatorics; Geography; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"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.006095417,0.0002788139,0.0003857363,0.0001268946,0.0009490384,0.0009286461,0.00268687,0.0001144626,0.0002390931],"category_scores_gemma":[0.006539699,0.000151256,0.0002542889,0.001060033,0.0004509462,0.0003082421,0.0003175446,0.0005679858,0.0002592531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005304753,"about_ca_system_score_gemma":0.0001053312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001148935,"about_ca_topic_score_gemma":0.00005421364,"domain_scores_codex":[0.9958597,0.00007258288,0.001150895,0.0006560107,0.001687967,0.0005728899],"domain_scores_gemma":[0.9959341,0.001218905,0.0008780183,0.0005329557,0.001297242,0.0001387471],"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.00005975161,0.0001868162,0.001728677,0.00001412338,0.00003743267,1.529916e-7,0.002782484,0.000769748,0.05012433,0.5751255,0.002440415,0.3667306],"study_design_scores_gemma":[0.00004267654,0.0001515353,0.0003487019,0.000359699,0.00004152107,0.000005064247,0.002981109,0.1884101,0.1313747,0.6747609,0.001236864,0.0002871384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7668454,0.0002940437,0.1482603,0.03440451,0.002172394,0.001391593,0.00002630864,0.0002227383,0.04638266],"genre_scores_gemma":[0.9970125,0.00002739859,0.001853441,0.0003734163,0.0001309511,0.00002788318,4.317322e-7,0.00001905843,0.0005549036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3664434,"threshold_uncertainty_score":0.8954955,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1606617041288866,"score_gpt":0.3545316250140712,"score_spread":0.1938699208851846,"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."}}