{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":303,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":303,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"2ac23a5c820b","filters":{"topic":"Scheduling and Timetabling Solutions"}},"results":[{"id":"W2014856631","doi":"10.1007/s10951-008-0077-5","title":"A survey of search methodologies and automated system development for examination timetabling","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":378,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of New Brunswick; Queen's University","funders":"","keywords":"Generality; Presentation (obstetrics); Computer science; Benchmark (surveying); Data science; Confusion; Management science; Operations research; Psychology; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.4968872769107157,"gpt":0.4637269991699302,"spread":0.0331602777407855,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03672636,0.0001188932,0.0005818832,0.0008232609,0.0003396358,0.00008506514,0.0003750761,0.00009741856,0.000005790455],"category_scores_gemma":[0.02099072,0.0000865691,0.0001087659,0.0009525205,0.0001136527,0.0003388513,0.00007337021,0.0001889212,0.000004821707],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004754702,"about_ca_system_score_gemma":0.0004776266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003107317,"about_ca_topic_score_gemma":0.0000052045,"domain_scores_codex":[0.9962279,0.0008506675,0.001431246,0.0002138343,0.001033611,0.0002427866],"domain_scores_gemma":[0.9881303,0.007601536,0.0009470918,0.0001784108,0.003029859,0.0001128178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.001248342,0.0006440849,0.2633061,0.00064069,0.001649398,0.0001010903,0.0213466,0.3018977,0.06466632,0.003037231,0.0005954766,0.340867],"study_design_scores_gemma":[0.001177332,0.0001857565,0.70555,0.0002488349,0.00006088744,0.0004297063,0.003329804,0.269567,0.01901112,0.0001412824,0.000104819,0.0001934689],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7095307,0.001071836,0.2889585,0.00003858472,0.0002389881,0.00008646156,0.000004498975,0.00003401432,0.00003648728],"genre_scores_gemma":[0.6012729,0.00001868312,0.3986235,0.000003816908,0.00003478563,0.00000143862,0.000001138339,0.000006386836,0.00003729638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4422439,"threshold_uncertainty_score":0.9918929,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093938881","doi":"10.1016/j.cor.2005.07.028","title":"A survey of local search methods for graph coloring","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":228,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Tabu search; Guided Local Search; Graph coloring; Local search (optimization); Subroutine; Hill climbing; Computer science; Graph; Best-first search; Search algorithm; Population; Algorithm; Theoretical computer science; Mathematics; Beam search","retraction":null,"screen_n_in":null,"score":{"opus":0.6028806549559134,"gpt":0.6204365109072726,"spread":0.01755585595135922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03987959,0.0001061691,0.0003110932,0.001178522,0.0009291568,0.0004448867,0.001156224,0.000089184,0.0001008538],"category_scores_gemma":[0.007091647,0.00008799877,0.0001326412,0.003612599,0.000509034,0.0002938495,0.0003210583,0.000369373,0.0001407365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009347255,"about_ca_system_score_gemma":0.0006432793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001005838,"about_ca_topic_score_gemma":0.001109309,"domain_scores_codex":[0.9941718,0.002748713,0.0006888993,0.0005418283,0.001268763,0.0005800097],"domain_scores_gemma":[0.9819053,0.01260223,0.00003065868,0.0007641717,0.004492865,0.0002048149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004800273,0.0001932364,0.0008828058,0.000005634548,0.00004459967,4.172672e-7,0.0006966123,0.5652843,0.001056091,0.008909879,0.005769648,0.4171088],"study_design_scores_gemma":[0.0003970499,0.0001547829,0.01003353,0.00001437136,0.000004260797,0.000002526248,0.0003638064,0.9777556,0.004060922,0.0007542822,0.006355638,0.0001032204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06557914,0.0004059875,0.9314085,0.001610263,0.0002479519,0.0004363914,0.00003427382,0.00002884782,0.0002486258],"genre_scores_gemma":[0.6215419,0.00001062241,0.3775587,0.00003077658,0.0000847902,0.00005108972,0.00001519141,0.000009483661,0.0006974062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5559627,"threshold_uncertainty_score":0.988646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966942146","doi":"10.1007/s10479-014-1614-6","title":"The practice and theory of automated timetabling","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":208,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Engineering and Physical Sciences Research Council","keywords":"Operations research; Computer science; Library science; Annals; History; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.462131275352027,"gpt":0.5843200294400972,"spread":0.1221887540880702,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04875991,0.00005474465,0.0001574377,0.0003654216,0.0009351022,0.0003265715,0.000521877,0.00004551227,0.00006027397],"category_scores_gemma":[0.1181855,0.00003204013,0.00004989374,0.001439461,0.0005854965,0.0003569231,0.000154049,0.000210251,0.00008567121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000002833174,"about_ca_system_score_gemma":0.0001708877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001340499,"about_ca_topic_score_gemma":0.00003403497,"domain_scores_codex":[0.9952851,0.002389391,0.0005126813,0.0002141651,0.001335803,0.0002628437],"domain_scores_gemma":[0.9724826,0.02181677,0.00008113558,0.00069183,0.004840567,0.00008711739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001213689,0.0002354087,0.0002869493,0.000007214071,0.0001154096,6.875597e-7,0.001546048,0.01476066,0.007419799,0.8563724,0.01394318,0.1051909],"study_design_scores_gemma":[0.0004557284,0.0004448959,0.009492444,0.00005709207,0.00002910834,0.00002177699,0.007121614,0.7484455,0.02282291,0.09521177,0.1157114,0.0001858149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8560032,0.006363909,0.02516305,0.06186296,0.0003036928,0.0006772426,0.00003578206,0.0001357738,0.04945441],"genre_scores_gemma":[0.9918921,0.00025998,0.005277226,0.0000861486,0.00003685569,0.00001048786,0.000001346049,0.000005443975,0.002430395],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7611606,"threshold_uncertainty_score":0.9795018,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094070748","doi":"10.1007/s10951-010-0188-7","title":"Scheduling technicians and tasks in a telecommunications company","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Orange","keywords":"Computer science; Scheduling (production processes); Operations research; Technician; Heuristic; Task (project management); Job shop scheduling; Telecommunications; Industrial engineering; Operations management; Artificial intelligence; Computer network; Systems engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.08476310417682809,"gpt":0.3892352386411909,"spread":0.3044721344643628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008151364,0.0001597343,0.0004829013,0.001168632,0.0003237729,0.0003473638,0.001078949,0.0001708755,0.0000826231],"category_scores_gemma":[0.009680001,0.0001273726,0.0001672073,0.001418192,0.0002228111,0.0005679548,0.0001702319,0.001756795,0.00004042181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003436124,"about_ca_system_score_gemma":0.0002706671,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003677251,"about_ca_topic_score_gemma":0.0002226602,"domain_scores_codex":[0.9969751,0.0001665786,0.001424268,0.0002562355,0.0008248177,0.0003530099],"domain_scores_gemma":[0.9958924,0.001722234,0.0008028629,0.0006372695,0.0007161499,0.0002290676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000233843,0.001551845,0.3862362,0.00003171009,0.0002449421,0.0001488617,0.005952179,0.1114368,0.3066009,0.04341103,0.0004813028,0.1436704],"study_design_scores_gemma":[0.008308561,0.0006385964,0.341214,0.001221939,0.0003570545,0.004273017,0.02129384,0.3822811,0.009554072,0.1970194,0.03177619,0.002062232],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9767936,0.001013921,0.01671831,0.003961426,0.0005622091,0.00008423186,0.000002757433,0.00002568961,0.0008377858],"genre_scores_gemma":[0.7379032,0.0000701141,0.2616958,0.0001085995,0.000167606,0.000001987221,3.852445e-7,0.0000119137,0.00004037876],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2970468,"threshold_uncertainty_score":0.9986619,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024143101","doi":"10.1016/j.cor.2006.05.014","title":"A graph coloring heuristic using partial solutions and a reactive tabu scheme","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":174,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Tabu search; Graph coloring; Heuristics; Greedy coloring; List coloring; Computer science; Benchmark (surveying); Mathematics; Heuristic; Fractional coloring; Graph; Algorithm; Combinatorics; Mathematical optimization; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.4308289758627579,"gpt":0.4947675758842449,"spread":0.06393860002148699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004676559,0.0001415145,0.00023766,0.0009962049,0.002916445,0.001280026,0.0004679478,0.00008747549,0.00005267847],"category_scores_gemma":[0.002292549,0.0001265008,0.00008536682,0.002568219,0.00056538,0.0004886162,0.0003949373,0.000478487,0.000144434],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218695,"about_ca_system_score_gemma":0.0003965509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001893067,"about_ca_topic_score_gemma":0.0004089366,"domain_scores_codex":[0.9961948,0.000653937,0.0005176909,0.0006542543,0.001275655,0.0007036017],"domain_scores_gemma":[0.9963014,0.001677396,0.00004070884,0.00056338,0.001223308,0.0001938569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000991214,0.0008671938,0.01263016,0.00001494165,0.0001568361,0.00007665722,0.001949626,0.6473322,0.04554032,0.2670789,0.01661672,0.007637321],"study_design_scores_gemma":[0.0004068034,0.00006776687,0.005601181,0.00003263626,0.00001382414,0.000040914,0.0003767857,0.9816648,0.0004448028,0.008035148,0.003130435,0.0001848613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6645482,0.000398279,0.3325284,0.001201178,0.0003246268,0.0003008701,0.0000189477,0.00006713056,0.0006124316],"genre_scores_gemma":[0.9415776,0.00001028685,0.05746266,0.00002954872,0.0003301121,0.00004424182,0.00001019007,0.00001350429,0.0005218933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3343327,"threshold_uncertainty_score":0.9997568,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1601417206","doi":"10.1023/a:1019009928005","title":"A mathematical programming approach for scheduling physicians in the emergency room","year":2000,"lang":"en","type":"review","venue":"Health Care Management Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":161,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Imperial Oil (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Schedule; Operations research; Scheduling (production processes); Workload; Health informatics; Operations management; Medicine; Nursing; Public health; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.2007146065614402,"gpt":0.4855884864042948,"spread":0.2848738798428546,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.01592357,0.0004255623,0.001341249,0.001292683,0.001503806,0.0006970688,0.004133217,0.000110026,0.00003670368],"category_scores_gemma":[0.0008894258,0.0002614065,0.0005978321,0.008262794,0.000240303,0.0002911047,0.000278683,0.0004763246,0.000150506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003413421,"about_ca_system_score_gemma":0.000616664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001755005,"about_ca_topic_score_gemma":0.00001218642,"domain_scores_codex":[0.9918376,0.0004665541,0.001876183,0.001599181,0.002833235,0.001387201],"domain_scores_gemma":[0.9966016,0.000659439,0.0007458769,0.001646165,0.0001754538,0.0001714706],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001464295,0.0001213486,0.000001623113,0.004258208,0.00001053768,0.000001654262,0.001472557,0.0003189657,1.434822e-9,0.01204109,0.0005311917,0.9812413],"study_design_scores_gemma":[0.0001253345,0.00005971492,0.000006183517,0.002098768,0.0001270695,0.000007475376,0.00692429,0.003778561,1.060171e-8,0.003125422,0.9834281,0.000319035],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000002456572,0.9014008,0.08475423,0.0003837761,0.0004575697,0.004605072,0.0000238528,0.00007685536,0.008295387],"genre_scores_gemma":[0.0001257946,0.8216407,0.1749432,0.0003362918,0.0002347122,0.002003433,0.00004429939,0.00003907572,0.0006325779],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9828969,"threshold_uncertainty_score":0.9999838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021735068","doi":"10.1016/j.dam.2008.03.022","title":"Variable space search for graph coloring","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":124,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Complete coloring; Fractional coloring; Vertex (graph theory); Graph coloring; Combinatorics; Best-first search; Edge coloring; List coloring; Space (punctuation); Local search (optimization); Variable neighborhood search; Graph; Set (abstract data type); Search algorithm; Greedy coloring; Beam search; Discrete mathematics; Algorithm; Computer science; Metaheuristic; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.173262291549744,"gpt":0.3769068393962284,"spread":0.2036445478464845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00238575,0.0001646921,0.0003680015,0.0002268059,0.0006482891,0.0001404642,0.0006051722,0.00009284918,0.0001269793],"category_scores_gemma":[0.0009493764,0.0001268516,0.000143071,0.001001093,0.0001576123,0.000105108,0.0001164944,0.0001535032,0.0003937889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002507717,"about_ca_system_score_gemma":0.0001184848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008701495,"about_ca_topic_score_gemma":0.000001462221,"domain_scores_codex":[0.9976411,0.000019933,0.0005253265,0.0004051259,0.0009282799,0.0004802436],"domain_scores_gemma":[0.9966094,0.00211648,0.0001530093,0.0007259352,0.0002423121,0.0001528631],"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.0000186585,0.00009304906,0.0001039335,0.00002778668,0.00003709651,0.000001548611,0.001743845,0.003117466,0.003218621,0.9874534,0.003940298,0.0002442817],"study_design_scores_gemma":[0.001143947,0.00007641261,0.0001845582,0.00003663242,0.00007994399,0.00003941479,0.004212244,0.04518653,0.01451847,0.9177732,0.01622245,0.0005262081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07014537,0.00004967924,0.8781286,0.0002967455,0.000181871,0.0005228042,0.0000343588,0.0001378709,0.05050265],"genre_scores_gemma":[0.4043876,0.000008348636,0.5923274,0.00005957505,0.0001031573,0.0001154221,0.000008253447,0.00002741995,0.002962887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3342422,"threshold_uncertainty_score":0.5172858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050784217","doi":"10.1057/palgrave.jors.2602574","title":"A patient assignment algorithm for home care services","year":2008,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Workload; Integer programming; Tabu search; Linear programming; Computer science; Algorithm; Mathematical optimization; Heuristic; Heuristics; Nurse scheduling problem; Project management; Operations research; Nursing; Mathematics; Medicine; Job shop scheduling; Economics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.2117213361653014,"gpt":0.4610518676349739,"spread":0.2493305314696725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005632114,0.00007654205,0.0001737536,0.00009074653,0.001805607,0.0002518363,0.0008219169,0.00006363025,0.00009263937],"category_scores_gemma":[0.001312349,0.00004022374,0.000525247,0.0006321571,0.0001964983,0.0003073126,0.0001746925,0.0004210873,0.00002603195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002324112,"about_ca_system_score_gemma":0.001013319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001616787,"about_ca_topic_score_gemma":0.000003696834,"domain_scores_codex":[0.994583,0.0003519052,0.000549634,0.0001730361,0.004059451,0.0002830142],"domain_scores_gemma":[0.9927295,0.001681628,0.0002149522,0.0002770625,0.004956367,0.0001404333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002419883,0.001399153,0.01937612,0.00006014741,0.0009396566,0.00002700281,0.08583694,0.07956588,0.006723623,0.004479981,0.6522126,0.149137],"study_design_scores_gemma":[0.005501955,0.002175147,0.05175472,0.0003252509,0.00009174396,0.0006096642,0.07378464,0.2992104,0.008990126,0.04314557,0.5137364,0.0006743142],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9099647,0.003619267,0.05941728,0.02317481,0.002045364,0.0009001203,0.0002093353,0.00001429955,0.000654873],"genre_scores_gemma":[0.933432,0.000109996,0.06330845,0.0005172439,0.0006241677,0.00002284525,0.000003436033,0.000009726046,0.001972137],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2196446,"threshold_uncertainty_score":0.9994939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035237530","doi":"10.1007/s10601-006-9003-7","title":"A Cost-Regular Based Hybrid Column Generation Approach","year":2006,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":117,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Constraint programming; Embedding; Mathematical optimization; Constraint (computer-aided design); Combinatorial optimization; Computation; Benchmark (surveying); Column (typography); Algorithm; Mathematics; Artificial intelligence; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.2085565399469041,"gpt":0.3669972140349245,"spread":0.1584406740880204,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00209596,0.0001327795,0.0002140762,0.0002268613,0.0003196853,0.0003721032,0.0003765975,0.00006721394,0.0007473651],"category_scores_gemma":[0.001221986,0.0001160596,0.0001356403,0.0005533834,0.0004250822,0.0001433518,0.00002973031,0.0001244765,0.0006000653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004151026,"about_ca_system_score_gemma":0.0002490418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004439566,"about_ca_topic_score_gemma":0.00001625745,"domain_scores_codex":[0.9976955,0.0001817489,0.0004759617,0.0004955668,0.0008233452,0.0003278514],"domain_scores_gemma":[0.9985287,0.0003337272,0.0001465229,0.0005452365,0.000333263,0.0001125574],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005949185,0.001739662,0.02645853,0.0000164001,0.000108686,0.000102896,0.0002557799,0.1311821,0.02738458,0.07884658,0.3789836,0.3548617],"study_design_scores_gemma":[0.001889047,0.00004541555,0.009145286,0.00001568601,0.00005642664,0.00009594134,0.0002305259,0.9210145,0.01045721,0.01707996,0.03943158,0.0005384018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2104133,0.0001308209,0.7608027,0.0007020272,0.0005680108,0.0003698759,0.00009005038,0.0001473239,0.02677581],"genre_scores_gemma":[0.9581317,3.682452e-7,0.0393394,0.0002516035,0.0002943797,0.00003572844,0.00008549787,0.00001021348,0.001851141],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7898324,"threshold_uncertainty_score":0.8183124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092998591","doi":"10.1016/j.dam.2006.07.017","title":"An adaptive memory algorithm for the k-coloring problem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Graph coloring; Mathematics; Algorithm; Adaptive memory; Edge coloring; Vertex (graph theory); Greedy coloring; Set (abstract data type); Graph; Computer science; Combinatorics; Line graph; Graph power","retraction":null,"screen_n_in":null,"score":{"opus":0.1098868155869601,"gpt":0.385019381873026,"spread":0.275132566286066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007286857,0.0001835951,0.0002923771,0.0001408057,0.0006205927,0.0002495441,0.0008976869,0.0000908585,0.00004605902],"category_scores_gemma":[0.0004174281,0.0001073773,0.0001494418,0.0005755151,0.0001524126,0.0001445121,0.00008451159,0.0001770477,0.0001484437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319283,"about_ca_system_score_gemma":0.00005646197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008271144,"about_ca_topic_score_gemma":0.00001641603,"domain_scores_codex":[0.9975768,0.00001830674,0.0006624858,0.000397826,0.0008604507,0.000484105],"domain_scores_gemma":[0.9944824,0.003994441,0.0002883657,0.0008627155,0.0002303116,0.0001417759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005950692,0.0002622429,0.000008882084,0.00001846358,0.0001416941,0.00000261815,0.00723332,0.003644147,0.002063088,0.4911731,0.001217417,0.4941755],"study_design_scores_gemma":[0.0006618134,0.0001394234,0.0001300569,0.00002185906,0.0001509519,0.00001017947,0.02910974,0.4528417,0.005844639,0.5070353,0.003669277,0.000385096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003446878,0.00006911933,0.979894,0.0001554102,0.0001905141,0.0008304022,0.00002473322,0.0001160653,0.01527281],"genre_scores_gemma":[0.24563,0.00000264546,0.7532822,0.0001005908,0.0002419782,0.0001452662,0.000005030582,0.00002865824,0.000563691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4937904,"threshold_uncertainty_score":0.477316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112255588","doi":"10.1016/j.asoc.2009.08.011","title":"An informed genetic algorithm for the examination timetabling problem","year":2009,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Heuristics; Genetic algorithm; Domain (mathematical analysis); Process (computing); Set (abstract data type); Constraint (computer-aided design); Range (aeronautics); Evolutionary algorithm; Quality (philosophy); Mathematical optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.06682508495774124,"gpt":0.3649826455882064,"spread":0.2981575606304651,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004479494,0.0001672454,0.0002341699,0.0002198095,0.001096803,0.0005952322,0.0008263479,0.00008534907,0.00001745368],"category_scores_gemma":[0.0007445361,0.0001143796,0.0001023186,0.0009450496,0.0000614618,0.0001771263,0.00005203467,0.0001764438,0.00008943262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003472316,"about_ca_system_score_gemma":0.0001119368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009853497,"about_ca_topic_score_gemma":0.000002558463,"domain_scores_codex":[0.9976247,0.00006827168,0.0006521283,0.0004621822,0.0007336884,0.0004590379],"domain_scores_gemma":[0.9950691,0.003634041,0.0003002525,0.0005706441,0.0003229044,0.0001030609],"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.00000380048,0.00003869501,0.00002143326,0.000001059911,0.0000104597,1.977699e-7,0.0006348235,0.04576768,0.0004605417,0.002457916,0.0001429649,0.9504604],"study_design_scores_gemma":[0.0004379926,0.00008651848,0.01574749,0.000008254669,0.00003459481,0.000006219914,0.0005962658,0.9553062,0.000261093,0.02442481,0.002909826,0.0001806896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02640713,0.0001382668,0.9706741,0.0002605118,0.0002055509,0.0005572266,0.00000332729,0.0001907539,0.001563149],"genre_scores_gemma":[0.5911811,0.00000131208,0.4081728,0.000317121,0.0002261892,0.00001285438,0.000007094343,0.000008530847,0.0000730495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9502797,"threshold_uncertainty_score":0.843583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097428991","doi":"10.1016/j.ejor.2008.07.023","title":"A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Heuristics; Heuristic; Hyper-heuristic; Computer science; Mathematical optimization; Null-move heuristic; Consistent heuristic; Set (abstract data type); Algorithm; Mathematics; Incremental heuristic search; Artificial intelligence; Beam search; Search algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.5359042032405876,"gpt":0.4791834452571304,"spread":0.05672075798345722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04093038,0.0001153624,0.0003159582,0.0008609116,0.001642649,0.0003527913,0.0009463626,0.00002352485,0.00003076123],"category_scores_gemma":[0.03498227,0.00007153116,0.000147121,0.001335464,0.0002425307,0.0003200486,0.00007077714,0.0003650107,0.00003561107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006377721,"about_ca_system_score_gemma":0.000498213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001517304,"about_ca_topic_score_gemma":0.000003932982,"domain_scores_codex":[0.9922675,0.00291308,0.001475227,0.0002698636,0.002768817,0.0003055214],"domain_scores_gemma":[0.9713786,0.01586682,0.0005029555,0.0003367288,0.01179841,0.0001164758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00135207,0.01053381,0.00535516,0.0001355854,0.001328938,0.0001487145,0.02892897,0.7525313,0.00649994,0.0720631,0.1002683,0.02085416],"study_design_scores_gemma":[0.02339754,0.01704507,0.1983912,0.0004680401,0.0005258853,0.001552101,0.04429239,0.6537189,0.0004216878,0.009786323,0.04955902,0.0008418448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7453369,0.001390883,0.2471165,0.001253727,0.000741441,0.002367803,0.00008446305,0.00001542992,0.001692738],"genre_scores_gemma":[0.9917327,0.00003358833,0.00513567,0.00001155023,0.000285431,0.00005212611,0.000008505144,0.00002367133,0.002716829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2463956,"threshold_uncertainty_score":0.9996571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114494151","doi":"10.1007/s10916-014-0160-8","title":"The Nurse Scheduling Problem in Real-Life","year":2014,"lang":"en","type":"article","venue":"Journal of Medical Systems","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Solver; Nurse scheduling problem; Usability; Software; Heuristic; Process (computing); Job shop scheduling; Operations research; Industrial engineering; Operations management; Schedule; Artificial intelligence; Operating system; Flow shop scheduling; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09017967511885595,"gpt":0.4055672701926766,"spread":0.3153875950738206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04912687,0.00009433622,0.0004166659,0.0002381483,0.000222809,0.0003715275,0.001388839,0.0001636797,0.00005641494],"category_scores_gemma":[0.04319071,0.00004520528,0.0001565129,0.0007139695,0.0001409972,0.0001519939,0.00003493596,0.0006626006,0.0001357119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005172741,"about_ca_system_score_gemma":0.00050624,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001888926,"about_ca_topic_score_gemma":0.00003087469,"domain_scores_codex":[0.9920118,0.0009920035,0.001797149,0.0001659675,0.004703622,0.0003294026],"domain_scores_gemma":[0.9922649,0.005419031,0.0008995408,0.0003613853,0.0004936146,0.0005614852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004287871,0.001039467,0.1776973,0.0001235662,0.0004048503,0.0003026389,0.005112587,0.08639692,0.0003108701,0.4620361,0.09954114,0.1666058],"study_design_scores_gemma":[0.004404543,0.0004811166,0.02461181,0.002338845,0.00007014297,0.0009698755,0.01413207,0.64097,0.00001960711,0.02405053,0.2875147,0.000436819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8251731,0.00574343,0.09060845,0.05524174,0.01030184,0.0003003775,0.000001532031,0.00004452462,0.01258502],"genre_scores_gemma":[0.9974347,0.0001098519,0.0007987284,0.0001071559,0.001099583,0.000003281684,9.107965e-8,0.000007422263,0.0004391436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5545731,"threshold_uncertainty_score":0.979124,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034555835","doi":"10.1007/s10951-009-0114-z","title":"Implicit shift scheduling with multiple breaks and work stretch duration restrictions","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Duration (music); Work (physics); Scheduling (production processes); Computer science; Constraint (computer-aided design); Mathematical optimization; Flexibility (engineering); Context (archaeology); Mathematics; Statistics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0559839752264544,"gpt":0.3383749230511079,"spread":0.2823909478246535,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003343585,0.0002251022,0.0004774403,0.0007533474,0.0005948014,0.0006784538,0.0004543733,0.0001503469,0.00004167005],"category_scores_gemma":[0.004257121,0.0001586948,0.0001722884,0.001855199,0.00009642207,0.0009957225,0.00004191522,0.0007144985,0.00002548901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000635885,"about_ca_system_score_gemma":0.0002481439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002545592,"about_ca_topic_score_gemma":0.00002440003,"domain_scores_codex":[0.9964786,0.0001499159,0.001327146,0.0003766002,0.001258387,0.0004093298],"domain_scores_gemma":[0.9960079,0.001314411,0.00108035,0.0003881535,0.0008686542,0.0003405662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.001195266,0.0006765052,0.5539641,0.00001324761,0.0003330637,0.0001636649,0.003378946,0.3026668,0.008939964,0.008434857,0.0004283353,0.1198052],"study_design_scores_gemma":[0.004291771,0.00128036,0.89145,0.0007251615,0.0003708164,0.001172954,0.004072828,0.04886761,0.00192269,0.04383658,0.001143031,0.0008662391],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9032939,0.0008867996,0.09032813,0.004830576,0.0003062939,0.00009991124,0.000002983088,0.00004062684,0.0002107577],"genre_scores_gemma":[0.8649861,0.00005487027,0.1342914,0.0001535118,0.0004528054,0.000001302445,0.000001108954,0.00001350949,0.00004545806],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3374858,"threshold_uncertainty_score":0.6542345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963501528","doi":"10.1016/j.cie.2012.06.015","title":"Integrating workers’ differences into workforce planning","year":2012,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Overtime; Workforce; Interfacing; Production (economics); Workforce planning; Order (exchange); Quality (philosophy); Throughput; Production planning; Operations management; Computer science; Operations research; Engineering; Business; Labour economics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2313521147258888,"gpt":0.3620478958576048,"spread":0.130695781131716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221172,0.0002419065,0.0003704278,0.0004147441,0.0002710862,0.0004277664,0.0007284794,0.0001995065,0.00004088155],"category_scores_gemma":[0.003428799,0.0001953346,0.0001502898,0.001271693,0.00004748685,0.0005147335,0.0001999227,0.0006356153,0.0001070975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008272477,"about_ca_system_score_gemma":0.000059919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000371643,"about_ca_topic_score_gemma":6.691621e-7,"domain_scores_codex":[0.9975962,0.00009222218,0.0006093067,0.0003429958,0.0006933529,0.0006659371],"domain_scores_gemma":[0.9969353,0.00209042,0.0001675688,0.0003972407,0.00008461452,0.0003248597],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003728445,0.00009339904,0.3957836,0.000007186183,0.0001363559,0.000009480392,0.007393578,0.3352059,0.00056683,0.007025265,0.007941735,0.2457994],"study_design_scores_gemma":[0.002100347,0.0001617339,0.05035464,0.001529053,0.0001057106,0.00005644405,0.004987691,0.8650782,0.0008797102,0.001263235,0.07174351,0.001739739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5618409,0.0007492176,0.4296474,0.000222328,0.006674969,0.000111728,0.000001317357,0.0002744444,0.0004776264],"genre_scores_gemma":[0.9690455,0.000001285188,0.02845768,0.00004090234,0.002232368,0.00000902119,0.000003109919,0.00001971549,0.0001904676],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5298722,"threshold_uncertainty_score":0.7965514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134909806","doi":"10.1007/3-540-44629-x_6","title":"Examination Timetables and Tabu Search with Longer-Term Memory","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":60,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Computer science; Term (time); Scheduling (production processes); Relaxation (psychology); Algorithm; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07418487081622242,"gpt":0.330574517201336,"spread":0.2563896463851135,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005185723,0.0003917835,0.0005461943,0.001638985,0.0004740581,0.0009965026,0.001415683,0.00025743,0.0002296881],"category_scores_gemma":[0.0006163543,0.0002770051,0.00007405121,0.001264525,0.001489992,0.0005219871,0.0004930618,0.0006900054,0.0001064444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001191518,"about_ca_system_score_gemma":0.0004523261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002634447,"about_ca_topic_score_gemma":0.00009139616,"domain_scores_codex":[0.9947435,0.0001006743,0.0005383355,0.001541525,0.002475955,0.0006000127],"domain_scores_gemma":[0.9957634,0.002051891,0.0002438155,0.001060173,0.0006661041,0.0002145924],"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.00001265267,0.0000292428,0.000682322,0.00001028953,0.00001498525,0.00007129167,0.00100833,0.0343468,0.00008872408,0.001316965,0.00002264574,0.9623957],"study_design_scores_gemma":[0.001821065,0.00102363,0.01809702,0.001354839,0.0001502968,0.001133861,0.00001986906,0.7371628,0.005078076,0.2278321,0.003434816,0.002891635],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01079683,0.001119294,0.9747946,0.0003343944,0.0005544801,0.0002910884,0.000008561929,0.00006092062,0.01203984],"genre_scores_gemma":[0.8700588,0.00009839558,0.1194606,0.0004237,0.0006033455,0.000008110575,0.000009979896,0.00004928744,0.009287789],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9595041,"threshold_uncertainty_score":0.9999682,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104638302","doi":"10.1287/mnsc.1100.1264","title":"Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling","year":2010,"lang":"en","type":"article","venue":"Management Science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":57,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer science; Integer programming; Solver; Linear programming relaxation; Mathematical optimization; Rule-based machine translation; Scheduling (production processes); Relaxation (psychology); Theoretical computer science; Mathematics; Algorithm; Programming language; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1186818841862017,"gpt":0.3978671027925801,"spread":0.2791852186063783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01210478,0.0001971831,0.0002302211,0.0008617947,0.001286356,0.001319233,0.001991954,0.00006572202,0.00005175852],"category_scores_gemma":[0.003200499,0.000155607,0.000182082,0.00272683,0.0007719342,0.001188041,0.0003286212,0.0002980569,0.0001285263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004954388,"about_ca_system_score_gemma":0.0001406608,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004910335,"about_ca_topic_score_gemma":0.00008500616,"domain_scores_codex":[0.9956741,0.00004725799,0.0004762906,0.001115938,0.001854131,0.0008322239],"domain_scores_gemma":[0.9972107,0.0008008796,0.0002187354,0.001132827,0.0003793412,0.0002575119],"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.00007478391,0.0006328708,0.005434749,0.00003635345,0.00003441674,0.000007812711,0.0005352593,0.1986632,0.003706163,0.3613519,0.0002859384,0.4292365],"study_design_scores_gemma":[0.0004911316,0.00003747141,0.002556298,0.00001647051,0.00002649031,8.038875e-7,0.0002930258,0.9135158,0.001355224,0.07134202,0.0101036,0.0002616488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1424229,0.00001029097,0.8510367,0.00143573,0.001320662,0.0006533838,0.000005109483,0.0001791505,0.00293604],"genre_scores_gemma":[0.6755427,3.623199e-7,0.3237307,0.0001485036,0.00005765951,0.0001061925,0.000001523785,0.000009390258,0.0004030542],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7148526,"threshold_uncertainty_score":0.9997175,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111805524","doi":"10.1007/s10601-009-9083-2","title":"Formal languages for integer programming modeling of shift scheduling problems","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Constraint programming; Integer programming; Computer science; Constraint (computer-aided design); Exploit; Mathematical optimization; Theoretical computer science; Scheduling (production processes); Context (archaeology); Programming language; Mathematics; Algorithm; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.1219977689067701,"gpt":0.3955546711748169,"spread":0.2735569022680469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002981561,0.0001423188,0.0003115969,0.0002708994,0.0002059301,0.0001546485,0.0004579845,0.0001007488,0.00009256523],"category_scores_gemma":[0.003595156,0.0001124824,0.0002112178,0.0004531693,0.0001800569,0.0003485569,0.00004050308,0.0001590441,0.00002928249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000164339,"about_ca_system_score_gemma":0.0001395485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001108804,"about_ca_topic_score_gemma":0.00000729168,"domain_scores_codex":[0.997906,0.00004386234,0.0007028264,0.0003594568,0.000511193,0.0004766489],"domain_scores_gemma":[0.9984398,0.000490514,0.0002129482,0.0003498039,0.0003918561,0.0001150399],"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.00005636922,0.0002212206,0.001088525,0.0000252567,0.00005655521,0.000003246879,0.002805346,0.1209633,0.001455565,0.06072131,0.00006221161,0.8125411],"study_design_scores_gemma":[0.001200527,0.0002522585,0.000538392,0.0002363517,0.00006111921,0.00002319041,0.004644737,0.8763239,0.001124921,0.1145157,0.0006922449,0.000386713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1854154,0.0003094191,0.8101721,0.0006520157,0.0001760727,0.0003789696,0.00002046449,0.00009225885,0.002783354],"genre_scores_gemma":[0.8923416,0.000001876186,0.107379,0.00007600151,0.00008451066,0.00001630598,0.000006678756,0.000007953951,0.0000860639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8121544,"threshold_uncertainty_score":0.4586899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W175209279","doi":"10.1023/a:1021153305410","title":"A General Approach to the Physician Rostering Problem","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flexibility (engineering); Theory of computation; Mathematical optimization; Context (archaeology); Genetic algorithm; Constraint (computer-aided design); Constraint programming; Personalization; Operations research; Algorithm; Mathematics; Machine learning; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.710463223401453,"gpt":0.5447390887290039,"spread":0.1657241346724491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006403087,0.00007600397,0.0001523457,0.0004444477,0.0009457579,0.0005757493,0.001004499,0.00003729523,0.0001574145],"category_scores_gemma":[0.00221765,0.00004607342,0.00009142129,0.00273994,0.0001498418,0.0002573112,0.0002336437,0.0002574376,0.00115939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009151213,"about_ca_system_score_gemma":0.00005789199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002163249,"about_ca_topic_score_gemma":0.0000673682,"domain_scores_codex":[0.9967026,0.0004983289,0.0003959334,0.0003431386,0.001627835,0.0004321587],"domain_scores_gemma":[0.9970222,0.0003936671,0.00002303052,0.0008006614,0.001631981,0.0001284957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000160313,0.0007952433,0.0002329709,0.000007375505,0.00006087266,0.000001372747,0.00834316,0.5797427,0.006145163,0.06517621,0.2670741,0.0724048],"study_design_scores_gemma":[0.00020941,0.0002275563,0.002259808,0.00002812171,0.000005364308,0.000006991948,0.002103072,0.8385104,0.005655509,0.004329727,0.1464456,0.0002184578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6463668,0.001133833,0.02618228,0.102392,0.0002143792,0.001473916,0.00007416387,0.00007020686,0.2220924],"genre_scores_gemma":[0.9675223,0.000028551,0.01317305,0.000627376,0.0002149878,0.000115967,0.000003078773,0.000009391701,0.01830535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3211554,"threshold_uncertainty_score":0.9996184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974179675","doi":"10.1023/b:anor.0000019101.29692.2c","title":"Using Benders Decomposition to Implicitly Model Tour Scheduling","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":54,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Correctness; Scheduling (production processes); Mathematical optimization; Benders' decomposition; Job shop scheduling; Fair-share scheduling; Algorithm; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.7910546258868351,"gpt":0.6473067551021794,"spread":0.1437478707846557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006244564,0.000106598,0.0002188686,0.001282171,0.001030118,0.0004509245,0.0006662147,0.00008441778,0.00009896809],"category_scores_gemma":[0.004351697,0.00009361802,0.0001241665,0.0025725,0.0001285644,0.000531127,0.0001876711,0.0002940376,0.0003045982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006004106,"about_ca_system_score_gemma":0.0007583489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008451922,"about_ca_topic_score_gemma":0.0003518774,"domain_scores_codex":[0.9964086,0.0002226936,0.0006103024,0.0004504817,0.00176517,0.0005427523],"domain_scores_gemma":[0.995445,0.000364481,0.00003740915,0.0006504758,0.003230976,0.0002717135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001479589,0.00009692363,0.00006948911,0.000001469853,0.00001339975,0.000001084343,0.0006034293,0.9481431,0.03031156,0.01953067,0.0003529615,0.0008611192],"study_design_scores_gemma":[0.0002707973,0.0001260501,0.0004973335,0.00005492832,0.000005789464,0.000008230406,0.001292204,0.905867,0.0408303,0.05078345,0.0001053439,0.0001585284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6723955,0.00007562595,0.3192404,0.007052083,0.00005110439,0.0002003457,0.00002119695,0.00001906684,0.0009447201],"genre_scores_gemma":[0.8423582,0.00001204547,0.1569705,0.0002926947,0.00006720552,0.00001692011,0.000005438509,0.00001182703,0.0002652102],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1699627,"threshold_uncertainty_score":0.7922938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114085960","doi":"10.1007/s10732-009-9106-6","title":"A large neighbourhood search approach to the  multi-activity shift scheduling problem","year":2009,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":53,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Neighbourhood (mathematics); Paradigm shift; Mathematical optimization; Theoretical computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1476587390143901,"gpt":0.4031855617987858,"spread":0.2555268227843956,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009224104,0.0001617027,0.0003978827,0.0003687172,0.0005179791,0.0004993115,0.001158656,0.0000895255,0.00003623994],"category_scores_gemma":[0.006663387,0.00009269667,0.0002524237,0.00120709,0.00004827049,0.0002327134,0.000106079,0.0008436884,0.0001420788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005731526,"about_ca_system_score_gemma":0.0003039978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000106121,"about_ca_topic_score_gemma":0.000006871497,"domain_scores_codex":[0.9962847,0.0003782233,0.0008172658,0.0002734967,0.001742795,0.0005035283],"domain_scores_gemma":[0.9969521,0.0008886278,0.0004449131,0.0005296412,0.0008574288,0.0003273056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001094702,0.01426294,0.03623502,0.00005316457,0.0005749553,0.0002629339,0.0289956,0.6570678,0.002525727,0.08967175,0.02818794,0.1410674],"study_design_scores_gemma":[0.004576656,0.00171311,0.3246551,0.0002120167,0.0003286425,0.0007639577,0.004798695,0.5611724,0.0009564004,0.04978739,0.04997749,0.0010581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1794046,0.0002975277,0.810928,0.007153873,0.0003860812,0.0001648957,0.00001729905,0.00001952901,0.001628159],"genre_scores_gemma":[0.8263791,0.00001080062,0.1725388,0.0003983489,0.000431015,0.000001069408,3.919808e-7,0.000009277434,0.0002312298],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6469744,"threshold_uncertainty_score":0.7977178,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139457845","doi":"10.1287/inte.1040.0097","title":"Improving Volunteer Scheduling for the Edmonton Folk Festival","year":2004,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":52,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Alberta","funders":"","keywords":"Crew; Entertainment; Advertising; Scheduling (production processes); Operations management; Business; Operations research; Marketing; Psychology; Engineering; Aeronautics; Art; Visual arts","retraction":null,"screen_n_in":null,"score":{"opus":0.08812373420240385,"gpt":0.358632925710732,"spread":0.2705091915083281,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.005136106,0.0002446452,0.0003529986,0.0004313235,0.001377017,0.001261087,0.001079975,0.0001385413,0.00004736632],"category_scores_gemma":[0.004260197,0.0001298207,0.0004170998,0.0009087439,0.000138092,0.0003511576,0.00009073596,0.0007903745,0.0002929746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002104471,"about_ca_system_score_gemma":0.0004741394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001852247,"about_ca_topic_score_gemma":0.00001777831,"domain_scores_codex":[0.9964178,0.00001408708,0.001084372,0.0002957917,0.001575407,0.0006125742],"domain_scores_gemma":[0.996137,0.001665691,0.000714791,0.0005881665,0.0006200866,0.0002742236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002075369,0.000110645,0.0002109901,0.000005342536,0.0001848269,0.000007651002,0.0005999362,0.7974021,0.0004741848,0.09525928,0.001428901,0.1041086],"study_design_scores_gemma":[0.007405717,0.0006713706,0.00192504,0.0001544973,0.0005653602,0.0003520056,0.007642194,0.4341283,0.003492266,0.3984869,0.1439756,0.001200804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04916585,0.0001770912,0.9389207,0.004243594,0.001233285,0.0003655334,0.00001305606,0.00007516156,0.005805676],"genre_scores_gemma":[0.9632921,0.00002719454,0.03317938,0.001101406,0.0009831865,0.00001537637,0.000002256611,0.00002627199,0.001372884],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9141262,"threshold_uncertainty_score":0.9999231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3628730","doi":"","title":"Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Initialization; Operator (biology); Mathematical optimization; Heuristic; Computer science; Local search (optimization); Evolutionary algorithm; Genetic algorithm; Variable neighborhood search; Domain (mathematical analysis); Ranking (information retrieval); Variable (mathematics); Algorithm; Mathematics; Metaheuristic; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.06728663749762294,"gpt":0.3447256053581031,"spread":0.2774389678604802,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002310444,0.0001313072,0.0002081342,0.0002429329,0.0003307017,0.0000613615,0.0006285663,0.00003991544,0.00004104483],"category_scores_gemma":[0.001636466,0.00007757291,0.0001149989,0.001810384,0.0001566207,0.0002469001,0.0001088246,0.0001583741,0.0006629087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001048426,"about_ca_system_score_gemma":0.0002262215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008412986,"about_ca_topic_score_gemma":0.0001063082,"domain_scores_codex":[0.9976248,0.0001476321,0.0005446732,0.0004935928,0.000921355,0.0002679702],"domain_scores_gemma":[0.9975288,0.0004715756,0.0001953853,0.0006921434,0.0009958526,0.0001162489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000195544,0.003998198,0.008039261,0.00002082375,0.0003546622,0.000009058534,0.008675389,0.4605327,0.008682805,0.07999591,0.01173956,0.4177561],"study_design_scores_gemma":[0.003010149,0.0005254056,0.09631767,0.00006620073,0.0001117727,0.0001238512,0.00472074,0.4852293,0.0283928,0.3658672,0.0148229,0.0008120274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03335275,0.00007368308,0.9613279,0.002699256,0.000125621,0.0008725215,0.00005356137,0.0001088093,0.00138587],"genre_scores_gemma":[0.6919097,0.000001387475,0.307067,0.0001499885,0.00004117538,0.0001267422,0.000006364398,0.000006981094,0.0006906211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.658557,"threshold_uncertainty_score":0.8520572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2058048384","doi":"10.1145/944618.944628","title":"Finding the chromatic number by means of critical graphs","year":2002,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Chromatic scale; Critical graph; Mathematics; Graph coloring; Graph; Discrete mathematics; Graph factorization; Random graph; Edge coloring; Graph power; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.1340056843624997,"gpt":0.413582351479498,"spread":0.2795766671169983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00174782,0.0001371624,0.0003438618,0.0001442499,0.0002630147,0.0001337695,0.001298757,0.00006768869,0.00133597],"category_scores_gemma":[0.004250277,0.00008328106,0.0003038287,0.0006254622,0.0003920424,0.0003460716,0.0001453283,0.0002874399,0.0001147377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004581106,"about_ca_system_score_gemma":0.00002811022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001186679,"about_ca_topic_score_gemma":3.985342e-7,"domain_scores_codex":[0.9970111,0.0001873708,0.001004065,0.000165842,0.001362134,0.0002694821],"domain_scores_gemma":[0.9963346,0.002225778,0.0004581945,0.0005025909,0.0003313383,0.0001475592],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002119519,0.01124026,0.02212589,0.00004419635,0.001422293,0.0003111063,0.04645779,0.001173753,0.2709345,0.0436167,0.5419368,0.0605248],"study_design_scores_gemma":[0.006978481,0.002661371,0.003521365,0.0005623965,0.0006837907,0.006694676,0.06967038,0.1316397,0.5064684,0.2490802,0.02016729,0.00187195],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9765429,0.007357345,0.007818229,0.004043338,0.001703772,0.0001047027,0.0000317408,0.00001694237,0.002381024],"genre_scores_gemma":[0.9716482,0.00005212042,0.02779034,0.0001552009,0.0001322447,0.000001738722,4.811052e-7,0.00001163699,0.0002081034],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5217695,"threshold_uncertainty_score":0.9995769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2004802557","doi":"10.1016/j.disopt.2008.10.004","title":"Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":44,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Enumeration; Combinatorics; Vertex (graph theory); Polytope; Independent set; Graph; Algorithm; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1211367297478479,"gpt":0.3512656153859113,"spread":0.2301288856380634,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006668913,0.0001036996,0.0001909567,0.0002660585,0.000538885,0.0000953307,0.0001119244,0.00006464822,0.0000138192],"category_scores_gemma":[0.001486432,0.00008878815,0.0000467071,0.0006802664,0.0001624564,0.0004699276,0.00007687978,0.00007021131,0.000002051135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001188396,"about_ca_system_score_gemma":0.00003035978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008590375,"about_ca_topic_score_gemma":0.00002404806,"domain_scores_codex":[0.9986044,0.00004576988,0.0004660437,0.0003082292,0.0004014891,0.0001741301],"domain_scores_gemma":[0.9987611,0.0004837135,0.0002304427,0.0002350641,0.0002005359,0.00008910615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006053655,0.00001603401,0.02629151,0.000006062977,0.0000233746,0.000002281662,0.003698709,0.9666119,0.00004936731,0.002427669,0.0001371925,0.0006754046],"study_design_scores_gemma":[0.0008068979,0.00006701797,0.02757397,0.00003283606,0.00002427132,0.00002639361,0.0005708608,0.9685028,0.000186712,0.001812817,0.0002415364,0.0001538623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.51648,0.0002018354,0.4812478,0.0004803266,0.0001546122,0.0001614425,0.0001082829,0.00005102097,0.001114679],"genre_scores_gemma":[0.9294695,0.0001837998,0.07008627,0.00001428541,0.00003160469,0.000004525096,0.00004137777,0.000008658678,0.0001600101],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4129895,"threshold_uncertainty_score":0.4144723,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094427046","doi":"10.1287/inte.1070.0337","title":"Spreadsheet Model Helps to Assign Medical Residents at the University of Vermont's College of Medicine","year":2008,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Rotman School of Management, University of Toronto","keywords":"Scope (computer science); Scheduling (production processes); Computer science; Operations research; Software; Engineering management; Software engineering; Operations management; Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1120006925111145,"gpt":0.3425552182805954,"spread":0.2305545257694809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003647815,0.0001298857,0.0004497849,0.0004374246,0.0005067704,0.00001114225,0.001108331,0.0001205502,0.0005751451],"category_scores_gemma":[0.002286503,0.00007238093,0.0001590661,0.001146516,0.0005839115,0.000103297,0.0001816414,0.0003733127,0.0001561896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125964,"about_ca_system_score_gemma":0.0004781523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003664857,"about_ca_topic_score_gemma":0.0000625197,"domain_scores_codex":[0.9954439,0.00004372915,0.0008596446,0.0001677513,0.003236693,0.0002482579],"domain_scores_gemma":[0.9971145,0.0009128871,0.0005803638,0.0004992961,0.0005019848,0.0003910135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00138349,0.0002695439,0.004755844,0.00001075637,0.0003230172,0.00017842,0.003944604,0.477903,0.0006398059,0.03037985,0.4753323,0.004879427],"study_design_scores_gemma":[0.01681441,0.002201421,0.06826694,0.000908191,0.0006888191,0.001530118,0.01661109,0.6851491,0.00529411,0.1156047,0.0855213,0.001409752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7997708,0.0001417437,0.1126154,0.01405232,0.0005043216,0.0003673914,0.0001721097,0.00003653323,0.07233939],"genre_scores_gemma":[0.9925839,0.0001464878,0.001346375,0.0005656031,0.00007938199,2.144789e-7,0.000001655637,0.000006562183,0.005269776],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3898109,"threshold_uncertainty_score":0.6297435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2677624263","doi":"10.1007/s12532-019-00172-4","title":"A rotation-based branch-and-price approach for the nurse scheduling problem","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Nurse scheduling problem; Embedding; Scheduling (production processes); Time horizon; Computer science; Mathematical optimization; Mathematics; Mathematical economics; Job shop scheduling; Algorithm; Artificial intelligence; Schedule; Flow shop scheduling","retraction":null,"screen_n_in":null,"score":{"opus":0.07469503885769585,"gpt":0.3679291525926293,"spread":0.2932341137349334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003851781,0.0001586173,0.0002736264,0.0001547373,0.0004079153,0.0006601935,0.0003272981,0.00007972008,0.00003170396],"category_scores_gemma":[0.002586626,0.00009954677,0.0001449862,0.0007105147,0.0001161833,0.0001704416,0.00002500046,0.0001657419,0.0001626943],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002758073,"about_ca_system_score_gemma":0.00007676028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004685643,"about_ca_topic_score_gemma":4.405537e-7,"domain_scores_codex":[0.9977126,0.0001200745,0.0006007347,0.0004637601,0.0007703848,0.0003324116],"domain_scores_gemma":[0.9924667,0.006464712,0.0002535549,0.0003237948,0.0003975519,0.00009364764],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006955005,0.0005027994,0.001846114,0.0002843819,0.00007881199,2.95903e-7,0.002353306,0.5921149,0.0001186174,0.08387021,0.0001371901,0.3186238],"study_design_scores_gemma":[0.0005491513,0.00006476489,0.0002981056,0.00003528554,0.00004160931,0.000004281791,0.0007592711,0.9079281,0.00002588293,0.0897793,0.0003883564,0.000125914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03796949,0.0001069283,0.9579964,0.001197266,0.0001086404,0.001616943,0.000002123508,0.0001408391,0.0008613262],"genre_scores_gemma":[0.5531111,1.321097e-7,0.4464511,0.00007646673,0.00003868052,0.0001569257,0.000008814191,0.00001249047,0.0001442791],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5151416,"threshold_uncertainty_score":0.6366261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012973940","doi":"10.5267/j.ijiec.2010.04.004","title":"Artificial Bee colony for resource constrained project scheduling problem","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Artificial bee colony algorithm; Scheduling (production processes); Mathematical optimization; Operations research; Computer science; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1302607431485231,"gpt":0.3816360218261396,"spread":0.2513752786776166,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003187548,0.0001454772,0.0002863842,0.001003631,0.000148253,0.0004750501,0.0008801034,0.0001677839,0.00004113781],"category_scores_gemma":[0.01472528,0.0001280426,0.0002741396,0.0006068642,0.00007807377,0.000295115,0.00005665323,0.0007305954,0.00001301314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000606506,"about_ca_system_score_gemma":0.0007105437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260988,"about_ca_topic_score_gemma":0.000007769978,"domain_scores_codex":[0.9971578,0.00005296672,0.001257103,0.0002151277,0.001077701,0.0002393363],"domain_scores_gemma":[0.9940462,0.002948046,0.0006601629,0.0001291204,0.002083642,0.000132805],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001546303,0.0001587907,0.0002855672,0.000001895774,0.0002583278,0.00001551225,0.0004793663,0.9303149,0.01194767,0.02298932,0.00400586,0.02938814],"study_design_scores_gemma":[0.003614469,0.0004360135,0.0002829865,0.0002177375,0.0001479743,0.0006142146,0.000870245,0.8462711,0.004146438,0.02422165,0.1186324,0.0005447594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3356729,0.00002443313,0.6473328,0.009068237,0.007008561,0.0004203413,0.0001156648,0.00008199896,0.0002749785],"genre_scores_gemma":[0.8287615,6.168428e-7,0.1681763,0.0000569016,0.002903736,0.00001161715,0.00001235631,0.00001737044,0.00005969096],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4930885,"threshold_uncertainty_score":0.9935741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2336488339","doi":"","title":"Solving Exam Timetabling Problems with the Flex-Deluge Algorithm","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science; Set (abstract data type); Algorithm; File Transfer Protocol; Operations research; Artificial intelligence; Mathematics; Programming language; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.06896844559053537,"gpt":0.3188556690618179,"spread":0.2498872234712826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004189429,0.0001942984,0.0002613445,0.0002473461,0.0008388933,0.0007904369,0.0008299192,0.00007052116,0.0007320002],"category_scores_gemma":[0.0003984166,0.00009125673,0.0001240899,0.001721883,0.0001865985,0.0003922959,0.0001136938,0.000254017,0.001078459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002410985,"about_ca_system_score_gemma":0.0001092477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007503821,"about_ca_topic_score_gemma":0.0002902942,"domain_scores_codex":[0.9968448,0.0001572129,0.0005040039,0.000551593,0.001410098,0.0005323312],"domain_scores_gemma":[0.9971258,0.001354364,0.0001944741,0.0008103097,0.0004261042,0.00008892487],"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.00006696878,0.001146009,0.02560062,0.00001577698,0.0003746408,0.00006559278,0.001949578,0.2176086,0.006061469,0.0906362,0.2258213,0.4306532],"study_design_scores_gemma":[0.001907465,0.0002543372,0.03409914,0.00007400222,0.0002188535,0.0002531048,0.002566217,0.513105,0.003237173,0.06576516,0.377253,0.001266479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05170989,0.0008103768,0.8657926,0.004708968,0.0003741323,0.0003648233,0.000009444328,0.0003942559,0.07583549],"genre_scores_gemma":[0.7881505,0.000004774238,0.1493202,0.0003871466,0.0004477102,0.00003424856,0.000005908151,0.00002890891,0.06162062],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7364406,"threshold_uncertainty_score":0.9996993,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1577063765","doi":"10.1007/11493853_12","title":"Constraint Programming Based Column Generation for Employee Timetabling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Column generation; Mathematical optimization; Solver; Set cover problem; Constraint (computer-aided design); Set (abstract data type); Integer programming; Cover (algebra); Constraint satisfaction; Linear programming; Integer (computer science); Work (physics); Constraint satisfaction problem; Function (biology); Constraint programming; Algorithm; Mathematics; Stochastic programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1225710071208142,"gpt":0.3584828721173177,"spread":0.2359118649965035,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006491392,0.000448361,0.0006641248,0.001461061,0.0007177531,0.001529852,0.001681904,0.0003741464,0.0001421153],"category_scores_gemma":[0.003065219,0.0003868665,0.0003159766,0.0009654584,0.0009555711,0.0003583952,0.0002214173,0.000577617,0.0000990983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002540626,"about_ca_system_score_gemma":0.00129485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001650099,"about_ca_topic_score_gemma":0.0002079195,"domain_scores_codex":[0.9943934,0.00006129105,0.00106443,0.001763331,0.001930454,0.0007870711],"domain_scores_gemma":[0.994267,0.002806037,0.0004896956,0.001129354,0.00108856,0.0002193429],"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.000007208322,0.0000260424,0.0000855593,0.000005826822,0.000009807116,0.000004905845,0.0001059999,0.1872443,0.000269709,0.002081959,0.00009849887,0.8100601],"study_design_scores_gemma":[0.0004608527,0.0001450379,0.0000457748,0.0001352857,0.00003426822,0.00002325068,5.556881e-7,0.9404392,0.0009708366,0.03752349,0.01966853,0.0005529521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003811352,0.0004374681,0.9945918,0.001008386,0.001843283,0.0008257878,0.00003375629,0.0001283951,0.0007500105],"genre_scores_gemma":[0.1522619,0.000004391305,0.8436659,0.001012013,0.00172808,0.00004087242,0.00002837414,0.00004178482,0.001216702],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8095072,"threshold_uncertainty_score":0.9998583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125033276","doi":"10.1287/opre.2020.2050","title":"Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Staffing; Queue; Computer science; Operations research; Operations management; Nursing; Computer network; Medicine; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1580383485633567,"gpt":0.4928225199909892,"spread":0.3347841714276324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003005567,0.0001257775,0.0001977266,0.0008138416,0.0004987098,0.0004202184,0.0004646736,0.00005672729,0.0004657744],"category_scores_gemma":[0.001040415,0.00009328038,0.00002806189,0.0056978,0.00007890751,0.0003520158,0.0001132998,0.0003735179,0.0004907508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003125928,"about_ca_system_score_gemma":0.0007501313,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000708012,"about_ca_topic_score_gemma":0.1194541,"domain_scores_codex":[0.9959905,0.0005891814,0.0005154199,0.000698155,0.001665063,0.0005417513],"domain_scores_gemma":[0.9975688,0.0003731877,0.00002452717,0.0008148404,0.001023451,0.0001952262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008148993,0.001504913,0.1056756,0.000008354422,0.00003873087,0.00007159794,0.002833821,0.8744473,0.002630721,0.007124347,0.0003859135,0.005197165],"study_design_scores_gemma":[0.003813003,0.0006449915,0.3457966,0.0002608662,0.000030263,0.00002605071,0.0333981,0.5970035,0.003127419,0.003537745,0.01132689,0.001034603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9616244,0.0001685473,0.03026043,0.005420249,0.00004644249,0.0009431657,0.00002790963,0.00002529284,0.00148358],"genre_scores_gemma":[0.9710072,0.00002926027,0.0224009,0.00003323545,0.00001499605,0.001014018,0.00003202077,0.00001684126,0.005451552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2774438,"threshold_uncertainty_score":0.8966136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2731086824","doi":"","title":"A Modular Multiphase Heuristic Solver for Post Enrolment Course Timetabling","year":2008,"lang":"en","type":"article","venue":"University of Southern Denmark Research Portal (University of Southern Denmark)","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Solver; Modular design; Process (computing); Computer science; Heuristic; Property (philosophy); Mathematical optimization; Measure (data warehouse); Programming language; Mathematics; Artificial intelligence; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.1325292087268326,"gpt":0.3443231472179765,"spread":0.2117939384911439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005816322,0.000360652,0.0008807116,0.001351898,0.002095868,0.00005935665,0.002369806,0.00034407,0.009007494],"category_scores_gemma":[0.001786948,0.000409775,0.0008631471,0.001754002,0.002263446,0.00036052,0.0006682969,0.0006444223,0.003299399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009657114,"about_ca_system_score_gemma":0.0008818678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00389904,"about_ca_topic_score_gemma":0.001145344,"domain_scores_codex":[0.9935557,0.0006507122,0.000562935,0.001088488,0.003093259,0.001048875],"domain_scores_gemma":[0.9920278,0.002031305,0.00069583,0.001265857,0.003355231,0.0006240318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"qualitative","study_design_gemma":"qualitative","study_design_scores_codex":[0.03180952,0.02027517,0.2754828,0.001129313,0.01037143,0.01109727,0.3591373,0.02836694,0.09162595,0.005518355,0.1035552,0.06163076],"study_design_scores_gemma":[0.01494448,0.001315012,0.01450796,0.0004164751,0.0009376939,0.0002015854,0.879773,0.05386733,0.0004535695,0.004649569,0.02705921,0.001874138],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.968712,0.0004128563,0.02153397,0.0004905667,0.0001264687,0.0008332528,0.003061282,0.00006409697,0.004765504],"genre_scores_gemma":[0.9465253,0.00007149718,0.01269863,0.00001829036,0.00006891233,3.786978e-7,0.00006207698,0.0000424935,0.04051243],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5206357,"threshold_uncertainty_score":0.9998354,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001287969","doi":"10.1145/2001576.2001648","title":"An efficient hierarchical parallel genetic algorithm for graph coloring problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Graph; Parallel computing; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1618702945412034,"gpt":0.3731997507457475,"spread":0.2113294562045441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965743,0.0001326504,0.0002144285,0.0002906618,0.000359119,0.00014896,0.0006729228,0.00008121432,0.0003650749],"category_scores_gemma":[0.0003339484,0.00009286804,0.0001623113,0.0006283757,0.0001309897,0.0001164506,0.00005833216,0.000119014,0.0002427271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001368375,"about_ca_system_score_gemma":0.00008019857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008012343,"about_ca_topic_score_gemma":0.000016076,"domain_scores_codex":[0.9977506,0.0001077884,0.0004971986,0.0005678195,0.0006234234,0.0004531557],"domain_scores_gemma":[0.9982885,0.0005082936,0.00009336954,0.0005613834,0.000282107,0.0002663326],"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.0001691824,0.002432195,0.006728495,0.00001010115,0.0001387995,0.000019564,0.00487066,0.07045781,0.0004646501,0.1750677,0.003166916,0.736474],"study_design_scores_gemma":[0.0007525785,0.0004431885,0.01447531,0.000007062674,0.00003297891,0.0000153355,0.0004071137,0.8007578,0.0004006746,0.1797369,0.002679215,0.0002918446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07331515,0.0000606582,0.9210476,0.0001115303,0.0003060357,0.0003482926,0.0000107993,0.0001368496,0.00466314],"genre_scores_gemma":[0.3123881,0.00000200013,0.6865918,0.0000770343,0.00007216671,0.00007678864,0.000001977157,0.000009973911,0.0007801817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7361822,"threshold_uncertainty_score":0.3997314,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2467648358","doi":"10.1016/j.dam.2016.05.023","title":"Graph multi-coloring for a job scheduling application","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Vertex (graph theory); Graph coloring; Colored; Greedy coloring; List coloring; Complete coloring; Edge coloring; Neighbourhood (mathematics); Integer programming; Graph; Discrete mathematics; Graph power; Algorithm; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.131738151946533,"gpt":0.3866086343133353,"spread":0.2548704823668023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002462384,0.0002101998,0.0003713353,0.0002605821,0.000363409,0.000171438,0.0006945234,0.0001190974,0.00003713428],"category_scores_gemma":[0.002208347,0.0001270118,0.0002107871,0.0006158699,0.0001221357,0.0001616669,0.000109544,0.00008926365,0.0005662736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004079089,"about_ca_system_score_gemma":0.00005186037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003021142,"about_ca_topic_score_gemma":0.000008540007,"domain_scores_codex":[0.9975175,0.00001811151,0.0007738718,0.0005626812,0.0006741271,0.0004537095],"domain_scores_gemma":[0.9961846,0.002153963,0.0003648081,0.0008963744,0.0002495274,0.0001507467],"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.00004393563,0.0002139367,0.0004980716,0.00006336856,0.00008672447,4.965871e-7,0.001231331,0.0009940466,0.1159356,0.8404244,0.0004299951,0.04007818],"study_design_scores_gemma":[0.002483948,0.00004821503,0.0007529712,0.0001103316,0.0001308889,0.000006559266,0.001885975,0.07674291,0.01522337,0.8964067,0.005532903,0.0006752678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06141401,0.00004130537,0.9350226,0.0005593383,0.0001404361,0.0006741791,0.00003376076,0.0001781123,0.001936288],"genre_scores_gemma":[0.561452,0.000006217252,0.4374723,0.00004730522,0.00009022215,0.0003927286,0.000002680817,0.00002688481,0.0005096227],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.500038,"threshold_uncertainty_score":0.7278491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083729473","doi":"10.12927/hcq..17157","title":"Full-Time or Part-Time Work in Nursing: Preferences, Tradeoffs and Choices","year":2005,"lang":"en","type":"article","venue":"Healthcare Quarterly","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Software deployment; Work (physics); Nursing; Human capital; Nursing staff; Human resources; Business; Human resource management; Medicine; Knowledge management; Computer science; Management; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1037009951878198,"gpt":0.3980988546255882,"spread":0.2943978594377685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002236126,0.0002537339,0.0005254684,0.0004688005,0.0003130837,0.0003743148,0.0005143918,0.0002177039,0.001121618],"category_scores_gemma":[0.000425289,0.0001874045,0.00008576237,0.001517049,0.0001915764,0.0004861063,0.00001505169,0.0003888872,0.002592416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009433783,"about_ca_system_score_gemma":0.0003513964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450343,"about_ca_topic_score_gemma":0.0008097719,"domain_scores_codex":[0.9959952,0.0005333538,0.001000802,0.0008153102,0.0009099982,0.0007452967],"domain_scores_gemma":[0.9972361,0.001296908,0.0002513754,0.0006277342,0.0001675401,0.0004202952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004276783,0.0002874023,0.003676578,0.00001338349,0.00001293117,0.00001016505,0.007550083,0.00005010919,0.00005416388,0.0006743242,0.012737,0.9745062],"study_design_scores_gemma":[0.007502216,0.01158784,0.2853641,0.003768419,0.0001516364,0.0004764484,0.01397255,0.03360812,0.0001194758,0.06387912,0.5759972,0.003572922],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9499448,0.003959549,0.0002181711,0.04134737,0.0005829955,0.0005448491,0.00004637834,0.0002605197,0.003095394],"genre_scores_gemma":[0.9855368,0.00003774537,0.005594687,0.0004890041,0.0005776579,0.00003947922,0.00001236697,0.00002324404,0.007689082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9709333,"threshold_uncertainty_score":0.9997915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123932009","doi":"10.1109/cec.2004.1331099","title":"Hyper-heuristics applied to class and exam timetabling problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of Toronto","keywords":"Heuristics; Constructive; Class (philosophy); Computer science; Range (aeronautics); Mathematical optimization; Quality (philosophy); Theoretical computer science; Artificial intelligence; Mathematics; Process (computing); Engineering; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.1371535838778525,"gpt":0.3678393115819116,"spread":0.2306857277040592,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002378747,0.0001476731,0.0002701633,0.0003486285,0.0002836357,0.0003930702,0.0004016295,0.00007792319,0.0005071162],"category_scores_gemma":[0.001744554,0.0001076351,0.00005150213,0.0009811727,0.00006659242,0.0001480964,0.0001641277,0.0001517432,0.003178699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002109116,"about_ca_system_score_gemma":0.00004967004,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000231551,"about_ca_topic_score_gemma":0.00004779256,"domain_scores_codex":[0.9977481,0.00004840182,0.0005091784,0.0005465819,0.000769686,0.0003780096],"domain_scores_gemma":[0.9980245,0.0008729178,0.00008163461,0.0005236558,0.0002058758,0.0002914063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005870325,0.0004431575,0.007967252,0.0000112263,0.00008263481,0.000003198508,0.002054042,0.0810765,0.0153524,0.09922136,0.07134332,0.7223862],"study_design_scores_gemma":[0.0006773082,0.00006948314,0.009401295,0.00001369376,0.00005101902,0.00003096346,0.0005260491,0.04801794,0.001812665,0.01236522,0.9265404,0.0004939132],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5032014,0.0005429494,0.2622056,0.00991085,0.000561496,0.0006596071,0.00001679171,0.0004776057,0.2224237],"genre_scores_gemma":[0.8647265,0.000009541193,0.120453,0.001028995,0.000229431,0.00001581293,0.000001540807,0.00001330485,0.01352192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8551971,"threshold_uncertainty_score":0.9975975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3025824561","doi":"10.3390/computation8020046","title":"Addressing Examination Timetabling Problem Using a Partial Exams Approach in Constructive and Improvement","year":2020,"lang":"en","type":"article","venue":"Computation","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Benchmark (surveying); Computer science; Constructive; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Process (computing); Quality (philosophy); Machine learning; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3593459955887414,"gpt":0.4124942256057006,"spread":0.05314823001695923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001690962,0.0001077877,0.0002086045,0.000237986,0.0001839795,0.000314917,0.0001124556,0.00005637354,0.000009533315],"category_scores_gemma":[0.0006646383,0.00009801905,0.00003210149,0.0009572975,0.00008212902,0.0004166241,0.00007810123,0.00013896,0.000009975476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004511589,"about_ca_system_score_gemma":0.0000720867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003185018,"about_ca_topic_score_gemma":0.000001395951,"domain_scores_codex":[0.9981254,0.0002347656,0.0004823317,0.0004655906,0.0004993718,0.0001925635],"domain_scores_gemma":[0.9990736,0.00034465,0.0002282933,0.00008875322,0.0001717238,0.00009298978],"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.00002963522,0.00008245833,0.006855038,0.00002351152,0.00001954435,0.000003112725,0.006114875,0.3603891,0.009487055,0.001228652,0.00001565582,0.6157514],"study_design_scores_gemma":[0.0005611918,0.00004330396,0.01199431,0.00002195613,0.00001596514,0.00000709343,0.001173014,0.9817145,0.0006374269,0.003705042,0.0000146755,0.0001115408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5445073,0.00007680248,0.4547617,0.0001016303,0.00005820786,0.000174106,0.000001932464,0.0000282834,0.0002900011],"genre_scores_gemma":[0.8902397,0.000001093782,0.1095802,0.00007199049,0.00007765781,0.000008005689,0.000008827044,0.000007382127,0.000005129315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6213254,"threshold_uncertainty_score":0.3997101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167699778","doi":"10.1007/s10951-010-0179-8","title":"Assigning multiple activities to work shifts","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kronos (Canada); Université Laval; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Time horizon; Heuristic; Computer science; Integer programming; Operations research; Mathematical optimization; Work (physics); Column generation; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.09904310839770022,"gpt":0.3810197728663123,"spread":0.2819766644686121,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.006985398,0.0001535841,0.0004073207,0.0007755109,0.0003453556,0.0005725837,0.0008889349,0.0001237023,0.0002286804],"category_scores_gemma":[0.02097252,0.0001131938,0.0002777448,0.001331796,0.00007338542,0.0006737477,0.0001133561,0.001013197,0.000229759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003011344,"about_ca_system_score_gemma":0.000223569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000692434,"about_ca_topic_score_gemma":0.00001950627,"domain_scores_codex":[0.9968414,0.0001171003,0.0009628286,0.0002527531,0.001439608,0.0003862597],"domain_scores_gemma":[0.9949363,0.002943565,0.000663276,0.0004030179,0.0006487409,0.0004051301],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0005790757,0.000519028,0.3643772,0.00001056334,0.0002822323,0.0001413307,0.007265806,0.13492,0.3309528,0.003032942,0.006227393,0.1516916],"study_design_scores_gemma":[0.008798974,0.001595512,0.5163179,0.001751741,0.0005805509,0.001208459,0.03349066,0.04351254,0.1552812,0.07732868,0.156293,0.00384067],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9262122,0.0001058063,0.06789692,0.002100979,0.002928691,0.00005621444,0.000001752162,0.00002729909,0.0006701691],"genre_scores_gemma":[0.7848146,0.00000195939,0.2138383,0.0001922061,0.0008625872,0.000001438155,1.451383e-7,0.00001381874,0.0002749685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1756716,"threshold_uncertainty_score":0.9872742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133424441","doi":"10.1109/scis.2007.367686","title":"Memory Length in Hyper-heuristics: An Empirical Study","year":2007,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Heuristics; Computer science; Simulated annealing; Heuristic; Flexibility (engineering); Set (abstract data type); Mathematical optimization; Independence (probability theory); Focus (optics); Artificial intelligence; Machine learning; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2508048272341721,"gpt":0.5014999654509681,"spread":0.250695138216796,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01022985,0.0001111596,0.000236463,0.0005244653,0.0001483495,0.0001474606,0.0005714237,0.00007018448,0.0006349073],"category_scores_gemma":[0.004704158,0.00007792059,0.00005766161,0.001262257,0.00006790302,0.0002054966,0.00008484685,0.0002273527,0.0009733202],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003351301,"about_ca_system_score_gemma":0.00007856741,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002603573,"about_ca_topic_score_gemma":0.001876147,"domain_scores_codex":[0.9971756,0.0002308923,0.0006632023,0.0005044804,0.001044916,0.0003808994],"domain_scores_gemma":[0.9970909,0.001753011,0.00006638637,0.0006928085,0.0001941984,0.0002027063],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00004973873,0.002071424,0.9296048,4.852329e-7,0.00001109262,0.00006593359,0.003145363,0.0006765128,0.00005068367,0.0004128374,0.003005021,0.06090613],"study_design_scores_gemma":[0.0008701183,0.0003132967,0.9589319,0.000002703141,0.00001392455,0.00001137192,0.02200842,0.006042778,0.0001549512,0.006997517,0.004425614,0.0002273844],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9618174,0.00004261767,0.01068285,0.0002991838,0.0003997425,0.0001457502,0.00000139359,0.00008949509,0.02652152],"genre_scores_gemma":[0.9898118,7.941075e-7,0.006140853,0.0003005489,0.0001382227,0.000002987889,9.165998e-7,0.000008225307,0.003595622],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06067875,"threshold_uncertainty_score":0.9998046,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982221171","doi":"10.1287/inte.1110.0561","title":"A Decision Support System for Scheduling the Canadian Football League","year":2012,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"University of Saskatchewan; Federated Co-operatives (Canada)","funders":"","keywords":"League; Football; Schedule; Operations research; Scheduling (production processes); Computer science; Decision support system; Business; Engineering; Operations management; Advertising; Political science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1160641987402657,"gpt":0.3654990332152486,"spread":0.2494348344749829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01152876,0.0002400986,0.0003982387,0.0008415975,0.00202481,0.00126754,0.001144488,0.0001988593,0.00009427508],"category_scores_gemma":[0.0026675,0.0001286351,0.0003799441,0.001045026,0.0001028836,0.0003879727,0.00006071559,0.0006980872,0.001131988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005438072,"about_ca_system_score_gemma":0.0009213132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004036835,"about_ca_topic_score_gemma":0.003741525,"domain_scores_codex":[0.995787,0.00003123491,0.001238113,0.000224532,0.001708841,0.001010303],"domain_scores_gemma":[0.9952375,0.001843957,0.00060977,0.0006679184,0.0006514975,0.0009893356],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000409093,0.0001870747,0.007360991,0.00002368416,0.0004788453,0.00001922627,0.002361416,0.1627582,0.00006943187,0.6131912,0.04426106,0.1688798],"study_design_scores_gemma":[0.002613117,0.0002983762,0.003523532,0.0001472575,0.0003528213,0.0007640495,0.008663065,0.09188632,0.000501206,0.0335631,0.8567866,0.0009005606],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1471354,0.0004396824,0.6596447,0.006172607,0.01074809,0.001654493,0.0001460136,0.0002380523,0.173821],"genre_scores_gemma":[0.9817746,0.000008369359,0.01512445,0.001132454,0.001013082,0.00001553292,0.000005399279,0.00002334958,0.0009027949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8346392,"threshold_uncertainty_score":0.9997692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1828541999","doi":"","title":"A Genetic Programming Approach to the Generation of Hyper-Heuristics for the Uncapacitated Examination Timetabling Problem","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Heuristics; Benchmark (surveying); Computer science; Genetic programming; Mathematical optimization; Genetic algorithm; Set (abstract data type); Artificial intelligence; Machine learning; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.2330621697436535,"gpt":0.366733198773676,"spread":0.1336710290300225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005188949,0.0001219846,0.0001820181,0.0001948732,0.000553306,0.0003334984,0.0006004687,0.0000564286,0.00001192852],"category_scores_gemma":[0.003647914,0.0000585556,0.0001099298,0.001529807,0.00006110279,0.0001055921,0.00002999483,0.00009769611,0.00002642689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001946871,"about_ca_system_score_gemma":0.0000656038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002607662,"about_ca_topic_score_gemma":0.00001589444,"domain_scores_codex":[0.997808,0.0001858602,0.0006067209,0.0003485451,0.0007813557,0.0002694923],"domain_scores_gemma":[0.997053,0.001252891,0.0002066438,0.0005476357,0.0008809974,0.00005889111],"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.00001504766,0.0002406608,0.0001175247,0.000004639679,0.00003486061,7.894943e-8,0.001852409,0.1567391,0.004568059,0.01703228,0.00371389,0.8156815],"study_design_scores_gemma":[0.000305421,0.0002028063,0.008222265,0.00000782008,0.0001109047,0.000009456582,0.001126129,0.9653182,0.001449751,0.005002099,0.01808549,0.0001596439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03917956,0.0002800039,0.9556984,0.001859629,0.0001623643,0.001179644,0.000007063247,0.00005008221,0.001583297],"genre_scores_gemma":[0.6656803,0.00000368368,0.3329342,0.0001633802,0.0001532398,0.00007875999,0.000006167538,0.000006187249,0.0009741434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8155218,"threshold_uncertainty_score":0.4367158,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527340811","doi":"10.1007/s10479-016-2321-2","title":"An integer programming approach to curriculum-based examination timetabling","year":2016,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Schedule; Computer science; Theory of computation; Curriculum; Set (abstract data type); Integer programming; Integer (computer science); Course (navigation); Operations research; Mathematics education; Programming language; Mathematics; Algorithm; Sociology; Pedagogy","retraction":null,"screen_n_in":null,"score":{"opus":0.5537578790127029,"gpt":0.568445045148991,"spread":0.01468716613628807,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02111663,0.0001220169,0.0002402785,0.001793091,0.0006395049,0.0005795826,0.001012884,0.00009013369,0.0002362178],"category_scores_gemma":[0.01603946,0.00007422035,0.0001054035,0.003845496,0.0002282148,0.0008450609,0.0001046877,0.0002059146,0.0005595528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000291333,"about_ca_system_score_gemma":0.0003334657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002416355,"about_ca_topic_score_gemma":0.00005989839,"domain_scores_codex":[0.9945573,0.001282978,0.0006584025,0.0006329925,0.002296481,0.0005718025],"domain_scores_gemma":[0.9920013,0.001125743,0.00005128056,0.0009871033,0.00551904,0.0003155292],"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.00004574116,0.003083132,0.003664922,0.00001351414,0.00005435487,0.000002441661,0.001679539,0.07970081,0.04020597,0.04872159,0.006050965,0.8167771],"study_design_scores_gemma":[0.001494673,0.001844631,0.02997372,0.0003160104,0.00002892106,0.00001327583,0.006496466,0.8057801,0.09988887,0.004805661,0.04836996,0.0009877894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5030773,0.0001022467,0.4873479,0.005381157,0.00009694645,0.0006070536,0.00002483343,0.00006512397,0.003297495],"genre_scores_gemma":[0.9359637,0.000006288064,0.06204889,0.00008885819,0.0001037994,0.0001509714,0.00001332153,0.00001464769,0.001609541],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8157892,"threshold_uncertainty_score":0.9922488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025689931","doi":"10.1007/s10951-013-0338-9","title":"A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Mathematical optimization; Scheduling (production processes); Task (project management); Job shop scheduling; Set (abstract data type); Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1176176703911333,"gpt":0.3762298569327138,"spread":0.2586121865415806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008342076,0.0003084968,0.000658904,0.0004481731,0.0009682173,0.001053093,0.001078248,0.000187955,0.00008138086],"category_scores_gemma":[0.006412672,0.000186733,0.0004959452,0.000870564,0.0002251232,0.001344947,0.0001849476,0.0008890614,0.0001090175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007114117,"about_ca_system_score_gemma":0.0002915307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001402235,"about_ca_topic_score_gemma":0.00001469272,"domain_scores_codex":[0.9960868,0.0002430148,0.001336478,0.0004883212,0.001194504,0.0006509316],"domain_scores_gemma":[0.991362,0.004849638,0.001375971,0.000520061,0.001516219,0.000376143],"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.0001299466,0.001016765,0.01297863,0.0000578084,0.0007716415,0.00001493885,0.004086556,0.06934778,0.02318876,0.0007900653,0.000362455,0.8872547],"study_design_scores_gemma":[0.002753791,0.0001579859,0.02956886,0.000157055,0.0001657193,0.0001447516,0.001299768,0.9562534,0.001068847,0.006372206,0.001688396,0.0003692135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2786265,0.002336203,0.7143093,0.003538039,0.0006949996,0.0004341082,0.00000878358,0.00003124144,0.00002077215],"genre_scores_gemma":[0.5221273,0.00006444089,0.4770703,0.0001544996,0.000371939,0.00002644646,3.115182e-7,0.00002172568,0.0001630609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8869056,"threshold_uncertainty_score":0.9999839,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3203815469","doi":"10.1111/poms.13571","title":"Scheduling of Physicians with Time‐Varying Productivity Levels in Emergency Departments","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Winnipeg","funders":"","keywords":"Overcrowding; Scheduling (production processes); Emergency department; Productivity; Computer science; Cluster analysis; Operations research; Operations management; Medicine; Artificial intelligence; Nursing; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0751777675560772,"gpt":0.3478535317128968,"spread":0.2726757641568196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116664,0.000102927,0.0001848437,0.0002703184,0.000269309,0.00009067483,0.0001114036,0.00002069824,0.0001449627],"category_scores_gemma":[0.0006671547,0.00008646466,0.00003337539,0.001505428,0.00005275776,0.0004291208,0.0000846509,0.00008482709,0.00003970814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002533346,"about_ca_system_score_gemma":0.00004207018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001395324,"about_ca_topic_score_gemma":0.0001816476,"domain_scores_codex":[0.9982266,0.0001372543,0.0004258614,0.0005732815,0.0004685403,0.0001684221],"domain_scores_gemma":[0.9990409,0.00002492919,0.00008591235,0.0004466651,0.0003731912,0.00002838602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.00006997528,0.002202203,0.05608256,0.0001181586,0.0003479685,0.00002354457,0.002958027,0.812699,0.02587747,0.0147993,0.001178928,0.08364292],"study_design_scores_gemma":[0.004075944,0.0004346863,0.577078,0.0006560106,0.0006882074,0.0001337049,0.01131066,0.1841185,0.1811191,0.02282167,0.01528469,0.002278885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9736189,0.0003154557,0.01673364,0.005549381,0.0004488493,0.0003890023,0.000006732437,0.0000362966,0.002901753],"genre_scores_gemma":[0.9621843,0.00007204234,0.02910766,0.00003130552,0.00007278707,0.00003985445,0.000007701483,0.000007601318,0.00847678],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6285805,"threshold_uncertainty_score":0.3525926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994932061","doi":"10.1007/s10951-014-0383-z","title":"Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Staffing; Mathematical optimization; Tabu search; Computer science; Job shop scheduling; Scheduling (production processes); Heuristic; Workforce; Construct (python library); Operations research; Schedule; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.109235192156957,"gpt":0.3547160647951978,"spread":0.2454808726382408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.01552431,0.0004459977,0.001051682,0.0009522442,0.0007858636,0.0009086903,0.001283467,0.000154865,0.00008282761],"category_scores_gemma":[0.01847734,0.0003122523,0.0004662379,0.001201712,0.0002598951,0.001285568,0.000180547,0.001389954,0.000172939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001305502,"about_ca_system_score_gemma":0.0004667662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005757919,"about_ca_topic_score_gemma":0.00004481174,"domain_scores_codex":[0.9937412,0.0007234024,0.001731101,0.0007097279,0.002225007,0.000869593],"domain_scores_gemma":[0.991842,0.003054491,0.002192925,0.000790297,0.001514744,0.0006055986],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003107397,0.001408944,0.0690902,0.00008617756,0.0004495501,0.000166705,0.002506815,0.8726691,0.01898487,0.0007831559,0.00007712228,0.03346661],"study_design_scores_gemma":[0.004344119,0.0005357807,0.0350512,0.0009186555,0.0002525362,0.0005576601,0.0006790428,0.9494035,0.003491747,0.002800824,0.001160143,0.0008048392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4726388,0.0003952633,0.5255452,0.000559464,0.0006202413,0.0001121722,0.000003268339,0.00004938782,0.00007622094],"genre_scores_gemma":[0.6775396,0.0000167986,0.3217119,0.00009384073,0.0004616265,0.000004472614,6.89304e-7,0.0000421033,0.0001290199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.2049008,"threshold_uncertainty_score":0.9999329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1546422272","doi":"10.1007/978-3-540-45157-0_8","title":"Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Unit (ring theory); Training (meteorology); Mathematical optimization; Operations research; Artificial intelligence; Psychology; Engineering; Mathematics; Mathematics education; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.3609674661402971,"gpt":0.4532695223027544,"spread":0.09230205616245729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0120236,0.0005016482,0.0009276791,0.001532766,0.0008701853,0.001233416,0.001938029,0.0006068848,0.00009722583],"category_scores_gemma":[0.008318354,0.0004309334,0.0004092609,0.001555508,0.001055337,0.0005737487,0.0003021562,0.0009660622,0.00002241101],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000201977,"about_ca_system_score_gemma":0.001297544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001167275,"about_ca_topic_score_gemma":0.00002549642,"domain_scores_codex":[0.9935619,0.0001513892,0.001732586,0.001914096,0.001790627,0.000849395],"domain_scores_gemma":[0.9908949,0.005726192,0.0008172381,0.001163844,0.001110591,0.0002872016],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008891899,0.00001836109,0.0002786841,0.000004292287,0.00001362073,0.000004069028,0.0002684052,0.9023369,0.000007075274,0.002155562,0.000009995969,0.09489417],"study_design_scores_gemma":[0.0003839175,0.00009494412,0.00002732266,0.0001973398,0.00003851919,0.00002870709,0.00000381379,0.9121234,0.00003036122,0.08373671,0.002855015,0.0004798843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001198887,0.000488649,0.9914845,0.0003989218,0.0049639,0.0004209218,0.0000157963,0.00008511357,0.0009432764],"genre_scores_gemma":[0.04796851,0.00003811803,0.9492294,0.001060111,0.00105481,0.000006216526,0.00001170632,0.00005559327,0.0005756019],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09441429,"threshold_uncertainty_score":0.9998143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1479728210","doi":"10.17848/9780880992275.vol1ch8","title":"Hours Constraints","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.2042955897462564,"gpt":0.3859723565017887,"spread":0.1816767667555324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00163276,0.0002540993,0.0004409948,0.0004799609,0.0001601712,0.0002564851,0.0007494094,0.0003544571,0.06356521],"category_scores_gemma":[0.001180285,0.0001843705,0.0003395654,0.0001162763,0.0004508496,0.00008119653,0.0001009583,0.0003860801,0.02679533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003292326,"about_ca_system_score_gemma":0.0002140165,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001174338,"about_ca_topic_score_gemma":0.00002516558,"domain_scores_codex":[0.9970412,0.00002337754,0.000623437,0.0006233795,0.001388877,0.0002997422],"domain_scores_gemma":[0.9972736,0.0009622152,0.0002612394,0.0008993651,0.000397042,0.0002065358],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000003307958,0.00001032162,0.00008181561,5.007076e-7,0.00004772833,0.0000348629,0.00002015424,0.00002948276,0.000001401671,0.7845188,0.1231557,0.0920959],"study_design_scores_gemma":[0.00009727722,0.00001389591,0.00003919326,0.00002488772,0.00002811632,0.00004458179,0.00002579952,0.00004497789,0.000003206051,0.3403113,0.6591614,0.0002053382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00001705448,0.0003033646,0.007635107,0.0006794833,0.000841382,0.00009434697,0.00004140323,0.0001468995,0.9902409],"genre_scores_gemma":[0.006405137,0.0000636123,0.002622825,0.000430556,0.0003037563,0.000001677363,0.00001061164,0.00002800827,0.9901338],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.5360057,"threshold_uncertainty_score":0.9739624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073818615","doi":"10.1007/s10489-013-0429-5","title":"A hierarchical parallel genetic approach for the graph coloring problem","year":2013,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Crossover; Operator (biology); Constraint satisfaction problem; Graph coloring; Graph; Genetic algorithm; Mathematical optimization; Local consistency; Theoretical computer science; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1276837091283285,"gpt":0.3495534716594417,"spread":0.2218697625311132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001677815,0.0001695789,0.0002266882,0.0001448124,0.0005806421,0.0004119446,0.001384893,0.00008936977,0.0002362849],"category_scores_gemma":[0.0006832915,0.00009891683,0.0001599769,0.0009469416,0.0003202099,0.00009222441,0.0001443698,0.0002640843,0.0009524596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001709897,"about_ca_system_score_gemma":0.0000661117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007839876,"about_ca_topic_score_gemma":0.000004593486,"domain_scores_codex":[0.9975631,0.00005240765,0.0005923857,0.0005976345,0.0006888685,0.0005055673],"domain_scores_gemma":[0.9957431,0.002983554,0.0001419299,0.0007472396,0.0002434841,0.0001406975],"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.00006331847,0.0002403768,0.0007708362,0.00001493434,0.0001027598,4.971132e-7,0.001478244,0.1948697,0.0009190308,0.4231521,0.00960881,0.3687794],"study_design_scores_gemma":[0.0001481356,0.00006888848,0.002381256,0.000005889627,0.00003699199,0.00001012038,0.001482158,0.2745153,0.0009737658,0.7105296,0.009551469,0.0002963562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005798877,0.0003046169,0.9818675,0.0008086698,0.0001425275,0.001290795,0.000003297174,0.00007908534,0.00970463],"genre_scores_gemma":[0.6764706,0.00002889733,0.320985,0.0002515299,0.0001057337,0.001408884,0.000001952427,0.00001254494,0.0007348361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6706718,"threshold_uncertainty_score":0.9998254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124761764","doi":"10.1287/ijoc.1080.0307","title":"A Constraint Programming Approach for Solving a Queueing Design and Control Problem","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland","keywords":"Queueing theory; Mathematical optimization; Computer science; Constraint (computer-aided design); Decomposition; Benders' decomposition; Constraint programming; Stochastic programming; Control (management); Variety (cybernetics); Operations research; Service (business); Engineering; Mathematics; Artificial intelligence; Computer network; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.0969777626073913,"gpt":0.3589317360212473,"spread":0.2619539734138561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01078455,0.0002003675,0.0003946606,0.0004269629,0.001189676,0.001741661,0.0003907053,0.00009186714,0.000004010488],"category_scores_gemma":[0.003139034,0.0001349025,0.0001847204,0.0004408229,0.0000850566,0.0004563957,0.0000323348,0.0004981491,0.000006066755],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005988466,"about_ca_system_score_gemma":0.0001938131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002262769,"about_ca_topic_score_gemma":1.691044e-7,"domain_scores_codex":[0.9972246,0.0000828118,0.001028242,0.000309713,0.0007325514,0.000622094],"domain_scores_gemma":[0.9961501,0.002260862,0.0006578389,0.0001849531,0.0004851768,0.0002611221],"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.00009947037,0.0000762436,0.0004559708,0.000006273519,0.00004511992,0.000007576872,0.001126217,0.1612405,0.0001796675,0.005791992,0.0001636928,0.8308072],"study_design_scores_gemma":[0.002007264,0.0006714091,0.0005224711,0.0001654525,0.00003055352,0.0007198384,0.0009611872,0.974057,0.00009490721,0.01891352,0.001590253,0.0002661024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02437233,0.0001527139,0.9732025,0.0006583082,0.0001577616,0.0005584947,0.000001066294,0.00008158553,0.0008152532],"genre_scores_gemma":[0.5862747,0.000001629938,0.4131028,0.0004115767,0.000177036,0.000003180601,3.951539e-7,0.00000610425,0.00002260572],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8305411,"threshold_uncertainty_score":0.9992946,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165843305","doi":"10.1016/j.cor.2013.09.020","title":"Optimizing the strategic patient mix combining queueing theory and dynamic programming","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Case mix index; Solver; Computer science; Mathematical optimization; Integer programming; Linear programming; Operations research; Dynamic programming; Service (business); Operations management; Medicine; Mathematics; Economics; Business; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.1768395519797497,"gpt":0.4410135482310937,"spread":0.264173996251344,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008376407,0.0001380201,0.0001841961,0.0004616318,0.002704564,0.00389538,0.0007816714,0.00006492172,0.0001449263],"category_scores_gemma":[0.001330094,0.00008704107,0.00006689518,0.001397192,0.0004975916,0.0005117154,0.0004720699,0.00061062,0.0003149714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006185122,"about_ca_system_score_gemma":0.0002022065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004189607,"about_ca_topic_score_gemma":0.0001257442,"domain_scores_codex":[0.9954668,0.001774175,0.0004885506,0.0005214667,0.00116156,0.0005873989],"domain_scores_gemma":[0.9937333,0.004351927,0.0000433817,0.0006855107,0.001003843,0.0001820207],"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.00002536513,0.0002859871,0.0004979159,0.00001171502,0.0001202361,0.00001435339,0.02018215,0.2748328,0.00210488,0.2320296,0.00180348,0.4680915],"study_design_scores_gemma":[0.0002219216,0.0001374772,0.000643906,0.00005164562,0.000006923678,0.00002090266,0.02126593,0.95626,0.00006205327,0.02024423,0.0009274565,0.0001575976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.875684,0.0009937603,0.1176146,0.003706268,0.0003237701,0.0007719061,0.000002597661,0.00007719054,0.0008259094],"genre_scores_gemma":[0.9549091,0.00002036647,0.04426616,0.0001241139,0.00004592439,0.0001413558,0.000006558078,0.00001423829,0.0004722028],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6814272,"threshold_uncertainty_score":0.9985938,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}