{"meta":{"query_hash":"65952cc4235e","filters":{"venue":"Journal of Scheduling"},"cohort_total":62,"direct_labels_cover":0,"predictions_cover":62,"exported":62,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/65952cc4235e","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Scheduling"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03700141970528022,"score_gpt":0.24291989770662076,"score_spread":0.20591847800134055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485398007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07405537,0.00036324066,0.923935,0.000019114377,0.00033566172,0.00002546406,7.978191e-7,0.000023101129,0.0012422245],"genre_scores_gemma":[0.63554543,0.000062104984,0.36432844,0.0000051533743,0.000043386688,1.3409627e-7,4.4830102e-7,0.000009520001,0.0000053600925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993612,0.000015671376,0.000331455,0.00004366775,0.00013380796,0.0001142084],"domain_scores_gemma":[0.9995974,0.000043167518,0.00012807344,0.000081430924,0.00009493784,0.000055045413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018405484,0.0000730504,0.00019607884,0.000078354184,0.000029139032,0.0000106380085,0.000075440425,0.00004065432,0.000034714492],"category_scores_gemma":[0.00016155707,0.00007183573,0.000057135858,0.00007642189,0.000035184476,0.00011797981,0.0000061215137,0.0001920743,0.0000023455316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048381235,0.000021108328,0.000056309913,0.000048029517,0.000027667591,0.000002868633,0.00006544023,0.9963769,0.0012702324,0.0016776188,0.0000063592,0.0004426815],"study_design_scores_gemma":[0.000839645,0.00008883942,0.0008367991,0.00022977813,0.00007801959,0.000064358625,0.00019622344,0.91497993,0.057205956,0.025076037,0.00017049802,0.00023391584],"about_ca_topic_score_codex":7.663186e-7,"about_ca_topic_score_gemma":7.23601e-7,"teacher_disagreement_score":0.56149006,"about_ca_system_score_codex":0.000038135968,"about_ca_system_score_gemma":0.000015611791,"threshold_uncertainty_score":0.29293764},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011299386301709558,"score_gpt":0.22804776606957702,"score_spread":0.21674837976786746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493797193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86430717,0.00014354003,0.13465972,0.00009759872,0.00023391235,0.00007890533,5.8223134e-7,0.000021165131,0.00045739635],"genre_scores_gemma":[0.9598637,0.00002347653,0.039134055,0.00017743657,0.0007265121,0.0000019656015,0.0000024731103,0.000039231858,0.000031100677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982588,0.000017199825,0.00077360746,0.0001832123,0.00042691157,0.00034023175],"domain_scores_gemma":[0.9968709,0.00007146342,0.0019546594,0.00017930637,0.000893906,0.000029801491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722302,0.0002184965,0.0005221139,0.00077049923,0.00020526169,0.00011079055,0.00023677737,0.000076320604,0.00005069708],"category_scores_gemma":[0.0007158512,0.00017814568,0.00016639222,0.0009872571,0.00006962785,0.0014692534,0.000047086083,0.00035432156,0.000013224635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020523677,0.0011025781,0.187137,0.0031951456,0.0015215117,0.00050533295,0.002080154,0.5231587,0.20433721,0.060574546,0.000021536958,0.014313891],"study_design_scores_gemma":[0.016093263,0.0006665309,0.019139575,0.01570058,0.005629026,0.0007555934,0.036566887,0.73683417,0.13358162,0.023043381,0.0075750966,0.0044142567],"about_ca_topic_score_codex":0.0000054673337,"about_ca_topic_score_gemma":0.0000023025266,"teacher_disagreement_score":0.21367544,"about_ca_system_score_codex":0.000054037162,"about_ca_system_score_gemma":0.000061207815,"threshold_uncertainty_score":0.726457},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.00810058617292611,"score_gpt":0.22260195353021106,"score_spread":0.21450136735728495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558369927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713647,0.0013652825,0.02624951,0.000036316225,0.00022455845,0.00008010173,4.8866457e-7,0.00003391795,0.0006451383],"genre_scores_gemma":[0.74573106,0.00013961011,0.25398365,0.000019476565,0.00008513711,0.0000022630088,4.536547e-7,0.000031759868,0.0000065843565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.00003628658,0.0005761772,0.00014791788,0.00025286363,0.00029711414],"domain_scores_gemma":[0.999405,0.00008405724,0.00012901696,0.00009046244,0.00016767952,0.00012375935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006706703,0.00018909,0.00033578725,0.00045207294,0.000039293307,0.00007672951,0.00011132643,0.0001031235,0.000018706385],"category_scores_gemma":[0.00027880847,0.00016867022,0.000033991495,0.0005484766,0.000028617713,0.00042780465,0.000008267139,0.00060650724,0.0000032839555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027458877,0.00003618901,0.02412912,0.00009261685,0.000021527138,0.00007645238,0.000709335,0.9730736,0.00043536542,0.000055101158,4.667266e-7,0.0013427724],"study_design_scores_gemma":[0.0030155173,0.00012805697,0.0025854285,0.0014401461,0.000026915894,0.00033738802,0.0039573545,0.98432076,0.0035508208,0.00018385403,0.00003115009,0.0004226028],"about_ca_topic_score_codex":0.000003916173,"about_ca_topic_score_gemma":0.00001996234,"teacher_disagreement_score":0.22773413,"about_ca_system_score_codex":0.00008556719,"about_ca_system_score_gemma":0.00008964613,"threshold_uncertainty_score":0.68781716},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.06805300057024483,"score_gpt":0.3062754475526015,"score_spread":0.23822244698235667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1729082581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014514449,0.00010247074,0.9366627,0.0423096,0.00034206582,0.0004711873,0.0000010644993,0.00001986946,0.005576589],"genre_scores_gemma":[0.8118578,0.00005720224,0.18556511,0.0021425074,0.00016163196,0.000018851857,7.6024304e-7,0.000008814745,0.00018730432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987012,0.00023209098,0.00033438546,0.000118289165,0.00044075417,0.00017324656],"domain_scores_gemma":[0.9975239,0.0014249407,0.00034943217,0.00019879863,0.00045697126,0.000045971807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027039626,0.00008736192,0.00011035068,0.000076895885,0.00062862644,0.0005078498,0.0006326638,0.000032353055,0.000018014813],"category_scores_gemma":[0.0006592978,0.00004386417,0.00007586001,0.000304348,0.000046768884,0.00055880466,0.00003356843,0.00033389672,0.000004966003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001730167,0.000036483685,0.0001902318,0.0000081865255,0.000028617113,0.0000014680716,0.00090997113,0.16688344,0.0006319404,0.8295258,0.00030976618,0.0014567596],"study_design_scores_gemma":[0.001032429,0.00092631654,0.00039720058,0.0005072649,0.00001758926,0.00003931746,0.002042071,0.93459463,0.010606912,0.034964837,0.014646916,0.00022450011],"about_ca_topic_score_codex":0.0000016650291,"about_ca_topic_score_gemma":0.0000032908854,"teacher_disagreement_score":0.7973434,"about_ca_system_score_codex":0.000059625323,"about_ca_system_score_gemma":0.00018135458,"threshold_uncertainty_score":0.48972073},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.042709024643524704,"score_gpt":0.24542468184322502,"score_spread":0.2027156571997003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965105237","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5573155,0.0023672753,0.4372834,0.00011564587,0.0016156605,0.00013113371,0.000014746318,0.00022549617,0.0009311406],"genre_scores_gemma":[0.49610522,0.00024717854,0.50286156,0.00006440289,0.00060911244,0.0000021594612,0.000005426106,0.000059643742,0.000045295455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977996,0.000044198394,0.0010219421,0.00018824285,0.00043398258,0.00051206205],"domain_scores_gemma":[0.99865407,0.00007268709,0.00033313368,0.00023630596,0.00040326637,0.0003005254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092544407,0.00030486519,0.0004633109,0.00041894108,0.0001195189,0.00007608221,0.00042286585,0.0001626182,0.00020509737],"category_scores_gemma":[0.00018547993,0.00028465662,0.000218647,0.00047041714,0.000050599818,0.00049821154,0.000049564303,0.0008350916,0.00003532475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002649061,0.00011768909,0.002816058,0.00008051491,0.0001630199,0.000052304807,0.0016733139,0.98507905,0.0037454406,0.00015999956,0.000019399391,0.006066693],"study_design_scores_gemma":[0.002077459,0.00014876072,0.0014466371,0.0006837557,0.0001099871,0.00043874906,0.001641988,0.980978,0.011181258,0.0005729423,0.00015262976,0.00056780287],"about_ca_topic_score_codex":0.000010146845,"about_ca_topic_score_gemma":0.000006312812,"teacher_disagreement_score":0.06557817,"about_ca_system_score_codex":0.000099803074,"about_ca_system_score_gemma":0.00009075348,"threshold_uncertainty_score":0.99996054},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018263347463940326,"score_gpt":0.2713019003888697,"score_spread":0.2530385529249294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972282966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48711765,0.0015474705,0.5101523,0.00006382596,0.00014668274,0.00023542685,0.0000034771313,0.000066140674,0.0006670653],"genre_scores_gemma":[0.5937425,0.00009165419,0.4056591,0.00003164973,0.0004185362,0.000004390206,0.000001572265,0.00003063079,0.000020000136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881274,0.000013719478,0.00051503314,0.00015796466,0.00023398908,0.00026658768],"domain_scores_gemma":[0.99883425,0.00027971438,0.00022548067,0.0001292074,0.00030420278,0.0002271669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415228,0.00018504365,0.00029190577,0.00023311158,0.00014296289,0.00020852062,0.000303547,0.000099710785,0.000015431637],"category_scores_gemma":[0.00014086501,0.00015738144,0.00004531259,0.00034361726,0.00006409266,0.0006048758,0.00005552491,0.00040256005,0.000004661895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003046867,0.00010036514,0.006934204,0.00010978808,0.00025167898,0.00011091943,0.0011656712,0.96108055,0.001966658,0.00015520229,0.000019227573,0.02780106],"study_design_scores_gemma":[0.013518056,0.0012849079,0.0065973066,0.0022456963,0.0006886612,0.0063466183,0.028412867,0.8745717,0.05988644,0.00024342154,0.0036819442,0.0025223906],"about_ca_topic_score_codex":0.000007405868,"about_ca_topic_score_gemma":0.000012733706,"teacher_disagreement_score":0.10662481,"about_ca_system_score_codex":0.00006810766,"about_ca_system_score_gemma":0.00007858187,"threshold_uncertainty_score":0.6417828},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12207386276816669,"score_gpt":0.4204414114669095,"score_spread":0.2983675486987428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977506979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59866035,0.00032190603,0.39968047,0.0008391433,0.00018916615,0.0002094231,0.0000031286957,0.000011481157,0.0000849346],"genre_scores_gemma":[0.65429896,0.0000037983862,0.3453481,0.000051853942,0.00012910264,0.000014882043,2.0125415e-7,0.000010246267,0.00014283709],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972938,0.00008385304,0.001154952,0.00021982206,0.0009081771,0.00033941268],"domain_scores_gemma":[0.995294,0.0027976579,0.00074413564,0.00026105685,0.00058548315,0.00031771103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040087276,0.00014970482,0.00055082847,0.00047953211,0.0001881489,0.00039508328,0.00037603988,0.00006120719,0.00012357852],"category_scores_gemma":[0.006271995,0.00010709119,0.0002067744,0.0006201622,0.000099818484,0.00041738912,0.00008477992,0.00021343344,0.000030009087],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015381295,0.0033686976,0.007361898,0.00038180783,0.0010214222,0.000037810532,0.016029252,0.07929142,0.056262627,0.029809717,0.0038059338,0.80109125],"study_design_scores_gemma":[0.020278275,0.006476349,0.005465054,0.005208527,0.0013193667,0.00043407103,0.06826536,0.10583691,0.053718504,0.7231247,0.0076450733,0.0022278489],"about_ca_topic_score_codex":0.000006851694,"about_ca_topic_score_gemma":6.542574e-7,"teacher_disagreement_score":0.7988634,"about_ca_system_score_codex":0.000037695016,"about_ca_system_score_gemma":0.00011102872,"threshold_uncertainty_score":0.7508617},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04847535851588778,"score_gpt":0.3939548206699781,"score_spread":0.3454794621540903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978605753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43899187,0.0002605686,0.5590237,0.0012737749,0.00031248995,0.00010422425,0.0000059236754,0.000010192234,0.000017292088],"genre_scores_gemma":[0.81899875,0.000045504676,0.18064559,0.00008440859,0.00013666612,0.0000013944622,7.068166e-7,0.000019439074,0.000067540226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602765,0.00008812826,0.0009498396,0.00039048918,0.0021208143,0.00042305927],"domain_scores_gemma":[0.996279,0.0009494086,0.0004912441,0.00032514348,0.0014025009,0.0005527203],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0027914771,0.00018847862,0.00044885933,0.0010376535,0.00035628333,0.00024572795,0.00064784486,0.000109067616,0.000032231932],"category_scores_gemma":[0.008617078,0.00014328246,0.00014393064,0.0010823276,0.00014538514,0.0008915043,0.00033412743,0.0007381641,0.00006885053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016166225,0.000054622116,0.00017972515,0.000004150355,0.000023531285,0.000088200635,0.00039181192,0.9802787,0.0021801891,0.00015451534,0.00000723712,0.016475707],"study_design_scores_gemma":[0.0022546677,0.00089574605,0.006215474,0.0005594275,0.00004677987,0.0008400897,0.0074833035,0.9226611,0.0003730979,0.058264874,0.00007133804,0.000334055],"about_ca_topic_score_codex":0.000005593128,"about_ca_topic_score_gemma":0.0000184009,"teacher_disagreement_score":0.38000688,"about_ca_system_score_codex":0.00046329448,"about_ca_system_score_gemma":0.0003127812,"threshold_uncertainty_score":0.99973375},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0902862258790321,"score_gpt":0.2521157075287561,"score_spread":0.16182948164972402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985603248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85936075,0.043690212,0.09414194,0.00015768048,0.00054063293,0.00047813656,0.0000031185373,0.00018000296,0.00144754],"genre_scores_gemma":[0.7689215,0.0032216674,0.22736593,0.000017486802,0.0003675749,0.000021641426,0.0000018411309,0.000059405527,0.00002297087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981794,0.000058154536,0.0009757299,0.00013510806,0.00030996758,0.00034169012],"domain_scores_gemma":[0.99865013,0.00026831517,0.00035681395,0.00030919592,0.00026005178,0.00015548182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011017846,0.000216394,0.0004576793,0.000349864,0.00018777094,0.00006269839,0.00047038024,0.00013562603,0.0000053717868],"category_scores_gemma":[0.00009980577,0.00020801507,0.00028299843,0.00035096038,0.00005715325,0.00042445978,0.000037080263,0.00044494536,0.000010532059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028370682,0.00022417032,0.03664249,0.0018306964,0.0010651087,0.00008577725,0.012559524,0.87014174,0.03177133,0.0019506871,0.00009961599,0.04334518],"study_design_scores_gemma":[0.024286587,0.0014029082,0.028472383,0.009086981,0.0009197742,0.01207198,0.018861631,0.62843025,0.10716559,0.009449397,0.15375932,0.006093216],"about_ca_topic_score_codex":0.0000015831081,"about_ca_topic_score_gemma":0.0000014937777,"teacher_disagreement_score":0.24171148,"about_ca_system_score_codex":0.00011737194,"about_ca_system_score_gemma":0.000059646063,"threshold_uncertainty_score":0.8482608},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01296892274091942,"score_gpt":0.24088089569385465,"score_spread":0.22791197295293522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986115514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68979526,0.0013090224,0.30660778,0.000041476946,0.0006719977,0.000047877988,0.0000016160838,0.00007447397,0.0014505225],"genre_scores_gemma":[0.59996676,0.000059475646,0.3995625,0.000023187802,0.00032770986,2.0497507e-7,0.0000013263309,0.000030981773,0.000027833097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998145,0.000020687994,0.0010109572,0.00009787707,0.00042048996,0.0003050135],"domain_scores_gemma":[0.9987088,0.00018474816,0.00035820086,0.00015697337,0.0004037456,0.00018755751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013974783,0.0001748287,0.0004260409,0.00041655375,0.000059771744,0.00003420088,0.00025919135,0.00012412295,0.00012197398],"category_scores_gemma":[0.00019285573,0.00016839169,0.00017468269,0.00046454594,0.00005647599,0.00027896112,0.000023399487,0.00044632313,0.000036487367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032720152,0.000043077613,0.00085458806,0.000059438447,0.00010049861,0.000021001117,0.00037702837,0.9708087,0.024222692,0.00011389322,0.00002594848,0.0033404112],"study_design_scores_gemma":[0.0011340865,0.00012578664,0.0010044557,0.00040515405,0.00007136547,0.00014055,0.0007918247,0.91344935,0.082287036,0.000112113245,0.00019361035,0.000284655],"about_ca_topic_score_codex":0.0000020063715,"about_ca_topic_score_gemma":7.761692e-7,"teacher_disagreement_score":0.09295472,"about_ca_system_score_codex":0.00007133207,"about_ca_system_score_gemma":0.000055269247,"threshold_uncertainty_score":0.6866814},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03315531448050888,"score_gpt":0.23928110986926873,"score_spread":0.20612579538875986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991396184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95992804,0.003042271,0.035930693,0.0002681795,0.00032763853,0.00010332378,5.5943076e-7,0.00006033055,0.00033895473],"genre_scores_gemma":[0.7849779,0.0005835937,0.21403868,0.00011052065,0.00022915084,0.0000010067117,4.397768e-7,0.00001849716,0.000040206203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896425,0.000024964178,0.00050001795,0.00011373813,0.00018862258,0.00020843331],"domain_scores_gemma":[0.9993287,0.000028870103,0.0001397503,0.00013307025,0.00020865355,0.0001609639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290989,0.00016685811,0.00027185556,0.00017200687,0.00014565926,0.0003311774,0.00023837274,0.00008370419,0.000021360876],"category_scores_gemma":[0.000111537534,0.00013889855,0.000048694677,0.00021098169,0.00003403708,0.00090386835,0.000036512367,0.00037283154,0.000009051042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008491227,0.000059302267,0.0007600931,0.00007942584,0.00007651535,0.00035541246,0.0011191192,0.96147436,0.0036237885,0.00022979094,0.000038355378,0.032098927],"study_design_scores_gemma":[0.0011568209,0.00020540722,0.0003208177,0.00044385897,0.000048869133,0.003987924,0.0013645183,0.9811361,0.010853261,0.000082452745,0.000112364774,0.0002875933],"about_ca_topic_score_codex":0.0000010079441,"about_ca_topic_score_gemma":8.1153655e-7,"teacher_disagreement_score":0.17810799,"about_ca_system_score_codex":0.000045059795,"about_ca_system_score_gemma":0.000054762284,"threshold_uncertainty_score":0.56641185},"labels":[],"label_agreement":null},{"id":"W1992712376","doi":"10.1007/s10951-009-0148-2","title":"Characterizing sets of jobs that admit optimal greedy-like algorithms","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Greedy algorithm; Computation; Algorithm; Set (abstract data type); Computer science; Mathematics; Combinatorics; Class (philosophy); Mathematical optimization; Discrete mathematics; Artificial intelligence","score_opus":0.0401982384900589,"score_gpt":0.29236549489283614,"score_spread":0.25216725640277726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992712376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2180816,0.00037907338,0.7769818,0.003503704,0.00054479885,0.00009011066,0.0000011505172,0.000033445227,0.00038433264],"genre_scores_gemma":[0.55167836,0.00011838177,0.44764793,0.0004190738,0.000095566524,2.5934e-7,4.6962515e-7,0.0000051873053,0.000034789984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984637,0.00006112556,0.000515429,0.00014591488,0.00055742334,0.00025644404],"domain_scores_gemma":[0.99865705,0.000051652838,0.00055927265,0.00020367892,0.00034129285,0.0001870387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088096753,0.00011666963,0.00027618156,0.00025108198,0.000092020346,0.00015868511,0.00071916776,0.00006435839,0.000025594582],"category_scores_gemma":[0.00006277209,0.000099571815,0.00014152082,0.0003121554,0.000026709222,0.0012637832,0.00008462779,0.00033508698,0.0000065619424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020637896,0.0010779477,0.0064082225,0.00016488941,0.00033439952,0.00063787017,0.012927332,0.23630843,0.13279687,0.0101583935,0.000583165,0.5983961],"study_design_scores_gemma":[0.0017805409,0.0011013536,0.015306015,0.00055646035,0.000026262092,0.0006422831,0.00033719017,0.95845884,0.018925473,0.00094684877,0.0015164983,0.00040224844],"about_ca_topic_score_codex":0.0000016803632,"about_ca_topic_score_gemma":1.632742e-7,"teacher_disagreement_score":0.7221504,"about_ca_system_score_codex":0.000034251618,"about_ca_system_score_gemma":0.00013890224,"threshold_uncertainty_score":0.40604207},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10923519215695703,"score_gpt":0.3547160647951978,"score_spread":0.24548087263824075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994932061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4726388,0.00039526325,0.5255452,0.000559464,0.0006202413,0.000112172245,0.0000032683392,0.00004938782,0.00007622094],"genre_scores_gemma":[0.6775396,0.000016798604,0.32171187,0.00009384073,0.00046162648,0.0000044726144,6.8930404e-7,0.000042103304,0.00012901993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99374115,0.00072340237,0.0017311008,0.00070972793,0.0022250072,0.000869593],"domain_scores_gemma":[0.991842,0.0030544908,0.0021929254,0.000790297,0.0015147435,0.0006055986],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.015524314,0.0004459977,0.0010516816,0.0009522442,0.0007858636,0.0009086903,0.0012834673,0.00015486505,0.00008282761],"category_scores_gemma":[0.01847734,0.00031225232,0.0004662379,0.0012017116,0.00025989514,0.001285568,0.00018054704,0.0013899539,0.00017293899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003107397,0.0014089439,0.0690902,0.00008617756,0.00044955008,0.00016670501,0.0025068147,0.8726691,0.018984867,0.0007831559,0.000077122284,0.033466615],"study_design_scores_gemma":[0.0043441188,0.0005357807,0.035051204,0.0009186555,0.00025253618,0.0005576601,0.00067904283,0.94940346,0.0034917474,0.0028008244,0.0011601427,0.0008048392],"about_ca_topic_score_codex":0.00005757919,"about_ca_topic_score_gemma":0.000044811743,"teacher_disagreement_score":0.20490079,"about_ca_system_score_codex":0.00013055018,"about_ca_system_score_gemma":0.00046676616,"threshold_uncertainty_score":0.99993294},"labels":[],"label_agreement":null},{"id":"W1998982496","doi":"10.1007/s10951-012-0276-y","title":"A computational study of heuristic and exact techniques for superblock instruction scheduling","year":2012,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Center for Advanced Study, University of Illinois at Urbana-Champaign","keywords":"Computer science; Compiler; Heuristics; Scheduling (production processes); Parallel computing; Instruction scheduling; Heuristic; Two-level scheduling; Mathematical optimization; Programming language; Dynamic priority scheduling; Mathematics; Schedule; Artificial intelligence; Operating system","score_opus":0.02520914108074378,"score_gpt":0.2969409265940295,"score_spread":0.2717317855132857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998982496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.460135,0.00018731518,0.5393943,0.000041054962,0.000090646856,0.00010285211,2.6383816e-7,0.00003568909,0.000012829557],"genre_scores_gemma":[0.52511317,0.000010611309,0.47475475,0.000013827033,0.0000998016,0.0000019950787,2.2956296e-7,0.000004549262,0.0000010982436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988378,0.00006700304,0.00056168815,0.00011731765,0.00025588914,0.0001602689],"domain_scores_gemma":[0.9986912,0.00019627824,0.00049764005,0.00011367069,0.00041406555,0.00008714292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312855,0.00010486092,0.0002517877,0.0002809751,0.00012077462,0.00006548183,0.00026368085,0.00005180163,8.213849e-7],"category_scores_gemma":[0.0001880692,0.000094721,0.00006093265,0.00021662188,0.000026779133,0.0006403024,0.00008426344,0.00016150103,1.5101675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024276531,0.0025199421,0.10908353,0.0003527127,0.00038316817,0.000010057541,0.011616207,0.7466973,0.0035515542,0.020679224,0.0001267348,0.10473682],"study_design_scores_gemma":[0.0016710345,0.0014221653,0.007107578,0.00026869852,0.0000620754,0.0003782532,0.0008956828,0.9785492,0.0047771544,0.004480041,0.00010138875,0.0002867162],"about_ca_topic_score_codex":0.0000032982502,"about_ca_topic_score_gemma":1.8729406e-7,"teacher_disagreement_score":0.23185194,"about_ca_system_score_codex":0.00002980195,"about_ca_system_score_gemma":0.000054620028,"threshold_uncertainty_score":0.38626102},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009737137138782662,"score_gpt":0.21066128666033168,"score_spread":0.20092414952154902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007684460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4885845,0.0012118574,0.50514203,0.00090105407,0.0015552235,0.00024418664,0.0000036868848,0.00029304004,0.0020644525],"genre_scores_gemma":[0.17237851,0.00008594402,0.8259151,0.0002782833,0.0008650733,0.000007859224,0.0000027207557,0.000086415224,0.0003801069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978757,0.000041464024,0.0008953326,0.00019882212,0.00048890646,0.00049979246],"domain_scores_gemma":[0.9983716,0.00014716602,0.00019374113,0.00025686974,0.00052607985,0.0005045631],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000629934,0.00029392514,0.0005045662,0.00040731856,0.0001243197,0.00025548815,0.00041696,0.00017424536,0.0010017985],"category_scores_gemma":[0.00031547566,0.00027611165,0.00021127066,0.0005058436,0.000024939227,0.0006335677,0.000053867618,0.0005773636,0.0011483916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739821,0.000027269034,0.0001699114,0.000029530544,0.000104651146,0.000014364565,0.00051685143,0.9843026,0.009687371,0.000010816901,0.0006176484,0.004506281],"study_design_scores_gemma":[0.00075108645,0.000064054366,0.00018650996,0.0002907538,0.000046996756,0.00010348208,0.0005847691,0.9909573,0.0060823257,0.000102899874,0.0004667555,0.00036307352],"about_ca_topic_score_codex":0.0000064199776,"about_ca_topic_score_gemma":6.356394e-7,"teacher_disagreement_score":0.32077307,"about_ca_system_score_codex":0.00013330104,"about_ca_system_score_gemma":0.00007292885,"threshold_uncertainty_score":0.9999691},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0248211093843664,"score_gpt":0.28351555630582065,"score_spread":0.25869444692145427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010898123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7849489,0.000108340275,0.21434924,0.000008129392,0.00025572954,0.0000883269,5.2421757e-7,0.000051031588,0.00018979023],"genre_scores_gemma":[0.75848716,0.000003363354,0.24115376,0.000003044901,0.00031427006,7.012995e-7,5.1165193e-7,0.00003032866,0.0000068543136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817926,0.000090888134,0.0010997074,0.00009809036,0.00033615023,0.00019589695],"domain_scores_gemma":[0.9988412,0.00014135944,0.00048712437,0.0001518311,0.0003150085,0.00006347629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013580504,0.00014752164,0.00033897106,0.0002850693,0.0000830278,0.000040084393,0.00012790631,0.00008789086,0.000010962477],"category_scores_gemma":[0.00018669141,0.00014010245,0.000099219964,0.0003888162,0.000014581435,0.0003342,0.000026060256,0.00036192063,0.0000014688668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014811008,0.00010431101,0.009566273,0.000029376954,0.00005098397,0.00037056702,0.0012791742,0.98070896,0.0059649656,0.00004539165,0.000002504125,0.0018626691],"study_design_scores_gemma":[0.0014033436,0.0001941596,0.0011694477,0.000109280736,0.00009220517,0.002740745,0.005139044,0.9848105,0.004096997,0.000066935674,0.0000067901,0.00017059554],"about_ca_topic_score_codex":0.00005141621,"about_ca_topic_score_gemma":0.0000122581505,"teacher_disagreement_score":0.026804522,"about_ca_system_score_codex":0.000106460226,"about_ca_system_score_gemma":0.000034115,"threshold_uncertainty_score":0.5713212},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.4968872769107157,"score_gpt":0.4637269991699302,"score_spread":0.033160277740785504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014856631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70953065,0.0010718363,0.2889585,0.000038584716,0.00023898813,0.00008646156,0.0000044989747,0.000034014323,0.00003648728],"genre_scores_gemma":[0.60127294,0.000018683124,0.3986235,0.000003816908,0.000034785626,0.0000014386198,0.0000011383387,0.000006386836,0.000037296384],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99622786,0.0008506675,0.0014312457,0.00021383434,0.0010336108,0.00024278657],"domain_scores_gemma":[0.9881303,0.0076015363,0.0009470918,0.00017841077,0.0030298592,0.000112817805],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.036726363,0.000118893164,0.00058188324,0.00082326087,0.00033963576,0.00008506514,0.00037507614,0.00009741856,0.000005790455],"category_scores_gemma":[0.020990724,0.0000865691,0.00010876595,0.0009525205,0.00011365271,0.0003388513,0.00007337021,0.00018892116,0.0000048217066],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012483421,0.0006440849,0.26330608,0.00064069,0.0016493978,0.00010109034,0.021346599,0.3018977,0.064666316,0.0030372306,0.0005954766,0.34086698],"study_design_scores_gemma":[0.0011773324,0.00018575651,0.70555,0.0002488349,0.000060887436,0.00042970633,0.0033298044,0.26956695,0.01901112,0.00014128239,0.00010481899,0.00019346892],"about_ca_topic_score_codex":0.00003107317,"about_ca_topic_score_gemma":0.0000052045,"teacher_disagreement_score":0.44224393,"about_ca_system_score_codex":0.00004754702,"about_ca_system_score_gemma":0.0004776266,"threshold_uncertainty_score":0.99189293},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011178495713697754,"score_gpt":0.21233287039486404,"score_spread":0.2011543746811663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019692413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45366046,0.0014528052,0.5424584,0.0009371463,0.00046422254,0.00021344221,0.0000032721437,0.00017200077,0.00063823105],"genre_scores_gemma":[0.46797323,0.000056935776,0.53128564,0.0002540048,0.00029000718,0.000005742009,0.0000021584506,0.000057197725,0.00007511114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803174,0.000039381717,0.0007961633,0.00021158412,0.00045386347,0.00046729963],"domain_scores_gemma":[0.9983351,0.00009680725,0.00025808468,0.00026225403,0.00062489195,0.00042282307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043038753,0.0003111665,0.0005169275,0.00040476082,0.00011949976,0.0002894721,0.0003427181,0.000115621304,0.00023387454],"category_scores_gemma":[0.0003098573,0.00024825666,0.00013862012,0.0005506235,0.00004460909,0.00049699575,0.000033631222,0.00058121944,0.000114051734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006264964,0.000053799486,0.0014208958,0.000075404285,0.0001308264,0.00004794765,0.0006591891,0.97710645,0.010952587,0.00003077613,0.00013162244,0.009327842],"study_design_scores_gemma":[0.0027078083,0.00045288505,0.001827308,0.0019325045,0.00013448256,0.00076162297,0.0019500167,0.98019135,0.0076917014,0.00007564119,0.0013679034,0.0009067749],"about_ca_topic_score_codex":0.0000063023203,"about_ca_topic_score_gemma":0.0000016593777,"teacher_disagreement_score":0.01431276,"about_ca_system_score_codex":0.00014431713,"about_ca_system_score_gemma":0.000056761284,"threshold_uncertainty_score":0.99999696},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Schedule; Operations research; Industrial engineering; Mathematical optimization","score_opus":0.028871452360921798,"score_gpt":0.2837969058946502,"score_spread":0.25492545353372836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025473159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15128475,0.00014367112,0.8460975,0.0022563054,0.00011899527,0.00008083607,1.7070796e-7,0.00000688627,0.00001086706],"genre_scores_gemma":[0.511256,0.00006718138,0.48855802,0.00007161316,0.000041224223,0.0000015076067,5.0574663e-8,0.000002857329,0.0000015889301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920404,0.000035825236,0.0003230477,0.00012119543,0.00018141615,0.000134462],"domain_scores_gemma":[0.99909705,0.00046196446,0.0002206985,0.00008790578,0.000047089565,0.000085269654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004761483,0.00007342865,0.00014676135,0.00014682402,0.00008491743,0.00004827068,0.000085836065,0.000059600385,0.000011664495],"category_scores_gemma":[0.00062651216,0.000066019486,0.000047108824,0.00010430514,0.00006290593,0.0003960899,0.00003847445,0.00027382554,0.0000016990612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115703726,0.00015618894,0.0036319029,0.000027931734,0.000040203144,0.00013882814,0.0030303497,0.6718939,0.0005558111,0.30479506,0.0000061473297,0.015607958],"study_design_scores_gemma":[0.0009167529,0.00017263512,0.003770546,0.00017627885,0.000014612421,0.0016881899,0.0002678622,0.9532118,0.00012188453,0.03948605,0.00003417372,0.00013920406],"about_ca_topic_score_codex":4.5094455e-7,"about_ca_topic_score_gemma":2.4269733e-7,"teacher_disagreement_score":0.3599712,"about_ca_system_score_codex":0.00004596685,"about_ca_system_score_gemma":0.000101550984,"threshold_uncertainty_score":0.26921967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11761767039113327,"score_gpt":0.3762298569327138,"score_spread":0.2586121865415806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27862653,0.0023362034,0.71430933,0.0035380393,0.0006949996,0.0004341082,0.00000878358,0.00003124144,0.000020772153],"genre_scores_gemma":[0.5221273,0.00006444089,0.47707027,0.00015449959,0.000371939,0.000026446458,3.1151825e-7,0.000021725677,0.0001630609],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960868,0.00024301485,0.0013364782,0.00048832124,0.0011945035,0.0006509316],"domain_scores_gemma":[0.991362,0.004849638,0.0013759714,0.000520061,0.0015162186,0.00037614297],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008342076,0.00030849676,0.000658904,0.0004481731,0.00096821727,0.0010530934,0.0010782481,0.00018795495,0.00008138086],"category_scores_gemma":[0.0064126723,0.000186733,0.0004959452,0.000870564,0.00022512318,0.0013449469,0.00018494761,0.00088906137,0.00010901749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012994664,0.0010167649,0.012978632,0.0000578084,0.0007716415,0.000014938847,0.0040865564,0.069347784,0.023188757,0.0007900653,0.00036245497,0.88725466],"study_design_scores_gemma":[0.0027537912,0.00015798588,0.029568864,0.00015705504,0.0001657193,0.00014475161,0.0012997683,0.9562534,0.001068847,0.006372206,0.001688396,0.00036921352],"about_ca_topic_score_codex":0.00014022354,"about_ca_topic_score_gemma":0.000014692722,"teacher_disagreement_score":0.8869056,"about_ca_system_score_codex":0.00007114117,"about_ca_system_score_gemma":0.00029153065,"threshold_uncertainty_score":0.9999839},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.006204005759576244,"score_gpt":0.21502024176032247,"score_spread":0.20881623600074622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029826506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8575115,0.00066088693,0.13964763,0.0002356804,0.0002968268,0.00015128596,0.0000037798352,0.00004407694,0.0014483273],"genre_scores_gemma":[0.5607341,0.00001030994,0.43898496,0.00002311064,0.00015615406,0.0000035870135,8.8583624e-7,0.000022843698,0.0000640487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893296,0.000026425912,0.0004529777,0.000120954435,0.00025363974,0.00021302643],"domain_scores_gemma":[0.99906826,0.00009895252,0.00020432252,0.00012921171,0.00036229004,0.000136938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327994,0.00016645684,0.00039975246,0.00010626524,0.000102352074,0.00016959698,0.00016571331,0.00009011823,0.00006144704],"category_scores_gemma":[0.000098701705,0.000105522464,0.000048031012,0.00028950666,0.00007243757,0.00029897594,0.00002474826,0.000404933,0.0000026555201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058276835,0.0002624868,0.0112025235,0.0005045858,0.0006718072,0.0000352817,0.0042023733,0.83566904,0.1400573,0.00044886747,0.00029333882,0.006069659],"study_design_scores_gemma":[0.0020933785,0.00006703296,0.0014469678,0.00025044408,0.00013300634,0.000791121,0.0019742772,0.97537607,0.017364845,0.00007066707,0.00015918878,0.00027300228],"about_ca_topic_score_codex":0.00000580524,"about_ca_topic_score_gemma":3.9163157e-7,"teacher_disagreement_score":0.29933733,"about_ca_system_score_codex":0.000012439247,"about_ca_system_score_gemma":0.00007704653,"threshold_uncertainty_score":0.4303081},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.055983975226454395,"score_gpt":0.3383749230511079,"score_spread":0.2823909478246535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034555835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032939,0.0008867996,0.090328135,0.0048305755,0.00030629392,0.00009991124,0.0000029830876,0.000040626837,0.00021075767],"genre_scores_gemma":[0.86498606,0.000054870274,0.13429138,0.00015351179,0.0004528054,0.0000013024452,0.0000011089543,0.0000135094915,0.00004545806],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9964786,0.00014991594,0.0013271456,0.0003766002,0.0012583875,0.0004093298],"domain_scores_gemma":[0.99600786,0.0013144107,0.0010803503,0.00038815348,0.0008686542,0.00034056616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033435852,0.00022510217,0.00047744034,0.00075334735,0.0005948014,0.00067845377,0.00045437334,0.0001503469,0.000041670046],"category_scores_gemma":[0.0042571207,0.00015869483,0.00017228843,0.0018551993,0.000096422074,0.0009957225,0.000041915217,0.0007144985,0.000025489007],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011952658,0.00067650515,0.55396414,0.000013247607,0.00033306374,0.00016366488,0.0033789456,0.30266678,0.008939964,0.008434857,0.0004283353,0.119805224],"study_design_scores_gemma":[0.004291771,0.0012803597,0.89145,0.0007251615,0.00037081641,0.0011729536,0.0040728278,0.048867606,0.00192269,0.043836575,0.0011430307,0.0008662391],"about_ca_topic_score_codex":0.00002545592,"about_ca_topic_score_gemma":0.000024400026,"teacher_disagreement_score":0.33748582,"about_ca_system_score_codex":0.0000635885,"about_ca_system_score_gemma":0.0002481439,"threshold_uncertainty_score":0.6542345},"labels":[],"label_agreement":null},{"id":"W2037780491","doi":"10.1007/s10951-009-0113-0","title":"Understanding the behavior of Solution-Guided Search for job-shop scheduling","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Exploit; Constructive; Computer science; Beam stack search; Scheduling (production processes); Local search (optimization); Mathematical optimization; Search algorithm; Mathematics; Artificial intelligence; Beam search; Best-first search; Process (computing)","score_opus":0.10504197035125641,"score_gpt":0.3123846638750536,"score_spread":0.2073426935237972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037780491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23583698,0.00077766733,0.7619079,0.0004355976,0.0005727165,0.00020356035,0.0000031214086,0.000047578007,0.00021490287],"genre_scores_gemma":[0.7302015,0.00010618249,0.26924825,0.00004233267,0.0003586042,0.000004284625,0.0000012302745,0.000024279394,0.000013348461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983218,0.000037238064,0.00079210463,0.00011098467,0.0004162189,0.00032169308],"domain_scores_gemma":[0.9988357,0.00023833141,0.0002294658,0.00017506386,0.00040366687,0.0001177618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134388,0.00016798836,0.00032329818,0.00026747392,0.0002073173,0.000082221726,0.00032339696,0.00012031034,0.000019067824],"category_scores_gemma":[0.00018170623,0.00013277582,0.00024387888,0.00037441167,0.000054186265,0.0002659408,0.000015988673,0.00044000533,0.0000019278507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027144242,0.00003695006,0.000489307,0.000038544767,0.00006766402,0.0000043894293,0.0005082781,0.9829693,0.012426808,0.0013876173,0.000043998592,0.0020000064],"study_design_scores_gemma":[0.0012230085,0.00016743093,0.00044777666,0.00026643532,0.00015425282,0.00011528785,0.0023680974,0.9783114,0.015962908,0.0007416933,0.000023474724,0.00021822088],"about_ca_topic_score_codex":0.0000012218868,"about_ca_topic_score_gemma":5.7656274e-7,"teacher_disagreement_score":0.4943645,"about_ca_system_score_codex":0.0001875263,"about_ca_system_score_gemma":0.0000980338,"threshold_uncertainty_score":0.54144406},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01833816959217388,"score_gpt":0.2556672366537828,"score_spread":0.23732906706160894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053052668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38655782,0.001033732,0.61163336,0.000039357834,0.00053563266,0.000059983933,0.0000015224405,0.00003239931,0.00010618494],"genre_scores_gemma":[0.5567696,0.0001630505,0.44285178,0.00003385378,0.00012165329,8.6701715e-7,0.000002698498,0.000034266715,0.000022233518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789125,0.00003326883,0.0010129513,0.00016853695,0.00044345774,0.00045053713],"domain_scores_gemma":[0.99920565,0.00010084741,0.00024407789,0.00016901246,0.00004411326,0.00023630219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017245939,0.00024244945,0.00037562614,0.00044838118,0.00006772335,0.00006071322,0.0002762175,0.00015088542,0.000061106424],"category_scores_gemma":[0.0001291526,0.00023673476,0.00012316424,0.00030151266,0.00003415587,0.00037775227,0.00004381872,0.0007633475,0.000027611799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004296114,0.00010190615,0.0022575075,0.000017597698,0.000058898862,0.00018195271,0.00031698062,0.9868846,0.00726524,0.000014380709,0.0000015600754,0.0028563952],"study_design_scores_gemma":[0.0020922618,0.000060493127,0.0025450273,0.00020205995,0.00003083992,0.0001428243,0.00062677375,0.96778727,0.025962267,0.000007357848,0.0002447659,0.00029808612],"about_ca_topic_score_codex":0.0000036533754,"about_ca_topic_score_gemma":0.0000042086313,"teacher_disagreement_score":0.17021176,"about_ca_system_score_codex":0.00019362911,"about_ca_system_score_gemma":0.00003103835,"threshold_uncertainty_score":0.9653764},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015102725161988472,"score_gpt":0.23897285323385165,"score_spread":0.22387012807186318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056881568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67290926,0.0009865984,0.32520866,0.00015780343,0.00032036216,0.00007938262,0.000003961231,0.000086595144,0.00024736047],"genre_scores_gemma":[0.53483546,0.000038570197,0.4645718,0.00010473483,0.00036715588,5.8083583e-7,0.0000073329743,0.00003826503,0.00003609966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984103,0.00003589872,0.00070835924,0.00016059702,0.00036441055,0.0003204343],"domain_scores_gemma":[0.99892795,0.00022984152,0.00018708735,0.00012455069,0.00020235885,0.00032822657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238871,0.0002032616,0.00034371094,0.00037661177,0.00011734527,0.000115905736,0.00012456354,0.00013033426,0.0000707687],"category_scores_gemma":[0.00024969754,0.00020749362,0.00008372862,0.0002708341,0.000037737358,0.00023248105,0.000037312333,0.0004054421,0.000046573063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018930875,0.00007276585,0.002285578,0.000054091634,0.000094469826,0.000045830762,0.00057106576,0.9012276,0.07491076,0.00003207526,0.00005911578,0.020457327],"study_design_scores_gemma":[0.0020653687,0.00021533191,0.0065614795,0.0005858946,0.00009301427,0.0008368551,0.00048916676,0.97015756,0.017893154,0.00001866526,0.0005656235,0.00051785726],"about_ca_topic_score_codex":0.0000033091562,"about_ca_topic_score_gemma":0.0000019599772,"teacher_disagreement_score":0.13936314,"about_ca_system_score_codex":0.00018737865,"about_ca_system_score_gemma":0.000016952188,"threshold_uncertainty_score":0.8461344},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.02816764618713669,"score_gpt":0.24745185509983172,"score_spread":0.21928420891269504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062601646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67165875,0.0044766674,0.32228488,0.000496872,0.0007126437,0.00008966837,0.0000015893066,0.00008324275,0.00019570094],"genre_scores_gemma":[0.5015649,0.00047749546,0.49753895,0.00004799238,0.00033895526,6.948625e-7,7.3217683e-7,0.000023259376,0.0000069792463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.000037439033,0.00075126986,0.0001421875,0.00027998997,0.0003198583],"domain_scores_gemma":[0.99933445,0.000087143846,0.00015238521,0.00011951922,0.00011660688,0.00018987551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069264404,0.00019264547,0.00038473212,0.0003271124,0.000064653825,0.00008794623,0.00017608741,0.00011392451,0.000040792245],"category_scores_gemma":[0.00006822159,0.0001880756,0.000086436725,0.00030058666,0.000059361573,0.00040374487,0.0000254169,0.00060869707,0.000010914858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011753697,0.000037240472,0.0004981319,0.000037137226,0.000032244134,0.000025418653,0.0003961068,0.9869748,0.0017731588,0.000080280835,0.0000070555016,0.010126704],"study_design_scores_gemma":[0.0010419553,0.0000364829,0.0006935859,0.00022561244,0.000026870686,0.00013567778,0.0005017948,0.9929339,0.0039711003,0.0001360948,0.00008786913,0.00020903068],"about_ca_topic_score_codex":0.0000049008454,"about_ca_topic_score_gemma":0.000009176806,"teacher_disagreement_score":0.17525406,"about_ca_system_score_codex":0.00011455999,"about_ca_system_score_gemma":0.000038527764,"threshold_uncertainty_score":0.7669501},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018494260968069845,"score_gpt":0.23333070528570254,"score_spread":0.2148364443176327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067880102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19414604,0.0033599425,0.788087,0.010655302,0.0012807401,0.0005402814,0.000017251754,0.00017669989,0.001736705],"genre_scores_gemma":[0.42614776,0.00022535597,0.571887,0.00076277636,0.000631602,0.000012547433,0.000002214123,0.00006918861,0.00026153744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984636,0.00008840551,0.00052662427,0.00014095624,0.0004589624,0.00032145524],"domain_scores_gemma":[0.999058,0.00024585446,0.0001284308,0.0002624995,0.00014093472,0.00016425332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073832326,0.00022826581,0.00030260993,0.000206525,0.00013212806,0.00017228605,0.00049542234,0.00006745062,0.00026953415],"category_scores_gemma":[0.00018246863,0.0001129443,0.0000900722,0.0007304452,0.000038461698,0.00020445455,0.000025126335,0.00063790794,0.00003219584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008191416,0.00005056973,0.00028149743,0.000013880863,0.00005295344,0.00015614956,0.0018415019,0.97431225,0.00004208363,0.000008584696,0.00010322392,0.0230554],"study_design_scores_gemma":[0.0013806897,0.00009240171,0.00023254925,0.0001837323,0.00005027193,0.0004984195,0.002180657,0.9945702,0.00021279353,0.000024046441,0.0003730695,0.00020116183],"about_ca_topic_score_codex":0.000007284201,"about_ca_topic_score_gemma":0.0000148150075,"teacher_disagreement_score":0.2320017,"about_ca_system_score_codex":0.00005671913,"about_ca_system_score_gemma":0.000034089473,"threshold_uncertainty_score":0.4605735},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05247880305225816,"score_gpt":0.31949700150722377,"score_spread":0.2670181984549656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068123526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43823433,0.0011171759,0.56016934,0.00006781455,0.00022226445,0.00012525078,0.000002581686,0.000029200335,0.00003201853],"genre_scores_gemma":[0.5402675,0.000077612305,0.45945615,0.0000095670175,0.00015567774,0.0000025923578,4.8197955e-7,0.000024067147,0.000006341884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844587,0.000051392857,0.000898475,0.00008887474,0.00028526306,0.00023015532],"domain_scores_gemma":[0.99768376,0.0011702038,0.00045949803,0.00015298386,0.00045331343,0.00008020899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088115863,0.00014051585,0.00039621873,0.00011221425,0.00019163423,0.000024477593,0.00027569482,0.000090163056,0.0000050631884],"category_scores_gemma":[0.0010116408,0.000111791196,0.00017043173,0.00024688864,0.00006185064,0.00014897925,0.000029853956,0.0004143817,0.0000013009287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003852585,0.000041323514,0.01391152,0.00009746661,0.0000960727,0.000003195708,0.0012957113,0.97136253,0.011205411,0.000039460014,0.000048830756,0.0018599242],"study_design_scores_gemma":[0.00085657224,0.00007532014,0.0012671353,0.00014657577,0.00006773813,0.00005554605,0.00068234204,0.9718888,0.024632612,0.00006584848,0.0001453653,0.00011618583],"about_ca_topic_score_codex":0.0000036783515,"about_ca_topic_score_gemma":0.0000015528539,"teacher_disagreement_score":0.10203318,"about_ca_system_score_codex":0.00005630381,"about_ca_system_score_gemma":0.00006797487,"threshold_uncertainty_score":0.45587125},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015761895206830193,"score_gpt":0.1994266802483037,"score_spread":0.18366478504147352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069541979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88028276,0.004326256,0.11326811,0.00006024464,0.000331788,0.00006734895,0.0000024681524,0.000116641386,0.0015443738],"genre_scores_gemma":[0.59773153,0.00025504988,0.40179092,0.000040087838,0.00012752305,7.3733656e-7,0.0000011222737,0.00003519863,0.000017863455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.000027050595,0.00045015005,0.00013504225,0.00025480048,0.00024663116],"domain_scores_gemma":[0.99913716,0.000069217334,0.0001800596,0.00013352797,0.0002454022,0.00023460621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033061008,0.00020387347,0.0002956147,0.0002255799,0.00008951351,0.00007180898,0.00015056599,0.00009696933,0.00009395904],"category_scores_gemma":[0.00008156612,0.0001695787,0.00006500729,0.00023262404,0.000054180775,0.00042500108,0.00002564984,0.00042848062,0.00000960395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005763188,0.0003400562,0.0144684315,0.000229799,0.00071234273,0.0005404444,0.0032974074,0.9027374,0.010329207,0.0003939103,0.00006674821,0.066307984],"study_design_scores_gemma":[0.0026595509,0.0005668716,0.0011029245,0.00084350293,0.00023079831,0.0011154722,0.0016852367,0.96146,0.029358646,0.00015882935,0.00015651526,0.0006616583],"about_ca_topic_score_codex":0.000011841008,"about_ca_topic_score_gemma":0.0000040811547,"teacher_disagreement_score":0.2885228,"about_ca_system_score_codex":0.00007297938,"about_ca_system_score_gemma":0.00004496938,"threshold_uncertainty_score":0.6915219},"labels":[],"label_agreement":null},{"id":"W2071226715","doi":"10.1007/s10951-006-8790-4","title":"Approximation algorithms for shop scheduling problems with minsum objective: A correction","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Approximation algorithm; Job shop scheduling; Algorithm; Flow shop scheduling; Mathematics; Schedule","score_opus":0.01281881357312941,"score_gpt":0.230134956859749,"score_spread":0.21731614328661958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071226715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13605961,0.0007611378,0.8609313,0.00007064141,0.0013858393,0.00028156387,0.0000032442401,0.00016008026,0.00034663163],"genre_scores_gemma":[0.3778686,0.000036260302,0.62101835,0.0000130133885,0.00088677224,0.0000222818,0.000012980245,0.000060944534,0.000080768754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984262,0.000024679313,0.0006900985,0.00017998513,0.00036162065,0.00031741383],"domain_scores_gemma":[0.99867797,0.00012731002,0.0003517144,0.00012540545,0.00062016805,0.000097451215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964482,0.00024129284,0.00034744845,0.00035239465,0.00015898264,0.00014770488,0.00014934989,0.0001456732,0.000009682778],"category_scores_gemma":[0.000098755234,0.0002104228,0.00014399055,0.0004545481,0.000035586465,0.0005493861,0.000009600904,0.00038386707,0.0000038626185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005361565,0.00006063578,0.00046730842,0.00009272301,0.00007762675,0.000003840669,0.00020947927,0.9899993,0.002050718,0.00007121559,0.00005250071,0.0068610534],"study_design_scores_gemma":[0.0015159283,0.00019528992,0.00021414841,0.00033458634,0.000087963606,0.0001935917,0.0006650843,0.9870935,0.008976422,0.00027766664,0.00016709573,0.00027873457],"about_ca_topic_score_codex":0.0000069716666,"about_ca_topic_score_gemma":0.0000065576714,"teacher_disagreement_score":0.241809,"about_ca_system_score_codex":0.00017710803,"about_ca_system_score_gemma":0.00008182069,"threshold_uncertainty_score":0.8580793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.025663756081350846,"score_gpt":0.27281856175876473,"score_spread":0.24715480567741388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071552003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08127009,0.0031249174,0.9132902,0.00030779518,0.00068545056,0.00020352878,0.0000036751944,0.00004481248,0.0010695267],"genre_scores_gemma":[0.8618971,0.00019873645,0.1366978,0.0000509811,0.0010454517,0.0000023647074,0.0000010527632,0.000036434376,0.000070050446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852663,0.000012395387,0.0006547657,0.00008851101,0.0003167607,0.00040092535],"domain_scores_gemma":[0.9986158,0.00067829393,0.00013954936,0.00013987935,0.0002883571,0.00013811834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002595851,0.00014275868,0.00024601462,0.0001322535,0.00015900805,0.000095059346,0.00025332195,0.00008520156,0.000058165857],"category_scores_gemma":[0.00028797513,0.00009979603,0.00014991744,0.00016623514,0.000049119502,0.000113848124,0.000024033458,0.0005585984,0.0000052357263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000990916,0.00005406946,0.0010569555,0.0004031362,0.00020500763,0.00010344478,0.0006985299,0.95670545,0.0036672396,0.0026400478,0.0003015566,0.034065455],"study_design_scores_gemma":[0.0023285185,0.0003851993,0.0030709214,0.0007376041,0.00037347578,0.0007727835,0.0028456433,0.9569962,0.0065721334,0.0031910508,0.022035506,0.00069094927],"about_ca_topic_score_codex":0.000009180628,"about_ca_topic_score_gemma":0.000008299777,"teacher_disagreement_score":0.780627,"about_ca_system_score_codex":0.00006363858,"about_ca_system_score_gemma":0.000061661936,"threshold_uncertainty_score":0.4069564},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.007735413333746032,"score_gpt":0.2306258595686345,"score_spread":0.22289044623488846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073418197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2856395,0.000822842,0.7129368,0.00019586743,0.00021560023,0.00012883109,0.0000020136656,0.000023282275,0.000035262066],"genre_scores_gemma":[0.67913085,0.00002830693,0.3203194,0.000016615828,0.0004607918,0.0000037914199,4.0773108e-7,0.00001863226,0.000021176827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000048588714,0.00027544884,0.000044561843,0.00011173522,0.00016945695],"domain_scores_gemma":[0.9990779,0.0005615156,0.000097784956,0.00008381847,0.00011168573,0.000067292116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028602101,0.000078178615,0.00014036601,0.000046223227,0.00008217778,0.000045667846,0.00007515622,0.00005206868,0.0000069709813],"category_scores_gemma":[0.00033053284,0.000055965585,0.000046724857,0.00008547238,0.000017986351,0.00031376653,0.000013767527,0.00016036197,0.0000021465535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045602178,0.00015787767,0.0069745434,0.0002814072,0.00048697088,0.000002921062,0.003950147,0.7579965,0.09191498,0.00020653874,0.0008006702,0.1367714],"study_design_scores_gemma":[0.0005739684,0.000059008067,0.006303671,0.00006417484,0.00007534518,0.00011115269,0.00006572996,0.98932475,0.0016900752,0.0003137826,0.0013048216,0.00011351967],"about_ca_topic_score_codex":4.384334e-7,"about_ca_topic_score_gemma":9.3269236e-8,"teacher_disagreement_score":0.3934914,"about_ca_system_score_codex":0.00005645653,"about_ca_system_score_gemma":0.00003085223,"threshold_uncertainty_score":0.22822103},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019058539760618463,"score_gpt":0.26216035725873044,"score_spread":0.24310181749811197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081401598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849781,0.00021468672,0.31407177,0.000283425,0.00017543015,0.00016222111,0.000007098157,0.000026782,0.00008046869],"genre_scores_gemma":[0.5350656,0.000059941947,0.4646715,0.000026383554,0.00012623241,0.0000039273973,0.0000037191876,0.000017649489,0.00002508134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987704,0.000027502176,0.0006117618,0.00010074473,0.0002575702,0.00023198841],"domain_scores_gemma":[0.99915326,0.000118181444,0.00027356477,0.0001096668,0.00028263126,0.00006268357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164652,0.00016553226,0.00031263006,0.0001590438,0.00007229133,0.00005458857,0.00015369874,0.00006486398,0.000012339194],"category_scores_gemma":[0.000056151457,0.00011819421,0.00009871731,0.0003305437,0.00003485498,0.00034138304,0.000009086583,0.0002904273,0.0000012543085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102763,0.000039973656,0.00090641977,0.000035899277,0.00006788569,0.000007380976,0.0016485896,0.985731,0.001596476,0.00023520402,0.000004214501,0.009624173],"study_design_scores_gemma":[0.0018366836,0.00009145685,0.0042360774,0.00028374555,0.00004550356,0.00008465279,0.000678655,0.98665744,0.005628298,0.00028669712,0.000007685422,0.00016309577],"about_ca_topic_score_codex":0.000005790342,"about_ca_topic_score_gemma":0.000004099817,"teacher_disagreement_score":0.15059973,"about_ca_system_score_codex":0.000057009696,"about_ca_system_score_gemma":0.000047890888,"threshold_uncertainty_score":0.48198202},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010202036304215211,"score_gpt":0.22944902329603215,"score_spread":0.21924698699181694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084084982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22473806,0.00044426383,0.7729392,0.00025617756,0.00024908961,0.00023891739,0.0000021706035,0.00015915028,0.0009729506],"genre_scores_gemma":[0.5031011,0.000007722463,0.4961869,0.00013349621,0.0004912182,0.0000011183408,0.0000020079842,0.00006368511,0.000012721201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972396,0.00004010116,0.001005599,0.0002468957,0.0006902737,0.00077751494],"domain_scores_gemma":[0.99792206,0.0004549067,0.00027052508,0.00029346786,0.0006478081,0.00041121274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034922457,0.0003232999,0.00041748615,0.00045351565,0.00034997019,0.00029203852,0.00048724265,0.00017919349,0.000036785543],"category_scores_gemma":[0.00030149965,0.0002321652,0.00012363245,0.0012749146,0.00006485251,0.00036788394,0.00006184979,0.0011697016,0.000010405326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001307503,0.000026166816,0.00026287162,0.000059188587,0.00015572,0.000049098635,0.0013424794,0.98254955,0.007502632,0.0003205155,0.000005868872,0.0075951815],"study_design_scores_gemma":[0.0012856723,0.0002152057,0.00006578019,0.00049614836,0.000091072696,0.00025691898,0.004170003,0.98468333,0.008178281,0.00006668456,0.00012796625,0.00036290742],"about_ca_topic_score_codex":0.000014766971,"about_ca_topic_score_gemma":0.0000034909856,"teacher_disagreement_score":0.27836305,"about_ca_system_score_codex":0.00017281334,"about_ca_system_score_gemma":0.00020296253,"threshold_uncertainty_score":0.9467422},"labels":[],"label_agreement":null},{"id":"W2084812016","doi":"10.1007/s10951-014-0387-8","title":"On-line preemptive machine scheduling with $$\\ell _p$$ ℓ p norm on two uniform machines","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preemption; Unavailability; Scheduling (production processes); Job shop scheduling; Computer science; Competitive analysis; Mathematical optimization; Upper and lower bounds; Mathematics; Combinatorics; Algorithm","score_opus":0.01192599861620092,"score_gpt":0.24210018299619737,"score_spread":0.23017418437999645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084812016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5294378,0.00033420438,0.4648752,0.0003194863,0.0008584602,0.0001344649,0.000007314013,0.00019030627,0.0038427853],"genre_scores_gemma":[0.7197867,0.00007313467,0.27894905,0.000243373,0.00077963964,0.0000027732992,0.000007420096,0.00008775314,0.00007015574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788374,0.000055319975,0.0007491559,0.00024522975,0.0006421883,0.0004243821],"domain_scores_gemma":[0.9983352,0.00035359734,0.00036877888,0.0003102894,0.00033616507,0.00029600962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357525,0.00042158412,0.00054914254,0.00048261022,0.0001699516,0.00012477327,0.00037177643,0.00013015207,0.00008415478],"category_scores_gemma":[0.00028115182,0.00031675628,0.00017192049,0.00043368043,0.00006096438,0.00032867907,0.0000295542,0.0011001443,0.00006199807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022374539,0.00009322842,0.00037290342,0.000040008483,0.00014617367,0.000025249356,0.00024167544,0.9894463,0.00030187186,0.0011519495,0.000013515911,0.007943384],"study_design_scores_gemma":[0.0027491872,0.0009932901,0.00013554482,0.00062369654,0.00007786122,0.00014100298,0.00011449006,0.9896893,0.004423666,0.0005132444,0.00013147731,0.0004072547],"about_ca_topic_score_codex":0.0000074416666,"about_ca_topic_score_gemma":0.0000092839755,"teacher_disagreement_score":0.19034891,"about_ca_system_score_codex":0.00013865641,"about_ca_system_score_gemma":0.00005609681,"threshold_uncertainty_score":0.9999285},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07491560948366902,"score_gpt":0.34364361245898467,"score_spread":0.2687280029753156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092058125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99245536,0.000053557436,0.002930211,0.0017652021,0.0021157404,0.00018713097,0.000003055603,0.0000097571,0.00047995296],"genre_scores_gemma":[0.94659007,0.0000055221417,0.052888937,0.00002165501,0.00025094283,0.000004526591,8.1756596e-8,0.000011694979,0.0002265464],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99680805,0.00012827893,0.0013909558,0.0002092491,0.001224544,0.00023890074],"domain_scores_gemma":[0.9962219,0.00053633755,0.0014438491,0.00039571364,0.0012681388,0.00013407659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005766149,0.00013414933,0.00045520897,0.00049814483,0.00020037124,0.00010635722,0.0008254613,0.00009392847,0.00004715607],"category_scores_gemma":[0.005955035,0.00008226244,0.00030402778,0.0012435963,0.00015183758,0.00043826443,0.00014129482,0.000698678,0.000008816471],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064997614,0.00037525815,0.01042961,0.00006224938,0.00015773017,0.0000035621545,0.0058874064,0.24770564,0.7139635,0.013262618,0.0002557983,0.007246619],"study_design_scores_gemma":[0.00335749,0.004163201,0.029776225,0.0044384613,0.00036838712,0.0011791902,0.0115376795,0.008917186,0.8166237,0.11367146,0.0051823417,0.00078466866],"about_ca_topic_score_codex":0.000021005812,"about_ca_topic_score_gemma":0.000028093027,"teacher_disagreement_score":0.23878846,"about_ca_system_score_codex":0.000039994553,"about_ca_system_score_gemma":0.00026179833,"threshold_uncertainty_score":0.7129163},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08476310417682809,"score_gpt":0.38923523864119086,"score_spread":0.3044721344643628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094070748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97679365,0.0010139205,0.016718306,0.0039614257,0.00056220905,0.00008423186,0.0000027574326,0.000025689607,0.00083778583],"genre_scores_gemma":[0.73790324,0.000070114096,0.26169577,0.00010859952,0.00016760602,0.0000019872211,3.852445e-7,0.000011913703,0.00004037876],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697506,0.00016657855,0.001424268,0.00025623554,0.0008248177,0.00035300988],"domain_scores_gemma":[0.9958924,0.0017222341,0.0008028629,0.0006372695,0.00071614987,0.00022906758],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008151364,0.00015973426,0.00048290132,0.0011686316,0.0003237729,0.00034736376,0.0010789493,0.0001708755,0.0000826231],"category_scores_gemma":[0.009680001,0.00012737258,0.00016720731,0.0014181917,0.00022281107,0.0005679548,0.00017023187,0.0017567949,0.000040421808],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023384303,0.0015518448,0.38623616,0.000031710093,0.00024494212,0.00014886167,0.0059521785,0.11143682,0.3066009,0.043411028,0.0004813028,0.14367041],"study_design_scores_gemma":[0.008308561,0.0006385964,0.341214,0.0012219386,0.00035705446,0.0042730174,0.021293843,0.38228106,0.009554072,0.19701944,0.031776186,0.002062232],"about_ca_topic_score_codex":0.000036772508,"about_ca_topic_score_gemma":0.00022266021,"teacher_disagreement_score":0.29704684,"about_ca_system_score_codex":0.00003436124,"about_ca_system_score_gemma":0.00027066708,"threshold_uncertainty_score":0.9986619},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada)","funders":"","keywords":"Heuristics; Computer science; Preemption; Scheduling (production processes); Mathematical optimization; Pareto principle; Linear programming; Algorithm; Mathematics","score_opus":0.04646876579966042,"score_gpt":0.27423315951744676,"score_spread":0.22776439371778634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101083305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49037567,0.0008968729,0.50569874,0.002167827,0.00032502698,0.00008319595,4.0002325e-7,0.000022565628,0.00042969044],"genre_scores_gemma":[0.56122744,0.00021459303,0.43829685,0.00010917029,0.000115164126,6.664624e-7,1.6081924e-7,0.000006929386,0.000029045841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980427,0.00013734808,0.00073010114,0.0001546176,0.000667268,0.00026793522],"domain_scores_gemma":[0.99814034,0.00022869921,0.00058446266,0.00033304968,0.00057845935,0.00013496763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014160482,0.00012098855,0.0002744863,0.00027656392,0.00024281838,0.000111825175,0.0011118386,0.00006274037,0.00004216176],"category_scores_gemma":[0.0003457642,0.000083224826,0.00015855633,0.0005272298,0.00007748496,0.0009674386,0.00019395328,0.00045130565,0.0000067961387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075250486,0.00039795993,0.015174889,0.00014639359,0.0002899961,0.00025650472,0.023467511,0.8702514,0.024139266,0.021170639,0.0005240524,0.044106115],"study_design_scores_gemma":[0.0008255773,0.00020346025,0.0006900322,0.00034839913,0.000015353624,0.00038327894,0.00042485987,0.9865844,0.006615984,0.0031695322,0.00055812165,0.00018099078],"about_ca_topic_score_codex":0.0000074103655,"about_ca_topic_score_gemma":0.0000015565852,"teacher_disagreement_score":0.116332985,"about_ca_system_score_codex":0.000036769572,"about_ca_system_score_gemma":0.00029495574,"threshold_uncertainty_score":0.33938098},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.026896234385800404,"score_gpt":0.275037016954549,"score_spread":0.2481407825687486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117593136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31271875,0.0008626481,0.6857791,0.000033725686,0.0002597958,0.00017241674,0.0000069656644,0.00012072927,0.00004584647],"genre_scores_gemma":[0.21261472,0.000019297606,0.78685045,0.00004295963,0.00035460317,0.000011540583,0.000010232537,0.00007548635,0.000020697318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.000043028107,0.00070877,0.00023459013,0.00032140763,0.00039765218],"domain_scores_gemma":[0.9982524,0.00010776641,0.0003411352,0.00015041242,0.00076903397,0.00037928883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012414712,0.0003151185,0.00048751384,0.0002653806,0.00014860157,0.00028807297,0.00020673095,0.000108453234,0.0000038290855],"category_scores_gemma":[0.00020474575,0.00024845134,0.000068894406,0.00033137406,0.00005529777,0.00079818757,0.000025608013,0.00051062205,8.232193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010696429,0.000024565657,0.00057815213,0.00006253365,0.00009144711,0.000035744128,0.0011877458,0.97370625,0.0017240378,0.000025690751,0.000003954769,0.022452908],"study_design_scores_gemma":[0.0031185052,0.000446462,0.000021598402,0.0006444435,0.000061986415,0.00031558183,0.004702297,0.9895801,0.0006305186,0.00007251626,0.000071605275,0.00033440156],"about_ca_topic_score_codex":0.000013517987,"about_ca_topic_score_gemma":0.000009686167,"teacher_disagreement_score":0.10107135,"about_ca_system_score_codex":0.00010556828,"about_ca_system_score_gemma":0.00016034918,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W2122049872","doi":"10.1007/s10951-011-0259-4","title":"Routing equal-size messages on a slotted ring","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Diagonal; Routing (electronic design automation); Network packet; Computer science; Combinatorics; Approximation algorithm; Scheduling (production processes); Time complexity; Mathematics; Discrete mathematics; Mathematical optimization; Computer network; Geometry","score_opus":0.04730897912991058,"score_gpt":0.25423519513089304,"score_spread":0.20692621600098246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122049872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3226905,0.00012946842,0.6668975,0.00017658595,0.0019006683,0.000040060273,7.997223e-8,0.00004165382,0.00812352],"genre_scores_gemma":[0.9539437,0.000008824155,0.04524528,0.00020431155,0.0005072939,6.43034e-7,1.7057753e-8,0.000008210756,0.00008167748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998737,0.00009281113,0.0005346779,0.0001350486,0.00028573076,0.00021474669],"domain_scores_gemma":[0.99882114,0.00019955957,0.0005085729,0.00018280171,0.00019562502,0.00009232679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013171325,0.00010276724,0.00021755662,0.000120964054,0.00012479501,0.00013412324,0.0005162253,0.000056865014,0.000027160697],"category_scores_gemma":[0.00021615218,0.00008045272,0.00013591861,0.00020388696,0.00001135615,0.0005094235,0.00007502544,0.0003409277,0.000018194607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004526385,0.0008540359,0.016602004,0.0001830582,0.00097103504,0.0016769164,0.04571932,0.06646258,0.03600682,0.7382778,0.0012688331,0.091524996],"study_design_scores_gemma":[0.0042755483,0.0024479928,0.015466961,0.0047453246,0.00008639642,0.0025940002,0.0040444005,0.90195656,0.046371497,0.0147563135,0.0019081198,0.0013468765],"about_ca_topic_score_codex":0.000011549558,"about_ca_topic_score_gemma":0.0000014762927,"teacher_disagreement_score":0.835494,"about_ca_system_score_codex":0.00004851582,"about_ca_system_score_gemma":0.000038177433,"threshold_uncertainty_score":0.3280767},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011798674298227153,"score_gpt":0.21047901127365548,"score_spread":0.19868033697542833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123331415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929304,0.0001361201,0.0035651547,0.0015007431,0.00039400664,0.00014382992,5.692863e-7,0.00001685352,0.0013123361],"genre_scores_gemma":[0.9885138,0.000031939177,0.007963114,0.0021185027,0.0012199649,0.000003971106,0.0000044628755,0.000021232805,0.00012300581],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.000024505869,0.0004795165,0.00017297389,0.0003047446,0.00024033898],"domain_scores_gemma":[0.9992524,0.00007342739,0.00030398005,0.0001009368,0.00023037332,0.000038915696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773136,0.0001550377,0.00028539673,0.00065693056,0.00008137021,0.000227599,0.00019472622,0.00005228788,0.00010711095],"category_scores_gemma":[0.00021278737,0.00014638298,0.0000757691,0.0003218623,0.000025096473,0.0010897781,0.00013640767,0.00016264437,0.000084038504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032851372,0.001164529,0.36249116,0.0013146567,0.00054672436,0.0005238524,0.0024138459,0.3615375,0.0454804,0.01491542,0.020847095,0.1854797],"study_design_scores_gemma":[0.008751117,0.00024752948,0.1815485,0.0018320102,0.0003008702,0.00005395545,0.004823731,0.75087154,0.0006935907,0.0005669329,0.04902762,0.0012825741],"about_ca_topic_score_codex":0.00009880014,"about_ca_topic_score_gemma":0.000016714415,"teacher_disagreement_score":0.38933408,"about_ca_system_score_codex":0.00008277953,"about_ca_system_score_gemma":0.00001795588,"threshold_uncertainty_score":0.5969325},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03508282374171459,"score_gpt":0.25634219489471294,"score_spread":0.22125937115299835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123490024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64716846,0.0021361103,0.34900826,0.00028323548,0.00044605767,0.00037758448,0.000022653983,0.00017776185,0.000379847],"genre_scores_gemma":[0.658695,0.00028100912,0.34042397,0.000058673053,0.00034361926,0.000008657671,0.0000044859876,0.00006807058,0.0001165538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800193,0.00004957969,0.00072457973,0.00024105082,0.00055859034,0.00042427983],"domain_scores_gemma":[0.99875766,0.0002539307,0.00020299597,0.00016836412,0.000338858,0.0002781687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084159785,0.00027736067,0.00044854733,0.00037146997,0.00024121154,0.00010982216,0.00022646922,0.00014160304,0.00003683643],"category_scores_gemma":[0.0002446824,0.00025531687,0.00013905812,0.00022717004,0.000063885054,0.0002606536,0.000038381317,0.0006184018,0.000022826907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011727233,0.00011124316,0.00024404298,0.0001244178,0.000118619144,0.000106814136,0.0007424781,0.9819921,0.013343668,0.00006082969,0.000017047956,0.0030214263],"study_design_scores_gemma":[0.0020903081,0.0005400816,0.00003657307,0.00040962137,0.00006743186,0.0012545664,0.00028747518,0.98358005,0.011111628,0.00020916054,0.00005656047,0.00035651794],"about_ca_topic_score_codex":0.0000050460994,"about_ca_topic_score_gemma":0.0000011184911,"teacher_disagreement_score":0.011526482,"about_ca_system_score_codex":0.00018590532,"about_ca_system_score_gemma":0.00011187873,"threshold_uncertainty_score":0.9999899},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012741533451711364,"score_gpt":0.21722542229965386,"score_spread":0.2044838888479425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126394800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80524194,0.0009300316,0.19176146,0.00086966105,0.000359225,0.00013881124,0.0000031706784,0.000103891456,0.0005917787],"genre_scores_gemma":[0.82895654,0.00012476055,0.16993687,0.000056204506,0.0008519935,0.0000040116574,0.000002878415,0.000043391265,0.000023356446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984157,0.000060971528,0.0006848819,0.00016053271,0.00037332624,0.00030459205],"domain_scores_gemma":[0.99898046,0.0003845707,0.00020379647,0.00015126252,0.00016042913,0.0001194675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091446994,0.00022493667,0.00032616535,0.00023118357,0.00021515306,0.00018253516,0.00017890582,0.000117996926,0.00003156246],"category_scores_gemma":[0.00015715111,0.0001664467,0.00013007234,0.00032933574,0.000048034442,0.0002413991,0.00001988025,0.0006905968,0.000009630161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022824144,0.000020926176,0.0022639085,0.000036993297,0.000091525624,0.000014719857,0.00016964212,0.99222666,0.0013005988,0.00085680524,0.00005454722,0.0029408687],"study_design_scores_gemma":[0.0010484752,0.00012173634,0.0013915658,0.00047929655,0.00011515349,0.00015675703,0.0005339064,0.99057543,0.003078698,0.002103749,0.0000993451,0.0002958953],"about_ca_topic_score_codex":0.000006425051,"about_ca_topic_score_gemma":0.000003852977,"teacher_disagreement_score":0.023714568,"about_ca_system_score_codex":0.000083668776,"about_ca_system_score_gemma":0.00003563261,"threshold_uncertainty_score":0.6787499},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022401129049784016,"score_gpt":0.2536726972704223,"score_spread":0.23127156822063827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136004943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032843,0.0015848717,0.09421899,0.00025444373,0.00028315236,0.00009593695,0.0000021441892,0.000060240003,0.00021589115],"genre_scores_gemma":[0.5967784,0.00015591811,0.40283412,0.0000620766,0.00012478717,4.5352897e-7,0.0000020641446,0.000021173075,0.000021025811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856853,0.00003907953,0.00074278837,0.00013651823,0.00029427878,0.00021879068],"domain_scores_gemma":[0.9992533,0.00009745311,0.00026284312,0.000118947304,0.00014999062,0.00011746651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170946,0.00019573793,0.0003955596,0.00044137434,0.000044760433,0.000060377097,0.00016368915,0.00012895997,0.000019768107],"category_scores_gemma":[0.00022887078,0.00018577545,0.00008658102,0.00031454928,0.000027866225,0.00024669094,0.00001221537,0.00033794862,0.0000044151443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060933253,0.00014325752,0.0010057925,0.00003401539,0.00002616145,0.000013675851,0.0003714169,0.9788566,0.010384116,0.00004929194,0.000004098206,0.009050639],"study_design_scores_gemma":[0.0016809449,0.00020683989,0.0036127788,0.00042962484,0.00003298557,0.000048775993,0.00019874163,0.9886525,0.004852021,0.00007436706,0.000012576705,0.00019782371],"about_ca_topic_score_codex":0.0000014807607,"about_ca_topic_score_gemma":9.612268e-7,"teacher_disagreement_score":0.30861512,"about_ca_system_score_codex":0.00005683763,"about_ca_system_score_gemma":0.000024357401,"threshold_uncertainty_score":0.7575703},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09904310839770022,"score_gpt":0.38101977286631233,"score_spread":0.28197666446861214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167699778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9262122,0.00010580626,0.06789692,0.0021009792,0.002928691,0.00005621444,0.0000017521625,0.000027299095,0.00067016913],"genre_scores_gemma":[0.7848146,0.0000019593901,0.2138383,0.00019220608,0.00086258724,0.0000014381551,1.4513827e-7,0.0000138187415,0.0002749685],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99684143,0.000117100324,0.00096282864,0.0002527531,0.001439608,0.00038625972],"domain_scores_gemma":[0.9949363,0.002943565,0.000663276,0.00040301788,0.0006487409,0.00040513012],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0069853985,0.00015358406,0.0004073207,0.0007755109,0.0003453556,0.0005725837,0.0008889349,0.00012370232,0.00022868044],"category_scores_gemma":[0.020972518,0.00011319377,0.00027774475,0.0013317956,0.00007338542,0.0006737477,0.00011335608,0.0010131974,0.00022975897],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005790757,0.00051902805,0.36437717,0.00001056334,0.00028223233,0.00014133072,0.0072658057,0.13492005,0.3309528,0.0030329416,0.006227393,0.1516916],"study_design_scores_gemma":[0.008798974,0.0015955117,0.5163179,0.0017517408,0.0005805509,0.0012084589,0.033490658,0.04351254,0.15528123,0.07732868,0.15629305,0.0038406698],"about_ca_topic_score_codex":0.00000692434,"about_ca_topic_score_gemma":0.000019506275,"teacher_disagreement_score":0.17567156,"about_ca_system_score_codex":0.000030113444,"about_ca_system_score_gemma":0.00022356903,"threshold_uncertainty_score":0.9872742},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.12147508441677701,"score_gpt":0.4068748154038947,"score_spread":0.2853997309871177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527830873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.473916,0.001709068,0.5196256,0.0036406384,0.00079144724,0.00021409972,0.000012679924,0.000021608706,0.00006886231],"genre_scores_gemma":[0.92369974,0.00002063933,0.0746345,0.0003346107,0.0011732903,0.000007813597,0.0000019376878,0.00001935921,0.00010809007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968243,0.00017614376,0.0012118219,0.000265957,0.0011445633,0.00037717615],"domain_scores_gemma":[0.99273634,0.0031417215,0.0012290293,0.00035229858,0.0023730919,0.00016751006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010821166,0.0001875557,0.00040849674,0.00027938792,0.0008221906,0.0006350215,0.0005653633,0.00010110379,0.00007240088],"category_scores_gemma":[0.0030547145,0.00011081122,0.00025888172,0.0005970697,0.00019849409,0.000678789,0.000057999754,0.00031230552,0.000023894227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007576361,0.0016753904,0.2912318,0.00017949002,0.001431771,0.000028231401,0.010425704,0.20264925,0.005878251,0.015774164,0.009299406,0.4606689],"study_design_scores_gemma":[0.003177694,0.00074081443,0.01651383,0.00038957785,0.0007520184,0.00014970677,0.0069934977,0.9379912,0.0018640152,0.023747372,0.0072363624,0.00044393298],"about_ca_topic_score_codex":0.00003546619,"about_ca_topic_score_gemma":0.000021933194,"teacher_disagreement_score":0.7353419,"about_ca_system_score_codex":0.000031675227,"about_ca_system_score_gemma":0.00035045217,"threshold_uncertainty_score":0.6323709},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011212975894958958,"score_gpt":0.24108736843861678,"score_spread":0.22987439254365782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582191864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45611632,0.00016448543,0.541032,0.0012374005,0.00096690527,0.00011974702,0.00000477103,0.00008672042,0.00027162832],"genre_scores_gemma":[0.49726,0.000010329605,0.50075614,0.0002752896,0.0015652052,0.000003598075,0.000004341868,0.000042328407,0.00008277695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984036,0.00006197618,0.0006485007,0.00015608394,0.00042626107,0.00030359783],"domain_scores_gemma":[0.9988074,0.00012457103,0.0001454384,0.0002195287,0.0004299103,0.00027317935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085857656,0.00020139401,0.0003235604,0.00029208744,0.00021392458,0.00014058672,0.0002913906,0.000091070506,0.0002046686],"category_scores_gemma":[0.00026728347,0.00015295939,0.00012488668,0.0006111047,0.000036879086,0.00020918342,0.000053051852,0.0003671086,0.00037859584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017967809,0.000044384844,0.00012954544,0.000019557488,0.00011223592,0.000023124101,0.0015711145,0.9576173,0.031413745,0.00008816696,0.00038180695,0.008419329],"study_design_scores_gemma":[0.0006117119,0.00017837006,0.0024070132,0.00021532744,0.000053517044,0.00031375996,0.00028903945,0.98810774,0.0069520916,0.000064645756,0.00053912424,0.00026767026],"about_ca_topic_score_codex":0.0000044029916,"about_ca_topic_score_gemma":0.0000013214301,"teacher_disagreement_score":0.041143678,"about_ca_system_score_codex":0.000114025075,"about_ca_system_score_gemma":0.000031883155,"threshold_uncertainty_score":0.62375027},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.021650692101702274,"score_gpt":0.2777688907375572,"score_spread":0.2561181986358549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596332277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5338174,0.0007719699,0.4609972,0.000503397,0.00096881564,0.00009497843,0.0000011097719,0.000103399725,0.002741703],"genre_scores_gemma":[0.52563095,0.000091334536,0.47376475,0.000022211727,0.0004102875,4.852342e-7,1.9762281e-7,0.000036056736,0.000043709242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984041,0.000041868097,0.00071592355,0.0001388559,0.00032020838,0.0003790495],"domain_scores_gemma":[0.9983976,0.00009780479,0.0006345322,0.00036776927,0.0003362079,0.00016608398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017372138,0.00019647229,0.0003787084,0.00016982811,0.0003656847,0.00036085697,0.0005973679,0.000118745396,0.00003237437],"category_scores_gemma":[0.0010277228,0.00018320534,0.00015453674,0.00010502818,0.000059412174,0.00086087367,0.00008336637,0.0006949049,0.000011547694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014289502,0.000013894478,0.0032420168,0.000081340426,0.00007545354,0.000047149766,0.0002816936,0.96834415,0.01930921,0.0001896121,0.000042019557,0.008359177],"study_design_scores_gemma":[0.0013926777,0.0000624336,0.0036863608,0.0014040343,0.000068926,0.0003446499,0.00026006548,0.9813325,0.009547702,0.00083199044,0.00067561254,0.0003930772],"about_ca_topic_score_codex":0.0000028844197,"about_ca_topic_score_gemma":0.0000010679788,"teacher_disagreement_score":0.012988326,"about_ca_system_score_codex":0.00011837012,"about_ca_system_score_gemma":0.000068526984,"threshold_uncertainty_score":0.74708974},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018685284151203938,"score_gpt":0.25273428196350617,"score_spread":0.23404899781230223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607302740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.954228,0.0012502376,0.037921086,0.0004807601,0.0020194375,0.000085541884,0.0000050815406,0.00015725894,0.0038525867],"genre_scores_gemma":[0.81150883,0.00016643504,0.1869906,0.00008043992,0.0010896875,0.000001716475,0.0000012827827,0.00005490796,0.000106112995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984097,0.000026836815,0.0006336077,0.00016210608,0.00043872523,0.00032903554],"domain_scores_gemma":[0.9984865,0.00010862821,0.0005108968,0.0004269327,0.00025917808,0.00020784204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312926,0.00023485371,0.0004212601,0.0002611361,0.00042347133,0.0006114011,0.0007022007,0.00015017184,0.00008052811],"category_scores_gemma":[0.0006973493,0.00021162535,0.00019815193,0.00008523848,0.00006972567,0.00052070507,0.000052293257,0.00064878847,0.00005192956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008014344,0.00004763155,0.0028352288,0.00005331661,0.00016629054,0.00013173073,0.0006786431,0.98270196,0.0020934548,0.00029248896,0.00015234444,0.010766747],"study_design_scores_gemma":[0.0030392127,0.00032032587,0.00914757,0.0016005922,0.00013329579,0.00024092794,0.0014914387,0.96696776,0.013410191,0.0005054207,0.002364312,0.0007789232],"about_ca_topic_score_codex":0.0000040276786,"about_ca_topic_score_gemma":0.0000010740649,"teacher_disagreement_score":0.14906952,"about_ca_system_score_codex":0.000067096495,"about_ca_system_score_gemma":0.000032989108,"threshold_uncertainty_score":0.8629831},"labels":[],"label_agreement":null},{"id":"W2609401311","doi":"10.1007/s10951-018-0566-0","title":"Shared processor scheduling","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Time complexity; Job shop scheduling; Optimization problem; Mathematical optimization; Parallel computing; Mathematics; Algorithm; Schedule","score_opus":0.016660781875116642,"score_gpt":0.24995005742866214,"score_spread":0.2332892755535455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609401311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696988,0.0016968434,0.42362174,0.00024390606,0.002179463,0.00008235022,0.0000026411235,0.00024430503,0.0022299252],"genre_scores_gemma":[0.5813978,0.000047095844,0.41705406,0.00006747443,0.0013680905,0.0000011336688,9.952394e-7,0.000034778717,0.000028601144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865264,0.000017465805,0.00060613255,0.000118578464,0.00033547194,0.00026971387],"domain_scores_gemma":[0.99880564,0.000050739633,0.00019901332,0.00014419842,0.0006202752,0.00018012503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005092814,0.00017176708,0.00027510792,0.00025997453,0.00011529206,0.00012722061,0.00029076033,0.00011549627,0.00016158297],"category_scores_gemma":[0.0002844333,0.0001574895,0.000116654875,0.00042834162,0.000057484696,0.0004801565,0.00002314309,0.00038977826,0.00008616752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006475417,0.000065670756,0.0011096369,0.00013623902,0.00022343104,0.000042154334,0.001386614,0.97345024,0.011032615,0.00025956015,0.00026666236,0.011962392],"study_design_scores_gemma":[0.0010319655,0.0001631416,0.00027597003,0.0003944816,0.000060653092,0.00021685733,0.0006979814,0.96912867,0.02658016,0.00039153564,0.00071368756,0.0003448732],"about_ca_topic_score_codex":5.99153e-7,"about_ca_topic_score_gemma":7.087946e-7,"teacher_disagreement_score":0.015547547,"about_ca_system_score_codex":0.00006453859,"about_ca_system_score_gemma":0.00007579111,"threshold_uncertainty_score":0.64222354},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.3347182439140028,"score_gpt":0.4707354262469032,"score_spread":0.1360171823329004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761740106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4814123,0.00015126546,0.51675755,0.0008912738,0.0005614262,0.00013955933,0.000012610913,0.000022450224,0.000051580995],"genre_scores_gemma":[0.62626743,0.000013047313,0.373048,0.00005852903,0.000465734,0.0000071320833,5.9858274e-7,0.000026512287,0.000112996204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99599284,0.00013226486,0.0013616906,0.0005547717,0.0013056551,0.000652752],"domain_scores_gemma":[0.9931182,0.0006936149,0.0027284517,0.0013631404,0.0015889064,0.0005076687],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010861659,0.00029106202,0.0007703706,0.0005207385,0.002009607,0.0019771012,0.0025247398,0.0002269457,0.000023491591],"category_scores_gemma":[0.011162671,0.0002250424,0.00060107355,0.0002403164,0.00019142465,0.0028714477,0.00016012779,0.00070056284,0.000032021555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019740811,0.00049937394,0.013589417,0.000021331754,0.00012089432,0.000008822314,0.0011690732,0.9397789,0.024627708,0.002360597,0.000036576614,0.01758987],"study_design_scores_gemma":[0.0015331557,0.00017216023,0.010076586,0.00011258578,0.00008330742,0.000039339015,0.0002482904,0.96306455,0.0016620854,0.022611665,0.00012117566,0.00027512448],"about_ca_topic_score_codex":0.00004769717,"about_ca_topic_score_gemma":0.000062670915,"teacher_disagreement_score":0.14485514,"about_ca_system_score_codex":0.00008654884,"about_ca_system_score_gemma":0.0005294409,"threshold_uncertainty_score":0.99928963},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013391782282690893,"score_gpt":0.2608581204676207,"score_spread":0.2474663381849298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761748578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67241,0.0014205985,0.3239491,0.00016307722,0.0007188172,0.00008683747,0.0000042333763,0.0001597952,0.001087497],"genre_scores_gemma":[0.61724865,0.00007101601,0.38189,0.000032370157,0.00062186987,0.0000013214767,0.0000014982242,0.000061892184,0.00007138179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982354,0.000023429302,0.00064609083,0.00020689334,0.00049012847,0.00039804634],"domain_scores_gemma":[0.998192,0.00010951932,0.0005823939,0.00040144543,0.00047038007,0.00024427756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005835203,0.00031194117,0.00045939183,0.00022970767,0.00059539545,0.00069233705,0.00061098824,0.0000781687,0.00004484985],"category_scores_gemma":[0.00053563307,0.00025428075,0.00013094247,0.00012286351,0.000095187665,0.0009206621,0.000050916784,0.0007238162,0.000013252145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005789325,0.00002726509,0.00096741354,0.00009662703,0.00008447273,0.0003481794,0.00019265932,0.9729757,0.0015010134,0.000023071889,0.000002611084,0.023723101],"study_design_scores_gemma":[0.0014243206,0.000073221934,0.00008335685,0.0005518596,0.000073884614,0.00048694047,0.00032931607,0.99182075,0.0046462794,0.000043948272,0.00012210442,0.00034401685],"about_ca_topic_score_codex":0.0000070217948,"about_ca_topic_score_gemma":0.0000061455985,"teacher_disagreement_score":0.05794089,"about_ca_system_score_codex":0.000082420884,"about_ca_system_score_gemma":0.00012115997,"threshold_uncertainty_score":0.99999094},"labels":[],"label_agreement":null},{"id":"W2898525980","doi":"10.1007/s10951-020-00644-9","title":"Interruptible algorithms for multiproblem solving","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Schedule; Multiprocessing; Scheduling (production processes); Upper and lower bounds; Computation; Class (philosophy); Job shop scheduling; Multiprocessor scheduling; Mathematical optimization; Quality (philosophy); Algorithm; Parallel computing; Mathematics; Artificial intelligence","score_opus":0.06143264323058698,"score_gpt":0.2962638072315829,"score_spread":0.23483116400099593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898525980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009659381,0.00057621906,0.98573995,0.0032346803,0.000562726,0.000087089065,0.0000031809732,0.000028980912,0.00010778285],"genre_scores_gemma":[0.5670658,0.000008113642,0.43215623,0.00035415168,0.00039722922,0.0000014951073,3.2447122e-7,0.000005796476,0.000010897037],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989102,0.000019161285,0.00050502206,0.0001499347,0.00021701922,0.0001986891],"domain_scores_gemma":[0.99895674,0.00006998849,0.0003931536,0.000111078116,0.00030013753,0.00016889727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004663342,0.000093539544,0.00024284898,0.000050742314,0.00007792489,0.00019756722,0.0006729005,0.000043250868,0.00000259105],"category_scores_gemma":[0.0001712826,0.00007830585,0.00015884497,0.00020621045,0.000011069697,0.0006882395,0.00008003521,0.00019212498,0.000008279857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003309016,0.0005048689,0.0030946718,0.0011418167,0.0007089193,0.00044771357,0.022436086,0.15967788,0.18643093,0.05135383,0.010538846,0.5633335],"study_design_scores_gemma":[0.0010770134,0.00030492534,0.00007365213,0.00023698754,0.000010162724,0.00009253677,0.0003036528,0.98010606,0.0038007947,0.00043103247,0.013407423,0.00015577237],"about_ca_topic_score_codex":0.0000019970462,"about_ca_topic_score_gemma":2.6784642e-7,"teacher_disagreement_score":0.8204282,"about_ca_system_score_codex":0.000027119986,"about_ca_system_score_gemma":0.00007551057,"threshold_uncertainty_score":0.319322},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010145540476667771,"score_gpt":0.2135125582657752,"score_spread":0.20336701778910743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963347283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73388445,0.0017150203,0.2625454,0.00011770137,0.0009071461,0.00011410394,0.0000030705544,0.00012498423,0.00058815174],"genre_scores_gemma":[0.7101382,0.00007824334,0.28934863,0.0000547302,0.00025760205,0.0000012562086,0.0000043784034,0.00005849497,0.000058461144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998266,0.000038322276,0.0006915241,0.00017496584,0.000527676,0.0003015137],"domain_scores_gemma":[0.99892384,0.0000712533,0.0003065846,0.00021962452,0.00030056227,0.0001781659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445744,0.00026319138,0.00040802834,0.00032044534,0.000078740064,0.00017218973,0.0002480922,0.00012459497,0.00015128974],"category_scores_gemma":[0.000068116824,0.00021579867,0.00011598421,0.00032795192,0.000023678793,0.0006027854,0.000026816679,0.00060292624,0.000061032784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059938622,0.00004037207,0.0059275324,0.00006158507,0.000107860236,0.000025122568,0.00022500756,0.9618037,0.02703229,0.00003269558,0.0000024600304,0.0046814554],"study_design_scores_gemma":[0.0021702382,0.0004253858,0.0006126277,0.0004151856,0.00008932149,0.00044989362,0.00042728265,0.980018,0.014773866,0.00004842905,0.0001438374,0.00042588814],"about_ca_topic_score_codex":0.000004202799,"about_ca_topic_score_gemma":0.00000830878,"teacher_disagreement_score":0.026803246,"about_ca_system_score_codex":0.00014358088,"about_ca_system_score_gemma":0.000058471243,"threshold_uncertainty_score":0.8800014},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07007471513145623,"score_gpt":0.3256633989004481,"score_spread":0.25558868376899185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981427367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961537,0.0013356437,0.035063412,0.000040793417,0.0016545977,0.00022513694,0.0000049690348,0.00009936257,0.000039083967],"genre_scores_gemma":[0.6002976,0.000071920804,0.39882275,0.000024688075,0.00071758055,0.0000018240006,0.0000031445966,0.000057675992,0.0000028556965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971533,0.00015180775,0.0012556901,0.00026160057,0.00063644315,0.00054115703],"domain_scores_gemma":[0.99850744,0.0002761762,0.0004308012,0.00029009668,0.00024865617,0.000246815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001954753,0.00032341553,0.00064993236,0.0007412649,0.00013411754,0.00026947403,0.00037464168,0.0003956217,0.000055115917],"category_scores_gemma":[0.00049222313,0.00032371833,0.00016751116,0.00074198714,0.000035054913,0.0008066178,0.000047816207,0.0015625338,0.000012374999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008261056,0.000046441935,0.018922685,0.000044324657,0.00003874133,0.000019780646,0.002357071,0.95197743,0.022082385,0.000023778515,5.388218e-7,0.004404187],"study_design_scores_gemma":[0.0015295945,0.00029039185,0.00038296657,0.0014395312,0.000049283473,0.00010056882,0.004276461,0.9864532,0.0049957223,0.000099978926,0.000012890217,0.00036945267],"about_ca_topic_score_codex":0.000024977679,"about_ca_topic_score_gemma":0.0000077455525,"teacher_disagreement_score":0.36375934,"about_ca_system_score_codex":0.00029268232,"about_ca_system_score_gemma":0.00019325834,"threshold_uncertainty_score":0.9999215},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.043729609832896726,"score_gpt":0.31903399613061034,"score_spread":0.2753043862977136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000464179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3940495,0.0018814057,0.60165,0.0008661081,0.00031775804,0.00033009014,0.00001291737,0.000165283,0.0007269806],"genre_scores_gemma":[0.36491323,0.00011240486,0.6340333,0.00038540133,0.00040652332,0.000007879433,0.000011719017,0.000082790175,0.000046732355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.00008691953,0.0008921122,0.00036628186,0.00064901874,0.00041895633],"domain_scores_gemma":[0.9984399,0.00010698505,0.00036386916,0.00021512949,0.00029773513,0.00057637464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006859312,0.00040769347,0.0006454218,0.00022515794,0.00019143203,0.00056414853,0.00048317635,0.00012488857,0.00015233277],"category_scores_gemma":[0.00023372474,0.0003515494,0.00010725718,0.0005923172,0.00006576724,0.0011008237,0.00016302537,0.000881522,0.000019878507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021761908,0.00007558792,0.00097612257,0.00009786715,0.00020481768,0.00012330616,0.0024940602,0.98897696,0.0026023886,0.000087476816,0.000011318879,0.004132483],"study_design_scores_gemma":[0.004804912,0.00030855817,0.000024568119,0.0002300731,0.00007438418,0.0001580814,0.0033329907,0.98371637,0.0066971714,0.000025349667,0.00020525279,0.00042231713],"about_ca_topic_score_codex":0.000011832969,"about_ca_topic_score_gemma":0.0000026972875,"teacher_disagreement_score":0.032383353,"about_ca_system_score_codex":0.00011268835,"about_ca_system_score_gemma":0.00016436915,"threshold_uncertainty_score":0.99989367},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.012681719122895806,"score_gpt":0.2344862857258268,"score_spread":0.221804566602931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205443176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41675767,0.0022687672,0.5801575,0.00027241308,0.0001669111,0.00014283057,0.0000073387364,0.00004454648,0.00018200453],"genre_scores_gemma":[0.4597702,0.00040343552,0.5395949,0.000014701178,0.0001257784,0.0000042553083,0.000009813356,0.000029825645,0.00004711975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866366,0.000043613512,0.00057930115,0.00016088292,0.0003032341,0.00024928956],"domain_scores_gemma":[0.9986124,0.000105385974,0.00021915077,0.00011345571,0.00083089794,0.00011869235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004525,0.00017232356,0.0004114642,0.00023042466,0.00013052364,0.00008466895,0.00009304949,0.00009599348,0.000030858566],"category_scores_gemma":[0.000067258894,0.00014586379,0.00009900207,0.0003809811,0.000060206825,0.00025727355,0.000020973086,0.0003681185,9.647007e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021791128,0.00005478826,0.0044606696,0.00040102517,0.00021958903,0.000019809631,0.00057810615,0.98235625,0.009003445,0.0006205287,0.000020060506,0.0020478326],"study_design_scores_gemma":[0.002436133,0.00025073183,0.0008967587,0.00077208446,0.000097977725,0.00041672584,0.00104918,0.98467016,0.008841429,0.00018443908,0.00016560763,0.00021877709],"about_ca_topic_score_codex":0.0000059604395,"about_ca_topic_score_gemma":0.0000070057527,"teacher_disagreement_score":0.04301253,"about_ca_system_score_codex":0.00006231533,"about_ca_system_score_gemma":0.0001272743,"threshold_uncertainty_score":0.59481525},"labels":[],"label_agreement":null},{"id":"W4387655016","doi":"10.1007/s10951-023-00794-6","title":"A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment","year":2023,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Hydro-Québec; Group for Research in Decision Analysis","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Time horizon; Scheduling (production processes); Schedule; Heuristic; Probabilistic logic; Supply chain management; Job shop scheduling; Partition (number theory); Operations research; Supply chain; Mathematics; Artificial intelligence","score_opus":0.20023957314529126,"score_gpt":0.38156992083434427,"score_spread":0.181330347689053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387655016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8988506,0.002014932,0.096343435,0.0018534942,0.0005683428,0.00019780894,0.000004027263,0.000041356427,0.00012595637],"genre_scores_gemma":[0.8048002,0.00039075117,0.19394824,0.000070862065,0.00034558392,0.000013561351,0.0000014107454,0.000024678244,0.00040471918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965738,0.0001625404,0.0013099384,0.00043005944,0.000945358,0.0005783058],"domain_scores_gemma":[0.99602735,0.0025537836,0.000693439,0.00028741133,0.00018419477,0.00025380173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009741304,0.00020957217,0.0005887914,0.0012193667,0.0003698559,0.00034942597,0.0004845394,0.0001321254,0.000043829885],"category_scores_gemma":[0.006372861,0.00017132692,0.00026080167,0.0012228141,0.00010079235,0.0003439845,0.00012482055,0.00048542253,0.00010028907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046210663,0.00015630318,0.039117713,0.000037861617,0.00012575784,0.000118688746,0.0053325184,0.9251533,0.0028763262,0.0018810903,0.00017896971,0.024559353],"study_design_scores_gemma":[0.0054658526,0.00045138696,0.019048784,0.0012077279,0.00018484189,0.0002414911,0.026926525,0.8774019,0.00048417295,0.06169756,0.006156902,0.00073287793],"about_ca_topic_score_codex":0.0000136466715,"about_ca_topic_score_gemma":0.0000048201737,"teacher_disagreement_score":0.097604804,"about_ca_system_score_codex":0.00009653295,"about_ca_system_score_gemma":0.00014746758,"threshold_uncertainty_score":0.762937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05302174323847721,"score_gpt":0.30076780278617504,"score_spread":0.24774605954769782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395683568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6796344,0.00038410607,0.3194876,0.000044072774,0.0001807777,0.000048052018,0.0000012473249,0.00009931408,0.000120448836],"genre_scores_gemma":[0.82762086,0.00002490669,0.17208767,0.0000038594526,0.00022768849,0.0000015517568,8.65818e-7,0.000028544584,0.000004073202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928975,0.000009255337,0.0003073751,0.000095703166,0.00010112492,0.00019678436],"domain_scores_gemma":[0.9996706,0.00006600208,0.00006274069,0.00007943297,0.000041160896,0.000080047525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003067679,0.0001318103,0.00019847827,0.00016809737,0.000072513576,0.00023741722,0.000088821944,0.00006681375,0.000009797533],"category_scores_gemma":[0.000012512911,0.000114561415,0.00007146255,0.00013166174,0.000036021993,0.00043500893,0.000014664415,0.0003911041,7.433652e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028606399,0.00002597321,0.0033725048,0.00027097066,0.00031709453,0.000455719,0.00086310896,0.92933184,0.03168102,0.00055572257,0.000030496734,0.033066962],"study_design_scores_gemma":[0.00017709997,0.0001358419,0.00047090714,0.0017435598,0.00011509114,0.0019307932,0.00087074307,0.9900527,0.0035849805,0.0001855093,0.00043510718,0.00029769042],"about_ca_topic_score_codex":0.000003488872,"about_ca_topic_score_gemma":0.0000044052053,"teacher_disagreement_score":0.14798646,"about_ca_system_score_codex":0.0002083733,"about_ca_system_score_gemma":0.00007897007,"threshold_uncertainty_score":0.4671679},"labels":[],"label_agreement":null},{"id":"W4410572358","doi":"10.1007/s10951-025-00844-1","title":"Learning to enumerate shifts for large-scale flexible personnel scheduling problems","year":2025,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Enumeration; Supply chain management; Scale (ratio); Operations research; Operations management; Supply chain; Mathematical optimization; Business; Mathematics; Engineering; Marketing","score_opus":0.07679868546407162,"score_gpt":0.3804134482776762,"score_spread":0.30361476281360456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410572358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49452522,0.0010035428,0.49876553,0.0034830733,0.0013500605,0.00023577234,0.00000644514,0.000055051598,0.0005752897],"genre_scores_gemma":[0.736538,0.00002518944,0.25947884,0.00051048066,0.00051302795,0.000015904405,0.0000016294076,0.000026356049,0.0028905612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954668,0.00022639704,0.001719673,0.0005588719,0.0012141085,0.0008141422],"domain_scores_gemma":[0.9943333,0.0018429871,0.0008815552,0.00041725222,0.0021422,0.00038265597],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.012623482,0.0002834299,0.000771617,0.0015094639,0.0011355352,0.0008233494,0.0010838563,0.00019062219,0.000086604654],"category_scores_gemma":[0.0141436905,0.0002311604,0.00059183344,0.0024149243,0.000047478494,0.0006729811,0.00018506103,0.0008936024,0.00012806096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028865703,0.00025287873,0.010958973,0.000058113117,0.0002211135,0.000008270098,0.008683716,0.95374984,0.010402451,0.003557721,0.00078604615,0.011032242],"study_design_scores_gemma":[0.0076147355,0.001433834,0.0044305227,0.0027729713,0.0005963446,0.00010811075,0.082200296,0.7234865,0.012648816,0.055234868,0.108057894,0.0014150984],"about_ca_topic_score_codex":0.0000093659455,"about_ca_topic_score_gemma":0.000014077975,"teacher_disagreement_score":0.24201278,"about_ca_system_score_codex":0.0001274633,"about_ca_system_score_gemma":0.00056845375,"threshold_uncertainty_score":0.9941606},"labels":[],"label_agreement":null},{"id":"W4412931633","doi":"10.1007/s10951-025-00850-3","title":"Multiprocessor scheduling with testing: improved online algorithms and numerical experiments","year":2025,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiprocessing; Computer science; Parallel computing; Algorithm; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.019713341702457202,"score_gpt":0.26978984311707327,"score_spread":0.25007650141461607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412931633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40453786,0.002953853,0.59151095,0.0001614989,0.00045007883,0.00009970879,0.0000026774405,0.00013538045,0.00014798106],"genre_scores_gemma":[0.42042196,0.00005116245,0.57922345,0.00007650326,0.0001703693,0.000002760485,0.0000016615477,0.000028201343,0.000023904815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862546,0.000021411206,0.00061726087,0.00019424813,0.00024583464,0.0002958114],"domain_scores_gemma":[0.9988983,0.00016103257,0.00019912678,0.0001370071,0.0004245661,0.00017992446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028196123,0.00025051011,0.00040183833,0.0002978241,0.00012321003,0.00012436496,0.00019936435,0.00011902589,0.0000076068736],"category_scores_gemma":[0.00034404136,0.00020761778,0.000059914357,0.00061564514,0.000053839853,0.00031159824,0.00004033763,0.00054305216,0.0000013225629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008539126,0.00017689244,0.0041808626,0.00016593985,0.00031161276,0.00004220348,0.00044328667,0.93585396,0.015611431,0.000032257838,0.000008657175,0.043087516],"study_design_scores_gemma":[0.0017374298,0.00013503584,0.0004810745,0.00050587236,0.00007296627,0.000109593864,0.0010657685,0.98499316,0.01056025,0.0000370378,0.00006432173,0.00023746218],"about_ca_topic_score_codex":0.0000042767697,"about_ca_topic_score_gemma":4.628016e-7,"teacher_disagreement_score":0.04913924,"about_ca_system_score_codex":0.000073664174,"about_ca_system_score_gemma":0.000111968046,"threshold_uncertainty_score":0.8466407},"labels":[],"label_agreement":null},{"id":"W4412931740","doi":"10.1007/s10951-025-00851-2","title":"Designing a long-term master surgical timetable: a case study in balancing post-operative ward bed demand and minimizing changes in surgical schedules","year":2025,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Term (time); Operations management; Operations research; Computer science; Economics; Engineering","score_opus":0.06559899999927911,"score_gpt":0.4211312845289381,"score_spread":0.355532284529659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412931740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9915161,0.0021036845,0.0034459985,0.001615865,0.00031417533,0.00091003015,0.0000027378776,0.00001527523,0.0000761107],"genre_scores_gemma":[0.97073334,0.0003288958,0.028393267,0.00019257581,0.00021594379,0.000044239503,0.0000036959682,0.000023708822,0.00006430603],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99554855,0.0017521982,0.00152759,0.0003399026,0.00028353432,0.0005482303],"domain_scores_gemma":[0.99737304,0.0012873096,0.00040504674,0.0001548723,0.0005848812,0.00019481678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00496988,0.00025126318,0.00079689303,0.0009534073,0.0005889054,0.000099159486,0.0001255287,0.00027841114,0.00006019238],"category_scores_gemma":[0.00060890673,0.00020855897,0.00005893694,0.0007600762,0.00004538864,0.00046310166,0.00012585957,0.0014920682,0.0000025482093],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036424,0.0002849733,0.96315926,0.000254451,0.00007146802,0.010782046,0.014533261,0.0068573793,0.0005237656,0.0000821357,0.0000015394738,0.003085501],"study_design_scores_gemma":[0.05266823,0.0030878747,0.2765466,0.02638788,0.0005893677,0.010374214,0.4653873,0.16146131,0.0012353465,0.00012091888,0.00014942943,0.001991519],"about_ca_topic_score_codex":0.0002971404,"about_ca_topic_score_gemma":0.0032407227,"teacher_disagreement_score":0.68661267,"about_ca_system_score_codex":0.00027219005,"about_ca_system_score_gemma":0.0008017962,"threshold_uncertainty_score":0.85047877},"labels":[],"label_agreement":null}]}