{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7388477,0.0008052099,0.24287327,0.001529485,0.000075639764,0.0001336021,0.0010062811,0.00020502416,0.014523826],"genre_scores_gemma":[0.9767223,0.0003705005,0.018088875,0.00006854845,0.00008400028,0.00008443335,0.00048593798,0.00005740369,0.004038042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988949,0.0003004773,0.000055425702,0.000212338,0.0003309016,0.00020609987],"domain_scores_gemma":[0.99174035,0.006430253,0.00081831287,0.00021301494,0.00027969756,0.0005183221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011497319,0.0007263744,0.0020885307,0.0009921376,0.0009856226,0.0028288027,0.0019626447,0.0014737176,0.0055189435],"category_scores_gemma":[0.0073930905,0.0008064643,0.0013008626,0.0011486411,0.0015112184,0.0032647033,0.0014561213,0.001329731,0.0002217855],"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.00034805643,0.00015948275,0.0022128825,0.000252274,0.00007682843,0.0004065918,0.00024522858,0.830773,0.0018528079,0.14859715,0.0017069037,0.013368797],"study_design_scores_gemma":[0.000055794804,0.000058791054,0.00073249283,0.000009755246,0.000019771347,0.00008318159,0.00007064137,0.841761,0.00033784923,0.15641999,0.00043151676,0.000019141275],"about_ca_topic_score_codex":0.0035703767,"about_ca_topic_score_gemma":0.0027203243,"teacher_disagreement_score":0.0055189435,"about_ca_system_score_codex":0.001596188,"about_ca_system_score_gemma":0.0016185482,"threshold_uncertainty_score":0.018462718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90516406,0.00019521544,0.09148955,0.00023698258,0.00015945119,0.00008268362,0.000058019607,0.00015888347,0.002455109],"genre_scores_gemma":[0.984211,0.000044593115,0.014664608,0.000036073983,0.000037072226,0.000028817904,0.000069470996,0.000035327463,0.0008729739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998869,0.00027452013,0.00007594747,0.0002088244,0.00027226462,0.00029938458],"domain_scores_gemma":[0.9935364,0.0033931527,0.0006149429,0.00082812767,0.00092735863,0.0006999289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002693672,0.00042096028,0.0007341855,0.000825831,0.0020253074,0.0017362986,0.0019822433,0.00073804165,0.0011083431],"category_scores_gemma":[0.010984462,0.00064156955,0.0003264585,0.0012072443,0.00084665447,0.0015505605,0.0010640768,0.001001815,0.0001691333],"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.004754274,0.000708281,0.018289244,0.0001573642,0.0001472938,0.0007511339,0.0005479384,0.7998671,0.0462637,0.023496006,0.001910228,0.10310744],"study_design_scores_gemma":[0.00004440458,0.00022419788,0.001975111,0.000003346102,0.000014603442,0.00006155942,0.000054780485,0.9889619,0.0040138587,0.0043221437,0.00031167068,0.000012398107],"about_ca_topic_score_codex":0.0025368603,"about_ca_topic_score_gemma":0.006946035,"teacher_disagreement_score":0.002693672,"about_ca_system_score_codex":0.0010890244,"about_ca_system_score_gemma":0.0023036343,"threshold_uncertainty_score":0.014245629},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21409181,0.0005745465,0.780215,0.000524974,0.00016962609,0.00023785625,0.0001775208,0.00038285425,0.0036258472],"genre_scores_gemma":[0.91561925,0.0003101738,0.07917368,0.00011987999,0.000108614724,0.00014512385,0.00018091519,0.000089625224,0.0042527243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895644,0.0004378827,0.000064978536,0.0001570223,0.00020711373,0.00017647943],"domain_scores_gemma":[0.9940911,0.004233079,0.0004714979,0.000306933,0.00044132947,0.000456035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042077308,0.0007679537,0.0018198098,0.00089689484,0.0011685458,0.0015041205,0.002296986,0.0011087154,0.0028478722],"category_scores_gemma":[0.0074466523,0.0011135341,0.0010167263,0.001219964,0.0012990941,0.002261016,0.0012154892,0.001126031,0.00018047125],"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.0009887816,0.00018320332,0.0010279093,0.0001491606,0.00009619498,0.00022001997,0.00016929452,0.93584776,0.003355995,0.042036306,0.001165045,0.0147602605],"study_design_scores_gemma":[0.000032080574,0.00007334336,0.0001155354,0.000004293713,0.00001487606,0.000018087207,0.000016951542,0.9891528,0.00036663853,0.01002683,0.00017070939,0.000007821763],"about_ca_topic_score_codex":0.0043057,"about_ca_topic_score_gemma":0.0035968479,"teacher_disagreement_score":0.0043057,"about_ca_system_score_codex":0.00140836,"about_ca_system_score_gemma":0.0012218172,"threshold_uncertainty_score":0.022252858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27503756,0.013015085,0.54721016,0.008221693,0.001243607,0.000715206,0.0023451047,0.0016518151,0.15055977],"genre_scores_gemma":[0.83762205,0.0076743434,0.13184294,0.0019501265,0.0017712933,0.0008330075,0.0017651502,0.0010111823,0.015529981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920718,0.002976337,0.0002391507,0.0006178263,0.0021168988,0.0019779275],"domain_scores_gemma":[0.93409526,0.05637984,0.002032271,0.0019508164,0.0025658088,0.002975999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010094541,0.004593094,0.0060675154,0.0036672137,0.002723819,0.0075936127,0.006481047,0.004262837,0.018848745],"category_scores_gemma":[0.05372881,0.0020714074,0.0021550644,0.0054553435,0.0030784574,0.008603452,0.0041204584,0.0084842965,0.0025679497],"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.004284109,0.0013567775,0.001985692,0.0012805964,0.00028854556,0.0003380597,0.0005415043,0.5424319,0.009144973,0.32260385,0.025668956,0.090075076],"study_design_scores_gemma":[0.00020589324,0.00049988064,0.00057320995,0.0001299619,0.00009374169,0.00024754027,0.00016312834,0.8067396,0.0013853603,0.18666372,0.0032394642,0.00005844751],"about_ca_topic_score_codex":0.004699998,"about_ca_topic_score_gemma":0.0044021145,"teacher_disagreement_score":0.018848745,"about_ca_system_score_codex":0.004434586,"about_ca_system_score_gemma":0.005050736,"threshold_uncertainty_score":0.06305534},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10978224,0.0007943954,0.8742915,0.0017054903,0.00024668503,0.0003362437,0.0013952008,0.00042993392,0.011018274],"genre_scores_gemma":[0.875542,0.00057752704,0.11119727,0.00029498435,0.00026602636,0.0003495787,0.0011999803,0.00017250564,0.010400148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968419,0.0013305668,0.00016512342,0.0005389384,0.00045306364,0.0006702516],"domain_scores_gemma":[0.9858769,0.010387493,0.0011010669,0.0007105584,0.00077729946,0.0011466326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004659467,0.0017497045,0.0048032976,0.001065298,0.0011230203,0.003885126,0.004131217,0.0038680588,0.0105366055],"category_scores_gemma":[0.01101661,0.0017462316,0.0015489358,0.0023253309,0.0017696307,0.005885447,0.0040664994,0.0027985906,0.0008166474],"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.0009735657,0.00042703512,0.0007473855,0.00044004142,0.00014080243,0.00032028122,0.00010885216,0.93957245,0.0010613421,0.030572722,0.0027981608,0.022837302],"study_design_scores_gemma":[0.00007651267,0.00009780306,0.00014208427,0.0000107879305,0.000018004792,0.00003172174,0.000026175316,0.9803981,0.00029629547,0.018569417,0.0003203819,0.0000127373305],"about_ca_topic_score_codex":0.0032404358,"about_ca_topic_score_gemma":0.0029722475,"teacher_disagreement_score":0.0105366055,"about_ca_system_score_codex":0.0020037917,"about_ca_system_score_gemma":0.0026345053,"threshold_uncertainty_score":0.03524846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24403211,0.0038347896,0.7055122,0.002372473,0.00031126337,0.00018465414,0.0005588722,0.0003584287,0.042835206],"genre_scores_gemma":[0.90895563,0.0020642462,0.07846623,0.00010194906,0.00040427677,0.00013488396,0.0001839946,0.00009621298,0.009592608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985643,0.0005365124,0.00006433727,0.00014960788,0.0003272839,0.00035813023],"domain_scores_gemma":[0.9871902,0.010401473,0.0009133703,0.0004577011,0.00050931296,0.0005280325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027331377,0.0015487757,0.002035556,0.0013652536,0.0016231139,0.002622783,0.002427235,0.00220155,0.0046337475],"category_scores_gemma":[0.015963398,0.0010237093,0.0013783342,0.003497205,0.0021400466,0.0034207318,0.002059548,0.0025128138,0.00036137743],"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.00067071617,0.00049077923,0.0015461792,0.00044570467,0.00008362978,0.0016240631,0.00034827535,0.5429992,0.0016318863,0.40804943,0.006574493,0.035535675],"study_design_scores_gemma":[0.00010543649,0.00006027251,0.00025289957,0.000013700191,0.000030133824,0.00024283453,0.00011700578,0.8697953,0.00039490397,0.12797001,0.0009997514,0.000017713817],"about_ca_topic_score_codex":0.0049844948,"about_ca_topic_score_gemma":0.005022205,"teacher_disagreement_score":0.0049844948,"about_ca_system_score_codex":0.0015036816,"about_ca_system_score_gemma":0.0013174765,"threshold_uncertainty_score":0.01550144},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084639244,0.0002058382,0.9074316,0.00037847992,0.00012990226,0.0005865518,0.00017541916,0.0005269402,0.0059260316],"genre_scores_gemma":[0.48347837,0.00011406938,0.5126871,0.00015230174,0.000039240083,0.00061597204,0.00025254962,0.00011964063,0.002540738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913675,0.00032921377,0.000035988887,0.000121408986,0.00016062081,0.00021595761],"domain_scores_gemma":[0.99824345,0.0012526156,0.00011540774,0.00008681031,0.00015809792,0.00014353852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020286592,0.0010198161,0.0016930802,0.0017264549,0.0009777215,0.0014380867,0.00263781,0.0018299051,0.0061283517],"category_scores_gemma":[0.00319735,0.001300654,0.0012646785,0.0014835064,0.00074200495,0.0016969104,0.0013769685,0.0011464156,0.00050422084],"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.00038268822,0.00045453195,0.00032842343,0.00014570588,0.00003985235,0.000071282506,0.00009405837,0.934315,0.0025349448,0.007050652,0.0012161388,0.053366754],"study_design_scores_gemma":[0.00014336724,0.000135675,0.00013914061,0.000010229948,0.000019983932,0.000017493743,0.000026029731,0.99598026,0.000677311,0.0023588836,0.00047641873,0.000015212995],"about_ca_topic_score_codex":0.008013726,"about_ca_topic_score_gemma":0.008335254,"teacher_disagreement_score":0.008013726,"about_ca_system_score_codex":0.0018868822,"about_ca_system_score_gemma":0.0044343863,"threshold_uncertainty_score":0.020501316},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13936995,0.00048785392,0.8431922,0.0018667852,0.00032060107,0.00006225104,0.0001982612,0.00031304924,0.014189129],"genre_scores_gemma":[0.9708694,0.00028795353,0.02191888,0.000112825444,0.00015857298,0.000049009253,0.000085980944,0.00004484938,0.00647244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911326,0.00036596137,0.000029308252,0.0001168252,0.00019877602,0.00017581916],"domain_scores_gemma":[0.9950277,0.003236458,0.00048516135,0.00043179217,0.000492703,0.00032612475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026426744,0.0008163066,0.0010962042,0.00069749483,0.00072147785,0.0019166323,0.0017374454,0.0010294734,0.0044342917],"category_scores_gemma":[0.011751598,0.00059887255,0.0007180383,0.0009441615,0.0013616794,0.00247383,0.00159082,0.0024240897,0.00027193362],"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.000086954315,0.00005144528,0.00027305514,0.000019735937,0.000015205398,0.000036407113,0.000042102612,0.89395994,0.0003125751,0.09617038,0.00070349255,0.008328713],"study_design_scores_gemma":[0.0000060552056,0.000011311588,0.00004426635,0.0000018353229,0.0000034880327,0.0000040416808,0.000003964082,0.9803591,0.000047851423,0.019365862,0.00014860644,0.0000036485658],"about_ca_topic_score_codex":0.00694995,"about_ca_topic_score_gemma":0.006387864,"teacher_disagreement_score":0.00694995,"about_ca_system_score_codex":0.0018527595,"about_ca_system_score_gemma":0.0024780768,"threshold_uncertainty_score":0.014834166},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0152313365,0.000883877,0.97143954,0.000685294,0.00015770814,0.00018598622,0.00014065109,0.00017416757,0.011101388],"genre_scores_gemma":[0.2646139,0.0026250745,0.7144743,0.0005848313,0.00041671848,0.00037521333,0.000515928,0.00043229506,0.015961783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864155,0.0006119048,0.000046589565,0.00023396175,0.0002953376,0.00017070986],"domain_scores_gemma":[0.9964367,0.0025843773,0.00021822762,0.00025501914,0.00028378554,0.00022193223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018246614,0.0016813715,0.001533122,0.0019425257,0.0013338894,0.0024332658,0.003149672,0.001997149,0.0061037955],"category_scores_gemma":[0.0050480524,0.0010493761,0.0018871849,0.0031115927,0.001996118,0.004114667,0.0024808708,0.0031018446,0.0005717779],"study_design_candidate":"theoretical_or_conceptual","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.0001489415,0.00019144942,0.00037660665,0.00034103487,0.00008926597,0.00009588374,0.00030437953,0.7395627,0.002021944,0.19184962,0.004363519,0.06065471],"study_design_scores_gemma":[0.000050389277,0.000054443128,0.00015659664,0.000037623104,0.000049151415,0.000035203797,0.00008119464,0.7727547,0.00048526807,0.22208476,0.0041917865,0.000018918103],"about_ca_topic_score_codex":0.010342252,"about_ca_topic_score_gemma":0.0100291055,"teacher_disagreement_score":0.010342252,"about_ca_system_score_codex":0.0027138703,"about_ca_system_score_gemma":0.0016873499,"threshold_uncertainty_score":0.02056408},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4715106,0.0005505714,0.5151974,0.0003044551,0.0005629198,0.00029766202,0.00024246488,0.0004896246,0.01084435],"genre_scores_gemma":[0.8921368,0.0001683116,0.103595376,0.000056651872,0.00012051101,0.000118480966,0.00021198035,0.00013245583,0.0034593642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989912,0.00030930404,0.00005923157,0.00014886909,0.00023333651,0.00025819326],"domain_scores_gemma":[0.9967649,0.0016645256,0.00026782582,0.00034774782,0.00043641485,0.0005185199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002341765,0.00067517784,0.0012714051,0.00081520167,0.0013556618,0.0017193952,0.001551946,0.0006594983,0.00348905],"category_scores_gemma":[0.005984138,0.0007960367,0.0006154751,0.0014533271,0.0008988437,0.00154329,0.0011773866,0.0008846417,0.00044828717],"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.011361033,0.0011436333,0.0056709438,0.00057973235,0.0002237987,0.0019271648,0.0011955932,0.4569474,0.053968687,0.32853782,0.010519666,0.12792456],"study_design_scores_gemma":[0.00034940336,0.00077952316,0.0009468585,0.000022927974,0.000061795115,0.00022771352,0.00016850246,0.8958955,0.0078016506,0.08954185,0.004159085,0.000045171742],"about_ca_topic_score_codex":0.0013313042,"about_ca_topic_score_gemma":0.0011964325,"teacher_disagreement_score":0.00348905,"about_ca_system_score_codex":0.0006629192,"about_ca_system_score_gemma":0.001256779,"threshold_uncertainty_score":0.0123845935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5315879,0.0009569544,0.45537037,0.00041891946,0.0000922142,0.00034519154,0.00071433425,0.0010270549,0.009487099],"genre_scores_gemma":[0.94573766,0.0002718141,0.05214122,0.00005758792,0.00007502226,0.000145364,0.00038118236,0.00020163172,0.0009885468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720085,0.0008232863,0.00015326694,0.00032704123,0.0008977905,0.00059788005],"domain_scores_gemma":[0.9702149,0.021628233,0.0026554365,0.0022250656,0.0018986972,0.0013777524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052125766,0.0012166458,0.0018589727,0.001388674,0.0010954087,0.0018859018,0.0018649421,0.00073470303,0.0032743767],"category_scores_gemma":[0.02540322,0.00094298425,0.0006582619,0.0023138358,0.0015481956,0.0032409348,0.0018342006,0.0011947346,0.0003368865],"study_design_candidate":"theoretical_or_conceptual","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.0030155506,0.00087907544,0.0039170114,0.0005809095,0.00015859577,0.00030334378,0.00047587106,0.8281365,0.014520316,0.06651199,0.0035911642,0.077909775],"study_design_scores_gemma":[0.00014735221,0.0007492536,0.0011877625,0.00002466677,0.00007089441,0.00023578435,0.00016685907,0.926183,0.0048213643,0.06564218,0.0007405503,0.0000302761],"about_ca_topic_score_codex":0.0018681003,"about_ca_topic_score_gemma":0.002471009,"teacher_disagreement_score":0.0052125766,"about_ca_system_score_codex":0.0016181729,"about_ca_system_score_gemma":0.0026563143,"threshold_uncertainty_score":0.027567089},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6866948,0.0007830693,0.29407308,0.0017887553,0.00014881855,0.000408427,0.0010107214,0.00091377326,0.014178569],"genre_scores_gemma":[0.9256913,0.0003042826,0.070058584,0.00036146346,0.00015183612,0.0002549848,0.001006055,0.00025660876,0.0019149175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943786,0.001834916,0.00047866642,0.0009957008,0.0012479218,0.0010641658],"domain_scores_gemma":[0.9392808,0.04486195,0.004620148,0.0052511767,0.003033519,0.002952372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053805774,0.0014717004,0.0029119444,0.0024844431,0.0026117258,0.0065297955,0.0037963002,0.0034200605,0.003828499],"category_scores_gemma":[0.049622033,0.0024957897,0.002405298,0.0031597326,0.003494356,0.0056316857,0.003978198,0.0025774671,0.0005454588],"study_design_candidate":"theoretical_or_conceptual","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.004394504,0.0020733068,0.016358646,0.0008806682,0.0006044968,0.0005226616,0.0013578276,0.4919845,0.01626636,0.40099832,0.012005972,0.05255277],"study_design_scores_gemma":[0.00020247701,0.0004904979,0.002050038,0.00007300751,0.000096861404,0.0003266129,0.00046042545,0.5890932,0.0029808553,0.40285188,0.0013219697,0.000052167514],"about_ca_topic_score_codex":0.00071263814,"about_ca_topic_score_gemma":0.0009476299,"teacher_disagreement_score":0.0065297955,"about_ca_system_score_codex":0.0020352858,"about_ca_system_score_gemma":0.002512068,"threshold_uncertainty_score":0.028455496},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25577644,0.0009749988,0.7266912,0.00034801624,0.0002007174,0.00041705708,0.00022984201,0.00067350984,0.014688217],"genre_scores_gemma":[0.73437613,0.00029377113,0.26195058,0.00011771174,0.000065576896,0.0004487051,0.00018875621,0.00006962865,0.0024891312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942625,0.00022044619,0.00003491007,0.00008152955,0.00010954451,0.00012738883],"domain_scores_gemma":[0.99850756,0.0011413839,0.0000889581,0.000060533544,0.000118104836,0.00008350117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012547749,0.0008620823,0.0013872352,0.0018057775,0.0006700701,0.0014195747,0.0016725527,0.0017790383,0.0029391828],"category_scores_gemma":[0.0018772295,0.0008377299,0.0012846213,0.0016880328,0.0005018885,0.0010678469,0.00094735814,0.000731769,0.00020617817],"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.00018268568,0.00017065392,0.0004783023,0.000108222404,0.000087474094,0.0000531915,0.000037477075,0.96385926,0.0013907965,0.002368964,0.00041363307,0.0308493],"study_design_scores_gemma":[0.000048481426,0.000088384295,0.00011129337,0.00000663113,0.00002460927,0.000010840121,0.000019086136,0.9982443,0.0002710387,0.00096211873,0.0002074172,0.000005840227],"about_ca_topic_score_codex":0.0079894755,"about_ca_topic_score_gemma":0.007689212,"teacher_disagreement_score":0.0079894755,"about_ca_system_score_codex":0.0010135155,"about_ca_system_score_gemma":0.0018062708,"threshold_uncertainty_score":0.01588595},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50361395,0.004616919,0.43762267,0.0011862855,0.0003623645,0.000212367,0.0005320052,0.0009496199,0.050903816],"genre_scores_gemma":[0.7601346,0.00092524453,0.23490046,0.00014726333,0.000121378805,0.00017192314,0.000240605,0.00017746381,0.0031811625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929965,0.00033647215,0.000021653823,0.0000522927,0.00021196426,0.00007792147],"domain_scores_gemma":[0.9848316,0.013618958,0.0003160176,0.0005963048,0.00052445754,0.000112683636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018228403,0.0005717564,0.00082591246,0.00094125496,0.0006264876,0.0009290144,0.0011091875,0.0007349524,0.005821822],"category_scores_gemma":[0.011839607,0.00039642927,0.0005377021,0.0016763079,0.0007855229,0.0016081296,0.0004747481,0.0011498011,0.00023154155],"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.00021014927,0.00015861871,0.0008620295,0.00013583082,0.000026264415,0.000026867161,0.00004485273,0.92560506,0.0005149957,0.027135277,0.0014922515,0.043787703],"study_design_scores_gemma":[0.00001627178,0.000028901717,0.000115917086,0.0000048839183,0.0000053443787,0.000006203047,0.000013770938,0.99577856,0.00011893677,0.0036877745,0.00022132332,0.000002172494],"about_ca_topic_score_codex":0.009031719,"about_ca_topic_score_gemma":0.013909481,"teacher_disagreement_score":0.009031719,"about_ca_system_score_codex":0.0011460923,"about_ca_system_score_gemma":0.0021344756,"threshold_uncertainty_score":0.019475937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48315123,0.0003479112,0.512407,0.00028220977,0.00020023971,0.00022149894,0.00011766025,0.00089529046,0.0023769794],"genre_scores_gemma":[0.90055144,0.00007249906,0.09702132,0.00006188932,0.00005003239,0.00008113387,0.0000722991,0.00010580368,0.0019835834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954635,0.00012330781,0.000033894197,0.00006910421,0.0000916992,0.00013561985],"domain_scores_gemma":[0.9981359,0.0010310301,0.00021688745,0.00014646802,0.00022201872,0.00024757138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013240069,0.0006924414,0.0009621433,0.0007693644,0.00081258727,0.001058636,0.0013252212,0.0009096178,0.0023426106],"category_scores_gemma":[0.0030109745,0.000618921,0.0005984509,0.00074027665,0.00091293507,0.0010870808,0.0010500887,0.0008324344,0.00032128918],"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.002996872,0.0004001082,0.0013244697,0.00028878578,0.00009697108,0.00021403057,0.00017538074,0.90193266,0.034919925,0.007936582,0.0014707281,0.048243485],"study_design_scores_gemma":[0.000058445712,0.00028942677,0.00022447563,0.0000069848065,0.0000118242915,0.000025460678,0.000031068957,0.99156487,0.003701281,0.0038541888,0.00022124725,0.000010689185],"about_ca_topic_score_codex":0.0017809853,"about_ca_topic_score_gemma":0.002931418,"teacher_disagreement_score":0.0023426106,"about_ca_system_score_codex":0.0008535189,"about_ca_system_score_gemma":0.001715529,"threshold_uncertainty_score":0.007836819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49027097,0.0004433943,0.40577248,0.0028937461,0.00014620797,0.00034125696,0.00038615894,0.0005400615,0.09920571],"genre_scores_gemma":[0.9167921,0.000110448775,0.07083666,0.00008651434,0.000034500365,0.00008259689,0.00012867605,0.000062371546,0.011866121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.999008,0.0005351701,0.000020834408,0.000088323366,0.00018362234,0.00016410724],"domain_scores_gemma":[0.99858886,0.0009278765,0.00009885118,0.0001949069,0.00012358309,0.000065911605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016596967,0.00033966135,0.0004561613,0.00032022374,0.0011346678,0.0011537535,0.0010115515,0.0018766606,0.0069623673],"category_scores_gemma":[0.004155788,0.00019992919,0.00068563607,0.00065661466,0.0007173824,0.0011096442,0.0010012133,0.001023863,0.00039085324],"study_design_candidate":"case_report","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.0002648304,0.00039730014,0.0013925463,0.00013232538,0.000042664775,0.0021862474,0.00046429213,0.62417877,0.002231471,0.32234323,0.0062585007,0.04010781],"study_design_scores_gemma":[0.00010050184,0.00021605109,0.0005434607,0.000015299504,0.0000332731,0.00049784745,0.0004448484,0.93787813,0.0031088316,0.043329448,0.013809612,0.000022760329],"about_ca_topic_score_codex":0.0064238887,"about_ca_topic_score_gemma":0.006057002,"teacher_disagreement_score":0.0069623673,"about_ca_system_score_codex":0.0011031359,"about_ca_system_score_gemma":0.0011261184,"threshold_uncertainty_score":0.023291409},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014046503,0.09095541,0.88053995,0.0010534456,0.000117539246,0.0003341153,0.0005064251,0.001307268,0.011139317],"genre_scores_gemma":[0.050214972,0.054916933,0.8904464,0.0003629585,0.0001242241,0.0003141764,0.00080429466,0.0002593857,0.0025566416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99587834,0.0013282822,0.00050645386,0.00055452046,0.0015730791,0.00015930335],"domain_scores_gemma":[0.9910261,0.006330024,0.00048957684,0.0007144323,0.0013479982,0.00009190191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004520689,0.0011122545,0.0013755817,0.0054336055,0.00065638445,0.0025989509,0.0024466864,0.0011495901,0.0035154435],"category_scores_gemma":[0.012416474,0.0010327066,0.0015224875,0.008532959,0.0006199335,0.002634384,0.00076174235,0.001078323,0.0010863122],"study_design_candidate":"not_applicable","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.00007179347,0.00023696198,0.0021978044,0.0038800766,0.00013264426,0.00005577663,0.00016680165,0.024146015,0.003580521,0.022897627,0.0045819893,0.93805194],"study_design_scores_gemma":[0.0002372118,0.00091500365,0.008135487,0.004233545,0.0005287926,0.0017316439,0.00077991036,0.586015,0.021350052,0.108423054,0.26743805,0.00021228738],"about_ca_topic_score_codex":0.0040732664,"about_ca_topic_score_gemma":0.005476721,"teacher_disagreement_score":0.0054336055,"about_ca_system_score_codex":0.0012708185,"about_ca_system_score_gemma":0.0026493187,"threshold_uncertainty_score":0.02390796},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14190331,0.0030055165,0.8457916,0.00083331735,0.0005299823,0.00019844214,0.00018104239,0.00054735015,0.007009377],"genre_scores_gemma":[0.87486106,0.00068664394,0.12182979,0.00010234463,0.00017076636,0.00010143977,0.00009136822,0.00016300703,0.0019936091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947625,0.00020286281,0.000022274458,0.00010494286,0.000096573865,0.000097104516],"domain_scores_gemma":[0.99892265,0.0006952277,0.00010500433,0.00009040672,0.000112035224,0.00007460736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014483684,0.0010554147,0.002070211,0.00070552726,0.000721248,0.0010055125,0.0022494101,0.00083358644,0.0019560487],"category_scores_gemma":[0.0033158783,0.00073804794,0.0008356495,0.0015025303,0.0004560652,0.0010998846,0.0005657414,0.0008709489,0.00014665598],"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.0002777897,0.00013267963,0.00056594517,0.00028749273,0.00017856415,0.00013808045,0.000069129324,0.93129593,0.0031234731,0.012130076,0.0029651015,0.04883569],"study_design_scores_gemma":[0.00001792833,0.00007875072,0.00024746868,0.000009676795,0.000028692732,0.000034168028,0.000014825425,0.99273807,0.0005549362,0.0059789843,0.0002911137,0.0000055047403],"about_ca_topic_score_codex":0.0030058287,"about_ca_topic_score_gemma":0.0033946019,"teacher_disagreement_score":0.0030058287,"about_ca_system_score_codex":0.0008391736,"about_ca_system_score_gemma":0.0017382255,"threshold_uncertainty_score":0.007659793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010186333,0.00010058915,0.995184,0.00069081946,0.000056814122,0.00004756623,0.00006255994,0.00011934031,0.0027196384],"genre_scores_gemma":[0.19552943,0.00088269653,0.7960644,0.0004186764,0.0007583739,0.0005176645,0.00029588345,0.00023073335,0.0053021195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367213,0.002646014,0.00034813787,0.0007474847,0.0020856522,0.00050055655],"domain_scores_gemma":[0.9917767,0.00479978,0.0005402065,0.0013590577,0.0010315378,0.000492735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006873243,0.0018466576,0.0018583243,0.002044562,0.0024403678,0.0052980664,0.0044761417,0.002794301,0.0072475807],"category_scores_gemma":[0.018738072,0.0015626826,0.001959689,0.0033892067,0.0053364662,0.007011371,0.0045427056,0.0063891504,0.001233782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000023255889,0.00004959794,0.00012513272,0.00007066453,0.000019267567,0.000072437906,0.00010418194,0.19293119,0.0004396228,0.7935154,0.002392587,0.010256773],"study_design_scores_gemma":[0.000017015123,0.000028303923,0.000041428357,0.000018486553,0.000010955585,0.000056231176,0.00004727744,0.54700834,0.00019424583,0.44725934,0.0053000995,0.000018281724],"about_ca_topic_score_codex":0.006934546,"about_ca_topic_score_gemma":0.007183987,"teacher_disagreement_score":0.0072475807,"about_ca_system_score_codex":0.004201659,"about_ca_system_score_gemma":0.006145223,"threshold_uncertainty_score":0.036349654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026561227,0.0005586134,0.96344423,0.0006208772,0.00018350978,0.0003127924,0.00019666481,0.00089545146,0.007226578],"genre_scores_gemma":[0.22208378,0.0005099044,0.7702034,0.00020201171,0.00014419938,0.0005067028,0.0004956086,0.00027859263,0.005575775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993851,0.00017757644,0.00002779994,0.000089086476,0.00018655269,0.0001338994],"domain_scores_gemma":[0.9985618,0.001011565,0.00006906657,0.000050161052,0.00018184698,0.00012560628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750021,0.0011379161,0.0024502245,0.0015163406,0.0011599936,0.0016795588,0.0021048808,0.0025576586,0.01058606],"category_scores_gemma":[0.0032125956,0.00097364816,0.0009780085,0.0021315587,0.000662062,0.001973977,0.0014160749,0.0021059567,0.0010853078],"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.00042410704,0.00039775678,0.0005255836,0.0001989075,0.00006954021,0.000086746804,0.00008870448,0.7443095,0.0023152863,0.014124514,0.0077867573,0.2296727],"study_design_scores_gemma":[0.00009406194,0.00006398637,0.000079351674,0.000007854377,0.000013170628,0.000013529278,0.000013638407,0.9941169,0.00019927713,0.004738608,0.0006531519,0.000006422158],"about_ca_topic_score_codex":0.011073649,"about_ca_topic_score_gemma":0.009686693,"teacher_disagreement_score":0.011073649,"about_ca_system_score_codex":0.0014087886,"about_ca_system_score_gemma":0.003435202,"threshold_uncertainty_score":0.03541386},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009029121,0.00018011089,0.9874047,0.00012066637,0.000055292636,0.000058138146,0.0000426003,0.00012852244,0.002980835],"genre_scores_gemma":[0.41065872,0.00051253353,0.5755313,0.00035354277,0.00014386201,0.0005907558,0.00028201245,0.00043945055,0.011487867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986738,0.0005877445,0.000049970527,0.0002018319,0.00031936134,0.00016725145],"domain_scores_gemma":[0.9986168,0.0007528245,0.0001343223,0.000086512206,0.00033298932,0.00007655563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021685027,0.0016051381,0.002203523,0.0012215478,0.000569178,0.001400863,0.001996004,0.0014833749,0.00433091],"category_scores_gemma":[0.003580265,0.0013245562,0.0010908648,0.0014782696,0.0011456519,0.0011434561,0.001256786,0.0015839458,0.0008740337],"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.0001769781,0.00009479172,0.00015265722,0.00011151505,0.000064181135,0.00004881284,0.00006622175,0.956935,0.002249329,0.014453116,0.001719312,0.023928048],"study_design_scores_gemma":[0.000017123568,0.000046088837,0.000043796757,0.0000068412496,0.0000060914626,0.0000138490195,0.000008509364,0.9942591,0.00025757923,0.0049649864,0.00036910138,0.0000067422097],"about_ca_topic_score_codex":0.0046941354,"about_ca_topic_score_gemma":0.00462531,"teacher_disagreement_score":0.0046941354,"about_ca_system_score_codex":0.0011278716,"about_ca_system_score_gemma":0.0019144698,"threshold_uncertainty_score":0.014488339},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17040499,0.00029993663,0.8205124,0.00032573697,0.00015884291,0.00026843898,0.00024512655,0.0002984082,0.007486155],"genre_scores_gemma":[0.8657611,0.00019570414,0.12443979,0.000051631218,0.00013032355,0.00027701393,0.00017396695,0.00009995991,0.008870411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982185,0.0005804183,0.00009762018,0.00028033022,0.00039960843,0.0004235444],"domain_scores_gemma":[0.9952773,0.002374447,0.00061602716,0.0009039771,0.0003795067,0.00044870345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026848824,0.0008891073,0.0019123927,0.00071309065,0.0010499536,0.0017954098,0.003915043,0.00126799,0.0063159503],"category_scores_gemma":[0.007116717,0.0011155652,0.0010290287,0.0015434986,0.0010622886,0.003232042,0.002422772,0.00229464,0.00057340565],"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.0022707328,0.00066038436,0.0013062113,0.00038348412,0.00009277112,0.00014854108,0.0004240239,0.80611426,0.008945377,0.07527008,0.002176702,0.10220747],"study_design_scores_gemma":[0.00016592118,0.00045329318,0.00059597933,0.000022705386,0.000043425767,0.00004330889,0.00007421218,0.959169,0.0016600585,0.03569779,0.0020418512,0.000032490232],"about_ca_topic_score_codex":0.0025834818,"about_ca_topic_score_gemma":0.003030993,"teacher_disagreement_score":0.0063159503,"about_ca_system_score_codex":0.000835567,"about_ca_system_score_gemma":0.0023492877,"threshold_uncertainty_score":0.021128953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42181137,0.0006890206,0.5651511,0.001467519,0.00004766152,0.00007036524,0.000070353366,0.0007008767,0.009991852],"genre_scores_gemma":[0.9413536,0.00018769244,0.057166997,0.00008445475,0.000014943546,0.000030377101,0.00006191446,0.00008751372,0.0010125276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942076,0.0003230282,0.000017320746,0.00005081024,0.00011070429,0.00007743411],"domain_scores_gemma":[0.99512273,0.0040985714,0.00023173,0.00019359606,0.00023400116,0.000119370976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016584315,0.00040774062,0.0005751783,0.0006625998,0.0005140422,0.0011206255,0.00089037267,0.0011065033,0.0021194275],"category_scores_gemma":[0.013209936,0.0005474206,0.00041004308,0.00052176754,0.0011121506,0.0018518937,0.0007533176,0.001230547,0.00017432711],"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.00022169163,0.0001041668,0.0020752822,0.000063483254,0.000033956265,0.000056948476,0.00030376762,0.9181624,0.0025695767,0.056832362,0.00085119554,0.018725133],"study_design_scores_gemma":[0.000005542737,0.000009156129,0.00008970555,0.000002407342,0.0000021049018,0.0000039494994,0.0000172643,0.98748815,0.0001385921,0.012146251,0.00009523951,0.0000017415898],"about_ca_topic_score_codex":0.007933354,"about_ca_topic_score_gemma":0.0045093214,"teacher_disagreement_score":0.007933354,"about_ca_system_score_codex":0.0009830194,"about_ca_system_score_gemma":0.0013983506,"threshold_uncertainty_score":0.01577437},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0769987,0.0015243496,0.9131518,0.0007504453,0.00046698752,0.00017932909,0.00024456205,0.0007236186,0.0059601865],"genre_scores_gemma":[0.69652355,0.00088422553,0.2957364,0.00016196414,0.0002257797,0.00020067535,0.0003057504,0.00029451694,0.0056671016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974935,0.0011138582,0.00013615796,0.00036207456,0.00043662803,0.0004578079],"domain_scores_gemma":[0.9950525,0.002930792,0.00047443548,0.0005189924,0.00052382064,0.00049944344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004406516,0.0010584353,0.0028547812,0.0018943362,0.0018971034,0.0032144377,0.0024445958,0.001430784,0.0042412467],"category_scores_gemma":[0.011700623,0.0014087838,0.0006889018,0.0030090127,0.0010185514,0.0038401573,0.0020664944,0.0016149622,0.00053987163],"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.0009165653,0.00027698354,0.000668858,0.0002245082,0.00006530546,0.00013534795,0.00013986931,0.8803926,0.0022574507,0.05216678,0.0041221944,0.05863356],"study_design_scores_gemma":[0.00008937249,0.000099767276,0.00026330966,0.000013726096,0.000019603644,0.000044166416,0.00003828154,0.956604,0.0009465114,0.040605977,0.0012541913,0.000021041269],"about_ca_topic_score_codex":0.0020778596,"about_ca_topic_score_gemma":0.0026407684,"teacher_disagreement_score":0.004406516,"about_ca_system_score_codex":0.0018264141,"about_ca_system_score_gemma":0.0023548647,"threshold_uncertainty_score":0.023304164},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18534881,0.00097146066,0.80327946,0.0005070487,0.00039382296,0.00043703453,0.00062339334,0.0012825758,0.0071563493],"genre_scores_gemma":[0.7131025,0.00037459793,0.27592877,0.00010079746,0.00015514302,0.0003291276,0.0004151391,0.0003997459,0.009194199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992093,0.0002220975,0.000035056408,0.00015496227,0.00021947984,0.0001590828],"domain_scores_gemma":[0.998473,0.0009326581,0.00013960637,0.00011082229,0.00023893187,0.00010506302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015680103,0.0011072989,0.002527435,0.0011876955,0.0008152988,0.001204147,0.0017781529,0.00097152893,0.00398381],"category_scores_gemma":[0.0026782304,0.0007769735,0.00082840945,0.0025360761,0.0005172493,0.0012110814,0.0004837803,0.0008556846,0.00045775162],"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.00049524644,0.00022433889,0.00035378383,0.00019665793,0.00007355877,0.00005426879,0.0000384612,0.93191284,0.00878522,0.004574912,0.0038279938,0.049462665],"study_design_scores_gemma":[0.000032023505,0.00009355252,0.00022795126,0.000003750257,0.000016434793,0.000014580971,0.000009373295,0.9950841,0.002102303,0.0020775248,0.0003321926,0.0000062480353],"about_ca_topic_score_codex":0.0052639823,"about_ca_topic_score_gemma":0.0074452497,"teacher_disagreement_score":0.0052639823,"about_ca_system_score_codex":0.0017138704,"about_ca_system_score_gemma":0.0028321284,"threshold_uncertainty_score":0.013327122},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17940089,0.0006076675,0.8092227,0.00057139655,0.00009926135,0.00016051436,0.00020307102,0.0003499479,0.009384569],"genre_scores_gemma":[0.71559095,0.0008265952,0.2705576,0.00016315181,0.00009489572,0.00024261701,0.00037475617,0.00016416021,0.011985245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.00013563257,0.000020961823,0.00010172448,0.0001059136,0.000100594596],"domain_scores_gemma":[0.99736017,0.0019321692,0.0002209387,0.00020184765,0.00017318787,0.00011164087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000996875,0.00058761047,0.001244,0.00040712656,0.00097503077,0.0019921483,0.0020243572,0.0011517659,0.0042198077],"category_scores_gemma":[0.004538326,0.0005516941,0.0007032677,0.0010426537,0.0010865611,0.0024167728,0.0013712948,0.0013186446,0.00044863363],"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.00010097114,0.000042417196,0.00043371296,0.000056876546,0.000018487981,0.000061270715,0.00008871481,0.9459798,0.0008353971,0.027873812,0.0012106027,0.023298033],"study_design_scores_gemma":[0.000019694866,0.000020650868,0.00007135182,0.000003323822,0.0000051081593,0.000012568138,0.000028582766,0.9832645,0.00029294752,0.015714947,0.0005623594,0.000003924597],"about_ca_topic_score_codex":0.01100366,"about_ca_topic_score_gemma":0.008754499,"teacher_disagreement_score":0.01100366,"about_ca_system_score_codex":0.0014316161,"about_ca_system_score_gemma":0.0013070543,"threshold_uncertainty_score":0.021879256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05323182,0.0008310383,0.94282264,0.00021481318,0.00005729026,0.00011863121,0.000060948303,0.0004954077,0.002167364],"genre_scores_gemma":[0.24323101,0.0009650369,0.75176305,0.0001224323,0.0001045715,0.0004092344,0.00028241499,0.0002658425,0.0028564495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919516,0.0002866811,0.000038106802,0.000099885576,0.00020624835,0.00017387059],"domain_scores_gemma":[0.9977048,0.0016340858,0.00020773077,0.00010968316,0.00025291793,0.000090727575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002946751,0.0017349974,0.0013286885,0.0010659716,0.00093246007,0.0011223177,0.0011071966,0.001305841,0.0017445784],"category_scores_gemma":[0.0048853103,0.0009029386,0.0008651418,0.0011308388,0.000962554,0.0022277029,0.001259107,0.0016186767,0.00041780915],"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.00040870882,0.00023859243,0.0006137852,0.0002753596,0.00005515317,0.00008540246,0.00024182587,0.7920494,0.007824947,0.03456995,0.0028314362,0.16080548],"study_design_scores_gemma":[0.00025569557,0.00017187967,0.00017065713,0.000018517581,0.00002335735,0.000054177108,0.000030592877,0.9611897,0.0032621715,0.033411156,0.0013951788,0.000016934611],"about_ca_topic_score_codex":0.0015964996,"about_ca_topic_score_gemma":0.0017494173,"teacher_disagreement_score":0.002946751,"about_ca_system_score_codex":0.00087382086,"about_ca_system_score_gemma":0.002273295,"threshold_uncertainty_score":0.015584111},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6485451,0.019611066,0.28749648,0.0012511796,0.0012157859,0.0012001687,0.0016355453,0.0028562034,0.03618838],"genre_scores_gemma":[0.75206417,0.003612192,0.23972614,0.0003477711,0.0001247252,0.0002909463,0.0011999299,0.00029397654,0.0023401536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754804,0.0011925527,0.00016594632,0.0002296456,0.0004630116,0.00040084263],"domain_scores_gemma":[0.98982936,0.007854287,0.0005250547,0.00056020176,0.00083087693,0.00040013448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036904924,0.0011793385,0.0016228767,0.0027746772,0.0009769668,0.0015491275,0.002450953,0.0018954771,0.0028544758],"category_scores_gemma":[0.00793305,0.00057109224,0.0013855861,0.0029710636,0.0004915705,0.0016348547,0.000794278,0.0011616473,0.00030404492],"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.0033187778,0.0016900718,0.004238342,0.0013393981,0.0007178038,0.000087439475,0.00016540423,0.68727547,0.0025665811,0.008456179,0.0047763223,0.28536817],"study_design_scores_gemma":[0.0009524008,0.0027617277,0.0051743,0.0001457055,0.0005387755,0.00012553307,0.00040532308,0.9743893,0.0031424973,0.007508919,0.0047834106,0.00007203912],"about_ca_topic_score_codex":0.009345695,"about_ca_topic_score_gemma":0.013746516,"teacher_disagreement_score":0.009345695,"about_ca_system_score_codex":0.002795751,"about_ca_system_score_gemma":0.0029887895,"threshold_uncertainty_score":0.020284712},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10683363,0.0022589446,0.8842626,0.0006942744,0.00040784874,0.00021051793,0.00049737276,0.000620058,0.0042147697],"genre_scores_gemma":[0.8586813,0.000954213,0.13055669,0.00008263583,0.0004415513,0.0002044728,0.000379969,0.0003072587,0.008391859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740666,0.001023753,0.0001400588,0.00047870484,0.0005722628,0.00037859572],"domain_scores_gemma":[0.98886347,0.008272748,0.00088552246,0.00092858664,0.0006619502,0.0003877324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052494183,0.0021631154,0.0039628595,0.0014253394,0.0009252844,0.0033333804,0.0032508823,0.0019674206,0.0028458026],"category_scores_gemma":[0.013248692,0.0024045566,0.0015961112,0.0036434433,0.0011519574,0.0039346837,0.0010262277,0.0027664537,0.0005534347],"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.00050597964,0.00008612176,0.00028670294,0.00014872123,0.000057622623,0.00012318269,0.000021405289,0.9718865,0.0014416267,0.011304084,0.0009264244,0.013211693],"study_design_scores_gemma":[0.000025979902,0.000057992253,0.000167919,0.0000056104896,0.000022107792,0.000028270579,0.0000052745895,0.9908178,0.00051619206,0.008171054,0.0001693726,0.0000125104425],"about_ca_topic_score_codex":0.0032907564,"about_ca_topic_score_gemma":0.0028219472,"teacher_disagreement_score":0.0052494183,"about_ca_system_score_codex":0.0024269961,"about_ca_system_score_gemma":0.0020669096,"threshold_uncertainty_score":0.027761936},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006018692,0.014746794,0.85207546,0.03196262,0.075465776,0.000092726295,0.0006942253,0.0020279367,0.016915664],"genre_scores_gemma":[0.15049833,0.015295353,0.71497107,0.0129165705,0.033929005,0.00037665686,0.0009976755,0.0028530841,0.06816222],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955161,0.0013665005,0.00037195545,0.0007459672,0.0017136511,0.00028586233],"domain_scores_gemma":[0.9807148,0.008014889,0.00052429154,0.004639439,0.005770544,0.00033595355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005016642,0.0020406565,0.0018003064,0.0019592638,0.0018369684,0.003708357,0.004874467,0.0026264263,0.013486776],"category_scores_gemma":[0.04196945,0.0010068787,0.0024031012,0.0046515963,0.002443883,0.007168603,0.0026777468,0.013453687,0.0076968265],"study_design_candidate":"not_applicable","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.00071046903,0.00021595815,0.0013112754,0.0011861037,0.00026275648,0.00037839395,0.00022591474,0.047482852,0.002430811,0.26362064,0.30690068,0.37527406],"study_design_scores_gemma":[0.00017470251,0.00015983288,0.0011564582,0.00046383718,0.0002010387,0.00085395004,0.00013921765,0.45592314,0.005008809,0.3159066,0.21985805,0.00015440618],"about_ca_topic_score_codex":0.005718468,"about_ca_topic_score_gemma":0.0066188686,"teacher_disagreement_score":0.013486776,"about_ca_system_score_codex":0.0024968265,"about_ca_system_score_gemma":0.0027181234,"threshold_uncertainty_score":0.045117736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24513392,0.0047878153,0.7002459,0.0017291537,0.00089401985,0.0007012552,0.0011641473,0.0039615766,0.04138211],"genre_scores_gemma":[0.5193789,0.00076974364,0.4686919,0.000395862,0.00012533758,0.00039709616,0.0007661408,0.00041766683,0.009057328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947566,0.00027062252,0.000016581876,0.00005590686,0.00008528625,0.00009599714],"domain_scores_gemma":[0.9986727,0.0009370818,0.000063450796,0.00007357838,0.00017748488,0.0000756713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006964,0.00068778987,0.0013203368,0.0013145918,0.0011611123,0.0012644299,0.0016798268,0.0019070702,0.010744362],"category_scores_gemma":[0.0031781555,0.0007443722,0.000671155,0.001969849,0.00084104843,0.0011799459,0.0008296789,0.00094793015,0.00091828237],"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.0003101827,0.0001890818,0.00039653567,0.00015483929,0.000051067305,0.000075643,0.00007681676,0.8790213,0.0011095904,0.0069560115,0.007826689,0.10383226],"study_design_scores_gemma":[0.000092913804,0.000076659184,0.00014652705,0.000016906277,0.000017790517,0.000016505952,0.000029563882,0.9950664,0.0002932376,0.0026605707,0.0015719442,0.000010881806],"about_ca_topic_score_codex":0.018324178,"about_ca_topic_score_gemma":0.016948113,"teacher_disagreement_score":0.018324178,"about_ca_system_score_codex":0.0016762057,"about_ca_system_score_gemma":0.0022482686,"threshold_uncertainty_score":0.036435008},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005627695,0.0004007947,0.9896516,0.0003071148,0.00007845259,0.000071559,0.000091665985,0.0008611617,0.0029098808],"genre_scores_gemma":[0.14384116,0.00042291736,0.84916276,0.0002456838,0.00017265059,0.00043472624,0.00054242974,0.0005566178,0.004621107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850583,0.00044130313,0.00006482089,0.00026230112,0.00043440334,0.00029143688],"domain_scores_gemma":[0.99521184,0.0038732854,0.00016459344,0.00020366505,0.00036765548,0.00017901736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025325045,0.001754521,0.0027546382,0.0016846346,0.0012545706,0.0022500472,0.002448611,0.002596859,0.009658743],"category_scores_gemma":[0.0073273447,0.0012115539,0.0012268306,0.0024973585,0.0010481462,0.0025546837,0.0021501184,0.004563375,0.0019488723],"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.00040351565,0.00029740983,0.0003986518,0.00013560239,0.000084647974,0.00005608582,0.00008114279,0.77735466,0.0021533268,0.01983275,0.0073224,0.19187991],"study_design_scores_gemma":[0.000057489488,0.000028543922,0.00005439529,0.0000071282807,0.000010324436,0.000008907896,0.00000693696,0.9908771,0.00022368034,0.008146931,0.00057249004,0.000006014711],"about_ca_topic_score_codex":0.00918505,"about_ca_topic_score_gemma":0.0072630937,"teacher_disagreement_score":0.009658743,"about_ca_system_score_codex":0.001826607,"about_ca_system_score_gemma":0.0031396796,"threshold_uncertainty_score":0.032311738},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08412243,0.00085499935,0.9107548,0.00079816475,0.00012505142,0.0001495317,0.00019635506,0.00039259385,0.0026060669],"genre_scores_gemma":[0.6798624,0.00079118635,0.3116949,0.00033787946,0.00018313214,0.00039292825,0.0005595353,0.00025746095,0.0059205657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821633,0.00072670716,0.00007736484,0.00020655646,0.00034916407,0.00042391688],"domain_scores_gemma":[0.9920155,0.005950423,0.0006572181,0.00036285963,0.0005584995,0.00045542183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054230173,0.002030443,0.0029151235,0.0013465732,0.0011779694,0.002738188,0.0038128928,0.0030173082,0.0034205075],"category_scores_gemma":[0.012298869,0.0017927856,0.0012143615,0.0028560113,0.0016995401,0.0033495063,0.0022267788,0.0023738085,0.000459875],"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.0002322734,0.0000706531,0.0004548163,0.00007945302,0.000037325317,0.000026782414,0.000054072825,0.98251396,0.00031964318,0.004216818,0.0007484143,0.011245697],"study_design_scores_gemma":[0.000023906145,0.000024042985,0.000040244075,0.0000049382543,0.000007781668,0.0000067503274,0.000012513584,0.99561477,0.00008729872,0.0040989635,0.000075889715,0.0000029681153],"about_ca_topic_score_codex":0.009754174,"about_ca_topic_score_gemma":0.008622319,"teacher_disagreement_score":0.009754174,"about_ca_system_score_codex":0.00348123,"about_ca_system_score_gemma":0.0031975338,"threshold_uncertainty_score":0.028680027},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06619765,0.00060373975,0.9262908,0.00029008475,0.00015497426,0.000091159076,0.000032585085,0.0005059448,0.00583314],"genre_scores_gemma":[0.64027065,0.00021394376,0.3563092,0.0001332987,0.0000627974,0.00025486498,0.000092563154,0.00016310572,0.0024995394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991566,0.00050823,0.00002386411,0.00007133543,0.00017680491,0.00006322687],"domain_scores_gemma":[0.99857163,0.0010595727,0.00007492626,0.000098829965,0.00015615259,0.00003886982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015554716,0.0006258126,0.0014361351,0.0006750134,0.0005303465,0.0005549788,0.0014168209,0.0012911962,0.0015645422],"category_scores_gemma":[0.0047093467,0.0005725886,0.0009276497,0.0007696452,0.00070102204,0.00079304905,0.0007587456,0.0010104805,0.00020602155],"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.000047970843,0.000030655083,0.0001400913,0.000014596137,0.0000246552,0.000009302792,0.000017858983,0.98753244,0.00035001358,0.0032006956,0.0002979994,0.008333722],"study_design_scores_gemma":[0.000009949733,0.000011054926,0.000017615572,0.0000010337411,0.0000029257042,0.0000016005536,0.0000014334427,0.9990721,0.000071592585,0.0007172045,0.000092532726,9.575388e-7],"about_ca_topic_score_codex":0.007900636,"about_ca_topic_score_gemma":0.006667608,"teacher_disagreement_score":0.007900636,"about_ca_system_score_codex":0.00083642383,"about_ca_system_score_gemma":0.0013919466,"threshold_uncertainty_score":0.015709281},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05198054,0.00029828015,0.93972856,0.00044143866,0.00016881188,0.00010934733,0.00015189643,0.0006120186,0.0065090447],"genre_scores_gemma":[0.65470165,0.00022294617,0.33736828,0.0002216479,0.00015725405,0.00023058991,0.0003204885,0.0002844736,0.006492585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799687,0.00105166,0.00008768353,0.00024833964,0.00035444938,0.00026101334],"domain_scores_gemma":[0.99649435,0.0018468024,0.00026034267,0.00055509794,0.0005071142,0.0003362321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001982166,0.0012690882,0.0017912579,0.00065147365,0.0007427354,0.0014120364,0.0024427779,0.0011134567,0.0042695217],"category_scores_gemma":[0.0069882497,0.0005229775,0.0005394146,0.001292714,0.0009870924,0.0021421053,0.0022785466,0.0017347124,0.0004978409],"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.0019457636,0.00040892736,0.00064379827,0.0002982825,0.000062701,0.00027092837,0.00012789028,0.8414466,0.007767653,0.053922888,0.006205064,0.086899616],"study_design_scores_gemma":[0.000021416128,0.00007827578,0.00008585901,0.0000041432804,0.0000037658322,0.000016284703,0.000008295983,0.98813707,0.0007623157,0.010545335,0.0003328123,0.000004414931],"about_ca_topic_score_codex":0.0019936962,"about_ca_topic_score_gemma":0.0021368493,"teacher_disagreement_score":0.0042695217,"about_ca_system_score_codex":0.0011145321,"about_ca_system_score_gemma":0.0011744407,"threshold_uncertainty_score":0.014282942},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021759693,0.0009123849,0.94093484,0.0014697921,0.0005683488,0.00027540562,0.0003746842,0.00030085136,0.033404116],"genre_scores_gemma":[0.21876408,0.0038714476,0.73914844,0.0010602709,0.0017119022,0.0006272774,0.0019318281,0.00064025965,0.032244563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884486,0.00036828115,0.00004802831,0.00018187112,0.00037896738,0.00017802324],"domain_scores_gemma":[0.9975314,0.0016598374,0.00013283372,0.0002644633,0.0002590715,0.00015235039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014554476,0.0014250578,0.0014265983,0.00144989,0.0012274857,0.002244938,0.0024962125,0.0014556624,0.0076134643],"category_scores_gemma":[0.00648508,0.00063728873,0.0032081874,0.0025732059,0.0013290808,0.0029283254,0.0021736242,0.004784736,0.0009045015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00016180341,0.00064660964,0.00057761685,0.0005097825,0.000113029404,0.0002332081,0.00040365593,0.3555772,0.0029410669,0.4538736,0.037694775,0.14726765],"study_design_scores_gemma":[0.00005630541,0.000095507654,0.00031999705,0.000058627702,0.000065938715,0.00015513113,0.00012299487,0.50669444,0.0010304296,0.4774263,0.0139456745,0.00002867028],"about_ca_topic_score_codex":0.006298444,"about_ca_topic_score_gemma":0.005092993,"teacher_disagreement_score":0.0076134643,"about_ca_system_score_codex":0.0013633136,"about_ca_system_score_gemma":0.0020734407,"threshold_uncertainty_score":0.025469542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9220141,0.00028470045,0.06817097,0.0007139528,0.00008433051,0.00038886745,0.00016666976,0.00016247196,0.008013981],"genre_scores_gemma":[0.9726002,0.00014101494,0.022781998,0.00005889988,0.000044161538,0.00009105087,0.0001365362,0.000028658898,0.0041173133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897814,0.0004079409,0.00006180498,0.00013975268,0.0001295978,0.00028278132],"domain_scores_gemma":[0.9974082,0.0015939408,0.00022227701,0.00008724839,0.00015919226,0.00052914105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019330215,0.0005615427,0.0006021168,0.00086384814,0.0023795494,0.0021005394,0.0010553926,0.0020943377,0.005356953],"category_scores_gemma":[0.0035178664,0.0007844084,0.0006136786,0.0012544265,0.0006608007,0.0009527653,0.0006901083,0.0009176794,0.00041259688],"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.002055854,0.0010823185,0.009964683,0.00012631195,0.00010561592,0.0011996678,0.00052960025,0.91380674,0.010575518,0.008878826,0.0026110183,0.049063865],"study_design_scores_gemma":[0.0001888511,0.00058401865,0.0046016863,0.000014854078,0.00006572835,0.00014157264,0.0007527896,0.9828904,0.0029758872,0.0052887504,0.002461809,0.000033632157],"about_ca_topic_score_codex":0.024647733,"about_ca_topic_score_gemma":0.016440256,"teacher_disagreement_score":0.024647733,"about_ca_system_score_codex":0.0023547087,"about_ca_system_score_gemma":0.00364647,"threshold_uncertainty_score":0.04900855},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716791,0.0007650712,0.21830839,0.00079133303,0.00025569453,0.00024322663,0.00021112036,0.0004747697,0.0072712605],"genre_scores_gemma":[0.9632283,0.0001757289,0.03358136,0.00006130375,0.000073542746,0.000047335732,0.00009474557,0.000103804705,0.0026338806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992513,0.00021224833,0.00003961214,0.00011004664,0.00017795476,0.00020869862],"domain_scores_gemma":[0.9972397,0.0017007133,0.00030923294,0.00017172549,0.00018299166,0.0003957342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016612429,0.0008588777,0.0012916175,0.0007638558,0.0012017516,0.001601209,0.001097366,0.0009234678,0.002544028],"category_scores_gemma":[0.0063773366,0.00069271465,0.00042722237,0.0011160877,0.0006512282,0.0022530218,0.0013683517,0.0010250127,0.00013869497],"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.0022587625,0.0002668034,0.0031753294,0.000265498,0.00006851751,0.00035772484,0.00033930683,0.87568253,0.015023218,0.0101910075,0.002082861,0.09028838],"study_design_scores_gemma":[0.000040299878,0.00027760625,0.0007992674,0.000013779902,0.000018389583,0.00005990885,0.00017021922,0.98559326,0.0029127952,0.00949055,0.0006116405,0.000012258647],"about_ca_topic_score_codex":0.0027804677,"about_ca_topic_score_gemma":0.0036904993,"teacher_disagreement_score":0.0027804677,"about_ca_system_score_codex":0.0015115105,"about_ca_system_score_gemma":0.0009849656,"threshold_uncertainty_score":0.010966837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029535193,0.0001344108,0.966599,0.00012829715,0.000050701223,0.0001522737,0.000049687154,0.00033571714,0.0030147864],"genre_scores_gemma":[0.5074536,0.00011538496,0.48730344,0.00019047475,0.00005549113,0.0005509478,0.00019408893,0.0001602177,0.0039763404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935955,0.00017512527,0.00003569829,0.00013974606,0.00017219067,0.00011772972],"domain_scores_gemma":[0.99863905,0.00082660804,0.00010549137,0.000085695036,0.00021445518,0.0001287989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018600596,0.0010866642,0.001696668,0.00082849036,0.0008362377,0.0014135957,0.0032810643,0.0024128729,0.0050823777],"category_scores_gemma":[0.0031256508,0.0013472403,0.0010342584,0.00093699625,0.00084252394,0.0015334921,0.0025505594,0.0014849579,0.0005113746],"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.00024080406,0.00012079703,0.00037190938,0.00007509183,0.000049891405,0.000057742014,0.00006544481,0.9592256,0.0015550022,0.0037779312,0.00071538385,0.033744417],"study_design_scores_gemma":[0.000029583882,0.000032776334,0.000038224887,0.0000025439854,0.0000072950825,0.000005347779,0.000003746923,0.99908686,0.00012394068,0.00055385893,0.00011230901,0.00000354736],"about_ca_topic_score_codex":0.008760974,"about_ca_topic_score_gemma":0.008772808,"teacher_disagreement_score":0.008760974,"about_ca_system_score_codex":0.0010856268,"about_ca_system_score_gemma":0.0023721345,"threshold_uncertainty_score":0.017419994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5845093,0.00067867845,0.40562135,0.00048690056,0.00043536755,0.00020975292,0.00024380042,0.0013736296,0.00644113],"genre_scores_gemma":[0.9214326,0.00016850956,0.074235305,0.00006766076,0.000076305114,0.00006822878,0.000096647105,0.00005558578,0.003799119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904865,0.00030793028,0.00009705594,0.00016042034,0.00016455931,0.00022128152],"domain_scores_gemma":[0.9961701,0.0018798722,0.00046719343,0.0007956537,0.0004079866,0.00027911083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001760396,0.0003698984,0.0010649073,0.00081931666,0.0011018619,0.0015412618,0.0017385209,0.00069072546,0.0038121608],"category_scores_gemma":[0.0037547788,0.0005032178,0.00041210395,0.00092051964,0.000631706,0.0020802836,0.0012622325,0.00045557966,0.0003731487],"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.010294516,0.0007202416,0.0030352492,0.0005009059,0.00032383914,0.000584815,0.00052616035,0.6377121,0.09332301,0.072570205,0.0076346123,0.1727743],"study_design_scores_gemma":[0.00026929853,0.00068733504,0.0003435767,0.0000108281565,0.00006839652,0.000084310195,0.000071037,0.9657312,0.013175108,0.01702067,0.0025063723,0.000031882042],"about_ca_topic_score_codex":0.0011135621,"about_ca_topic_score_gemma":0.0022283802,"teacher_disagreement_score":0.0038121608,"about_ca_system_score_codex":0.00093077443,"about_ca_system_score_gemma":0.00076310395,"threshold_uncertainty_score":0.01275295},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20301338,0.0016944746,0.78595847,0.0009085686,0.00048647897,0.0003130603,0.0001402796,0.0004394238,0.0070458427],"genre_scores_gemma":[0.9503166,0.00029543112,0.046249647,0.0000684484,0.00008065631,0.000060313683,0.000038501123,0.00009342671,0.002797015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797887,0.00087682117,0.00012271624,0.0003153973,0.00033027044,0.00037584562],"domain_scores_gemma":[0.9962656,0.0020758302,0.00045896045,0.00013741816,0.0007669848,0.00029526927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040614703,0.0011329498,0.0025441959,0.001310979,0.0013299413,0.0028907561,0.0019480907,0.0015361762,0.0036543459],"category_scores_gemma":[0.008354744,0.001345861,0.000682987,0.0021357914,0.0010785429,0.0022664918,0.0010839269,0.0010333242,0.0002914676],"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.00047641582,0.00011400141,0.0005958905,0.00018923984,0.000057780097,0.00007522073,0.00013466254,0.95711875,0.0031478193,0.007143673,0.00077623926,0.0301703],"study_design_scores_gemma":[0.000032396696,0.00013669101,0.0002548088,0.000019013893,0.000036391768,0.000015364414,0.00006163921,0.99154985,0.0011137043,0.0064138887,0.00035010028,0.00001605292],"about_ca_topic_score_codex":0.0061719976,"about_ca_topic_score_gemma":0.0057410398,"teacher_disagreement_score":0.0061719976,"about_ca_system_score_codex":0.0030127987,"about_ca_system_score_gemma":0.0033518379,"threshold_uncertainty_score":0.021859407},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15438302,0.0020644942,0.8260021,0.00082505884,0.0004351357,0.0005438076,0.00056233414,0.0023163601,0.012867715],"genre_scores_gemma":[0.42568678,0.0004359698,0.5687166,0.00027282722,0.00009566921,0.00051448925,0.0005355888,0.00033905634,0.0034029412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937505,0.00028941568,0.00002658302,0.00008508984,0.0001161495,0.00010773406],"domain_scores_gemma":[0.99729055,0.0019764935,0.00016844826,0.0001374958,0.00028877813,0.00013822177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017422994,0.0008722507,0.0017859252,0.001705635,0.0011588146,0.0013007207,0.0023045528,0.0021863116,0.0067326254],"category_scores_gemma":[0.004368448,0.001217295,0.001032024,0.002557745,0.00090109423,0.0014167554,0.0009532143,0.001265528,0.0007288373],"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.00022892006,0.00013901864,0.00024377131,0.00009284132,0.00004465123,0.000060944338,0.00003730793,0.9484671,0.0008897213,0.0030718828,0.0023515483,0.044372365],"study_design_scores_gemma":[0.00005879231,0.000063249754,0.00007759483,0.000008172696,0.000014388727,0.000011839355,0.0000126506375,0.99773717,0.00022122446,0.0014154253,0.00037266978,0.000006773155],"about_ca_topic_score_codex":0.008755484,"about_ca_topic_score_gemma":0.009214545,"teacher_disagreement_score":0.008755484,"about_ca_system_score_codex":0.0016304004,"about_ca_system_score_gemma":0.0025917904,"threshold_uncertainty_score":0.022522807},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25866145,0.0030959886,0.6771671,0.0056531364,0.0006609999,0.00017192645,0.00040009266,0.00015650054,0.054032825],"genre_scores_gemma":[0.83843935,0.003317613,0.14293934,0.0008238314,0.0011884171,0.0001555349,0.00051190896,0.00013285018,0.012491105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917173,0.00037212658,0.000047652877,0.00016594082,0.000153091,0.00008953671],"domain_scores_gemma":[0.98873866,0.009329434,0.000787845,0.0003114729,0.00048516295,0.00034751854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021153179,0.000507562,0.00083316397,0.0013867941,0.0013262812,0.0015016027,0.0020722146,0.0021433707,0.006567198],"category_scores_gemma":[0.014503539,0.0005342932,0.00095331867,0.0023420835,0.0023412725,0.005273574,0.0018078983,0.0025787519,0.00034549256],"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.00033234153,0.0001525105,0.001446653,0.0002868739,0.000046975307,0.0009770278,0.00052718614,0.10582476,0.0012302955,0.8582834,0.004945562,0.025946436],"study_design_scores_gemma":[0.000046682442,0.00009000713,0.0007354991,0.00004385803,0.000025534435,0.00022086024,0.0001021392,0.38013887,0.0001838916,0.614469,0.003911947,0.000031662803],"about_ca_topic_score_codex":0.0024015573,"about_ca_topic_score_gemma":0.0021605808,"teacher_disagreement_score":0.006567198,"about_ca_system_score_codex":0.0007893498,"about_ca_system_score_gemma":0.0008883292,"threshold_uncertainty_score":0.021969497},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38092595,0.001118383,0.6085971,0.00043306118,0.00025690984,0.00018080986,0.0002183037,0.0004977224,0.0077717425],"genre_scores_gemma":[0.9435706,0.00020231678,0.05426776,0.000038361446,0.00006226986,0.00006732226,0.00009651215,0.00008467941,0.0016100667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992792,0.00025029347,0.000037080215,0.00012087956,0.00013696037,0.00017558226],"domain_scores_gemma":[0.9989736,0.0004631745,0.0001591386,0.000084304455,0.0002070373,0.00011278559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012228884,0.0008623834,0.001535157,0.00059647975,0.00080206565,0.0009005715,0.0013367814,0.00045238354,0.0013066243],"category_scores_gemma":[0.0017743736,0.0005387864,0.000544433,0.0010126734,0.0004978561,0.0010094584,0.0005965929,0.0004957382,0.000113550326],"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.0010441977,0.00013947353,0.00059366063,0.0002383067,0.000082881335,0.00011921592,0.000068130634,0.9463967,0.009341486,0.006014647,0.0012949284,0.034666426],"study_design_scores_gemma":[0.000020701946,0.00015688683,0.00038770458,0.0000037300033,0.000018104663,0.000024351479,0.000015425248,0.994231,0.0015796291,0.0033085889,0.00024703288,0.000006834672],"about_ca_topic_score_codex":0.0025276104,"about_ca_topic_score_gemma":0.0028470436,"teacher_disagreement_score":0.0025276104,"about_ca_system_score_codex":0.0008996877,"about_ca_system_score_gemma":0.0013311995,"threshold_uncertainty_score":0.006527722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5474493,0.00031087568,0.42736816,0.0006065194,0.00050994527,0.0020850787,0.00038184976,0.00057764485,0.020710694],"genre_scores_gemma":[0.86461323,0.00013766353,0.12733418,0.00005921473,0.00006736137,0.00038723633,0.00014884763,0.00006860832,0.0071835523],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982886,0.00057768123,0.000100557794,0.00032448195,0.00029405422,0.0004146026],"domain_scores_gemma":[0.9978017,0.00068748934,0.00020838037,0.0003559344,0.00039192158,0.0005544989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020272234,0.00086754444,0.0010967818,0.0012156144,0.001632831,0.0018867896,0.0018962249,0.0010866999,0.011764043],"category_scores_gemma":[0.0048513752,0.00069338107,0.0011113129,0.0015799867,0.000529946,0.0014626886,0.0015024171,0.0015639731,0.001188056],"study_design_candidate":"theoretical_or_conceptual","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.002719412,0.0025534884,0.010741392,0.0005567885,0.00018940757,0.00033925936,0.0006855104,0.4104505,0.025318967,0.015727244,0.003473559,0.52724457],"study_design_scores_gemma":[0.00038450357,0.002678491,0.013567028,0.00010445299,0.00021559173,0.00026222068,0.0019013063,0.88340753,0.019098677,0.06506466,0.013201175,0.000114399714],"about_ca_topic_score_codex":0.0031175977,"about_ca_topic_score_gemma":0.00470575,"teacher_disagreement_score":0.011764043,"about_ca_system_score_codex":0.0012757697,"about_ca_system_score_gemma":0.0027287197,"threshold_uncertainty_score":0.039354682},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03224292,0.00036009648,0.9506649,0.0011040283,0.00014101405,0.00030206674,0.0015767274,0.00012439417,0.0134839425],"genre_scores_gemma":[0.41534406,0.0008331052,0.5614386,0.0004097245,0.00029904372,0.0010133857,0.004338804,0.00021550934,0.016107716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976872,0.00066491065,0.00011407153,0.0004298713,0.000667233,0.00043676657],"domain_scores_gemma":[0.99487644,0.0035357273,0.00042756094,0.00027733378,0.0006684378,0.0002145914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023955784,0.0011153967,0.0011923335,0.0012985219,0.00062505173,0.002304329,0.0027483995,0.0016909151,0.009174614],"category_scores_gemma":[0.009832488,0.00085289497,0.0021669865,0.002093159,0.00097251055,0.0026735656,0.001529918,0.0036046323,0.00057787466],"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.00022914296,0.0005509702,0.001945109,0.00044186536,0.000112839705,0.0002165926,0.00022864439,0.7314302,0.0029604589,0.17766668,0.009524061,0.074693486],"study_design_scores_gemma":[0.000035676967,0.00009255235,0.00055490166,0.000046360827,0.000025679567,0.000041237792,0.00006943647,0.9155098,0.00074223673,0.0805263,0.0023363144,0.000019427594],"about_ca_topic_score_codex":0.020209434,"about_ca_topic_score_gemma":0.019159433,"teacher_disagreement_score":0.020209434,"about_ca_system_score_codex":0.0023337754,"about_ca_system_score_gemma":0.004223909,"threshold_uncertainty_score":0.040183604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3416632,0.0007615038,0.6493604,0.0007302636,0.0003211443,0.00030587273,0.00030946528,0.00069552375,0.00585257],"genre_scores_gemma":[0.93124175,0.00017161116,0.064377315,0.00007703436,0.00006659892,0.00009170226,0.00018839011,0.00012936186,0.0036561687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991203,0.00029955187,0.000038122045,0.00014231405,0.00018513166,0.00021461012],"domain_scores_gemma":[0.99866617,0.0006011015,0.00020485414,0.00011660788,0.00024208675,0.00016921118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019393852,0.0009256212,0.00154262,0.00066709577,0.00066577527,0.00094380043,0.0014640864,0.0009058431,0.0019568503],"category_scores_gemma":[0.003317349,0.0004891952,0.0005489272,0.0011145412,0.00049841945,0.00088073255,0.0006231195,0.0010293508,0.00024689766],"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.0003367489,0.0001129467,0.0005108476,0.00009107394,0.000043232467,0.000108885084,0.000045777826,0.9690558,0.003801014,0.003703099,0.0016032386,0.020587279],"study_design_scores_gemma":[0.000010786478,0.00005286363,0.00019883476,0.0000021448536,0.0000075031217,0.00001785752,0.000011378957,0.99752504,0.0005292956,0.0014640903,0.00017730273,0.0000028118786],"about_ca_topic_score_codex":0.0049174563,"about_ca_topic_score_gemma":0.004494156,"teacher_disagreement_score":0.0049174563,"about_ca_system_score_codex":0.0011949291,"about_ca_system_score_gemma":0.0026152257,"threshold_uncertainty_score":0.010256588},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2740948,0.0008433401,0.7057787,0.0014600048,0.00033673638,0.0002881641,0.00040824487,0.00023775091,0.016552273],"genre_scores_gemma":[0.7692266,0.00056353456,0.21803795,0.00018275339,0.00020579522,0.00024216849,0.00041740376,0.00012744527,0.010996322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997303,0.00012035528,0.000012026642,0.00006465352,0.000033273984,0.00003940895],"domain_scores_gemma":[0.99894327,0.00083841005,0.00007533014,0.000032676002,0.00006225328,0.000048020767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009262891,0.000852925,0.0011228786,0.00054952945,0.00055027846,0.00091944373,0.0010873812,0.0021565508,0.004278527],"category_scores_gemma":[0.0025258174,0.0007051431,0.00091965706,0.00080020336,0.00044165293,0.00085606374,0.00060426083,0.0010206661,0.00023306227],"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.000057807578,0.00007134765,0.0003455432,0.00007724083,0.000035321533,0.00007570533,0.000025974097,0.9819449,0.000541872,0.0037979914,0.0009762769,0.0120499395],"study_design_scores_gemma":[0.000027886268,0.00003500665,0.000086093234,0.0000041552657,0.000011192992,0.000012571868,0.000014115048,0.99657947,0.00013484129,0.0027650422,0.00032712246,0.000002484296],"about_ca_topic_score_codex":0.0070592985,"about_ca_topic_score_gemma":0.0048857257,"teacher_disagreement_score":0.0070592985,"about_ca_system_score_codex":0.00063787936,"about_ca_system_score_gemma":0.0012838617,"threshold_uncertainty_score":0.014313161},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6608298,0.00117655,0.3271576,0.00047276146,0.000609106,0.00013260826,0.00011768076,0.00055964873,0.00894424],"genre_scores_gemma":[0.9659452,0.00008916729,0.0323871,0.000057473957,0.00005902552,0.000042989475,0.000055178836,0.000047242534,0.0013166268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.0001483398,0.000028574226,0.0000898268,0.00010039288,0.00018596202],"domain_scores_gemma":[0.99821424,0.00096895336,0.0001225827,0.00022642146,0.0002129513,0.00025478745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312212,0.00056039554,0.00095246534,0.0003709092,0.00068529864,0.0011710692,0.0016141675,0.0005622467,0.003160859],"category_scores_gemma":[0.0029545536,0.0004663586,0.00040140568,0.00079352263,0.0007067174,0.0010839831,0.0013418748,0.00089940144,0.00020054319],"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.0018628939,0.0003089149,0.0020887074,0.00022670031,0.00013822368,0.00045156258,0.00012806713,0.90667826,0.012107652,0.01481756,0.0037686871,0.057422835],"study_design_scores_gemma":[0.00006553417,0.00010364291,0.00024066096,0.000004417164,0.000012096433,0.000020539534,0.00003196763,0.9938123,0.0008659434,0.0044863755,0.00035133975,0.0000052229984],"about_ca_topic_score_codex":0.002765383,"about_ca_topic_score_gemma":0.006348206,"teacher_disagreement_score":0.003160859,"about_ca_system_score_codex":0.0007258765,"about_ca_system_score_gemma":0.0013451473,"threshold_uncertainty_score":0.010574162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08427302,0.0010314262,0.8936976,0.0005675353,0.00031171873,0.0002007451,0.0003562993,0.0005107156,0.019050905],"genre_scores_gemma":[0.7901429,0.00080849207,0.19559966,0.00019527426,0.00020540724,0.00020302582,0.00053848454,0.00021370444,0.012093116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998201,0.00042859532,0.00007894565,0.00039212313,0.00046863075,0.00043077942],"domain_scores_gemma":[0.99824995,0.0006380554,0.0002220839,0.00040961974,0.00024349891,0.00023680602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012988516,0.0010671675,0.0014636033,0.0005627957,0.0010227424,0.0018643518,0.0032754831,0.00088095956,0.0070844637],"category_scores_gemma":[0.0034979375,0.0004925543,0.0007948372,0.0019254056,0.0010326486,0.0036752233,0.0024865875,0.0011785524,0.0008549939],"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.00040701008,0.0003142502,0.0014581374,0.00043143588,0.00023712967,0.0005424433,0.00017740353,0.7348403,0.005337202,0.13608624,0.00973642,0.11043203],"study_design_scores_gemma":[0.000079089405,0.00023735569,0.0003008817,0.000023869668,0.00005926405,0.00027516155,0.000116749194,0.85630065,0.0029658698,0.12714203,0.012477452,0.000021574879],"about_ca_topic_score_codex":0.0018424935,"about_ca_topic_score_gemma":0.0025462252,"teacher_disagreement_score":0.0070844637,"about_ca_system_score_codex":0.0011968076,"about_ca_system_score_gemma":0.0017908802,"threshold_uncertainty_score":0.02369988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03946988,0.00022719287,0.9515007,0.0005681915,0.00006099461,0.000063650856,0.00027837369,0.00009993584,0.007731216],"genre_scores_gemma":[0.787247,0.0007684883,0.18652758,0.00013046844,0.00013213711,0.00042774263,0.00061601785,0.00010027107,0.024050307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930847,0.00024266001,0.000034595756,0.00010902791,0.00018414005,0.00012107035],"domain_scores_gemma":[0.99872464,0.0007616929,0.00015734888,0.000101122874,0.00017276137,0.0000823571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001192384,0.0006568171,0.0010485931,0.0005851399,0.0004530082,0.0015939645,0.0027083522,0.0015901643,0.0046719825],"category_scores_gemma":[0.0041299732,0.00071334786,0.00095459976,0.0010782178,0.0008281261,0.0024600716,0.0013793705,0.0021492273,0.0005462458],"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.00008620728,0.0000755273,0.00032944893,0.00008807422,0.00001887853,0.00007226191,0.0001106517,0.809553,0.0009105012,0.17851363,0.00070233527,0.009539524],"study_design_scores_gemma":[0.000014961882,0.000016560645,0.00004450868,0.000006274799,0.000007832817,0.0000086038,0.000008687105,0.96985334,0.00009176642,0.029003108,0.00094012014,0.00000426244],"about_ca_topic_score_codex":0.0051289066,"about_ca_topic_score_gemma":0.0068400125,"teacher_disagreement_score":0.0051289066,"about_ca_system_score_codex":0.0011564691,"about_ca_system_score_gemma":0.0018098921,"threshold_uncertainty_score":0.015629351},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19506939,0.00022762506,0.798069,0.0001307794,0.00015053808,0.00016762839,0.00014039845,0.0006588239,0.005385763],"genre_scores_gemma":[0.8793609,0.00005153684,0.117431626,0.000037423863,0.000040298557,0.00014429321,0.00010404416,0.000048509126,0.0027813604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935263,0.00020587737,0.00003118405,0.00011405999,0.00012730015,0.00016891187],"domain_scores_gemma":[0.99899167,0.0005494951,0.00007247047,0.00013989712,0.00014331989,0.00010319677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096547254,0.00068544527,0.0010797076,0.000533612,0.0007987375,0.0009949066,0.0018468738,0.0008195337,0.003140469],"category_scores_gemma":[0.0012581025,0.0007482804,0.0007732891,0.00079278497,0.00038994534,0.0011827834,0.0011543313,0.00072759535,0.0002870669],"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.0014453621,0.00028333694,0.0011372812,0.00023449436,0.00012673726,0.00036853095,0.00013143735,0.8804542,0.02851984,0.0097928615,0.0015528213,0.07595314],"study_design_scores_gemma":[0.000037121685,0.00017887806,0.00021324703,0.0000030013857,0.000014720346,0.000030171745,0.000011637713,0.99477804,0.0022044417,0.0021907687,0.00032705785,0.00001085871],"about_ca_topic_score_codex":0.0017904831,"about_ca_topic_score_gemma":0.0029991872,"teacher_disagreement_score":0.003140469,"about_ca_system_score_codex":0.0004513173,"about_ca_system_score_gemma":0.00083800335,"threshold_uncertainty_score":0.010505974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052297586,0.0006058855,0.98893446,0.00023791225,0.00017292827,0.000051209034,0.00004290287,0.0007787607,0.0039461553],"genre_scores_gemma":[0.18342036,0.0006182925,0.805072,0.000188892,0.00022130684,0.0002933015,0.00027282696,0.00044613518,0.009466947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818075,0.00065431045,0.00012737892,0.0002433713,0.0005457081,0.00024855955],"domain_scores_gemma":[0.991621,0.006013673,0.0003429109,0.0011042587,0.0005968138,0.00032133414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003564575,0.0014487788,0.0016539696,0.0010428836,0.0014251351,0.0021502208,0.0037125223,0.0014393883,0.007616589],"category_scores_gemma":[0.016834667,0.00100082,0.0011211396,0.0014974038,0.0021024833,0.0032003606,0.0022458674,0.005898957,0.0010016217],"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.0010162449,0.00039254702,0.0007449529,0.00045848708,0.000095810916,0.00009952987,0.0004302178,0.46461138,0.0021604549,0.29238376,0.010862279,0.22674432],"study_design_scores_gemma":[0.00016678142,0.000054644934,0.00007604242,0.000027419117,0.000022427992,0.00002463677,0.000028953093,0.84628814,0.00058076304,0.14916888,0.0035490908,0.000012275985],"about_ca_topic_score_codex":0.005503117,"about_ca_topic_score_gemma":0.0072928118,"teacher_disagreement_score":0.007616589,"about_ca_system_score_codex":0.0016962417,"about_ca_system_score_gemma":0.0021221924,"threshold_uncertainty_score":0.025479972},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18341735,0.0008715556,0.8109252,0.00041724037,0.00034302313,0.00016342377,0.0002334846,0.00078153383,0.0028473125],"genre_scores_gemma":[0.94008905,0.00015729899,0.056962833,0.00005348675,0.00008787564,0.000064619926,0.00016070798,0.000082278,0.0023418802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894756,0.00033968774,0.000058580546,0.00023797841,0.00022568999,0.00019054166],"domain_scores_gemma":[0.9956103,0.0023310513,0.00045036804,0.00063318305,0.0006592475,0.00031576937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003612768,0.0009353863,0.002234254,0.00068127015,0.0009732136,0.0009554019,0.0022129305,0.0009859717,0.0016131504],"category_scores_gemma":[0.009013185,0.00071197056,0.00084331265,0.0011625787,0.00083446945,0.0014217361,0.0010763756,0.0016030152,0.0003584734],"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.00044444422,0.00009441894,0.0014884155,0.00013061489,0.000051714767,0.00015671965,0.000050701557,0.96727484,0.0031858254,0.0048797685,0.0010898686,0.02115269],"study_design_scores_gemma":[0.000012698855,0.000046908604,0.0003049458,0.000002289436,0.0000064837513,0.000027600405,0.000003909611,0.9965162,0.00047766487,0.0024714903,0.00012588927,0.0000038608473],"about_ca_topic_score_codex":0.0018945995,"about_ca_topic_score_gemma":0.0020336243,"teacher_disagreement_score":0.003612768,"about_ca_system_score_codex":0.0010673801,"about_ca_system_score_gemma":0.0015920405,"threshold_uncertainty_score":0.019106388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9496498,0.0002978374,0.046441976,0.00020539662,0.000030474908,0.000112430906,0.00015507225,0.00022056529,0.0028864173],"genre_scores_gemma":[0.99364555,0.00004175756,0.0059366333,0.000009168231,0.0000040839427,0.000015152344,0.000045089026,0.000009394299,0.00029333064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992091,0.0004187677,0.000028782046,0.00009843763,0.00011800851,0.00012689791],"domain_scores_gemma":[0.9964431,0.0028145474,0.00020741406,0.000091898226,0.00026180968,0.0001812562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029697092,0.00089591986,0.0013209519,0.0006402178,0.00067168515,0.0010423076,0.0009298096,0.0012396117,0.0012460094],"category_scores_gemma":[0.0044477843,0.0005778309,0.00056063465,0.00058916083,0.0006501919,0.00076942967,0.0005914915,0.000777493,0.00006946703],"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.00009214,0.000057403733,0.00028804256,0.000017068487,0.000011130025,0.000028456068,0.000006039246,0.9972255,0.0002677697,0.00027017656,0.000050843602,0.0016853868],"study_design_scores_gemma":[0.0000058517858,0.00003893469,0.00014524591,7.039728e-7,0.0000034401369,0.0000017429808,0.000006193764,0.99960595,0.000084436295,0.00009694343,0.000008698165,0.000001871719],"about_ca_topic_score_codex":0.038695175,"about_ca_topic_score_gemma":0.02131028,"teacher_disagreement_score":0.038695175,"about_ca_system_score_codex":0.0019977174,"about_ca_system_score_gemma":0.0024146652,"threshold_uncertainty_score":0.07693994},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8745717,0.00080969,0.118445724,0.0003604738,0.00010528882,0.00034863825,0.0006448757,0.0005525348,0.0041611395],"genre_scores_gemma":[0.9189747,0.00015616503,0.07859866,0.000057369693,0.000026846921,0.0002498484,0.00081978965,0.00007154612,0.0010449602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953288,0.0030153117,0.00022274125,0.0004474558,0.00048543775,0.00050034834],"domain_scores_gemma":[0.88575476,0.10072399,0.0024273426,0.0059104506,0.0037306477,0.0014528909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012839254,0.0013641034,0.002135154,0.0011733812,0.0012017459,0.0014276509,0.0039395345,0.0029080787,0.0039991937],"category_scores_gemma":[0.033407964,0.0015284525,0.0017404095,0.0019378704,0.0017137489,0.0049695023,0.0014263468,0.0031486393,0.00037641122],"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.0028503637,0.0018204693,0.0031811148,0.00024675395,0.00008516746,0.000033473556,0.000089891735,0.9738488,0.0007173499,0.003807928,0.0008547508,0.012463931],"study_design_scores_gemma":[0.00016557502,0.00023380794,0.00044908145,0.00000649051,0.000021276144,0.0000077498535,0.000028206854,0.9974903,0.00034160176,0.0011811528,0.0000641899,0.000010499571],"about_ca_topic_score_codex":0.013713334,"about_ca_topic_score_gemma":0.009089305,"teacher_disagreement_score":0.013713334,"about_ca_system_score_codex":0.0031360819,"about_ca_system_score_gemma":0.0032313725,"threshold_uncertainty_score":0.06790131},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23717749,0.0012319352,0.7511,0.00047997895,0.00009291249,0.00022923565,0.00035658362,0.0005103739,0.008821528],"genre_scores_gemma":[0.63737243,0.0006020411,0.3567898,0.00011684274,0.00005500627,0.00045539023,0.00038632477,0.0001702901,0.004051818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994923,0.00030340426,0.000013865084,0.000061946994,0.00006471312,0.00006386216],"domain_scores_gemma":[0.99907637,0.000693417,0.00008544247,0.000035435274,0.00007403758,0.000035341483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012586765,0.0008757097,0.0011352163,0.0009310317,0.00071311306,0.0011531855,0.0011711987,0.0013829765,0.0027928983],"category_scores_gemma":[0.00273827,0.0004936363,0.00065580197,0.0016476003,0.0006144667,0.00074691925,0.00056650577,0.00086432486,0.0003233187],"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.00006079927,0.00005560223,0.00019635663,0.000061783234,0.000020259362,0.00003826978,0.000025371413,0.9847489,0.0004052027,0.0041581886,0.00037375544,0.0098555675],"study_design_scores_gemma":[0.000015557032,0.00003396488,0.00006554435,0.0000048105094,0.000006803867,0.000012182242,0.000018101078,0.9973966,0.00019222128,0.0019133234,0.00033771986,0.0000031427703],"about_ca_topic_score_codex":0.007396626,"about_ca_topic_score_gemma":0.0067688697,"teacher_disagreement_score":0.007396626,"about_ca_system_score_codex":0.0011185687,"about_ca_system_score_gemma":0.0019110735,"threshold_uncertainty_score":0.014707148},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25196588,0.00042862812,0.7331548,0.000531626,0.00020611423,0.0007332445,0.00028782946,0.0018761716,0.010815811],"genre_scores_gemma":[0.61785907,0.0001627604,0.3747473,0.00012598421,0.000062288185,0.0004112769,0.00028979505,0.00026243247,0.0060790414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994288,0.00021853647,0.000020236672,0.000081509854,0.000094424235,0.0001563291],"domain_scores_gemma":[0.999092,0.00049838907,0.000082005645,0.00011456293,0.00007974286,0.00013323783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014503538,0.0005881024,0.002152195,0.0014878991,0.0016156413,0.000995039,0.0028040293,0.001532444,0.006728242],"category_scores_gemma":[0.0023312233,0.00079452747,0.0011403934,0.0012711666,0.00077469193,0.0012653375,0.0016172249,0.0010069439,0.000481492],"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.0006871155,0.0004815129,0.0006893408,0.000095990086,0.000056148907,0.00017367442,0.00012517415,0.8858605,0.0023997454,0.003893183,0.0018727543,0.10366493],"study_design_scores_gemma":[0.00015886276,0.00024305064,0.00023966936,0.0000056744425,0.00002643207,0.000026385098,0.000034346915,0.99618894,0.00051452004,0.0018151802,0.00073356833,0.000013396347],"about_ca_topic_score_codex":0.012869101,"about_ca_topic_score_gemma":0.013418486,"teacher_disagreement_score":0.012869101,"about_ca_system_score_codex":0.0011745711,"about_ca_system_score_gemma":0.0025643846,"threshold_uncertainty_score":0.025588393},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06792163,0.0010038079,0.9230592,0.00060405565,0.0001427716,0.00018962713,0.0010064575,0.00025307658,0.005819324],"genre_scores_gemma":[0.83481586,0.0008439944,0.15596429,0.00013990988,0.00011984258,0.00047392555,0.0009117025,0.00018959727,0.0065408903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849117,0.00049866113,0.00009866191,0.00033769495,0.0002766224,0.00029716222],"domain_scores_gemma":[0.99394166,0.004951666,0.00039237997,0.00011791544,0.00035293945,0.00024338788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546683,0.0015477998,0.0028687392,0.0011037089,0.00074036245,0.002762757,0.0027568883,0.0017881708,0.004296678],"category_scores_gemma":[0.0057310346,0.0022298056,0.001747489,0.0031033724,0.0010285166,0.0026577574,0.0015675626,0.0019933735,0.0003128794],"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.00004092386,0.000015957705,0.0001303877,0.00003648097,0.000025954803,0.000047850546,0.000012131463,0.99432063,0.00014337836,0.0023324743,0.00021029597,0.0026836272],"study_design_scores_gemma":[0.0000066728603,0.000014966746,0.000057179383,0.0000054268653,0.000007725491,0.000006566939,0.000007125103,0.99756587,0.00007618891,0.0021175966,0.00013022638,0.000004481438],"about_ca_topic_score_codex":0.029070985,"about_ca_topic_score_gemma":0.026114665,"teacher_disagreement_score":0.029070985,"about_ca_system_score_codex":0.0022672315,"about_ca_system_score_gemma":0.0028579293,"threshold_uncertainty_score":0.05780351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11709232,0.00033282168,0.8745172,0.001231155,0.00013252565,0.0001784411,0.00029091552,0.0010862787,0.005138275],"genre_scores_gemma":[0.40100282,0.00030899706,0.5913161,0.00033411806,0.00014164737,0.0003730868,0.0010456946,0.00031102847,0.005166485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991928,0.00029719042,0.0000531137,0.00018637099,0.00014589682,0.00012462541],"domain_scores_gemma":[0.9893169,0.008912129,0.00038573955,0.0005135861,0.00054410344,0.0003274391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578488,0.0010949627,0.0010443188,0.00087297586,0.0006773669,0.00091112056,0.0015615255,0.0014690141,0.006631098],"category_scores_gemma":[0.01737594,0.00071497995,0.0011345893,0.00095173146,0.00082426454,0.0029864374,0.0019770241,0.0031978455,0.0007675414],"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.00031117618,0.0003128974,0.0024757027,0.0002455496,0.00005070988,0.00006195927,0.0002101303,0.76113963,0.0015736553,0.01677714,0.004597025,0.21224448],"study_design_scores_gemma":[0.000045229866,0.000058338475,0.00013408007,0.000020982492,0.000009897929,0.000011008817,0.00006213102,0.95736855,0.0004076327,0.04137063,0.00050630636,0.0000052727573],"about_ca_topic_score_codex":0.0042874343,"about_ca_topic_score_gemma":0.0073855286,"teacher_disagreement_score":0.006631098,"about_ca_system_score_codex":0.00089223,"about_ca_system_score_gemma":0.00229578,"threshold_uncertainty_score":0.02218324},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508771,0.0009740196,0.47130927,0.0008138359,0.0003670489,0.0004123482,0.0004671688,0.0040562022,0.012829124],"genre_scores_gemma":[0.78185046,0.000116632305,0.21607704,0.00011264497,0.00005605656,0.00024282171,0.00029704047,0.00023568307,0.001011623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703825,0.0016767074,0.00017106858,0.0002593804,0.000607341,0.00024730997],"domain_scores_gemma":[0.9541284,0.036774285,0.0016346124,0.004108698,0.002716142,0.00063793623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048039793,0.0014879232,0.00127515,0.0010156662,0.00069601805,0.00091746723,0.002878581,0.0019315695,0.0039346856],"category_scores_gemma":[0.026356565,0.0006030676,0.0006291095,0.0017288892,0.0012916803,0.0029880763,0.0013343913,0.0018664047,0.0003155834],"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.0015926437,0.001758525,0.0018555544,0.00019853906,0.000052191695,0.0000770292,0.00006605191,0.92739874,0.00338734,0.0052446416,0.002183909,0.056184873],"study_design_scores_gemma":[0.000099413126,0.000094247036,0.00009902338,0.0000033819274,0.0000056580316,0.000006991069,0.000008013084,0.9975343,0.0008828337,0.0011951331,0.00006690015,0.000004120811],"about_ca_topic_score_codex":0.00715664,"about_ca_topic_score_gemma":0.0045885877,"teacher_disagreement_score":0.00715664,"about_ca_system_score_codex":0.0012662334,"about_ca_system_score_gemma":0.0016638649,"threshold_uncertainty_score":0.025406182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.946572,0.000081968115,0.044273615,0.00070858287,0.000054964337,0.00033736753,0.00015370503,0.00018566854,0.007632193],"genre_scores_gemma":[0.9405972,0.000057560577,0.055790603,0.00005818884,0.000012379789,0.00008131359,0.000113854585,0.000059859296,0.003229181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9988819,0.00056302774,0.000040210252,0.00013171136,0.00015855578,0.00022449839],"domain_scores_gemma":[0.99502486,0.002930467,0.00033095383,0.00038316683,0.00040591892,0.00092463667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026052957,0.00050062855,0.0002914645,0.00043643318,0.0021491395,0.0014626976,0.0018193914,0.0016698194,0.0049788975],"category_scores_gemma":[0.005766493,0.0005036002,0.00044429928,0.00057603413,0.00069666345,0.0012785863,0.0007868902,0.0010554865,0.0005030231],"study_design_candidate":"qualitative","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.003183537,0.011900139,0.06794906,0.0009032218,0.00020441692,0.013841409,0.013264555,0.5501184,0.053741917,0.023241047,0.011058229,0.25059408],"study_design_scores_gemma":[0.0005807007,0.0053479876,0.0184505,0.000090897265,0.00013630145,0.0030516658,0.024622006,0.8974419,0.019460302,0.0073840423,0.023277247,0.00015640426],"about_ca_topic_score_codex":0.008179604,"about_ca_topic_score_gemma":0.018078996,"teacher_disagreement_score":0.008179604,"about_ca_system_score_codex":0.0017811261,"about_ca_system_score_gemma":0.0028632407,"threshold_uncertainty_score":0.016656041},"labels":[],"label_agreement":null}]}