{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":62,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":62,"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":"65952cc4235e","filters":{"venue":"Journal of Scheduling"}},"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":"W2071552003","doi":"10.1007/s10951-007-0029-5","title":"A tabu search heuristic for the quay crane scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":189,"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":"Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Greedy randomized adaptive search procedure; GRASP; Vehicle routing problem; Greedy algorithm; Mathematics; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.02566375608135085,"gpt":0.2728185617587647,"spread":0.2471548056774139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595851,0.0001427587,0.0002460146,0.0001322535,0.0001590081,0.00009505935,0.000253322,0.00008520156,0.00005816586],"category_scores_gemma":[0.0002879751,0.00009979603,0.0001499174,0.0001662351,0.0000491195,0.0001138481,0.00002403346,0.0005585984,0.000005235726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006363858,"about_ca_system_score_gemma":0.00006166194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009180628,"about_ca_topic_score_gemma":0.000008299777,"domain_scores_codex":[0.9985266,0.00001239539,0.0006547657,0.00008851101,0.0003167607,0.0004009253],"domain_scores_gemma":[0.9986158,0.0006782939,0.0001395494,0.0001398794,0.0002883571,0.0001381183],"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.0000990916,0.00005406946,0.001056956,0.0004031362,0.0002050076,0.0001034448,0.0006985299,0.9567055,0.00366724,0.002640048,0.0003015566,0.03406546],"study_design_scores_gemma":[0.002328519,0.0003851993,0.003070921,0.0007376041,0.0003734758,0.0007727835,0.002845643,0.9569962,0.006572133,0.003191051,0.02203551,0.0006909493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08127009,0.003124917,0.9132902,0.0003077952,0.0006854506,0.0002035288,0.000003675194,0.00004481248,0.001069527],"genre_scores_gemma":[0.8618971,0.0001987365,0.1366978,0.0000509811,0.001045452,0.000002364707,0.000001052763,0.00003643438,0.00007005045],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.780627,"threshold_uncertainty_score":0.4069564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985603248","doi":"10.1007/s10951-008-0066-8","title":"Graph colouring approaches for a satellite range scheduling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Satellite Communication Systems","field":"Engineering","cited_by":178,"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":"Heuristics; Computer science; Tabu search; Mathematical optimization; Scheduling (production processes); Permutation (music); Graph; Schedule; Theoretical computer science; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0902862258790321,"gpt":0.2521157075287561,"spread":0.161829481649724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001101785,0.000216394,0.0004576793,0.000349864,0.0001877709,0.00006269839,0.0004703802,0.000135626,0.000005371787],"category_scores_gemma":[0.00009980577,0.0002080151,0.0002829984,0.0003509604,0.00005715325,0.0004244598,0.00003708026,0.0004449454,0.00001053206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001173719,"about_ca_system_score_gemma":0.00005964606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001583108,"about_ca_topic_score_gemma":0.000001493778,"domain_scores_codex":[0.9981794,0.00005815454,0.0009757299,0.0001351081,0.0003099676,0.0003416901],"domain_scores_gemma":[0.9986501,0.0002683152,0.000356814,0.0003091959,0.0002600518,0.0001554818],"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.0002837068,0.0002241703,0.03664249,0.001830696,0.001065109,0.00008577725,0.01255952,0.8701417,0.03177133,0.001950687,0.00009961599,0.04334518],"study_design_scores_gemma":[0.02428659,0.001402908,0.02847238,0.009086981,0.0009197742,0.01207198,0.01886163,0.6284302,0.1071656,0.009449397,0.1537593,0.006093216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8593608,0.04369021,0.09414194,0.0001576805,0.0005406329,0.0004781366,0.000003118537,0.000180003,0.00144754],"genre_scores_gemma":[0.7689215,0.003221667,0.2273659,0.0000174868,0.0003675749,0.00002164143,0.000001841131,0.00005940553,0.00002297087],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2417115,"threshold_uncertainty_score":0.8482608,"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":"W2068123526","doi":"10.1007/s10951-008-0072-x","title":"A comparison of five heuristics for the multiple depot vehicle scheduling problem","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":124,"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; Giro (Canada)","funders":"","keywords":"Heuristics; Column generation; Mathematical optimization; Tabu search; Scheduling (production processes); Computer science; Heuristic; Set (abstract data type); Job shop scheduling; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.05247880305225816,"gpt":0.3194970015072238,"spread":0.2670181984549656,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008811586,0.0001405159,0.0003962187,0.0001122142,0.0001916342,0.00002447759,0.0002756948,0.00009016306,0.000005063188],"category_scores_gemma":[0.001011641,0.0001117912,0.0001704317,0.0002468886,0.00006185064,0.0001489792,0.00002985396,0.0004143817,0.000001300929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005630381,"about_ca_system_score_gemma":0.00006797487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003678352,"about_ca_topic_score_gemma":0.000001552854,"domain_scores_codex":[0.9984459,0.00005139286,0.000898475,0.00008887474,0.0002852631,0.0002301553],"domain_scores_gemma":[0.9976838,0.001170204,0.000459498,0.0001529839,0.0004533134,0.00008020899],"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.00003852585,0.00004132351,0.01391152,0.00009746661,0.0000960727,0.000003195708,0.001295711,0.9713625,0.01120541,0.00003946001,0.00004883076,0.001859924],"study_design_scores_gemma":[0.0008565722,0.00007532014,0.001267135,0.0001465758,0.00006773813,0.00005554605,0.000682342,0.9718888,0.02463261,0.00006584848,0.0001453653,0.0001161858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4382343,0.001117176,0.5601693,0.00006781455,0.0002222645,0.0001252508,0.000002581686,0.00002920034,0.00003201853],"genre_scores_gemma":[0.5402675,0.00007761231,0.4594561,0.000009567018,0.0001556777,0.000002592358,4.819796e-7,0.00002406715,0.000006341884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1020332,"threshold_uncertainty_score":0.4558713,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2025473159","doi":"10.1007/s10951-008-0080-x","title":"A theoretic and practical framework for scheduling in a stochastic environment","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.0288714523609218,"gpt":0.2837969058946502,"spread":0.2549254535337284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761483,0.00007342865,0.0001467613,0.000146824,0.00008491743,0.00004827068,0.00008583607,0.00005960038,0.0000116645],"category_scores_gemma":[0.0006265122,0.00006601949,0.00004710882,0.0001043051,0.00006290593,0.0003960899,0.00003847445,0.0002738255,0.000001699061],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004596685,"about_ca_system_score_gemma":0.000101551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.509446e-7,"about_ca_topic_score_gemma":2.426973e-7,"domain_scores_codex":[0.999204,0.00003582524,0.0003230477,0.0001211954,0.0001814162,0.000134462],"domain_scores_gemma":[0.999097,0.0004619645,0.0002206985,0.00008790578,0.00004708956,0.00008526965],"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.0001157037,0.0001561889,0.003631903,0.00002793173,0.00004020314,0.0001388281,0.00303035,0.6718939,0.0005558111,0.3047951,0.00000614733,0.01560796],"study_design_scores_gemma":[0.0009167529,0.0001726351,0.003770546,0.0001762788,0.00001461242,0.00168819,0.0002678622,0.9532118,0.0001218845,0.03948605,0.00003417372,0.0001392041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1512848,0.0001436711,0.8460975,0.002256305,0.0001189953,0.00008083607,1.70708e-7,0.00000688627,0.00001086706],"genre_scores_gemma":[0.511256,0.00006718138,0.488558,0.00007161316,0.00004122422,0.000001507607,5.057466e-8,0.000002857329,0.00000158893],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3599712,"threshold_uncertainty_score":0.2692197,"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":"W1485398007","doi":"10.1023/a:1024008726557","title":"Complexity of One-Cycle Robotic Flow-Shops","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":50,"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":"Equidistant; Computer science; Mathematical optimization; Hoist (device); Scheduling (production processes); Flow shop scheduling; Mathematics; Job shop scheduling; Engineering; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.03700141970528022,"gpt":0.2429198977066208,"spread":0.2059184780013406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001840548,0.0000730504,0.0001960788,0.00007835418,0.00002913903,0.00001063801,0.00007544042,0.00004065432,0.00003471449],"category_scores_gemma":[0.0001615571,0.00007183573,0.00005713586,0.00007642189,0.00003518448,0.0001179798,0.000006121514,0.0001920743,0.000002345532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003813597,"about_ca_system_score_gemma":0.00001561179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.663186e-7,"about_ca_topic_score_gemma":7.23601e-7,"domain_scores_codex":[0.9993612,0.00001567138,0.000331455,0.00004366775,0.000133808,0.0001142084],"domain_scores_gemma":[0.9995974,0.00004316752,0.0001280734,0.00008143092,0.00009493784,0.00005504541],"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.000004838123,0.00002110833,0.00005630991,0.00004802952,0.00002766759,0.000002868633,0.00006544023,0.9963769,0.001270232,0.001677619,0.0000063592,0.0004426815],"study_design_scores_gemma":[0.000839645,0.00008883942,0.0008367991,0.0002297781,0.00007801959,0.00006435862,0.0001962234,0.9149799,0.05720596,0.02507604,0.000170498,0.0002339158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07405537,0.0003632407,0.923935,0.00001911438,0.0003356617,0.00002546406,7.978191e-7,0.00002310113,0.001242224],"genre_scores_gemma":[0.6355454,0.00006210498,0.3643284,0.000005153374,0.00004338669,1.340963e-7,4.48301e-7,0.000009520001,0.000005360092],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5614901,"threshold_uncertainty_score":0.2929376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1558369927","doi":"10.1023/a:1024042209719","title":"Scheduling and Lot Streaming in Flowshops with No-Wait in Process","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; McMaster University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Travelling salesman problem; Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Schedule; Heuristic; Product (mathematics); Heuristics; Algorithm; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00810058617292611,"gpt":0.2226019535302111,"spread":0.2145013673572849,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006706703,0.00018909,0.0003357872,0.0004520729,0.00003929331,0.00007672951,0.0001113264,0.0001031235,0.00001870639],"category_scores_gemma":[0.0002788085,0.0001686702,0.0000339915,0.0005484766,0.00002861771,0.0004278047,0.000008267139,0.0006065072,0.000003283955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008556719,"about_ca_system_score_gemma":0.00008964613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003916173,"about_ca_topic_score_gemma":0.00001996234,"domain_scores_codex":[0.9986897,0.00003628658,0.0005761772,0.0001479179,0.0002528636,0.0002971141],"domain_scores_gemma":[0.999405,0.00008405724,0.000129017,0.00009046244,0.0001676795,0.0001237594],"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.00002745888,0.00003618901,0.02412912,0.00009261685,0.00002152714,0.00007645238,0.000709335,0.9730736,0.0004353654,0.00005510116,4.667266e-7,0.001342772],"study_design_scores_gemma":[0.003015517,0.000128057,0.002585429,0.001440146,0.00002691589,0.000337388,0.003957354,0.9843208,0.003550821,0.000183854,0.00003115009,0.0004226028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9713647,0.001365282,0.02624951,0.00003631623,0.0002245584,0.00008010173,4.886646e-7,0.00003391795,0.0006451383],"genre_scores_gemma":[0.7457311,0.0001396101,0.2539836,0.00001947657,0.00008513711,0.000002263009,4.536547e-7,0.00003175987,0.000006584356],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2277341,"threshold_uncertainty_score":0.6878172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986115514","doi":"10.1007/s10951-006-0003-7","title":"Time slot scheduling of compatible jobs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Bipartite graph; Scheduling (production processes); Combinatorics; Time complexity; Computer science; Graph coloring; Heuristic; Graph; Discrete mathematics; Mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01296892274091942,"gpt":0.2408808956938547,"spread":0.2279119729529352,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397478,0.0001748287,0.0004260409,0.0004165538,0.00005977174,0.00003420088,0.0002591914,0.0001241229,0.000121974],"category_scores_gemma":[0.0001928557,0.0001683917,0.0001746827,0.0004645459,0.00005647599,0.0002789611,0.00002339949,0.0004463231,0.00003648737],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007133207,"about_ca_system_score_gemma":0.00005526925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002006371,"about_ca_topic_score_gemma":7.761692e-7,"domain_scores_codex":[0.998145,0.00002068799,0.001010957,0.00009787707,0.00042049,0.0003050135],"domain_scores_gemma":[0.9987088,0.0001847482,0.0003582009,0.0001569734,0.0004037456,0.0001875575],"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.00003272015,0.00004307761,0.0008545881,0.00005943845,0.0001004986,0.00002100112,0.0003770284,0.9708087,0.02422269,0.0001138932,0.00002594848,0.003340411],"study_design_scores_gemma":[0.001134087,0.0001257866,0.001004456,0.000405154,0.00007136547,0.00014055,0.0007918247,0.9134493,0.08228704,0.0001121132,0.0001936104,0.000284655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6897953,0.001309022,0.3066078,0.00004147695,0.0006719977,0.00004787799,0.000001616084,0.00007447397,0.001450522],"genre_scores_gemma":[0.5999668,0.00005947565,0.3995625,0.0000231878,0.0003277099,2.049751e-7,0.000001326331,0.00003098177,0.0000278331],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09295472,"threshold_uncertainty_score":0.6866814,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053052668","doi":"10.1007/s10951-007-0015-y","title":"Optimal due date assignment in multi-machine scheduling environments","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Scheduling (production processes); Due date; Single-machine scheduling; Assignment problem; Time complexity; Job shop scheduling; Generalized assignment problem; Weapon target assignment problem; Function (biology); Mathematics; Algorithm; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01833816959217388,"gpt":0.2556672366537828,"spread":0.2373290670616089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001724594,0.0002424494,0.0003756261,0.0004483812,0.00006772335,0.00006071322,0.0002762175,0.0001508854,0.00006110642],"category_scores_gemma":[0.0001291526,0.0002367348,0.0001231642,0.0003015127,0.00003415587,0.0003777523,0.00004381872,0.0007633475,0.0000276118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001936291,"about_ca_system_score_gemma":0.00003103835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003653375,"about_ca_topic_score_gemma":0.000004208631,"domain_scores_codex":[0.9978912,0.00003326883,0.001012951,0.0001685369,0.0004434577,0.0004505371],"domain_scores_gemma":[0.9992056,0.0001008474,0.0002440779,0.0001690125,0.00004411326,0.0002363022],"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.00004296114,0.0001019062,0.002257508,0.0000175977,0.00005889886,0.0001819527,0.0003169806,0.9868846,0.00726524,0.00001438071,0.000001560075,0.002856395],"study_design_scores_gemma":[0.002092262,0.00006049313,0.002545027,0.0002020599,0.00003083992,0.0001428243,0.0006267737,0.9677873,0.02596227,0.000007357848,0.0002447659,0.0002980861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3865578,0.001033732,0.6116334,0.00003935783,0.0005356327,0.00005998393,0.00000152244,0.00003239931,0.0001061849],"genre_scores_gemma":[0.5567696,0.0001630505,0.4428518,0.00003385378,0.0001216533,8.670171e-7,0.000002698498,0.00003426672,0.00002223352],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.1702118,"threshold_uncertainty_score":0.9653764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019692413","doi":"10.1007/s10951-013-0350-0","title":"Single-machine scheduling with periodic maintenance to minimize makespan revisited","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Southeast University","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Schedule; Single-machine scheduling; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01117849571369775,"gpt":0.212332870394864,"spread":0.2011543746811663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004303875,0.0003111665,0.0005169275,0.0004047608,0.0001194998,0.0002894721,0.0003427181,0.0001156213,0.0002338745],"category_scores_gemma":[0.0003098573,0.0002482567,0.0001386201,0.0005506235,0.00004460909,0.0004969958,0.00003363122,0.0005812194,0.0001140517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001443171,"about_ca_system_score_gemma":0.00005676128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000630232,"about_ca_topic_score_gemma":0.000001659378,"domain_scores_codex":[0.9980317,0.00003938172,0.0007961633,0.0002115841,0.0004538635,0.0004672996],"domain_scores_gemma":[0.9983351,0.00009680725,0.0002580847,0.000262254,0.000624892,0.0004228231],"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.00006264964,0.00005379949,0.001420896,0.00007540428,0.0001308264,0.00004794765,0.0006591891,0.9771065,0.01095259,0.00003077613,0.0001316224,0.009327842],"study_design_scores_gemma":[0.002707808,0.0004528851,0.001827308,0.001932504,0.0001344826,0.000761623,0.001950017,0.9801913,0.007691701,0.00007564119,0.001367903,0.0009067749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4536605,0.001452805,0.5424584,0.0009371463,0.0004642225,0.0002134422,0.000003272144,0.0001720008,0.0006382311],"genre_scores_gemma":[0.4679732,0.00005693578,0.5312856,0.0002540048,0.0002900072,0.000005742009,0.000002158451,0.00005719773,0.00007511114],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01431276,"threshold_uncertainty_score":0.999997,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084084982","doi":"10.1007/s10951-007-0043-7","title":"Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":36,"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":"Tabu search; Variable neighborhood search; Simulated annealing; Mathematical optimization; Hill climbing; Guided Local Search; Computer science; Local search (optimization); Scheduling (production processes); Beam search; Metaheuristic; Variable (mathematics); Search algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01020203630421521,"gpt":0.2294490232960321,"spread":0.2192469869918169,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003492246,0.0003232999,0.0004174862,0.0004535156,0.0003499702,0.0002920385,0.0004872427,0.0001791935,0.00003678554],"category_scores_gemma":[0.0003014996,0.0002321652,0.0001236324,0.001274915,0.00006485251,0.0003678839,0.00006184979,0.001169702,0.00001040533],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001728133,"about_ca_system_score_gemma":0.0002029625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476697,"about_ca_topic_score_gemma":0.000003490986,"domain_scores_codex":[0.9972396,0.00004010116,0.001005599,0.0002468957,0.0006902737,0.0007775149],"domain_scores_gemma":[0.9979221,0.0004549067,0.0002705251,0.0002934679,0.0006478081,0.0004112127],"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.0001307503,0.00002616682,0.0002628716,0.00005918859,0.00015572,0.00004909863,0.001342479,0.9825495,0.007502632,0.0003205155,0.000005868872,0.007595181],"study_design_scores_gemma":[0.001285672,0.0002152057,0.00006578019,0.0004961484,0.0000910727,0.000256919,0.004170003,0.9846833,0.008178281,0.00006668456,0.0001279663,0.0003629074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2247381,0.0004442638,0.7729392,0.0002561776,0.0002490896,0.0002389174,0.000002170603,0.0001591503,0.0009729506],"genre_scores_gemma":[0.5031011,0.000007722463,0.4961869,0.0001334962,0.0004912182,0.000001118341,0.000002007984,0.00006368511,0.0000127212],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.278363,"threshold_uncertainty_score":0.9467422,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2101083305","doi":"10.1007/s10951-008-0078-4","title":"Minimizing the stretch when scheduling flows of divisible requests","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Google (Canada)","funders":"","keywords":"Heuristics; Computer science; Preemption; Scheduling (production processes); Mathematical optimization; Pareto principle; Linear programming; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04646876579966042,"gpt":0.2742331595174468,"spread":0.2277643937177863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416048,0.0001209886,0.0002744863,0.0002765639,0.0002428184,0.0001118252,0.001111839,0.00006274037,0.00004216176],"category_scores_gemma":[0.0003457642,0.00008322483,0.0001585563,0.0005272298,0.00007748496,0.0009674386,0.0001939533,0.0004513056,0.000006796139],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003676957,"about_ca_system_score_gemma":0.0002949557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007410365,"about_ca_topic_score_gemma":0.000001556585,"domain_scores_codex":[0.9980427,0.0001373481,0.0007301011,0.0001546176,0.000667268,0.0002679352],"domain_scores_gemma":[0.9981403,0.0002286992,0.0005844627,0.0003330497,0.0005784594,0.0001349676],"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.00007525049,0.0003979599,0.01517489,0.0001463936,0.0002899961,0.0002565047,0.02346751,0.8702514,0.02413927,0.02117064,0.0005240524,0.04410611],"study_design_scores_gemma":[0.0008255773,0.0002034603,0.0006900322,0.0003483991,0.00001535362,0.0003832789,0.0004248599,0.9865844,0.006615984,0.003169532,0.0005581217,0.0001809908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4903757,0.0008968729,0.5056987,0.002167827,0.000325027,0.00008319595,4.000233e-7,0.00002256563,0.0004296904],"genre_scores_gemma":[0.5612274,0.000214593,0.4382969,0.0001091703,0.0001151641,6.664624e-7,1.608192e-7,0.000006929386,0.00002904584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.116333,"threshold_uncertainty_score":0.339381,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081401598","doi":"10.1007/s10951-009-0109-9","title":"Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Schedule; Job scheduler; Mathematical optimization; Scheduling (production processes); Due date; Supply chain; Job shop scheduling; Batch processing; Batch production; Time complexity; Supply chain management; Parametric statistics; Algorithm; Mathematics; Operations management; Economics; Statistics; Queue; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01905853976061846,"gpt":0.2621603572587304,"spread":0.243101817498112,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164652,0.0001655323,0.0003126301,0.0001590438,0.00007229133,0.00005458857,0.0001536987,0.00006486398,0.00001233919],"category_scores_gemma":[0.00005615146,0.0001181942,0.00009871731,0.0003305437,0.00003485498,0.000341383,0.000009086583,0.0002904273,0.000001254308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570097,"about_ca_system_score_gemma":0.00004789089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005790342,"about_ca_topic_score_gemma":0.000004099817,"domain_scores_codex":[0.9987704,0.00002750218,0.0006117618,0.0001007447,0.0002575702,0.0002319884],"domain_scores_gemma":[0.9991533,0.0001181814,0.0002735648,0.0001096668,0.0002826313,0.00006268357],"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.000102763,0.00003997366,0.0009064198,0.00003589928,0.00006788569,0.000007380976,0.00164859,0.985731,0.001596476,0.000235204,0.000004214501,0.009624173],"study_design_scores_gemma":[0.001836684,0.00009145685,0.004236077,0.0002837456,0.00004550356,0.00008465279,0.000678655,0.9866574,0.005628298,0.0002866971,0.000007685422,0.0001630958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6849781,0.0002146867,0.3140718,0.000283425,0.0001754301,0.0001622211,0.000007098157,0.000026782,0.00008046869],"genre_scores_gemma":[0.5350656,0.00005994195,0.4646715,0.00002638355,0.0001262324,0.000003927397,0.000003719188,0.00001764949,0.00002508134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1505997,"threshold_uncertainty_score":0.481982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596332277","doi":"10.1007/s10951-017-0513-5","title":"Solving a wind turbine maintenance scheduling problem","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wind power; Mathematical optimization; Solver; Scheduling (production processes); Turbine; Integer programming; Constraint programming; Time horizon; Job shop scheduling; Operations research; Linear programming; Context (archaeology); Industrial engineering; Schedule; Stochastic programming; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02165069210170227,"gpt":0.2777688907375572,"spread":0.2561181986358549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001737214,0.0001964723,0.0003787084,0.0001698281,0.0003656847,0.000360857,0.0005973679,0.0001187454,0.00003237437],"category_scores_gemma":[0.001027723,0.0001832053,0.0001545367,0.0001050282,0.00005941217,0.0008608737,0.00008336637,0.0006949049,0.00001154769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183701,"about_ca_system_score_gemma":0.00006852698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000288442,"about_ca_topic_score_gemma":0.000001067979,"domain_scores_codex":[0.9984041,0.0000418681,0.0007159236,0.0001388559,0.0003202084,0.0003790495],"domain_scores_gemma":[0.9983976,0.00009780479,0.0006345322,0.0003677693,0.0003362079,0.000166084],"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.0000142895,0.00001389448,0.003242017,0.00008134043,0.00007545354,0.00004714977,0.0002816936,0.9683442,0.01930921,0.0001896121,0.00004201956,0.008359177],"study_design_scores_gemma":[0.001392678,0.0000624336,0.003686361,0.001404034,0.000068926,0.0003446499,0.0002600655,0.9813325,0.009547702,0.0008319904,0.0006756125,0.0003930772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5338174,0.0007719699,0.4609972,0.000503397,0.0009688156,0.00009497843,0.000001109772,0.0001033997,0.002741703],"genre_scores_gemma":[0.525631,0.00009133454,0.4737647,0.00002221173,0.0004102875,4.852342e-7,1.976228e-7,0.00003605674,0.00004370924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01298833,"threshold_uncertainty_score":0.7470897,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3205443176","doi":"10.1007/s10951-021-00711-9","title":"Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times","year":2021,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Genève; European Commission","keywords":"Tabu search; Metaheuristic; Lexicographical order; Mathematical optimization; Job shop scheduling; Computer science; Scheduling (production processes); Minification; Hierarchy; Guided Local Search; Single-machine scheduling; Mathematics; Schedule; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01268171912289581,"gpt":0.2344862857258268,"spread":0.221804566602931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004525,0.0001723236,0.0004114642,0.0002304247,0.0001305236,0.00008466895,0.00009304949,0.00009599348,0.00003085857],"category_scores_gemma":[0.00006725889,0.0001458638,0.00009900207,0.0003809811,0.00006020682,0.0002572736,0.00002097309,0.0003681185,9.647007e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006231533,"about_ca_system_score_gemma":0.0001272743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005960439,"about_ca_topic_score_gemma":0.000007005753,"domain_scores_codex":[0.9986637,0.00004361351,0.0005793012,0.0001608829,0.0003032341,0.0002492896],"domain_scores_gemma":[0.9986124,0.000105386,0.0002191508,0.0001134557,0.0008308979,0.0001186923],"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.0002179113,0.00005478826,0.00446067,0.0004010252,0.000219589,0.00001980963,0.0005781061,0.9823563,0.009003445,0.0006205287,0.00002006051,0.002047833],"study_design_scores_gemma":[0.002436133,0.0002507318,0.0008967587,0.0007720845,0.00009797773,0.0004167258,0.00104918,0.9846702,0.008841429,0.0001844391,0.0001656076,0.0002187771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4167577,0.002268767,0.5801575,0.0002724131,0.0001669111,0.0001428306,0.000007338736,0.00004454648,0.0001820045],"genre_scores_gemma":[0.4597702,0.0004034355,0.5395949,0.00001470118,0.0001257784,0.000004255308,0.000009813356,0.00002982565,0.00004711975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04301253,"threshold_uncertainty_score":0.5948153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056881568","doi":"10.1007/s10951-007-0025-9","title":"Single machine batch scheduling to minimize total completion time and resource consumption costs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Partition (number theory); Scheduling (production processes); Job queue; Batch processing; Job shop scheduling; Non-renewable resource; Resource consumption; Batch production; Time complexity; Mathematical optimization; Operations research; Operations management; Algorithm; Schedule; Mathematics; Economics; Engineering; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01510272516198847,"gpt":0.2389728532338516,"spread":0.2238701280718632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238871,0.0002032616,0.0003437109,0.0003766118,0.0001173453,0.0001159057,0.0001245635,0.0001303343,0.0000707687],"category_scores_gemma":[0.0002496975,0.0002074936,0.00008372862,0.0002708341,0.00003773736,0.000232481,0.00003731233,0.0004054421,0.00004657306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001873787,"about_ca_system_score_gemma":0.00001695219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003309156,"about_ca_topic_score_gemma":0.000001959977,"domain_scores_codex":[0.9984103,0.00003589872,0.0007083592,0.000160597,0.0003644105,0.0003204343],"domain_scores_gemma":[0.998928,0.0002298415,0.0001870874,0.0001245507,0.0002023588,0.0003282266],"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.0001893087,0.00007276585,0.002285578,0.00005409163,0.00009446983,0.00004583076,0.0005710658,0.9012276,0.07491076,0.00003207526,0.00005911578,0.02045733],"study_design_scores_gemma":[0.002065369,0.0002153319,0.00656148,0.0005858946,0.00009301427,0.0008368551,0.0004891668,0.9701576,0.01789315,0.00001866526,0.0005656235,0.0005178573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6729093,0.0009865984,0.3252087,0.0001578034,0.0003203622,0.00007938262,0.000003961231,0.00008659514,0.0002473605],"genre_scores_gemma":[0.5348355,0.0000385702,0.4645718,0.0001047348,0.0003671559,5.808358e-7,0.000007332974,0.00003826503,0.00003609966],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1393631,"threshold_uncertainty_score":0.8461344,"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":"W2117593136","doi":"10.1007/s10951-015-0416-2","title":"A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines","year":2015,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"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; Research and Innovation Foundation; University of Toronto","keywords":"Time horizon; Scheduling (production processes); Computer science; Schedule; Job shop scheduling; Production planning; Production schedule; Optimal maintenance; Integrated production; Interdependence; Production (economics); Mathematical optimization; Operations research; Reliability engineering; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0268962343858004,"gpt":0.275037016954549,"spread":0.2481407825687486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001241471,0.0003151185,0.0004875138,0.0002653806,0.0001486016,0.000288073,0.000206731,0.0001084532,0.000003829085],"category_scores_gemma":[0.0002047458,0.0002484513,0.00006889441,0.0003313741,0.00005529777,0.0007981876,0.00002560801,0.000510622,8.232193e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001055683,"about_ca_system_score_gemma":0.0001603492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351799,"about_ca_topic_score_gemma":0.000009686167,"domain_scores_codex":[0.9982945,0.00004302811,0.00070877,0.0002345901,0.0003214076,0.0003976522],"domain_scores_gemma":[0.9982524,0.0001077664,0.0003411352,0.0001504124,0.000769034,0.0003792888],"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.0001069643,0.00002456566,0.0005781521,0.00006253365,0.00009144711,0.00003574413,0.001187746,0.9737062,0.001724038,0.00002569075,0.000003954769,0.02245291],"study_design_scores_gemma":[0.003118505,0.000446462,0.0000215984,0.0006444435,0.00006198641,0.0003155818,0.004702297,0.9895801,0.0006305186,0.00007251626,0.00007160527,0.0003344016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3127187,0.0008626481,0.6857791,0.00003372569,0.0002597958,0.0001724167,0.000006965664,0.0001207293,0.00004584647],"genre_scores_gemma":[0.2126147,0.00001929761,0.7868505,0.00004295963,0.0003546032,0.00001154058,0.00001023254,0.00007548635,0.00002069732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1010714,"threshold_uncertainty_score":0.9999968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029826506","doi":"10.1007/s10951-010-0208-7","title":"A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Function (biology); Single-machine scheduling; Due date; Regular polygon; Assignment problem; Time complexity; Resource consumption; Convex function; Job shop scheduling; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006204005759576244,"gpt":0.2150202417603225,"spread":0.2088162360007462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327994,0.0001664568,0.0003997525,0.0001062652,0.0001023521,0.000169597,0.0001657133,0.00009011823,0.00006144704],"category_scores_gemma":[0.0000987017,0.0001055225,0.00004803101,0.0002895067,0.00007243757,0.0002989759,0.00002474826,0.000404933,0.00000265552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001243925,"about_ca_system_score_gemma":0.00007704653,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000580524,"about_ca_topic_score_gemma":3.916316e-7,"domain_scores_codex":[0.998933,0.00002642591,0.0004529777,0.0001209544,0.0002536397,0.0002130264],"domain_scores_gemma":[0.9990683,0.00009895252,0.0002043225,0.0001292117,0.00036229,0.000136938],"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.0005827683,0.0002624868,0.01120252,0.0005045858,0.0006718072,0.0000352817,0.004202373,0.835669,0.1400573,0.0004488675,0.0002933388,0.006069659],"study_design_scores_gemma":[0.002093378,0.00006703296,0.001446968,0.0002504441,0.0001330063,0.000791121,0.001974277,0.9753761,0.01736484,0.00007066707,0.0001591888,0.0002730023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8575115,0.0006608869,0.1396476,0.0002356804,0.0002968268,0.000151286,0.000003779835,0.00004407694,0.001448327],"genre_scores_gemma":[0.5607341,0.00001030994,0.438985,0.00002311064,0.0001561541,0.000003587013,8.858362e-7,0.0000228437,0.0000640487],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2993373,"threshold_uncertainty_score":0.4303081,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123490024","doi":"10.1007/s10951-008-0068-6","title":"A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Mathematical optimization; Computer science; Single-machine scheduling; Scheduling (production processes); Job shop scheduling; Heuristic; Guided Local Search; Sequence (biology); Operations research; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.03508282374171459,"gpt":0.2563421948947129,"spread":0.2212593711529983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008415979,0.0002773607,0.0004485473,0.00037147,0.0002412115,0.0001098222,0.0002264692,0.000141603,0.00003683643],"category_scores_gemma":[0.0002446824,0.0002553169,0.0001390581,0.00022717,0.00006388505,0.0002606536,0.00003838132,0.0006184018,0.00002282691],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001859053,"about_ca_system_score_gemma":0.0001118787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005046099,"about_ca_topic_score_gemma":0.000001118491,"domain_scores_codex":[0.9980019,0.00004957969,0.0007245797,0.0002410508,0.0005585903,0.0004242798],"domain_scores_gemma":[0.9987577,0.0002539307,0.000202996,0.0001683641,0.000338858,0.0002781687],"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.0001172723,0.0001112432,0.000244043,0.0001244178,0.0001186191,0.0001068141,0.0007424781,0.9819921,0.01334367,0.00006082969,0.00001704796,0.003021426],"study_design_scores_gemma":[0.002090308,0.0005400816,0.00003657307,0.0004096214,0.00006743186,0.001254566,0.0002874752,0.9835801,0.01111163,0.0002091605,0.00005656047,0.0003565179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6471685,0.00213611,0.3490083,0.0002832355,0.0004460577,0.0003775845,0.00002265398,0.0001777618,0.000379847],"genre_scores_gemma":[0.658695,0.0002810091,0.340424,0.00005867305,0.0003436193,0.000008657671,0.000004485988,0.00006807058,0.0001165538],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01152648,"threshold_uncertainty_score":0.9999899,"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":"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":"W2981427367","doi":"10.1007/s10951-019-00627-5","title":"Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Scale (ratio); Horizon; Computer science; Operations research; Time horizon; Operations management; Industrial engineering; Mathematical optimization; Business; Engineering; Mathematics; Geography; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.07007471513145623,"gpt":0.3256633989004481,"spread":0.2555886837689919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001954753,0.0003234155,0.0006499324,0.0007412649,0.0001341175,0.000269474,0.0003746417,0.0003956217,0.00005511592],"category_scores_gemma":[0.0004922231,0.0003237183,0.0001675112,0.0007419871,0.00003505491,0.0008066178,0.00004781621,0.001562534,0.000012375],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002926823,"about_ca_system_score_gemma":0.0001932583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002497768,"about_ca_topic_score_gemma":0.000007745552,"domain_scores_codex":[0.9971533,0.0001518077,0.00125569,0.0002616006,0.0006364431,0.000541157],"domain_scores_gemma":[0.9985074,0.0002761762,0.0004308012,0.0002900967,0.0002486562,0.000246815],"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.00008261056,0.00004644194,0.01892268,0.00004432466,0.00003874133,0.00001978065,0.002357071,0.9519774,0.02208238,0.00002377852,5.388218e-7,0.004404187],"study_design_scores_gemma":[0.001529595,0.0002903919,0.0003829666,0.001439531,0.00004928347,0.0001005688,0.004276461,0.9864532,0.004995722,0.00009997893,0.00001289022,0.0003694527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.961537,0.001335644,0.03506341,0.00004079342,0.001654598,0.0002251369,0.000004969035,0.00009936257,0.00003908397],"genre_scores_gemma":[0.6002976,0.0000719208,0.3988228,0.00002468808,0.0007175806,0.000001824001,0.000003144597,0.00005767599,0.000002855696],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3637593,"threshold_uncertainty_score":0.9999215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965105237","doi":"10.1007/s10951-011-0264-7","title":"Semi-online two-level supply chain scheduling problems","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Supply chain; A priori and a posteriori; Scheduling (production processes); Supply chain management; Computer science; Mathematical optimization; Upper and lower bounds; Job shop scheduling; Lost sales; Operations research; Mathematics; Business; Schedule; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.0427090246435247,"gpt":0.245424681843225,"spread":0.2027156571997003,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009254441,0.0003048652,0.0004633109,0.0004189411,0.0001195189,0.00007608221,0.0004228659,0.0001626182,0.0002050974],"category_scores_gemma":[0.0001854799,0.0002846566,0.000218647,0.0004704171,0.00005059982,0.0004982115,0.0000495643,0.0008350916,0.00003532475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009980307,"about_ca_system_score_gemma":0.00009075348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001014684,"about_ca_topic_score_gemma":0.000006312812,"domain_scores_codex":[0.9977996,0.00004419839,0.001021942,0.0001882428,0.0004339826,0.000512062],"domain_scores_gemma":[0.9986541,0.00007268709,0.0003331337,0.000236306,0.0004032664,0.0003005254],"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.00002649061,0.0001176891,0.002816058,0.00008051491,0.0001630199,0.00005230481,0.001673314,0.9850791,0.003745441,0.0001599996,0.00001939939,0.006066693],"study_design_scores_gemma":[0.002077459,0.0001487607,0.001446637,0.0006837557,0.0001099871,0.0004387491,0.001641988,0.980978,0.01118126,0.0005729423,0.0001526298,0.0005678029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5573155,0.002367275,0.4372834,0.0001156459,0.00161566,0.0001311337,0.00001474632,0.0002254962,0.0009311406],"genre_scores_gemma":[0.4961052,0.0002471785,0.5028616,0.00006440289,0.0006091124,0.000002159461,0.000005426106,0.00005964374,0.00004529546],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.06557817,"threshold_uncertainty_score":0.9999605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069541979","doi":"10.1007/s10951-011-0255-8","title":"Single machine batch scheduling with release times and delivery costs","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; University of Windsor","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Job shop scheduling; Single-machine scheduling; Scheduling (production processes); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01576189520683019,"gpt":0.1994266802483037,"spread":0.1836647850414735,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003306101,0.0002038735,0.0002956147,0.0002255799,0.00008951351,0.00007180898,0.000150566,0.00009696933,0.00009395904],"category_scores_gemma":[0.00008156612,0.0001695787,0.00006500729,0.000232624,0.00005418077,0.0004250011,0.00002564984,0.0004284806,0.00000960395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007297938,"about_ca_system_score_gemma":0.00004496938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001184101,"about_ca_topic_score_gemma":0.000004081155,"domain_scores_codex":[0.9988863,0.0000270506,0.0004501501,0.0001350423,0.0002548005,0.0002466312],"domain_scores_gemma":[0.9991372,0.00006921733,0.0001800596,0.000133528,0.0002454022,0.0002346062],"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.0005763188,0.0003400562,0.01446843,0.000229799,0.0007123427,0.0005404444,0.003297407,0.9027374,0.01032921,0.0003939103,0.00006674821,0.06630798],"study_design_scores_gemma":[0.002659551,0.0005668716,0.001102924,0.0008435029,0.0002307983,0.001115472,0.001685237,0.96146,0.02935865,0.0001588294,0.0001565153,0.0006616583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8802828,0.004326256,0.1132681,0.00006024464,0.000331788,0.00006734895,0.000002468152,0.0001166414,0.001544374],"genre_scores_gemma":[0.5977315,0.0002550499,0.4017909,0.00004008784,0.000127523,7.373366e-7,0.000001122274,0.00003519863,0.00001786345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2885228,"threshold_uncertainty_score":0.6915219,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2582191864","doi":"10.1007/s10951-018-0575-z","title":"Rescheduling due to machine disruption to minimize the total weighted completion time","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Ningbo; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unavailability; Mathematical optimization; Interval (graph theory); Time complexity; Computer science; Function (biology); Schedule; Standard deviation; Constraint (computer-aided design); Time constraint; Planner; Bounded function; Mathematics; Polynomial-time approximation scheme; Algorithm; Statistics; Artificial intelligence; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01121297589495896,"gpt":0.2410873684386168,"spread":0.2298743925436578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008585766,0.000201394,0.0003235604,0.0002920874,0.0002139246,0.0001405867,0.0002913906,0.00009107051,0.0002046686],"category_scores_gemma":[0.0002672835,0.0001529594,0.0001248867,0.0006111047,0.00003687909,0.0002091834,0.00005305185,0.0003671086,0.0003785958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001140251,"about_ca_system_score_gemma":0.00003188316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004402992,"about_ca_topic_score_gemma":0.00000132143,"domain_scores_codex":[0.9984036,0.00006197618,0.0006485007,0.0001560839,0.0004262611,0.0003035978],"domain_scores_gemma":[0.9988074,0.000124571,0.0001454384,0.0002195287,0.0004299103,0.0002731794],"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.0001796781,0.00004438484,0.0001295454,0.00001955749,0.0001122359,0.0000231241,0.001571115,0.9576173,0.03141375,0.00008816696,0.000381807,0.008419329],"study_design_scores_gemma":[0.0006117119,0.0001783701,0.002407013,0.0002153274,0.00005351704,0.00031376,0.0002890395,0.9881077,0.006952092,0.00006464576,0.0005391242,0.0002676703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4561163,0.0001644854,0.541032,0.0012374,0.0009669053,0.000119747,0.00000477103,0.00008672042,0.0002716283],"genre_scores_gemma":[0.49726,0.00001032961,0.5007561,0.0002752896,0.001565205,0.000003598075,0.000004341868,0.00004232841,0.00008277695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.04114368,"threshold_uncertainty_score":0.6237503,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1729082581","doi":"10.1023/a:1022985808959","title":"Tight Bounds on the Competitive Ratio on Accommodating Sequences for the Seat Reservation Problem","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.06805300057024483,"gpt":0.3062754475526015,"spread":0.2382224469823567,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002703963,0.00008736192,0.0001103507,0.00007689589,0.0006286264,0.0005078498,0.0006326638,0.00003235305,0.00001801481],"category_scores_gemma":[0.0006592978,0.00004386417,0.00007586001,0.000304348,0.00004676888,0.0005588047,0.00003356843,0.0003338967,0.000004966003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005962532,"about_ca_system_score_gemma":0.0001813546,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001665029,"about_ca_topic_score_gemma":0.000003290885,"domain_scores_codex":[0.9987012,0.000232091,0.0003343855,0.0001182892,0.0004407542,0.0001732466],"domain_scores_gemma":[0.9975239,0.001424941,0.0003494322,0.0001987986,0.0004569713,0.00004597181],"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.00001730167,0.00003648369,0.0001902318,0.000008186526,0.00002861711,0.000001468072,0.0009099711,0.1668834,0.0006319404,0.8295258,0.0003097662,0.00145676],"study_design_scores_gemma":[0.001032429,0.0009263165,0.0003972006,0.0005072649,0.00001758926,0.00003931746,0.002042071,0.9345946,0.01060691,0.03496484,0.01464692,0.0002245001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01451445,0.0001024707,0.9366627,0.0423096,0.0003420658,0.0004711873,0.000001064499,0.00001986946,0.005576589],"genre_scores_gemma":[0.8118578,0.00005720224,0.1855651,0.002142507,0.000161632,0.00001885186,7.60243e-7,0.000008814745,0.0001873043],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7973434,"threshold_uncertainty_score":0.4897207,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062601646","doi":"10.1007/s10951-005-5314-6","title":"Scheduling in Reentrant Robotic Cells: Algorithms and Complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reentrancy; Job shop scheduling; Scheduling (production processes); Computer science; Robot; Minification; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Embedded system; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.02816764618713669,"gpt":0.2474518550998317,"spread":0.219284208912695,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000692644,0.0001926455,0.0003847321,0.0003271124,0.00006465382,0.00008794623,0.0001760874,0.0001139245,0.00004079225],"category_scores_gemma":[0.00006822159,0.0001880756,0.00008643672,0.0003005867,0.00005936157,0.0004037449,0.0000254169,0.0006086971,0.00001091486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011456,"about_ca_system_score_gemma":0.00003852776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004900845,"about_ca_topic_score_gemma":0.000009176806,"domain_scores_codex":[0.9984692,0.00003743903,0.0007512699,0.0001421875,0.00027999,0.0003198583],"domain_scores_gemma":[0.9993345,0.00008714385,0.0001523852,0.0001195192,0.0001166069,0.0001898755],"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.0000117537,0.00003724047,0.0004981319,0.00003713723,0.00003224413,0.00002541865,0.0003961068,0.9869748,0.001773159,0.00008028084,0.000007055502,0.0101267],"study_design_scores_gemma":[0.001041955,0.0000364829,0.0006935859,0.0002256124,0.00002687069,0.0001356778,0.0005017948,0.9929339,0.0039711,0.0001360948,0.00008786913,0.0002090307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6716588,0.004476667,0.3222849,0.000496872,0.0007126437,0.00008966837,0.000001589307,0.00008324275,0.0001957009],"genre_scores_gemma":[0.5015649,0.0004774955,0.497539,0.00004799238,0.0003389553,6.948625e-7,7.321768e-7,0.00002325938,0.000006979246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1752541,"threshold_uncertainty_score":0.7669501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2527830873","doi":"10.1007/s10951-018-0582-0","title":"Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Danish Agency for Science and Higher Education; Natural Sciences and Engineering Research Council of Canada","keywords":"Course (navigation); Preprocessor; Computer science; Set (abstract data type); Integer programming; Mathematical optimization; Relaxation (psychology); Linear programming relaxation; Integer (computer science); Mathematics; Artificial intelligence; Programming language; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.121475084416777,"gpt":0.4068748154038947,"spread":0.2853997309871177,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01082117,0.0001875557,0.0004084967,0.0002793879,0.0008221906,0.0006350215,0.0005653633,0.0001011038,0.00007240088],"category_scores_gemma":[0.003054715,0.0001108112,0.0002588817,0.0005970697,0.0001984941,0.000678789,0.00005799975,0.0003123055,0.00002389423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003167523,"about_ca_system_score_gemma":0.0003504522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003546619,"about_ca_topic_score_gemma":0.00002193319,"domain_scores_codex":[0.9968243,0.0001761438,0.001211822,0.000265957,0.001144563,0.0003771762],"domain_scores_gemma":[0.9927363,0.003141721,0.001229029,0.0003522986,0.002373092,0.0001675101],"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.0007576361,0.00167539,0.2912318,0.00017949,0.001431771,0.0000282314,0.0104257,0.2026493,0.005878251,0.01577416,0.009299406,0.4606689],"study_design_scores_gemma":[0.003177694,0.0007408144,0.01651383,0.0003895779,0.0007520184,0.0001497068,0.006993498,0.9379912,0.001864015,0.02374737,0.007236362,0.000443933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.473916,0.001709068,0.5196256,0.003640638,0.0007914472,0.0002140997,0.00001267992,0.00002160871,0.00006886231],"genre_scores_gemma":[0.9236997,0.00002063933,0.0746345,0.0003346107,0.00117329,0.000007813597,0.000001937688,0.00001935921,0.0001080901],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7353419,"threshold_uncertainty_score":0.6323709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761748578","doi":"10.1007/s10951-017-0545-x","title":"Two-stage hybrid flowshop scheduling with simultaneous processing machines","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Beijing Municipal Natural Science Foundation; Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; China Postdoctoral Science Foundation","keywords":"Heuristics; Computer science; Mathematical optimization; Idle; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Heuristic; Integer programming; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01339178228269089,"gpt":0.2608581204676207,"spread":0.2474663381849298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005835203,0.0003119412,0.0004593918,0.0002297077,0.0005953955,0.0006923371,0.0006109882,0.0000781687,0.00004484985],"category_scores_gemma":[0.0005356331,0.0002542807,0.0001309425,0.0001228635,0.00009518766,0.0009206621,0.00005091678,0.0007238162,0.00001325215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008242088,"about_ca_system_score_gemma":0.00012116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007021795,"about_ca_topic_score_gemma":0.000006145598,"domain_scores_codex":[0.9982354,0.0000234293,0.0006460908,0.0002068933,0.0004901285,0.0003980463],"domain_scores_gemma":[0.998192,0.0001095193,0.0005823939,0.0004014454,0.0004703801,0.0002442776],"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.00005789325,0.00002726509,0.0009674135,0.00009662703,0.00008447273,0.0003481794,0.0001926593,0.9729757,0.001501013,0.00002307189,0.000002611084,0.0237231],"study_design_scores_gemma":[0.001424321,0.00007322193,0.00008335685,0.0005518596,0.00007388461,0.0004869405,0.0003293161,0.9918208,0.004646279,0.00004394827,0.0001221044,0.0003440169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.67241,0.001420598,0.3239491,0.0001630772,0.0007188172,0.00008683747,0.000004233376,0.0001597952,0.001087497],"genre_scores_gemma":[0.6172487,0.00007101601,0.38189,0.00003237016,0.0006218699,0.000001321477,0.000001498224,0.00006189218,0.00007138179],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05794089,"threshold_uncertainty_score":0.9999909,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1972282966","doi":"10.1007/s10951-007-0050-8","title":"Preemptive open shop scheduling with multiprocessors: polynomial cases and applications","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Multiprocessor scheduling; Rounding; Time complexity; Multiprocessing; Scheduling (production processes); Open shop; Integer programming; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01826334746394033,"gpt":0.2713019003888697,"spread":0.2530385529249294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415228,0.0001850437,0.0002919058,0.0002331116,0.0001429629,0.0002085206,0.000303547,0.00009971079,0.00001543164],"category_scores_gemma":[0.000140865,0.0001573814,0.00004531259,0.0003436173,0.00006409266,0.0006048758,0.00005552491,0.0004025601,0.000004661895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006810766,"about_ca_system_score_gemma":0.00007858187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007405868,"about_ca_topic_score_gemma":0.00001273371,"domain_scores_codex":[0.9988127,0.00001371948,0.0005150331,0.0001579647,0.0002339891,0.0002665877],"domain_scores_gemma":[0.9988343,0.0002797144,0.0002254807,0.0001292074,0.0003042028,0.0002271669],"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.0003046867,0.0001003651,0.006934204,0.0001097881,0.000251679,0.0001109194,0.001165671,0.9610806,0.001966658,0.0001552023,0.00001922757,0.02780106],"study_design_scores_gemma":[0.01351806,0.001284908,0.006597307,0.002245696,0.0006886612,0.006346618,0.02841287,0.8745717,0.05988644,0.0002434215,0.003681944,0.002522391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4871176,0.00154747,0.5101523,0.00006382596,0.0001466827,0.0002354269,0.000003477131,0.00006614067,0.0006670653],"genre_scores_gemma":[0.5937425,0.00009165419,0.4056591,0.00003164973,0.0004185362,0.000004390206,0.000001572265,0.00003063079,0.00002000014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1066248,"threshold_uncertainty_score":0.6417828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963347283","doi":"10.1007/s10951-019-00622-w","title":"Single-machine scheduling with job-dependent machine deterioration","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Computer science; Single-machine scheduling; Job shop scheduling; Scheduling (production processes); Schedule; Mathematical optimization; Algorithm; Mathematics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01014554047666777,"gpt":0.2135125582657752,"spread":0.2033670177891074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445744,0.0002631914,0.0004080283,0.0003204453,0.00007874006,0.0001721897,0.0002480922,0.000124595,0.0001512897],"category_scores_gemma":[0.00006811682,0.0002157987,0.0001159842,0.0003279519,0.00002367879,0.0006027854,0.00002681668,0.0006029262,0.00006103278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001435809,"about_ca_system_score_gemma":0.00005847124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004202799,"about_ca_topic_score_gemma":0.00000830878,"domain_scores_codex":[0.998266,0.00003832228,0.0006915241,0.0001749658,0.000527676,0.0003015137],"domain_scores_gemma":[0.9989238,0.0000712533,0.0003065846,0.0002196245,0.0003005623,0.0001781659],"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.00005993862,0.00004037207,0.005927532,0.00006158507,0.0001078602,0.00002512257,0.0002250076,0.9618037,0.02703229,0.00003269558,0.00000246003,0.004681455],"study_design_scores_gemma":[0.002170238,0.0004253858,0.0006126277,0.0004151856,0.00008932149,0.0004498936,0.0004272826,0.980018,0.01477387,0.00004842905,0.0001438374,0.0004258881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7338845,0.00171502,0.2625454,0.0001177014,0.0009071461,0.0001141039,0.000003070554,0.0001249842,0.0005881517],"genre_scores_gemma":[0.7101382,0.00007824334,0.2893486,0.0000547302,0.000257602,0.000001256209,0.000004378403,0.00005849497,0.00005846114],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02680325,"threshold_uncertainty_score":0.8800014,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2761740106","doi":"10.1007/s10951-017-0544-y","title":"An implicit model for multi-activity shift scheduling problems","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Construct (python library); Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.3347182439140028,"gpt":0.4707354262469032,"spread":0.1360171823329004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01086166,0.000291062,0.0007703706,0.0005207385,0.002009607,0.001977101,0.00252474,0.0002269457,0.00002349159],"category_scores_gemma":[0.01116267,0.0002250424,0.0006010736,0.0002403164,0.0001914247,0.002871448,0.0001601278,0.0007005628,0.00003202155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008654884,"about_ca_system_score_gemma":0.0005294409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004769717,"about_ca_topic_score_gemma":0.00006267092,"domain_scores_codex":[0.9959928,0.0001322649,0.001361691,0.0005547717,0.001305655,0.000652752],"domain_scores_gemma":[0.9931182,0.0006936149,0.002728452,0.00136314,0.001588906,0.0005076687],"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.0001974081,0.0004993739,0.01358942,0.00002133175,0.0001208943,0.000008822314,0.001169073,0.9397789,0.02462771,0.002360597,0.00003657661,0.01758987],"study_design_scores_gemma":[0.001533156,0.0001721602,0.01007659,0.0001125858,0.00008330742,0.00003933901,0.0002482904,0.9630646,0.001662085,0.02261166,0.0001211757,0.0002751245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4814123,0.0001512655,0.5167575,0.0008912738,0.0005614262,0.0001395593,0.00001261091,0.00002245022,0.000051581],"genre_scores_gemma":[0.6262674,0.00001304731,0.373048,0.00005852903,0.000465734,0.000007132083,5.985827e-7,0.00002651229,0.0001129962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1448551,"threshold_uncertainty_score":0.9992896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977506979","doi":"10.1007/s10951-013-0324-2","title":"A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"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":"Computer science; Heuristic; Scheduling (production processes); Time horizon; Schedule; Work (physics); Integer programming; Mathematical optimization; Operations research; Task (project management); Algorithm; Mathematics; Artificial intelligence; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.1220738627681667,"gpt":0.4204414114669095,"spread":0.2983675486987428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004008728,0.0001497048,0.0005508285,0.0004795321,0.0001881489,0.0003950833,0.0003760399,0.00006120719,0.0001235785],"category_scores_gemma":[0.006271995,0.0001070912,0.0002067744,0.0006201622,0.00009981848,0.0004173891,0.00008477992,0.0002134334,0.00003000909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003769502,"about_ca_system_score_gemma":0.0001110287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006851694,"about_ca_topic_score_gemma":6.542574e-7,"domain_scores_codex":[0.9972938,0.00008385304,0.001154952,0.0002198221,0.0009081771,0.0003394127],"domain_scores_gemma":[0.995294,0.002797658,0.0007441356,0.0002610568,0.0005854832,0.000317711],"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.00153813,0.003368698,0.007361898,0.0003818078,0.001021422,0.00003781053,0.01602925,0.07929142,0.05626263,0.02980972,0.003805934,0.8010913],"study_design_scores_gemma":[0.02027828,0.006476349,0.005465054,0.005208527,0.001319367,0.000434071,0.06826536,0.1058369,0.0537185,0.7231247,0.007645073,0.002227849],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5986603,0.000321906,0.3996805,0.0008391433,0.0001891662,0.0002094231,0.000003128696,0.00001148116,0.0000849346],"genre_scores_gemma":[0.654299,0.000003798386,0.3453481,0.00005185394,0.0001291026,0.00001488204,2.012542e-7,0.00001024627,0.0001428371],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7988634,"threshold_uncertainty_score":0.7508617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067880102","doi":"10.1002/jos.94","title":"Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times","year":2002,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Acadia University; McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Dominance (genetics); Algorithm; Flow shop scheduling; Scheduling (production processes); Branch and bound; Retard; Sequence (biology); Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01849426096806984,"gpt":0.2333307052857025,"spread":0.2148364443176327,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007383233,0.0002282658,0.0003026099,0.000206525,0.0001321281,0.000172286,0.0004954223,0.00006745062,0.0002695342],"category_scores_gemma":[0.0001824686,0.0001129443,0.0000900722,0.0007304452,0.0000384617,0.0002044546,0.00002512634,0.0006379079,0.00003219584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005671913,"about_ca_system_score_gemma":0.00003408947,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007284201,"about_ca_topic_score_gemma":0.00001481501,"domain_scores_codex":[0.9984636,0.00008840551,0.0005266243,0.0001409562,0.0004589624,0.0003214552],"domain_scores_gemma":[0.999058,0.0002458545,0.0001284308,0.0002624995,0.0001409347,0.0001642533],"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.00008191416,0.00005056973,0.0002814974,0.00001388086,0.00005295344,0.0001561496,0.001841502,0.9743122,0.00004208363,0.000008584696,0.0001032239,0.0230554],"study_design_scores_gemma":[0.00138069,0.00009240171,0.0002325493,0.0001837323,0.00005027193,0.0004984195,0.002180657,0.9945702,0.0002127935,0.00002404644,0.0003730695,0.0002011618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.194146,0.003359942,0.788087,0.0106553,0.00128074,0.0005402814,0.00001725175,0.0001766999,0.001736705],"genre_scores_gemma":[0.4261478,0.000225356,0.571887,0.0007627764,0.000631602,0.00001254743,0.000002214123,0.00006918861,0.0002615374],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2320017,"threshold_uncertainty_score":0.4605735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978605753","doi":"10.1023/b:josh.0000031422.02125.97","title":"Predictive, Stochastic and Dynamic Extensions to Aversion Dynamics Scheduling","year":2004,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Risk aversion (psychology); Computer science; Heuristic; Loss aversion; Schedule; Scheduling (production processes); Operations research; Economics; Microeconomics; Expected utility hypothesis; Operations management; Mathematical economics; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.04847535851588778,"gpt":0.3939548206699781,"spread":0.3454794621540903,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002791477,0.0001884786,0.0004488593,0.001037654,0.0003562833,0.0002457279,0.0006478449,0.0001090676,0.00003223193],"category_scores_gemma":[0.008617078,0.0001432825,0.0001439306,0.001082328,0.0001453851,0.0008915043,0.0003341274,0.0007381641,0.00006885053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004632945,"about_ca_system_score_gemma":0.0003127812,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005593128,"about_ca_topic_score_gemma":0.0000184009,"domain_scores_codex":[0.9960276,0.00008812826,0.0009498396,0.0003904892,0.002120814,0.0004230593],"domain_scores_gemma":[0.996279,0.0009494086,0.0004912441,0.0003251435,0.001402501,0.0005527203],"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.0001616622,0.00005462212,0.0001797251,0.000004150355,0.00002353129,0.00008820064,0.0003918119,0.9802787,0.002180189,0.0001545153,0.00000723712,0.01647571],"study_design_scores_gemma":[0.002254668,0.0008957461,0.006215474,0.0005594275,0.00004677987,0.0008400897,0.007483304,0.9226611,0.0003730979,0.05826487,0.00007133804,0.000334055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4389919,0.0002605686,0.5590237,0.001273775,0.00031249,0.0001042243,0.000005923675,0.00001019223,0.00001729209],"genre_scores_gemma":[0.8189988,0.00004550468,0.1806456,0.00008440859,0.0001366661,0.000001394462,7.068166e-7,0.00001943907,0.00006754023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3800069,"threshold_uncertainty_score":0.9997337,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073418197","doi":"10.1007/s10951-012-0277-x","title":"A branch and bound algorithm for the response time variability problem","year":2012,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and bound; Computer science; Mathematical optimization; Scheduling (production processes); Integer programming; Algorithm; Range (aeronautics); Linear programming; Upper and lower bounds; Branch and cut; Integer (computer science); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007735413333746032,"gpt":0.2306258595686345,"spread":0.2228904462348885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00286021,0.00007817861,0.000140366,0.00004622323,0.00008217778,0.00004566785,0.00007515622,0.00005206868,0.000006970981],"category_scores_gemma":[0.0003305328,0.00005596559,0.00004672486,0.00008547238,0.00001798635,0.0003137665,0.00001376753,0.000160362,0.000002146553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005645653,"about_ca_system_score_gemma":0.00003085223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.384334e-7,"about_ca_topic_score_gemma":9.326924e-8,"domain_scores_codex":[0.9993502,0.00004858871,0.0002754488,0.00004456184,0.0001117352,0.000169457],"domain_scores_gemma":[0.9990779,0.0005615156,0.00009778496,0.00008381847,0.0001116857,0.00006729212],"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.0004560218,0.0001578777,0.006974543,0.0002814072,0.0004869709,0.000002921062,0.003950147,0.7579965,0.09191498,0.0002065387,0.0008006702,0.1367714],"study_design_scores_gemma":[0.0005739684,0.00005900807,0.006303671,0.00006417484,0.00007534518,0.0001111527,0.00006572996,0.9893247,0.001690075,0.0003137826,0.001304822,0.0001135197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2856395,0.000822842,0.7129368,0.0001958674,0.0002156002,0.0001288311,0.000002013666,0.00002328227,0.00003526207],"genre_scores_gemma":[0.6791309,0.00002830693,0.3203194,0.00001661583,0.0004607918,0.00000379142,4.077311e-7,0.00001863226,0.00002117683],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3934914,"threshold_uncertainty_score":0.228221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2607302740","doi":"10.1007/s10951-017-0518-0","title":"Scheduling shared continuous resources on many-cores","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Time complexity; Heuristic; Mathematical optimization; Job scheduler; Parallel computing; Shared resource; Distributed computing; Algorithm; Schedule; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01868528415120394,"gpt":0.2527342819635062,"spread":0.2340489978123022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312926,0.0002348537,0.0004212601,0.0002611361,0.0004234713,0.0006114011,0.0007022007,0.0001501718,0.00008052811],"category_scores_gemma":[0.0006973493,0.0002116253,0.0001981519,0.00008523848,0.00006972567,0.0005207051,0.00005229326,0.0006487885,0.00005192956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006709649,"about_ca_system_score_gemma":0.00003298911,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004027679,"about_ca_topic_score_gemma":0.000001074065,"domain_scores_codex":[0.9984097,0.00002683681,0.0006336077,0.0001621061,0.0004387252,0.0003290355],"domain_scores_gemma":[0.9984865,0.0001086282,0.0005108968,0.0004269327,0.0002591781,0.000207842],"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.00008014344,0.00004763155,0.002835229,0.00005331661,0.0001662905,0.0001317307,0.0006786431,0.982702,0.002093455,0.000292489,0.0001523444,0.01076675],"study_design_scores_gemma":[0.003039213,0.0003203259,0.00914757,0.001600592,0.0001332958,0.0002409279,0.001491439,0.9669678,0.01341019,0.0005054207,0.002364312,0.0007789232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.954228,0.001250238,0.03792109,0.0004807601,0.002019437,0.00008554188,0.000005081541,0.0001572589,0.003852587],"genre_scores_gemma":[0.8115088,0.000166435,0.1869906,0.00008043992,0.001089687,0.000001716475,0.000001282783,0.00005490796,0.000106113],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1490695,"threshold_uncertainty_score":0.8629831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991396184","doi":"10.1007/s10951-009-0128-6","title":"Open-shop dense schedules: properties and worst-case performance ratio","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematical proof; Job shop scheduling; Open shop; Schedule; Heuristic; Computer science; Mathematical optimization; Mathematics; Construct (python library); Scheduling (production processes); Combinatorics; Discrete mathematics; Flow shop scheduling","retraction":null,"screen_n_in":null,"score":{"opus":0.03315531448050888,"gpt":0.2392811098692687,"spread":0.2061257953887599,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290989,0.0001668581,0.0002718556,0.0001720069,0.0001456593,0.0003311774,0.0002383727,0.00008370419,0.00002136088],"category_scores_gemma":[0.0001115375,0.0001388986,0.00004869468,0.0002109817,0.00003403708,0.0009038683,0.00003651237,0.0003728315,0.000009051042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004505979,"about_ca_system_score_gemma":0.00005476228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001007944,"about_ca_topic_score_gemma":8.115366e-7,"domain_scores_codex":[0.9989643,0.00002496418,0.000500018,0.0001137381,0.0001886226,0.0002084333],"domain_scores_gemma":[0.9993287,0.0000288701,0.0001397503,0.0001330703,0.0002086536,0.0001609639],"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.00008491227,0.00005930227,0.0007600931,0.00007942584,0.00007651535,0.0003554125,0.001119119,0.9614744,0.003623788,0.0002297909,0.00003835538,0.03209893],"study_design_scores_gemma":[0.001156821,0.0002054072,0.0003208177,0.000443859,0.00004886913,0.003987924,0.001364518,0.9811361,0.01085326,0.00008245275,0.0001123648,0.0002875933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.959928,0.003042271,0.03593069,0.0002681795,0.0003276385,0.0001033238,5.594308e-7,0.00006033055,0.0003389547],"genre_scores_gemma":[0.7849779,0.0005835937,0.2140387,0.0001105206,0.0002291508,0.000001006712,4.397768e-7,0.00001849716,0.0000402062],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.178108,"threshold_uncertainty_score":0.5664119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1493797193","doi":"10.1023/a:1022952324290","title":"Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Multiprocessor scheduling; Processor scheduling; Scheduling (production processes); Distributed computing; Fair-share scheduling; Rate-monotonic scheduling; Operating system; Mathematical optimization; Schedule; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01129938630170956,"gpt":0.228047766069577,"spread":0.2167483797678675,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00147223,0.0002184965,0.0005221139,0.0007704992,0.0002052617,0.0001107905,0.0002367774,0.0000763206,0.00005069708],"category_scores_gemma":[0.0007158512,0.0001781457,0.0001663922,0.0009872571,0.00006962785,0.001469253,0.00004708608,0.0003543216,0.00001322464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005403716,"about_ca_system_score_gemma":0.00006120781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005467334,"about_ca_topic_score_gemma":0.000002302527,"domain_scores_codex":[0.9982588,0.00001719983,0.0007736075,0.0001832123,0.0004269116,0.0003402318],"domain_scores_gemma":[0.9968709,0.00007146342,0.001954659,0.0001793064,0.000893906,0.00002980149],"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.002052368,0.001102578,0.187137,0.003195146,0.001521512,0.000505333,0.002080154,0.5231587,0.2043372,0.06057455,0.00002153696,0.01431389],"study_design_scores_gemma":[0.01609326,0.0006665309,0.01913957,0.01570058,0.005629026,0.0007555934,0.03656689,0.7368342,0.1335816,0.02304338,0.007575097,0.004414257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8643072,0.00014354,0.1346597,0.00009759872,0.0002339123,0.00007890533,5.822313e-7,0.00002116513,0.0004573964],"genre_scores_gemma":[0.9598637,0.00002347653,0.03913406,0.0001774366,0.0007265121,0.000001965602,0.00000247311,0.00003923186,0.00003110068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2136754,"threshold_uncertainty_score":0.726457,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4395683568","doi":"10.1007/s10951-024-00808-x","title":"Short-term underground mine planning with uncertain activity durations using constraint programming","year":2024,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":7,"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":"Term (time); Constraint (computer-aided design); Computer science; Operations research; Constraint programming; Mathematical optimization; Supply chain management; Supply chain; Business; Mathematics; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.05302174323847721,"gpt":0.300767802786175,"spread":0.2477460595476978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067679,0.0001318103,0.0001984783,0.0001680974,0.00007251358,0.0002374172,0.00008882194,0.00006681375,0.000009797533],"category_scores_gemma":[0.00001251291,0.0001145614,0.00007146255,0.0001316617,0.00003602199,0.0004350089,0.00001466442,0.0003911041,7.433652e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002083733,"about_ca_system_score_gemma":0.00007897007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003488872,"about_ca_topic_score_gemma":0.000004405205,"domain_scores_codex":[0.9992898,0.000009255337,0.0003073751,0.00009570317,0.0001011249,0.0001967844],"domain_scores_gemma":[0.9996706,0.00006600208,0.00006274069,0.00007943297,0.0000411609,0.00008004752],"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.0000286064,0.00002597321,0.003372505,0.0002709707,0.0003170945,0.000455719,0.000863109,0.9293318,0.03168102,0.0005557226,0.00003049673,0.03306696],"study_design_scores_gemma":[0.0001771,0.0001358419,0.0004709071,0.00174356,0.0001150911,0.001930793,0.0008707431,0.9900527,0.00358498,0.0001855093,0.0004351072,0.0002976904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6796344,0.0003841061,0.3194876,0.00004407277,0.0001807777,0.00004805202,0.000001247325,0.00009931408,0.0001204488],"genre_scores_gemma":[0.8276209,0.00002490669,0.1720877,0.000003859453,0.0002276885,0.000001551757,8.65818e-7,0.00002854458,0.000004073202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1479865,"threshold_uncertainty_score":0.4671679,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010898123","doi":"10.1007/s10951-006-8596-4","title":"A case study of mutual routing-scheduling reformulation","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Japan Society for the Promotion of Science; University College Cork; University of Glasgow","keywords":"Computer science; Vehicle routing problem; Scheduling (production processes); Mathematical optimization; Software; Job shop scheduling; Key (lock); Combinatorial optimization; Operations research; Constraint programming; Industrial engineering; Routing (electronic design automation); Mathematics; Algorithm; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.0248211093843664,"gpt":0.2835155563058206,"spread":0.2586944469214543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00135805,0.0001475216,0.0003389711,0.0002850693,0.0000830278,0.00004008439,0.0001279063,0.00008789086,0.00001096248],"category_scores_gemma":[0.0001866914,0.0001401024,0.00009921996,0.0003888162,0.00001458143,0.0003342,0.00002606026,0.0003619206,0.000001468867],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001064602,"about_ca_system_score_gemma":0.000034115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005141621,"about_ca_topic_score_gemma":0.00001225815,"domain_scores_codex":[0.9981793,0.00009088813,0.001099707,0.00009809036,0.0003361502,0.000195897],"domain_scores_gemma":[0.9988412,0.0001413594,0.0004871244,0.0001518311,0.0003150085,0.00006347629],"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.00001481101,0.000104311,0.009566273,0.00002937695,0.00005098397,0.000370567,0.001279174,0.980709,0.005964966,0.00004539165,0.000002504125,0.001862669],"study_design_scores_gemma":[0.001403344,0.0001941596,0.001169448,0.0001092807,0.00009220517,0.002740745,0.005139044,0.9848105,0.004096997,0.00006693567,0.0000067901,0.0001705955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7849489,0.0001083403,0.2143492,0.000008129392,0.0002557295,0.0000883269,5.242176e-7,0.00005103159,0.0001897902],"genre_scores_gemma":[0.7584872,0.000003363354,0.2411538,0.000003044901,0.0003142701,7.012995e-7,5.116519e-7,0.00003032866,0.000006854314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02680452,"threshold_uncertainty_score":0.5713212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123331415","doi":"10.1007/s10951-014-0396-7","title":"Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Mathematical optimization; Computer science; Scheme (mathematics); Time complexity; Supply chain; Due date; Polynomial; Retard; Holding cost; Polynomial-time approximation scheme; Supply chain management; Mathematics; Job shop scheduling; Algorithm; Schedule; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01179867429822715,"gpt":0.2104790112736555,"spread":0.1986803369754283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001077314,0.0001550377,0.0002853967,0.0006569306,0.00008137021,0.000227599,0.0001947262,0.00005228788,0.000107111],"category_scores_gemma":[0.0002127874,0.000146383,0.0000757691,0.0003218623,0.00002509647,0.001089778,0.0001364077,0.0001626444,0.0000840385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008277953,"about_ca_system_score_gemma":0.00001795588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009880014,"about_ca_topic_score_gemma":0.00001671442,"domain_scores_codex":[0.9987779,0.00002450587,0.0004795165,0.0001729739,0.0003047446,0.000240339],"domain_scores_gemma":[0.9992524,0.00007342739,0.0003039801,0.0001009368,0.0002303733,0.0000389157],"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.003285137,0.001164529,0.3624912,0.001314657,0.0005467244,0.0005238524,0.002413846,0.3615375,0.0454804,0.01491542,0.0208471,0.1854797],"study_design_scores_gemma":[0.008751117,0.0002475295,0.1815485,0.00183201,0.0003008702,0.00005395545,0.004823731,0.7508715,0.0006935907,0.0005669329,0.04902762,0.001282574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9929304,0.0001361201,0.003565155,0.001500743,0.0003940066,0.0001438299,5.692863e-7,0.00001685352,0.001312336],"genre_scores_gemma":[0.9885138,0.00003193918,0.007963114,0.002118503,0.001219965,0.000003971106,0.000004462875,0.00002123281,0.0001230058],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3893341,"threshold_uncertainty_score":0.5969325,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126394800","doi":"10.1007/s10951-006-7041-z","title":"On the connection between a cyclic job shop and a reentrant flow shop scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Reentrancy; Flow shop scheduling; Job shop; Job shop scheduling; Computer science; Flow (mathematics); Mathematical optimization; Scheduling (production processes); Mathematics; Schedule; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01274153345171136,"gpt":0.2172254222996539,"spread":0.2044838888479425,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009144699,0.0002249367,0.0003261653,0.0002311836,0.0002151531,0.0001825352,0.0001789058,0.0001179969,0.00003156246],"category_scores_gemma":[0.0001571511,0.0001664467,0.0001300723,0.0003293357,0.00004803444,0.0002413991,0.00001988025,0.0006905968,0.000009630161],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008366878,"about_ca_system_score_gemma":0.00003563261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006425051,"about_ca_topic_score_gemma":0.000003852977,"domain_scores_codex":[0.9984157,0.00006097153,0.0006848819,0.0001605327,0.0003733262,0.000304592],"domain_scores_gemma":[0.9989805,0.0003845707,0.0002037965,0.0001512625,0.0001604291,0.0001194675],"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.00002282414,0.00002092618,0.002263909,0.0000369933,0.00009152562,0.00001471986,0.0001696421,0.9922267,0.001300599,0.0008568052,0.00005454722,0.002940869],"study_design_scores_gemma":[0.001048475,0.0001217363,0.001391566,0.0004792965,0.0001151535,0.000156757,0.0005339064,0.9905754,0.003078698,0.002103749,0.0000993451,0.0002958953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8052419,0.0009300316,0.1917615,0.000869661,0.000359225,0.0001388112,0.000003170678,0.0001038915,0.0005917787],"genre_scores_gemma":[0.8289565,0.0001247606,0.1699369,0.00005620451,0.0008519935,0.000004011657,0.000002878415,0.00004339126,0.00002335645],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02371457,"threshold_uncertainty_score":0.6787499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092058125","doi":"10.1007/s10951-009-0149-1","title":"On a reduction of the interval coloring problem to a series of bandwidth coloring problems","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université Laval","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Complete coloring; Edge coloring; Greedy coloring; Graph coloring; Vertex (graph theory); Interval (graph theory); Discrete mathematics; Integer (computer science); Graph; Brooks' theorem; Computer science; Graph power; Chordal graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.07491560948366902,"gpt":0.3436436124589847,"spread":0.2687280029753156,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005766149,0.0001341493,0.000455209,0.0004981448,0.0002003712,0.0001063572,0.0008254613,0.00009392847,0.00004715607],"category_scores_gemma":[0.005955035,0.00008226244,0.0003040278,0.001243596,0.0001518376,0.0004382644,0.0001412948,0.000698678,0.000008816471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003999455,"about_ca_system_score_gemma":0.0002617983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002100581,"about_ca_topic_score_gemma":0.00002809303,"domain_scores_codex":[0.9968081,0.0001282789,0.001390956,0.0002092491,0.001224544,0.0002389007],"domain_scores_gemma":[0.9962219,0.0005363376,0.001443849,0.0003957136,0.001268139,0.0001340766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0006499761,0.0003752582,0.01042961,0.00006224938,0.0001577302,0.000003562154,0.005887406,0.2477056,0.7139635,0.01326262,0.0002557983,0.007246619],"study_design_scores_gemma":[0.00335749,0.004163201,0.02977622,0.004438461,0.0003683871,0.00117919,0.01153768,0.008917186,0.8166237,0.1136715,0.005182342,0.0007846687],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9924554,0.00005355744,0.002930211,0.001765202,0.00211574,0.000187131,0.000003055603,0.0000097571,0.000479953],"genre_scores_gemma":[0.9465901,0.000005522142,0.05288894,0.00002165501,0.0002509428,0.000004526591,8.17566e-8,0.00001169498,0.0002265464],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2387885,"threshold_uncertainty_score":0.7129163,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136004943","doi":"10.1007/s10951-009-0139-3","title":"Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki","keywords":"Job shop scheduling; Minification; Computer science; Time complexity; Scheduling (production processes); Schedule; Mathematical optimization; Running time; Single-machine scheduling; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02240112904978402,"gpt":0.2536726972704223,"spread":0.2312715682206383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170946,0.0001957379,0.0003955596,0.0004413743,0.00004476043,0.0000603771,0.0001636892,0.00012896,0.00001976811],"category_scores_gemma":[0.0002288708,0.0001857755,0.00008658102,0.0003145493,0.00002786622,0.0002466909,0.00001221537,0.0003379486,0.000004415144],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005683763,"about_ca_system_score_gemma":0.0000243574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001480761,"about_ca_topic_score_gemma":9.612268e-7,"domain_scores_codex":[0.9985685,0.00003907953,0.0007427884,0.0001365182,0.0002942788,0.0002187907],"domain_scores_gemma":[0.9992533,0.00009745311,0.0002628431,0.0001189473,0.0001499906,0.0001174665],"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.00006093325,0.0001432575,0.001005793,0.00003401539,0.00002616145,0.00001367585,0.0003714169,0.9788566,0.01038412,0.00004929194,0.000004098206,0.009050639],"study_design_scores_gemma":[0.001680945,0.0002068399,0.003612779,0.0004296248,0.00003298557,0.00004877599,0.0001987416,0.9886525,0.004852021,0.00007436706,0.0000125767,0.0001978237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9032843,0.001584872,0.09421899,0.0002544437,0.0002831524,0.00009593695,0.000002144189,0.00006024,0.0002158912],"genre_scores_gemma":[0.5967784,0.0001559181,0.4028341,0.0000620766,0.0001247872,4.53529e-7,0.000002064145,0.00002117307,0.00002102581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3086151,"threshold_uncertainty_score":0.7575703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007684460","doi":"10.1007/s10951-013-0341-1","title":"Scheduling semi-malleable jobs to minimize mean flow time","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Job shop scheduling; Dynamic programming; Flow shop scheduling; Set (abstract data type); Parallel computing; Algorithm; Mathematics; Operating system; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.009737137138782662,"gpt":0.2106612866603317,"spread":0.200924149521549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000629934,0.0002939251,0.0005045662,0.0004073186,0.0001243197,0.0002554882,0.00041696,0.0001742454,0.001001799],"category_scores_gemma":[0.0003154757,0.0002761116,0.0002112707,0.0005058436,0.00002493923,0.0006335677,0.00005386762,0.0005773636,0.001148392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000133301,"about_ca_system_score_gemma":0.00007292885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006419978,"about_ca_topic_score_gemma":6.356394e-7,"domain_scores_codex":[0.9978757,0.00004146402,0.0008953326,0.0001988221,0.0004889065,0.0004997925],"domain_scores_gemma":[0.9983716,0.000147166,0.0001937411,0.0002568697,0.0005260798,0.0005045631],"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.00001273982,0.00002726903,0.0001699114,0.00002953054,0.0001046511,0.00001436456,0.0005168514,0.9843026,0.009687371,0.0000108169,0.0006176484,0.004506281],"study_design_scores_gemma":[0.0007510865,0.00006405437,0.00018651,0.0002907538,0.00004699676,0.0001034821,0.0005847691,0.9909573,0.006082326,0.0001028999,0.0004667555,0.0003630735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4885845,0.001211857,0.505142,0.0009010541,0.001555223,0.0002441866,0.000003686885,0.00029304,0.002064453],"genre_scores_gemma":[0.1723785,0.00008594402,0.8259151,0.0002782833,0.0008650733,0.000007859224,0.000002720756,0.00008641522,0.0003801069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3207731,"threshold_uncertainty_score":0.9999691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000464179","doi":"10.1007/s10951-019-00633-7","title":"Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multiprocessing; Computer science; Open shop; Scheduling (production processes); Job shop scheduling; Approximation algorithm; Flow shop scheduling; Multiprocessor scheduling; Algorithm; Mathematical optimization; Parallel computing; Flow (mathematics); Mathematics; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.04372960983289673,"gpt":0.3190339961306103,"spread":0.2753043862977136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006859312,0.0004076935,0.0006454218,0.0002251579,0.000191432,0.0005641485,0.0004831764,0.0001248886,0.0001523328],"category_scores_gemma":[0.0002337247,0.0003515494,0.0001072572,0.0005923172,0.00006576724,0.001100824,0.0001630254,0.000881522,0.00001987851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001126884,"about_ca_system_score_gemma":0.0001643692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001183297,"about_ca_topic_score_gemma":0.000002697288,"domain_scores_codex":[0.9975867,0.00008691953,0.0008921122,0.0003662819,0.0006490187,0.0004189563],"domain_scores_gemma":[0.9984399,0.000106985,0.0003638692,0.0002151295,0.0002977351,0.0005763746],"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.0002176191,0.00007558792,0.0009761226,0.00009786715,0.0002048177,0.0001233062,0.00249406,0.988977,0.002602389,0.00008747682,0.00001131888,0.004132483],"study_design_scores_gemma":[0.004804912,0.0003085582,0.00002456812,0.0002300731,0.00007438418,0.0001580814,0.003332991,0.9837164,0.006697171,0.00002534967,0.0002052528,0.0004223171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.3940495,0.001881406,0.60165,0.0008661081,0.000317758,0.0003300901,0.00001291737,0.000165283,0.0007269806],"genre_scores_gemma":[0.3649132,0.0001124049,0.6340333,0.0003854013,0.0004065233,0.000007879433,0.00001171902,0.00008279017,0.00004673236],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03238335,"threshold_uncertainty_score":0.9998937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}