{"meta":{"query_hash":"4890092d1e6b","filters":{"topic":"Scheduling and Optimization Algorithms"},"cohort_total":1020,"direct_labels_cover":2,"predictions_cover":1020,"exported":1020,"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/4890092d1e6b","api":"https://metacan.xera.ac/api/v1/cohort?topic=Scheduling+and+Optimization+Algorithms"},"results":[{"id":"W104448679","doi":"10.1007/978-3-319-07046-9_5","title":"A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Constraint programming; Benchmark (surveying); Integer programming; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Range (aeronautics); Constraint (computer-aided design); Job scheduler; Parallel computing; Algorithm; Mathematics; Programming language; Embedded system; Engineering","score_opus":0.013516101009695995,"score_gpt":0.23045582407191548,"score_spread":0.21693972306221948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104448679","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052363266,0.00019134596,0.99772435,0.00021580243,0.000702432,0.0003228325,0.0000030466108,0.00021540743,0.0005724321],"genre_scores_gemma":[0.018210348,0.000019755154,0.979988,0.00028408327,0.00062596163,0.000012307953,0.000006923724,0.00007850554,0.00077414664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980783,0.000004346323,0.00035064464,0.00065171433,0.00043806076,0.00047696705],"domain_scores_gemma":[0.99887234,0.0002562647,0.00007067491,0.00045528292,0.00014635864,0.00019909986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029428708,0.00041422402,0.0004380453,0.0003001654,0.00012179756,0.00026726996,0.0006752296,0.00029130932,0.000013336192],"category_scores_gemma":[0.00005911605,0.00036268396,0.00009326876,0.00019160438,0.00018255196,0.000121476354,0.000097850476,0.00048494007,0.000015796748],"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.000008919812,0.0000024292747,0.000008084809,0.00005170364,0.0000133828635,0.0000033048227,0.0002289618,0.9627926,0.000011971666,0.00062861294,0.000020325466,0.0362297],"study_design_scores_gemma":[0.00048652705,0.00005400764,0.000004027431,0.00033833884,0.000021081843,0.000013566325,1.626055e-7,0.9841087,0.00012259667,0.014318335,0.000060693183,0.00047196695],"about_ca_topic_score_codex":0.0000047728013,"about_ca_topic_score_gemma":0.000035585625,"teacher_disagreement_score":0.035757735,"about_ca_system_score_codex":0.00010914894,"about_ca_system_score_gemma":0.00025688641,"threshold_uncertainty_score":0.9998825},"labels":[],"label_agreement":null},{"id":"W1070785770","doi":"10.1016/j.cirpj.2015.05.006","title":"Modeling and scheduling a flexible manufacturing cell with parallel processing capability","year":2015,"lang":"en","type":"article","venue":"CIRP journal of manufacturing science and technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"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 Windsor","funders":"","keywords":"Scheduling (production processes); Computer science; Distributed computing; Manufacturing engineering; Engineering; Operations management","score_opus":0.014846747365592298,"score_gpt":0.22501935470344026,"score_spread":0.21017260733784796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1070785770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8923129,0.0013605475,0.10562215,0.0002105075,0.00010337402,0.000063460684,2.8693023e-7,0.00015603597,0.00017076249],"genre_scores_gemma":[0.8706519,0.000077284254,0.12919284,0.000015833806,0.000038383863,0.0000019606382,1.2737546e-7,0.000015318801,0.0000063516663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874943,0.000008289925,0.00030499665,0.00023333136,0.00036129568,0.00034265654],"domain_scores_gemma":[0.9992437,0.000015916821,0.000100574456,0.0001590125,0.0002686118,0.00021218807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086294825,0.00016870932,0.00024835975,0.0006185573,0.00021481769,0.00015942809,0.0002828651,0.00010794718,0.0000013662984],"category_scores_gemma":[0.00007533624,0.00013531675,0.00001560496,0.00029060547,0.00040206566,0.0006165796,0.000073791474,0.00042171558,8.535306e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017513064,0.000015984268,0.00040908117,0.00008435235,0.000009932545,0.000020130045,0.00045352223,0.9655856,0.00067671924,0.000024068435,0.000001722265,0.032701377],"study_design_scores_gemma":[0.0010133965,0.00015587627,0.00014075892,0.0001562163,0.000029715653,0.0008371022,0.002480242,0.75748503,0.23552553,0.0018490831,0.00004019767,0.00028685638],"about_ca_topic_score_codex":0.000004096228,"about_ca_topic_score_gemma":0.0000015763518,"teacher_disagreement_score":0.23484883,"about_ca_system_score_codex":0.00009133221,"about_ca_system_score_gemma":0.00017435271,"threshold_uncertainty_score":0.5518057},"labels":[],"label_agreement":null},{"id":"W109577100","doi":"10.1007/978-0-387-36594-7_11","title":"Design Patterns for Distributed Control System Benchmaking","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Calgary","funders":"","keywords":"Benchmarking; Scheduling (production processes); Automation; Computer science; Control (management); Control system; Systems engineering; Distributed computing; Embedded system; Engineering; Operations management","score_opus":0.028903030231268056,"score_gpt":0.2282795245078484,"score_spread":0.19937649427658036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109577100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.5462642e-7,0.00022699664,0.90851635,0.00000666149,0.0006917728,0.0005362606,0.0003132458,0.0009201573,0.08878819],"genre_scores_gemma":[0.04508731,0.00012117666,0.76145124,0.0002915773,0.0026887895,0.00024383458,0.0028574928,0.0008767675,0.18638179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990259,0.0000042491697,0.00035577867,0.00020711434,0.00015277273,0.00025419387],"domain_scores_gemma":[0.99934095,0.00018545848,0.00006765902,0.00020765758,0.000112193404,0.00008608488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020192392,0.00030002798,0.00034831278,0.000120314355,0.0000553115,0.000052597363,0.00012678545,0.0003708956,0.00018329616],"category_scores_gemma":[0.000008986793,0.00029500548,0.00012614764,0.000018061428,0.000009623405,0.000031862,0.000007721901,0.0001769853,0.000042858715],"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.000023441116,0.0000044576946,0.0000046134655,0.00053829286,0.00036559012,0.000023464649,0.000031000072,0.9428528,0.000004735469,0.04845239,0.0013758847,0.006323359],"study_design_scores_gemma":[0.00072868593,0.000026684394,0.0000015349374,0.0003184545,0.00011103236,0.000010527682,0.000021354392,0.98995805,0.00007733132,0.00009518762,0.008219954,0.00043121466],"about_ca_topic_score_codex":0.0000018515994,"about_ca_topic_score_gemma":0.0000020839163,"teacher_disagreement_score":0.1470651,"about_ca_system_score_codex":0.00016382587,"about_ca_system_score_gemma":0.00001490843,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W111149124","doi":"10.1007/978-0-387-36594-7_29","title":"Making Manufacturing Changes Less Disruptive: Agent-Driven Integration","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"National Research Council Canada","funders":"","keywords":"Flexibility (engineering); Manufacturing engineering; Order (exchange); Advanced manufacturing; Production (economics); Engineering; Computer science; Process management; Business","score_opus":0.0695583949593726,"score_gpt":0.285737458600562,"score_spread":0.21617906364118938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W111149124","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000061266306,0.00030278912,0.35641757,0.000030587278,0.00091626955,0.00017196138,0.00001538911,0.00079050695,0.6412937],"genre_scores_gemma":[0.02516474,0.0013815585,0.18717204,0.00036805132,0.002009679,0.000028383569,0.0004791112,0.00053138396,0.78286505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901456,0.0000041138155,0.00024606587,0.00026245305,0.00023084396,0.00024193853],"domain_scores_gemma":[0.9995519,0.000035658086,0.000068418645,0.00022926922,0.000046170462,0.00006860741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00008727362,0.00036698478,0.0002710621,0.00030153376,0.000066337845,0.00007837129,0.00015181533,0.00037322796,0.00075921445],"category_scores_gemma":[0.0000048341667,0.00035638662,0.00009186963,0.000023044639,0.000027419166,0.000072691015,0.00003910327,0.0004147056,0.00018148532],"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.000015977655,0.000010027185,0.0000055110563,0.00027002377,0.0003601792,0.00010641041,0.001114459,0.25463244,0.00007066757,0.0399384,0.0011588089,0.7023171],"study_design_scores_gemma":[0.00078133366,0.00008609091,0.00007396686,0.0020385233,0.00027023169,0.000062537925,0.0008108902,0.82799965,0.013586134,0.0016781728,0.14948052,0.0031319684],"about_ca_topic_score_codex":0.000004180598,"about_ca_topic_score_gemma":0.00014036012,"teacher_disagreement_score":0.69918513,"about_ca_system_score_codex":0.00022260942,"about_ca_system_score_gemma":0.000009538973,"threshold_uncertainty_score":0.99988884},"labels":[],"label_agreement":null},{"id":"W112889630","doi":"10.1609/icaps.v21i1.13450","title":"Scheduling an Aircraft Repair Shop","year":2011,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"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":"Integer programming; Schedule; Scheduling (production processes); Constraint programming; Computer science; Benders' decomposition; Job shop scheduling; Mathematical optimization; Heuristic; Operations research; Context (archaeology); Engineering; Stochastic programming; Mathematics; Algorithm","score_opus":0.04964498439739254,"score_gpt":0.2694260334571725,"score_spread":0.21978104905977994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112889630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97639436,0.00009048735,0.0010596683,0.000105974694,0.00061838346,0.00010514477,0.000007621754,0.0019411518,0.019677218],"genre_scores_gemma":[0.8924217,0.000024611942,0.107314005,0.000065988934,0.00007105775,0.0000096378935,0.0000052362766,0.000029561896,0.00005816178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988489,0.000006827923,0.0003467258,0.0002654215,0.0003183357,0.00021378318],"domain_scores_gemma":[0.9993261,0.000027347472,0.00012434156,0.00010724644,0.00031542635,0.000099545534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032008358,0.00020758176,0.00018984282,0.00017719346,0.00012973805,0.00010657967,0.0004626233,0.00012563614,0.000059672842],"category_scores_gemma":[0.00013779709,0.00017330755,0.000070406044,0.00017980993,0.00007065884,0.0003185974,0.00007069742,0.00031832157,0.0000064346805],"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.0004979896,0.0004977089,0.119161196,0.0005973656,0.0012152107,0.000021403865,0.023951026,0.6334053,0.083887175,0.13113551,0.0005375395,0.0050925105],"study_design_scores_gemma":[0.0002497997,0.000049269926,0.0022532789,0.00043013223,0.000020476633,0.000019676292,0.0017302816,0.97969854,0.014778332,0.00055311964,0.000012086479,0.0002049843],"about_ca_topic_score_codex":0.000009439912,"about_ca_topic_score_gemma":4.6066577e-7,"teacher_disagreement_score":0.3462932,"about_ca_system_score_codex":0.00003249082,"about_ca_system_score_gemma":0.000026224085,"threshold_uncertainty_score":0.7067277},"labels":[],"label_agreement":null},{"id":"W1148679896","doi":"10.1007/s11590-015-0939-7","title":"Machine scheduling with a maintenance interval and job delivery coordination","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","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":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Computational intelligence; Mathematical optimization; Scheduling (production processes); Distribution center; Interval (graph theory); Distributed computing; Artificial intelligence; Mathematics; Embedded system","score_opus":0.009302570831021779,"score_gpt":0.19525225775025798,"score_spread":0.1859496869192362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1148679896","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0393361,0.00018558478,0.95788956,0.001344118,0.00020326737,0.00010674567,0.000004509512,0.00032439947,0.00060572027],"genre_scores_gemma":[0.37393206,0.000050631585,0.6250092,0.00074069866,0.00006957818,0.000014495273,0.000050909126,0.000045102548,0.000087335655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993445,0.000021601567,0.00015780119,0.00016490587,0.00014849706,0.00016267461],"domain_scores_gemma":[0.99961096,0.000019281008,0.000036792942,0.00011122718,0.00011075053,0.0001110124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013053649,0.00014137801,0.00012202301,0.00011728354,0.00005142716,0.00008884548,0.00006880096,0.00004608704,0.000018867839],"category_scores_gemma":[0.00003644071,0.00013129669,0.000016339318,0.00023216144,0.000043029715,0.00030201848,0.000017362529,0.000110574925,0.000007954724],"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.000017808188,0.000005118825,0.0008607906,0.000011465623,0.00002017335,0.000004687209,0.00018779126,0.99754167,0.000058460813,0.000053842014,0.0004228498,0.0008153276],"study_design_scores_gemma":[0.00084638206,0.000025913376,0.00009488667,0.000041497795,0.000015092417,0.000023997254,0.00012493317,0.9983772,0.00007606231,0.000004016499,0.00019037022,0.0001796718],"about_ca_topic_score_codex":0.000013976637,"about_ca_topic_score_gemma":0.000003750147,"teacher_disagreement_score":0.33459595,"about_ca_system_score_codex":0.0000693026,"about_ca_system_score_gemma":0.000012891855,"threshold_uncertainty_score":0.5354124},"labels":[],"label_agreement":null},{"id":"W114981133","doi":"10.1007/978-3-540-92151-6_3","title":"Forward Backward Transformation","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Minnow Environmental (Canada); 3M (Canada)","funders":"","keywords":"Transformation (genetics); Computer science; Artificial intelligence; Biology","score_opus":0.0677447851728817,"score_gpt":0.30619664807839525,"score_spread":0.23845186290551357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W114981133","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019983789,0.011356598,0.69040745,0.0001282678,0.0016475471,0.00031074006,0.00004482938,0.00034641713,0.29573816],"genre_scores_gemma":[0.123097874,0.1622823,0.60245836,0.0008347711,0.0017598365,0.0002327227,0.0012220218,0.00059939275,0.10751272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878794,0.0000067971737,0.0005321035,0.0002058823,0.00030233612,0.00016492805],"domain_scores_gemma":[0.9993509,0.00022800693,0.00005689221,0.00010662942,0.00021795832,0.000039610968],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00009501737,0.00027729082,0.00032922812,0.0002453329,0.00007197452,0.00001367001,0.00014881708,0.00015504292,0.000092064016],"category_scores_gemma":[0.000028050134,0.00030037813,0.00009567364,0.000081427876,0.00015840202,0.00009832861,0.000024645318,0.00032396207,0.00027070666],"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.0000032990074,0.000003879156,0.0000011195126,0.0000922604,0.000099308425,0.000010984178,0.0018088334,0.9665958,3.274009e-8,0.015563855,0.0012676417,0.014552969],"study_design_scores_gemma":[0.00011440859,0.000034813234,0.0000068720915,0.00044726513,0.000022289922,0.000039419527,0.00032702746,0.9269616,0.00003033091,0.053527806,0.017932555,0.00055558013],"about_ca_topic_score_codex":8.9583176e-7,"about_ca_topic_score_gemma":0.000006126587,"teacher_disagreement_score":0.18822543,"about_ca_system_score_codex":0.00020146239,"about_ca_system_score_gemma":0.000033176904,"threshold_uncertainty_score":0.9999448},"labels":[],"label_agreement":null},{"id":"W116688643","doi":"10.1007/0-387-25477-3_3","title":"A Two-Time-Scale Approach for Production Planning in Discrete Time","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Markov chain; Limit (mathematics); Discrete time and continuous time; Mathematical optimization; State space; Class (philosophy); State (computer science); Continuous-time Markov chain; Optimal control; Mathematics; Scale (ratio); Time limit; Markov process; Production (economics); Computer science; Markov decision process; Control limits; Variable-order Markov model; Markov model; Algorithm; Engineering; Artificial intelligence; Statistics; Economics","score_opus":0.013254820830841755,"score_gpt":0.2227197575050148,"score_spread":0.20946493667417304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W116688643","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017422402,0.00038785345,0.25760752,0.00004732499,0.00021800936,0.00059591985,0.000020618907,0.0006299659,0.74047536],"genre_scores_gemma":[0.000059401664,0.000020011512,0.406073,0.000016723026,0.0007001814,0.000047226804,0.00035831088,0.00010899659,0.59261614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907374,0.0000036830684,0.00027645254,0.00031638524,0.00012512012,0.00020460643],"domain_scores_gemma":[0.9996492,0.000019558032,0.000039879626,0.00020542367,0.000033967466,0.00005196105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013984516,0.00026355722,0.00029080303,0.0002020322,0.000033598117,0.000030741438,0.000097938755,0.00022116507,0.00028970125],"category_scores_gemma":[0.000010012147,0.0002650219,0.00008398764,0.000038177794,0.000023054927,0.00008824618,0.000015865986,0.00023922107,0.0001366613],"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.0000100773605,0.0000063111675,0.0000017235865,0.000044447344,0.000032679054,5.959301e-7,0.00011319917,0.99417645,0.000036122794,0.00035501234,0.0019837846,0.0032395925],"study_design_scores_gemma":[0.00031598753,0.0000137856505,0.0000011197474,0.00009232719,0.000026394444,0.0000067795027,0.000016064376,0.99076045,0.0001759969,0.00010512091,0.008113025,0.00037293945],"about_ca_topic_score_codex":0.0000014757245,"about_ca_topic_score_gemma":9.3439144e-7,"teacher_disagreement_score":0.14846548,"about_ca_system_score_codex":0.00008507343,"about_ca_system_score_gemma":0.000013409927,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W1175444562","doi":"10.1016/b978-008043567-1/50017-6","title":"Computer Applications in Agile Manufacturing","year":2001,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Scheduling and Optimization Algorithms","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 Saskatchewan","funders":"","keywords":"Agile software development; Agile manufacturing; Manufacturing engineering; Computer science; Engineering; Software engineering","score_opus":0.01025135230849411,"score_gpt":0.20991712564855472,"score_spread":0.1996657733400606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1175444562","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002405613,0.00050879264,0.0063002855,0.000007325369,0.000284235,0.00034219294,0.000012865443,0.0003537915,0.99216646],"genre_scores_gemma":[0.00028697864,0.00022550706,0.02314096,0.00008920977,0.0006110007,0.00008243799,0.00009774578,0.00016002104,0.97530615],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990959,0.0000046094024,0.0003115948,0.00024603738,0.00013456747,0.00020727154],"domain_scores_gemma":[0.99949616,0.00003064502,0.00004531494,0.00032934063,0.00002106906,0.00007745735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000059413123,0.0002908536,0.00029125955,0.00020763124,0.000041519335,0.000038997325,0.00017906052,0.00025076905,0.00022289081],"category_scores_gemma":[7.03234e-7,0.00031402954,0.000093178256,0.000012956433,0.00002761134,0.000024754427,0.00003771879,0.0004152376,0.00023868232],"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":[5.418948e-7,0.0000027293415,0.0000027901074,0.000048335893,0.000027692133,0.000010479042,0.00007341858,0.026103284,7.112095e-7,0.0006029348,0.000051827865,0.9730753],"study_design_scores_gemma":[0.00016443522,0.0000056248587,0.000013789599,0.00016294063,0.000020601667,0.000008479858,0.000003572167,0.014107245,0.00007852959,0.0014711133,0.9835694,0.00039431136],"about_ca_topic_score_codex":2.3082839e-7,"about_ca_topic_score_gemma":0.00000852865,"teacher_disagreement_score":0.9835175,"about_ca_system_score_codex":0.00009462013,"about_ca_system_score_gemma":0.00001326155,"threshold_uncertainty_score":0.99993116},"labels":[],"label_agreement":null},{"id":"W1210901285","doi":"10.1016/j.ifacol.2015.06.305","title":"On-line Supply Chain Scheduling Problem with Capacity Limited Vehicles","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Supply chain; Competitive analysis; Robustness (evolution); Operations research; Mathematics; Computer network; Upper and lower bounds; Business; Routing (electronic design automation)","score_opus":0.02993425478790617,"score_gpt":0.22884587637309536,"score_spread":0.19891162158518919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1210901285","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9241212,0.00039633873,0.0697062,0.0013241215,0.00041542575,0.0003872867,0.00008251511,0.0015536337,0.00201327],"genre_scores_gemma":[0.25502825,0.00002897028,0.7438724,0.0002981974,0.0002967416,0.000023631166,0.00011037804,0.000081012884,0.00026039826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985198,0.000036323338,0.00029237333,0.00032964366,0.00039112556,0.0004307321],"domain_scores_gemma":[0.9990372,0.000087065506,0.000055431003,0.00031385827,0.00018210875,0.0003243497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027024734,0.00033097,0.000304671,0.00016009575,0.0000895234,0.000073133364,0.00019924884,0.00015850153,0.000050209248],"category_scores_gemma":[0.00011543887,0.00027894706,0.0000586895,0.0004685154,0.00006828399,0.00015391463,0.000022706503,0.00041154007,0.000121743076],"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.00007891461,0.00009409676,0.0003295376,0.000036567013,0.00006787864,0.000017956054,0.00080859277,0.9946923,0.00055239676,0.00026555528,0.000015593785,0.0030405952],"study_design_scores_gemma":[0.0018425706,0.0003076187,0.00010735578,0.00014684242,0.000031307132,0.000026716014,0.00048289401,0.99362355,0.0027177127,0.00009555553,0.00016681803,0.0004510356],"about_ca_topic_score_codex":0.000030920848,"about_ca_topic_score_gemma":0.00004168466,"teacher_disagreement_score":0.6741662,"about_ca_system_score_codex":0.000112033114,"about_ca_system_score_gemma":0.00005865124,"threshold_uncertainty_score":0.99996626},"labels":[],"label_agreement":null},{"id":"W128921158","doi":"10.1007/1-84628-269-1_12","title":"Remote Monitoring and Control in a Distributed Manufacturing Environment","year":2006,"lang":"en","type":"book-chapter","venue":"Springer series in advanced manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"National Research Council Canada","funders":"","keywords":"Control (management); Environmental science; Computer science; Artificial intelligence","score_opus":0.0054033940520398106,"score_gpt":0.18688632472644026,"score_spread":0.18148293067440044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W128921158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43020818,0.03511841,0.29756632,0.0005068957,0.010460974,0.0071019637,0.00078280614,0.005798631,0.21245581],"genre_scores_gemma":[0.85809624,0.009372927,0.105553016,0.000033928824,0.0007569554,0.0000967837,0.00017954443,0.0007457528,0.025164876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977302,0.000013089118,0.00071716757,0.000646164,0.00028086265,0.00061251625],"domain_scores_gemma":[0.9992022,0.00007418825,0.0001343887,0.00046121672,0.00000885579,0.00011917172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014142499,0.00071442267,0.00070375303,0.0004245199,0.00007494889,0.000080680955,0.00021759243,0.0003927595,0.000050232233],"category_scores_gemma":[0.000009458822,0.0008571956,0.000089826426,0.000026756958,0.00008381623,0.00033014832,0.00013030923,0.00094454334,0.000016163454],"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.000048397484,0.000007802744,0.00013157423,0.00025730892,0.00004434299,0.00017854401,0.00008870588,0.9699587,0.00021163536,0.00006724633,0.000003822308,0.029001871],"study_design_scores_gemma":[0.018631762,0.00033241019,0.037532263,0.011335006,0.00036055807,0.00026305887,0.00057149754,0.108989336,0.6053956,0.021401724,0.18185745,0.013329336],"about_ca_topic_score_codex":0.000024885961,"about_ca_topic_score_gemma":0.000029767603,"teacher_disagreement_score":0.8609694,"about_ca_system_score_codex":0.0005812982,"about_ca_system_score_gemma":0.00001054012,"threshold_uncertainty_score":0.99938786},"labels":[],"label_agreement":null},{"id":"W133922393","doi":"","title":"Proceedings of the 2003 international conference on Parallel and distributed processing and applications","year":2003,"lang":"en","type":"article","venue":"","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":"St. Francis Xavier University","funders":"","keywords":"Computer science","score_opus":0.013266812583066084,"score_gpt":0.2268976383657659,"score_spread":0.21363082578269982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W133922393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044772424,0.0002811432,0.84122485,0.00053619966,0.00014314447,0.00050068455,0.0000284722,0.00023111416,0.11228195],"genre_scores_gemma":[0.97149086,0.000058070145,0.028205924,0.000025238516,0.000009459267,0.00002190263,0.0000029279915,0.0000049062455,0.00018073103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997772,0.0000011793938,0.00006723044,0.000059798436,0.00005230767,0.00004226956],"domain_scores_gemma":[0.9998343,0.00000422938,0.000016146438,0.000024313193,0.00010179305,0.000019217112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003158207,0.00004130025,0.000038109916,0.000014815387,0.000032289543,0.000029568751,0.000038702325,0.000020866872,0.000016652873],"category_scores_gemma":[0.000021001473,0.000029850931,0.0000041594258,0.00011367615,0.000028459732,0.000040693103,0.0000060722837,0.000040962466,5.110833e-7],"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.000014765949,0.00014135995,0.024961876,0.00029033681,0.00009293738,2.0066688e-7,0.0009638191,0.083170004,0.0038328234,0.85313517,0.0015160448,0.031880636],"study_design_scores_gemma":[0.00045988197,0.0000112901,0.0040199393,0.00005326403,0.000011900898,0.000009325445,0.00071994134,0.9864,0.0035560408,0.0016381423,0.0029681758,0.00015210673],"about_ca_topic_score_codex":4.6092669e-7,"about_ca_topic_score_gemma":2.8324794e-7,"teacher_disagreement_score":0.9267184,"about_ca_system_score_codex":0.000005600345,"about_ca_system_score_gemma":0.000007196503,"threshold_uncertainty_score":0.12172856},"labels":[],"label_agreement":null},{"id":"W143788045","doi":"10.1007/978-1-4615-1635-4_10","title":"Manufacturing System Modeling and Control: Production Quality &amp; Marketing","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Production (economics); Control (management); Quality (philosophy); Jump; Controller (irrigation); Engineering; Mode (computer interface); Manufacturing engineering; Computer science; Industrial engineering; Economics; Microeconomics","score_opus":0.023763446216582267,"score_gpt":0.2249448196871481,"score_spread":0.20118137347056583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143788045","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012007786,0.0010177214,0.48484617,0.00004214344,0.0009225833,0.00029694033,0.0000094128845,0.001596468,0.51006776],"genre_scores_gemma":[0.3038821,0.0019862659,0.11257869,0.000072845534,0.0027911423,0.000042638734,0.00016051176,0.00055343786,0.57793236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998772,0.000023839886,0.00045341215,0.00034939346,0.00020187147,0.00019945402],"domain_scores_gemma":[0.99944544,0.000059419486,0.00007409825,0.00027123492,0.000065222746,0.000084581836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006761967,0.00031089335,0.00036718475,0.00013269365,0.00009574046,0.00007513846,0.00006812223,0.00027424708,0.00009891653],"category_scores_gemma":[0.000035332443,0.0003155249,0.00006925191,0.000014075422,0.000015671194,0.00008368117,0.000020027723,0.0003236798,0.000041304724],"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.000017744023,0.0000016905668,0.000005191924,0.00064157567,0.00010215464,0.0000027429562,0.000037781458,0.99103725,0.000013885913,0.0014637357,0.000060604005,0.006615632],"study_design_scores_gemma":[0.0002975529,0.0000029642904,0.000005705732,0.0005275849,0.00007127059,0.000053678934,0.00006627184,0.9941313,0.000052380412,0.00014498954,0.0041065924,0.0005396883],"about_ca_topic_score_codex":0.000013996758,"about_ca_topic_score_gemma":0.000013486298,"teacher_disagreement_score":0.37226748,"about_ca_system_score_codex":0.00011856427,"about_ca_system_score_gemma":0.0000081201915,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W147429058","doi":"","title":"An empirical study of multi-point constructive search for constraint-based scheduling","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Backtracking; Constructive; Beam stack search; Mathematical optimization; Computer science; Scheduling (production processes); Job shop scheduling; Search algorithm; Beam search; Mathematics; Incremental heuristic search","score_opus":0.030529693194948086,"score_gpt":0.3119156557389944,"score_spread":0.2813859625440463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W147429058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4428548,0.000010025023,0.556368,0.000011638043,0.0000679126,0.00027737295,0.000011183771,0.00017135014,0.00022773852],"genre_scores_gemma":[0.6214796,1.5554487e-7,0.37842524,0.000011367597,0.000030952713,0.000017141007,0.0000126780305,0.00001633149,0.0000065811355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992233,0.00003220673,0.00028129222,0.00015136962,0.00012316527,0.00018867698],"domain_scores_gemma":[0.99944925,0.00012022764,0.000022924427,0.00016446011,0.00017830092,0.000064857326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019753723,0.00012003298,0.00018642214,0.00011758596,0.000052462863,0.000026262465,0.00009186287,0.000066922395,0.000055330987],"category_scores_gemma":[0.000019361487,0.00011476769,0.0000455834,0.00016134295,0.00007403909,0.000065653236,0.0000064923724,0.000100789264,0.000002832535],"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.000013630205,0.00034938793,0.010670825,0.000020425246,0.000024643627,9.860453e-7,0.00031327046,0.9865138,0.00080147455,0.00015837228,0.000007785024,0.0011254249],"study_design_scores_gemma":[0.002299497,0.00018689418,0.0011032136,0.000007718488,0.000014829954,0.0000016641073,0.0067825406,0.97592014,0.013528874,0.000015175382,0.0000017536208,0.00013768044],"about_ca_topic_score_codex":0.0000533285,"about_ca_topic_score_gemma":0.0000307486,"teacher_disagreement_score":0.17862478,"about_ca_system_score_codex":0.00003007612,"about_ca_system_score_gemma":0.000042672942,"threshold_uncertainty_score":0.46800905},"labels":[],"label_agreement":null},{"id":"W1481995509","doi":"10.1007/3-540-45446-2_7","title":"Job Shop Scheduling Problems with Controllable Processing Times","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Western University","funders":"","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Job scheduler; Mathematical optimization; Distributed computing; Rate-monotonic scheduling; Fair-share scheduling; Mathematics; Operating system; Schedule","score_opus":0.010343054450460935,"score_gpt":0.21011225303891842,"score_spread":0.19976919858845749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481995509","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009303943,0.0019551455,0.97940165,0.00011104042,0.00045598947,0.00028258888,0.0000019394186,0.0004268362,0.01727179],"genre_scores_gemma":[0.06607465,0.00011974305,0.9316604,0.00027530518,0.00061573874,0.000015587893,0.000009475626,0.00012462489,0.0011044324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.0000066657285,0.00033010877,0.00062834943,0.0005234558,0.00050593034],"domain_scores_gemma":[0.99910945,0.000095501215,0.000092939874,0.00036619956,0.0002145393,0.00012139384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003101257,0.0004288938,0.00042393562,0.00044157775,0.0001778061,0.00040867942,0.0005517961,0.00024681963,0.000063283165],"category_scores_gemma":[0.000026564025,0.0003615148,0.00004671907,0.00048755406,0.00028188672,0.00027950516,0.00007985678,0.0006352809,0.000025192805],"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.000003400669,0.0000040252767,0.000038456245,0.000060810435,0.00000994199,0.000017524704,0.00017593314,0.8740523,0.000022663551,0.00010310451,0.0000022987454,0.12550956],"study_design_scores_gemma":[0.0003643753,0.000051163144,0.000004175684,0.00084329146,0.000014200418,0.00005180733,4.7664568e-7,0.9949994,0.00024899753,0.0025504243,0.00038268184,0.00048897945],"about_ca_topic_score_codex":0.0000042011598,"about_ca_topic_score_gemma":0.00002397465,"teacher_disagreement_score":0.12502058,"about_ca_system_score_codex":0.0001672161,"about_ca_system_score_gemma":0.00022716052,"threshold_uncertainty_score":0.9998837},"labels":[],"label_agreement":null},{"id":"W1484014294","doi":"10.5772/5216","title":"Minimizing the Weighted Number of Late Jobs with Batch Setup Times and Delivery Costs on a Single Machine","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"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.013319251710650083,"score_gpt":0.2089098156155611,"score_spread":0.19559056390491103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484014294","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035694502,0.0008010769,0.0071140127,0.00007810182,0.00017848243,0.000233425,0.000043632957,0.00028651775,0.9876953],"genre_scores_gemma":[0.048426263,0.0019499614,0.28672695,0.0008294018,0.00040247513,0.000012648701,0.0002984995,0.00057301833,0.6607808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919754,0.0000068584172,0.0002409504,0.00018709875,0.0002101556,0.00015739336],"domain_scores_gemma":[0.99941415,0.00015753071,0.00006959875,0.00021999014,0.00007702974,0.00006169698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000100637335,0.00028102842,0.000277335,0.00009174277,0.000048884114,0.000031914824,0.00009269775,0.00019942647,0.0007516287],"category_scores_gemma":[0.0000043275118,0.00018342798,0.00004789939,0.000046481102,0.00006551581,0.00003888586,0.000024645988,0.0002803863,0.000045207857],"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.0021355213,0.00057638274,0.003410483,0.0021159563,0.009498643,0.00072432123,0.0061419006,0.31523848,0.00060187955,0.14612488,0.022656802,0.49077475],"study_design_scores_gemma":[0.0028841628,0.0003805192,0.00018938571,0.0020541903,0.00053265557,0.00018234809,0.00014685422,0.9499713,0.0029310063,0.00078301027,0.0379162,0.0020283342],"about_ca_topic_score_codex":0.000030538606,"about_ca_topic_score_gemma":0.00004006175,"teacher_disagreement_score":0.63473284,"about_ca_system_score_codex":0.000043591353,"about_ca_system_score_gemma":0.000012337842,"threshold_uncertainty_score":0.8229807},"labels":[],"label_agreement":null},{"id":"W1491168799","doi":"10.1109/icsmc.2002.1175710","title":"A simulated annealing technique for multi-route cluster tools","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Simulated annealing; Computer science; Schedule; Mathematical optimization; Scheduling (production processes); Adaptive simulated annealing; Job shop scheduling; Critical path method; Shortest path problem; Algorithm; Parallel computing; Distributed computing; Theoretical computer science; Mathematics; Engineering","score_opus":0.03704327241917189,"score_gpt":0.27569126554212975,"score_spread":0.23864799312295787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491168799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016593124,0.000047978763,0.99517787,0.000012358301,0.0002035813,0.00039566544,0.000007172778,0.0005949728,0.0019010988],"genre_scores_gemma":[0.108730234,0.0000055898486,0.89046997,0.00012649054,0.00002423321,0.000050089664,0.000013323749,0.000034503733,0.0005455403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995221,0.000008268785,0.00015044541,0.00010580815,0.000044512355,0.00016886508],"domain_scores_gemma":[0.9997032,0.00007206782,0.000010608325,0.00011523868,0.00005203198,0.000046819776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013509345,0.00009643045,0.0000953324,0.000051701205,0.000040897787,0.00004300674,0.00005103505,0.000091606904,0.000061957435],"category_scores_gemma":[0.000115434865,0.00009134444,0.000043685584,0.0001203529,0.0000060495304,0.000083968174,0.000004286307,0.00006511855,0.000014677952],"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.0000025804698,0.0000075797275,0.00003581742,0.00001633636,0.000013356616,4.0612412e-7,0.00004581774,0.9980544,0.00047553604,0.0002740817,0.00015434201,0.00091973343],"study_design_scores_gemma":[0.0006052095,0.000008894692,0.00000765721,0.000013067404,0.0000059726876,0.0000027308167,0.000027205077,0.9716346,0.025034828,0.0000416639,0.0024784515,0.00013967752],"about_ca_topic_score_codex":0.0000020173034,"about_ca_topic_score_gemma":0.0000019177455,"teacher_disagreement_score":0.10707092,"about_ca_system_score_codex":0.000025336958,"about_ca_system_score_gemma":0.0000081115,"threshold_uncertainty_score":0.3724918},"labels":[],"label_agreement":null},{"id":"W1491993398","doi":"10.5772/26771","title":"Adaptive Production Scheduling and Control in One-Of-A-Kind Production","year":2012,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mass customization; Production (economics); Scheduling (production processes); Personalization; Computer science; Manufacturing engineering; Engineering; Operations management; Economics","score_opus":0.025264838027768643,"score_gpt":0.2172107948438087,"score_spread":0.19194595681604007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491993398","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018968,0.015011334,0.40510288,0.00040178167,0.01063508,0.005818498,0.00007043,0.00235945,0.54163253],"genre_scores_gemma":[0.9329756,0.00022193008,0.037601143,0.000018876768,0.0010241376,0.000056921886,0.000012636698,0.00015286486,0.027935926],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989654,0.000011841887,0.00038347664,0.00028198733,0.00017246525,0.00018487341],"domain_scores_gemma":[0.99944055,0.000024303692,0.00012254308,0.00022192602,0.00013712855,0.000053519427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002504694,0.0002563611,0.00035737685,0.0003423407,0.000029156381,0.00001472503,0.00007288978,0.00032887203,0.000027698894],"category_scores_gemma":[0.000057711743,0.00028825353,0.00004920668,0.00002552046,0.00009135837,0.00007552252,0.000019967307,0.00053226243,0.000013295897],"study_design_candidate":"bench_or_experimental","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.0006171274,0.00017899502,0.0003170623,0.001690401,0.0016550866,0.00002280104,0.007616927,0.07832683,0.1049241,0.015280527,0.00010490471,0.7892652],"study_design_scores_gemma":[0.0039815484,0.00067159004,0.00019314812,0.010437722,0.0010218145,0.00023330766,0.0009544308,0.0818487,0.85137874,0.033321954,0.011417218,0.004539807],"about_ca_topic_score_codex":0.0000053723757,"about_ca_topic_score_gemma":0.000022744784,"teacher_disagreement_score":0.91400754,"about_ca_system_score_codex":0.00009543374,"about_ca_system_score_gemma":0.000032317974,"threshold_uncertainty_score":0.99995697},"labels":[],"label_agreement":null},{"id":"W1494114354","doi":"10.22034/2014.1.04","title":"No-idle time Scheduling of Open shops: Modeling and Meta-heuristic Solution Methods","year":2014,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Meta heuristic; Idle; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Mathematics; Operating system; Artificial intelligence; Algorithm","score_opus":0.24367772835332818,"score_gpt":0.5221604417796115,"score_spread":0.27848271342628333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494114354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04410666,0.015498952,0.9320296,0.000055041924,0.0006017051,0.00049558235,0.000026313955,0.00012836144,0.0070577906],"genre_scores_gemma":[0.43596488,0.0034312666,0.55978143,0.00010457123,0.0001918276,0.000047298585,0.00001985132,0.0001267132,0.00033217986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975303,0.00036927842,0.0009894138,0.00037943985,0.00039285352,0.00033870563],"domain_scores_gemma":[0.9980486,0.00043380295,0.00040046163,0.0004463395,0.0004355627,0.00023522583],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033384447,0.00034013987,0.0011613365,0.00052878074,0.00019577348,0.0010571838,0.0018482511,0.00014468643,0.002773293],"category_scores_gemma":[0.0008598033,0.00031651126,0.00017113071,0.0006314089,0.00007142225,0.0019173678,0.0008159821,0.0003714158,0.000018491131],"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.000050448358,0.00007034956,0.0008376997,0.00017536915,0.0009027801,0.0000018756749,0.00011216911,0.9473288,0.04012857,0.00010531857,0.0006540833,0.009632523],"study_design_scores_gemma":[0.00042770623,0.000008241209,0.00049682055,0.00013863301,0.0007243552,0.0000066036846,0.000020979245,0.98457146,0.010762007,0.0021148687,0.00036159583,0.00036676042],"about_ca_topic_score_codex":0.00027325863,"about_ca_topic_score_gemma":0.000004066066,"teacher_disagreement_score":0.39185822,"about_ca_system_score_codex":0.000051973562,"about_ca_system_score_gemma":0.000051716077,"threshold_uncertainty_score":0.9999798},"labels":[],"label_agreement":null},{"id":"W1502375285","doi":"10.4230/lipics.stacs.2011.380","title":"A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times","year":2011,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; University of Waterloo","funders":"","keywords":"Preemption; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Algorithm; Processor scheduling; Computational complexity theory; Time complexity; Parallel computing; Mathematical optimization; Mathematics; Operating system","score_opus":0.029408539778234634,"score_gpt":0.2561213773527595,"score_spread":0.2267128375745249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502375285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036527922,0.00061489735,0.9883976,0.000016226371,0.00087807677,0.0028484885,0.0022507536,0.0006812837,0.0006598716],"genre_scores_gemma":[0.05168753,0.00009996754,0.9441253,0.000062458865,0.00018922934,0.0007827223,0.0026108853,0.00028064547,0.00016125444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962799,0.0000217607,0.001858285,0.00043913943,0.00049809477,0.00090281846],"domain_scores_gemma":[0.99719983,0.000085059895,0.0008945358,0.00070143584,0.0008629894,0.0002561464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059491704,0.0009373976,0.0011736003,0.00051443133,0.00021372606,0.00030390476,0.0008282456,0.0007103901,0.000029446659],"category_scores_gemma":[0.000072242256,0.0008301769,0.00039018277,0.00028670137,0.00015783016,0.00065930537,0.00034148063,0.0010362422,0.000015183655],"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.0001669265,0.0005781429,0.000541155,0.016883695,0.0012564609,0.0000027987496,0.024306893,0.85050845,0.000029106066,0.00029626815,0.00011503674,0.105315074],"study_design_scores_gemma":[0.0038662925,0.00022325058,0.000018625038,0.0018703847,0.00022725319,0.000022551585,0.00095396506,0.98963445,0.0013694888,0.0001435969,0.0006838482,0.0009862671],"about_ca_topic_score_codex":0.000022608285,"about_ca_topic_score_gemma":0.000017196842,"teacher_disagreement_score":0.13912603,"about_ca_system_score_codex":0.00014965665,"about_ca_system_score_gemma":0.00020675159,"threshold_uncertainty_score":0.9994149},"labels":[],"label_agreement":null},{"id":"W151615172","doi":"","title":"Proactive algorithms for scheduling with probabilistic durations","year":2005,"lang":"en","type":"article","venue":"Cork Open Research Archive (University College Cork, Ireland)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Science Foundation Ireland","keywords":"Computer science; Probabilistic logic; Probabilistic analysis of algorithms; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Fair-share scheduling; Flow shop scheduling; Job shop scheduling; Algorithm; Mathematical optimization; Quality of service; Artificial intelligence; Mathematics; Schedule","score_opus":0.05926483646504532,"score_gpt":0.29348556840343365,"score_spread":0.23422073193838833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W151615172","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016451595,0.00014473038,0.94739115,0.001421547,0.00023994732,0.005319354,0.0012086323,0.000402797,0.02742023],"genre_scores_gemma":[0.19535063,0.00014325148,0.7947838,0.00003945929,0.00037187352,0.00016807405,0.00030673764,0.000100664816,0.008735562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979513,0.00019571242,0.00018868894,0.0005322132,0.00044258148,0.00068944646],"domain_scores_gemma":[0.99763745,0.00079766486,0.000050738985,0.00042517655,0.00073700224,0.0003519382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067759946,0.0002402688,0.00030860526,0.0004507485,0.0011674867,0.00017236879,0.0009359865,0.00010860968,0.00010971678],"category_scores_gemma":[0.00028692503,0.00024690322,0.000076993834,0.0010502787,0.00028785123,0.0006626928,0.00030104726,0.000625529,0.00011184472],"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.0027996614,0.00065550994,0.0004887859,0.00028766377,0.00082212785,0.00016601659,0.0053775217,0.87493277,0.00030532086,0.068796314,0.023328224,0.022040062],"study_design_scores_gemma":[0.0027609076,0.00034809852,0.0004245096,0.00012780885,0.000042576645,0.000014534154,0.003545109,0.9745299,0.00008993691,0.0006921546,0.017037,0.00038742303],"about_ca_topic_score_codex":0.000046211866,"about_ca_topic_score_gemma":0.0005883563,"teacher_disagreement_score":0.17889903,"about_ca_system_score_codex":0.00036590255,"about_ca_system_score_gemma":0.00040385904,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W1520482351","doi":"10.1007/978-1-4471-0719-4_47","title":"Industrial Experience: Object-Oriented Methodology approach to Remote Terminal Unit Programming","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Terminal (telecommunication); Object (grammar); Computer science; Object-oriented programming; Method; Unit (ring theory); Systems engineering; Engineering; Programming language; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.12055751992127937,"score_gpt":0.30540776036983136,"score_spread":0.18485024044855197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520482351","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005797135,0.000065557244,0.48203677,0.000014906961,0.00093363953,0.00040194564,0.000004711762,0.00068030553,0.5158042],"genre_scores_gemma":[0.000094242474,0.000038633694,0.73540986,0.00007842182,0.00086465967,0.00002697414,0.000121358345,0.00013621956,0.26322964],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981575,0.000039759558,0.00051073864,0.0005170079,0.00031629956,0.0004587129],"domain_scores_gemma":[0.9990105,0.000092316055,0.00007697559,0.0004353622,0.00011524591,0.00026961457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031522458,0.0004898673,0.0005517403,0.00041172848,0.00008971845,0.00006798075,0.00029893886,0.0008868083,0.0005360633],"category_scores_gemma":[0.00011355858,0.00048926147,0.00012998618,0.00020668891,0.00006983033,0.000065346096,0.00008061312,0.00078751217,0.00010531444],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111424255,0.000052941017,0.000031615054,0.00010017111,0.00035118245,0.00013227157,0.004144748,0.08138276,0.000022892582,0.022826396,0.0024102603,0.88843334],"study_design_scores_gemma":[0.000917686,0.00014909999,0.0000019207303,0.00016195551,0.00010864615,0.0002613012,0.00076971774,0.14992678,0.00019975257,0.00024211165,0.84591484,0.0013461744],"about_ca_topic_score_codex":0.000030001438,"about_ca_topic_score_gemma":0.0000042646416,"teacher_disagreement_score":0.88708717,"about_ca_system_score_codex":0.00009912766,"about_ca_system_score_gemma":0.000056198867,"threshold_uncertainty_score":0.9997559},"labels":[],"label_agreement":null},{"id":"W1526757356","doi":"10.1007/11424918_6","title":"Multiagent Systems Viewed as Distributed Scheduling Systems: Methodology and Experiments","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Université Laval","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Multi-agent system; Two-level scheduling; Fair-share scheduling; Artificial intelligence; Mathematical optimization; Computer network; Mathematics","score_opus":0.041900276477206455,"score_gpt":0.2862282968172445,"score_spread":0.24432802034003803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526757356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003418574,0.0133061325,0.9816955,0.00003341395,0.0036047918,0.0003937084,0.000016100492,0.0002724652,0.00033606373],"genre_scores_gemma":[0.11425764,0.00053543714,0.88377225,0.00014535594,0.0009519015,0.000035673304,0.00004440994,0.00009207633,0.00016527591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790365,0.00005609672,0.0005101385,0.0006876525,0.00041456992,0.00042788067],"domain_scores_gemma":[0.9987705,0.0003595241,0.0001229527,0.00044074887,0.00013489393,0.00017140417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006969166,0.00043187648,0.0005804313,0.00039115583,0.00013044017,0.00028929653,0.0004629597,0.00037489418,0.000015036254],"category_scores_gemma":[0.00011891682,0.00041273335,0.00005359454,0.00021047199,0.0002283495,0.00013729709,0.0001748066,0.0004988248,0.000026203685],"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.0000023840053,0.00000520587,0.0000066692883,0.00008473652,0.000023485418,0.00001758035,0.00032273732,0.9719368,0.00009384752,0.00046510407,0.0000022814352,0.027039167],"study_design_scores_gemma":[0.00026270992,0.00003282519,0.00000579146,0.0004876501,0.000015015186,0.000083227555,0.0000031942932,0.9972776,0.00056838815,0.00019935836,0.0006439733,0.00042025145],"about_ca_topic_score_codex":0.000027432754,"about_ca_topic_score_gemma":0.0000030223239,"teacher_disagreement_score":0.113915786,"about_ca_system_score_codex":0.0002824005,"about_ca_system_score_gemma":0.000077302844,"threshold_uncertainty_score":0.99983245},"labels":[],"label_agreement":null},{"id":"W1528430574","doi":"10.1007/978-3-540-68262-2_10","title":"Transparent Admission Control and Scheduling of e-Commerce Web Services","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in business information processing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"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 Saskatchewan","funders":"","keywords":"Computer science; Interoperability; Web service; Common Object Request Broker Architecture; XML; World Wide Web; Web application; Middleware (distributed applications); Scheduling (production processes); SOAP; WS-Policy; Web development; Database; Web application security; Distributed computing","score_opus":0.010503872013651463,"score_gpt":0.2146318029487157,"score_spread":0.20412793093506423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528430574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025668023,0.010820747,0.97287405,0.00028361368,0.00041508343,0.0004300973,0.000041659496,0.00041650413,0.012151433],"genre_scores_gemma":[0.9613843,0.0034158952,0.03432923,0.00033204697,0.00012309763,0.00001317659,0.00026556625,0.000078506986,0.000058202462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986736,0.0000065741997,0.0007253161,0.00013978359,0.000273811,0.00018089065],"domain_scores_gemma":[0.99913967,0.000065923065,0.0002731725,0.00014441121,0.0003158985,0.000060930346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010356206,0.0003479846,0.0004521561,0.0004562387,0.00009032368,0.00007966013,0.00013780266,0.00044356767,0.000030122339],"category_scores_gemma":[0.000046426147,0.00033513756,0.00004177741,0.0001941604,0.000056419467,0.00075115624,0.000016341235,0.0003826603,0.0000043948885],"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.00002978001,0.000004830926,0.00007278934,0.0028304383,0.000019114741,0.0000013132243,0.0012621982,0.84683347,0.000039848994,0.000030585532,0.000001934082,0.14887373],"study_design_scores_gemma":[0.0009709668,0.000010734802,0.00020586934,0.0028207565,0.00004499355,0.000019760237,0.000022756245,0.9928273,0.00025666188,0.00017677732,0.002218923,0.00042453097],"about_ca_topic_score_codex":0.0000049924483,"about_ca_topic_score_gemma":0.000009550404,"teacher_disagreement_score":0.9588175,"about_ca_system_score_codex":0.00005453474,"about_ca_system_score_gemma":0.00009504601,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W1528580043","doi":"10.1007/0-387-22829-2_14","title":"Agent-Based Distributed Collaborative Monitoring and Maintenance in Manufacturing","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Scheduling (production processes); Predictive maintenance; Engineering; Software; Process (computing); Computer science; Systems engineering; Negotiation; Software engineering; Manufacturing engineering; Reliability engineering; Operations management; Operating system","score_opus":0.01088799245587971,"score_gpt":0.21294251843883483,"score_spread":0.20205452598295512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1528580043","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037992087,0.003961224,0.01854689,0.00028258705,0.0033520882,0.001327556,0.0005355465,0.0017679838,0.9664269],"genre_scores_gemma":[0.26074353,0.00051795336,0.03442696,0.00048662917,0.0031126782,0.000472625,0.0019252535,0.0014691236,0.69684523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99802125,0.00001887312,0.00059881865,0.00050595275,0.00034192193,0.0005131849],"domain_scores_gemma":[0.99920315,0.00009419456,0.00015242795,0.0002744182,0.0000951646,0.00018065299],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024359324,0.0005534963,0.0005008283,0.00043409012,0.00007354144,0.00027700054,0.00031838112,0.0010046257,0.00003069349],"category_scores_gemma":[0.000038101498,0.00060892076,0.000076261604,0.0000606384,0.0001207708,0.00032901802,0.00006518033,0.0018418797,0.000010141104],"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.00015508776,0.000030393758,0.0016079819,0.0010992568,0.00063193176,0.0004946049,0.0014807794,0.7931652,0.00026710317,0.0034310303,0.14328003,0.0543566],"study_design_scores_gemma":[0.008868642,0.00011186097,0.0018144093,0.0057546594,0.0003690402,0.000050403585,0.0007531737,0.17720634,0.013629768,0.008194894,0.77630246,0.0069443416],"about_ca_topic_score_codex":0.0000156784,"about_ca_topic_score_gemma":0.0000049932637,"teacher_disagreement_score":0.6330224,"about_ca_system_score_codex":0.00045356204,"about_ca_system_score_gemma":0.00009052517,"threshold_uncertainty_score":0.99963623},"labels":[],"label_agreement":null},{"id":"W1529851759","doi":"10.1007/11564751_55","title":"Multi-point Constructive Search","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Constructive; Backtracking; Computer science; Point (geometry); Set (abstract data type); Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics; Process (computing)","score_opus":0.01631828753033134,"score_gpt":0.24170766004717226,"score_spread":0.2253893725168409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529851759","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056629542,0.00039112175,0.9945812,0.000079807316,0.0011516012,0.00015608211,0.000007239503,0.00022819414,0.003348102],"genre_scores_gemma":[0.028674308,0.000060024697,0.9702965,0.00019906173,0.0004782603,0.000002709297,0.0000055206006,0.000043710552,0.00023987493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998674,0.000007364397,0.00023537796,0.0004037955,0.0003396193,0.00033989083],"domain_scores_gemma":[0.99926394,0.00012089698,0.000032506203,0.00035217215,0.0001255357,0.00010492062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002420942,0.00027625266,0.00025356477,0.00041418622,0.00008281023,0.00012371977,0.0004917309,0.00021834727,0.000099747405],"category_scores_gemma":[0.000026637405,0.00027032127,0.00005624969,0.00020883686,0.00043268068,0.00012962356,0.00013214425,0.0006630625,0.00007409141],"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":[7.1531815e-7,0.000002960554,0.0000066670873,0.0000094813895,0.000005579432,0.0000073779142,0.00034692712,0.73945284,0.000025024045,0.00018133383,0.000002087725,0.259959],"study_design_scores_gemma":[0.0001869888,0.00001685814,0.000020468959,0.00011789157,0.0000036613278,0.000032158307,5.215073e-7,0.99720985,0.0008838163,0.0010920436,0.00012359665,0.00031215977],"about_ca_topic_score_codex":0.0000037475488,"about_ca_topic_score_gemma":0.000015193168,"teacher_disagreement_score":0.25964686,"about_ca_system_score_codex":0.00022914658,"about_ca_system_score_gemma":0.00011803151,"threshold_uncertainty_score":0.9999749},"labels":[],"label_agreement":null},{"id":"W1534234205","doi":"10.1007/978-0-387-35613-6_27","title":"Managing Fault Monitoring and Recovery in Distributed Real-Time Control Systems","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"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":"Computer science; Distributed computing; Layering; Task (project management); Real-time computing; Decomposition; Cluster analysis; Control (management); Architecture; Embedded system; Engineering; Artificial intelligence; Systems engineering","score_opus":0.009338165536118324,"score_gpt":0.1926322740250066,"score_spread":0.18329410848888827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534234205","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023130505,0.0047414294,0.05726503,0.00006478158,0.0019034578,0.00063863915,0.00019638562,0.0015312091,0.93342775],"genre_scores_gemma":[0.037540186,0.03676876,0.020109529,0.00002548865,0.0019018003,0.00009506274,0.00045179555,0.00066171045,0.9024457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.000008556904,0.00036087108,0.00024466822,0.0001503289,0.0002215489],"domain_scores_gemma":[0.99954486,0.00008319361,0.00005311695,0.00019719274,0.000037246067,0.00008439558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000104890605,0.0002921104,0.00041285707,0.0002061954,0.000031818814,0.00010454087,0.000083552506,0.00029556014,0.00011588397],"category_scores_gemma":[0.000010221176,0.00031173983,0.00004911242,0.00003939899,0.000015288035,0.00008675994,0.00001737343,0.00027016728,0.00009023501],"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.000005970079,0.000003764619,0.000042198833,0.00015836822,0.00011913154,0.000052057927,0.000031353207,0.99400526,0.000019706362,0.001087142,0.00044331505,0.0040317383],"study_design_scores_gemma":[0.0005467175,0.000014024076,0.000024307885,0.0005586379,0.000038072303,0.000012877581,0.000019900333,0.9964423,0.000009562513,0.00016249613,0.0017421506,0.00042895155],"about_ca_topic_score_codex":0.00003690147,"about_ca_topic_score_gemma":8.3116436e-7,"teacher_disagreement_score":0.037308883,"about_ca_system_score_codex":0.00014247393,"about_ca_system_score_gemma":0.0000048889146,"threshold_uncertainty_score":0.9999335},"labels":[],"label_agreement":null},{"id":"W1537572029","doi":"10.1109/icsmc.2003.1244578","title":"Agent-based collaborative project management system for distributed manufacturing","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Innovation Council; National Research Council Canada","funders":"","keywords":"Computer science; Schedule; Multi-agent system; Scheduling (production processes); Systems engineering; Project management; Concurrent engineering; Software engineering; Distributed manufacturing; Distributed computing; Engineering; Manufacturing engineering; Operating system","score_opus":0.011160088213824236,"score_gpt":0.22922459900965128,"score_spread":0.21806451079582703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537572029","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035335151,0.000039942926,0.99208677,0.00004028264,0.00031574155,0.0006637142,0.00008392592,0.00094918406,0.002286953],"genre_scores_gemma":[0.4879923,0.000005271933,0.51123977,0.000029315339,0.000049516468,0.0002653937,0.00020093122,0.000033076893,0.00018443783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994629,0.000005464174,0.00014129303,0.0001283678,0.00009094474,0.00017103746],"domain_scores_gemma":[0.9997729,0.000014863141,0.000017552853,0.000118503194,0.000039591585,0.000036559337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005714328,0.00011412428,0.0001021531,0.000073859104,0.00006552574,0.00004996603,0.00007161396,0.000038701222,0.000006982688],"category_scores_gemma":[0.0000032752207,0.00010482379,0.00003656118,0.00016962622,0.000007165113,0.000045051944,0.0000073428555,0.000034712895,0.000016499025],"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.000008248699,0.0000120167,0.00000264768,0.00023092904,0.000050117542,0.000005043153,0.00004639562,0.99776727,0.000011309947,0.00086089596,0.0002878127,0.0007173309],"study_design_scores_gemma":[0.003911046,0.00005625711,0.000074739844,0.00015776283,0.0000624238,0.0000022992242,0.002725907,0.8272633,0.1586796,0.00003692899,0.006603406,0.00042632848],"about_ca_topic_score_codex":0.0000056963995,"about_ca_topic_score_gemma":0.0000035794137,"teacher_disagreement_score":0.48445877,"about_ca_system_score_codex":0.00021024125,"about_ca_system_score_gemma":0.000017594743,"threshold_uncertainty_score":0.42745903},"labels":[],"label_agreement":null},{"id":"W1547846433","doi":"10.5772/36225","title":"Hybrid Genetic Algorithms for the Single Machine Scheduling Problem with Sequence-Dependent Setup Times","year":2012,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Tardiness; Automotive industry; Scheduling (production processes); Sequence (biology); Job shop scheduling; Computer science; Due date; Algorithm; Industrial engineering; Engineering; Mathematical optimization; Mathematics; Schedule; Operating system","score_opus":0.02783322681805876,"score_gpt":0.23110519047071115,"score_spread":0.2032719636526524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547846433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003069883,0.005764706,0.88820225,0.00007301404,0.0007585621,0.0015068407,0.00026061793,0.0010860316,0.1023173],"genre_scores_gemma":[0.03074808,0.0002945115,0.7380135,0.00020266384,0.0014843544,0.0005296619,0.00019728429,0.00081506884,0.22771487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982527,0.000009849888,0.00047045707,0.00039931608,0.00037499858,0.0004926641],"domain_scores_gemma":[0.9987997,0.000156363,0.0001568229,0.0005540075,0.00018867113,0.00014445395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021716485,0.0005945185,0.00042318495,0.0001638821,0.00018320557,0.00014563512,0.0004475156,0.00027134162,0.00019560548],"category_scores_gemma":[0.000012892704,0.0004332796,0.00016807423,0.000018299706,0.00014179132,0.000055113964,0.00007428885,0.0006801353,0.000089379406],"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.000119136406,0.00006358895,0.000006992727,0.0008158674,0.0022811664,0.000107597305,0.0009568186,0.16367458,0.004727839,0.004022631,0.00040958083,0.8228142],"study_design_scores_gemma":[0.002228093,0.0006775187,0.0000012700089,0.002019776,0.0013787678,0.001063268,0.00012068428,0.70497364,0.120213725,0.013068945,0.15073295,0.0035213514],"about_ca_topic_score_codex":0.000012346799,"about_ca_topic_score_gemma":0.000012026928,"teacher_disagreement_score":0.81929284,"about_ca_system_score_codex":0.0001792778,"about_ca_system_score_gemma":0.000071179595,"threshold_uncertainty_score":0.9998119},"labels":[],"label_agreement":null},{"id":"W1555698644","doi":"","title":"BEST PAPER / MEILLEURE COMMUNICATION: L'Ordonnancement Multicritère de la Production : Une Approche Métaheuristique Intégrant les Préférences du Gestionnaire","year":2009,"lang":"fr","type":"article","venue":"ASAC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Laurentian University","funders":"","keywords":"Political science; Humanities; Philosophy","score_opus":0.009359585277944664,"score_gpt":0.24731798188908072,"score_spread":0.23795839661113605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555698644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10864854,0.14398949,0.4310711,0.2946201,0.004477725,0.0018062957,0.00004126142,0.0015840048,0.013761476],"genre_scores_gemma":[0.68141603,0.017023785,0.29627284,0.0002609398,0.00075795624,0.00008299277,0.000065517015,0.000047692152,0.0040722587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840564,0.00028410286,0.00040893524,0.0003358861,0.00022739764,0.00033805822],"domain_scores_gemma":[0.9989346,0.0001220213,0.000108302025,0.0004905784,0.0002219517,0.0001225108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058548903,0.00029556782,0.00024128245,0.00007879278,0.0003737767,0.00012296133,0.00028129146,0.0003186465,0.000112345246],"category_scores_gemma":[0.00038635952,0.0003138517,0.00008118926,0.00044182883,0.0002297988,0.00029760096,0.000034977496,0.0005563631,0.000058329086],"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.000028084314,0.00072570285,0.0014350277,0.00026542676,0.00010710407,0.000020277781,0.011568091,0.58301747,0.00071224174,0.007147098,0.008776686,0.3861968],"study_design_scores_gemma":[0.0022090164,0.00044718455,0.023063814,0.0038630445,0.00043751244,0.00041030152,0.0088766785,0.70793223,0.006119323,0.005233209,0.23953463,0.0018730656],"about_ca_topic_score_codex":0.00052106776,"about_ca_topic_score_gemma":0.00009544809,"teacher_disagreement_score":0.5727675,"about_ca_system_score_codex":0.00017694637,"about_ca_system_score_gemma":0.00008695939,"threshold_uncertainty_score":0.99993134},"labels":[],"label_agreement":null},{"id":"W1555949537","doi":"","title":"Towards an adaptive approach for distributed resource allocation in a multi-agent system for solving dynamic vehicle routing problems","year":2007,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Vehicle routing problem; Distributed computing; Multi-agent system; Autonomous agent; Dynamic decision-making; Resource allocation; Scheduling (production processes); Operations research; Routing (electronic design automation); Mathematical optimization; Artificial intelligence; Engineering","score_opus":0.027962043024711204,"score_gpt":0.252837202092827,"score_spread":0.2248751590681158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555949537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013287675,0.000056229946,0.9847683,0.000012444497,0.00008279784,0.0010388718,0.000030632178,0.0005192557,0.00020380749],"genre_scores_gemma":[0.5918556,6.199122e-7,0.4076807,0.0000055291125,0.00002413823,0.0001311296,0.00024832156,0.000028510112,0.000025482232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895936,0.000013032055,0.00034918476,0.0002378264,0.00010054789,0.00034002695],"domain_scores_gemma":[0.99957633,0.00006402695,0.00004864044,0.00013840215,0.00009501809,0.000077583536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008311684,0.00014178218,0.00016049414,0.000099317615,0.000089970665,0.00004733448,0.00010870619,0.0001082035,7.2760804e-7],"category_scores_gemma":[0.000056410718,0.0001438461,0.000047786085,0.00022690394,0.0000094005745,0.000118492644,0.0000131706365,0.000087379645,6.624175e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026956308,0.000050766972,0.00006717867,0.0001602253,0.000017162269,2.6958293e-7,0.00076688046,0.9930635,0.0006818092,0.000386767,0.0000040296513,0.004774471],"study_design_scores_gemma":[0.0011079168,0.000052962547,0.00035281503,0.00005793949,0.0000117120835,0.0000016524741,0.0050668037,0.99165154,0.0014878082,0.0000045209486,0.000019938725,0.00018436642],"about_ca_topic_score_codex":0.000042082556,"about_ca_topic_score_gemma":0.00007554537,"teacher_disagreement_score":0.5785679,"about_ca_system_score_codex":0.00037354752,"about_ca_system_score_gemma":0.000016845413,"threshold_uncertainty_score":0.5865874},"labels":[],"label_agreement":null},{"id":"W155647738","doi":"","title":"ANALYSIS OF GROWTH AT COMPANY A THROUGH CLOUD COMPUTING","year":2011,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cloud computing; Business; Computer science; Operating system","score_opus":0.018401471115748344,"score_gpt":0.19795416735627608,"score_spread":0.17955269624052772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155647738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86869526,0.00008350433,0.103030846,0.0000081166445,0.00026824628,0.00006532257,0.000026746186,0.00032702443,0.027494919],"genre_scores_gemma":[0.9825194,0.00005067549,0.017089235,0.000020422101,0.00002396155,6.272825e-8,0.000031495932,0.000015239252,0.00024950164],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993617,0.000028541263,0.0001491335,0.00016519298,0.000117488045,0.00017796751],"domain_scores_gemma":[0.9995498,0.00004099518,0.000055652607,0.00019897505,0.00008703884,0.000067511384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053720323,0.00012480213,0.0002580258,0.00031098875,0.00007863661,0.0000062924387,0.00022387822,0.00007916938,0.00026962633],"category_scores_gemma":[0.000008509891,0.00014804598,0.00014812495,0.0017373271,0.00005394319,0.00012155348,0.00006694094,0.0000971429,0.000024557392],"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.00003945726,0.00007475237,0.7968758,0.000043304153,0.001463354,0.0000467604,0.0005699357,0.19669782,0.0000062183663,0.0025441903,0.00137646,0.00026197536],"study_design_scores_gemma":[0.001262513,0.000053560543,0.012736184,0.000041358227,0.0016629596,9.815067e-9,0.0118971,0.9598366,0.0071247867,0.00008093058,0.004701135,0.000602851],"about_ca_topic_score_codex":0.00013609992,"about_ca_topic_score_gemma":0.0018050225,"teacher_disagreement_score":0.7841396,"about_ca_system_score_codex":0.00008226601,"about_ca_system_score_gemma":0.0000084561425,"threshold_uncertainty_score":0.603714},"labels":[],"label_agreement":null},{"id":"W1556504363","doi":"10.3233/ica-2002-9306","title":"A reconfigurable concurrent function block model and its implementation in real-time Java","year":2002,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Athabasca University; University of Calgary","funders":"","keywords":"Java; Computer science; Block (permutation group theory); Function (biology); Programming language; Mathematics","score_opus":0.014728597964710178,"score_gpt":0.2166736728100674,"score_spread":0.20194507484535723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556504363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5886675,0.0009506414,0.40617386,0.000059805454,0.0010869459,0.00040656835,0.000022293541,0.0017286416,0.00090373773],"genre_scores_gemma":[0.975573,0.000378374,0.02369311,0.000019259482,0.00009197098,0.00003898976,0.000049248712,0.000058663078,0.00009736827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989913,0.000014285263,0.00036009034,0.00023262131,0.00010865532,0.00029302898],"domain_scores_gemma":[0.9996596,0.0000393737,0.000030645177,0.00011100398,0.00006334222,0.00009603189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010142349,0.00023451418,0.0002182854,0.00027343206,0.000031697626,0.00007657233,0.00008290415,0.00009944652,0.00010587176],"category_scores_gemma":[0.000008750915,0.00025972855,0.000033715183,0.00035656002,0.0000053606977,0.00021372503,0.000011913991,0.00023466385,0.000046027708],"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.0000016988133,0.000012236043,0.000010764308,0.000030874307,0.000027522972,0.000003404112,0.00023693702,0.9769735,0.0053657894,0.00012370248,0.00032515492,0.01688845],"study_design_scores_gemma":[0.00061464973,0.000043463322,0.00009338052,0.000093518676,0.0000124030885,0.000013936565,0.000031897398,0.99651533,0.0021898702,0.000012483832,0.00011577115,0.00026327022],"about_ca_topic_score_codex":0.000024538676,"about_ca_topic_score_gemma":0.000006476796,"teacher_disagreement_score":0.3869055,"about_ca_system_score_codex":0.00012649517,"about_ca_system_score_gemma":0.000007960174,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W1558369927","doi":"10.1023/a:1024042209719","title":"Scheduling and Lot Streaming in Flowshops with No-Wait in Process","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; McMaster University; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Travelling salesman problem; Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Schedule; Heuristic; Product (mathematics); Heuristics; Algorithm; Mathematics; Artificial intelligence","score_opus":0.00810058617292611,"score_gpt":0.22260195353021106,"score_spread":0.21450136735728495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558369927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9713647,0.0013652825,0.02624951,0.000036316225,0.00022455845,0.00008010173,4.8866457e-7,0.00003391795,0.0006451383],"genre_scores_gemma":[0.74573106,0.00013961011,0.25398365,0.000019476565,0.00008513711,0.0000022630088,4.536547e-7,0.000031759868,0.0000065843565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868965,0.00003628658,0.0005761772,0.00014791788,0.00025286363,0.00029711414],"domain_scores_gemma":[0.999405,0.00008405724,0.00012901696,0.00009046244,0.00016767952,0.00012375935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006706703,0.00018909,0.00033578725,0.00045207294,0.000039293307,0.00007672951,0.00011132643,0.0001031235,0.000018706385],"category_scores_gemma":[0.00027880847,0.00016867022,0.000033991495,0.0005484766,0.000028617713,0.00042780465,0.000008267139,0.00060650724,0.0000032839555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027458877,0.00003618901,0.02412912,0.00009261685,0.000021527138,0.00007645238,0.000709335,0.9730736,0.00043536542,0.000055101158,4.667266e-7,0.0013427724],"study_design_scores_gemma":[0.0030155173,0.00012805697,0.0025854285,0.0014401461,0.000026915894,0.00033738802,0.0039573545,0.98432076,0.0035508208,0.00018385403,0.00003115009,0.0004226028],"about_ca_topic_score_codex":0.000003916173,"about_ca_topic_score_gemma":0.00001996234,"teacher_disagreement_score":0.22773413,"about_ca_system_score_codex":0.00008556719,"about_ca_system_score_gemma":0.00008964613,"threshold_uncertainty_score":0.68781716},"labels":[],"label_agreement":null},{"id":"W1559704034","doi":"10.1007/978-3-642-12433-4_31","title":"Sandbox for Development of Evolving Manufacturing Control Architectures","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in intelligent and soft computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Windsor","funders":"","keywords":"Sandbox (software development); Hierarchical control system; Rapid prototyping; Computer science; Variety (cybernetics); Systems engineering; Control (management); Engineering; Distributed computing; Software engineering; Artificial intelligence; Mechanical engineering","score_opus":0.009929399518405642,"score_gpt":0.24015190645882847,"score_spread":0.23022250694042284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559704034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063049113,0.0134153,0.9707822,0.0000050961194,0.000744581,0.0003824363,0.000005817731,0.000092804315,0.0082668355],"genre_scores_gemma":[0.62420636,0.0006759602,0.3741675,0.000018459705,0.0002103001,0.000012811711,0.000019216392,0.000086909255,0.00060246175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989312,0.0000039843508,0.00054093584,0.00021388539,0.00010317754,0.00020679983],"domain_scores_gemma":[0.9993427,0.00039075097,0.00010317532,0.0000927141,0.000033920078,0.00003676437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020597636,0.00023242901,0.0003709884,0.00025327527,0.000050277034,0.000018088424,0.00011383258,0.00016470923,0.000018890316],"category_scores_gemma":[0.0000406117,0.00023907794,0.000052142383,0.00001848516,0.000040886207,0.00003365376,0.000030109344,0.00038331887,8.681428e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013527883,0.0000054928196,0.00014084051,0.0003694773,0.000027236993,0.0000019871834,0.0011495705,0.5796136,0.00003099602,0.00055124325,7.342057e-7,0.41809523],"study_design_scores_gemma":[0.00070083624,0.000022913815,0.00009622504,0.0017317634,0.000018242508,0.0000052672417,0.000079802,0.96489406,0.010577878,0.008594613,0.012644144,0.00063426635],"about_ca_topic_score_codex":9.3021725e-7,"about_ca_topic_score_gemma":0.000042523123,"teacher_disagreement_score":0.61790144,"about_ca_system_score_codex":0.000040103063,"about_ca_system_score_gemma":0.000017136534,"threshold_uncertainty_score":0.97493154},"labels":[],"label_agreement":null},{"id":"W1564681331","doi":"10.5772/5222","title":"Solving a Multi-Objective No-Wait Flow Shop Problem by a Hybrid Multi-Objective Immune Algorithm","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Flow shop scheduling; Job shop scheduling; Computer science; Scheduling (production processes); Operations research; Mathematical optimization; Industrial engineering; Mathematics; Engineering; Schedule","score_opus":0.015030043476582291,"score_gpt":0.22923162912772346,"score_spread":0.21420158565114117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564681331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026561236,0.0031957256,0.7761645,0.000011979904,0.0013002513,0.0011020029,0.00039717628,0.0018070964,0.21601866],"genre_scores_gemma":[0.00006941703,0.00071145146,0.69963914,0.00009087974,0.00043467362,0.0000863922,0.000526798,0.000493814,0.29794744],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610823,0.000030152349,0.0011231689,0.0011077253,0.00063562393,0.0009950921],"domain_scores_gemma":[0.99773425,0.00020372013,0.00025917724,0.00070705166,0.0007356195,0.00036018647],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0004640969,0.0013389887,0.0011688998,0.0006206327,0.00026038341,0.00019199347,0.0004938801,0.00087041315,0.0012977166],"category_scores_gemma":[0.00008215514,0.0014052169,0.0005188894,0.00016415157,0.00014829595,0.00030257046,0.0001767825,0.0016865357,0.001170698],"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.00018284608,0.0008662557,0.000019339057,0.0009851459,0.0067156306,0.00072368456,0.004895357,0.33889085,0.0010612902,0.001106899,0.015675759,0.6288769],"study_design_scores_gemma":[0.0020074625,0.00009709319,0.000004593417,0.00050559256,0.00015215826,0.000066119486,0.00014075331,0.98461944,0.0019807462,0.00008281884,0.008577187,0.0017660478],"about_ca_topic_score_codex":0.00010723633,"about_ca_topic_score_gemma":0.000046840705,"teacher_disagreement_score":0.6457286,"about_ca_system_score_codex":0.0006945312,"about_ca_system_score_gemma":0.00012633874,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W1565098934","doi":"10.1007/978-3-540-24749-4_16","title":"On Minimizing the Total Weighted Tardiness on a Single Machine","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"McMaster University","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Bounded function; Mathematical optimization; Due date; Schedule; Set (abstract data type); Single-machine scheduling; Value (mathematics); Algorithm; Randomized algorithm; Job shop scheduling; Mathematics; Machine learning","score_opus":0.010607506777611143,"score_gpt":0.20728305795002172,"score_spread":0.1966755511724106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565098934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044043938,0.00030809367,0.99104923,0.00033813174,0.002210228,0.00018426882,0.0000075932135,0.0002355297,0.0052264915],"genre_scores_gemma":[0.6021063,0.000044939025,0.39436272,0.001646553,0.0012393756,0.000012403088,0.000028635153,0.00015095125,0.00040816446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985183,0.000009155885,0.00023101264,0.0004661774,0.00046802955,0.00030733124],"domain_scores_gemma":[0.9990581,0.0002952316,0.000054390206,0.0004667402,0.000058228234,0.00006727394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001907155,0.00034506436,0.00025341168,0.00032532786,0.00015286899,0.0001297838,0.0005361422,0.00018081488,0.00005348941],"category_scores_gemma":[0.00004240331,0.0002468895,0.00007699735,0.00028731822,0.00019277523,0.000063732055,0.00008495189,0.00065482233,0.000039466642],"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.000004647766,0.000010895388,5.1772025e-7,0.000010440955,0.0000073046563,0.000015357295,0.00018148373,0.92183995,0.000024705327,0.0011910737,0.000006357841,0.07670724],"study_design_scores_gemma":[0.00024236165,0.00010506626,0.0000115179155,0.00039635133,0.0000067571705,0.000021598633,1.4336474e-7,0.9864699,0.0013045915,0.01102349,0.00008283572,0.00033534033],"about_ca_topic_score_codex":0.0000051311094,"about_ca_topic_score_gemma":0.0000052433616,"teacher_disagreement_score":0.60166585,"about_ca_system_score_codex":0.00026525394,"about_ca_system_score_gemma":0.00006455485,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W1571472016","doi":"10.1007/978-3-642-13520-0_23","title":"Automated Configuration of Mixed Integer Programming Solvers","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":152,"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; Parameterized complexity; Integer programming; Domain (mathematical analysis); Integer (computer science); Process (computing); Linear programming; Mathematical optimization; Algorithm; Programming language; Mathematics","score_opus":0.010024461372100958,"score_gpt":0.22529298347494742,"score_spread":0.21526852210284647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571472016","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017076542,0.000081451726,0.99623644,0.000031170985,0.0019198686,0.00017165866,0.0000027218477,0.0005392713,0.0008466569],"genre_scores_gemma":[0.20361683,0.000013059363,0.7960145,0.00004627573,0.00018282945,0.000004714892,0.00002204158,0.000040471557,0.000059292517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998851,0.000005363026,0.0003065313,0.00030849664,0.00030781823,0.00022080728],"domain_scores_gemma":[0.9992903,0.00009864939,0.00009326434,0.00028985954,0.00016807708,0.000059884038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024107921,0.0002235283,0.00025086885,0.0003669611,0.000053848045,0.000089053756,0.00036602406,0.0002967337,0.000036812107],"category_scores_gemma":[0.000052228024,0.00021443101,0.000053072352,0.00022460138,0.00037987562,0.00011351611,0.000050445866,0.00051270466,0.000010791379],"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.0000013274841,0.000004629832,0.000005744395,0.000036828354,0.000008266822,0.0000037268624,0.0002851593,0.77312756,0.0007049234,0.00026857867,0.000003576361,0.2255497],"study_design_scores_gemma":[0.00011697591,0.000026136313,0.000011930936,0.00016353013,0.000006626455,0.0000067940164,2.7244263e-7,0.9822432,0.016187647,0.0007714104,0.0002411671,0.0002243314],"about_ca_topic_score_codex":0.0000042827114,"about_ca_topic_score_gemma":0.000017825765,"teacher_disagreement_score":0.22532536,"about_ca_system_score_codex":0.00006795743,"about_ca_system_score_gemma":0.00009490189,"threshold_uncertainty_score":0.8744243},"labels":[],"label_agreement":null},{"id":"W1575064726","doi":"10.1023/a:1012244218961","title":"A simulation optimization approach in production planning of failure prone manufacturing systems","year":2001,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Time horizon; Exponential function; Computer science; Production (economics); Markov chain; Parameterized complexity; Inventory control; Optimal control; Markov process; Production control; Point (geometry); Engineering; Operations research; Mathematics; Algorithm; Economics; Statistics","score_opus":0.021764290934367186,"score_gpt":0.24518395419519348,"score_spread":0.2234196632608263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575064726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39983457,0.00037108824,0.5989142,0.00001351407,0.00049451226,0.00017165665,4.383639e-7,0.000044052023,0.00015592751],"genre_scores_gemma":[0.93013275,0.0001541936,0.069356784,0.0000028285854,0.00027749327,0.000004640795,0.000006092495,0.00003484011,0.000030354598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834985,0.000045547167,0.00090917636,0.00014550531,0.00033538486,0.00021456763],"domain_scores_gemma":[0.9992411,0.00006710997,0.0003661555,0.00014373644,0.000114017006,0.00006784684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047994824,0.00018726829,0.00032927794,0.0006273153,0.000039198196,0.000054251068,0.00015075864,0.000114613744,0.000017388831],"category_scores_gemma":[0.000064731285,0.00017490181,0.00008153967,0.00017531545,0.000016025717,0.0004313313,0.000016973501,0.0003417756,0.0000013082023],"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.000041501127,0.000049552767,0.00045938714,0.0001844036,0.00004797248,0.000011439742,0.0007118422,0.99596226,0.00014093182,0.0000025037768,0.000007929068,0.0023802996],"study_design_scores_gemma":[0.00024042242,0.000032164513,0.00028402355,0.00038333918,0.000021005002,0.000089306785,0.0010176632,0.9316961,0.06600877,0.0000064051605,0.00006574716,0.00015502432],"about_ca_topic_score_codex":0.0000052407026,"about_ca_topic_score_gemma":6.2996907e-7,"teacher_disagreement_score":0.5302982,"about_ca_system_score_codex":0.00018717287,"about_ca_system_score_gemma":0.000016389178,"threshold_uncertainty_score":0.71322894},"labels":[],"label_agreement":null},{"id":"W1575325983","doi":"","title":"Shop scheduling in manufacturing systems: algorithms and complexity","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Reentrancy; Flow shop scheduling; Travelling salesman problem; Scheduling (production processes); Computer science; Algorithm; Mathematical optimization; Cellular manufacturing; Time complexity; Job shop; Flexible manufacturing system; Minification; Computational complexity theory; Artificial intelligence; Mathematics; Schedule","score_opus":0.022676461204033545,"score_gpt":0.2501277646010478,"score_spread":0.22745130339701425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575325983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720971,0.011361065,0.059196167,0.00003876912,0.0067100762,0.001184893,0.000045394634,0.0023154537,0.047051087],"genre_scores_gemma":[0.7186353,0.0014758785,0.27183175,0.000033275635,0.00053344923,0.0001321245,0.0018315923,0.00032640147,0.005200231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987454,0.000016235745,0.00042660683,0.00031496567,0.00020114999,0.0002956327],"domain_scores_gemma":[0.99960494,0.000032250762,0.000052338906,0.00017419919,0.000036569672,0.00009967339],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013850526,0.00033809553,0.0004025654,0.0003296462,0.000060857066,0.00014588701,0.00012472877,0.00035752245,0.000059348975],"category_scores_gemma":[0.000014705572,0.00036091203,0.000045997833,0.00013646983,0.000019291423,0.00012027344,0.000012379597,0.00047525784,0.000024541849],"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.000005828638,0.000013808439,0.000043102333,0.00076610234,0.000041492876,0.000015826454,0.00053588324,0.9947614,0.000018169656,0.00050689327,0.000008940598,0.0032825384],"study_design_scores_gemma":[0.00062647247,0.000010795655,0.001081152,0.0007272375,0.000025221654,0.0000132146415,0.0032416948,0.99153024,0.0018378397,0.000245682,0.000066354805,0.00059410237],"about_ca_topic_score_codex":0.00021723354,"about_ca_topic_score_gemma":0.00029014656,"teacher_disagreement_score":0.21263558,"about_ca_system_score_codex":0.00016902154,"about_ca_system_score_gemma":0.000038139344,"threshold_uncertainty_score":0.9998843},"labels":[],"label_agreement":null},{"id":"W1579494035","doi":"10.1007/978-3-642-02882-3_24","title":"An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"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; Due date; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Computer science; Retard; Mathematics; Medicine; Schedule; Operating system","score_opus":0.008460572796893736,"score_gpt":0.22713091961174045,"score_spread":0.2186703468148467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579494035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078067335,0.00013475576,0.9974636,0.000100283396,0.0003935993,0.00040304053,0.000026532474,0.000119402284,0.0005781107],"genre_scores_gemma":[0.15478338,0.000008617427,0.8445042,0.0000837967,0.00035649538,0.000019554316,0.000045320525,0.000049438167,0.00014924178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987249,0.0000075445782,0.00027033142,0.00041455613,0.0003123907,0.0002703153],"domain_scores_gemma":[0.99891245,0.00028292858,0.00009206517,0.0004558879,0.00019339749,0.00006326804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020305162,0.000295318,0.0003219816,0.000122924,0.000106395804,0.00011706648,0.000591046,0.00014306529,0.000022067767],"category_scores_gemma":[0.000017838807,0.00019236542,0.000056262008,0.00025697105,0.00026300942,0.0001351216,0.000046932822,0.00025586245,0.0000022564618],"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.000016745043,0.000015292353,0.000049821418,0.000054026263,0.000023636003,0.0000057033512,0.0002618411,0.8384499,0.000032637316,0.00029461164,0.000009973205,0.16078581],"study_design_scores_gemma":[0.00028007978,0.00010168929,0.00014990314,0.00019979235,0.0000244985,0.00004779481,4.8138276e-7,0.9954673,0.0007258243,0.0025772639,0.00012647339,0.00029887742],"about_ca_topic_score_codex":0.0000069873113,"about_ca_topic_score_gemma":0.000021544813,"teacher_disagreement_score":0.16048694,"about_ca_system_score_codex":0.00004495607,"about_ca_system_score_gemma":0.00008595576,"threshold_uncertainty_score":0.7844434},"labels":[],"label_agreement":null},{"id":"W1580125762","doi":"10.1007/978-3-540-69733-6_65","title":"A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 New Brunswick","funders":"","keywords":"Job shop scheduling; Upper and lower bounds; Norm (philosophy); Scheduling (production processes); Computer science; Regular polygon; Mathematical optimization; Competitive analysis; Combinatorics; Algorithm; Discrete mathematics; Mathematics","score_opus":0.01794009135289408,"score_gpt":0.23399008508269104,"score_spread":0.21604999372979694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580125762","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010410447,0.0009540523,0.9957516,0.00024516808,0.0011838241,0.000462466,0.000016830216,0.0001649505,0.001116993],"genre_scores_gemma":[0.08042162,0.00025972645,0.91660875,0.00097268674,0.001079832,0.000039930244,0.00001949552,0.00012282112,0.00047515848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984719,0.0000043855925,0.00023380636,0.000512035,0.00042440425,0.00035343895],"domain_scores_gemma":[0.99865466,0.00055402395,0.00007151107,0.00048880046,0.00015591715,0.00007511305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022447555,0.0003744703,0.00028300798,0.0002442312,0.0002715462,0.00014476244,0.0006233298,0.0001701178,0.000018905072],"category_scores_gemma":[0.000049464914,0.00024598176,0.00007605952,0.00024041852,0.0004289602,0.000097331904,0.000074844844,0.0006131368,0.0000136738345],"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.000022037975,0.000008638437,0.000003293373,0.000015824166,0.0000233246,0.000011168786,0.0002737574,0.94518316,0.0000022752974,0.00013422915,0.000008137183,0.05431417],"study_design_scores_gemma":[0.00035133786,0.0002379375,0.000008086339,0.00023924444,0.000014429558,0.00003516599,2.2622422e-7,0.9969341,0.00026147757,0.0008712684,0.000705824,0.00034091008],"about_ca_topic_score_codex":0.000004576463,"about_ca_topic_score_gemma":0.000037303325,"teacher_disagreement_score":0.08031752,"about_ca_system_score_codex":0.00014110596,"about_ca_system_score_gemma":0.00013074139,"threshold_uncertainty_score":0.9999992},"labels":[],"label_agreement":null},{"id":"W159073123","doi":"10.1023/a:1008926202597","title":"Enhancing the performance of an agent-based manufacturing system through learning and forecasting","year":2000,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Computer science; Key (lock); Production (economics); Multi-agent system; Artificial intelligence; Systems engineering; Industrial engineering; Engineering","score_opus":0.014261911481873828,"score_gpt":0.2216751615191161,"score_spread":0.20741325003724226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W159073123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697151,0.0004726281,0.028841687,0.000012892704,0.0003033355,0.00008479639,7.1325604e-7,0.00007676973,0.0004920852],"genre_scores_gemma":[0.97690296,0.00030595038,0.022478186,0.000016359962,0.00019848421,0.0000018660869,0.0000013537037,0.00003867421,0.00005618208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842626,0.0000619325,0.0008188515,0.00012383751,0.00031014168,0.0002589951],"domain_scores_gemma":[0.99926734,0.00016739535,0.0002837922,0.0001376982,0.000057159417,0.000086618435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063765637,0.00020184103,0.00030973932,0.00012484976,0.00018577755,0.00007896977,0.00021213228,0.00007065935,0.00010185417],"category_scores_gemma":[0.000022314367,0.00014917778,0.0001066283,0.00006595576,0.000037502414,0.00034634717,0.000017890066,0.00047506543,0.000005092109],"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.000033006712,0.0000097167385,0.00010522956,0.000279036,0.000049391558,0.000010849834,0.00070373475,0.932452,0.0006904291,0.0000023628625,0.0000010688445,0.06566313],"study_design_scores_gemma":[0.00018351132,0.00008346305,0.00019465665,0.00042867876,0.000028182487,0.00013231322,0.0010505073,0.34221342,0.65528125,0.0000023712603,0.00027789522,0.0001237612],"about_ca_topic_score_codex":0.000009213777,"about_ca_topic_score_gemma":0.0000024233836,"teacher_disagreement_score":0.6545908,"about_ca_system_score_codex":0.00009314982,"about_ca_system_score_gemma":0.000017810622,"threshold_uncertainty_score":0.60832936},"labels":[],"label_agreement":null},{"id":"W1590964024","doi":"10.1016/j.apm.2013.03.043","title":"Learning effects and the phenomenon of moving bottlenecks in a two-stage production system","year":2013,"lang":"en","type":"preprint","venue":"Applied Mathematical Modelling","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":"Toronto Metropolitan University","funders":"","keywords":"Forgetting; Bottleneck; Production (economics); Learning effect; Position (finance); Stage (stratigraphy); Computer science; Artificial intelligence; Simulation; Operations management; Engineering; Economics; Cognitive psychology; Psychology; Microeconomics","score_opus":0.010722585901233346,"score_gpt":0.21165426627244271,"score_spread":0.20093168037120937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590964024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19830875,0.00038335845,0.7950871,0.000012752456,0.00014641845,0.0009900715,6.375217e-7,0.00025160614,0.0048193056],"genre_scores_gemma":[0.8516601,0.00008138495,0.14774519,0.0000027170631,0.000081133476,0.0003243156,0.000004559984,0.00005868846,0.00004192021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986658,0.000053018433,0.0005383121,0.00030688196,0.00020819933,0.00022780705],"domain_scores_gemma":[0.99910915,0.00036711612,0.00013834918,0.0003004654,0.000035664285,0.00004923868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073039706,0.00026325256,0.0005890219,0.00012491972,0.000054644926,0.00006755975,0.00014555655,0.00014589696,0.000005231212],"category_scores_gemma":[0.000051833074,0.00020533844,0.000054931974,0.00011628817,0.000074145435,0.00003786244,0.00014114076,0.00073671684,0.000013859918],"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.000009526072,0.00001295682,0.0000015422279,0.005366553,0.000035285913,5.142255e-7,0.0023010822,0.94571906,0.0001126208,0.045731418,4.050477e-7,0.000709046],"study_design_scores_gemma":[0.0005540521,0.000003921606,4.393241e-7,0.00097289414,0.000046438225,0.000001754047,0.00069667783,0.98196936,0.0006707642,0.014894996,7.885991e-7,0.00018790268],"about_ca_topic_score_codex":0.00001851685,"about_ca_topic_score_gemma":3.739795e-7,"teacher_disagreement_score":0.6533513,"about_ca_system_score_codex":0.000073433985,"about_ca_system_score_gemma":0.000013532224,"threshold_uncertainty_score":0.83734584},"labels":[],"label_agreement":null},{"id":"W1591905644","doi":"10.1002/0471739383.ch19","title":"Parallel Metaheuristics Applications","year":2005,"lang":"en","type":"other","venue":"","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Metaheuristic; Computer science; Artificial intelligence","score_opus":0.009009833178774783,"score_gpt":0.2248822518553337,"score_spread":0.2158724186765589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591905644","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.212732e-9,0.0009738114,0.48463818,0.000009519114,0.00008047539,0.00006902945,0.000010224214,0.0010345153,0.51318425],"genre_scores_gemma":[0.0000011994531,0.00048662914,0.43986946,0.00003015038,0.0004084454,0.000042720792,0.000045649147,0.00023669496,0.5588791],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99965036,0.0000025777952,0.00009237275,0.00009394405,0.00006680018,0.00009392798],"domain_scores_gemma":[0.9997206,0.000007976752,0.000016280786,0.00020142086,0.000008552477,0.00004517038],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000015632215,0.00012160726,0.00011749764,0.000091068934,0.000010406357,0.000015581909,0.00009562312,0.00014513967,0.009735911],"category_scores_gemma":[0.0000023207435,0.0001182306,0.000031851567,0.0000814464,0.000010064186,0.000006582239,0.0000065577233,0.000090421374,0.0015792274],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.045862e-7,0.000009778944,8.4216856e-7,0.000031313746,0.0000711814,4.1545644e-7,0.0000048916995,0.08184877,4.4280566e-7,0.0021015492,0.9007036,0.015227115],"study_design_scores_gemma":[0.000056463174,7.7905474e-7,4.7115535e-7,0.000006001259,0.000019669234,7.8096116e-7,0.000002933739,0.078814365,0.0000039328274,0.000012685794,0.9209451,0.00013683588],"about_ca_topic_score_codex":0.000003992097,"about_ca_topic_score_gemma":0.000010386739,"teacher_disagreement_score":0.045694817,"about_ca_system_score_codex":0.000011123153,"about_ca_system_score_gemma":0.000005728019,"threshold_uncertainty_score":0.99919814},"labels":[],"label_agreement":null},{"id":"W1596352210","doi":"10.1016/j.dam.2011.04.003","title":"A closed-form solution for the optimal release times for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>F</mml:mi><mml:mn>2</mml:mn><mml:mo>|</mml:mo></mml:math> deteriorating jobs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mo>|</mml:mo><mml:mo>∑</mml:mo><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math> problem","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Hong Kong Polytechnic University","keywords":"Monotone polygon; Job shop scheduling; Scheduling (production processes); Mathematics; Mathematical optimization; Algorithm; Computer science; Routing (electronic design automation); Geometry","score_opus":0.01935625462398985,"score_gpt":0.23663805969992807,"score_spread":0.21728180507593822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596352210","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445972,0.0044648023,0.02229815,0.0017292949,0.008364273,0.0004211998,0.0026036252,0.0016781555,0.5138433],"genre_scores_gemma":[0.93304265,0.0038353123,0.033591453,0.003051076,0.006370661,0.009913153,0.0053499155,0.0042403257,0.0006054683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9709564,0.0010642458,0.0069024833,0.0055498476,0.0073667904,0.0081602475],"domain_scores_gemma":[0.9744956,0.00651992,0.007662839,0.0068798815,0.00080881955,0.0036329494],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007146333,0.0035480584,0.0013306312,0.0018004716,0.0068150638,0.0058272574,0.0077341627,0.0078156935,0.36424738],"category_scores_gemma":[0.005682029,0.006522737,0.0067365607,0.0038555837,0.005093101,0.0044629015,0.006158912,0.005853463,0.0048118974],"study_design_candidate":"bench_or_experimental","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.0053014364,0.0011108749,0.000013388448,0.005370285,0.0064053442,0.0017474857,0.0070093344,0.019471098,0.004665432,0.62675864,0.31719032,0.0049563907],"study_design_scores_gemma":[0.005280485,0.0032878867,0.00004121902,0.0032873855,0.005895326,0.002867085,0.0063068713,0.28147018,0.6818323,0.0011117366,0.0038433587,0.004776121],"about_ca_topic_score_codex":0.0035340802,"about_ca_topic_score_gemma":0.0031972267,"teacher_disagreement_score":0.6771669,"about_ca_system_score_codex":0.00009107416,"about_ca_system_score_gemma":0.004605797,"threshold_uncertainty_score":0.99772424},"labels":[],"label_agreement":null},{"id":"W1601067015","doi":"","title":"Slack-Based Techniques for Robust Schedules","year":2014,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Schedule; Real-time computing; Mathematical optimization; Job shop scheduling; Mathematics; Operating system","score_opus":0.013679336307560545,"score_gpt":0.22074432545068098,"score_spread":0.20706498914312044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601067015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050239,0.000022857352,0.99062425,0.0001201908,0.00012297205,0.00010297521,0.000002105372,0.0014032034,0.007099069],"genre_scores_gemma":[0.057426356,0.0000030848923,0.9420176,0.00017609622,0.00011595088,0.000046260804,0.00001440945,0.000026294982,0.00017393068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996568,0.00000516098,0.00009197343,0.00008128742,0.00004894944,0.00011585297],"domain_scores_gemma":[0.9997375,0.00005593715,0.0000082234055,0.0001192856,0.00004179019,0.000037249672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011065548,0.00007413442,0.000075652766,0.000052455747,0.000032595628,0.000026672562,0.00006739518,0.000056518173,0.00006402521],"category_scores_gemma":[0.000045463483,0.00006788969,0.000035664936,0.00006641931,0.000011041285,0.00003637486,0.0000036142328,0.000039818577,0.000019503435],"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.0000034478321,0.0000128545735,0.00009063011,0.00005153315,0.000009880714,8.1638966e-8,0.000009173299,0.95586306,0.00022959166,0.0070430296,0.0015939494,0.035092797],"study_design_scores_gemma":[0.00015258162,0.000018473496,0.000012891982,0.000009117242,0.0000040677637,1.9115922e-7,0.0000074606164,0.9568932,0.037248608,0.00018701369,0.005364283,0.00010211738],"about_ca_topic_score_codex":0.0000013951892,"about_ca_topic_score_gemma":0.0000018931883,"teacher_disagreement_score":0.056923967,"about_ca_system_score_codex":0.000011585854,"about_ca_system_score_gemma":0.0000054228526,"threshold_uncertainty_score":0.27684614},"labels":[],"label_agreement":null},{"id":"W1603740932","doi":"10.1023/a:1013370208101","title":"3-Partitioning Problems for Maximizing the Minimum Load","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta; McMaster University; University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics","score_opus":0.017086504420512526,"score_gpt":0.21396738456052777,"score_spread":0.19688088014001526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603740932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012907592,0.001024094,0.9879255,0.0007301759,0.007225921,0.00026769412,0.000002426846,0.00009831295,0.0014351129],"genre_scores_gemma":[0.48479354,0.0007273601,0.51164144,0.00011703154,0.0024054393,0.00003548506,0.000009487317,0.00009524369,0.00017500787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899656,0.000030248479,0.00046705682,0.00006773237,0.00027821574,0.00016020026],"domain_scores_gemma":[0.9989984,0.00012835527,0.00020658154,0.00010428871,0.00050171313,0.000060647577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265759,0.000111547924,0.00017205422,0.00008115488,0.00014884138,0.000119980854,0.00016034147,0.00008019971,0.00007869593],"category_scores_gemma":[0.00022901161,0.00008810639,0.00010411863,0.00023990264,0.000022294642,0.00029729458,0.000008531394,0.0001614344,0.000004377242],"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.0000111986665,0.000030455769,0.000010596637,0.00001758879,0.000035774905,7.004194e-7,0.00036208547,0.99606496,0.000038726346,0.00075868744,0.0020194508,0.000649801],"study_design_scores_gemma":[0.0014083325,0.00009968458,0.0000035218911,0.00005204383,0.00004376449,0.000020075482,0.00006668931,0.994215,0.00035110855,0.0007090717,0.0029220013,0.000108667366],"about_ca_topic_score_codex":4.2422613e-7,"about_ca_topic_score_gemma":7.296302e-8,"teacher_disagreement_score":0.48350278,"about_ca_system_score_codex":0.00010695104,"about_ca_system_score_gemma":0.00002225497,"threshold_uncertainty_score":0.35928744},"labels":[],"label_agreement":null},{"id":"W1604003500","doi":"10.1016/j.ipl.2020.105959","title":"Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman–Sethi conjecture","year":2020,"lang":"en","type":"preprint","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Waterloo; Wilfrid Laurier University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Counterexample; Job shop scheduling; Conjecture; Scheduling (production processes); Computer science; Parallel computing; Mathematics; Algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Embedded system","score_opus":0.02114070675591026,"score_gpt":0.24629684263510437,"score_spread":0.2251561358791941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604003500","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015240081,0.00057085167,0.99319005,0.0027469315,0.00044707075,0.0009963202,0.00009250111,0.00038283825,0.000049411297],"genre_scores_gemma":[0.0861328,0.00007253256,0.9103984,0.002081609,0.00020944122,0.000354984,0.0006938012,0.00005096389,0.0000054545717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984697,0.000031108288,0.0008135736,0.00019302453,0.00028847368,0.0002041128],"domain_scores_gemma":[0.99883294,0.000106082975,0.0005266469,0.00018612233,0.000285323,0.00006290921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045755113,0.00032114272,0.000424765,0.00017907986,0.00018978758,0.00041418296,0.00026125018,0.00027665927,0.0000031976367],"category_scores_gemma":[0.00022398468,0.00026498223,0.00010167741,0.00021754943,0.00016680459,0.0007300365,0.00008640194,0.0005823064,0.0000033620165],"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.000033805296,0.0000074080235,0.0000039845986,0.0040653376,0.00009676947,1.9127293e-7,0.010780506,0.8881482,0.00014863735,0.00020185871,0.00020576346,0.096307546],"study_design_scores_gemma":[0.0020249798,0.0000082018605,0.000008661323,0.00031086412,0.00008635468,0.000004190645,0.0005523868,0.99418724,0.0021120643,0.00023855685,0.00017829594,0.00028822402],"about_ca_topic_score_codex":0.0000048236134,"about_ca_topic_score_gemma":4.473604e-7,"teacher_disagreement_score":0.10603903,"about_ca_system_score_codex":0.000051244067,"about_ca_system_score_gemma":0.000093818584,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W1607281857","doi":"10.1007/978-3-540-74742-0","title":"Parallel and distributed processing and applications : 5th international symposium, ISPA 2007, Niagara Falls, Canada, August 29-31, 2007 : proceedings","year":2007,"lang":"en","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Distributed computing; Distributed algorithm; Parallel computing; Scheduling (production processes); Matrix multiplication","score_opus":0.00727825020411799,"score_gpt":0.21463212815311813,"score_spread":0.20735387794900015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607281857","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070033224,0.0033130224,0.33092698,0.00035906723,0.00055782596,0.00089420023,0.0005006552,0.00074809906,0.6626301],"genre_scores_gemma":[0.0013287099,0.0036740706,0.09472205,0.00084045663,0.0028808278,0.00031380926,0.0041055074,0.0003684848,0.8917661],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983453,0.0000023854425,0.00044885403,0.0004596493,0.0003819281,0.00036186943],"domain_scores_gemma":[0.999086,0.00004063024,0.00012658043,0.00012952549,0.00034284272,0.00027442523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013439282,0.00042533645,0.00033118846,0.00013603616,0.00015442271,0.00026367657,0.00023298302,0.00035294064,0.00013807786],"category_scores_gemma":[0.000016395117,0.00044753947,0.00003403867,0.00013589344,0.00008548907,0.00019910715,0.00007333928,0.00046124065,0.000008211958],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000029525781,0.00006239945,0.000640516,0.0011175235,0.0004089562,0.000025834406,0.000245965,0.038200524,0.000013000072,0.0044228574,0.9414704,0.013362527],"study_design_scores_gemma":[0.00058118417,0.000013840769,0.00024652618,0.0002323644,0.00009929761,0.00007197532,0.00013892801,0.17377706,0.000012127024,0.00014228401,0.82385087,0.000833557],"about_ca_topic_score_codex":0.0021529288,"about_ca_topic_score_gemma":0.0054446287,"teacher_disagreement_score":0.23620494,"about_ca_system_score_codex":0.00041503026,"about_ca_system_score_gemma":0.00038557235,"threshold_uncertainty_score":0.99979764},"labels":[],"label_agreement":null},{"id":"W1614783246","doi":"10.1007/978-3-540-74484-9_89","title":"Worst-Case Evaluation of Flexible Solutions in Disjunctive Scheduling Problems","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Maximization; Computer science; Scheduling (production processes); Minimax; Schedule; Minification; Job shop scheduling; Function (biology); Set (abstract data type); Mathematics","score_opus":0.0572420048960475,"score_gpt":0.283822231945605,"score_spread":0.22658022704955752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1614783246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007955312,0.0012646122,0.99326545,0.00002260667,0.0011283527,0.00039276652,0.000004651014,0.00010534793,0.003020657],"genre_scores_gemma":[0.4255114,0.00002861352,0.5740774,0.00004180733,0.00022059628,0.000018151688,0.000012509503,0.000044668304,0.000044841723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980505,0.000016837786,0.00044593887,0.00044698696,0.0006707475,0.00036894897],"domain_scores_gemma":[0.9989566,0.00018143204,0.000098932855,0.00034784258,0.00034490522,0.00007027931],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018576899,0.00025415208,0.00027917378,0.0010009297,0.000084001374,0.000056140376,0.00028607575,0.0002441717,0.000039831775],"category_scores_gemma":[0.0001097292,0.0002620973,0.000056712237,0.0007116999,0.00023572573,0.0001812251,0.00009803914,0.00053075183,0.000008368131],"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.0000015005771,0.000010581853,0.00001532616,0.000023027076,0.000006831425,0.00001589029,0.00059403403,0.8250437,0.0000130304015,0.0006716342,3.1916346e-7,0.17360413],"study_design_scores_gemma":[0.00027609084,0.00002522189,0.000037470927,0.00041931806,0.000018129793,0.00004588176,0.000002141249,0.9851687,0.0003034913,0.013439377,0.000006580488,0.00025762166],"about_ca_topic_score_codex":0.000025296322,"about_ca_topic_score_gemma":0.00019094457,"teacher_disagreement_score":0.42471588,"about_ca_system_score_codex":0.00042223814,"about_ca_system_score_gemma":0.00020786759,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W1628160554","doi":"10.3233/jid-2012-0011","title":"Agent-Based System Design for Service Process Scheduling: Challenges, Approaches and Opportunities","year":2012,"lang":"en","type":"article","venue":"Journal of Integrated Design and Process Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Service design; Service provider; Process management; Operations research; Service (business); Engineering; Operations management; Business; Quality of service; Computer network; Marketing","score_opus":0.1679495711761323,"score_gpt":0.2803376665694348,"score_spread":0.11238809539330252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1628160554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018692488,0.010668861,0.9697187,0.0002120394,0.00024545973,0.00025103774,0.0000027318808,0.00008487593,0.00012383667],"genre_scores_gemma":[0.7693597,0.00037789985,0.23008354,0.000057160607,0.00007219917,0.000024032068,9.382624e-7,0.000019084224,0.000005412322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885756,0.00005036461,0.0003393397,0.00014239558,0.00029988505,0.00031045402],"domain_scores_gemma":[0.9985352,0.00015184858,0.00017106405,0.0000763368,0.0007679627,0.00029759304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024246576,0.00018058551,0.00024045071,0.00028710978,0.00018870612,0.00016117746,0.00024019355,0.00008354517,0.0000017965685],"category_scores_gemma":[0.00014629768,0.00013458196,0.000023507286,0.00040017793,0.00013149988,0.0007805565,0.0000071151803,0.00017767673,4.5913393e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017283465,0.000076088756,0.000049092574,0.0019367903,0.00005077663,0.000004981751,0.005181099,0.9643155,0.0007936636,0.000901853,0.000016053707,0.026501302],"study_design_scores_gemma":[0.0004409231,0.00012754192,0.0000121346175,0.0003618248,0.00004054284,0.00013507095,0.011531452,0.9725948,0.014455326,0.00008820861,0.00003142976,0.00018071845],"about_ca_topic_score_codex":6.233628e-7,"about_ca_topic_score_gemma":1.0765493e-7,"teacher_disagreement_score":0.7506673,"about_ca_system_score_codex":0.000056554243,"about_ca_system_score_gemma":0.00038891667,"threshold_uncertainty_score":0.5488093},"labels":[],"label_agreement":null},{"id":"W1680007418","doi":"10.1007/978-0-387-88843-9","title":"Operations Research and Cyber-Infrastructure","year":2009,"lang":"en","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Business","score_opus":0.021365259285094914,"score_gpt":0.27638862874761794,"score_spread":0.255023369462523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1680007418","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002684832,0.0008751195,0.009894442,0.00009081893,0.00015070179,0.00014572739,0.000009653146,0.00036700582,0.9884397],"genre_scores_gemma":[0.00008675938,0.0005360916,0.08532246,0.000056585992,0.0003621988,0.0000058885403,0.00011398348,0.00004291523,0.9134731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993603,0.0000087494245,0.00012523487,0.00015647567,0.0001863037,0.00016289584],"domain_scores_gemma":[0.9995863,0.00003197352,0.0000033112472,0.0001803634,0.0001169183,0.00008117838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010085671,0.00013624299,0.00013491305,0.00017733102,0.00009645112,0.00011687923,0.00009380221,0.00028141213,0.00045375054],"category_scores_gemma":[0.000015699614,0.00012708222,0.00001837458,0.000081247235,0.000043057487,0.000046679495,0.00001988326,0.000544447,0.00007866963],"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.000001020798,0.000005049333,0.0000013352355,0.000040487528,0.000041448577,0.0000070613014,0.00015675527,0.5688437,0.000007501526,0.018172227,0.395058,0.017665377],"study_design_scores_gemma":[0.0002676666,0.000064756256,0.000060243674,0.00010381972,0.000016601718,0.000025637593,0.00004489511,0.7339495,0.00006940557,0.008525428,0.25637668,0.0004953901],"about_ca_topic_score_codex":0.0000026060636,"about_ca_topic_score_gemma":0.000016234051,"teacher_disagreement_score":0.16510576,"about_ca_system_score_codex":0.00007781249,"about_ca_system_score_gemma":0.000072482086,"threshold_uncertainty_score":0.51822627},"labels":[],"label_agreement":null},{"id":"W1694601577","doi":"10.5267/j.ijiec.2015.6.004","title":"GRASP to minimize total weighted tardiness in a permutation flow shop environment","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; GRASP; Permutation (music); Flow shop scheduling; Computer science; Flow (mathematics); Sorting; Mathematics; Mathematical optimization; Operations management; Engineering; Algorithm; Job shop scheduling; Schedule","score_opus":0.026024120551180797,"score_gpt":0.2406440146705312,"score_spread":0.2146198941193504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1694601577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19685546,0.000065789165,0.79790246,0.0006341217,0.004255269,0.00011540106,0.000018420911,0.00007356891,0.00007954166],"genre_scores_gemma":[0.8156247,0.00000847706,0.18324307,0.000025613857,0.0010008258,0.000010118617,0.00003634176,0.00003241723,0.000018430488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986878,0.000022081427,0.00056806405,0.00010064146,0.00047374633,0.00014766454],"domain_scores_gemma":[0.9992984,0.00010147715,0.00007869768,0.000065590095,0.00025940302,0.00019641634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026201192,0.00014449276,0.0001978478,0.0006458514,0.000014044196,0.00007655697,0.00021560554,0.000092415656,0.000027212618],"category_scores_gemma":[0.0002510105,0.00015545847,0.00007128712,0.00029818076,0.000009165445,0.00022025021,0.000027298507,0.00028534987,0.000021416363],"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.00003071406,0.000037028036,0.00024168754,0.0000015918289,0.00007732415,0.000038121267,0.00052467245,0.992769,0.00008778131,0.000050165818,0.00031941288,0.005822524],"study_design_scores_gemma":[0.0018744495,0.00004401644,0.0005637274,0.00008865913,0.00001373898,0.000096975295,0.000181664,0.9962476,0.00022951886,0.00004623892,0.00045390832,0.00015950893],"about_ca_topic_score_codex":0.000006079687,"about_ca_topic_score_gemma":6.035959e-7,"teacher_disagreement_score":0.6187693,"about_ca_system_score_codex":0.00038738395,"about_ca_system_score_gemma":0.0000831795,"threshold_uncertainty_score":0.63394123},"labels":[],"label_agreement":null},{"id":"W170420448","doi":"10.5220/0001722404420447","title":"TOWARD A HYBRID ALGORITHM FOR WORKFLOW GRAPH STRUCTURAL VERIFICATION","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université de Montréal","funders":"","keywords":"Computer science; Workflow; Algorithm; Theoretical computer science; Database","score_opus":0.021642763665960005,"score_gpt":0.22446963409530898,"score_spread":0.202826870429349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W170420448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01231278,0.00019186249,0.9855258,0.00004368701,0.0005629308,0.00014952468,0.000014914865,0.00059220335,0.0006063168],"genre_scores_gemma":[0.17104545,0.0000940304,0.82822514,0.000048959708,0.00016193619,0.000038717866,0.000073738185,0.000026441605,0.00028559365],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994946,0.0000044271683,0.00013524726,0.00012215764,0.00008575333,0.00015779313],"domain_scores_gemma":[0.9997288,0.000021708742,0.00001318463,0.00012465293,0.000054098866,0.00005754621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000035719004,0.00009903167,0.00009406962,0.00006291571,0.000080443126,0.00001865457,0.000080706115,0.000036995913,0.0000763093],"category_scores_gemma":[0.000010805234,0.00009474469,0.000057630004,0.00013098503,0.000020314865,0.00009046697,0.00000461265,0.00005591075,0.000020812078],"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.000011154744,0.000019691824,0.00016602193,0.000040707546,0.00010193066,0.000009957147,0.0006415028,0.4064859,0.00019792085,0.0005131755,0.008724514,0.58308756],"study_design_scores_gemma":[0.0003247284,0.000012588899,0.0002585171,0.0000032476523,0.00000582056,0.00003071862,0.000025777239,0.9945021,0.0036880714,0.0002492823,0.00075562164,0.00014350977],"about_ca_topic_score_codex":0.0000033523743,"about_ca_topic_score_gemma":3.0484713e-7,"teacher_disagreement_score":0.5880162,"about_ca_system_score_codex":0.000021370293,"about_ca_system_score_gemma":0.000009416219,"threshold_uncertainty_score":0.38635764},"labels":[],"label_agreement":null},{"id":"W1704392916","doi":"10.1007/s10288-003-0024-4","title":"Ten notes on equal-processing-time scheduling","year":2004,"lang":"en","type":"article","venue":"4OR","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"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":"Flow shop scheduling; Computer science; Scheduling (production processes); Time complexity; Parallel computing; Open shop; Job shop scheduling; Mathematical optimization; Distributed computing; Mathematics; Algorithm; Operating system; Schedule","score_opus":0.014533928400133062,"score_gpt":0.23617012641333024,"score_spread":0.22163619801319717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704392916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21941154,0.001099951,0.76263756,0.00085951516,0.00075033435,0.0001804795,0.000011819684,0.0027178798,0.012330959],"genre_scores_gemma":[0.78622776,0.000014792288,0.21305355,0.00020887704,0.00023880796,0.000007533219,0.000011322525,0.000045626966,0.0001917182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994501,0.0000039680085,0.000121861485,0.0001252369,0.00011941751,0.0001794381],"domain_scores_gemma":[0.9997391,0.000027626138,0.000015871463,0.00012461729,0.000028909819,0.00006387362],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006544985,0.00011445266,0.00010460245,0.00006835733,0.000053650496,0.000054265103,0.00008999245,0.00006798136,0.00008151209],"category_scores_gemma":[0.00006961979,0.00010551337,0.000033917593,0.00015752934,0.000014726024,0.000076084,0.00000929484,0.000120985234,0.00086840364],"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.000002499835,0.000015164279,0.00001654822,0.000016598775,0.000007993742,0.000003478355,0.00018079797,0.9850173,0.0009123525,0.00017985387,0.00000952778,0.013637912],"study_design_scores_gemma":[0.0007655117,0.000047823643,0.00011300135,0.00014648179,0.000014301115,0.0000056232434,0.000045442648,0.9696729,0.027834978,0.0006024198,0.00041873095,0.00033278164],"about_ca_topic_score_codex":0.000003174283,"about_ca_topic_score_gemma":4.079481e-7,"teacher_disagreement_score":0.5668162,"about_ca_system_score_codex":0.000045380668,"about_ca_system_score_gemma":0.000018846195,"threshold_uncertainty_score":0.9999095},"labels":[],"label_agreement":null},{"id":"W1745273410","doi":"10.3233/ica-2010-0344","title":"A multi-criteria optimization framework for industrial shop scheduling using fuzzy set theory","year":2010,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Natural Resources; University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Fuzzy logic; Fuzzy set; Scheduling (production processes); Industrial engineering; Mathematics; Artificial intelligence; Engineering","score_opus":0.03596246882074433,"score_gpt":0.2718421789509948,"score_spread":0.23587971013025044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745273410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06812178,0.00007329569,0.92318696,0.000018082723,0.0065255016,0.00039125734,0.000043932167,0.0016252403,0.00001395308],"genre_scores_gemma":[0.13288803,0.000007938483,0.86548644,0.00003262658,0.0012432734,0.000048219958,0.00012598436,0.0001601732,0.000007326578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982802,0.000034403856,0.00055841845,0.00040207425,0.00017147238,0.0005534318],"domain_scores_gemma":[0.99876356,0.00036113942,0.00007527216,0.00037988703,0.00021609667,0.00020405004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043898573,0.00046819323,0.0004050686,0.00038799475,0.00013277524,0.00030195055,0.0003505884,0.0005905411,0.0000644329],"category_scores_gemma":[0.00041646065,0.00050357834,0.00015320475,0.00064746384,0.00003176728,0.00030195885,0.00004989056,0.0011119297,0.000007888604],"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.00001920983,0.000023638693,0.000015137449,0.00004296532,0.00010413146,0.000004452283,0.00022785673,0.98698634,0.007433104,0.0012545433,0.000022234082,0.0038663775],"study_design_scores_gemma":[0.0009407421,0.000034442066,0.000004401376,0.00025573256,0.00004586989,0.000028474542,0.00008520076,0.9937377,0.003993648,0.00017533018,0.00014367697,0.00055476604],"about_ca_topic_score_codex":0.000008016533,"about_ca_topic_score_gemma":0.0000014572179,"teacher_disagreement_score":0.06476625,"about_ca_system_score_codex":0.000110741275,"about_ca_system_score_gemma":0.000060477312,"threshold_uncertainty_score":0.99974155},"labels":[],"label_agreement":null},{"id":"W1754021675","doi":"10.3233/ica-2002-9302","title":"Genetic algorithms in agent-based manufacturing scheduling systems","year":2002,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Genetic algorithm; Distributed computing; Engineering; Machine learning; Operations management","score_opus":0.012581870694917077,"score_gpt":0.1884495797588342,"score_spread":0.17586770906391713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1754021675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18403053,0.0012893069,0.8105105,0.000017619726,0.0021873564,0.0002158758,0.000006842297,0.0016180039,0.00012393293],"genre_scores_gemma":[0.6630673,0.000059854905,0.33635542,0.00002727149,0.00028599348,0.000049307037,0.000015865218,0.00011308838,0.000025933852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980177,0.00003237966,0.0006404566,0.00039920755,0.00026360137,0.00064661517],"domain_scores_gemma":[0.999229,0.00010228952,0.0000477931,0.00036853892,0.0000582664,0.0001940951],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013936154,0.0004663604,0.0004191496,0.0006476396,0.000053163305,0.00022215255,0.00034250758,0.00021711833,0.00006517283],"category_scores_gemma":[0.000021131711,0.0005091585,0.00010442287,0.0006082486,0.000016996973,0.00016887429,0.00003081319,0.00060250814,0.000116331335],"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.0000014183746,0.000027129614,0.0000679909,0.00010258647,0.00004139311,0.0001337999,0.0000997948,0.9847119,0.00028528448,0.000015836167,0.000050182523,0.014462686],"study_design_scores_gemma":[0.0006997696,0.000029926461,0.00033986356,0.00038661814,0.000012124723,0.000037466216,0.000038252787,0.9946913,0.0027038562,0.0000022379045,0.0005198427,0.0005387018],"about_ca_topic_score_codex":0.00006160415,"about_ca_topic_score_gemma":0.000003312738,"teacher_disagreement_score":0.47903672,"about_ca_system_score_codex":0.00030225026,"about_ca_system_score_gemma":0.000012529474,"threshold_uncertainty_score":0.999736},"labels":[],"label_agreement":null},{"id":"W176824863","doi":"10.71781/10821","title":"Calibration de systèmes de caméras et projecteurs dans des applications de création multimédia","year":2009,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.005661024601040415,"score_gpt":0.18742692247210654,"score_spread":0.18176589787106612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W176824863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3309025,0.00864433,0.6438826,0.000247427,0.00048958446,0.0009296201,0.00011636487,0.0006332296,0.014154409],"genre_scores_gemma":[0.73721457,0.0019519951,0.24155675,0.00016281802,0.00047352395,0.00031620025,0.0025481982,0.0001286311,0.015647328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975374,0.00028711124,0.0005065837,0.0005536487,0.00045693168,0.00065832416],"domain_scores_gemma":[0.99837613,0.0001554722,0.0003189292,0.00035617873,0.0003593679,0.0004339398],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038636895,0.0005370054,0.0003851305,0.00041258012,0.0042464677,0.00018230286,0.0003730235,0.00074605073,0.000021435355],"category_scores_gemma":[0.00011686447,0.0006976007,0.0002596469,0.0006121242,0.00018713142,0.0006081867,0.000040299936,0.00058156275,0.000028418968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014486299,0.00023152972,0.015180668,0.00038619913,0.00024279174,0.00022098112,0.064118356,0.8739987,0.018826019,0.01807104,0.00012031446,0.008458544],"study_design_scores_gemma":[0.000968499,0.00008071233,0.10617815,0.00052242423,0.0005481202,0.0007185207,0.03271974,0.82906437,0.026007943,0.0010478144,0.0012606453,0.0008830519],"about_ca_topic_score_codex":0.043992918,"about_ca_topic_score_gemma":0.010802211,"teacher_disagreement_score":0.40631208,"about_ca_system_score_codex":0.012951729,"about_ca_system_score_gemma":0.0030603623,"threshold_uncertainty_score":0.99954754},"labels":[],"label_agreement":null},{"id":"W1768844086","doi":"10.3968/j.css.1923669720060202.003","title":"Operation Flow Reconstruction of Travel Agency","year":2009,"lang":"en","type":"article","venue":"Canadian social science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Agency (philosophy); Humanities; Political science; Promotion (chess); Sociology; Art; Law; Social science","score_opus":0.009996231092811019,"score_gpt":0.21568554380018415,"score_spread":0.20568931270737312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1768844086","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32106525,0.0001648864,0.09604404,0.00056845957,0.0028844872,0.00028184874,0.0000432151,0.00021948789,0.5787283],"genre_scores_gemma":[0.9867136,0.000005509529,0.013116403,0.00005714831,0.000077545126,6.447541e-7,0.0000017505364,0.0000022390766,0.00002516276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964195,0.0000035624496,0.000074462645,0.00006615216,0.00008359018,0.00013028487],"domain_scores_gemma":[0.9997979,0.0000017941214,0.0000089547375,0.000038535836,0.000048422688,0.00010442227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010473965,0.00003340493,0.000043353895,0.00009611897,0.00014771172,0.00002440225,0.000081192324,0.00003115159,0.000053999105],"category_scores_gemma":[0.000018795821,0.000038392805,0.000012674606,0.00037706288,0.00007308469,0.00014039643,8.9090486e-7,0.000036455345,0.0000061126166],"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":[6.299954e-7,0.0000040116565,0.00022476159,0.0000043519817,0.0000026092048,0.0000014144226,0.0024020323,0.024304746,0.00835006,0.008465697,0.00017109262,0.9560686],"study_design_scores_gemma":[0.00017424632,0.00002498655,0.022348402,0.0000122373685,0.0000055964115,0.000006902818,0.00090476737,0.96476024,0.010655323,0.00070605177,0.00017243113,0.000228802],"about_ca_topic_score_codex":0.00025568076,"about_ca_topic_score_gemma":0.0003701594,"teacher_disagreement_score":0.9558398,"about_ca_system_score_codex":0.00013096932,"about_ca_system_score_gemma":0.00014593684,"threshold_uncertainty_score":0.15656132},"labels":[],"label_agreement":null},{"id":"W177354053","doi":"10.1007/978-3-642-34422-0_13","title":"Multi-agent Systems in Industry: Current Trends &amp; Future Challenges","year":2012,"lang":"en","type":"book-chapter","venue":"Topics in intelligent engineering and informatics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Current (fluid); Engineering; Business; Computer science; Risk analysis (engineering); Industrial organization; Manufacturing engineering; Electrical engineering","score_opus":0.04450528891137564,"score_gpt":0.2532392326449854,"score_spread":0.20873394373360973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177354053","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030536312,0.7066204,0.105369344,0.00027177465,0.034608696,0.0016940751,0.00022174971,0.0022468003,0.14591351],"genre_scores_gemma":[0.010984112,0.7501295,0.13465655,0.0000858609,0.008494846,0.000304618,0.0009177297,0.00083041843,0.09359634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849033,0.0000052819173,0.00082922407,0.00012239168,0.00020242481,0.00035034594],"domain_scores_gemma":[0.9994215,0.000029249031,0.00008674108,0.0002852378,0.000034162513,0.00014310823],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022376336,0.0004286166,0.0004474176,0.00069313566,0.00001790367,0.000058107886,0.0001661583,0.00076134794,0.000044252592],"category_scores_gemma":[0.000015662685,0.0004462479,0.000059394562,0.0000873326,0.000017188815,0.0001394518,0.00005668256,0.0014996389,0.00003434562],"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.0000013846582,0.00002099024,0.000034876237,0.0013987529,0.000046606114,0.0000021841977,0.0040726247,0.7671434,2.0648784e-7,0.010525416,0.00011638495,0.21663713],"study_design_scores_gemma":[0.00016070306,0.000008794072,0.000056122233,0.0007600112,0.000015193628,0.000008955989,0.00021622507,0.48959103,0.0000032858752,0.00001266878,0.5087423,0.00042475227],"about_ca_topic_score_codex":0.000003372522,"about_ca_topic_score_gemma":0.000011481247,"teacher_disagreement_score":0.50862586,"about_ca_system_score_codex":0.0002170385,"about_ca_system_score_gemma":0.000013263236,"threshold_uncertainty_score":0.99979895},"labels":[],"label_agreement":null},{"id":"W1794922876","doi":"","title":"Detección de fallas en sistemas con optimización basada en mallas","year":2012,"lang":"es","type":"article","venue":"Computación y Sistemas","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Ottawa","funders":"","keywords":"Medicine","score_opus":0.010477606928870035,"score_gpt":0.24249214298376967,"score_spread":0.23201453605489963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1794922876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10825508,0.01733801,0.8274175,0.0013866217,0.009992866,0.0018818277,0.00014712593,0.0027836752,0.030797308],"genre_scores_gemma":[0.7696361,0.0005870327,0.22457922,0.00028276668,0.0025245848,0.000071631,0.00008114251,0.00032999794,0.0019075433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941629,0.00080496684,0.0014101495,0.0008484165,0.0008088076,0.0019647514],"domain_scores_gemma":[0.9958148,0.0012602095,0.00035276904,0.0011765722,0.0002625561,0.0011330688],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017523408,0.001169018,0.0013689266,0.00047717258,0.0003748699,0.0005304816,0.00094193395,0.0010196957,0.00052626274],"category_scores_gemma":[0.0004057515,0.0012816879,0.0006223238,0.00081854366,0.00015144474,0.0005723213,0.00040798297,0.0010328982,0.0014881111],"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.00006935969,0.00040046108,0.021622147,0.0027428677,0.00091996905,0.00008583096,0.0021941534,0.9544301,0.000488729,0.008597858,0.0013295808,0.0071189627],"study_design_scores_gemma":[0.002105725,0.00020040313,0.009293706,0.001329972,0.0006522807,0.0004900381,0.0006453398,0.939426,0.0030608813,0.00007342713,0.040427245,0.002294988],"about_ca_topic_score_codex":0.000048893602,"about_ca_topic_score_gemma":0.000005157115,"teacher_disagreement_score":0.661381,"about_ca_system_score_codex":0.00087859377,"about_ca_system_score_gemma":0.00019208685,"threshold_uncertainty_score":0.99928933},"labels":[],"label_agreement":null},{"id":"W1796736899","doi":"10.3233/ica-2001-8102","title":"Dynamic manufacturing scheduling using both functional and resource related agents","year":2001,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bidding; Computer science; Contract Net Protocol; Dynamic priority scheduling; Scheduling (production processes); Distributed computing; Architecture; Two-level scheduling; Mechanism (biology); Multi-agent system; Schedule; Artificial intelligence; Operations management; Engineering; Business; Operating system","score_opus":0.01115527480925935,"score_gpt":0.20167541019139715,"score_spread":0.1905201353821378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1796736899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46860757,0.00031282773,0.52923477,0.0000149643665,0.0006364322,0.00007797701,0.0000026025361,0.0010071803,0.000105686886],"genre_scores_gemma":[0.7062387,0.000093723625,0.2932322,0.000039388844,0.00012407932,0.000007338433,0.0000575851,0.00012093373,0.000086032764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985206,0.000020996278,0.00043815208,0.00036024154,0.00020495661,0.0004550173],"domain_scores_gemma":[0.9994179,0.00007224288,0.000047414018,0.00023395069,0.000043512533,0.00018499597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015458938,0.00037908775,0.0002897766,0.00037974273,0.0001237212,0.00015814004,0.00015602514,0.0001983279,0.00005705682],"category_scores_gemma":[0.000019804993,0.0004132138,0.00007594388,0.00042124212,0.000024740499,0.00023513686,0.000056718138,0.0005472999,0.000017384174],"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.000005961109,0.00001006202,0.00006385231,0.00003216809,0.000103800834,0.000059010265,0.00009959647,0.98943543,0.0012773019,0.00003127238,0.00002301576,0.008858495],"study_design_scores_gemma":[0.0005255415,0.000018696106,0.0008930839,0.0002293625,0.00002744541,0.00030011023,0.00006044726,0.9956557,0.00084098213,0.00002036463,0.0010021259,0.00042612434],"about_ca_topic_score_codex":0.00001588352,"about_ca_topic_score_gemma":0.0000013655922,"teacher_disagreement_score":0.23763113,"about_ca_system_score_codex":0.0002193542,"about_ca_system_score_gemma":0.000017327604,"threshold_uncertainty_score":0.999832},"labels":[],"label_agreement":null},{"id":"W1806828450","doi":"","title":"THE REPLENISHMENT STAGGERING PROBLEM REVISITED","year":2007,"lang":"en","type":"article","venue":"ASAC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Multiple; Mathematical optimization; Constant (computer programming); Integer (computer science); Heuristic; Integer programming; Simple (philosophy); Computer science; Operations research; Mathematics; Arithmetic","score_opus":0.007083108412952019,"score_gpt":0.2218005823934676,"score_spread":0.21471747398051558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1806828450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045703262,0.005887134,0.7931736,0.0009859642,0.0015816912,0.00071105734,0.0000068793124,0.0030054066,0.14894499],"genre_scores_gemma":[0.71582645,0.00084972684,0.27724063,0.00027599072,0.00055149256,0.000027788084,0.000021480973,0.000098871504,0.005107572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995077,0.0000049008286,0.0001444597,0.000072641444,0.00009600817,0.0001742695],"domain_scores_gemma":[0.99969643,0.00005495575,0.000015097177,0.00016678695,0.00002554706,0.000041193398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036167336,0.000059516504,0.000049392518,0.00002215963,0.000092489485,0.00004327551,0.000078910605,0.000027079715,0.000023235121],"category_scores_gemma":[0.000020883199,0.000045117755,0.000021782846,0.00013541392,0.000010184378,0.00003512816,0.000011813727,0.0000814142,0.000045112258],"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.000035699628,0.00004512455,0.001779539,0.000135315,0.00022242365,0.000040396324,0.0017900638,0.37761912,0.002328209,0.009105511,0.01994393,0.58695465],"study_design_scores_gemma":[0.0010107947,0.00007408028,0.0031966532,0.0001711912,0.00003725173,0.000025723994,0.0008121253,0.48101556,0.03896924,0.0011549848,0.4727242,0.0008082001],"about_ca_topic_score_codex":0.0000014373109,"about_ca_topic_score_gemma":0.0000017896015,"teacher_disagreement_score":0.67012316,"about_ca_system_score_codex":0.000030391582,"about_ca_system_score_gemma":0.0000038158414,"threshold_uncertainty_score":0.18398486},"labels":[],"label_agreement":null},{"id":"W1826567783","doi":"10.1007/978-0-387-35704-1_20","title":"Towards an Internet Enabled Cooperative Manufacturing Management Framework","year":2004,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"The Internet; Manufacturing execution system; Computer science; Scheduling (production processes); Process (computing); Software; Manufacturing engineering; Process management; Engineering management; Systems engineering; Engineering; Software engineering; Knowledge management; Computer-integrated manufacturing; World Wide Web; Operating system; Operations management","score_opus":0.006254685065934277,"score_gpt":0.23263325427637785,"score_spread":0.22637856921044358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1826567783","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033383924,0.011925602,0.2551676,0.0003978144,0.00040410628,0.0007623835,0.000021748456,0.0015944819,0.7293924],"genre_scores_gemma":[0.2295916,0.15721741,0.60179555,0.00071402994,0.000055797387,0.00043499074,0.0011236795,0.00013708108,0.008929875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990915,0.000010080829,0.00050462625,0.00012878097,0.000115764284,0.00014923383],"domain_scores_gemma":[0.9991494,0.00002298166,0.00014120045,0.00058165763,0.00006594886,0.000038812526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011277115,0.00024047503,0.00024180063,0.00068503653,0.000069058995,0.000076681456,0.00044492696,0.0004608199,0.00014996772],"category_scores_gemma":[0.00001377355,0.0002622448,0.0000228435,0.0000944562,0.00013323044,0.0009796912,0.00014937516,0.00068145985,0.000052685704],"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.000005605709,0.0000053365125,0.0000018314761,0.00008313837,0.000020478978,8.122721e-7,0.00049546926,0.04873959,6.516579e-8,0.63936883,0.00000739156,0.31127143],"study_design_scores_gemma":[0.0012411028,0.000112320704,0.00001906313,0.0015202947,0.000036645444,0.000031808275,0.002080242,0.051649343,0.0013075492,0.61662054,0.32435113,0.0010299258],"about_ca_topic_score_codex":0.0000031312877,"about_ca_topic_score_gemma":0.00001528982,"teacher_disagreement_score":0.72046256,"about_ca_system_score_codex":0.00017787008,"about_ca_system_score_gemma":0.000015211909,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W1843628981","doi":"10.1007/11564751_60","title":"Extending Systematic Local Search for Job Shop Scheduling Problems","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Simon Fraser University","funders":"","keywords":"Guided Local Search; Tabu search; Hill climbing; Local search (optimization); Local optimum; Beam search; Constructive; Computer science; Iterated local search; Search algorithm; Mathematical optimization; Iterative deepening depth-first search; Best-first search; Depth-first search; Incremental heuristic search; Backtracking; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.021738206307159457,"score_gpt":0.25079875532159956,"score_spread":0.22906054901444012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843628981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046148605,0.0019000544,0.9948286,0.00006838631,0.0012337671,0.000821364,0.000004865909,0.00030943492,0.00078736927],"genre_scores_gemma":[0.08387413,0.00007580165,0.91463035,0.00012896057,0.00084493763,0.000047320314,0.000008280264,0.00010767127,0.00028256446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769765,0.000013263417,0.0005330217,0.00062740437,0.00056669035,0.00056196004],"domain_scores_gemma":[0.9987278,0.00041823517,0.000075031996,0.00045925644,0.0001846167,0.00013504468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009184643,0.00039645348,0.00053495495,0.00062277773,0.0001752724,0.00028942846,0.0007366367,0.00029740582,0.000019628704],"category_scores_gemma":[0.000059276605,0.00037016306,0.000115262126,0.000306271,0.00023469931,0.00018757573,0.00012908816,0.00059897057,0.000029218769],"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.0000011376832,0.0000035214148,0.0000028898241,0.0026647658,0.000013578438,0.000003960397,0.00027484813,0.9408791,0.000021362544,0.00075231417,8.9584285e-7,0.055381604],"study_design_scores_gemma":[0.00018279564,0.00003376437,0.000001228554,0.005096717,0.000017051418,0.000030099472,0.0000011137694,0.9924737,0.00037617542,0.0013503178,0.000023780867,0.00041322503],"about_ca_topic_score_codex":0.0000017982368,"about_ca_topic_score_gemma":0.000010137724,"teacher_disagreement_score":0.08382798,"about_ca_system_score_codex":0.00038542468,"about_ca_system_score_gemma":0.00012749304,"threshold_uncertainty_score":0.999875},"labels":[],"label_agreement":null},{"id":"W1868381211","doi":"10.24908/pceea.v0i0.4021","title":"BUSINESS MODEL FRAMEWORK FOR USING REAL-TIME PROCESS DATA FOR DESIGN DECISION MAKING","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","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":true,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Newsprint; Exploit; Business process; Computer science; Business process modeling; Process (computing); Process modeling; Artifact-centric business process model; Process management; Industrial engineering; Work in process; Engineering; Operations management","score_opus":0.0475121280536032,"score_gpt":0.27474788705829073,"score_spread":0.22723575900468754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1868381211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019379495,0.000058959347,0.97702724,0.00015378451,0.0015294844,0.0010641527,0.0001684512,0.00025163247,0.0003667957],"genre_scores_gemma":[0.18806641,0.000008260669,0.81135994,0.000044297485,0.00019449941,0.00011550876,0.000029383655,0.00009001727,0.00009168157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882174,0.000002813894,0.0003476244,0.00025558576,0.00022005299,0.00035218202],"domain_scores_gemma":[0.9981053,0.00017011965,0.0002424523,0.00022009527,0.001132138,0.0001299288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063199655,0.00018914364,0.00020727728,0.0002731156,0.00019835237,0.00010045595,0.00060698134,0.00024333353,0.000010136085],"category_scores_gemma":[0.00276219,0.00019980481,0.000058605376,0.0005974461,0.000010169531,0.00040788794,0.000025822717,0.00013159243,0.0000015859747],"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.000014226551,0.00003468166,0.0004620496,0.00044412955,0.00009115352,1.5927567e-8,0.0011735257,0.98829865,0.0003887121,0.003932858,0.003544179,0.0016158249],"study_design_scores_gemma":[0.00013365287,0.0000056510244,0.00054732,0.00033471824,0.000076343065,0.000001098344,0.00010485667,0.99395543,0.00068959384,0.0038259497,0.000095170595,0.00023021693],"about_ca_topic_score_codex":0.00022220913,"about_ca_topic_score_gemma":0.00009915169,"teacher_disagreement_score":0.16868691,"about_ca_system_score_codex":0.00097148016,"about_ca_system_score_gemma":0.00062125915,"threshold_uncertainty_score":0.81478035},"labels":[],"label_agreement":null},{"id":"W1878146926","doi":"10.1007/3-540-44867-5_21","title":"A Framework for Designing Approximation Algorithms for Scheduling Problems","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Fair-share scheduling; Two-level scheduling; Mathematical optimization; Rate-monotonic scheduling; Theoretical computer science; Algorithm; Mathematics; Schedule","score_opus":0.031226865099060152,"score_gpt":0.2595253631836189,"score_spread":0.22829849808455877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1878146926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004987831,0.00067954796,0.9956955,0.00010225909,0.0018752251,0.0011625701,0.0000124105645,0.00028122053,0.00018633608],"genre_scores_gemma":[0.0007989989,0.000031135685,0.9980282,0.00027908155,0.0005541667,0.00013473028,0.000027531532,0.00009719643,0.00004896033],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981077,0.000007604964,0.00041924862,0.0006550028,0.00031576806,0.0004946918],"domain_scores_gemma":[0.99857455,0.00061647984,0.00012379904,0.0003513556,0.0002377833,0.00009603118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006997999,0.00038870078,0.00037703107,0.00042926447,0.00021228768,0.0002636337,0.0004532942,0.00044616262,0.0000067077312],"category_scores_gemma":[0.00025444853,0.00040049123,0.000119402,0.00028393077,0.00013183051,0.00018149316,0.000041667507,0.00046560963,0.0000036699103],"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.0000021725311,0.0000048253223,0.0000010161308,0.0001524231,0.0000111436575,5.0869284e-7,0.00026450484,0.84458363,0.00003287601,0.0031414446,0.000003369041,0.15180206],"study_design_scores_gemma":[0.00023465908,0.000055609176,2.7834056e-7,0.00051469944,0.0000137891,0.000006095416,4.6670385e-7,0.8382081,0.0016612795,0.15867157,0.00023348091,0.00039999597],"about_ca_topic_score_codex":5.900095e-7,"about_ca_topic_score_gemma":0.0000013835415,"teacher_disagreement_score":0.15553012,"about_ca_system_score_codex":0.00020253714,"about_ca_system_score_gemma":0.00010034422,"threshold_uncertainty_score":0.9998447},"labels":[],"label_agreement":null},{"id":"W1886156573","doi":"10.1609/icaps.v23i1.13552","title":"Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and 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":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Dynamic priority scheduling; Sequence (biology); Distributed computing; Mathematics; Quality of service; Computer network","score_opus":0.019560836295905833,"score_gpt":0.24645218792809634,"score_spread":0.2268913516321905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1886156573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97186404,0.00017003824,0.025398692,0.00030520163,0.0001633696,0.00032091024,0.000023845216,0.00037541005,0.0013784624],"genre_scores_gemma":[0.946299,0.00006313032,0.053289674,0.000061396,0.000024246556,0.00005337051,0.000011710237,0.00003471879,0.00016274242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895215,0.0000080511645,0.00026954673,0.00027334527,0.0002814275,0.00021550732],"domain_scores_gemma":[0.99946994,0.00010606995,0.00013992918,0.00006867524,0.00014128987,0.00007412046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032035218,0.00021901373,0.00019535628,0.00012808567,0.0001525022,0.00024598325,0.00026722104,0.00007419303,0.000017913166],"category_scores_gemma":[0.0000785693,0.00016784667,0.000032771375,0.00005693016,0.000085068306,0.0003957645,0.00006379912,0.00022011672,0.000002450673],"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.00009770898,0.000026678728,0.0010534185,0.0001380804,0.00024389752,0.0000011345842,0.0010596099,0.94452345,0.03158395,0.019338746,0.000021846354,0.0019114832],"study_design_scores_gemma":[0.00044435883,0.000042519776,0.00017689179,0.00063927757,0.000026963342,0.000028355544,0.0010620689,0.98161685,0.009387057,0.006367811,0.0000032645555,0.000204606],"about_ca_topic_score_codex":0.000007760609,"about_ca_topic_score_gemma":1.8637164e-7,"teacher_disagreement_score":0.03709338,"about_ca_system_score_codex":0.000054476608,"about_ca_system_score_gemma":0.000020824082,"threshold_uncertainty_score":0.68445885},"labels":[],"label_agreement":null},{"id":"W1887541559","doi":"10.1109/icsmc.2001.972958","title":"An optimal scheduling technique for dual-arm cluster tools with buffer modules","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Buffer (optical fiber); Computer science; Scheduling (production processes); Schedule; Cluster (spacecraft); Wafer; Throughput; Process (computing); Reliability engineering; Distributed computing; Embedded system; Computer network; Operating system; Engineering; Electrical engineering; Operations management","score_opus":0.01971053584535483,"score_gpt":0.23297377489676485,"score_spread":0.21326323905141004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1887541559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019701606,0.00007025562,0.9765474,0.00007023766,0.000100523,0.00041278184,0.000008378194,0.00067694444,0.002411852],"genre_scores_gemma":[0.26904136,0.0000141438395,0.7302593,0.00009388336,0.00012886582,0.00016022318,0.000015456275,0.00005303823,0.00023372061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992694,0.000008097076,0.0001634538,0.00020056545,0.00011000183,0.0002484448],"domain_scores_gemma":[0.99953026,0.00004704653,0.000016082044,0.00023860678,0.00007233423,0.00009566766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000106529114,0.00016862772,0.0001393108,0.000083129795,0.00007191438,0.000114391034,0.00009904357,0.00010817931,0.0003241505],"category_scores_gemma":[0.000018831037,0.00014187646,0.00003897769,0.00012446944,0.00002099908,0.00023582122,0.000009894543,0.00010818788,0.000021080685],"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.000015334765,0.00003948629,0.00001693143,0.000021152138,0.00002183824,0.0000012618063,0.00008792065,0.99307907,0.00057017285,0.00019224614,0.00022401201,0.005730549],"study_design_scores_gemma":[0.00052680285,0.00013257824,0.000017881192,0.000022452678,0.000011010237,0.000019030917,0.000083626575,0.9852466,0.013187797,0.000020120895,0.00047515664,0.0002569584],"about_ca_topic_score_codex":0.0000012441072,"about_ca_topic_score_gemma":0.000002353936,"teacher_disagreement_score":0.24933976,"about_ca_system_score_codex":0.000024404077,"about_ca_system_score_gemma":0.000004054935,"threshold_uncertainty_score":0.5785554},"labels":[],"label_agreement":null},{"id":"W1899404607","doi":"10.1109/procce.1988.82247","title":"Resource management for a multi-arm robotic assembly cell","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Modularity (biology); Flexibility (engineering); Exploit; Architecture; Distributed computing; Task (project management); Computer architecture; Resource management (computing); Object (grammar); Robot; Software engineering; Artificial intelligence; Systems engineering; Engineering","score_opus":0.021108100384478145,"score_gpt":0.23652239291747848,"score_spread":0.21541429253300035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899404607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003110422,0.000102372804,0.9237563,0.000017667408,0.00017100779,0.00017833296,5.457344e-7,0.000319735,0.07514302],"genre_scores_gemma":[0.046419237,0.00001543481,0.94006157,0.000104207786,0.000019565443,0.000038745955,0.0000055471696,0.000032127435,0.013303569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.0000073226593,0.00010421794,0.000105530526,0.00005911428,0.00016170675],"domain_scores_gemma":[0.99978215,0.000020442343,0.000008535718,0.00012482824,0.000015305759,0.00004874791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008801973,0.00008200581,0.00007150688,0.000049346923,0.000036011243,0.000027497475,0.000059090635,0.00003522025,0.000067757246],"category_scores_gemma":[0.000008477212,0.00008030352,0.00003666181,0.000096785276,0.0000039102038,0.000026178206,0.000005473311,0.00003840257,0.000055251854],"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":[8.74695e-7,0.000036800102,0.0000101056385,0.0000510655,0.000015840362,0.0000012350094,0.000043624037,0.9948067,0.000031142226,0.0023852661,0.001714461,0.00090288406],"study_design_scores_gemma":[0.000661164,0.000012347271,0.000016561575,0.000005922525,0.000015789567,9.3989144e-7,0.00024063022,0.9788058,0.0033758278,0.000019962992,0.016714014,0.00013104384],"about_ca_topic_score_codex":5.596935e-7,"about_ca_topic_score_gemma":7.398289e-7,"teacher_disagreement_score":0.061839446,"about_ca_system_score_codex":0.000021809428,"about_ca_system_score_gemma":0.00000235364,"threshold_uncertainty_score":0.32746828},"labels":[],"label_agreement":null},{"id":"W1900325759","doi":"10.1109/nafips.1999.781814","title":"A multi-agent system for on-line fault recovery of intelligent manufacturing systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Control reconfiguration; Production line; Computer science; Production (economics); Fault (geology); Fuzzy logic; Decision support system; Manufacturing engineering; Industrial engineering; Risk analysis (engineering); Embedded system; Engineering; Artificial intelligence","score_opus":0.034530102804320575,"score_gpt":0.25133024224821393,"score_spread":0.21680013944389337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1900325759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013632995,0.0002685421,0.9818585,0.000003933873,0.0017247751,0.0003820256,0.000017213082,0.00030633862,0.0018056892],"genre_scores_gemma":[0.85556304,0.000043681313,0.14316574,0.000011576776,0.00005628488,0.000064296175,0.0000107660035,0.000040517167,0.0010441211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923646,0.000017742947,0.000334557,0.00013686645,0.00010797074,0.00016637433],"domain_scores_gemma":[0.9995815,0.0000801035,0.00004233492,0.00018293275,0.000051473085,0.000061637016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018667689,0.00013173402,0.00019883491,0.00009628345,0.000029474522,0.000023721497,0.00007248084,0.00007075273,0.000016855975],"category_scores_gemma":[0.000038440547,0.0001150467,0.000078283396,0.000059727055,0.0000060372467,0.00003302754,0.0000050945137,0.00006018482,0.0000288756],"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.000006066555,0.00002379275,0.000004223737,0.0003713165,0.000048630594,8.0926515e-7,0.000048801547,0.9979274,0.00012953291,0.00044972837,0.000069146154,0.0009205033],"study_design_scores_gemma":[0.0003467498,0.000049796607,0.0000023508903,0.00012816853,0.000011900311,0.0000048684183,0.0005910281,0.8379257,0.15987387,0.0000017646296,0.00094079087,0.00012304638],"about_ca_topic_score_codex":0.000009574658,"about_ca_topic_score_gemma":0.0000014665326,"teacher_disagreement_score":0.84193003,"about_ca_system_score_codex":0.00010163229,"about_ca_system_score_gemma":0.000008837366,"threshold_uncertainty_score":0.46914682},"labels":[],"label_agreement":null},{"id":"W1903284337","doi":"10.1109/sffcs.1999.814574","title":"Approximation schemes for minimizing average weighted completion time with release dates","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":207,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Preemption; Approximation algorithm; Polynomial-time approximation scheme; Scheduling (production processes); Time complexity; Job shop scheduling; Constant (computer programming); Computer science; Running time; Processor scheduling; Execution time; Mathematical optimization; Mathematics; Binary logarithm; Combinatorics; Algorithm; Parallel computing; Schedule","score_opus":0.009612584698921019,"score_gpt":0.19939699464740315,"score_spread":0.18978440994848214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1903284337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020920651,0.000049919447,0.9710521,0.000032319076,0.00005850641,0.00020909419,0.0000052812275,0.00046362367,0.0072084665],"genre_scores_gemma":[0.17220525,0.000008456133,0.82687145,0.000044781613,0.00003167326,0.000037618716,0.00017342948,0.000031694068,0.00059565145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995306,0.0000107667065,0.00012695516,0.000116392155,0.00008251379,0.00013275941],"domain_scores_gemma":[0.9997179,0.0000471078,0.000021026823,0.00010642577,0.00006343575,0.00004412583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008699849,0.00010015558,0.00010094003,0.000058570862,0.0000656616,0.000041556763,0.000038533468,0.000042738906,0.00024289424],"category_scores_gemma":[0.000030756903,0.00008575077,0.000021547947,0.00013148361,0.000010859071,0.00012514251,0.0000025155384,0.000044690292,0.00003819805],"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.000099974284,0.00016470495,0.0004350004,0.0003168598,0.00023209803,0.0000037287864,0.00059737614,0.946491,0.007699228,0.02919838,0.0041891364,0.010572506],"study_design_scores_gemma":[0.0005992894,0.000021413713,0.000010598574,0.000017110437,0.000011023416,0.0000037397874,0.00003536337,0.97388226,0.021277724,0.00010971081,0.0038887747,0.00014299485],"about_ca_topic_score_codex":7.9244165e-7,"about_ca_topic_score_gemma":3.908286e-7,"teacher_disagreement_score":0.1512846,"about_ca_system_score_codex":0.000021795942,"about_ca_system_score_gemma":0.000008631386,"threshold_uncertainty_score":0.3496815},"labels":[],"label_agreement":null},{"id":"W1914972556","doi":"10.1109/etfa.1995.496743","title":"Lot streaming of a single product in two-machine no-wait flowshops","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Sizing; Computer science; Job shop scheduling; Product (mathematics); Process (computing); Mathematical optimization; Downstream (manufacturing); Production (economics); Mathematics; Schedule; Operating system; Engineering; Operations management","score_opus":0.014404222032655298,"score_gpt":0.21489177864267836,"score_spread":0.20048755661002307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914972556","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.728487,0.0026380373,0.0784318,0.00029502448,0.0013814274,0.00050231646,0.000018717858,0.0013741358,0.18687154],"genre_scores_gemma":[0.91813385,0.000023642673,0.080791906,0.000016201648,0.00007207407,0.000003656039,0.000005071817,0.00002165445,0.00093194016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944234,0.000009017579,0.00019872574,0.00011581471,0.00009257018,0.0001415165],"domain_scores_gemma":[0.99974036,0.00002333818,0.000015339734,0.00015175344,0.000035701185,0.00003353502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000683895,0.00009136961,0.0001273378,0.000104172956,0.000011668806,0.000011482219,0.00006952511,0.00001999614,0.0006792799],"category_scores_gemma":[0.000058775076,0.000087512875,0.000024204432,0.00025695897,0.000011337481,0.000072004186,0.000011670073,0.00008027431,0.000069439426],"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.0000025308236,0.00012874788,0.0014891695,0.00004967962,0.000015709264,0.0000042403126,0.00041701997,0.97143376,0.0056200093,0.000051380088,0.00023882056,0.02054892],"study_design_scores_gemma":[0.0003657549,0.00001630178,0.00012469379,0.000025549269,0.0000034403658,0.0000026220537,0.00003376751,0.9883904,0.01073212,0.0000054988395,0.00019210287,0.00010774528],"about_ca_topic_score_codex":0.00005848355,"about_ca_topic_score_gemma":0.00007080752,"teacher_disagreement_score":0.18964687,"about_ca_system_score_codex":0.000026372767,"about_ca_system_score_gemma":0.000002274727,"threshold_uncertainty_score":0.74376386},"labels":[],"label_agreement":null},{"id":"W1915522605","doi":"10.3968/j.css.1923669720090503.014","title":"Research on a Fast Delivery Production System: Just-in-time production system","year":2009,"lang":"en","type":"article","venue":"Canadian social science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production (economics); Humanities; Computer science; Production system (computer science); Art; Economics","score_opus":0.026121042413192602,"score_gpt":0.2697498218976379,"score_spread":0.2436287794844453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1915522605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87834805,0.00010534242,0.0002066131,0.0012565855,0.0036396105,0.00083825464,0.000011053815,0.00070721697,0.11488727],"genre_scores_gemma":[0.99852306,0.0000028796667,0.00040254105,0.000023539718,0.0006825515,0.000014053883,0.0000026100836,0.000010241137,0.00033852944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984097,0.000053129243,0.0001480268,0.000329881,0.00053171616,0.0005275796],"domain_scores_gemma":[0.9993463,0.000008586728,0.0000175328,0.00016100345,0.0002320091,0.00023457762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013866564,0.000088086716,0.00010359279,0.0006538358,0.0006010881,0.0001329981,0.00026017023,0.00007648691,0.000004938526],"category_scores_gemma":[0.00008907608,0.00009784792,0.00001893136,0.0024068125,0.00013727622,0.00022923504,0.000006598466,0.00022780638,0.00015522774],"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.00007456068,0.00016818791,0.001497253,0.00091533025,0.000036944286,0.00024647982,0.01806095,0.7227455,0.026382627,0.045193367,0.023265384,0.16141345],"study_design_scores_gemma":[0.0010270189,0.00036872365,0.025174672,0.002136401,0.000040740568,0.00015891144,0.0884898,0.8559008,0.020209217,0.00006228233,0.0042348667,0.002196554],"about_ca_topic_score_codex":0.0015244494,"about_ca_topic_score_gemma":0.0011203734,"teacher_disagreement_score":0.1592169,"about_ca_system_score_codex":0.0029909275,"about_ca_system_score_gemma":0.00041420778,"threshold_uncertainty_score":0.7821171},"labels":[],"label_agreement":null},{"id":"W1935316586","doi":"10.1007/978-3-540-36461-0_2","title":"Branch-and-bound algorithms using fuzzy heuristics for solving large-scale flow-shop scheduling problems","year":2003,"lang":"en","type":"book-chapter","venue":"Studies in fuzziness and soft computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Acadia University; McMaster University","funders":"","keywords":"Heuristics; Flow shop scheduling; Computer science; Branch and bound; Fuzzy logic; Algorithm; Mathematical optimization; Mathematics; Job shop scheduling; Artificial intelligence; Embedded system","score_opus":0.04274323708962084,"score_gpt":0.28219089541661396,"score_spread":0.2394476583269931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935316586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041388646,0.058031835,0.92704254,0.000057246943,0.003958259,0.0009515165,0.00008568788,0.00046326054,0.0052707964],"genre_scores_gemma":[0.028000861,0.009574192,0.9558368,0.00022336529,0.002276173,0.000050729195,0.00010730594,0.00059610844,0.0033344692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977329,0.000015097045,0.00078209466,0.0006208703,0.00022269538,0.00062637794],"domain_scores_gemma":[0.9987858,0.0004219958,0.00017743604,0.00022021632,0.0002882453,0.000106336716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063079596,0.0006311627,0.000999917,0.00025720306,0.0005895573,0.00015017354,0.00013321923,0.0003449267,0.0000031849454],"category_scores_gemma":[0.00016905482,0.00067233987,0.00011241762,0.00011562425,0.00018053246,0.00009622051,0.00021632812,0.0005457162,0.0000011199534],"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.000007823151,0.000019695486,0.0002466727,0.0027674208,0.00037643276,0.000014441459,0.0037312703,0.97227454,0.00001131391,0.0017289224,0.00006503371,0.018756423],"study_design_scores_gemma":[0.00092259276,0.000023648314,0.000007871628,0.0018601364,0.00012071646,0.000027702103,0.0007744287,0.99016565,0.0000055250766,0.0041293455,0.0011969511,0.0007654352],"about_ca_topic_score_codex":0.0000027729413,"about_ca_topic_score_gemma":0.000015965446,"teacher_disagreement_score":0.04845764,"about_ca_system_score_codex":0.00012911233,"about_ca_system_score_gemma":0.000031219348,"threshold_uncertainty_score":0.99957275},"labels":[],"label_agreement":null},{"id":"W1964122413","doi":"10.1016/j.jcss.2011.04.003","title":"Scheduling malleable tasks with precedence constraints","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Royal Bank of Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Rounding; Speedup; Approximation algorithm; Regular polygon; Mathematical optimization; Algorithm; Parallel computing; Mathematics","score_opus":0.02568153275759406,"score_gpt":0.21400118481868027,"score_spread":0.18831965206108622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964122413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20283507,0.0004361459,0.790556,0.00001153462,0.00057303323,0.000036249177,4.4271718e-7,0.00004261131,0.00550893],"genre_scores_gemma":[0.6664676,0.000013541583,0.33343437,0.0000068215645,0.00007002534,2.5409383e-7,2.36627e-8,0.0000026314615,0.000004738635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999413,0.00001822626,0.00021225704,0.000068490874,0.00017826517,0.00010972108],"domain_scores_gemma":[0.99969,0.000027813036,0.000080555226,0.00004135566,0.000083524166,0.000076766126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043764708,0.000066926645,0.00013759157,0.000091010894,0.00008095688,0.0000829491,0.00014575168,0.00002330921,0.000010540484],"category_scores_gemma":[0.0000028747397,0.00004354389,0.000019542009,0.0001373858,0.00012495687,0.00023380404,0.000010385023,0.00007472668,0.0000019760623],"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.000026430975,0.00003638741,0.0119412895,0.00027321762,0.00012693244,0.000099328485,0.0049304455,0.9486831,0.000097710385,0.0038144705,0.000108340166,0.029862352],"study_design_scores_gemma":[0.0003230925,0.00027335517,0.0013773557,0.00049707736,0.000013698429,0.0013566861,0.0016385966,0.99397296,0.00037850213,0.00002608042,0.000018518374,0.00012407989],"about_ca_topic_score_codex":0.0000015845455,"about_ca_topic_score_gemma":4.179053e-7,"teacher_disagreement_score":0.46363255,"about_ca_system_score_codex":0.000009948612,"about_ca_system_score_gemma":0.000033056942,"threshold_uncertainty_score":0.17756683},"labels":[],"label_agreement":null},{"id":"W1964398475","doi":"10.1002/nav.20065","title":"Scheduling and lot streaming in two‐machine open shops with no‐wait in process","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"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; Open shop; Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Heuristic; Open-shop scheduling; Product (mathematics); Process (computing); Sequence (biology); Operations research; Flow shop scheduling; Artificial intelligence; Mathematics; Algorithm; Operating system","score_opus":0.06277714681801318,"score_gpt":0.39091044203848735,"score_spread":0.3281332952204742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964398475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8860811,0.0021066514,0.07642717,0.0006885645,0.00019407045,0.0015916323,0.00005216161,0.00033634636,0.03252231],"genre_scores_gemma":[0.9047129,0.00017641409,0.0946825,0.000022881233,0.0001368136,0.00004651654,0.00002050934,0.00004679466,0.00015468421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981343,0.00008631794,0.0003084885,0.0003495271,0.00051065645,0.00061068404],"domain_scores_gemma":[0.9989759,0.0003465447,0.000024538953,0.0002286667,0.00025433715,0.00017005867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015224684,0.00018161806,0.00025373933,0.00039205767,0.00009945209,0.00025882994,0.00042981654,0.000091603986,0.000044172386],"category_scores_gemma":[0.0011416808,0.00016602493,0.000011832142,0.000828879,0.0001406963,0.00024975504,0.00017509065,0.00097170676,0.000035804667],"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.000090167116,0.000088425746,0.010188101,0.000106181615,0.000012442341,0.00006061429,0.00054809795,0.97455686,0.00010117275,0.00056888803,0.00001360864,0.013665415],"study_design_scores_gemma":[0.0015677676,0.00008566208,0.0011922141,0.00020994271,0.0000033739823,0.000008187215,0.00042330663,0.9954812,0.0004138382,0.0002655788,0.00013054363,0.00021836607],"about_ca_topic_score_codex":0.00047357887,"about_ca_topic_score_gemma":0.0026333388,"teacher_disagreement_score":0.032367624,"about_ca_system_score_codex":0.00020378467,"about_ca_system_score_gemma":0.00013923566,"threshold_uncertainty_score":0.67702997},"labels":[],"label_agreement":null},{"id":"W1965105237","doi":"10.1007/s10951-011-0264-7","title":"Semi-online two-level supply chain scheduling problems","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Competitive analysis; Online algorithm; Supply chain; A priori and a posteriori; Scheduling (production processes); Supply chain management; Computer science; Mathematical optimization; Upper and lower bounds; Job shop scheduling; Lost sales; Operations research; Mathematics; Business; Schedule; Marketing","score_opus":0.042709024643524704,"score_gpt":0.24542468184322502,"score_spread":0.2027156571997003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965105237","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5573155,0.0023672753,0.4372834,0.00011564587,0.0016156605,0.00013113371,0.000014746318,0.00022549617,0.0009311406],"genre_scores_gemma":[0.49610522,0.00024717854,0.50286156,0.00006440289,0.00060911244,0.0000021594612,0.000005426106,0.000059643742,0.000045295455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977996,0.000044198394,0.0010219421,0.00018824285,0.00043398258,0.00051206205],"domain_scores_gemma":[0.99865407,0.00007268709,0.00033313368,0.00023630596,0.00040326637,0.0003005254],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092544407,0.00030486519,0.0004633109,0.00041894108,0.0001195189,0.00007608221,0.00042286585,0.0001626182,0.00020509737],"category_scores_gemma":[0.00018547993,0.00028465662,0.000218647,0.00047041714,0.000050599818,0.00049821154,0.000049564303,0.0008350916,0.00003532475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002649061,0.00011768909,0.002816058,0.00008051491,0.0001630199,0.000052304807,0.0016733139,0.98507905,0.0037454406,0.00015999956,0.000019399391,0.006066693],"study_design_scores_gemma":[0.002077459,0.00014876072,0.0014466371,0.0006837557,0.0001099871,0.00043874906,0.001641988,0.980978,0.011181258,0.0005729423,0.00015262976,0.00056780287],"about_ca_topic_score_codex":0.000010146845,"about_ca_topic_score_gemma":0.000006312812,"teacher_disagreement_score":0.06557817,"about_ca_system_score_codex":0.000099803074,"about_ca_system_score_gemma":0.00009075348,"threshold_uncertainty_score":0.99996054},"labels":[],"label_agreement":null},{"id":"W1965328848","doi":"10.1109/nafips.2006.365496","title":"Minimizing weighted flowtime in a two-stage flow shop with fuzzy setup and processing times","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Schedule; Flow shop scheduling; Computer science; Scheduling (production processes); Integer programming; Mathematical optimization; Fuzzy logic; Job shop scheduling; Set (abstract data type); Process (computing); Algorithm; Mathematics; Artificial intelligence; Operating system","score_opus":0.005110125770393655,"score_gpt":0.20718572482407654,"score_spread":0.20207559905368289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965328848","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62101877,0.0017642209,0.25712034,0.00023562385,0.00016500789,0.00042980484,0.000013544776,0.0018877477,0.11736493],"genre_scores_gemma":[0.48361894,0.000009614249,0.51451266,0.000035095778,0.000069420035,0.000011796757,0.000024220952,0.000041034695,0.0016771926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993069,0.000010049894,0.00017708748,0.00017674934,0.00010983134,0.00021936963],"domain_scores_gemma":[0.9997933,0.00002440449,0.000016690423,0.00009096572,0.00002732195,0.000047315985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007867596,0.00015203658,0.00015188198,0.00013711561,0.000047764985,0.00009267787,0.00005090024,0.000044688873,0.00009841609],"category_scores_gemma":[0.00000405099,0.00012751133,0.000013155672,0.00031039046,0.000024042494,0.0001801796,0.000011931323,0.00010997022,0.000010871856],"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.000015829226,0.000028701828,0.0028444494,0.00008204262,0.000013661396,0.0000283158,0.00038684648,0.98698324,0.00027551388,0.00014420276,0.00017162139,0.009025572],"study_design_scores_gemma":[0.0008091236,0.000009781736,0.0003091299,0.00006451354,0.000007663504,0.00000951612,0.00018528386,0.99712586,0.0011061012,0.000046399116,0.00011937457,0.00020727361],"about_ca_topic_score_codex":0.00004798951,"about_ca_topic_score_gemma":0.000119354234,"teacher_disagreement_score":0.25739235,"about_ca_system_score_codex":0.00002686711,"about_ca_system_score_gemma":0.000017712173,"threshold_uncertainty_score":0.51997614},"labels":[],"label_agreement":null},{"id":"W1965981116","doi":"10.1016/j.ijpe.2004.01.002","title":"A mixed integer programming model for a two line CONWIP-based production and assembly system","year":2004,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Assembly line; Computer science; Mathematical optimization; Production (economics); Production line; Integer (computer science); Mathematics; Engineering; Programming language; Economics; Microeconomics","score_opus":0.02413473988500921,"score_gpt":0.2498046402009948,"score_spread":0.22566990031598558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965981116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27468154,0.0000926901,0.7186451,0.0014743935,0.004820985,0.00018573734,0.0000069417515,0.000077863086,0.000014732552],"genre_scores_gemma":[0.7989423,0.000034682147,0.19972268,0.000024604587,0.0011825367,0.000017597644,0.000009437171,0.000025793555,0.000040337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999136,0.0000090101485,0.00048791379,0.0001589027,0.000098806355,0.00010938894],"domain_scores_gemma":[0.9989879,0.000016272399,0.00024181207,0.000084994484,0.00060874585,0.00006028334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043614997,0.00011844234,0.00016576181,0.00024732164,0.000043391705,0.0000953558,0.00012003946,0.000047680525,0.0000010229313],"category_scores_gemma":[0.00019414822,0.00012223047,0.000075382544,0.000054152424,0.000027959468,0.00037981363,0.0000092064265,0.0001317959,0.000001959119],"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.000071497496,0.0000387387,0.000025603822,0.00003566309,0.00010677528,9.659849e-7,0.00015797585,0.9912057,0.0005165242,0.00087473437,0.000041298095,0.00692456],"study_design_scores_gemma":[0.0010044432,0.000049857023,0.000008285077,0.0001290454,0.00003209145,0.0002283914,0.00019159884,0.9814129,0.016327197,0.00026804063,0.00022370862,0.00012445464],"about_ca_topic_score_codex":0.0000020532011,"about_ca_topic_score_gemma":0.000011205456,"teacher_disagreement_score":0.52426076,"about_ca_system_score_codex":0.00038110325,"about_ca_system_score_gemma":0.00009937654,"threshold_uncertainty_score":0.4984414},"labels":[],"label_agreement":null},{"id":"W1966325083","doi":"10.1016/j.ijpe.2003.07.002","title":"Multi-product capacity-constrained lot sizing with economic objectives","year":2003,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Calgary","funders":"","keywords":"Sizing; Queueing theory; Computer science; Economic order quantity; Mathematical optimization; Queue; Production (economics); Product (mathematics); Holding cost; Throughput; Operations research; Microeconomics; Economics; Mathematics; Business; Computer network","score_opus":0.01585667189638931,"score_gpt":0.2215979080474896,"score_spread":0.2057412361511003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966325083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9316317,0.0002570539,0.056588586,0.0005773411,0.009517992,0.00010997165,0.000011585919,0.00008305396,0.0012227553],"genre_scores_gemma":[0.83501345,0.00025045418,0.16376941,0.000026246535,0.0008171666,0.0000022798818,0.0000026662242,0.00002832697,0.00008999612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991877,0.000024899218,0.00042565548,0.00016177037,0.00007693542,0.00012302284],"domain_scores_gemma":[0.99932945,0.000023536746,0.00022411428,0.000115311836,0.00024220365,0.00006538036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003422892,0.00013459627,0.00017187867,0.00024490815,0.000040266405,0.00008218953,0.00017139096,0.000035845573,0.00006761879],"category_scores_gemma":[0.00012554872,0.00013248493,0.00006720716,0.000045408928,0.000060549886,0.0005369036,0.000006307902,0.00019207285,0.000020580046],"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.000026051526,0.000035938265,0.0009537979,0.000005316863,0.00028885735,0.0000030359054,0.0003221043,0.99400985,0.0008474229,0.0007101052,0.00004216196,0.0027553514],"study_design_scores_gemma":[0.010340547,0.0004960941,0.006641323,0.00037087052,0.00026617668,0.010856516,0.0060009663,0.49732873,0.4366876,0.0025322645,0.0260308,0.002448143],"about_ca_topic_score_codex":0.0000034534628,"about_ca_topic_score_gemma":0.000014067968,"teacher_disagreement_score":0.49668112,"about_ca_system_score_codex":0.00033253478,"about_ca_system_score_gemma":0.000102971484,"threshold_uncertainty_score":0.5402579},"labels":[],"label_agreement":null},{"id":"W1966508610","doi":"10.1007/s00453-004-1083-4","title":"Minimizing Makespan in Batch Machine Scheduling","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"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":"Theory of computation; Job shop scheduling; Scheduling (production processes); Binary logarithm; Algorithm; Computer science; Running time; Combinatorics; Approximation algorithm; Batch processing; Time complexity; Mathematics; Discrete mathematics; Mathematical optimization; Schedule","score_opus":0.008698031878053774,"score_gpt":0.215052947813895,"score_spread":0.20635491593584124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966508610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24949507,0.0023218761,0.73590505,0.0011726064,0.0017580315,0.000389243,0.000024209012,0.0017798934,0.0071540214],"genre_scores_gemma":[0.5351177,0.00006339009,0.46440443,0.00010784476,0.00015892881,0.000017143217,0.000022691995,0.000056831926,0.000051049454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.000014492947,0.00030990798,0.0002357762,0.0001700804,0.00038093896],"domain_scores_gemma":[0.99957204,0.000037386733,0.000024743178,0.00022693323,0.000029887267,0.00010900681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001546328,0.00020039652,0.00021159611,0.00021159733,0.00005580914,0.00005037884,0.00018202173,0.000120434896,0.00006400955],"category_scores_gemma":[0.000037305508,0.00021983456,0.000057239566,0.00048350217,0.000027145836,0.00013946129,0.000028039549,0.0003105688,0.0001327643],"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.0000049418827,0.000037183305,0.00018088879,0.000020566024,0.000020380017,0.00003822844,0.0004017404,0.97702485,0.0003338001,0.00032306876,0.000014062611,0.021600269],"study_design_scores_gemma":[0.0016066781,0.000029483079,0.00039744022,0.00009657933,0.000011720455,0.000033173645,0.00023984515,0.9892341,0.0066529396,0.0007788868,0.00048970734,0.00042945927],"about_ca_topic_score_codex":0.0000606156,"about_ca_topic_score_gemma":0.000029739625,"teacher_disagreement_score":0.2856226,"about_ca_system_score_codex":0.00013577197,"about_ca_system_score_gemma":0.000030085728,"threshold_uncertainty_score":0.89645934},"labels":[],"label_agreement":null},{"id":"W1966575776","doi":"10.1016/j.cie.2005.04.001","title":"A neural network to enhance local search in the permutation flowshop","year":2005,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"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 Manitoba; Toronto Metropolitan University","funders":"","keywords":"Tabu search; Artificial neural network; Heuristics; Permutation (music); Pairwise comparison; Local search (optimization); Local optimum; Sequence (biology); Computer science; Mathematical optimization; Artificial intelligence; Mathematics; Algorithm; Machine learning; Pattern recognition (psychology)","score_opus":0.019615114579144468,"score_gpt":0.24350762673895907,"score_spread":0.2238925121598146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966575776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18660893,0.00010989501,0.8108544,0.00055018585,0.0012865636,0.00023557311,0.0000012586032,0.00028910112,0.000064113796],"genre_scores_gemma":[0.96301913,0.000004254581,0.03456005,0.00021860302,0.0021250525,0.00002343545,0.000009587989,0.00003101435,0.000008881988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990156,0.000029434825,0.00023701428,0.00016930695,0.00018922739,0.00035940768],"domain_scores_gemma":[0.99958354,0.00012958099,0.000009661802,0.00017105615,0.000021008318,0.00008513025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031192214,0.0001544554,0.00014160905,0.00012262756,0.00004286917,0.00008502137,0.00025183614,0.000105059196,0.000010040175],"category_scores_gemma":[0.000030127469,0.00014626361,0.000039924907,0.00066440686,0.0000093689605,0.000117660624,0.000030662028,0.00045500972,0.000029091645],"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.0000046289806,0.0000056069257,0.000014807374,0.0000038365333,0.0000069042117,0.000004712893,0.0006177357,0.9113825,0.000039256727,0.00003191865,0.0005852511,0.087302856],"study_design_scores_gemma":[0.0002495589,0.000021469365,0.00013939223,0.0000461499,0.0000035780245,0.000007720341,0.00006288615,0.9970469,0.00026553054,8.9992164e-7,0.0019940361,0.00016190181],"about_ca_topic_score_codex":0.000007660583,"about_ca_topic_score_gemma":0.000004819984,"teacher_disagreement_score":0.7764102,"about_ca_system_score_codex":0.00011765523,"about_ca_system_score_gemma":0.000014980377,"threshold_uncertainty_score":0.59644574},"labels":[],"label_agreement":null},{"id":"W1967030015","doi":"10.1145/1159892.1159899","title":"An approximation algorithm for scheduling malleable tasks under general precedence constraints","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Computer science; Approximation algorithm; Task (project management); Schedule; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Mathematics","score_opus":0.017809104034928185,"score_gpt":0.25584251735419056,"score_spread":0.23803341331926237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967030015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003585701,0.00009580013,0.99299645,0.00013487134,0.000955853,0.0005532035,0.00019976578,0.0010519016,0.00042647624],"genre_scores_gemma":[0.0780278,0.000044268767,0.92051184,0.00009868876,0.00037697208,0.0002752972,0.00019041679,0.00010435844,0.00037032817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820226,0.00004087041,0.00046019215,0.00047178406,0.00030525774,0.0005196463],"domain_scores_gemma":[0.9988911,0.00012552684,0.000062662475,0.00058745296,0.00016953143,0.00016371431],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025092423,0.00035252678,0.00027467156,0.00025514254,0.000367449,0.00017793835,0.0003740579,0.00025568155,0.00021384873],"category_scores_gemma":[0.000012743117,0.00038924345,0.00014576093,0.00038763514,0.00011011029,0.0004856578,0.0000033915674,0.00031847472,0.00005099396],"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.000005461484,0.00012079782,0.0000018587606,0.000016999624,0.000038296323,0.0000010746253,0.000043889268,0.7200756,0.00058631087,0.00018396042,0.000023996989,0.27890176],"study_design_scores_gemma":[0.0010845218,0.000112779686,0.00007303284,0.000032915857,0.00005226506,0.000024620264,0.00023275404,0.98161006,0.014412446,0.0017530696,0.00014799435,0.0004635361],"about_ca_topic_score_codex":0.000044230725,"about_ca_topic_score_gemma":0.000014083066,"teacher_disagreement_score":0.2784382,"about_ca_system_score_codex":0.00014877573,"about_ca_system_score_gemma":0.000051996198,"threshold_uncertainty_score":0.99985594},"labels":[],"label_agreement":null},{"id":"W1968740817","doi":"10.1080/09537280903232354","title":"Production and changeover control policies of a class of failure prone buffered flow-shops","year":2009,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Changeover; Computer science; Mathematical optimization; Dynamic programming; Kanban; Flow line; Robustness (evolution); Production control; Scheduling (production processes); Flow shop scheduling; Flow control (data); Build to order; Rework; Job shop scheduling; Operations research; Production (economics); Control (management); Engineering; Schedule; Mathematics; Economics","score_opus":0.009475303027416273,"score_gpt":0.21741099309332435,"score_spread":0.20793569006590806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968740817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89572877,0.0042909468,0.085946344,0.008736316,0.0020670309,0.0018923372,0.00007292153,0.00087006646,0.00039524952],"genre_scores_gemma":[0.9937136,0.00003841779,0.005508504,0.000052708932,0.0005168037,0.000027158712,0.000012290904,0.000020906455,0.000109597735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989409,0.000040885363,0.00035439615,0.00025212974,0.0002011628,0.00021053906],"domain_scores_gemma":[0.9993441,0.000027033098,0.00013594824,0.00022084455,0.00021818418,0.000053885262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027199535,0.00017749533,0.00035138192,0.00020534787,0.000059156424,0.000019363695,0.00006761771,0.000096710224,0.000009346202],"category_scores_gemma":[0.00032609337,0.00017279795,0.000044430217,0.00025246397,0.000056295277,0.00019201428,0.0000048999136,0.00015593086,0.0000016260009],"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.0002612724,0.000095977426,0.0037135114,0.00019410002,0.00017901819,0.0000010741576,0.0021275168,0.90018386,0.08108223,0.000116788804,0.0012350334,0.010809622],"study_design_scores_gemma":[0.0048786984,0.0005383163,0.047239378,0.00059384236,0.00035735517,0.00009953332,0.0009431835,0.87322927,0.069638066,0.00021934985,0.0014798732,0.0007831433],"about_ca_topic_score_codex":0.0000067795263,"about_ca_topic_score_gemma":0.0000020080602,"teacher_disagreement_score":0.09798482,"about_ca_system_score_codex":0.000027290274,"about_ca_system_score_gemma":0.000016537444,"threshold_uncertainty_score":0.7046496},"labels":[],"label_agreement":null},{"id":"W1968967947","doi":"10.1115/msec2007-31126","title":"Stochastic Flow Model-Based Representation of System-Level Manufacturing Quality","year":2007,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Representation (politics); Quality (philosophy); Product (mathematics); Stochastic modelling; Industrial engineering; Engineering; Mathematics","score_opus":0.04220950119626145,"score_gpt":0.28806703462324224,"score_spread":0.2458575334269808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968967947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04951138,0.000013909743,0.9475578,0.0000054997477,0.00018206972,0.00008216437,0.0000080960735,0.00034230383,0.0022967749],"genre_scores_gemma":[0.7168157,2.6012412e-7,0.28304937,0.000007915738,0.000023717592,0.0000023863845,0.000014446944,0.000012351688,0.000073837895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992792,0.00001080943,0.0003065432,0.000105137755,0.00016714743,0.00013115654],"domain_scores_gemma":[0.99959683,0.000085604996,0.000036587695,0.0001793187,0.00004906333,0.00005257564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002888741,0.00008219126,0.00013206422,0.00009230958,0.00002510912,0.000010119388,0.00006301576,0.00005527505,0.00001811259],"category_scores_gemma":[0.000023384615,0.000081528335,0.000043502667,0.000096430056,0.000011434286,0.00005397917,0.000006338952,0.000059204733,0.000008727713],"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.000007757923,0.0000072696034,0.000020056497,0.00010530772,0.000009863298,4.6286303e-7,0.00006928665,0.9972041,0.00027870297,0.00016232285,0.000007721731,0.002127096],"study_design_scores_gemma":[0.00026319394,0.0000037138286,0.00034861857,0.000028737872,0.000007219564,6.7739245e-7,0.00019124606,0.9293757,0.06967644,0.000017344482,3.2062005e-7,0.00008680399],"about_ca_topic_score_codex":0.000026542042,"about_ca_topic_score_gemma":0.000009123122,"teacher_disagreement_score":0.66730434,"about_ca_system_score_codex":0.00005451592,"about_ca_system_score_gemma":0.000010382965,"threshold_uncertainty_score":0.3324629},"labels":[],"label_agreement":null},{"id":"W1971099568","doi":"10.1007/s10878-014-9825-y","title":"An improved two-machine flowshop scheduling with intermediate transportation","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"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":"Job shop scheduling; Scheduling (production processes); Bin packing problem; Computer science; Theory of computation; Mathematical optimization; Bin; Approximation algorithm; Algorithm; Mathematics; Schedule","score_opus":0.008314866666477752,"score_gpt":0.23253248476679536,"score_spread":0.2242176181003176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971099568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07547784,0.00014844247,0.92001414,0.000041693103,0.003956797,0.00011098411,0.000004494558,0.00013572487,0.00010990481],"genre_scores_gemma":[0.6477708,0.000033331893,0.35158962,0.000019450945,0.00049149856,0.0000023836851,0.000048203183,0.000041689025,0.0000030235208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988342,0.000048721307,0.00051551516,0.00010764043,0.00033595518,0.0001579702],"domain_scores_gemma":[0.99863416,0.000026239599,0.00023511198,0.0001381555,0.0007094003,0.0002569118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004263221,0.00016983911,0.00025964426,0.00020649847,0.000042808824,0.00009417065,0.00016687677,0.00008954787,0.000017241779],"category_scores_gemma":[0.00006716051,0.00014660269,0.00005235843,0.00032742147,0.000023838675,0.0008328895,0.0000027186813,0.00025594083,0.0000016515899],"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.0002089607,0.000069594535,0.00019349661,0.000010120558,0.000045540946,0.000008531451,0.0005604157,0.9979947,0.0001613211,0.00010838222,0.000014780941,0.0006241596],"study_design_scores_gemma":[0.0045401836,0.0005461711,0.000041856845,0.000046084286,0.0000672042,0.000017023798,0.00019887876,0.9932129,0.0009682896,0.00015048511,0.000029382527,0.00018158632],"about_ca_topic_score_codex":0.0000051586803,"about_ca_topic_score_gemma":0.0000021873523,"teacher_disagreement_score":0.572293,"about_ca_system_score_codex":0.00010498875,"about_ca_system_score_gemma":0.000110275,"threshold_uncertainty_score":0.5978284},"labels":[],"label_agreement":null},{"id":"W1971292148","doi":"10.1016/j.ejor.2004.12.007","title":"Batch scheduling in a two-level supply chain—a focus on the supplier","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"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":"Supply chain; Computer science; Holding cost; Scheduling (production processes); Total cost; Inventory cost; Lead time; Mathematical optimization; Supply chain management; Job shop scheduling; Operations research; Operations management; Business; Mathematics; Schedule; Economics","score_opus":0.07067973440272121,"score_gpt":0.3302691144357779,"score_spread":0.25958938003305665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971292148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8335098,0.00091172114,0.05786848,0.032792695,0.00045193138,0.00041775603,0.000023955428,0.00005993802,0.07396375],"genre_scores_gemma":[0.9506225,0.000092042916,0.047753826,0.00016500101,0.00091112714,0.0000033078404,0.0000032324988,0.000039214607,0.00040974165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977152,0.0006162736,0.00043449618,0.000112070404,0.0008336037,0.00028838706],"domain_scores_gemma":[0.9988818,0.00042248238,0.000033084587,0.0001508151,0.0003980263,0.00011378157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060374625,0.00010761392,0.00012065338,0.00034858787,0.000161988,0.00018280844,0.00038954694,0.000017351722,0.0005671346],"category_scores_gemma":[0.00050635805,0.00007636053,0.000053900116,0.00039832917,0.00005550923,0.00018395256,0.000039873248,0.0009800406,0.00033372737],"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.000027351445,0.000046155303,0.00024280934,0.0000028092147,0.000019674386,0.000060578783,0.00051232334,0.98183763,0.0009071567,0.004547987,0.0010762224,0.010719295],"study_design_scores_gemma":[0.0020412004,0.00019165382,0.0065320125,0.0001970822,0.00000428269,0.00012181667,0.00074631616,0.9789159,0.005836616,0.00022698939,0.0049483003,0.00023777228],"about_ca_topic_score_codex":0.0000029475673,"about_ca_topic_score_gemma":0.000008790406,"teacher_disagreement_score":0.117112726,"about_ca_system_score_codex":0.00013207611,"about_ca_system_score_gemma":0.000108088236,"threshold_uncertainty_score":0.62097263},"labels":[],"label_agreement":null},{"id":"W1971378748","doi":"10.1111/j.1475-3995.2011.00814.x","title":"A nonlinear model for optimizing the performance of a multi-product production line","year":2011,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workstation; Throughput; Computer science; Blocking (statistics); Production line; Reduction (mathematics); Production (economics); Buffer (optical fiber); Line (geometry); Nonlinear system; Product (mathematics); Parallel computing; Mathematical optimization; Operating system; Computer network; Mathematics; Engineering","score_opus":0.15835958302819284,"score_gpt":0.3711741929876319,"score_spread":0.21281460995943904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971378748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07710243,0.0001022935,0.920129,0.0006980776,0.0006891723,0.00055707915,0.000055554035,0.000056898887,0.0006094898],"genre_scores_gemma":[0.6727244,0.0001893472,0.32568702,0.000010369755,0.000108444714,0.00024179228,0.000023527662,0.000017074844,0.0009980145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891955,0.000030901832,0.00030805424,0.00018337458,0.0003894767,0.00016865265],"domain_scores_gemma":[0.99896497,0.00009167138,0.00001864492,0.00015332551,0.00074358564,0.000027786773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088684185,0.00008499637,0.00008451852,0.00030738013,0.0001494175,0.000026732932,0.00026021808,0.000044639673,0.00012353253],"category_scores_gemma":[0.00013490119,0.000072368,0.000046665366,0.00033360964,0.00009418247,0.00027770596,0.000007221277,0.00030157302,0.000006746753],"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.000056079123,0.00013993969,0.000051646024,0.000020123076,0.000031163363,1.790882e-7,0.0011454215,0.99381536,0.0013056716,0.00019063699,0.000013311999,0.0032304768],"study_design_scores_gemma":[0.00032353812,0.000030260268,0.000087431494,0.000030843054,0.000003587871,0.000005424158,0.00015957175,0.97196406,0.027205436,0.000036510395,0.00008260547,0.00007075837],"about_ca_topic_score_codex":0.000024651463,"about_ca_topic_score_gemma":0.00005327859,"teacher_disagreement_score":0.59562194,"about_ca_system_score_codex":0.00009941863,"about_ca_system_score_gemma":0.000105487095,"threshold_uncertainty_score":0.29510814},"labels":[],"label_agreement":null},{"id":"W1971887123","doi":"10.1007/s001700170211","title":"Reliability Optimisation of Flexible Manufacturing Systems with Spare Tooling","year":2001,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","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":"University of Windsor","funders":"","keywords":"Spare part; Reliability engineering; Reliability (semiconductor); Engineering; Obstacle; Flexible manufacturing system; Failure rate; Manufacturing engineering; Computer science; Operations management; Scheduling (production processes)","score_opus":0.008624233726048392,"score_gpt":0.22839711708458493,"score_spread":0.21977288335853654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971887123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89109176,0.00038613475,0.10647275,0.0003645455,0.0010717977,0.0001052849,0.000002901957,0.00017964313,0.00032515748],"genre_scores_gemma":[0.9553068,0.00029856942,0.044138182,0.00001427285,0.00013663748,0.0000065620884,0.0000022594893,0.000024625544,0.00007207429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99881697,0.000014076567,0.0005051911,0.00011738771,0.00037071342,0.00017568193],"domain_scores_gemma":[0.99902564,0.00009198527,0.0003281442,0.00025410939,0.00026361414,0.000036476395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513428,0.00014931537,0.00023234444,0.000359123,0.000047631016,0.000034827746,0.0006512907,0.000092537484,0.000029191819],"category_scores_gemma":[0.000055199784,0.000105394676,0.00005864738,0.00010811755,0.00008224123,0.00025666377,0.000055049975,0.00034600517,0.0000028894362],"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.00010598064,0.000018495708,0.00014036347,0.000015255062,0.000116335315,0.000026299633,0.000083026236,0.9842971,0.0010412108,0.0001717308,0.00001161474,0.013972576],"study_design_scores_gemma":[0.001393125,0.00018766642,0.0013858216,0.00039172673,0.000055481414,0.0017080485,0.001920144,0.034897737,0.9538279,0.0018871225,0.002053306,0.00029188648],"about_ca_topic_score_codex":0.000007683338,"about_ca_topic_score_gemma":0.0000021175588,"teacher_disagreement_score":0.95278674,"about_ca_system_score_codex":0.00016095818,"about_ca_system_score_gemma":0.000023215114,"threshold_uncertainty_score":0.429787},"labels":[],"label_agreement":null},{"id":"W1972086869","doi":"10.1007/s10898-014-0219-6","title":"Global optimization workshop 2012","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Eleventh; Global optimization; Series (stratigraphy); Mathematics; Optimization problem; Multi-objective optimization; Mathematics education; Mathematical optimization; Operations research","score_opus":0.007093836224354693,"score_gpt":0.23169526621186076,"score_spread":0.22460142998750607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972086869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009526921,0.00058386056,0.99017566,0.0002757373,0.0017656223,0.00008316688,0.00001026601,0.000171847,0.0059811505],"genre_scores_gemma":[0.13414189,0.0003576662,0.86454207,0.00018046534,0.0006608805,0.0000021076598,0.000029262452,0.000032209577,0.000053446547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848276,0.00007071597,0.00065106037,0.00013534933,0.00039870176,0.0002613946],"domain_scores_gemma":[0.99883604,0.000039949773,0.0002793739,0.00018072639,0.00046061218,0.00020332665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037035317,0.00021346984,0.00029571712,0.000075388765,0.000077852266,0.00013497236,0.0002426803,0.00018894345,0.0001924915],"category_scores_gemma":[0.00024026773,0.00020799006,0.00012906984,0.00083525165,0.000032096854,0.0007268332,0.00002283185,0.00013735646,0.000014660922],"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.000024806339,0.00003364057,0.00071718625,0.000011007077,0.000046451318,0.000002556441,0.000016590957,0.9918382,9.0939324e-7,0.00047280933,0.0025832965,0.0042525134],"study_design_scores_gemma":[0.0007979287,0.000059374448,0.00026792922,0.00005585605,0.00006114,0.00009792301,0.000041742598,0.99759054,0.000008295627,0.0001285623,0.00068600714,0.00020471896],"about_ca_topic_score_codex":0.0000017734386,"about_ca_topic_score_gemma":0.0000031803324,"teacher_disagreement_score":0.1331892,"about_ca_system_score_codex":0.00036192255,"about_ca_system_score_gemma":0.000051603198,"threshold_uncertainty_score":0.84815884},"labels":[],"label_agreement":null},{"id":"W1972249265","doi":"10.1016/j.ejor.2015.01.003","title":"Single machine scheduling with two competing agents and equal job processing times","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"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":"Time complexity; Computer science; Scheduling (production processes); Job shop scheduling; Single-machine scheduling; Computational complexity theory; Mathematical optimization; Set (abstract data type); Algorithm; Mathematics; Schedule","score_opus":0.10165406639512779,"score_gpt":0.34214054889605927,"score_spread":0.24048648250093146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972249265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7541349,0.0028605526,0.20904885,0.0008938391,0.00022201196,0.00014714991,0.0000047981316,0.00008144247,0.032606464],"genre_scores_gemma":[0.8316604,0.000018614657,0.16778816,0.000034399636,0.00032519456,4.5063592e-7,0.000004368651,0.00003472353,0.00013371302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00030803634,0.00030295266,0.000101599726,0.0007386584,0.00020112658],"domain_scores_gemma":[0.99866873,0.00008949144,0.000048904043,0.00006341104,0.0009006996,0.00022873715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030927036,0.00009603538,0.00012322281,0.0002090127,0.00017642816,0.000338597,0.00015540147,0.000012434496,0.00004328627],"category_scores_gemma":[0.00035305548,0.00007557228,0.00001681155,0.00024332605,0.00007538907,0.00032844694,0.000047390564,0.00044253442,0.000023218305],"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.00007177105,0.000041837393,0.0017846916,0.00002626643,0.000041444688,0.00017111121,0.0013934255,0.98149425,0.000999661,0.00019317686,0.00028099417,0.013501374],"study_design_scores_gemma":[0.001782362,0.00036039847,0.0007607002,0.00025447394,0.0000086837235,0.00036768324,0.00089163095,0.993565,0.0006201764,0.000027599173,0.00120278,0.00015846851],"about_ca_topic_score_codex":0.0000015983068,"about_ca_topic_score_gemma":0.0000011002918,"teacher_disagreement_score":0.0775255,"about_ca_system_score_codex":0.0000621775,"about_ca_system_score_gemma":0.00012874979,"threshold_uncertainty_score":0.32650986},"labels":[],"label_agreement":null},{"id":"W1972282966","doi":"10.1007/s10951-007-0050-8","title":"Preemptive open shop scheduling with multiprocessors: polynomial cases and applications","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Multiprocessor scheduling; Rounding; Time complexity; Multiprocessing; Scheduling (production processes); Open shop; Integer programming; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","score_opus":0.018263347463940326,"score_gpt":0.2713019003888697,"score_spread":0.2530385529249294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972282966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48711765,0.0015474705,0.5101523,0.00006382596,0.00014668274,0.00023542685,0.0000034771313,0.000066140674,0.0006670653],"genre_scores_gemma":[0.5937425,0.00009165419,0.4056591,0.00003164973,0.0004185362,0.000004390206,0.000001572265,0.00003063079,0.000020000136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881274,0.000013719478,0.00051503314,0.00015796466,0.00023398908,0.00026658768],"domain_scores_gemma":[0.99883425,0.00027971438,0.00022548067,0.0001292074,0.00030420278,0.0002271669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415228,0.00018504365,0.00029190577,0.00023311158,0.00014296289,0.00020852062,0.000303547,0.000099710785,0.000015431637],"category_scores_gemma":[0.00014086501,0.00015738144,0.00004531259,0.00034361726,0.00006409266,0.0006048758,0.00005552491,0.00040256005,0.000004661895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003046867,0.00010036514,0.006934204,0.00010978808,0.00025167898,0.00011091943,0.0011656712,0.96108055,0.001966658,0.00015520229,0.000019227573,0.02780106],"study_design_scores_gemma":[0.013518056,0.0012849079,0.0065973066,0.0022456963,0.0006886612,0.0063466183,0.028412867,0.8745717,0.05988644,0.00024342154,0.0036819442,0.0025223906],"about_ca_topic_score_codex":0.000007405868,"about_ca_topic_score_gemma":0.000012733706,"teacher_disagreement_score":0.10662481,"about_ca_system_score_codex":0.00006810766,"about_ca_system_score_gemma":0.00007858187,"threshold_uncertainty_score":0.6417828},"labels":[],"label_agreement":null},{"id":"W1972500063","doi":"10.1155/2013/218981","title":"Minimizing the Makespan for Scheduling Problems with General Deterioration Effects","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Directorate for Computer and Information Science and Engineering; Research and Innovation Foundation; Government of Jiangsu Province; Southeast University; National Natural Science Foundation of China","keywords":"Job shop scheduling; Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Time complexity; Mathematics; Algorithm; Computer network","score_opus":0.009020743116191754,"score_gpt":0.19673195719285572,"score_spread":0.18771121407666397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972500063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06926976,0.00018157253,0.9284221,0.00009941915,0.00014183937,0.0013100625,8.2856974e-7,0.00040210242,0.00017231572],"genre_scores_gemma":[0.58686596,0.000006881057,0.41166055,0.000023202574,0.000092950504,0.0012257883,0.0000055516225,0.000082193386,0.000036890742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988382,0.000013328059,0.0003735862,0.00019556603,0.00016449415,0.0004148681],"domain_scores_gemma":[0.9993473,0.0002699717,0.000035511854,0.00021942033,0.000051442777,0.00007629552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026990872,0.00024360162,0.00025093215,0.00011439254,0.00006238797,0.00016273839,0.00016885897,0.00009915593,0.000016450245],"category_scores_gemma":[0.00011349497,0.00017158977,0.000048867107,0.00027533257,0.00002402776,0.00021647746,0.00002144009,0.00022952452,0.000023604462],"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":[9.5050586e-7,0.000016487558,0.000032547192,0.0010476385,0.000021970547,5.6197933e-7,0.00048853626,0.9925029,0.004004003,0.00077589456,0.000010735641,0.0010977368],"study_design_scores_gemma":[0.0004775867,0.000043109456,0.0000583507,0.00048288988,0.000014870611,0.000010748382,0.000046864443,0.995749,0.0013596342,0.0014698756,0.000032936852,0.0002541086],"about_ca_topic_score_codex":0.0000035098374,"about_ca_topic_score_gemma":0.0000025948227,"teacher_disagreement_score":0.51759624,"about_ca_system_score_codex":0.0000650618,"about_ca_system_score_gemma":0.0000090992135,"threshold_uncertainty_score":0.69972277},"labels":[],"label_agreement":null},{"id":"W1972551986","doi":"10.1287/inte.2013.0716","title":"Scotsburn Dairy Group Uses a Hierarchical Production Scheduling and Inventory Management System to Control Its Ice Cream Production","year":2014,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nova Scotia Department of Agriculture; Dalhousie University","funders":"","keywords":"Operations research; Production planning; Aggregate planning; Scheduling (production processes); Schedule; Production (economics); Synchronizing; Term (time); Integer programming; Operations management; Computer science; Engineering; Economics; Microeconomics; Algorithm","score_opus":0.010499036831239969,"score_gpt":0.21711851220491413,"score_spread":0.20661947537367414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972551986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34221566,0.0001885706,0.6434476,0.0007454047,0.0031195055,0.0011182424,0.0000037087534,0.0008334403,0.008327898],"genre_scores_gemma":[0.96940243,0.00013069235,0.028914893,0.0002518356,0.0011153684,0.000027020891,0.0000052765095,0.000044981472,0.00010751475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984473,0.000021003469,0.00053931127,0.00023871286,0.00043824763,0.0003154228],"domain_scores_gemma":[0.99922204,0.000027760721,0.00013229986,0.0002236895,0.00010222207,0.00029197428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084326573,0.00023855438,0.00028005117,0.0004576479,0.00023050571,0.00021822567,0.00014269921,0.00009822904,0.0000045741003],"category_scores_gemma":[0.00010382657,0.0002055914,0.000058515212,0.00038318365,0.000030904124,0.00023332439,0.00002832997,0.00048131202,0.00006361389],"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.00007862137,0.000044427317,0.000064191256,0.0002471482,0.00015006839,0.0000037304364,0.00020998521,0.976084,0.00021079463,0.007081101,0.00016141715,0.015664527],"study_design_scores_gemma":[0.001233256,0.00018408652,0.00042229157,0.00047656999,0.00016251992,0.00015730776,0.00082478806,0.9915546,0.00083791395,0.00021429049,0.0034676215,0.00046476393],"about_ca_topic_score_codex":4.983814e-7,"about_ca_topic_score_gemma":0.0000010090868,"teacher_disagreement_score":0.6271868,"about_ca_system_score_codex":0.00020821851,"about_ca_system_score_gemma":0.000014154966,"threshold_uncertainty_score":0.8383774},"labels":[],"label_agreement":null},{"id":"W1972617451","doi":"10.1080/07408170601181674","title":"The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times","year":2007,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Flow shop scheduling; Regular polygon; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Operations research; Mathematics; Schedule; Geometry; Operating system","score_opus":0.006775525593504752,"score_gpt":0.21714861713138117,"score_spread":0.21037309153787642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972617451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014366218,0.00074784935,0.98646057,0.0002712518,0.00021248826,0.00023125076,0.00000923542,0.0008170075,0.0098137185],"genre_scores_gemma":[0.71831757,0.00007062423,0.27920607,0.000065927925,0.00020232536,0.000043705735,0.000016254317,0.00010489776,0.0019726162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998812,0.000018963654,0.000296942,0.00021005729,0.0002673402,0.00039470062],"domain_scores_gemma":[0.9993695,0.00012263503,0.0000397327,0.00021509218,0.00012129834,0.00013174655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003895977,0.00020836618,0.0001532939,0.00009724323,0.00062143395,0.0001588944,0.000163344,0.00007985536,0.00015324018],"category_scores_gemma":[0.000009166342,0.00015403422,0.000058054786,0.00035322746,0.00007552838,0.00017223645,0.0000032637276,0.00043642963,0.00006679717],"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.00004412946,0.000027919881,0.000023509137,0.000031326043,0.00006089591,0.000005821389,0.00046088875,0.9575027,0.00016817189,0.000022845226,0.000016299005,0.04163547],"study_design_scores_gemma":[0.0006983027,0.00003252601,0.00001912558,0.00007301457,0.00005954205,0.000039925875,0.00051632506,0.9928672,0.002267184,0.000024308814,0.0031530096,0.00024955987],"about_ca_topic_score_codex":0.000013887565,"about_ca_topic_score_gemma":0.0001487613,"teacher_disagreement_score":0.716881,"about_ca_system_score_codex":0.00006851092,"about_ca_system_score_gemma":0.000044732613,"threshold_uncertainty_score":0.62813336},"labels":[],"label_agreement":null},{"id":"W1972778917","doi":"10.1007/s00453-003-1053-2","title":"Minimizing Mean Completion Time in a Batch Processing System","year":2003,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Batch processing; Uniprocessor system; Theory of computation; Scheduling (production processes); Time complexity; Computer science; Job scheduler; Job shop scheduling; Polynomial-time approximation scheme; Mathematical optimization; Algorithm; Parallel computing; Mathematics; Schedule; Operating system","score_opus":0.008291348902379302,"score_gpt":0.19922173936996293,"score_spread":0.19093039046758362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972778917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1236411,0.0019156622,0.81015277,0.00015076365,0.0014628086,0.00080426334,0.00001970772,0.0035079112,0.058344997],"genre_scores_gemma":[0.7538572,0.000007150745,0.24576433,0.000028776369,0.000093200455,0.000026821912,0.000019616455,0.00005791007,0.00014498051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990244,0.00004818223,0.0002842927,0.00019662241,0.00016408678,0.00028240576],"domain_scores_gemma":[0.99966425,0.000035453188,0.000032441058,0.0001473275,0.000047959453,0.00007254314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024776725,0.00015589272,0.00020912696,0.00015080521,0.000065855056,0.00005819963,0.00009762477,0.00009070992,0.000048459046],"category_scores_gemma":[0.000023284785,0.00017021995,0.000036411922,0.00041468695,0.000018078726,0.00012035165,0.00000862964,0.0001566373,0.00016114123],"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.000029880399,0.00024394898,0.0008085984,0.0011199014,0.00013774235,0.00016367243,0.0064658774,0.8474263,0.0051215156,0.002892835,0.0014155237,0.13417418],"study_design_scores_gemma":[0.0004318522,0.000011211668,0.00008129898,0.00013291356,0.000008871727,0.000035177825,0.0004047832,0.9962824,0.0016707153,0.000022080398,0.0006991603,0.00021951635],"about_ca_topic_score_codex":0.000007735492,"about_ca_topic_score_gemma":0.0000025151926,"teacher_disagreement_score":0.6302161,"about_ca_system_score_codex":0.00014606438,"about_ca_system_score_gemma":0.000023739749,"threshold_uncertainty_score":0.69413686},"labels":[],"label_agreement":null},{"id":"W1973201762","doi":"10.1134/s1990478910040010","title":"Structural properties of optimal schedules with preemption","year":2010,"lang":"en","type":"article","venue":"Journal of Applied and Industrial Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Russian Foundation for Basic Research","keywords":"Preemption; Mathematical optimization; Dynamic priority scheduling; Rate-monotonic scheduling; Fair-share scheduling; Computer science; Scheduling (production processes); Two-level scheduling; Schedule; Job shop scheduling; Nurse scheduling problem; Mathematics","score_opus":0.025275003245439367,"score_gpt":0.20404640638962548,"score_spread":0.1787714031441861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973201762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957286,0.00003312635,0.0036523666,0.000015097383,0.00018696106,0.0000757462,0.0000012515402,0.00001679338,0.00029004912],"genre_scores_gemma":[0.827683,0.000011016262,0.17205438,0.0000017870157,0.00023321847,9.41396e-7,3.476936e-7,0.00001129882,0.000004058577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994256,0.0000030134709,0.00030879996,0.000036417823,0.0001531296,0.00007303839],"domain_scores_gemma":[0.99963796,0.000018449398,0.00016354,0.000062694024,0.00006768614,0.00004965283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016850195,0.00008474129,0.0001966955,0.00006712866,0.000024558474,0.000029859442,0.00006800979,0.000101876576,0.00001446376],"category_scores_gemma":[0.000027614968,0.000054543918,0.000022090191,0.000068556656,0.000056038327,0.00008432192,0.000008217399,0.0003122741,4.5139905e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083546404,0.00023330275,0.000754097,0.0009477236,0.00071048114,0.0000078237545,0.008817753,0.59366506,0.31540903,0.040574174,0.00013560492,0.037909463],"study_design_scores_gemma":[0.0060678525,0.00057375996,0.00020771053,0.0006849983,0.0002930614,0.00030157412,0.0052485727,0.5664604,0.41723627,0.0021996882,0.0001393172,0.00058683247],"about_ca_topic_score_codex":2.860788e-7,"about_ca_topic_score_gemma":2.9658284e-7,"teacher_disagreement_score":0.16840202,"about_ca_system_score_codex":0.0000053160156,"about_ca_system_score_gemma":0.00002239742,"threshold_uncertainty_score":0.22242364},"labels":[],"label_agreement":null},{"id":"W1973208472","doi":"10.1007/s10922-009-9124-6","title":"Operations Research Methods for Autonomic Resource Management","year":2009,"lang":"en","type":"article","venue":"Journal of Network and Systems Management","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 Toronto","funders":"","keywords":"Computer science; Process management; Knowledge management; Business","score_opus":0.050981478103081346,"score_gpt":0.36595400759125124,"score_spread":0.3149725294881699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973208472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010738221,0.005053638,0.9811777,0.00034338958,0.00084147323,0.0005038536,6.34012e-7,0.00004810924,0.010957381],"genre_scores_gemma":[0.08571305,0.0017435653,0.90794647,0.000109267006,0.0011415528,0.000037506303,0.0000038245926,0.000028408556,0.0032763637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893504,0.00012401995,0.00044184897,0.00010016038,0.00016109426,0.00023782467],"domain_scores_gemma":[0.99957377,0.00006928834,0.000041886866,0.0001401074,0.00008990878,0.000085064305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028509342,0.00009228291,0.00019690102,0.00021295703,0.00016693569,0.00017167929,0.00014692706,0.00003895125,0.000003043402],"category_scores_gemma":[0.0000067220226,0.000081121325,0.000054022035,0.00021441017,0.000012169058,0.00007635784,0.000023457713,0.00013535235,0.0000019691663],"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.000010549197,0.000012543496,0.0000030055462,0.00006665069,0.00012721788,0.000006548353,0.00008420469,0.916407,0.0000031874788,0.011970993,0.010842477,0.06046563],"study_design_scores_gemma":[0.00048524796,0.000100374826,0.00020635397,0.00016340133,0.00004909049,0.000016088903,0.00071235036,0.85993457,0.0000028928403,0.00038842563,0.13784961,0.000091617985],"about_ca_topic_score_codex":6.70498e-7,"about_ca_topic_score_gemma":2.635095e-7,"teacher_disagreement_score":0.12700714,"about_ca_system_score_codex":0.00007805701,"about_ca_system_score_gemma":0.000004378617,"threshold_uncertainty_score":0.33080316},"labels":[],"label_agreement":null},{"id":"W1974123630","doi":"10.1504/ijise.2013.052606","title":"Scheduling identical parallel machine with unequal job release time to minimise total flow time","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Heuristics; Computer science; Mathematical optimization; Scheduling (production processes); Flow shop scheduling; Schedule; Job shop scheduling; Heuristic; Algorithm; Mathematics","score_opus":0.011209743274393799,"score_gpt":0.2007290670116384,"score_spread":0.1895193237372446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974123630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8084551,0.00049945107,0.18725446,0.00053173164,0.0024298427,0.00030520413,0.000023252058,0.00016144874,0.00033952136],"genre_scores_gemma":[0.95463985,0.000024702607,0.041230306,0.000028743942,0.0029994093,0.000018029426,0.000014194064,0.00007420084,0.0009705364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986137,0.000021121517,0.00060355343,0.00011740372,0.00044630733,0.0001979277],"domain_scores_gemma":[0.9991549,0.00009333335,0.00009279017,0.000077360586,0.0002929669,0.0002886515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025508399,0.00019087823,0.00029598625,0.00027927043,0.00002662127,0.000258967,0.00019464815,0.00012018178,0.00019536479],"category_scores_gemma":[0.00018514862,0.00015857883,0.00006142797,0.00014527932,0.000011825422,0.00030572072,0.000031671563,0.00033069396,0.00014255442],"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.000050516464,0.000012898718,0.000137005,0.0000080375685,0.0002027399,0.00006482044,0.00007263711,0.99553317,0.0011119933,0.000018656654,0.00038177051,0.0024057417],"study_design_scores_gemma":[0.0012123191,0.00009271302,0.000084585736,0.00034952984,0.000022949518,0.00051772484,0.000043893997,0.9970627,0.0000941351,0.0000021127678,0.0003212177,0.00019612761],"about_ca_topic_score_codex":0.000021249198,"about_ca_topic_score_gemma":1.8555185e-7,"teacher_disagreement_score":0.14618479,"about_ca_system_score_codex":0.00008524423,"about_ca_system_score_gemma":0.000030693427,"threshold_uncertainty_score":0.6466657},"labels":[],"label_agreement":null},{"id":"W1974497129","doi":"10.1080/00207540701738052","title":"Real time distributed shop floor scheduling using an agent-based service-oriented architecture","year":2008,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Workcell; Scheduling (production processes); Distributed computing; Distributed manufacturing; Dynamic priority scheduling; Multi-agent system; Job shop scheduling; Computer science; Flow shop scheduling; Engineering; Industrial engineering; Manufacturing engineering; Artificial intelligence; Embedded system; Robot; Computer network; Operations management","score_opus":0.06575094480134529,"score_gpt":0.3445347874804267,"score_spread":0.2787838426790814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974497129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8751006,0.000059425358,0.12156801,0.0012377375,0.0017382494,0.0001060685,0.000021792674,0.000105300605,0.000062789986],"genre_scores_gemma":[0.7862629,0.00011766614,0.2099079,0.0000387126,0.0033091712,0.0000055986316,0.0001487294,0.00006555161,0.00014374817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997602,0.00016411996,0.00045914773,0.00019828998,0.0013089855,0.00026745396],"domain_scores_gemma":[0.99638754,0.000049260325,0.000111078894,0.00018818265,0.0030851208,0.00017881897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009959518,0.00013346518,0.00016454393,0.0007212315,0.00018591894,0.000075210635,0.00040987032,0.00008826232,0.00019375964],"category_scores_gemma":[0.00040199718,0.00012855374,0.00007685919,0.0007090377,0.00007943957,0.00034420806,0.000035781402,0.00064094237,0.000038773425],"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.00012250147,0.00012118117,0.00023912425,0.000012843358,0.00009725752,0.00007390578,0.00031998323,0.964955,0.032606244,0.00000831865,0.00016238536,0.0012812823],"study_design_scores_gemma":[0.0007511369,0.000080682425,0.0005487682,0.00010491477,0.00001233029,0.000578238,0.00023059224,0.9714628,0.025402742,0.000045893656,0.0006214704,0.00016044703],"about_ca_topic_score_codex":0.000031990254,"about_ca_topic_score_gemma":0.0000035806443,"teacher_disagreement_score":0.088837706,"about_ca_system_score_codex":0.00033332917,"about_ca_system_score_gemma":0.00024563426,"threshold_uncertainty_score":0.52422696},"labels":[],"label_agreement":null},{"id":"W1975764103","doi":"10.1504/ijor.2010.032422","title":"Mathematical formulations for scheduling in manufacturing cells with limited capacity buffers","year":2010,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Integer programming; Distributed computing; Automation; Flexible manufacturing system; Mathematical optimization; Job shop; Heuristic; Deadlock prevention algorithms; Cellular manufacturing; Operations research; Industrial engineering; Deadlock; Flow shop scheduling; Engineering; Artificial intelligence; Computer network; Algorithm; Mathematics; Routing (electronic design automation)","score_opus":0.054048320108362094,"score_gpt":0.34394033893592435,"score_spread":0.28989201882756227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975764103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8195572,0.000011314546,0.17839731,0.00073688815,0.0004965233,0.00016741935,0.000015320025,0.000017372382,0.00060063927],"genre_scores_gemma":[0.7282959,0.00000995454,0.2712647,0.0000224048,0.000319271,0.000015631187,0.000010246829,0.000017137989,0.000044697867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840254,0.000027450298,0.00040899476,0.000100421195,0.00085630873,0.0002042707],"domain_scores_gemma":[0.99796283,0.00054746796,0.00004772824,0.00008300121,0.0012577742,0.000101186444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075345,0.0000942601,0.00013184188,0.00056431483,0.000082753555,0.00018436312,0.00032165568,0.00008011827,0.00016535046],"category_scores_gemma":[0.00038671706,0.00007858694,0.00005550548,0.00014234055,0.0000619063,0.00038737117,0.00002088382,0.0006915139,0.000011867058],"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.00009219412,0.00009097343,0.00037589675,0.000017692542,0.000085943764,0.00001427813,0.0003347463,0.9744999,0.014559831,0.0085116,0.00008210041,0.0013348552],"study_design_scores_gemma":[0.0013346804,0.000077400844,0.0012544703,0.000096826225,0.0000056989293,0.00010413195,0.0001530208,0.93520206,0.058045253,0.0030912906,0.0004992174,0.00013591997],"about_ca_topic_score_codex":0.0000045342977,"about_ca_topic_score_gemma":0.000028593719,"teacher_disagreement_score":0.092867404,"about_ca_system_score_codex":0.00012383531,"about_ca_system_score_gemma":0.00012998213,"threshold_uncertainty_score":0.32046825},"labels":[],"label_agreement":null},{"id":"W1975784696","doi":"10.1016/j.dam.2007.02.003","title":"A survey of scheduling with controllable processing times","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":419,"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":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Mathematical optimization; Rate-monotonic scheduling; Fair-share scheduling; Data processing; Distributed computing; Mathematics; Database; Schedule","score_opus":0.012435765269643264,"score_gpt":0.23287126122586468,"score_spread":0.22043549595622142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975784696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04961553,0.00022734002,0.92838097,0.0000039642955,0.000028090337,0.00019082818,0.000007401092,0.00023724455,0.021308666],"genre_scores_gemma":[0.57266915,0.0000042384213,0.4272251,0.000006556024,0.000013591224,0.000005706665,0.000013533647,0.000033617922,0.000028469345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.0000035332826,0.0003284595,0.00010988549,0.00020089529,0.00022821518],"domain_scores_gemma":[0.9994345,0.00013090415,0.000091652975,0.00017605236,0.00010451173,0.00006241031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055079686,0.00014837994,0.00027454592,0.00007525737,0.00004371601,0.00003232075,0.00010883142,0.00006510986,0.00002476661],"category_scores_gemma":[0.00003681291,0.000120553894,0.000020475793,0.0003429758,0.000044546858,0.000049935043,0.000012713732,0.00009893119,0.000011335657],"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.0001225775,0.00015549762,0.0006261894,0.0017021444,0.00026460906,0.0000066466882,0.0038965154,0.9602208,0.010093738,0.00914966,0.00005456777,0.01370706],"study_design_scores_gemma":[0.0008190778,0.000021498388,0.00030481283,0.00012742788,0.00004151857,0.0000034688485,0.000983908,0.9751574,0.021915877,0.00034112355,0.000011816498,0.00027206543],"about_ca_topic_score_codex":0.0000047493886,"about_ca_topic_score_gemma":0.000012124377,"teacher_disagreement_score":0.52305365,"about_ca_system_score_codex":0.000016799511,"about_ca_system_score_gemma":0.000024145118,"threshold_uncertainty_score":0.4916045},"labels":[],"label_agreement":null},{"id":"W1976269048","doi":"10.1007/s10878-009-9270-5","title":"Just-in-time scheduling with controllable processing times on parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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; Israel Science Foundation","keywords":"Theory of computation; Computer science; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Algorithm","score_opus":0.005926028021514501,"score_gpt":0.22068265834988926,"score_spread":0.21475663032837475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976269048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061154928,0.001524205,0.9237782,0.001159398,0.0031462063,0.0005596566,0.0000027464678,0.00040959392,0.0082651],"genre_scores_gemma":[0.5857547,0.000085870444,0.4134277,0.00011008567,0.0005062301,0.000002238733,0.0000072177054,0.00004024616,0.0000657124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876314,0.00004030597,0.0004938791,0.00010807281,0.00039367971,0.00020089887],"domain_scores_gemma":[0.9992522,0.00005302574,0.00022441136,0.000095071235,0.0002844729,0.00009081308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372974,0.00018449644,0.0003534929,0.00029352953,0.000066193126,0.00017092488,0.00016501728,0.000109338536,0.000044364817],"category_scores_gemma":[0.00008933593,0.00015249135,0.000052871605,0.00043479586,0.000014997766,0.00042078295,0.0000045103056,0.0002779191,0.000005827008],"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.0002987067,0.000107134874,0.00009196349,0.000010804808,0.000019573306,0.000014165911,0.00009767531,0.9975366,0.000051775965,0.0003333833,0.000056920733,0.0013812842],"study_design_scores_gemma":[0.004171728,0.0004253748,0.000058941874,0.00021595777,0.00003237231,0.000021973221,0.000025322557,0.9941748,0.00018333097,0.00046983527,0.00003779131,0.00018261612],"about_ca_topic_score_codex":6.4760815e-7,"about_ca_topic_score_gemma":5.3988142e-8,"teacher_disagreement_score":0.52459973,"about_ca_system_score_codex":0.00009848461,"about_ca_system_score_gemma":0.00006932995,"threshold_uncertainty_score":0.6218417},"labels":[],"label_agreement":null},{"id":"W1976972714","doi":"10.1016/s0278-6125(00)80011-4","title":"Scheduling of manufacturing systems under dual-resource constraints using genetic algorithms","year":2000,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":98,"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 Windsor","funders":"","keywords":"Tardiness; Computer science; Staffing; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Flow shop scheduling; Genetic algorithm scheduling; Dynamic priority scheduling; Fair-share scheduling; Schedule; Mathematics","score_opus":0.017955954343790655,"score_gpt":0.23040928391890994,"score_spread":0.21245332957511928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976972714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8872411,0.0032478746,0.10637198,0.000014165021,0.0020692784,0.00025833008,0.000015869342,0.0001441007,0.0006373071],"genre_scores_gemma":[0.97098505,0.00017005246,0.02749683,0.000015097879,0.0010222647,0.0000036398224,0.0000033400308,0.00011362255,0.0001900907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650383,0.00015630906,0.0017373855,0.00026385827,0.0007895545,0.0005490579],"domain_scores_gemma":[0.99839467,0.00017013603,0.00063090574,0.00038071952,0.00013485321,0.00028869888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007685092,0.00043568882,0.0008883426,0.00047419325,0.00014267344,0.00022218657,0.00036842714,0.00026693215,0.00014455627],"category_scores_gemma":[0.000020477495,0.00040898842,0.00026433068,0.00014380524,0.00011010728,0.00028643513,0.000030777777,0.00057827606,0.000022795282],"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.00001794836,0.000029287949,0.000047066118,0.00042260863,0.00030112578,0.00008742265,0.00024426772,0.9936989,0.00039953837,0.0000066494085,0.000030415884,0.0047147623],"study_design_scores_gemma":[0.0019099938,0.00011284672,0.00089291035,0.0021902116,0.00024284952,0.003991973,0.0022584961,0.91496056,0.07130989,0.000022647162,0.0013075776,0.00080006226],"about_ca_topic_score_codex":0.000052099378,"about_ca_topic_score_gemma":4.7939307e-7,"teacher_disagreement_score":0.08374397,"about_ca_system_score_codex":0.00025893896,"about_ca_system_score_gemma":0.0000711379,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W1977476763","doi":"10.1017/s0269888901000200","title":"Holonic and multi-agent systems in industry","year":2001,"lang":"en","type":"article","venue":"The Knowledge Engineering Review","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Key (lock); Computer science; Natural (archaeology); Autonomous agent; Face (sociological concept); Social system; Multi-agent system; Knowledge management; Computer security; Artificial intelligence; Sociology","score_opus":0.026079035986373154,"score_gpt":0.2603585350401403,"score_spread":0.23427949905376713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977476763","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020022929,0.96179193,0.01584788,0.0001219538,0.0008361404,0.00042092966,0.0000014864415,0.00042316946,0.0005336075],"genre_scores_gemma":[0.5623301,0.42707783,0.008362813,0.00011481259,0.00045722676,0.0003101344,0.000009617827,0.00016710587,0.001170371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993808,0.000024584202,0.0002333924,0.000110806686,0.00005487164,0.00019551982],"domain_scores_gemma":[0.999644,0.000053341377,0.000015421985,0.0002055768,0.00001932843,0.000062347885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003581682,0.00014628848,0.00022357903,0.00006330797,0.000022943492,0.000023613979,0.0001307174,0.00009202979,0.000015305506],"category_scores_gemma":[0.000071208466,0.0001129937,0.000028252722,0.00038455662,0.000011409112,0.000045248235,0.000026606647,0.00038372682,0.00006959046],"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.0000010053509,0.000045687993,0.00068886054,0.0051426645,0.000055323217,0.000024175954,0.00047556512,0.9502902,0.0000678173,0.00027321884,0.00064549624,0.04228996],"study_design_scores_gemma":[0.00018907334,0.0000046332316,0.0010383356,0.0029018659,0.000020194972,0.000058405836,0.000016519572,0.9693577,0.000007670462,6.337585e-7,0.026235707,0.00016920999],"about_ca_topic_score_codex":0.0000035478072,"about_ca_topic_score_gemma":0.0000020044224,"teacher_disagreement_score":0.5423072,"about_ca_system_score_codex":0.000053390122,"about_ca_system_score_gemma":0.000008091172,"threshold_uncertainty_score":0.46077493},"labels":[],"label_agreement":null},{"id":"W1977513378","doi":"10.1108/13552511111157371","title":"Simulation‐based approach to joint production and preventive maintenance scheduling on a failure‐prone machine","year":2011,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Preventive maintenance; Tardiness; Corrective maintenance; Scheduling (production processes); Production (economics); Maintenance actions; Operations research; Due date; Computer science; Reliability engineering; Proactive maintenance; Context (archaeology); Operations management; Job shop scheduling; Risk analysis (engineering); Engineering; Business; Schedule; Economics","score_opus":0.03720795776466069,"score_gpt":0.2596485919597839,"score_spread":0.22244063419512322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977513378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13597858,0.000113456146,0.862889,0.00017149295,0.0003995264,0.00022483397,0.0000033908827,0.00008328523,0.00013641482],"genre_scores_gemma":[0.6706087,0.000011436648,0.32919112,0.000045716428,0.00008795182,0.000009614952,0.0000010420625,0.00002762812,0.00001680077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846214,0.000051932893,0.00072662276,0.00020414464,0.00025858733,0.0002965616],"domain_scores_gemma":[0.99921614,0.00010689828,0.00016374903,0.00018506788,0.0001923118,0.00013584482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013426817,0.00021642736,0.00037089176,0.00042080996,0.000031787415,0.000028742152,0.00013074875,0.000079486665,0.000006118411],"category_scores_gemma":[0.0017291526,0.00019855282,0.000078375684,0.00042459826,0.000021228774,0.00022435859,0.000018568178,0.00047122248,0.0000026870564],"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.000057984817,0.00008055363,0.00016482186,0.00013389219,0.000028781484,0.0000052439505,0.0012353152,0.9964874,0.0007636936,0.00038636575,0.000010578636,0.0006453604],"study_design_scores_gemma":[0.0005670658,0.00008113766,0.0031463085,0.00066463713,0.000010978101,0.000012606671,0.00035474892,0.9925751,0.002229964,0.00007323765,0.00003787491,0.00024632888],"about_ca_topic_score_codex":0.000006687837,"about_ca_topic_score_gemma":0.0000032626347,"teacher_disagreement_score":0.5346301,"about_ca_system_score_codex":0.00018850213,"about_ca_system_score_gemma":0.00002165288,"threshold_uncertainty_score":0.8096749},"labels":[],"label_agreement":null},{"id":"W1978025869","doi":"10.1016/j.ejor.2013.06.009","title":"Steady-state skill levels of workers in learning and forgetting environments: A dynamical system analysis","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Forgetting; Production (economics); Convergence (economics); Differentiable function; Computer science; Constant (computer programming); Steady state (chemistry); Work (physics); Time horizon; Class (philosophy); Industrial engineering; Artificial intelligence; Mathematics; Microeconomics; Cognitive psychology; Economics; Mathematical optimization; Psychology; Engineering","score_opus":0.024760232055631166,"score_gpt":0.28631308821202206,"score_spread":0.2615528561563909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978025869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93308085,0.00020162405,0.06469909,0.00009076481,0.000038529317,0.000085911655,0.000003217118,0.000008868508,0.0017911164],"genre_scores_gemma":[0.9760581,0.00004141013,0.023548424,0.0000026175687,0.000038637398,0.0000013446196,0.000002847646,0.00001867937,0.00028791575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823445,0.0005251979,0.0004890764,0.00009032039,0.0004885044,0.00017245131],"domain_scores_gemma":[0.9994005,0.00020130872,0.00006466545,0.00005794761,0.00017667004,0.00009893641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025516981,0.000071505165,0.00017424983,0.00052470993,0.00006648097,0.000087007305,0.00011836667,0.000016663682,0.000081929174],"category_scores_gemma":[0.0002522978,0.0000630772,0.000047106827,0.00046085232,0.000051550116,0.00020766302,0.0000397303,0.000445948,0.00001765413],"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.0000089729065,0.000015282121,0.029362367,0.000022381286,0.0001419642,0.000022525648,0.0006241079,0.9652567,0.0016034669,0.00004436064,0.000013772879,0.0028840834],"study_design_scores_gemma":[0.0005261343,0.00007466036,0.1040813,0.00013053263,0.000015838812,0.000015233249,0.0035082812,0.8913013,0.0002201088,0.000005366292,0.00003869788,0.000082570456],"about_ca_topic_score_codex":0.0000059927515,"about_ca_topic_score_gemma":0.0000014463257,"teacher_disagreement_score":0.07471894,"about_ca_system_score_codex":0.000094874515,"about_ca_system_score_gemma":0.000026683962,"threshold_uncertainty_score":0.25722134},"labels":[],"label_agreement":null},{"id":"W1978386360","doi":"10.1016/s0736-5845(00)00007-7","title":"Performance comparison and analysis of reactive and planning-based control architectures for manufacturing","year":2000,"lang":"en","type":"article","venue":"Robotics and Computer-Integrated Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Architecture; Control (management); Computer science; Plan (archaeology); Hierarchical control system; Time horizon; Computer-integrated manufacturing; Manufacturing engineering; Systems engineering; Industrial engineering; Engineering; Artificial intelligence; Business","score_opus":0.00918664366273916,"score_gpt":0.21833266441638302,"score_spread":0.20914602075364386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978386360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064695,0.00019362583,0.2929875,0.000013661362,0.000054961434,0.0001310395,0.000021729773,0.00009104584,0.000036959238],"genre_scores_gemma":[0.9462606,0.00003942748,0.053552393,0.000034964967,0.000039524974,0.0000075348657,0.00003457494,0.000022734212,0.000008281511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.000017817962,0.00028649272,0.00024795742,0.00009258428,0.00021995626],"domain_scores_gemma":[0.99949884,0.00018825647,0.0000613271,0.00012387785,0.00003059393,0.00009709264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008977758,0.0002333745,0.00046440744,0.00027691462,0.00010860351,0.000073727744,0.000069914786,0.0000883436,0.000007924012],"category_scores_gemma":[0.000003434863,0.0002098224,0.00005821304,0.0000949057,0.000053853473,0.000035289908,0.00001003698,0.00017480394,1.985878e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005740068,0.00001300327,0.0024776147,0.00009194712,0.0003695712,0.0000011889679,0.00024092842,0.91662884,0.000019687413,0.000003830399,0.0000036389274,0.08009233],"study_design_scores_gemma":[0.0008115757,0.00008995965,0.030122349,0.00008327287,0.0003313569,0.0000035841413,0.000044831013,0.9523179,0.015930071,0.000012887855,0.000036117784,0.00021610253],"about_ca_topic_score_codex":0.000020233492,"about_ca_topic_score_gemma":0.000005808397,"teacher_disagreement_score":0.23979108,"about_ca_system_score_codex":0.000017884544,"about_ca_system_score_gemma":0.000006879255,"threshold_uncertainty_score":0.85563093},"labels":[],"label_agreement":null},{"id":"W1978587158","doi":"10.1007/s10479-013-1522-1","title":"Supply chain scheduling to minimize holding costs with outsourcing","year":2014,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Windsor","funders":"","keywords":"Outsourcing; Theory of computation; Shortest path problem; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Supply chain; Bounded function; Holding cost; Polynomial-time approximation scheme; Computer science; Time complexity; Longest path problem; Mathematics; Approximation algorithm; Combinatorics; Algorithm; Business; Computer network","score_opus":0.08653777754906168,"score_gpt":0.3666433294800415,"score_spread":0.28010555193097986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978587158","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5441038,0.00012495107,0.44992584,0.0024157448,0.000086501765,0.00030659526,0.000010158078,0.00014275056,0.0028836546],"genre_scores_gemma":[0.8107948,0.00003731957,0.18864477,0.000105299354,0.00011042932,0.000047180285,0.000012859117,0.00003324047,0.00021411349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986122,0.00010901421,0.00024089986,0.00019738586,0.0004504424,0.00039001816],"domain_scores_gemma":[0.99864346,0.00018396198,0.0000086690125,0.0002980843,0.0006812001,0.00018461351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013717695,0.00011158403,0.00017138578,0.0004601431,0.00024005078,0.00015394812,0.00021769076,0.000060400504,0.00007070326],"category_scores_gemma":[0.0005660083,0.00010304898,0.000031105483,0.0008206545,0.00005166147,0.00016126863,0.00004548886,0.0002612834,0.0000713392],"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.000011088791,0.000019416251,0.0003123173,0.000018716708,0.000020682342,0.0000010282001,0.00061303756,0.99130833,0.0023279975,0.001000042,0.00022843276,0.004138913],"study_design_scores_gemma":[0.0002472543,0.000094919815,0.0004822538,0.00014373811,0.0000025035094,0.0000025662578,0.00059249107,0.9685674,0.029297628,0.000008683363,0.0004162871,0.000144275],"about_ca_topic_score_codex":0.00008396775,"about_ca_topic_score_gemma":0.000044083554,"teacher_disagreement_score":0.266691,"about_ca_system_score_codex":0.000027422107,"about_ca_system_score_gemma":0.00004620859,"threshold_uncertainty_score":0.42022154},"labels":[],"label_agreement":null},{"id":"W1978857382","doi":"10.1016/j.ejor.2004.04.012","title":"Positive half-products and scheduling with controllable processing times","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","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":"Memorial University of Newfoundland","funders":"","keywords":"Scheduling (production processes); Single-machine scheduling; Job shop scheduling; Mathematical optimization; Time complexity; Computer science; Minification; Mathematics; Algorithm; Schedule","score_opus":0.028819466602799253,"score_gpt":0.28631436777392233,"score_spread":0.25749490117112306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978857382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7486806,0.009342175,0.20075305,0.009262798,0.00027189706,0.00040449444,0.000007574893,0.00011296807,0.031164482],"genre_scores_gemma":[0.83218724,0.0000790412,0.16721068,0.00003785791,0.00029376632,6.960117e-7,0.00000272347,0.000027657194,0.00016032065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988597,0.00013300059,0.00022536644,0.00010450813,0.00049691944,0.00018051574],"domain_scores_gemma":[0.99850905,0.00005928692,0.000035044966,0.000060407623,0.0012260529,0.00011015838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016187705,0.000083359984,0.00011544005,0.00018345847,0.0002146178,0.00026929297,0.00011108827,0.0000137701345,0.000024014855],"category_scores_gemma":[0.00026483627,0.00006383759,0.0000137613415,0.0002859511,0.00008617943,0.0003526285,0.000019204854,0.00037798152,0.000021703532],"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.0000742182,0.000027072823,0.00004893142,0.000022709899,0.000045415974,0.00014931626,0.0005837831,0.990757,0.003879107,0.0007543008,0.0000685427,0.0035896269],"study_design_scores_gemma":[0.023204144,0.0040372536,0.010653669,0.0035478952,0.000115154755,0.004471596,0.0049275616,0.85396725,0.08803061,0.00087816076,0.004615819,0.0015508728],"about_ca_topic_score_codex":0.000001473331,"about_ca_topic_score_gemma":4.6717545e-7,"teacher_disagreement_score":0.13678971,"about_ca_system_score_codex":0.00005810495,"about_ca_system_score_gemma":0.00021871891,"threshold_uncertainty_score":0.26032215},"labels":[],"label_agreement":null},{"id":"W1980067218","doi":"10.1016/s0166-218x(02)00502-4","title":"A lower bound for the job insertion problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"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":"Kommission für Technologie und Innovation; École Polytechnique Fédérale de Lausanne","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Job loss","score_opus":0.013528224513189068,"score_gpt":0.22615687908057705,"score_spread":0.21262865456738797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980067218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045840284,0.00011796649,0.96903986,0.000051215142,0.00018295199,0.0005846874,0.0000055158475,0.00024803542,0.025185734],"genre_scores_gemma":[0.19857849,0.00004335674,0.8002986,0.000093048555,0.00007210793,0.00045401504,0.000012074777,0.00007959997,0.0003687415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.0000028786096,0.00019167033,0.00009278339,0.00010912042,0.00017342037],"domain_scores_gemma":[0.9995719,0.00011651034,0.000031269097,0.00021816857,0.000026991876,0.000035134803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018306907,0.00011997177,0.000112565,0.000024570234,0.00011055968,0.00007076665,0.00010008616,0.0000568244,0.000038306585],"category_scores_gemma":[0.000030008541,0.000084973166,0.000048552378,0.00011770862,0.000024237324,0.00003378199,0.000007090358,0.00007723731,0.000037140206],"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.000014988174,0.000089767884,0.00000804488,0.0006461034,0.00020560225,7.6833606e-7,0.0032176985,0.31621572,0.0028307564,0.66934836,0.0027702632,0.0046519074],"study_design_scores_gemma":[0.00080839783,0.000023261273,0.000015771533,0.00004125291,0.000103873135,0.000006583469,0.0012338406,0.92957693,0.005908473,0.052196957,0.009684193,0.00040043698],"about_ca_topic_score_codex":3.2145869e-7,"about_ca_topic_score_gemma":0.0000010423693,"teacher_disagreement_score":0.61715144,"about_ca_system_score_codex":0.000021069698,"about_ca_system_score_gemma":0.000010505523,"threshold_uncertainty_score":0.34651053},"labels":[],"label_agreement":null},{"id":"W1980330344","doi":"10.1109/icecs.2011.6122378","title":"Rules class approach to scheduling algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Fair-share scheduling; Scheduling (production processes); Dynamic priority scheduling; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Two-level scheduling; Job shop scheduling; Flow shop scheduling; Distributed computing; Algorithm; Embedded system; Mathematical optimization; Computer network; Mathematics","score_opus":0.033518899463065036,"score_gpt":0.22123263553006653,"score_spread":0.18771373606700148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980330344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007450944,0.00006735088,0.75891685,0.000013798945,0.00031078016,0.00009132229,0.0000024385217,0.0008790068,0.23226747],"genre_scores_gemma":[0.088528365,0.000010926231,0.91059786,0.00014473457,0.00011431879,0.000024222034,0.000009136563,0.000039955932,0.0005304982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992744,0.000008491041,0.00016932494,0.00017903361,0.00012144784,0.00024734822],"domain_scores_gemma":[0.9995664,0.000010867218,0.000009818083,0.00020777219,0.000043210795,0.00016194563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010790537,0.00013884828,0.00012593012,0.00011493466,0.000047161157,0.000033585937,0.0001690069,0.00007949841,0.00018629324],"category_scores_gemma":[0.000017953695,0.0001303086,0.00004214113,0.00021819647,0.000013708983,0.00009409213,0.00002682026,0.00011471765,0.0005304856],"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.000009426972,0.00015302334,0.0002820159,0.000057109042,0.00010924099,0.0000049125288,0.0033507603,0.9394697,0.00023907018,0.016025776,0.0012127839,0.039086193],"study_design_scores_gemma":[0.00015793885,0.000013380984,0.00022585156,0.0000074418203,0.000007573666,0.000005843751,0.00038303214,0.9952368,0.0028715734,0.00013430139,0.00071741315,0.00023885796],"about_ca_topic_score_codex":0.000013584764,"about_ca_topic_score_gemma":7.30845e-7,"teacher_disagreement_score":0.23173697,"about_ca_system_score_codex":0.000024720775,"about_ca_system_score_gemma":0.000008061801,"threshold_uncertainty_score":0.6818496},"labels":[],"label_agreement":null},{"id":"W1980331875","doi":"10.3166/isi.18.1.85-106","title":"Vers une meilleure navigation dans une architecture distribuée","year":2013,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Architecture; Geography; Archaeology","score_opus":0.006237893167094917,"score_gpt":0.20011664333716894,"score_spread":0.19387875017007403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980331875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09152391,0.0010446539,0.8719992,0.002348486,0.003293116,0.000831292,0.00020976154,0.0007796687,0.027969921],"genre_scores_gemma":[0.9029465,0.00019275132,0.091924176,0.00018585166,0.00046545436,0.00016551474,0.0026367642,0.00007911406,0.001403912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979036,0.00007506519,0.000874049,0.0001853962,0.0003970406,0.0005648351],"domain_scores_gemma":[0.9986504,0.000082035534,0.00027745447,0.00036097565,0.00039659298,0.00023255286],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002240715,0.00041244057,0.00032279288,0.00022422736,0.00036704386,0.0005641817,0.00025533966,0.00041421765,0.0003022261],"category_scores_gemma":[0.00016763355,0.00044561957,0.00013958199,0.00133166,0.0002494879,0.0033612344,0.00004579174,0.00047997345,0.0014724671],"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.00001033079,0.000024253875,0.0002592733,0.00088615407,0.000106189385,0.0000035281516,0.022073427,0.6921222,0.00015803914,0.003526855,0.0024511656,0.27837855],"study_design_scores_gemma":[0.0014236633,0.00014723821,0.007275221,0.001277756,0.000130039,0.00018829241,0.01150214,0.9345816,0.0021123858,0.0087309955,0.031527292,0.0011033952],"about_ca_topic_score_codex":0.0032494771,"about_ca_topic_score_gemma":0.000051185474,"teacher_disagreement_score":0.8114226,"about_ca_system_score_codex":0.0009423935,"about_ca_system_score_gemma":0.00010288566,"threshold_uncertainty_score":0.99979955},"labels":[],"label_agreement":null},{"id":"W1980455964","doi":"10.1007/s10479-013-1412-6","title":"Scheduling policies for a repair shop problem","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Magna International (Canada)","funders":"","keywords":"Theory of computation; Computer science; Job shop scheduling; Scheduling (production processes); Operations research; Flow shop scheduling; Mathematical optimization; Mathematics; Algorithm; Schedule; Operating system","score_opus":0.1616624709572598,"score_gpt":0.41351088715963524,"score_spread":0.2518484162023754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980455964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7809931,0.00221571,0.1824211,0.012291483,0.00026065786,0.0034363382,0.00007221262,0.0011059259,0.017203452],"genre_scores_gemma":[0.561687,0.00027769382,0.43540928,0.00008098269,0.00015221353,0.0006376771,0.000031923522,0.00003729027,0.0016859514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990648,0.000038004262,0.00023948899,0.00012036684,0.00022968125,0.00030763992],"domain_scores_gemma":[0.9983344,0.00012198086,0.000006138444,0.00021158677,0.0012443047,0.000081581886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061114825,0.00007271525,0.000111106405,0.0002666125,0.00019841734,0.000113022405,0.00014405917,0.00006116785,0.00015297494],"category_scores_gemma":[0.00031015402,0.000068824425,0.00006599217,0.00044015955,0.000063661486,0.0002481191,0.000027951224,0.00014558576,0.00007595816],"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.0000023799562,0.000034798537,0.00006109907,0.00007152107,0.00003974218,1.3544404e-7,0.0005763918,0.9829555,0.0022318743,0.0050751837,0.0069081266,0.002043224],"study_design_scores_gemma":[0.000115669776,0.000058012196,0.00009712883,0.000030816893,0.000001632689,8.0730615e-7,0.0005404417,0.98678315,0.0109477565,0.0003280137,0.0010149518,0.00008160047],"about_ca_topic_score_codex":0.0001396061,"about_ca_topic_score_gemma":0.000021606511,"teacher_disagreement_score":0.2529882,"about_ca_system_score_codex":0.000011298518,"about_ca_system_score_gemma":0.000057203728,"threshold_uncertainty_score":0.28065786},"labels":[],"label_agreement":null},{"id":"W1980770949","doi":"10.1109/mis.2005.9","title":"Holonic Job Shop Scheduling Using a Multiagent System","year":2005,"lang":"en","type":"article","venue":"IEEE Intelligent Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Job shop scheduling; Flow shop scheduling; Heuristics; Job shop; Scheduling (production processes); Distributed computing; Two-level scheduling; Dynamic priority scheduling; Fair-share scheduling; Schedule; Job scheduler; Multi-agent system; Rate-monotonic scheduling; Industrial engineering; Operations research; Artificial intelligence; Mathematical optimization; Engineering; Operating system; Cloud computing","score_opus":0.03513908537422933,"score_gpt":0.2622185049109972,"score_spread":0.22707941953676786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980770949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29394308,0.0037947549,0.694037,0.000014367229,0.00547134,0.00040786216,0.000008675115,0.0012486958,0.0010742078],"genre_scores_gemma":[0.96417385,0.00007968879,0.033963572,0.000017460583,0.0013113347,0.000043318185,0.000005401928,0.000099745186,0.00030563422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980964,0.00006288412,0.0007075706,0.0003161141,0.0003418503,0.00047519346],"domain_scores_gemma":[0.99912685,0.00005765062,0.00009011778,0.00040793314,0.00011924714,0.0001982133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003841041,0.00030904947,0.00036124897,0.00022928686,0.00012903029,0.00016983028,0.0002640785,0.00018779503,0.000035418958],"category_scores_gemma":[0.000020938223,0.000312518,0.00013684826,0.0003031789,0.000026092019,0.00016492461,0.000019421514,0.00025445264,0.0007300004],"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.000003458574,0.000016276175,0.00014356166,0.0002140342,0.000080349244,0.0000121008,0.00037196954,0.9964589,0.0013742904,0.00014391476,0.00008754882,0.0010935914],"study_design_scores_gemma":[0.00018704815,0.00001195926,0.0000051294164,0.00041703766,0.000034983907,0.00011271997,0.0010817683,0.9866059,0.009767569,4.476055e-7,0.001434194,0.00034128648],"about_ca_topic_score_codex":0.00006357343,"about_ca_topic_score_gemma":0.000005659593,"teacher_disagreement_score":0.67023075,"about_ca_system_score_codex":0.0006282831,"about_ca_system_score_gemma":0.000032882897,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W1981424759","doi":"10.1080/09537280802571613","title":"Integration of production and shipping planning: a co-operative approach","year":2008,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Production planning; Scheduling (production processes); Production schedule; Production (economics); Operations research; Doors; Decision support system; Schedule; Computer science; Product (mathematics); Process management; Operations management; Engineering","score_opus":0.031108855633221688,"score_gpt":0.26249530371592383,"score_spread":0.23138644808270215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981424759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.601963,0.002231161,0.38994032,0.00024921037,0.001191992,0.0007070798,0.000008307963,0.00070717745,0.0030017614],"genre_scores_gemma":[0.97527915,0.00003949953,0.024012625,0.000026765825,0.0004002486,0.00005016525,0.000034217028,0.000025877072,0.00013143153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990133,0.000051272527,0.00029776624,0.0002991325,0.00017440727,0.00016411231],"domain_scores_gemma":[0.9995401,0.000029123863,0.00008307842,0.0001578544,0.00013788685,0.000051942374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002801453,0.00016690325,0.00023367396,0.00016164755,0.00020603705,0.000025912504,0.000053556105,0.000078167795,0.0000048857037],"category_scores_gemma":[0.00024280034,0.0001630222,0.000030168925,0.00019672143,0.000103519465,0.0003300007,0.00000531041,0.00021996451,0.0000027539747],"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.00006700096,0.000038761773,0.0034689864,0.000068589296,0.00007782332,0.000002111208,0.007048414,0.9648631,0.022693194,0.00018377558,0.0005498229,0.0009383949],"study_design_scores_gemma":[0.0011493193,0.00012834859,0.007961023,0.0003144872,0.0000773336,0.0003731317,0.0024449334,0.92176324,0.06473262,0.000058620608,0.00044308166,0.00055383367],"about_ca_topic_score_codex":0.0000065707236,"about_ca_topic_score_gemma":2.7710033e-7,"teacher_disagreement_score":0.37331617,"about_ca_system_score_codex":0.000036271307,"about_ca_system_score_gemma":0.000017184691,"threshold_uncertainty_score":0.66478527},"labels":[],"label_agreement":null},{"id":"W1982535162","doi":"10.1109/iemc.2002.1038470","title":"An online integrated operational decision support system with predefined knowledge base for semiconductor industry","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Variety (cybernetics); Knowledge base; Decision support system; Production (economics); Event (particle physics); Reliability engineering; Engineering; Artificial intelligence","score_opus":0.026811418862073066,"score_gpt":0.2584482740702993,"score_spread":0.23163685520822624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982535162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23090374,0.000039660426,0.765049,0.000012857237,0.0004136264,0.00031165863,0.00012891127,0.0006468418,0.0024937422],"genre_scores_gemma":[0.51194274,0.0000013769242,0.48644653,0.000035317877,0.0000757022,0.000039640123,0.00048242853,0.00004149512,0.00093476096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926233,0.000022303026,0.00023436315,0.00019858983,0.00009915749,0.00018326622],"domain_scores_gemma":[0.99933964,0.000062205705,0.00001850039,0.00019122948,0.00024064486,0.00014775906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017623321,0.00015901851,0.00015091062,0.00009174317,0.00006540445,0.000062588464,0.0000885905,0.00019574448,0.00048297903],"category_scores_gemma":[0.0000666876,0.0001209147,0.000025410443,0.00022840535,0.000012827052,0.00016557176,0.0000036810889,0.0001789457,0.00001705811],"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.000066750574,0.00027101286,0.0009890583,0.000099116616,0.00008114961,0.0000053674503,0.00025198192,0.983081,0.0023256629,0.005334323,0.004559217,0.00293535],"study_design_scores_gemma":[0.0011394846,0.00012747444,0.00005655983,0.00005840633,0.00001572804,0.000032914006,0.00087882346,0.988645,0.0074940734,0.000003542975,0.0013382296,0.0002097164],"about_ca_topic_score_codex":0.0000040659347,"about_ca_topic_score_gemma":0.000032965036,"teacher_disagreement_score":0.281039,"about_ca_system_score_codex":0.00009379415,"about_ca_system_score_gemma":0.00016598865,"threshold_uncertainty_score":0.52882814},"labels":[],"label_agreement":null},{"id":"W1983477878","doi":"10.1080/00207543.2012.757666","title":"Continuous-time algorithms for scheduling a single machine with sequence-dependent setup times and time window constraints in coordinated chains","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Heuristic; Sequence (biology); Robustness (evolution); Job shop scheduling; Discrete time and continuous time; Production line; Algorithm; Mathematics; Engineering","score_opus":0.04011778361080155,"score_gpt":0.31409745912715176,"score_spread":0.2739796755163502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983477878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90677476,0.0007876025,0.07838071,0.009736837,0.001438817,0.0015370894,0.0000745712,0.00017868243,0.0010909543],"genre_scores_gemma":[0.9259466,0.00007801311,0.07147277,0.000024846579,0.0005403124,0.00003864914,0.000028261857,0.000043345914,0.0018272031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845064,0.00008365604,0.00041270745,0.00019866852,0.0005926593,0.00026169227],"domain_scores_gemma":[0.99768436,0.00014781402,0.000108858236,0.00009179005,0.0018572672,0.00010990694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506379,0.00012996989,0.00021459747,0.0006550036,0.000064951964,0.00019139079,0.00022817262,0.000072242256,0.000335991],"category_scores_gemma":[0.00047578945,0.000112152855,0.00003599531,0.00024796938,0.00018054321,0.00043468637,0.00003231959,0.0004253439,0.00003864605],"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.00063714007,0.0006784123,0.0032749292,0.00011989726,0.001086586,0.00018433058,0.0018086238,0.5704231,0.2684707,0.00036430833,0.0019024694,0.1510495],"study_design_scores_gemma":[0.0029594537,0.0004927896,0.0004679575,0.0004031161,0.000016641583,0.0010176689,0.00057941186,0.9625661,0.03040941,0.00053247716,0.00026010082,0.0002949105],"about_ca_topic_score_codex":0.000034714565,"about_ca_topic_score_gemma":0.0000032333242,"teacher_disagreement_score":0.39214295,"about_ca_system_score_codex":0.00021196977,"about_ca_system_score_gemma":0.00008935462,"threshold_uncertainty_score":0.45734605},"labels":[],"label_agreement":null},{"id":"W1983793065","doi":"10.1080/00207543.2011.648277","title":"A meta-heuristic approach for solving the no-wait flow-shop problem","year":2012,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Flow shop scheduling; Job shop scheduling; Tabu search; Computer science; Tardiness; Particle swarm optimization; Mathematics; Algorithm; Schedule","score_opus":0.14911874373329256,"score_gpt":0.3637089456872152,"score_spread":0.21459020195392262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983793065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065509635,0.0051807626,0.96485317,0.006358331,0.01043827,0.00094362244,0.000020964932,0.00013090592,0.0055230083],"genre_scores_gemma":[0.47745574,0.00034353186,0.50969696,0.000046924946,0.009707191,0.00014252956,0.000018234328,0.000058295245,0.0025306155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982483,0.00008310959,0.0003781472,0.000106051506,0.000909717,0.0002747239],"domain_scores_gemma":[0.99706787,0.00020075879,0.000090138994,0.00013641575,0.002416754,0.00008809243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00386756,0.00009472732,0.00014900003,0.00030259287,0.00013286597,0.00012685034,0.00042816813,0.000046300225,0.00012044134],"category_scores_gemma":[0.0009934221,0.00006284783,0.00014944763,0.0002292331,0.00005968878,0.00036891524,0.00004026035,0.00046597575,0.000025591571],"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.00014262796,0.00027525876,0.00021419086,0.00010094558,0.003244246,0.0000025807733,0.0016476474,0.9451175,0.0022731991,0.0013407059,0.035079487,0.010561642],"study_design_scores_gemma":[0.00081606186,0.00012081163,0.00015411711,0.0000565188,0.00034915548,0.00047145743,0.0009437521,0.94245213,0.007277658,0.0010877993,0.045999214,0.000271294],"about_ca_topic_score_codex":0.0000024170108,"about_ca_topic_score_gemma":2.6983042e-7,"teacher_disagreement_score":0.47090477,"about_ca_system_score_codex":0.00012851038,"about_ca_system_score_gemma":0.000052869356,"threshold_uncertainty_score":0.256286},"labels":[],"label_agreement":null},{"id":"W1983854422","doi":"10.1007/s40305-012-0002-7","title":"An Almost Tight Lower Bound for the Scheduling Problem to Meet Two Min-Sum Objectives","year":2013,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 New Brunswick","funders":"","keywords":"Scheduling (production processes); Combinatorics; Upper and lower bounds; Mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.025326774736207733,"score_gpt":0.334522220282114,"score_spread":0.3091954455459062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983854422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7402237,0.00089063746,0.2320794,0.023715876,0.00076422346,0.0016616518,0.000021304875,0.00003864594,0.00060458196],"genre_scores_gemma":[0.65794814,0.00012088319,0.34083453,0.00010335119,0.00040829906,0.000054848515,0.0000012841808,0.000028962027,0.00049971015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986801,0.00010913974,0.00034663858,0.00009662432,0.0005141353,0.00025337617],"domain_scores_gemma":[0.9983433,0.0002210253,0.00004368461,0.00028789107,0.0009868314,0.00011726981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016061013,0.00010189948,0.00015631036,0.00006444073,0.000705469,0.00032144334,0.0005863959,0.000054608467,0.0000604157],"category_scores_gemma":[0.00021849034,0.000057841607,0.00021908179,0.00043547832,0.00012435607,0.0004341271,0.0000523371,0.0003766791,0.0000046779405],"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.000007934852,0.000060111437,0.000033743385,0.000021301312,0.000119178934,7.9907856e-8,0.0039542103,0.9763308,0.010566301,0.00023941441,0.008007128,0.0006597593],"study_design_scores_gemma":[0.0004334099,0.00016035575,0.0005961149,0.00008465828,0.000018140836,0.00000827287,0.0022216914,0.98689926,0.008219605,0.00055382174,0.00071452354,0.00009016207],"about_ca_topic_score_codex":0.000053616997,"about_ca_topic_score_gemma":0.000035736146,"teacher_disagreement_score":0.10875512,"about_ca_system_score_codex":0.00009660385,"about_ca_system_score_gemma":0.00016866575,"threshold_uncertainty_score":0.5425968},"labels":[],"label_agreement":null},{"id":"W1984200231","doi":"10.1080/00207543.2013.827806","title":"Mathematical modelling and a meta-heuristic for flexible job shop scheduling","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Heuristics; Job shop scheduling; Benchmark (surveying); Mathematical optimization; Integer programming; Computer science; Simulated annealing; Heuristic; Scheduling (production processes); Algorithm; Mathematics","score_opus":0.15455671628667453,"score_gpt":0.3801708225125963,"score_spread":0.2256141062259218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984200231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06597225,0.00083551084,0.9281039,0.0034928657,0.00085090776,0.00026116584,0.0000029032851,0.000057598176,0.00042287432],"genre_scores_gemma":[0.53257275,0.00025291223,0.46499023,0.000018517432,0.0009888938,0.00005585745,0.0000022615125,0.000030394931,0.00108819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869037,0.000038161532,0.00037276646,0.00012105101,0.00060648366,0.00017118818],"domain_scores_gemma":[0.9975744,0.00018945886,0.00005577557,0.0000853943,0.0020017268,0.000093263094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012537069,0.00008340181,0.00017494382,0.00040091694,0.00007195819,0.00018935728,0.00019821167,0.00004712819,0.00022471076],"category_scores_gemma":[0.0006376629,0.00006837991,0.000080377606,0.00014141807,0.00005501667,0.00034516025,0.00002775192,0.00031298862,0.000026391848],"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.000021679976,0.00003317894,0.000014716022,0.0000503539,0.0006258479,0.0000022895765,0.00025687923,0.9933156,0.00070503616,0.0021039194,0.00089206785,0.001978461],"study_design_scores_gemma":[0.00024897707,0.00004019452,0.000009240997,0.000028172195,0.00008997781,0.0001250398,0.00032489304,0.9767161,0.0036769228,0.01830065,0.00036132304,0.00007850646],"about_ca_topic_score_codex":0.0000033788317,"about_ca_topic_score_gemma":1.593934e-7,"teacher_disagreement_score":0.4666005,"about_ca_system_score_codex":0.00006421534,"about_ca_system_score_gemma":0.00003580345,"threshold_uncertainty_score":0.27884516},"labels":[],"label_agreement":null},{"id":"W1985053735","doi":"10.1080/00207540412331333450","title":"A desired load distribution model for scheduling of unrelated parallel machines","year":2005,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Dynamic priority scheduling; Mathematical optimization; Fair-share scheduling; Load distribution; Load balancing (electrical power); Engineering; Schedule; Mathematics","score_opus":0.08079050348335347,"score_gpt":0.3724347670134662,"score_spread":0.2916442635301127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985053735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12658916,0.00053687027,0.8686716,0.0029871177,0.0009260209,0.00015367205,0.000022639717,0.00003717035,0.00007574592],"genre_scores_gemma":[0.7698519,0.00020296525,0.22884211,0.000005713654,0.0007646894,0.0000078476305,0.000023100021,0.000015078121,0.00028656816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998454,0.00004103549,0.00046648548,0.00010248126,0.0007872119,0.00014883306],"domain_scores_gemma":[0.9962004,0.00007563103,0.00011859668,0.00008719486,0.0034605863,0.000057636273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015364687,0.00007440558,0.00012460226,0.0002572807,0.000053259882,0.000045821234,0.00024898662,0.00006369192,0.000022324135],"category_scores_gemma":[0.001010945,0.00006965457,0.00008431312,0.00021369263,0.000049512684,0.00028598646,0.000019593605,0.00028585378,0.0000047916183],"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.00016389573,0.00006603689,0.000063239226,0.000016409234,0.000109626955,9.2119683e-7,0.00022207924,0.97982115,0.0037849734,0.0006642888,0.0008199025,0.014267508],"study_design_scores_gemma":[0.0006169493,0.000035559726,0.000059376318,0.00006538993,0.000009123269,0.000037378482,0.00005432642,0.98897064,0.0084259035,0.0011563592,0.0005081273,0.00006084108],"about_ca_topic_score_codex":0.0000032976238,"about_ca_topic_score_gemma":0.0000027701358,"teacher_disagreement_score":0.64326274,"about_ca_system_score_codex":0.00029272778,"about_ca_system_score_gemma":0.00016664491,"threshold_uncertainty_score":0.2840431},"labels":[],"label_agreement":null},{"id":"W198519156","doi":"10.1007/978-1-84628-752-7_9","title":"A Multi-agent System Implementation of an Evolutionary Approach to Production Scheduling","year":2007,"lang":"en","type":"book-chapter","venue":"Springer series in advanced manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Calgary","funders":"","keywords":"Heuristics; Computer science; Flow shop scheduling; Job shop scheduling; Scheduling (production processes); Two-level scheduling; Fair-share scheduling; Mathematical optimization; Distributed computing; Job shop; Dynamic priority scheduling; Rate-monotonic scheduling; Multi-agent system; Schedule; Industrial engineering; Artificial intelligence; Engineering; Mathematics; Operating system","score_opus":0.020516071931011823,"score_gpt":0.25938326154625957,"score_spread":0.23886718961524775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198519156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16505682,0.0031122472,0.7376203,0.000039926956,0.009552878,0.00566249,0.00014120732,0.0036666929,0.07514747],"genre_scores_gemma":[0.08107378,0.00012370532,0.9151563,0.000007747272,0.00027392592,0.00008161418,0.000108411405,0.00017685382,0.0029976778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980204,0.000011945548,0.0007276699,0.00055173354,0.00032550978,0.0003627157],"domain_scores_gemma":[0.9991412,0.00001197702,0.00017336762,0.00046857996,0.000081848695,0.00012299555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025449914,0.00042779584,0.00043892636,0.0006393982,0.00007700296,0.00002526462,0.0002092279,0.0002247765,0.000018890087],"category_scores_gemma":[0.0000112715015,0.0005160596,0.00008291584,0.000083035346,0.000036037352,0.0004305621,0.000081824925,0.00038708554,0.000011541456],"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.000033916673,0.000018311475,0.000011070179,0.00074758986,0.00004490906,0.000006339687,0.0005675702,0.9784504,0.00053935114,0.0007933214,0.0000012401271,0.018785961],"study_design_scores_gemma":[0.004658172,0.0005081717,0.0059158537,0.0058991024,0.00031133112,0.00027161406,0.019191891,0.29150426,0.65197915,0.00059407396,0.012618328,0.0065480615],"about_ca_topic_score_codex":0.000014524247,"about_ca_topic_score_gemma":0.00003649863,"teacher_disagreement_score":0.68694615,"about_ca_system_score_codex":0.0006422675,"about_ca_system_score_gemma":0.000029432911,"threshold_uncertainty_score":0.9997291},"labels":[],"label_agreement":null},{"id":"W1985747745","doi":"10.1142/s0129626405002349","title":"IMPROVING SCHEDULING OF COMMUNICATION INTENSIVE PARALLEL APPLICATIONS ON HETEROGENEOUS COMPUTING ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Scheduling (production processes); Distributed computing; Latency (audio); Telecommunications network; Parallel computing; Performance metric; Computer network; Mathematical optimization","score_opus":0.011760413580007435,"score_gpt":0.2297897431250932,"score_spread":0.21802932954508578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985747745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07181891,0.000892156,0.9259796,0.00059695734,0.000044309254,0.00023242374,0.000002374928,0.00024502169,0.00018821305],"genre_scores_gemma":[0.64947927,0.000041125808,0.34954035,0.00076259946,0.00007515441,0.000030125055,0.000025312238,0.0000369546,0.000009119244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00003028145,0.00041159635,0.00023674022,0.00019932252,0.00026551692],"domain_scores_gemma":[0.9993118,0.00006157972,0.0001712746,0.00033390263,0.000051759314,0.000069662245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013900215,0.00020390002,0.00020943962,0.00012016923,0.0001898572,0.00005728673,0.00027993706,0.000076082244,0.000008460142],"category_scores_gemma":[0.000026351843,0.00022458858,0.00006207713,0.00015619467,0.00008554859,0.00015311102,0.000046334964,0.00025240795,0.000042608917],"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.0000073936208,0.000027224778,0.000069361726,0.000048710015,0.000023275668,5.0438535e-7,0.0004955408,0.95013624,0.0045865932,0.000015722575,0.000021642223,0.04456779],"study_design_scores_gemma":[0.00042199594,0.000011824456,0.0000748939,0.00010102143,0.000020387017,0.0000071853997,0.00015734693,0.9955635,0.0030783091,0.0000130151975,0.00031722354,0.00023328494],"about_ca_topic_score_codex":0.0000043983146,"about_ca_topic_score_gemma":9.136415e-7,"teacher_disagreement_score":0.5776603,"about_ca_system_score_codex":0.000099279016,"about_ca_system_score_gemma":0.000011091327,"threshold_uncertainty_score":0.9158457},"labels":[],"label_agreement":null},{"id":"W1985875963","doi":"10.1016/j.cirp.2010.03.090","title":"Dynamic production control using a flow based formulation","year":2010,"lang":"en","type":"article","venue":"CIRP Annals","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Production (economics); Context (archaeology); Flow (mathematics); Material flow; Conservation of mass; Workstation; Production control; Key (lock); Control theory (sociology); Control (management); Mass flow; Flow control (data); Computer science; Engineering; Industrial engineering; Mechanics; Mechanical engineering; Economics; Physics","score_opus":0.017434053149172558,"score_gpt":0.258836006008769,"score_spread":0.24140195285959642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985875963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36432046,0.00005043809,0.633394,0.00023337077,0.0013142196,0.00014465637,0.0000065792856,0.00034432273,0.0001919771],"genre_scores_gemma":[0.91487217,0.0000024068256,0.084834315,0.00007796055,0.00013210386,0.000006822606,0.000018588069,0.000020678166,0.000034950957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999549,0.000008662553,0.00012179947,0.000103782375,0.00008590958,0.0001309026],"domain_scores_gemma":[0.99968606,0.000013776293,0.00002310601,0.00014662667,0.00008632269,0.000044088545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001516739,0.00007725409,0.000080496306,0.00008239571,0.000061914354,0.000033914235,0.000042758304,0.00006887401,0.00006278914],"category_scores_gemma":[0.00008334075,0.00008170196,0.000035117166,0.00012828675,0.000009268131,0.0001299884,0.0000020658174,0.00012037719,0.00001994313],"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.0000036902584,0.000007987298,0.00010500309,0.000011156468,0.000008128332,4.152346e-7,0.00003533236,0.97140926,0.022217391,0.000012848153,0.000048844224,0.006139931],"study_design_scores_gemma":[0.00022731969,0.000005311226,0.00079781096,0.000010243273,0.00000879955,0.0000032358537,0.000005567178,0.99404657,0.0045134434,0.000062694235,0.00022057287,0.00009845585],"about_ca_topic_score_codex":0.00000160472,"about_ca_topic_score_gemma":0.0000053889394,"teacher_disagreement_score":0.5505517,"about_ca_system_score_codex":0.000012558211,"about_ca_system_score_gemma":0.000014324864,"threshold_uncertainty_score":0.33317092},"labels":[],"label_agreement":null},{"id":"W1985890716","doi":"10.1016/j.dam.2013.08.037","title":"A pseudo-polynomial time algorithm for solving the resource dependent assignment problem","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"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":"Generalized assignment problem; Function (biology); Assignment problem; Task (project management); Time complexity; Mathematical optimization; Mathematics; Weapon target assignment problem; Set (abstract data type); Resource allocation; Polynomial; Polynomial-time approximation scheme; Resource (disambiguation); Algorithm; Computer science","score_opus":0.007609167916331044,"score_gpt":0.20170244246734956,"score_spread":0.19409327455101852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985890716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010021906,0.000050194383,0.9822322,0.00015884072,0.000083934705,0.001504943,0.000021214975,0.00042071566,0.014525748],"genre_scores_gemma":[0.00928485,0.000008520738,0.9881332,0.00010606027,0.00023682052,0.0011652159,0.000043775915,0.00011110005,0.000910437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988083,0.0000060306884,0.0003721586,0.00019277477,0.00025481547,0.00036589644],"domain_scores_gemma":[0.99924624,0.00019371633,0.00008079703,0.0003506094,0.000036400237,0.000092219525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026649525,0.00023282839,0.00023297513,0.00004445512,0.00017390735,0.00018718679,0.00028724485,0.00009860779,0.00015086464],"category_scores_gemma":[0.000014759973,0.00016891313,0.000081522936,0.00010213811,0.00003910639,0.00006460895,0.000058926493,0.00015534708,0.00029561954],"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.000020649688,0.00040355622,0.0000036361769,0.0011358425,0.0010079445,0.0000040806044,0.016539132,0.5166635,0.037257735,0.013820941,0.087044805,0.3260982],"study_design_scores_gemma":[0.00043157817,0.000015677295,0.0000013411933,0.000028558668,0.00004657833,0.0000049306063,0.0008701652,0.99196666,0.0035961033,0.001804548,0.000981298,0.00025258356],"about_ca_topic_score_codex":0.0000021885198,"about_ca_topic_score_gemma":3.3168027e-7,"teacher_disagreement_score":0.47530314,"about_ca_system_score_codex":0.00006475798,"about_ca_system_score_gemma":0.00001413275,"threshold_uncertainty_score":0.6888078},"labels":[],"label_agreement":null},{"id":"W1985987363","doi":"10.1007/s10479-010-0753-7","title":"Introduction to the special issue on Advances in Manufacturing Systems","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Theory of computation; Operations research; Head (geology); Library science; Volume (thermodynamics); Engineering management; Management; Computer science; Engineering; Economics; Physics","score_opus":0.050480596408346456,"score_gpt":0.3776737893975814,"score_spread":0.32719319298923494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985987363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89954704,0.00082822924,0.0048284675,0.052410062,0.007727953,0.0016115209,0.000035071782,0.00016741829,0.032844234],"genre_scores_gemma":[0.9717814,0.00069308106,0.0038395661,0.00006799381,0.021470161,0.00013355668,0.000016221578,0.00002655173,0.001971482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992447,0.000053811364,0.00015662458,0.00011286575,0.00026329746,0.00016868643],"domain_scores_gemma":[0.9994942,0.000058250287,0.0000041711282,0.00022709866,0.00017439849,0.00004186361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079322583,0.000051780145,0.00007079731,0.00026477105,0.000119979144,0.00008662126,0.00015422708,0.000038199127,0.00025048605],"category_scores_gemma":[0.00022120091,0.000039808026,0.0000137860925,0.00032911293,0.000028550527,0.00015300399,0.000017226306,0.000358118,0.00021611075],"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.0000055133382,0.000015131568,0.000006418229,0.000009026357,0.000002731139,4.014889e-7,0.00029077,0.9759446,0.0003901792,0.00088887266,0.010018353,0.012428041],"study_design_scores_gemma":[0.000119516146,0.00008187402,0.0004718988,0.000029555704,7.9033003e-7,0.0000025228076,0.000758058,0.36605683,0.07867415,0.000025257865,0.5536672,0.00011235774],"about_ca_topic_score_codex":0.00004348474,"about_ca_topic_score_gemma":0.00037030474,"teacher_disagreement_score":0.6098877,"about_ca_system_score_codex":0.0000101504465,"about_ca_system_score_gemma":0.000015209382,"threshold_uncertainty_score":0.27777386},"labels":[],"label_agreement":null},{"id":"W1986115514","doi":"10.1007/s10951-006-0003-7","title":"Time slot scheduling of compatible jobs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Bipartite graph; Scheduling (production processes); Combinatorics; Time complexity; Computer science; Graph coloring; Heuristic; Graph; Discrete mathematics; Mathematics; Mathematical optimization","score_opus":0.01296892274091942,"score_gpt":0.24088089569385465,"score_spread":0.22791197295293522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986115514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68979526,0.0013090224,0.30660778,0.000041476946,0.0006719977,0.000047877988,0.0000016160838,0.00007447397,0.0014505225],"genre_scores_gemma":[0.59996676,0.000059475646,0.3995625,0.000023187802,0.00032770986,2.0497507e-7,0.0000013263309,0.000030981773,0.000027833097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998145,0.000020687994,0.0010109572,0.00009787707,0.00042048996,0.0003050135],"domain_scores_gemma":[0.9987088,0.00018474816,0.00035820086,0.00015697337,0.0004037456,0.00018755751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013974783,0.0001748287,0.0004260409,0.00041655375,0.000059771744,0.00003420088,0.00025919135,0.00012412295,0.00012197398],"category_scores_gemma":[0.00019285573,0.00016839169,0.00017468269,0.00046454594,0.00005647599,0.00027896112,0.000023399487,0.00044632313,0.000036487367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032720152,0.000043077613,0.00085458806,0.000059438447,0.00010049861,0.000021001117,0.00037702837,0.9708087,0.024222692,0.00011389322,0.00002594848,0.0033404112],"study_design_scores_gemma":[0.0011340865,0.00012578664,0.0010044557,0.00040515405,0.00007136547,0.00014055,0.0007918247,0.91344935,0.082287036,0.000112113245,0.00019361035,0.000284655],"about_ca_topic_score_codex":0.0000020063715,"about_ca_topic_score_gemma":7.761692e-7,"teacher_disagreement_score":0.09295472,"about_ca_system_score_codex":0.00007133207,"about_ca_system_score_gemma":0.000055269247,"threshold_uncertainty_score":0.6866814},"labels":[],"label_agreement":null},{"id":"W1986243952","doi":"10.1007/s00170-011-3798-0","title":"Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem","year":2011,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Guelph","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Flow shop scheduling; Mathematical optimization; Genetic algorithm; Heuristic; Distributed computing; Algorithm; Artificial intelligence; Schedule; Mathematics; Machine learning","score_opus":0.014968665690462273,"score_gpt":0.23529509727551728,"score_spread":0.22032643158505502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986243952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16218899,0.00024643436,0.8366801,0.00024109872,0.00020791264,0.00012068053,0.000006588147,0.00014386827,0.00016429002],"genre_scores_gemma":[0.17733431,0.00020735456,0.822254,0.000031262138,0.0000677328,0.00001694846,0.0000012528659,0.000026677713,0.000060483384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991756,0.0000048270067,0.0003625577,0.000111267065,0.00016835361,0.00017738884],"domain_scores_gemma":[0.9995033,0.000056974437,0.00012899992,0.00013695488,0.00013075692,0.000043023618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013422324,0.00013627608,0.00017781254,0.00023747755,0.000049565828,0.00002541265,0.00048583315,0.000063032836,0.0000151820805],"category_scores_gemma":[0.00003345102,0.00010425195,0.000056295805,0.000037282465,0.00007051599,0.00012670437,0.00007129425,0.00022504509,0.0000024608178],"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.000030121113,0.000031091775,0.0000042213524,0.000015825779,0.00014183926,0.000015729078,0.00017407021,0.738097,0.0006167014,0.0011012105,0.000032796976,0.2597394],"study_design_scores_gemma":[0.00067140925,0.000067607434,0.000025377949,0.00006016511,0.000027223921,0.0005864174,0.00016001241,0.78310674,0.0961924,0.11889064,0.00008711062,0.00012487028],"about_ca_topic_score_codex":6.115025e-7,"about_ca_topic_score_gemma":4.5505845e-7,"teacher_disagreement_score":0.25961453,"about_ca_system_score_codex":0.000052612144,"about_ca_system_score_gemma":0.00001742173,"threshold_uncertainty_score":0.42512712},"labels":[],"label_agreement":null},{"id":"W1986491739","doi":"10.1016/j.disopt.2008.09.001","title":"Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Chicoutimi; Memorial University of Newfoundland","funders":"","keywords":"Divide and conquer algorithms; Computer science; Scheduling (production processes); Parallel computing; Conjecture; Schedule; Class (philosophy); Theoretical computer science; Combinatorics; Mathematics; Algorithm; Mathematical optimization","score_opus":0.017727372656691377,"score_gpt":0.24723899472558208,"score_spread":0.2295116220688907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986491739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03495982,0.000213156,0.9632294,0.00013149447,0.00017476399,0.00046462772,0.00003770839,0.00022870033,0.00056029425],"genre_scores_gemma":[0.5654709,0.00024709516,0.433852,0.000043496035,0.000049178758,0.000082724015,0.00016054428,0.000045270946,0.000048832746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875546,0.000027234431,0.00046752862,0.0002728876,0.00023195962,0.0002449314],"domain_scores_gemma":[0.99933577,0.000094657364,0.00010084509,0.00019700022,0.00016750155,0.000104230945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022431093,0.00020939321,0.00027845523,0.00014667813,0.00014422747,0.00003559324,0.00011508646,0.00013872403,0.000027723772],"category_scores_gemma":[0.00023416491,0.00020655671,0.000090897855,0.00026688253,0.00010414443,0.00024251798,0.000021896263,0.000119572534,0.0000030898177],"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.00004652612,0.00002680394,0.00060136785,0.00010043434,0.000044353234,0.0000011238498,0.00028270698,0.9967763,0.000035249843,0.0017547031,0.000048495534,0.000281923],"study_design_scores_gemma":[0.0008058599,0.000067315785,0.0003681399,0.00006238395,0.000038682814,0.0000066602083,0.000050808052,0.9972374,0.00070052966,0.00039620584,0.00002173854,0.00024426612],"about_ca_topic_score_codex":0.0000039867323,"about_ca_topic_score_gemma":6.9900943e-7,"teacher_disagreement_score":0.5305111,"about_ca_system_score_codex":0.000023737563,"about_ca_system_score_gemma":0.000023490958,"threshold_uncertainty_score":0.8423138},"labels":[],"label_agreement":null},{"id":"W1987898607","doi":"10.1016/s0925-5273(99)00024-9","title":"Evaluating shop floor input control using rapid modeling","year":2000,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Calgary","funders":"","keywords":"Bottleneck; Computer science; Profitability index; Queueing theory; Inventory control; Throughput; Decomposition; Control (management); Interval (graph theory); Operations research; Mathematical optimization; Industrial engineering; Engineering","score_opus":0.04147492571356109,"score_gpt":0.2909242925847184,"score_spread":0.24944936687115732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987898607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8826865,0.00024353049,0.11203076,0.0004094879,0.004279203,0.000055613553,0.0000045620145,0.000043147375,0.00024718128],"genre_scores_gemma":[0.9093982,0.0004721216,0.087352745,0.00008238101,0.0025861713,0.0000013457731,0.0000037758693,0.000028056005,0.0000751925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990431,0.00002386285,0.00056818064,0.000110904555,0.00014568471,0.00010823353],"domain_scores_gemma":[0.9993392,0.000014817944,0.00013425144,0.00008759578,0.00037002,0.000054121298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005300426,0.000101088095,0.00015171395,0.000189289,0.000043107982,0.00008141512,0.00018938807,0.00004756946,0.0004552787],"category_scores_gemma":[0.00009469623,0.00011004574,0.00008633419,0.000053397594,0.000014480653,0.0004942493,0.000006102918,0.00017313701,0.000024682311],"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.000041459054,0.000014254894,0.000030216934,0.0000023988985,0.00012919554,0.0000013594464,0.00010932307,0.9216749,0.00051468064,0.000012762825,0.000017028013,0.077452436],"study_design_scores_gemma":[0.0006499347,0.000021612315,0.000011453206,0.000028609691,0.00002578337,0.00023441727,0.00006417342,0.99735457,0.0010687564,0.00019130365,0.00024444543,0.000104972074],"about_ca_topic_score_codex":0.0000026651016,"about_ca_topic_score_gemma":5.931717e-7,"teacher_disagreement_score":0.077347465,"about_ca_system_score_codex":0.00021816109,"about_ca_system_score_gemma":0.00005963954,"threshold_uncertainty_score":0.49849826},"labels":[],"label_agreement":null},{"id":"W1988175132","doi":"10.1287/ited.1110.0080","title":"Recommendations for an Undergraduate Curriculum at the Interface of Operations Research and Computer Science","year":2012,"lang":"en","type":"article","venue":"INFORMS Transactions on Education","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Undergraduate Education","keywords":"Curriculum; Interface (matter); Computer science; Set (abstract data type); Work (physics); Undergraduate research; Mathematics education; Engineering ethics; Undergraduate education; Order (exchange); Engineering management; Medical education; Pedagogy; Sociology; Psychology; Engineering; Medicine; Mechanical engineering; Programming language; Business","score_opus":0.04399661379666994,"score_gpt":0.3694180963995592,"score_spread":0.3254214826028893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988175132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14681214,0.000056419158,0.85035616,0.0010599708,0.0010359811,0.000324075,0.000016366555,0.000054577373,0.00028433383],"genre_scores_gemma":[0.9488645,0.000060574188,0.05057664,0.000037242902,0.000065207,0.00012516948,0.00002540647,0.000009612995,0.00023563833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945116,0.000012138465,0.00016135357,0.000081006794,0.00012888119,0.00016548234],"domain_scores_gemma":[0.99938804,0.00006549631,0.00001315679,0.00017982596,0.00027303566,0.0000804403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542863,0.000061572566,0.000049927672,0.00020628105,0.00055352197,0.0000672131,0.00010170321,0.000029996567,0.000025198344],"category_scores_gemma":[0.000013408389,0.000046965128,0.00001612073,0.0004337883,0.00015599414,0.00071504165,0.0000033724007,0.00011249053,0.000010567921],"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.000008407738,0.0005108235,0.00011516342,0.00004194881,0.000025992354,2.2668998e-9,0.0067502805,0.7466276,0.0005169025,0.0051091504,0.0009972072,0.23929648],"study_design_scores_gemma":[0.00021006267,0.0001715594,0.0005419429,0.000039886454,0.0000142805275,0.0000071423583,0.0033866058,0.9763401,0.01586998,0.00024761359,0.0030318554,0.0001389816],"about_ca_topic_score_codex":0.000045390367,"about_ca_topic_score_gemma":0.000066528264,"teacher_disagreement_score":0.8020524,"about_ca_system_score_codex":0.000115041374,"about_ca_system_score_gemma":0.000075489625,"threshold_uncertainty_score":0.42572993},"labels":[],"label_agreement":null},{"id":"W1988393189","doi":"10.1115/imece2004-59279","title":"Function-Block Enabled Job Shop Planning and Control With Uncertainty","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Job shop; Dynamism; Computer science; Fixture; Function (biology); Process (computing); Block (permutation group theory); Flow shop scheduling; Control (management); Industrial engineering; Operations research; Job shop scheduling; Engineering; Artificial intelligence; Mathematics","score_opus":0.006094184681371979,"score_gpt":0.1910299090324438,"score_spread":0.1849357243510718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988393189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19265401,0.0003649979,0.7960327,0.00016371484,0.0001873203,0.00013343254,0.0000019152126,0.00074301136,0.009718857],"genre_scores_gemma":[0.9796713,0.000006035633,0.019826237,0.00015388956,0.00006174688,0.000009234993,0.0000033176523,0.000017374019,0.0002508466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960077,0.000003933917,0.00008486358,0.000101041835,0.000074941105,0.00013445246],"domain_scores_gemma":[0.99979305,0.000026040872,0.000008886485,0.00007601766,0.00003083893,0.00006518108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046161174,0.000092675844,0.0000944304,0.000043249034,0.000057466867,0.000040502186,0.000028955645,0.000041886822,0.000044417375],"category_scores_gemma":[0.000008071201,0.000071991955,0.000011316504,0.00010040075,0.000015390795,0.00006558992,0.000003546771,0.000080845755,0.000010874248],"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.000021331416,0.0000035784874,0.0016976971,0.0000071207946,0.00003435758,0.000003266771,0.00009368973,0.99755436,0.000058678706,0.00024803248,0.0000406057,0.00023725345],"study_design_scores_gemma":[0.0043413676,0.00010169248,0.003384338,0.00004494387,0.00004270254,0.0000275167,0.00050896814,0.9903836,0.00040741795,0.00014804944,0.0003353583,0.00027401152],"about_ca_topic_score_codex":0.00001960929,"about_ca_topic_score_gemma":0.000009814608,"teacher_disagreement_score":0.7870173,"about_ca_system_score_codex":0.00002445475,"about_ca_system_score_gemma":0.000013602797,"threshold_uncertainty_score":0.2935747},"labels":[],"label_agreement":null},{"id":"W1988784053","doi":"10.1016/j.orl.2004.08.001","title":"The -machine flowshop problem with unit-time operations and intree precedence constraints","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematical optimization; Computer science; Time complexity; Unit (ring theory); Conjecture; Mathematics; Algorithm; Combinatorics","score_opus":0.019061492623753413,"score_gpt":0.2776207736294116,"score_spread":0.2585592810056582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988784053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6243072,0.0005440856,0.31595942,0.051960975,0.0001747069,0.0019477116,0.0000929289,0.00058454444,0.004428404],"genre_scores_gemma":[0.8109689,0.00031163424,0.18718658,0.00032483373,0.00011873784,0.000310046,0.00008286856,0.000055175933,0.00064124796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891466,0.00009199027,0.00016494091,0.00019100682,0.0003175248,0.00031985043],"domain_scores_gemma":[0.9992932,0.000116015326,0.0000038136268,0.0002628228,0.00020502173,0.000119102006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005019072,0.00011870108,0.000084915504,0.00012429891,0.0011052941,0.0005835648,0.00019451226,0.000039705705,0.00006866617],"category_scores_gemma":[0.00012363831,0.000082600025,0.000013323355,0.00048362897,0.00047750957,0.00027563452,0.000039012517,0.00039873572,0.00008266583],"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.000003816044,0.000013028602,0.000022922513,0.000005596525,0.000027540786,0.000004028371,0.00047968118,0.9899002,0.006185272,0.0012580472,0.00017068704,0.0019291964],"study_design_scores_gemma":[0.0005856934,0.00006740291,0.00012153123,0.000061435654,0.0000073887186,0.000040422445,0.00034085865,0.99568075,0.002344609,0.000027633168,0.0005306868,0.00019157778],"about_ca_topic_score_codex":0.000104554216,"about_ca_topic_score_gemma":0.0010392902,"teacher_disagreement_score":0.18666166,"about_ca_system_score_codex":0.00007029476,"about_ca_system_score_gemma":0.00010717928,"threshold_uncertainty_score":0.850114},"labels":[],"label_agreement":null},{"id":"W1989829168","doi":"10.1007/s00170-008-1558-6","title":"A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem","year":2008,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":79,"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":"Tardiness; Variable neighborhood search; Mathematical optimization; Flow shop scheduling; Job shop scheduling; Computer science; Permutation (music); Algorithm; Scheduling (production processes); Genetic algorithm; Mathematics; Metaheuristic; Schedule","score_opus":0.015878452142812086,"score_gpt":0.26197299096007176,"score_spread":0.24609453881725968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989829168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22138062,0.0002774436,0.775998,0.000655745,0.0011622596,0.00022718954,0.000025019228,0.00025483748,0.000018893506],"genre_scores_gemma":[0.29015356,0.00017253419,0.709234,0.000058587284,0.00026202793,0.000034866283,0.000011844097,0.000043797936,0.000028800425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985918,0.000013862939,0.0005895673,0.00020209889,0.000317992,0.00028472368],"domain_scores_gemma":[0.99880993,0.00014799637,0.00029928074,0.00017317233,0.0005147237,0.00005490227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025916926,0.00023500869,0.00030033698,0.0005962409,0.00017608385,0.000051409574,0.00071283703,0.000113736285,0.000015786944],"category_scores_gemma":[0.00017541861,0.00019854121,0.00015106023,0.00013702812,0.000105150655,0.0003501616,0.000081638645,0.00048419263,0.0000049041123],"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.000073618,0.00006737157,0.000010139229,0.000013594192,0.0003106299,0.000040941035,0.00048344507,0.8600153,0.01881295,0.000050814273,0.00002495859,0.12009628],"study_design_scores_gemma":[0.002182194,0.000078188976,0.00004894364,0.00011822676,0.000027815751,0.0016817588,0.00047755506,0.7417046,0.25197348,0.0012669094,0.0002381997,0.00020214618],"about_ca_topic_score_codex":0.0000027267163,"about_ca_topic_score_gemma":0.0000024199296,"teacher_disagreement_score":0.23316054,"about_ca_system_score_codex":0.00025824542,"about_ca_system_score_gemma":0.00006166024,"threshold_uncertainty_score":0.80962753},"labels":[],"label_agreement":null},{"id":"W1990280946","doi":"10.1243/1748006xjrr24","title":"Minimizing maintenance cost involving flow-time and tardiness penalty with unequal release dates","year":2007,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part O Journal of Risk and Reliability","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Tardiness; Schedule; Scheduling (production processes); Computer science; Preventive maintenance; Mathematical optimization; Minification; Retard; Due date; Job shop scheduling; Mathematics; Reliability engineering; Engineering","score_opus":0.0056777393329820024,"score_gpt":0.19609202833350778,"score_spread":0.1904142890005258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990280946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93665314,0.00048540984,0.062244337,0.00008636212,0.0002994089,0.00013855472,0.000014396876,0.000029173023,0.000049200626],"genre_scores_gemma":[0.9402614,0.000826731,0.058814537,0.0000069727184,0.000073083334,9.863425e-7,7.7320584e-7,0.000011401299,0.000004080525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881256,0.0000094971865,0.00059475953,0.00012864312,0.00028257843,0.00017198034],"domain_scores_gemma":[0.9988098,0.00015651717,0.00030957066,0.00007685853,0.000506626,0.00014062067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016938008,0.00014815424,0.00033886463,0.00008964119,0.00008424011,0.0000181538,0.00015303891,0.00010193485,0.0000033498654],"category_scores_gemma":[0.00120508,0.0000943327,0.00007542567,0.0002570368,0.00018614612,0.00025517517,0.000043010492,0.00036515036,1.6733611e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058974803,0.000119938915,0.003361078,0.00060063374,0.00012165269,0.0000032000205,0.0006518119,0.9812354,0.006165436,0.0018224253,0.00012675948,0.005201908],"study_design_scores_gemma":[0.0020861237,0.00024293739,0.0021697015,0.0013251983,0.00023851241,0.000121303114,0.00091228884,0.92070585,0.07099466,0.00054029963,0.00034722983,0.0003159217],"about_ca_topic_score_codex":0.000006843917,"about_ca_topic_score_gemma":9.96315e-7,"teacher_disagreement_score":0.06482922,"about_ca_system_score_codex":0.000047230988,"about_ca_system_score_gemma":0.00003257632,"threshold_uncertainty_score":0.38467762},"labels":[],"label_agreement":null},{"id":"W1991088970","doi":"10.5555/1030818.1030985","title":"Manufacturing analysis and control: behavior of an order release mechanism in a make-to-order manufacturing system with selected order acceptance","year":2003,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Nortel (Canada)","funders":"","keywords":"Order (exchange); Component (thermodynamics); Factory (object-oriented programming); Control (management); Build to order; Computer science; Mechanism (biology); Order processing; Value (mathematics); Manufacturing engineering; Operations management; Risk analysis (engineering); Business; Reliability engineering; Engineering; Production (economics); Economics; Marketing; Microeconomics; Supply chain","score_opus":0.009102800130772446,"score_gpt":0.2281872963438534,"score_spread":0.21908449621308096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991088970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49418437,0.0000075958915,0.5053721,0.000005122027,0.000040548617,0.00020377633,0.0000064841424,0.00010551169,0.00007451613],"genre_scores_gemma":[0.93247676,0.0000019523363,0.06735827,0.000026047175,0.000011642713,0.000040770155,0.000016999536,0.000033940145,0.0000336057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987456,0.00007580022,0.00038631295,0.0003432076,0.00020256385,0.00024648246],"domain_scores_gemma":[0.99912274,0.00006153977,0.00008474138,0.0002759638,0.00033283388,0.00012217362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001312468,0.00023600548,0.0003651054,0.00043163882,0.00004594336,0.000081903076,0.000111670335,0.00010197282,0.000119789984],"category_scores_gemma":[0.00004447705,0.00022644768,0.00002642696,0.0007615586,0.00001874708,0.00019636877,0.000012728757,0.00016124593,0.000003555309],"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.000042193016,0.000028195735,0.0026131135,0.00004562684,0.00012107172,0.0000081431235,0.000424916,0.9945192,0.00030177744,0.000088905115,9.0513964e-8,0.0018067958],"study_design_scores_gemma":[0.0012871219,0.000050208415,0.019706827,0.00007625955,0.00016495452,0.0000049342543,0.00028507042,0.9549292,0.023206407,0.000008265565,0.000004961406,0.00027580385],"about_ca_topic_score_codex":0.000050841387,"about_ca_topic_score_gemma":0.00036592904,"teacher_disagreement_score":0.4382924,"about_ca_system_score_codex":0.000062783896,"about_ca_system_score_gemma":0.00003580032,"threshold_uncertainty_score":0.92342687},"labels":[],"label_agreement":null},{"id":"W1991396184","doi":"10.1007/s10951-009-0128-6","title":"Open-shop dense schedules: properties and worst-case performance ratio","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematical proof; Job shop scheduling; Open shop; Schedule; Heuristic; Computer science; Mathematical optimization; Mathematics; Construct (python library); Scheduling (production processes); Combinatorics; Discrete mathematics; Flow shop scheduling","score_opus":0.03315531448050888,"score_gpt":0.23928110986926873,"score_spread":0.20612579538875986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991396184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95992804,0.003042271,0.035930693,0.0002681795,0.00032763853,0.00010332378,5.5943076e-7,0.00006033055,0.00033895473],"genre_scores_gemma":[0.7849779,0.0005835937,0.21403868,0.00011052065,0.00022915084,0.0000010067117,4.397768e-7,0.00001849716,0.000040206203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896425,0.000024964178,0.00050001795,0.00011373813,0.00018862258,0.00020843331],"domain_scores_gemma":[0.9993287,0.000028870103,0.0001397503,0.00013307025,0.00020865355,0.0001609639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005290989,0.00016685811,0.00027185556,0.00017200687,0.00014565926,0.0003311774,0.00023837274,0.00008370419,0.000021360876],"category_scores_gemma":[0.000111537534,0.00013889855,0.000048694677,0.00021098169,0.00003403708,0.00090386835,0.000036512367,0.00037283154,0.000009051042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008491227,0.000059302267,0.0007600931,0.00007942584,0.00007651535,0.00035541246,0.0011191192,0.96147436,0.0036237885,0.00022979094,0.000038355378,0.032098927],"study_design_scores_gemma":[0.0011568209,0.00020540722,0.0003208177,0.00044385897,0.000048869133,0.003987924,0.0013645183,0.9811361,0.010853261,0.000082452745,0.000112364774,0.0002875933],"about_ca_topic_score_codex":0.0000010079441,"about_ca_topic_score_gemma":8.1153655e-7,"teacher_disagreement_score":0.17810799,"about_ca_system_score_codex":0.000045059795,"about_ca_system_score_gemma":0.000054762284,"threshold_uncertainty_score":0.56641185},"labels":[],"label_agreement":null},{"id":"W1991818145","doi":"10.1016/j.ins.2011.11.001","title":"A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Lakehead University","funders":"","keywords":"Logarithm; Computer science; Scheduling (production processes); Learning effect; Position (finance); Single-machine scheduling; Artificial intelligence; Mathematical optimization; Mathematics; Job shop scheduling; Schedule; Operating system; Economics","score_opus":0.009746961941900655,"score_gpt":0.2204452142784615,"score_spread":0.21069825233656084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991818145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16317979,0.00006495351,0.830767,0.000060195664,0.0000890193,0.00014104239,0.0000035144499,0.00030587896,0.005388645],"genre_scores_gemma":[0.80084914,0.0000016188418,0.19898881,0.00012952306,0.000006969908,0.0000064583132,0.000010157637,0.000004912259,0.000002414676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.00001656654,0.00019040421,0.000083552375,0.00025745347,0.00013486613],"domain_scores_gemma":[0.9996077,0.00009894128,0.00009201721,0.000061848696,0.0000861842,0.000053330685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003126536,0.00010503451,0.00010720115,0.00027437092,0.00019215464,0.00009439173,0.00009850951,0.00004469316,0.00002025568],"category_scores_gemma":[0.00006116935,0.000082785664,0.000016562508,0.00044272258,0.0001334468,0.0006143149,0.0000061499754,0.000107485626,0.000019702302],"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.000019912224,0.0000095452015,0.0011858882,0.00008680699,0.0000030023416,4.555529e-7,0.00064827147,0.9741847,0.00008198107,0.000044878205,0.0000013318855,0.023733225],"study_design_scores_gemma":[0.00045804444,0.00020435631,0.0009827818,0.00014964679,0.000007214744,0.0000018189288,0.000057193134,0.9852801,0.012708085,0.000012031448,0.000022539807,0.000116195944],"about_ca_topic_score_codex":0.000017021046,"about_ca_topic_score_gemma":0.0000014818886,"teacher_disagreement_score":0.6376693,"about_ca_system_score_codex":0.000016099433,"about_ca_system_score_gemma":0.000063769105,"threshold_uncertainty_score":0.33759013},"labels":[],"label_agreement":null},{"id":"W1993897170","doi":"10.1007/s10696-007-9026-4","title":"Analysis of reactive deadlock-free scheduling in flexible job shops","year":2007,"lang":"en","type":"article","venue":"International Journal of Flexible Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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 Manitoba","funders":"","keywords":"Computer science; Scheduling (production processes); Flow shop scheduling; Job scheduler; Job shop scheduling; Schedule; Heuristic; Mathematical optimization; Distributed computing; Mathematics; Computer network; Operating system","score_opus":0.013861040430121527,"score_gpt":0.2648171267620636,"score_spread":0.25095608633194205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993897170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7763705,0.0008421571,0.2166393,0.000038947637,0.0029042426,0.00008325402,0.000015772626,0.00007622606,0.0030295788],"genre_scores_gemma":[0.9878452,0.000050144597,0.011470117,0.000014816774,0.00039270124,0.0000024320684,0.00000778611,0.000030206083,0.00018659832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750936,0.00003654446,0.001231163,0.00015827712,0.00079251046,0.00027214596],"domain_scores_gemma":[0.9985181,0.00023949862,0.00045188272,0.0002500326,0.00042388917,0.00011661213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012264575,0.00019556572,0.00051619526,0.0024922749,0.000025095478,0.000086338274,0.0007055449,0.00012828069,0.000050197923],"category_scores_gemma":[0.00011738376,0.00019209267,0.00025554452,0.0005850577,0.00003101523,0.0003318983,0.000056409852,0.0003542178,0.000005217984],"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.00009484841,0.000043153887,0.009068116,0.000029848223,0.0017774387,0.00008339275,0.0005221537,0.9854714,0.00053231465,0.00031642566,0.00002535032,0.0020355338],"study_design_scores_gemma":[0.0041670846,0.00015519558,0.13762052,0.001281168,0.00083107076,0.00037489377,0.004972435,0.62469697,0.22383104,0.00034592743,0.0008020811,0.00092162425],"about_ca_topic_score_codex":0.00017114657,"about_ca_topic_score_gemma":0.00003307452,"teacher_disagreement_score":0.3607745,"about_ca_system_score_codex":0.00037731422,"about_ca_system_score_gemma":0.000042634598,"threshold_uncertainty_score":0.7833312},"labels":[],"label_agreement":null},{"id":"W1994355768","doi":"10.1115/detc2004-57686","title":"A Multi-Agent Framework for Collaborative Engineering Design and Optimization","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Interoperation; Collaborative engineering; Computer science; Collaborative design; Concurrent engineering; Multi-agent system; Systems engineering; Software engineering; Intelligent agent; Engineering; Interoperability; Systems design; World Wide Web; Artificial intelligence","score_opus":0.020249880650643565,"score_gpt":0.23952796233569512,"score_spread":0.21927808168505156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994355768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023816712,0.000245179,0.99850714,0.00006162515,0.00019470217,0.00032594774,0.00000352018,0.000405118,0.00001861887],"genre_scores_gemma":[0.011034834,0.00008949178,0.9886719,0.000036629543,0.000039263665,0.00007295263,0.0000065750046,0.000030344541,0.000018011486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961555,0.0000041219996,0.00010526244,0.0001053291,0.000046891022,0.0001228451],"domain_scores_gemma":[0.99973273,0.00007335293,0.000010960954,0.00006518229,0.000059426744,0.00005832181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068815316,0.000098409364,0.00008636429,0.000055187353,0.00004157628,0.000046298013,0.00003403995,0.00007479197,0.000012263292],"category_scores_gemma":[0.00008645674,0.000098996694,0.000014483971,0.00018146964,0.000007365886,0.00007785428,0.000005647977,0.00005412803,0.0000028343813],"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.0000029401626,0.0000081253,0.0000016528835,0.000014063061,0.00001690418,3.798926e-7,0.0003005362,0.99765724,0.00007501532,0.0016810085,0.000009927758,0.000232216],"study_design_scores_gemma":[0.0005520762,0.00002371252,0.000006960419,0.000025006786,0.000008321862,0.0000012795614,0.000108204935,0.996103,0.0028830913,0.0001171992,0.000042825206,0.00012835141],"about_ca_topic_score_codex":7.570398e-7,"about_ca_topic_score_gemma":2.3642033e-7,"teacher_disagreement_score":0.010796667,"about_ca_system_score_codex":0.000041557752,"about_ca_system_score_gemma":0.000014045445,"threshold_uncertainty_score":0.4036968},"labels":[],"label_agreement":null},{"id":"W1994534839","doi":"10.1007/s00170-012-4169-1","title":"Two-machine, no-wait job shop problem with separable setup times and single-server constraints","year":2012,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"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 Manitoba","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Computer science; Job shop; Separable space; Constraint (computer-aided design); Scheduling (production processes); Set (abstract data type); Flow shop scheduling; Genetic algorithm; Context (archaeology); Upper and lower bounds; Mathematics; Schedule","score_opus":0.006463847954733654,"score_gpt":0.22280047817609555,"score_spread":0.2163366302213619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994534839","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702517,0.0011523651,0.022749878,0.001282471,0.00088199903,0.00012660601,0.0000077047935,0.00025543524,0.0032918735],"genre_scores_gemma":[0.8438996,0.00012481557,0.15557832,0.000067966066,0.0001394996,0.000003822281,0.0000020318014,0.00002479551,0.00015913422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99917394,0.000011347117,0.00027201363,0.00008658211,0.00023377169,0.00022235121],"domain_scores_gemma":[0.9994416,0.00007083664,0.00014939198,0.00012889001,0.00014883252,0.00006044636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019081242,0.00015122727,0.00017304409,0.00023079947,0.00005211157,0.00004183771,0.000384232,0.00006870884,0.00009310897],"category_scores_gemma":[0.000037819464,0.000103516955,0.00003418918,0.000070949485,0.00014881018,0.0003272652,0.00006664421,0.0003658992,0.0000135408545],"study_design_candidate":"bench_or_experimental","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.00029179093,0.00015457123,0.0044509256,0.00005237287,0.0010691292,0.00008215885,0.0004931682,0.8714108,0.01248748,0.0049565877,0.00038613897,0.104164876],"study_design_scores_gemma":[0.007856006,0.0006414467,0.0019226372,0.0007952901,0.000220663,0.010960491,0.0014517405,0.04167733,0.90506405,0.012946411,0.015178818,0.0012851013],"about_ca_topic_score_codex":0.0000019879308,"about_ca_topic_score_gemma":0.0000037830048,"teacher_disagreement_score":0.8925766,"about_ca_system_score_codex":0.000078114645,"about_ca_system_score_gemma":0.000014985041,"threshold_uncertainty_score":0.4221299},"labels":[],"label_agreement":null},{"id":"W1995082853","doi":"10.1016/j.ejor.2012.04.008","title":"A constraint programming approach for a batch processing problem with non-identical job sizes","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":61,"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":"Mathematical optimization; Constraint (computer-aided design); Computer science; Constraint programming; Domain (mathematical analysis); Batch processing; Process (computing); Decomposition method (queueing theory); Algorithm; Mathematics; Stochastic programming","score_opus":0.055826109758362726,"score_gpt":0.323007351941702,"score_spread":0.2671812421833393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995082853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025175665,0.0004233381,0.96662235,0.00021622048,0.000071023715,0.00037669856,0.0000027801038,0.00003431911,0.007077618],"genre_scores_gemma":[0.5019238,0.0000075512085,0.49748257,0.000010052554,0.00043040002,0.000011981672,0.00000488177,0.00003036012,0.00009838954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982521,0.00016832375,0.00040193595,0.00010172188,0.0006770755,0.00039882725],"domain_scores_gemma":[0.9985243,0.00012282329,0.00005044774,0.00007209762,0.0009972951,0.0002330074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042648874,0.000110125795,0.00014871695,0.00018099764,0.00021998442,0.00032719554,0.00019273894,0.000023820594,0.000026153757],"category_scores_gemma":[0.00024299548,0.00008173963,0.000049145667,0.0002785398,0.00012006172,0.0004215378,0.00002496057,0.00044760184,0.000009867514],"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.00056028715,0.0009400643,0.007539276,0.0010608615,0.0004936601,0.00011371433,0.01012481,0.79329425,0.005741928,0.0031191967,0.0035707161,0.17344122],"study_design_scores_gemma":[0.0035513565,0.0009662336,0.0036492476,0.00055236544,0.00005267638,0.0010264344,0.003197532,0.97961015,0.001502839,0.000026678805,0.0053658313,0.00049865025],"about_ca_topic_score_codex":3.7843793e-7,"about_ca_topic_score_gemma":1.4711108e-7,"teacher_disagreement_score":0.47674817,"about_ca_system_score_codex":0.000062844316,"about_ca_system_score_gemma":0.00017555701,"threshold_uncertainty_score":0.33332452},"labels":[],"label_agreement":null},{"id":"W1996160430","doi":"10.3166/jesa.38.759-772","title":"Flexible job-shop scheduling with multi-agent system and tabu search","year":2004,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Job shop; Job shop scheduling; Flow shop scheduling; Computer science; Scheduling (production processes); Guided Local Search; Mathematical optimization; Operations research; Artificial intelligence; Engineering; Mathematics; Schedule; Operating system","score_opus":0.0229172204196536,"score_gpt":0.24898248264349168,"score_spread":0.22606526222383808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996160430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42037094,0.0024662253,0.5746946,0.0000513319,0.00039982478,0.0001778497,0.0000053224394,0.0010280823,0.000805843],"genre_scores_gemma":[0.632713,0.0002407328,0.366577,0.00001755458,0.00017042411,0.0000070126043,0.0000020135724,0.00008713014,0.00018509859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982813,0.00008178432,0.00048749297,0.00022797706,0.00044312963,0.00047832658],"domain_scores_gemma":[0.9990766,0.00004222349,0.000096476324,0.00021748476,0.00021844542,0.00034874905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046624028,0.00029173208,0.0003465296,0.00027305732,0.00040900125,0.0005184642,0.00020798235,0.00009690783,0.000023926994],"category_scores_gemma":[0.000043051525,0.00023772876,0.000067113506,0.00042424042,0.00008712194,0.00038341497,0.00004615887,0.0004664579,0.00009001195],"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.000009198653,0.000025263718,0.0010774999,0.00039952146,0.0001363587,0.00020877556,0.0011301388,0.9779909,0.00043876856,0.000432052,0.000014603149,0.018136904],"study_design_scores_gemma":[0.0021278155,0.00013446114,0.030524472,0.0015008887,0.000066243076,0.004282599,0.0015625904,0.9577791,0.001496799,0.00003815886,0.000047478876,0.00043941094],"about_ca_topic_score_codex":0.000018258897,"about_ca_topic_score_gemma":0.0000061739593,"teacher_disagreement_score":0.21234208,"about_ca_system_score_codex":0.00039688597,"about_ca_system_score_gemma":0.00009863388,"threshold_uncertainty_score":0.96942973},"labels":[],"label_agreement":null},{"id":"W1996281476","doi":"10.1016/j.disopt.2009.03.001","title":"The bipartite margin shop and maximum red matchings free of blue–red alternating cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Optimization","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Margin (machine learning); Mathematical optimization; Algorithm; Computer science; Graph","score_opus":0.0066513854110430695,"score_gpt":0.21806962236898966,"score_spread":0.2114182369579466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996281476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09638609,0.00089822116,0.89590126,0.0019964916,0.00037236288,0.00031977255,0.000025272175,0.00046973405,0.0036308025],"genre_scores_gemma":[0.65521836,0.0010664887,0.34321663,0.00007808281,0.00011248799,0.000012804293,0.00008598991,0.00005412671,0.00015501006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915665,0.000027492142,0.0003017069,0.00015200741,0.0001734472,0.00018868875],"domain_scores_gemma":[0.99948674,0.00005438861,0.000086499625,0.00025404757,0.000061659564,0.000056680343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018121244,0.00014183536,0.00014096749,0.000072240604,0.00014304685,0.00010381794,0.00017519896,0.00006501185,0.000019108706],"category_scores_gemma":[0.00010141327,0.00011843567,0.000038111895,0.00020203635,0.00003661212,0.00018727576,0.000029231906,0.00009754179,0.0000011880744],"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.000011349663,0.0000052350742,0.00018842709,0.000011600325,0.000017223736,6.94328e-7,0.00029538834,0.9934813,0.0002666705,0.00026043926,0.00012771328,0.0053339563],"study_design_scores_gemma":[0.00039961535,0.000021963408,0.0006812649,0.000044772623,0.000016869537,0.0000029062367,0.00017684295,0.9964903,0.0013735116,0.000556737,0.00009357248,0.00014165214],"about_ca_topic_score_codex":0.000006793438,"about_ca_topic_score_gemma":0.0000024204617,"teacher_disagreement_score":0.5588323,"about_ca_system_score_codex":0.000018745142,"about_ca_system_score_gemma":0.0000061918236,"threshold_uncertainty_score":0.48296666},"labels":[],"label_agreement":null},{"id":"W1996369139","doi":"10.3166/jesa.40.787-809","title":"Stratégie de commande globale intégrant la maintenance et la non-conformité des produits","year":2006,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities; Political science","score_opus":0.010309643828211743,"score_gpt":0.24673839410438278,"score_spread":0.23642875027617105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996369139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3842597,0.017225005,0.51105106,0.0011706922,0.00210852,0.0005150965,0.00013373705,0.0009256246,0.08261055],"genre_scores_gemma":[0.6036031,0.0033058766,0.38303292,0.00014145808,0.0007895042,0.00001725027,0.000017572196,0.00018446593,0.008907819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99657476,0.0005939486,0.0010344804,0.00030437345,0.000489821,0.001002635],"domain_scores_gemma":[0.9982644,0.00031247322,0.00037356425,0.00033430936,0.0003532878,0.00036201175],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018292521,0.00053406233,0.0005952175,0.0002175708,0.00047434037,0.0011234927,0.0004916014,0.00032131458,0.00015969803],"category_scores_gemma":[0.0002798807,0.0005160171,0.00026110216,0.00055230473,0.0004527826,0.0007350569,0.00008942917,0.0010459715,0.00016223334],"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.000026685579,0.0002712917,0.0070376866,0.0010543389,0.00027092278,0.0010912284,0.0018379828,0.6030351,0.00039597793,0.012072494,0.007601272,0.365305],"study_design_scores_gemma":[0.0016373885,0.00014820405,0.578897,0.0033780145,0.00015515696,0.010527093,0.00032787016,0.3854409,0.000502115,0.011433207,0.0068244003,0.0007286554],"about_ca_topic_score_codex":0.00041714963,"about_ca_topic_score_gemma":0.0001344316,"teacher_disagreement_score":0.5718593,"about_ca_system_score_codex":0.0006334208,"about_ca_system_score_gemma":0.00038553492,"threshold_uncertainty_score":0.99991345},"labels":[],"label_agreement":null},{"id":"W1996627363","doi":"10.1002/cjce.20093","title":"A generalized approach to demand buffering and production levelling for JIT make‐to‐stock applications","year":2008,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production (economics); Scheduling (production processes); Stock (firearms); Finished good; Operations research; Receipt; Computer science; Operations management; Service level; Business; Economics; Microeconomics; Engineering; Marketing","score_opus":0.020369723230107693,"score_gpt":0.19988932270269544,"score_spread":0.17951959947258775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996627363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3085933,0.00039247662,0.6901429,0.0003176665,0.00017157703,0.00029581177,0.000003912845,0.000040663428,0.000041656465],"genre_scores_gemma":[0.7454632,0.000007859178,0.2539151,0.0000509001,0.0004427066,0.000056496276,0.0000021613512,0.00003469218,0.000026884458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937487,0.000003634357,0.00021783523,0.00009731448,0.00008648931,0.00021985765],"domain_scores_gemma":[0.99933916,0.000030154897,0.000024115703,0.0001060411,0.00009042876,0.00041009797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017271857,0.00011019984,0.00015308791,0.00015625433,0.00010535004,0.00003560703,0.000137874,0.000050560455,0.000001275569],"category_scores_gemma":[0.00010164436,0.00009870529,0.000041122934,0.00022858073,0.000016115171,0.000042786945,0.0000064806977,0.00015976,9.698213e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003571571,0.0000020976763,0.000009521596,0.00003162276,0.000023890974,7.5262176e-7,0.00050005515,0.979558,0.018757341,0.00012991838,0.000112665926,0.0008705762],"study_design_scores_gemma":[0.00038436928,0.000019703153,0.000051496976,0.000069753194,0.000038240385,0.0004732214,0.000025564656,0.9191342,0.07452785,0.000057946243,0.004915498,0.00030212812],"about_ca_topic_score_codex":0.000042287513,"about_ca_topic_score_gemma":0.000011945159,"teacher_disagreement_score":0.4368699,"about_ca_system_score_codex":0.0001217464,"about_ca_system_score_gemma":0.000058379585,"threshold_uncertainty_score":0.4025085},"labels":[],"label_agreement":null},{"id":"W1997936433","doi":"10.3166/jesa.38.373-395","title":"Etude de robustesse : configuration d'un parc de machines partiellement multifonctions","year":2004,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.016698531067259728,"score_gpt":0.2497439092771209,"score_spread":0.23304537820986115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997936433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12482927,0.008551313,0.8595911,0.002616223,0.0023798165,0.00025480957,0.000028929584,0.00049556507,0.0012529425],"genre_scores_gemma":[0.4013157,0.0025087001,0.59267604,0.00019082667,0.0011168275,0.00003133598,0.000018440292,0.00013633876,0.0020057922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702215,0.00041824786,0.0009977489,0.00026760658,0.00042291818,0.00087132235],"domain_scores_gemma":[0.99839854,0.00013862741,0.0003400526,0.00028265614,0.00029138316,0.00054874906],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00092090544,0.00043097546,0.00040448798,0.0002430847,0.00072653807,0.0006389093,0.00029393454,0.0002445834,0.0013094691],"category_scores_gemma":[0.00036256816,0.0004513768,0.0002363416,0.00045593787,0.00012535187,0.00052768766,0.00004574997,0.00078256516,0.0003050091],"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.000009564437,0.00017946765,0.00085251464,0.0001915789,0.00025967855,0.00021320693,0.0048257387,0.828667,0.00094559987,0.0021816988,0.00049256027,0.16118139],"study_design_scores_gemma":[0.0019503933,0.00016857924,0.038775135,0.001008546,0.00028484393,0.003270803,0.0008266653,0.94386315,0.0034037244,0.004613237,0.0012971098,0.0005377975],"about_ca_topic_score_codex":0.00040101513,"about_ca_topic_score_gemma":0.00009245113,"teacher_disagreement_score":0.2764864,"about_ca_system_score_codex":0.0014809507,"about_ca_system_score_gemma":0.00039729604,"threshold_uncertainty_score":0.9997938},"labels":[],"label_agreement":null},{"id":"W1997949345","doi":"10.1109/tsmc.2013.2263312","title":"Guest Editorial: Special issue on industrial applications of distributed intelligent systems","year":2013,"lang":"en","type":"editorial","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Automation; Computer science; Process (computing); Intelligent decision support system; Focus (optics); Engineering management; Systems engineering; Engineering; Artificial intelligence","score_opus":0.01167129691551047,"score_gpt":0.2216462696575993,"score_spread":0.20997497274208882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997949345","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022152362,0.0009331433,0.116047576,0.00000567425,0.8758117,0.0024630267,0.00304816,0.00041633233,0.0012522691],"genre_scores_gemma":[0.007404843,0.0010348131,0.00003621252,0.0000014609117,0.98513,0.001344072,0.00055879407,0.00023248479,0.0042573176],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950186,0.0002681334,0.0018219338,0.00075420056,0.0015861775,0.000550957],"domain_scores_gemma":[0.996678,0.0007222015,0.00056229794,0.00093711884,0.00070920994,0.00039120318],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005381159,0.00088068226,0.001426663,0.00057811395,0.00021583779,0.00060628046,0.00052164734,0.002418424,0.000029639297],"category_scores_gemma":[0.000035466266,0.0008832569,0.00021703077,0.0005381313,0.00013604935,0.00010542726,0.0000052693827,0.0016350107,0.00034683757],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000023597353,0.00010233869,4.178438e-7,0.00068014744,0.0002676298,0.0000017469474,0.00016216066,0.3393788,0.000005271185,0.000039242943,0.65887225,0.00046639182],"study_design_scores_gemma":[0.0009134434,0.0002609671,1.502681e-7,0.001431675,0.00024403652,0.000007811426,0.0008226154,0.03729462,0.00012543672,0.0000012892425,0.9581491,0.0007488924],"about_ca_topic_score_codex":0.0010371433,"about_ca_topic_score_gemma":0.000018860801,"teacher_disagreement_score":0.30208418,"about_ca_system_score_codex":0.00045749676,"about_ca_system_score_gemma":0.00014506663,"threshold_uncertainty_score":0.9993618},"labels":[],"label_agreement":null},{"id":"W1998840907","doi":"10.1007/s11123-006-0026-2","title":"Introduction to a Special Issue on Productivity Measurement if Complex Services Industries","year":2007,"lang":"en","type":"article","venue":"Journal of Productivity Analysis","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Productivity; Industrial organization; Economics; Business; Econometrics; Macroeconomics","score_opus":0.02376953055936132,"score_gpt":0.24990352922232267,"score_spread":0.22613399866296136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998840907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80694956,0.00016670862,0.16767499,0.017916976,0.0050372262,0.0004586915,0.000013008645,0.0002182821,0.0015645473],"genre_scores_gemma":[0.9297517,0.000015106851,0.017564006,0.000060146656,0.052325275,0.000002543645,0.000006050017,0.000029979728,0.0002452153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976919,0.00008836595,0.0005928473,0.00033215157,0.0010026795,0.00029202225],"domain_scores_gemma":[0.99817735,0.000031632357,0.00026275337,0.0003965124,0.0009472694,0.00018445333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034224566,0.00022513626,0.00053454767,0.0011704621,0.0001288974,0.00009418872,0.00021679986,0.00009053245,0.00031997613],"category_scores_gemma":[0.00046611435,0.00020879475,0.00019261395,0.0030112755,0.00003827112,0.00040581677,0.000025881913,0.00044871596,0.000034945348],"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.00019420996,0.00030955512,0.0016789327,0.000051093793,0.0015061293,0.000009362368,0.0011377628,0.93212444,0.0031082786,0.000017977058,0.009068173,0.05079411],"study_design_scores_gemma":[0.0018243339,0.0013603626,0.19179778,0.00017535384,0.0053710504,0.00015046608,0.0039009438,0.039910145,0.27354196,0.0002219788,0.47973457,0.0020110805],"about_ca_topic_score_codex":0.000018099065,"about_ca_topic_score_gemma":0.00015855936,"teacher_disagreement_score":0.8922143,"about_ca_system_score_codex":0.00036493922,"about_ca_system_score_gemma":0.000043269694,"threshold_uncertainty_score":0.8514403},"labels":[],"label_agreement":null},{"id":"W1999219034","doi":"10.1142/s0129054110007118","title":"APPROXIMATION SCHEMES FOR SCHEDULING JOBS WITH CHAIN PRECEDENCE CONSTRAINTS","year":2010,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Polynomial-time approximation scheme; Approximation algorithm; Job shop scheduling; Time complexity; Mathematics; Algorithm","score_opus":0.01225638514331587,"score_gpt":0.2719652398540387,"score_spread":0.2597088547107228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999219034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19200195,0.000009050653,0.80585253,0.00019135262,0.0017268924,0.00007272781,0.0000044510593,0.00002333162,0.000117709205],"genre_scores_gemma":[0.5046532,0.0000033775173,0.4951652,0.000011643724,0.0001563168,0.0000020417206,0.0000019161514,0.000004105429,0.00000217493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989245,0.000005850951,0.00036004806,0.00010046846,0.0004982339,0.00011090059],"domain_scores_gemma":[0.99765056,0.000113087335,0.00022800009,0.000109074936,0.0018337504,0.00006553792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057095767,0.00007936843,0.00011083794,0.0003689212,0.00007884981,0.00017136728,0.00062618905,0.000029584075,0.000020289914],"category_scores_gemma":[0.00018524009,0.000069580354,0.000045666606,0.00027657155,0.0003683715,0.000792212,0.000026554282,0.00014812576,0.0000015078351],"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.00003373428,0.00009795309,0.0015458114,0.000027419284,0.00011873187,0.0000021746625,0.00069681054,0.755022,0.024420021,0.021733977,0.000024070565,0.19627728],"study_design_scores_gemma":[0.0005265847,0.00007001258,0.0009638957,0.000086989356,0.000007557457,0.00011572401,0.000043595493,0.9759645,0.021350794,0.0006035814,0.00017167689,0.000095105905],"about_ca_topic_score_codex":7.020356e-7,"about_ca_topic_score_gemma":0.0000020692596,"teacher_disagreement_score":0.31265128,"about_ca_system_score_codex":0.000036228827,"about_ca_system_score_gemma":0.0002342327,"threshold_uncertainty_score":0.28374046},"labels":[],"label_agreement":null},{"id":"W1999513701","doi":"10.1080/00207540110095222","title":"Hybrid genetic algorithm for the economic lot-scheduling problem","year":2002,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Job shop scheduling; Genetic algorithm; Heuristic; Algorithm; Operations research; Mathematics; Schedule","score_opus":0.05587131126522115,"score_gpt":0.32577643680617646,"score_spread":0.2699051255409553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999513701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027067637,0.0038591484,0.9491102,0.0085001215,0.010229966,0.00053966354,0.000021411255,0.00008913774,0.0005826842],"genre_scores_gemma":[0.2925784,0.0034943484,0.6915818,0.000059774415,0.0103381425,0.00006974614,0.0000060844427,0.00007477598,0.0017969451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987242,0.000046271238,0.00038677626,0.00013051496,0.0005166512,0.00019554784],"domain_scores_gemma":[0.99853724,0.00018770024,0.00008447504,0.0001324015,0.0009963887,0.00006180406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011914928,0.000082007966,0.00009805355,0.00031200494,0.00012326997,0.00015264789,0.0004637349,0.000034563538,0.0002557417],"category_scores_gemma":[0.00019955938,0.00006453833,0.000088267894,0.000094010946,0.00006382732,0.00019936347,0.00002832676,0.0003911421,0.00006710516],"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.00000811197,0.000019372912,0.000013337584,0.000005950481,0.00013565915,0.0000050313733,0.00014481199,0.73301107,0.00013961176,0.00005286047,0.005828444,0.26063576],"study_design_scores_gemma":[0.00034495955,0.000050596576,0.00004680319,0.000027793954,0.000009878194,0.00029655002,0.00014557478,0.97766346,0.0038603148,0.0005378836,0.01694118,0.000074980504],"about_ca_topic_score_codex":0.000005353908,"about_ca_topic_score_gemma":8.9737426e-7,"teacher_disagreement_score":0.26551074,"about_ca_system_score_codex":0.00028018825,"about_ca_system_score_gemma":0.00004777025,"threshold_uncertainty_score":0.28001922},"labels":[],"label_agreement":null},{"id":"W1999518031","doi":"10.1016/j.tcs.2005.10.045","title":"Hierarchies for classes of priority algorithms for Job Scheduling","year":2005,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","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":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.015456930125900416,"score_gpt":0.27097839790631356,"score_spread":0.2555214677804131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999518031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039962925,0.00007598312,0.95857984,0.0002292962,0.00042951206,0.00024080437,0.000011417136,0.00018425609,0.00028594627],"genre_scores_gemma":[0.42117822,0.00000597364,0.57852703,0.000037326306,0.0002251672,0.000012559283,0.0000010775123,0.000009205371,0.000003425512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898076,0.000010593114,0.00024050423,0.00023075477,0.00020976401,0.00032760802],"domain_scores_gemma":[0.9991124,0.00034488123,0.000026672573,0.00020018849,0.00020436491,0.00011149095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000654801,0.00011570475,0.00017717267,0.0001208086,0.00015895207,0.000074392476,0.00040193333,0.000046597317,0.00000981844],"category_scores_gemma":[0.00013456173,0.00010393359,0.0000695044,0.00032063687,0.00085906306,0.0001857139,0.000058634563,0.00008298193,0.0000030277229],"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.000014110787,0.000026815793,0.00002159263,0.00006164472,0.000009579396,1.1635413e-7,0.00030820916,0.3341873,0.0006778637,0.5556516,0.000019352346,0.109021805],"study_design_scores_gemma":[0.00030875616,0.00008698029,0.00007579934,0.000023153427,0.000007745242,0.0000022792165,0.000011589711,0.9708182,0.015353368,0.013024711,0.00015533865,0.00013208519],"about_ca_topic_score_codex":2.6608095e-7,"about_ca_topic_score_gemma":2.477592e-7,"teacher_disagreement_score":0.6366309,"about_ca_system_score_codex":0.0000321364,"about_ca_system_score_gemma":0.00004605997,"threshold_uncertainty_score":0.42382887},"labels":[],"label_agreement":null},{"id":"W2001381886","doi":"10.1080/00207543.2011.616549","title":"Production planning for a ramp-up process with learning in production and growth in demand","year":2011,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Production (economics); Constructive; Work (physics); Operations research; Workforce; Process (computing); German; Engineering; Economics; Operations management; Computer science; Microeconomics; Economic growth; Geography","score_opus":0.07339894468392075,"score_gpt":0.3574956451667075,"score_spread":0.2840967004827868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001381886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9885522,0.00029880463,0.007974257,0.001019606,0.0016366475,0.00035093562,4.383184e-7,0.00003873951,0.00012838014],"genre_scores_gemma":[0.98879004,0.00020759062,0.010019128,0.0000031836196,0.00071141025,0.000044124652,0.0000027159624,0.000023832834,0.00019799595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99860007,0.00008600638,0.00036493255,0.0002264205,0.00052488816,0.00019767675],"domain_scores_gemma":[0.99827176,0.00003929887,0.00010264884,0.000059275862,0.0014790314,0.00004798338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022061593,0.00009607558,0.00013633796,0.0011016806,0.00006196104,0.000051482493,0.00014094646,0.00005477319,0.0000073424194],"category_scores_gemma":[0.0017716835,0.000086035085,0.000018906856,0.00050586014,0.00006870196,0.0006046318,0.000014610704,0.00057966815,0.0000010007084],"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.0019133978,0.0002609836,0.14107409,0.00028629566,0.00014662945,0.0000406904,0.018098988,0.82188815,0.0040852544,0.00017323914,0.00030068692,0.011731575],"study_design_scores_gemma":[0.009044331,0.002696046,0.2437209,0.0069621205,0.00008407662,0.0045145834,0.03489919,0.2220778,0.46380815,0.009700448,0.00081496424,0.0016773863],"about_ca_topic_score_codex":0.000013341307,"about_ca_topic_score_gemma":0.00001646672,"teacher_disagreement_score":0.59981036,"about_ca_system_score_codex":0.00014494047,"about_ca_system_score_gemma":0.00007851081,"threshold_uncertainty_score":0.35084087},"labels":[],"label_agreement":null},{"id":"W2001444496","doi":"10.1142/s0129054105003030","title":"APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; McMaster University","keywords":"Job shop scheduling; Job shop; Mathematical optimization; Generalization; Approximation algorithm; Scheduling (production processes); Computer science; Scheme (mathematics); Flow shop scheduling; Algorithm; Process (computing); Mathematics","score_opus":0.027334795925260096,"score_gpt":0.2993553875880289,"score_spread":0.27202059166276876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001444496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011390247,0.00006225438,0.98544466,0.00063211273,0.0019447866,0.00009437454,0.000005879942,0.000046928337,0.00037875533],"genre_scores_gemma":[0.27113318,0.000024278455,0.72819126,0.00003769785,0.0005640781,0.000004087317,0.0000046021446,0.0000073277142,0.00003349431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873203,0.0000068158247,0.0004958325,0.00009684452,0.00054815155,0.00012031704],"domain_scores_gemma":[0.99796546,0.00007224743,0.00020165427,0.00010423729,0.0015937262,0.00006265226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005760589,0.00007875459,0.00011795212,0.00048981345,0.00007088691,0.00016607583,0.0006768922,0.000026604082,0.000020453801],"category_scores_gemma":[0.00006754766,0.00007530671,0.000076494354,0.00032626174,0.000115220006,0.0010689273,0.000033766803,0.000078623765,0.0000054901834],"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.000004233199,0.00003756093,0.00005279447,0.000007390469,0.000032874446,2.1439682e-7,0.000273034,0.8612276,0.00079563435,0.0023175862,0.00017895327,0.13507217],"study_design_scores_gemma":[0.0004372624,0.00005266986,0.0002884436,0.000050204817,0.0000075401163,0.000041924188,0.000016917349,0.99001336,0.0064098686,0.00083922845,0.0017642892,0.00007827438],"about_ca_topic_score_codex":9.4622214e-7,"about_ca_topic_score_gemma":8.181965e-7,"teacher_disagreement_score":0.25974292,"about_ca_system_score_codex":0.0001223933,"about_ca_system_score_gemma":0.00013552666,"threshold_uncertainty_score":0.30709183},"labels":[],"label_agreement":null},{"id":"W2001458457","doi":"10.1109/coase.2012.6386428","title":"Design of an order acceptance and scheduling module in a unified framework with product and process features","year":2012,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Order fulfillment; Computer science; Enterprise resource planning; Scheduling (production processes); Manufacturing execution system; Build to order; Production planning; Material requirements planning; Manufacturing engineering; Process development execution system; Computer-integrated manufacturing; Systems engineering; Process management; Industrial engineering; Production (economics); Engineering; Knowledge management; Operations management; Supply chain; Business","score_opus":0.013041787773057261,"score_gpt":0.2458603324186218,"score_spread":0.23281854464556453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001458457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5957644,0.001277544,0.4025777,0.000021741014,0.0000323167,0.00013999507,3.4622636e-7,0.0000818398,0.00010409041],"genre_scores_gemma":[0.55224663,0.000028977476,0.44766468,0.000009885233,0.000021561218,0.0000069398525,7.070686e-7,0.000011165252,0.000009426602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995496,0.0000149395455,0.00009333323,0.00011839311,0.00007354327,0.00015017261],"domain_scores_gemma":[0.9997421,0.000029542101,0.000017445862,0.000104243525,0.00004727102,0.000059421498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014060499,0.00009466928,0.000115830335,0.00006244465,0.000021001437,0.000022606078,0.000043709744,0.00005537699,0.000010080341],"category_scores_gemma":[0.000050829305,0.0000752538,0.0000028380346,0.00028234135,0.000028716737,0.0002716553,0.000006965359,0.00012533025,2.4569516e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029465573,0.000032837877,0.009669899,0.000090732145,0.000015353871,4.8222995e-7,0.001790591,0.9848085,0.0001558838,0.00025618912,0.0000011879341,0.0031488624],"study_design_scores_gemma":[0.00055980554,0.00005673075,0.019449947,0.000121937424,0.000013961383,0.000016986654,0.0010556022,0.9634666,0.014715566,0.00026543575,0.000001763392,0.0002756513],"about_ca_topic_score_codex":0.000004310124,"about_ca_topic_score_gemma":0.000004167588,"teacher_disagreement_score":0.045086987,"about_ca_system_score_codex":0.000005512152,"about_ca_system_score_gemma":0.000010785054,"threshold_uncertainty_score":0.30687612},"labels":[],"label_agreement":null},{"id":"W2001883003","doi":"10.1115/imece2003-42802","title":"A Sensor-Driven Approach to Distributed Shop Floor Planning and Control","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Flexibility (engineering); Architecture; Scheduling (production processes); Dynamism; Process (computing); Adaptability; Real-time computing; Distributed computing; Control (management); Software engineering; Systems engineering; Engineering; Artificial intelligence; Operating system","score_opus":0.01253273059151257,"score_gpt":0.21374498037750167,"score_spread":0.2012122497859891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001883003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023648081,0.00009162973,0.96638703,0.000029467266,0.00008042006,0.00011123479,0.0000135371665,0.00031451142,0.00932409],"genre_scores_gemma":[0.7474682,0.000001999869,0.25223273,0.00009400159,0.00002603685,0.00001240198,0.000014730029,0.000015607087,0.00013429401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995634,0.000013411993,0.00009569862,0.00011416255,0.00006183258,0.00015152458],"domain_scores_gemma":[0.9997586,0.000021080981,0.0000059488975,0.000083675346,0.000021896734,0.000108826476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005786188,0.0000885401,0.000106665495,0.00004156196,0.00003697716,0.000038475708,0.000032685402,0.000046083285,0.000025102672],"category_scores_gemma":[0.000048935544,0.00008180702,0.000014930765,0.00012686197,0.000007701228,0.000032663007,0.000004327072,0.000066316454,0.00001952342],"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.0000023747575,0.000007909259,0.0007972209,0.000008347008,0.000020148442,0.0000014563486,0.000144283,0.9981993,0.000127573,0.00029354726,0.00022813005,0.00016969841],"study_design_scores_gemma":[0.000522555,0.000008581959,0.00039938724,0.000005858214,0.000008957349,0.000011037131,0.00035724003,0.9974383,0.00040729137,0.000006112321,0.0007029214,0.0001317419],"about_ca_topic_score_codex":0.0000013218871,"about_ca_topic_score_gemma":1.3640812e-7,"teacher_disagreement_score":0.7238201,"about_ca_system_score_codex":0.000013470291,"about_ca_system_score_gemma":0.0000043652535,"threshold_uncertainty_score":0.33359933},"labels":[],"label_agreement":null},{"id":"W2002081302","doi":"10.1016/j.ejor.2008.12.030","title":"On-line integrated production–distribution scheduling problems with capacitated deliveries","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"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; The Scarborough Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Competitive analysis; Production (economics); Production line; Distribution (mathematics); Operations research; Total cost; Upper and lower bounds; Mathematical optimization; Mathematics; Business; Economics; Microeconomics","score_opus":0.058070864964829084,"score_gpt":0.29843833185108787,"score_spread":0.2403674668862588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002081302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65795887,0.00043464944,0.33491436,0.0027085918,0.00037810433,0.00026597924,0.00002247627,0.00012971414,0.0031872755],"genre_scores_gemma":[0.96194035,0.000101746584,0.03726522,0.00004218504,0.0003231641,0.0000013833934,0.00007475247,0.000024112831,0.0002270709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829084,0.00029205641,0.0003710209,0.00012716617,0.0007059507,0.0002129868],"domain_scores_gemma":[0.9975846,0.000067732304,0.000051972565,0.000109705885,0.0020651931,0.00012081486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019898536,0.00011789737,0.00012573149,0.00023135763,0.00022757129,0.00017093614,0.00017020646,0.000022243023,0.00007147124],"category_scores_gemma":[0.00069806667,0.00008759111,0.000031731473,0.0006213463,0.00008019549,0.00029855635,0.000007287915,0.00069335976,0.000055675162],"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.00010519437,0.000059858507,0.00001165721,0.0000066048897,0.000032959073,0.000042217165,0.00024197555,0.99207693,0.0018481248,0.00075594115,0.0012654868,0.0035530573],"study_design_scores_gemma":[0.0025893578,0.0049367216,0.00222518,0.0010517522,0.000027052327,0.0006756858,0.0010784749,0.9629309,0.018925618,0.00042489244,0.004570652,0.00056368194],"about_ca_topic_score_codex":7.9181586e-7,"about_ca_topic_score_gemma":7.6290473e-7,"teacher_disagreement_score":0.3039815,"about_ca_system_score_codex":0.00012741111,"about_ca_system_score_gemma":0.00013092037,"threshold_uncertainty_score":0.35718617},"labels":[],"label_agreement":null},{"id":"W2002100181","doi":"10.1016/j.cor.2011.12.017","title":"A hybrid genetic algorithm for the single machine scheduling problem with sequence-dependent setup times","year":2011,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"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é du Québec à Chicoutimi","funders":"","keywords":"Tardiness; Crossover; Computer science; Mathematical optimization; Algorithm; Scheduling (production processes); Genetic algorithm; Ant colony optimization algorithms; Job shop scheduling; Sequence (biology); Mathematics; Artificial intelligence; Schedule","score_opus":0.07325806510702272,"score_gpt":0.29739031804436084,"score_spread":0.22413225293733813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002100181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003036894,0.00065572216,0.9943653,0.00019987067,0.00019732921,0.0008675657,0.0000349996,0.00023966086,0.00040268607],"genre_scores_gemma":[0.09830044,0.00007597317,0.90068525,0.000041035237,0.00015892052,0.0003043504,0.000045092063,0.000055462555,0.0003334915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998617,0.000076275304,0.00023238239,0.00028263486,0.0003649431,0.00042677321],"domain_scores_gemma":[0.9989353,0.00016842282,0.00001145182,0.0003674031,0.00040383512,0.00011361411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047648812,0.00016298798,0.00013699215,0.0001871334,0.0006106515,0.00030004763,0.0004190728,0.000045266235,0.00008773957],"category_scores_gemma":[0.0000235244,0.000117801785,0.000042239575,0.00033723397,0.0001293076,0.00015964982,0.00007667184,0.00032788946,0.000047340283],"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.000006124125,0.00005207462,0.000010097192,0.000016924678,0.0000736221,0.000009021013,0.00068064977,0.9078786,0.00014034986,0.00015699127,0.00020492783,0.09077061],"study_design_scores_gemma":[0.00041195212,0.00017115138,0.000021285814,0.00003940044,0.000014382192,0.000048289217,0.00014719761,0.9955146,0.003104009,0.00007586474,0.0002859361,0.00016594109],"about_ca_topic_score_codex":0.000092177215,"about_ca_topic_score_gemma":0.00003253483,"teacher_disagreement_score":0.09526355,"about_ca_system_score_codex":0.00010019536,"about_ca_system_score_gemma":0.00010198629,"threshold_uncertainty_score":0.48038173},"labels":[],"label_agreement":null},{"id":"W2002248615","doi":"10.1016/j.dam.2007.06.012","title":"Pareto optima for total weighted completion time and maximum lateness on a single machine","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Acadia University; McMaster University","funders":"","keywords":"Mathematics; Pareto principle; Mathematical optimization; Pareto optimal; Single-machine scheduling; Multi-objective optimization; Combinatorics; Computer science; Job shop scheduling; Routing (electronic design automation)","score_opus":0.012162247573192104,"score_gpt":0.22257126118429485,"score_spread":0.21040901361110276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002248615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10787777,0.00005015942,0.88411504,0.00003536603,0.000090841066,0.00045956895,0.00005894313,0.00040359187,0.006908737],"genre_scores_gemma":[0.28916496,0.000007253972,0.71020865,0.000053518146,0.00008759214,0.000040197938,0.0002441617,0.00008666026,0.00010700578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.0000023853827,0.0002535607,0.0001520088,0.00013532926,0.00023119577],"domain_scores_gemma":[0.9995317,0.00013194462,0.000045837456,0.00016266537,0.000029435127,0.00009840138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019134997,0.00017800958,0.00022169652,0.000073739895,0.00007348595,0.000047844173,0.00006535695,0.00008597423,0.00003715846],"category_scores_gemma":[0.000016097843,0.00016326764,0.00003684873,0.000105909174,0.000027923583,0.000032447508,0.000017949042,0.00007919291,0.000034061406],"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.0007790048,0.0014444384,0.00005412524,0.0037256524,0.0009104403,0.0000361589,0.009527178,0.61122936,0.15171346,0.1424949,0.0016204789,0.07646477],"study_design_scores_gemma":[0.0006977623,0.00005363127,0.000032412445,0.000040917857,0.000033068816,0.000009034852,0.00010785938,0.986743,0.009121265,0.002774015,0.00012717827,0.00025988207],"about_ca_topic_score_codex":6.1467796e-7,"about_ca_topic_score_gemma":8.522814e-7,"teacher_disagreement_score":0.37551358,"about_ca_system_score_codex":0.000033425014,"about_ca_system_score_gemma":0.0000035715232,"threshold_uncertainty_score":0.66578615},"labels":[],"label_agreement":null},{"id":"W2002455648","doi":"10.1016/s0305-0483(01)00048-2","title":"Heuristic algorithms for the two-machine flowshop with limited machine availability","year":2001,"lang":"en","type":"article","venue":"Omega","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":75,"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; Computer science; Heuristic; Mathematical optimization; Constructive; Algorithm; Scheduling (production processes); Mathematics; Artificial intelligence; Schedule; Process (computing)","score_opus":0.016345793339036394,"score_gpt":0.24026957710850985,"score_spread":0.22392378376947347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002455648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01611933,0.0018193177,0.9764962,0.000675951,0.00068177824,0.0005776016,0.00008559234,0.00079754036,0.002746683],"genre_scores_gemma":[0.83877254,0.0002764334,0.1577042,0.0003040398,0.00046423744,0.0001843585,0.0001515263,0.00012411101,0.0020185532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907064,0.000020626067,0.00021379486,0.0002302947,0.00017134123,0.00029327965],"domain_scores_gemma":[0.9990483,0.0003071459,0.000029480127,0.00042934233,0.00009167846,0.0000940584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026409092,0.00020200225,0.00018488156,0.000061699,0.00016697444,0.000065763554,0.00020458219,0.000054045693,0.00015589935],"category_scores_gemma":[0.00011117673,0.00013263605,0.00006326018,0.00038459565,0.000053426487,0.0000756862,0.000019384992,0.00019580357,0.00004455157],"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.0001041485,0.000087774846,0.0021713434,0.000050537237,0.0001444793,0.000012355697,0.00020352617,0.95043737,0.00006142741,0.0001272374,0.00076383934,0.04583596],"study_design_scores_gemma":[0.0010920019,0.00005904867,0.0006451265,0.000012195334,0.000048344304,0.000028065846,0.000027240909,0.9838952,0.0001150455,0.000053145533,0.013823552,0.00020104715],"about_ca_topic_score_codex":0.0000426055,"about_ca_topic_score_gemma":0.00007129846,"teacher_disagreement_score":0.8226532,"about_ca_system_score_codex":0.000047421006,"about_ca_system_score_gemma":0.000015577683,"threshold_uncertainty_score":0.5408741},"labels":[],"label_agreement":null},{"id":"W2002505380","doi":"10.1109/nabic.2012.6402253","title":"Incorporating a Genetic Algorithm to improve the performance of Variable Neighborhood Search","year":2012,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Variable neighborhood search; Metaheuristic; Memetic algorithm; Mathematical optimization; Local search (optimization); Computer science; Job shop scheduling; Guided Local Search; Population; Evolutionary algorithm; Genetic algorithm; Variable (mathematics); Algorithm; Mathematics; Schedule","score_opus":0.00842338866006115,"score_gpt":0.21226771958696258,"score_spread":0.20384433092690143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002505380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1358192,0.0001700027,0.85786587,0.000037115595,0.0004378532,0.00019228016,0.0000047824683,0.0001491998,0.0053236866],"genre_scores_gemma":[0.53711516,0.000006226032,0.4625274,0.000047419868,0.00013319255,0.000012751233,0.0000013232985,0.000014502167,0.00014202653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993596,0.000014093525,0.00017239801,0.00007231902,0.00014433108,0.00023725939],"domain_scores_gemma":[0.9995965,0.000039719904,0.000016679995,0.0001952804,0.00006279789,0.00008904587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026166337,0.0000847879,0.000091143585,0.000046461835,0.00005480956,0.000018536126,0.0001349033,0.000039096736,0.00009401862],"category_scores_gemma":[0.000015491763,0.000060840084,0.000018307392,0.00034004851,0.000014664401,0.00010115999,0.00004034646,0.00010495376,0.00005085486],"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.0000020697946,0.000026755286,0.0041528763,0.00004411195,0.000029839162,1.2995292e-7,0.0006039034,0.9098654,0.0024587992,0.0005546384,0.000075106545,0.08218638],"study_design_scores_gemma":[0.00010129621,0.000034656325,0.001368149,0.000008730562,0.000006331283,0.0000027905292,0.000132954,0.98355174,0.014650358,0.00000902807,0.00004601463,0.00008797191],"about_ca_topic_score_codex":0.000018851617,"about_ca_topic_score_gemma":2.3085953e-7,"teacher_disagreement_score":0.40129596,"about_ca_system_score_codex":0.000020255544,"about_ca_system_score_gemma":0.000018906278,"threshold_uncertainty_score":0.24809866},"labels":[],"label_agreement":null},{"id":"W2002707982","doi":"10.1016/j.ipl.2004.09.003","title":"Optimal preemptive semi-online scheduling on two uniform processors","year":2004,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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 New Brunswick","funders":"","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Preemption; Parallel computing; Upper and lower bounds; Fair-share scheduling; Mathematical optimization; Algorithm; Mathematics; Schedule","score_opus":0.009031892342331585,"score_gpt":0.23094668956496697,"score_spread":0.22191479722263538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002707982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4542188,0.000040646544,0.5420766,0.00091516995,0.00025208565,0.00017662792,0.0000147541205,0.0009879478,0.0013173838],"genre_scores_gemma":[0.7745441,0.000010714129,0.2224699,0.0025643737,0.0001563839,0.000029396817,0.00017780774,0.000035873974,0.000011433423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987089,0.0000063757134,0.00044310853,0.00013337703,0.00034260328,0.00036562825],"domain_scores_gemma":[0.99946916,0.000017301105,0.00012655678,0.00014638071,0.00013935326,0.00010124786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015128058,0.00024319808,0.00016040744,0.00029404092,0.00020525786,0.00025082775,0.00019248687,0.000084755295,0.000014097247],"category_scores_gemma":[0.00005737409,0.0002411899,0.000047500645,0.0004859544,0.00004926681,0.002084718,0.000020412213,0.00033096064,0.00013164835],"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.000013410386,0.000018325667,0.000031031035,0.00011970889,0.000014616904,0.0000014514476,0.0024730547,0.98623466,0.00013787963,0.000060375995,0.000030173353,0.010865295],"study_design_scores_gemma":[0.0015764697,0.000039333925,0.00011564039,0.00036105732,0.00001714175,0.000020064323,0.0009934425,0.988843,0.007060302,0.000043285643,0.0004913285,0.00043890785],"about_ca_topic_score_codex":0.0000045754186,"about_ca_topic_score_gemma":0.0000010291428,"teacher_disagreement_score":0.32032531,"about_ca_system_score_codex":0.00021069146,"about_ca_system_score_gemma":0.00007060577,"threshold_uncertainty_score":0.9835439},"labels":[],"label_agreement":null},{"id":"W2003903403","doi":"10.1287/opre.1090.0788","title":"Coordinated Multistage Scheduling of Parallel Batch-Processing Machines Under Multiresource Constraints","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Production schedule; Integer programming; Job shop scheduling; Schedule; Distributed computing; Mathematical optimization; Dynamic priority scheduling; Batch production; Fair-share scheduling; Algorithm; Operations management; Engineering; Mathematics","score_opus":0.03853692663469973,"score_gpt":0.34059762792393494,"score_spread":0.30206070128923523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003903403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380085,0.00020323896,0.35719457,0.00027501542,0.00023479162,0.00030675638,0.00003195855,0.00026949894,0.0034756763],"genre_scores_gemma":[0.7543638,0.000014896229,0.24495086,0.0000097216625,0.00006251761,0.000025447096,0.000036732454,0.00003071386,0.00050530245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987937,0.00007030849,0.00029122736,0.00020112419,0.00032374897,0.00031987406],"domain_scores_gemma":[0.9989566,0.00012670264,0.000012579172,0.00025982066,0.0005216987,0.00012259837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006267362,0.00012639891,0.00015525283,0.0002728012,0.00036876215,0.00016872372,0.00023154198,0.0001364562,0.00048903894],"category_scores_gemma":[0.00033132685,0.00012370542,0.000036077123,0.00059236336,0.00032888798,0.00016864017,0.000045997986,0.00071896135,0.000052298874],"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.0000042871125,0.00004228153,0.00025228332,0.000035499834,0.00001682079,0.0000025465079,0.00043139132,0.9384854,0.04583004,0.0008803395,0.00002867287,0.013990459],"study_design_scores_gemma":[0.00047383358,0.000011159169,0.00043450537,0.000031443542,0.000003736434,0.000006179658,0.00060827425,0.993562,0.004623072,0.000020859814,0.00009314384,0.00013182436],"about_ca_topic_score_codex":0.00012322563,"about_ca_topic_score_gemma":0.00020630269,"teacher_disagreement_score":0.11635532,"about_ca_system_score_codex":0.000027592196,"about_ca_system_score_gemma":0.00009489971,"threshold_uncertainty_score":0.53546333},"labels":[],"label_agreement":null},{"id":"W2003904481","doi":"10.1145/2598394.2598402","title":"An ant colony optimization for solving a hybrid flexible flowshop","year":2014,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Job shop scheduling; Computer science; Mathematical optimization; Constructive; Ant colony; Heuristic; Scheduling (production processes); Metaheuristic; Evolutionary algorithm; Artificial intelligence; Mathematics; Process (computing)","score_opus":0.009727722110353892,"score_gpt":0.23199724008802047,"score_spread":0.2222695179776666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003904481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062836464,0.00002642168,0.98944885,0.000043715172,0.0004035566,0.00015202179,0.000004634521,0.00096225453,0.0026749047],"genre_scores_gemma":[0.25315002,0.000012454443,0.74609846,0.00012774742,0.0002004882,0.000034347497,0.00006972427,0.00003960327,0.00026717427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994445,0.000008043306,0.00014624455,0.00014478307,0.00007381739,0.00018263988],"domain_scores_gemma":[0.9996089,0.00005042249,0.000015191137,0.00017579655,0.00006997493,0.000079730045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017682897,0.000098836914,0.00010683222,0.00006815072,0.00008147445,0.000073374984,0.00009150575,0.00004190046,0.00017033941],"category_scores_gemma":[0.00005942314,0.00009895386,0.000032474305,0.000094392686,0.00000885791,0.0001636208,0.0000063245566,0.00004479665,0.000014597427],"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.000003740218,0.000012419058,0.000014459498,0.000015969013,0.0000072043026,1.293814e-7,0.00004188954,0.9945149,0.00029642863,0.00037904328,0.0006004331,0.0041133827],"study_design_scores_gemma":[0.00033958722,0.00005201358,0.000008514027,0.000007855884,0.000008436833,0.000002288516,0.000028193783,0.99117094,0.0072523216,0.0000652417,0.0009167498,0.00014785677],"about_ca_topic_score_codex":0.0000037834607,"about_ca_topic_score_gemma":0.0000022464774,"teacher_disagreement_score":0.24686638,"about_ca_system_score_codex":0.000025517314,"about_ca_system_score_gemma":0.000009378039,"threshold_uncertainty_score":0.40352213},"labels":[],"label_agreement":null},{"id":"W2004594161","doi":"10.1007/s11590-015-0859-6","title":"A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","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":"Job shop scheduling; Computer science; Scheduling (production processes); Computational intelligence; Mathematical optimization; Job scheduler; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.016414328054018552,"score_gpt":0.242009478236808,"score_spread":0.22559515018278944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004594161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001993272,0.00007726205,0.9918012,0.004431892,0.00039660357,0.0003539858,0.000013016868,0.00048811786,0.0004446517],"genre_scores_gemma":[0.014660909,0.0000091605825,0.9817701,0.0027770011,0.0004067073,0.000120686644,0.00008318355,0.00010970481,0.000062575724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988549,0.000034536497,0.00024206903,0.00027450654,0.00028731817,0.00030666488],"domain_scores_gemma":[0.9992492,0.00012216633,0.00007030662,0.00026283172,0.00017273457,0.00012273299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026161,0.00025817967,0.00018468397,0.00013164277,0.0002113508,0.00021721136,0.00019977002,0.0000642967,0.000026341],"category_scores_gemma":[0.000104842606,0.00018774919,0.000054229677,0.0004315618,0.000050562896,0.0002384408,0.00001612072,0.0001865256,0.000015386975],"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.000023916136,0.000013188376,0.000012626444,0.000015446902,0.000024079101,0.0000021633655,0.0004610216,0.9873459,0.00005549742,0.000039427116,0.00052378065,0.011482962],"study_design_scores_gemma":[0.0011584578,0.000037577436,0.000002242058,0.00007197975,0.000032203916,0.000008281912,0.00013649835,0.99757534,0.0003183696,0.00001561551,0.00036403516,0.0002794045],"about_ca_topic_score_codex":0.0000064481897,"about_ca_topic_score_gemma":0.000002396987,"teacher_disagreement_score":0.012667637,"about_ca_system_score_codex":0.000092452756,"about_ca_system_score_gemma":0.00004402521,"threshold_uncertainty_score":0.7656189},"labels":[],"label_agreement":null},{"id":"W2005299742","doi":"10.1007/s10479-012-1059-8","title":"Makespan minimization for parallel machines scheduling with multiple availability constraints","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Lexicographical order; Theory of computation; Mathematical optimization; Enumeration; Computer science; Minification; Integer programming; Scheduling (production processes); Branch and bound; Linear programming; Algorithm; Mathematics; Schedule; Discrete mathematics","score_opus":0.14004727428827127,"score_gpt":0.38869455033310835,"score_spread":0.24864727604483708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005299742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43518582,0.00060886703,0.56100804,0.00076765975,0.00014282155,0.00090105465,0.00009744685,0.00014487685,0.0011434032],"genre_scores_gemma":[0.72020286,0.00006131093,0.27927172,0.000020671012,0.0000905943,0.000115848634,0.00008193262,0.000021396334,0.00013369787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888504,0.00007930259,0.0002560155,0.00013785702,0.0002686563,0.0003731196],"domain_scores_gemma":[0.9985111,0.00025798514,0.000013058333,0.00022444088,0.00086687616,0.00012657484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096806674,0.00010253411,0.000142963,0.00018284471,0.00021974884,0.000062080086,0.000121317404,0.00007226061,0.00014628046],"category_scores_gemma":[0.0006626957,0.00008986408,0.000038593156,0.0003651747,0.00017388827,0.00030453436,0.000017514678,0.00015361635,0.000019448684],"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.000033753713,0.00010388836,0.006517771,0.000068893765,0.000042006075,1.4285335e-7,0.0005700619,0.98710805,0.0005594423,0.0009329978,0.0003032265,0.0037597634],"study_design_scores_gemma":[0.00043232873,0.00006174268,0.0018266382,0.000028268532,0.0000047457393,0.0000022862582,0.00036117376,0.9910266,0.005790422,0.000021439455,0.0003241559,0.00012020181],"about_ca_topic_score_codex":0.000022514825,"about_ca_topic_score_gemma":0.000043987497,"teacher_disagreement_score":0.28501704,"about_ca_system_score_codex":0.00001509945,"about_ca_system_score_gemma":0.00006082889,"threshold_uncertainty_score":0.36645508},"labels":[],"label_agreement":null},{"id":"W2005705791","doi":"10.1016/j.tcs.2011.08.030","title":"Minimizing total completion time for re-entrant flow shop scheduling problems","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow shop scheduling; Scheduling (production processes); Computer science; Completion (oil and gas wells); Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Engineering; Mechanical engineering","score_opus":0.020333485618543153,"score_gpt":0.21991779575088086,"score_spread":0.1995843101323377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005705791","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031849943,0.000027049668,0.9651317,0.000051730538,0.00058675103,0.00022451159,0.000004337168,0.00040840564,0.0017155897],"genre_scores_gemma":[0.45990214,0.0000016756271,0.5399347,0.000033769848,0.00009752034,0.000009149557,0.0000035967266,0.000013414799,0.0000040204145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987072,0.000020202819,0.00024257174,0.000333444,0.00026272793,0.00043389533],"domain_scores_gemma":[0.99934113,0.000093964874,0.000023542894,0.00024773483,0.00012375173,0.0001698813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007441142,0.00014955123,0.00017127447,0.000106304775,0.00022327332,0.00011562356,0.0003605871,0.000054017848,0.0001692289],"category_scores_gemma":[0.000051521576,0.00013632345,0.000059242244,0.00035224174,0.0005852935,0.00020371196,0.00007163557,0.00012095569,0.000066001885],"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.0000266523,0.00007052882,0.000021481274,0.000061150546,0.000017976141,0.000003088907,0.0026063954,0.8460669,0.0023899954,0.13102071,0.000034101453,0.017681021],"study_design_scores_gemma":[0.00025707384,0.00008228308,0.00007020563,0.000050895967,0.000008984632,0.000011671599,0.000015438074,0.9919069,0.003725517,0.003665416,0.000008280946,0.00019732553],"about_ca_topic_score_codex":5.0619565e-7,"about_ca_topic_score_gemma":7.929397e-8,"teacher_disagreement_score":0.4280522,"about_ca_system_score_codex":0.000040243514,"about_ca_system_score_gemma":0.000022862172,"threshold_uncertainty_score":0.5559109},"labels":[],"label_agreement":null},{"id":"W2007684460","doi":"10.1007/s10951-013-0341-1","title":"Scheduling semi-malleable jobs to minimize mean flow time","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Job shop scheduling; Dynamic programming; Flow shop scheduling; Set (abstract data type); Parallel computing; Algorithm; Mathematics; Operating system; Programming language","score_opus":0.009737137138782662,"score_gpt":0.21066128666033168,"score_spread":0.20092414952154902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007684460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4885845,0.0012118574,0.50514203,0.00090105407,0.0015552235,0.00024418664,0.0000036868848,0.00029304004,0.0020644525],"genre_scores_gemma":[0.17237851,0.00008594402,0.8259151,0.0002782833,0.0008650733,0.000007859224,0.0000027207557,0.000086415224,0.0003801069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978757,0.000041464024,0.0008953326,0.00019882212,0.00048890646,0.00049979246],"domain_scores_gemma":[0.9983716,0.00014716602,0.00019374113,0.00025686974,0.00052607985,0.0005045631],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000629934,0.00029392514,0.0005045662,0.00040731856,0.0001243197,0.00025548815,0.00041696,0.00017424536,0.0010017985],"category_scores_gemma":[0.00031547566,0.00027611165,0.00021127066,0.0005058436,0.000024939227,0.0006335677,0.000053867618,0.0005773636,0.0011483916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012739821,0.000027269034,0.0001699114,0.000029530544,0.000104651146,0.000014364565,0.00051685143,0.9843026,0.009687371,0.000010816901,0.0006176484,0.004506281],"study_design_scores_gemma":[0.00075108645,0.000064054366,0.00018650996,0.0002907538,0.000046996756,0.00010348208,0.0005847691,0.9909573,0.0060823257,0.000102899874,0.0004667555,0.00036307352],"about_ca_topic_score_codex":0.0000064199776,"about_ca_topic_score_gemma":6.356394e-7,"teacher_disagreement_score":0.32077307,"about_ca_system_score_codex":0.00013330104,"about_ca_system_score_gemma":0.00007292885,"threshold_uncertainty_score":0.9999691},"labels":[],"label_agreement":null},{"id":"W2008645045","doi":"10.1023/b:anor.0000030687.72169.c7","title":"Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"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":"McGill University","keywords":"Job shop scheduling; Theory of computation; Computer science; Idle; Mathematical optimization; Flow shop scheduling; Approximation algorithm; Scheduling (production processes); Schedule; Time complexity; Algorithm; Mathematics","score_opus":0.12638373061212133,"score_gpt":0.4156692742237378,"score_spread":0.28928554361161646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008645045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5818076,0.0006349976,0.4096013,0.005653541,0.00017120269,0.00062781,0.00003358915,0.00013575568,0.0013342081],"genre_scores_gemma":[0.7371928,0.00011455329,0.2622649,0.00009727549,0.000090245914,0.00009021267,0.000044751145,0.000030528314,0.000074696174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984048,0.00007784387,0.00040877124,0.00024063588,0.00046562045,0.000402303],"domain_scores_gemma":[0.9989393,0.000073245574,0.000007717366,0.00031902533,0.00050558994,0.00015513976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975088,0.00013556377,0.00019813601,0.00069707126,0.00017796145,0.00015107442,0.00023442712,0.00006866281,0.00015950062],"category_scores_gemma":[0.0004297421,0.00013933593,0.000046992336,0.001148723,0.000040457177,0.00027688028,0.000052386935,0.00037240717,0.0001536376],"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.000015889977,0.0000704881,0.00031330343,0.000015606634,0.000015162195,0.0000045429406,0.0007950224,0.9920128,0.002569211,0.0010397031,0.000034675137,0.0031135934],"study_design_scores_gemma":[0.0006593779,0.000056056404,0.0007408762,0.00008003171,0.0000018039616,0.0000026466312,0.00023019058,0.9833672,0.014532421,0.000119552824,0.00006145538,0.00014840116],"about_ca_topic_score_codex":0.00048370025,"about_ca_topic_score_gemma":0.004003053,"teacher_disagreement_score":0.15538524,"about_ca_system_score_codex":0.00006343874,"about_ca_system_score_gemma":0.00014020893,"threshold_uncertainty_score":0.56819546},"labels":[],"label_agreement":null},{"id":"W2008691051","doi":"10.5267/j.ijiec.2014.12.002","title":"A heuristic algorithm for scheduling in a flow shop environment to minimize makespa","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Heuristic; Job shop scheduling; Algorithm; Operations research; Engineering; Mathematics; Embedded system","score_opus":0.03752176381798682,"score_gpt":0.2616996035474349,"score_spread":0.22417783972944805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008691051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00938143,0.00009486441,0.9862467,0.000443182,0.0035503162,0.00016453341,0.000036453694,0.000056749675,0.000025782078],"genre_scores_gemma":[0.08831647,0.000009713785,0.9102932,0.000038018243,0.0012441209,0.000022310142,0.000023217952,0.000038067952,0.000014862265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874866,0.000014654045,0.0005882733,0.000107975,0.0003643664,0.00017606365],"domain_scores_gemma":[0.99916965,0.00020708427,0.000081120736,0.000067664645,0.0002661029,0.00020839692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003598907,0.00014590379,0.00021586446,0.00057609513,0.000015853067,0.00008021809,0.00026234917,0.00009170984,0.000010384775],"category_scores_gemma":[0.0004977925,0.00016245169,0.0000857101,0.0002094809,0.000008529188,0.00013414855,0.000025839949,0.00026229807,0.000010074234],"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.000021299762,0.00003503064,0.000042283733,0.000002202051,0.00008038955,0.000020730671,0.00026527874,0.9660969,0.000026821495,0.00003823277,0.0002256729,0.033145152],"study_design_scores_gemma":[0.002297939,0.00006130167,0.000035440302,0.000121481695,0.000015992935,0.00005102315,0.00013711366,0.9956121,0.00012419377,0.00006562625,0.0013235039,0.0001542874],"about_ca_topic_score_codex":0.0000027473977,"about_ca_topic_score_gemma":4.019812e-7,"teacher_disagreement_score":0.07893504,"about_ca_system_score_codex":0.0003489224,"about_ca_system_score_gemma":0.00009693964,"threshold_uncertainty_score":0.6624587},"labels":[],"label_agreement":null},{"id":"W2009266658","doi":"10.1080/09537280903034297","title":"Planning and implementing POLCA: a card-based control system for high variety or custom engineered products","year":2009,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Variety (cybernetics); Implementation; Kanban; General partnership; Computer science; Control (management); Factory (object-oriented programming); Manufacturing engineering; Product (mathematics); Engineering; Process management; Software engineering; Business","score_opus":0.01266312311299318,"score_gpt":0.23322215224404222,"score_spread":0.22055902913104905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009266658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057298668,0.0021907925,0.9317048,0.0013534409,0.002466754,0.0022012652,0.00011719546,0.0025495403,0.00011750619],"genre_scores_gemma":[0.96416104,0.0000027606768,0.034112886,0.00013314318,0.0012148137,0.00017349028,0.00007502535,0.0000602091,0.00006661182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811864,0.000048671158,0.0004973679,0.0005264081,0.00022533954,0.00058358145],"domain_scores_gemma":[0.9990531,0.0001450553,0.00013383687,0.00028880758,0.00025807018,0.00012110191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072089344,0.00033650297,0.0004645787,0.00022235127,0.00032160638,0.00014894186,0.00011367243,0.00012274874,0.0000041663075],"category_scores_gemma":[0.00041061474,0.00031590697,0.000059514743,0.00030241066,0.000021847081,0.00021798829,0.0000050238123,0.00023123702,0.0000026135083],"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.00035632795,0.000025699124,0.00055109797,0.00032145076,0.00017429858,0.0000091815555,0.00030717958,0.98782957,0.005507589,0.00029040553,0.00066961895,0.003957588],"study_design_scores_gemma":[0.006839694,0.00022824493,0.0016647268,0.0003028949,0.00024483394,0.00006428545,0.0003919926,0.97287947,0.014561586,0.000019442357,0.002194621,0.0006082293],"about_ca_topic_score_codex":0.000005509458,"about_ca_topic_score_gemma":2.2881926e-7,"teacher_disagreement_score":0.9068624,"about_ca_system_score_codex":0.00011370124,"about_ca_system_score_gemma":0.00006334276,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W2009267429","doi":"10.1080/09537280701582422","title":"Judicious order acceptance and order release in make-to-order manufacturing systems","year":2007,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Public Health Agency of Canada; University of Calgary","funders":"","keywords":"Tardiness; Queue; Build to order; Order (exchange); Discrete event simulation; Control (management); Computer science; Queueing theory; Due date; Job shop; Operations research; Real-time computing; Operations management; Industrial engineering; Simulation; Engineering; Flow shop scheduling; Job shop scheduling; Business; Production (economics); Computer network; Economics; Routing (electronic design automation); Microeconomics; Artificial intelligence","score_opus":0.008325517446444145,"score_gpt":0.23150384036898894,"score_spread":0.2231783229225448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009267429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5718132,0.002898839,0.42020294,0.00048140142,0.0025395018,0.0006861551,0.0000048165653,0.00066346803,0.0007096521],"genre_scores_gemma":[0.97971356,0.000039379516,0.019190738,0.00015464712,0.0005091911,0.000043567263,0.000008250724,0.000051052346,0.00028960066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986531,0.000027779359,0.0003666706,0.0003700761,0.00019035247,0.00039201346],"domain_scores_gemma":[0.9993978,0.00006123387,0.00005395792,0.00022107737,0.00013989402,0.00012604131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005182698,0.00020601298,0.00024663296,0.0003064458,0.00009725708,0.00008182574,0.000084640706,0.000102237376,0.00001473767],"category_scores_gemma":[0.00029778157,0.00021804756,0.000015798021,0.00047504756,0.000021066928,0.00014240085,0.000013722607,0.00028514324,0.00002595604],"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.000061659215,0.000015291587,0.005408857,0.000052980267,0.00003613372,0.000019466488,0.00046237552,0.98569405,0.0003209171,0.000013426777,0.00017983819,0.0077350177],"study_design_scores_gemma":[0.00424544,0.0000879199,0.049424518,0.00047416388,0.0000779156,0.00019535376,0.00163375,0.9298913,0.0046232,0.00003599304,0.008081183,0.0012292656],"about_ca_topic_score_codex":0.000034442714,"about_ca_topic_score_gemma":0.00001543041,"teacher_disagreement_score":0.40790036,"about_ca_system_score_codex":0.00007904147,"about_ca_system_score_gemma":0.000016872296,"threshold_uncertainty_score":0.88917214},"labels":[],"label_agreement":null},{"id":"W2009400799","doi":"10.1504/ejie.2008.017685","title":"Deadlock-free scheduling of flexible job shops with limited capacity buffers","year":2008,"lang":"en","type":"article","venue":"European J of Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Integer programming; Job shop scheduling; Workload; Deadlock; Algorithm; Operations research; Mathematics; Distributed computing; Schedule","score_opus":0.04059708943142512,"score_gpt":0.18940126835308949,"score_spread":0.14880417892166437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009400799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90879333,0.00016228961,0.08592632,0.0000134554975,0.0005589437,0.0001435561,0.00001822008,0.0005574054,0.0038264815],"genre_scores_gemma":[0.9202136,0.000022749135,0.07928997,0.0000046560444,0.00031089367,0.0000029080638,0.000007778848,0.000099772515,0.00004766558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877733,0.00003379425,0.0004572821,0.00017985396,0.0002669182,0.0002848369],"domain_scores_gemma":[0.9992008,0.00007390215,0.000081943166,0.000403311,0.00010771506,0.00013227828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024989026,0.00023884502,0.00032877666,0.00024515146,0.000044092205,0.000011848787,0.00032367173,0.00009765987,0.000034060762],"category_scores_gemma":[0.00025571923,0.00023931423,0.000077324534,0.00058428594,0.00006470502,0.00012747697,0.00004945496,0.0003984934,0.000008025801],"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.000025471118,0.0000165942,0.0008693579,0.00003271326,0.0000998203,0.000019597406,0.00033958987,0.99545664,0.0021068193,0.00010084989,0.000092313676,0.00084023166],"study_design_scores_gemma":[0.0065021147,0.00042795562,0.0042406996,0.00096562953,0.00012579234,0.00014547507,0.00041761628,0.8638098,0.121602915,0.0000036876359,0.0005412808,0.0012170196],"about_ca_topic_score_codex":0.000020019332,"about_ca_topic_score_gemma":6.0304063e-7,"teacher_disagreement_score":0.13164683,"about_ca_system_score_codex":0.000041672563,"about_ca_system_score_gemma":0.000030303012,"threshold_uncertainty_score":0.9758951},"labels":[],"label_agreement":null},{"id":"W2009921115","doi":"10.1007/s10732-006-6017-7","title":"A tabu search algorithm for solving economic lot scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Tabu search; Guided Local Search; Mathematical optimization; Computer science; Hill climbing; Benchmark (surveying); Scheduling (production processes); Job shop scheduling; Algorithm; Heuristic; Mathematics; Schedule","score_opus":0.01096519587868776,"score_gpt":0.23603429980556861,"score_spread":0.22506910392688084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009921115","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016218591,0.000740486,0.98166454,0.000059184487,0.0008080794,0.000101755875,0.000021322168,0.00006297155,0.000323086],"genre_scores_gemma":[0.07025958,0.00010017638,0.92807287,0.000016079059,0.0013800856,0.0000027744059,0.00000706613,0.000050310326,0.000111046014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897677,0.000010127535,0.0005345034,0.000085648666,0.0001449279,0.00024804828],"domain_scores_gemma":[0.9993696,0.00013774242,0.00012340225,0.00009079418,0.000196317,0.00008210522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042491223,0.00012432152,0.00022724149,0.00015740252,0.00007680737,0.00009484766,0.00014785789,0.00008217819,0.000021499562],"category_scores_gemma":[0.00003845167,0.00012357449,0.00010608844,0.00007422542,0.000020566049,0.00011607196,0.000013670635,0.0002633188,0.000012192947],"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.0000049374644,0.000021559872,0.000109626526,0.00004416067,0.000036295674,0.000010339997,0.00005203241,0.9859561,0.00015180487,0.00019980434,0.0009713896,0.012442],"study_design_scores_gemma":[0.0006131867,0.00006218084,0.000052151518,0.0000547373,0.000033248274,0.000078500394,0.00007723155,0.99565357,0.0013275482,0.00053489645,0.0013711189,0.00014162384],"about_ca_topic_score_codex":0.000006344606,"about_ca_topic_score_gemma":0.0000019953397,"teacher_disagreement_score":0.054040983,"about_ca_system_score_codex":0.0001328471,"about_ca_system_score_gemma":0.00008873424,"threshold_uncertainty_score":0.5039221},"labels":[],"label_agreement":null},{"id":"W2010648793","doi":"10.1504/ijcat.2006.010077","title":"Experience and reflection on the development of a holonic job shop scheduling system","year":2006,"lang":"en","type":"article","venue":"International Journal of Computer Applications in Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Architecture; Computer science; Scheduling (production processes); Job shop; Reflection (computer programming); Software engineering; Systems engineering; Knowledge management; Process management; Engineering management; Job shop scheduling; Engineering; Flow shop scheduling; Operations management; Schedule; Operating system","score_opus":0.012200840101722803,"score_gpt":0.265516757441717,"score_spread":0.2533159173399942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010648793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48069137,0.000076152435,0.5186993,0.00018380061,0.00013484605,0.000047824946,3.592226e-7,0.000037194204,0.0001291627],"genre_scores_gemma":[0.8023684,0.000008880778,0.19752008,0.0000065607287,0.00006601459,0.000021952648,7.714626e-7,0.000005252704,0.0000021044004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993289,0.000008429178,0.00039839605,0.00006786191,0.00013527094,0.00006111635],"domain_scores_gemma":[0.9995726,0.000051494226,0.000118398886,0.000086910455,0.00016093995,0.000009705801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013847263,0.000060795788,0.00009365243,0.00041301586,0.000031391897,0.00001685361,0.00027742778,0.000059083843,0.0000014850051],"category_scores_gemma":[0.000007280248,0.00004875347,0.000018343271,0.00025444364,0.000046161473,0.000041286003,0.0000298381,0.0001540731,0.0000012940931],"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.000021550648,0.00014203205,0.01198594,0.000033281365,0.00012463106,0.000006888455,0.0012580305,0.7610223,0.0035286648,0.12997286,0.000037427213,0.09186636],"study_design_scores_gemma":[0.0008798136,0.00007382504,0.009484805,0.00039730952,0.000012220356,0.0003804237,0.0014641925,0.9325019,0.049439263,0.003595965,0.0015236398,0.00024661236],"about_ca_topic_score_codex":9.325658e-7,"about_ca_topic_score_gemma":0.0000021489632,"teacher_disagreement_score":0.32167703,"about_ca_system_score_codex":0.00010297226,"about_ca_system_score_gemma":0.000020217138,"threshold_uncertainty_score":0.19881089},"labels":[],"label_agreement":null},{"id":"W2010794153","doi":"10.1007/s00170-008-1439-z","title":"Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times","year":2008,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"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 Manitoba","funders":"Engineering and Physical Sciences Research Council","keywords":"Job shop scheduling; Simulated annealing; Mathematical optimization; Pareto optimal; Scheduling (production processes); Pareto principle; Computer science; Sequence (biology); Genetic algorithm; Multi-objective optimization; Algorithm; Mathematics; Schedule","score_opus":0.011238954517927707,"score_gpt":0.2464225447654612,"score_spread":0.2351835902475335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010794153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93262833,0.0004779188,0.06505913,0.00082788063,0.0006260315,0.000065245426,0.000009394343,0.00015536732,0.0001506785],"genre_scores_gemma":[0.82992804,0.00034219335,0.16953583,0.00003516831,0.000090127854,0.0000029974817,0.0000025829474,0.000024194409,0.000038842503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893343,0.000012692277,0.00042190324,0.000107743545,0.0003629294,0.0001612729],"domain_scores_gemma":[0.99922276,0.000064141,0.00023843774,0.00020219255,0.00023527318,0.000037214595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015533723,0.00015325983,0.00023501221,0.00041925107,0.000056924928,0.000014919952,0.0007330196,0.0000661441,0.0000576989],"category_scores_gemma":[0.000053769123,0.00010589049,0.000060804836,0.00012487253,0.00014429442,0.00018896886,0.000072353,0.00039633794,0.000004712632],"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.00008918998,0.000025225085,0.00013229546,0.000008187837,0.00021658084,0.00012588927,0.00016027402,0.96458614,0.026155423,0.00022535134,0.000010078829,0.008265365],"study_design_scores_gemma":[0.0016225296,0.00014519694,0.00009164266,0.00016927997,0.000030913136,0.0040570656,0.00024938406,0.04794091,0.94297457,0.0022919727,0.0002341007,0.00019244569],"about_ca_topic_score_codex":0.000005410033,"about_ca_topic_score_gemma":0.000004843633,"teacher_disagreement_score":0.91681916,"about_ca_system_score_codex":0.0000908375,"about_ca_system_score_gemma":0.000041698626,"threshold_uncertainty_score":0.4318089},"labels":[],"label_agreement":null},{"id":"W2011185809","doi":"10.1016/j.cor.2010.03.018","title":"Coordination in a two-stage production system: Complexity, conflict and cooperation","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"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","funders":"","keywords":"Production (economics); Computer science; Stage (stratigraphy); Production system (computer science); Operations research; Process management; Mathematics; Business; Microeconomics; Economics","score_opus":0.06905820366878661,"score_gpt":0.3594188944290823,"score_spread":0.2903606907602957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011185809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85267526,0.00010981669,0.14286396,0.0009851801,0.001195145,0.0008069023,0.00000855373,0.00036039032,0.0009947841],"genre_scores_gemma":[0.95552176,0.000020279127,0.043746468,0.000012784716,0.00021155499,0.0000823669,0.00007622219,0.0000218358,0.00030673438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888474,0.00013058959,0.0002454812,0.00025790505,0.00024807005,0.0002332295],"domain_scores_gemma":[0.9992226,0.00006145555,0.000008017801,0.00023232645,0.0003905779,0.00008505066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092525827,0.00010842093,0.00012797966,0.00045490864,0.000329471,0.00034998616,0.0001277328,0.000062311,0.000024552293],"category_scores_gemma":[0.0001119652,0.000115915784,0.000013794055,0.00066659966,0.00013542741,0.00032679207,0.000050705807,0.00051906565,0.000033811175],"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.000004789789,0.000036384034,0.00030355022,0.000063722364,0.000009438872,0.000003541133,0.00085700746,0.96163625,0.01191357,0.02184679,0.00044719133,0.0028777854],"study_design_scores_gemma":[0.00044332046,0.000019944975,0.00058389705,0.00003390176,0.0000018334056,0.000017615574,0.00027028975,0.9959105,0.0018898548,0.0000069544813,0.00070412055,0.00011775885],"about_ca_topic_score_codex":0.00029575883,"about_ca_topic_score_gemma":0.0019914918,"teacher_disagreement_score":0.10284649,"about_ca_system_score_codex":0.000097458906,"about_ca_system_score_gemma":0.000056738325,"threshold_uncertainty_score":0.47269085},"labels":[],"label_agreement":null},{"id":"W2013425394","doi":"10.1016/s0925-5273(03)00084-7","title":"Countering forgetting through training and deployment","year":2003,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Forgetting; Software deployment; Flexibility (engineering); Task (project management); Computer science; Context (archaeology); Similarity (geometry); Productivity; Artificial intelligence; Cognitive psychology; Psychology; Economics; Software engineering; Management","score_opus":0.022659057606324282,"score_gpt":0.2391113325444366,"score_spread":0.2164522749381123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013425394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87810886,0.00053326256,0.10746047,0.00070876407,0.011475962,0.000050915947,0.000002124931,0.00005353416,0.001606134],"genre_scores_gemma":[0.90108734,0.0007776331,0.09723868,0.00006821437,0.0007648894,0.0000011611457,9.651718e-7,0.00001800248,0.000043127482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949485,0.000008556491,0.00029294653,0.00006904416,0.000062888466,0.00007172133],"domain_scores_gemma":[0.9996884,0.000015192052,0.00011039764,0.000040389492,0.000115973315,0.000029633347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025523364,0.00006321901,0.00009021681,0.00007697068,0.00002635293,0.000056893354,0.00006916458,0.000023438583,0.000018052631],"category_scores_gemma":[0.000100547295,0.00006813002,0.00003026823,0.000024501605,0.00001439282,0.0003890113,0.0000061638466,0.00009284194,0.0000017821767],"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.000009188036,0.000017021493,0.00068990525,0.000008142159,0.0002046459,0.0000028855588,0.0019678683,0.96991223,0.0005880503,0.0027243323,0.00017523512,0.023700481],"study_design_scores_gemma":[0.005086479,0.00026617546,0.0012844105,0.00049767824,0.00015452655,0.009307718,0.014263395,0.52211523,0.12679558,0.01966373,0.2990263,0.001538788],"about_ca_topic_score_codex":5.417968e-7,"about_ca_topic_score_gemma":8.869558e-7,"teacher_disagreement_score":0.44779703,"about_ca_system_score_codex":0.00009548523,"about_ca_system_score_gemma":0.000021213935,"threshold_uncertainty_score":0.27782616},"labels":[],"label_agreement":null},{"id":"W2014291971","doi":"10.1287/inte.1090.0448","title":"Optimization Helps Shermag Gain Competitive Edge","year":2009,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Supply chain optimization; Procurement; Competitive advantage; Supply chain network; Software; Component (thermodynamics); Computer science; Market share; Total cost; Operations research; Supply chain management; Engineering; Business; Marketing","score_opus":0.01019653572668703,"score_gpt":0.22307428505346844,"score_spread":0.2128777493267814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014291971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013266561,0.00005582746,0.83792526,0.00025864333,0.00040326748,0.00011880915,0.000005675091,0.0003086486,0.15959723],"genre_scores_gemma":[0.81597763,0.00086227176,0.17875361,0.0030336606,0.0008484042,0.0000039555157,0.00006737091,0.00006297381,0.00039009214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890894,0.0000053167832,0.00041973614,0.000092950446,0.00030049164,0.0002725744],"domain_scores_gemma":[0.99942297,0.000031319752,0.000100204896,0.00014534079,0.000109129214,0.00019103158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019234708,0.0001972035,0.00021015659,0.00025038293,0.00012962753,0.0001949932,0.00016762032,0.00011046721,0.00016497006],"category_scores_gemma":[0.000023197494,0.0001703009,0.00008290696,0.00035773235,0.000023044291,0.00017655831,0.000007851688,0.00045983854,0.00012163323],"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.000014190088,0.000023913799,0.0000054838674,0.0000036579509,0.00003306729,0.000007771684,0.00014347804,0.9814441,0.000022389606,0.005742795,0.0005208128,0.012038318],"study_design_scores_gemma":[0.0006584092,0.00007233719,0.00006394774,0.00003346763,0.0000186624,0.000037552287,0.00023846098,0.995086,0.0006588679,0.00040806097,0.0024708393,0.00025340155],"about_ca_topic_score_codex":1.2009416e-7,"about_ca_topic_score_gemma":1.9357272e-7,"teacher_disagreement_score":0.814651,"about_ca_system_score_codex":0.000135854,"about_ca_system_score_gemma":0.0000303176,"threshold_uncertainty_score":0.6944669},"labels":[],"label_agreement":null},{"id":"W2015050454","doi":"10.1007/s12293-012-0084-0","title":"A memetic algorithm for job shop scheduling using a critical-path-based local search heuristic","year":2012,"lang":"en","type":"article","venue":"Memetic Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Memetic algorithm; Computer science; Mathematical optimization; Fitness function; Job shop scheduling; Local search (optimization); Tabu search; Critical path method; Tournament selection; Flow shop scheduling; Generality; Evolutionary algorithm; Schedule; Algorithm; Crossover; Genetic algorithm; Artificial intelligence; Mathematics; Engineering","score_opus":0.037039615462445975,"score_gpt":0.3038008521982924,"score_spread":0.2667612367358464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015050454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04638638,0.0011333501,0.9500015,0.00006019884,0.0013841223,0.00032685333,0.000010578415,0.00056282233,0.00013424632],"genre_scores_gemma":[0.48563373,0.0000019000103,0.51373786,0.00005651399,0.0004779872,0.000009651853,0.0000069981156,0.00006875915,0.000006571368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751914,0.00008546632,0.0005494871,0.00034206154,0.00040847747,0.0010953627],"domain_scores_gemma":[0.9981496,0.0008944182,0.000041741132,0.0003149152,0.00024598982,0.00035333392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011584205,0.00033488433,0.00040793567,0.00026860303,0.00035218077,0.00013343622,0.00023702977,0.00014856365,0.00007453279],"category_scores_gemma":[0.0004845026,0.00037021248,0.00016565171,0.0005735042,0.000119562894,0.00012295664,0.00007589169,0.00036100714,0.0000323725],"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.000003952202,0.000060917468,0.00018227608,0.00024718052,0.000038355527,0.0000042003608,0.00031791942,0.9174406,0.0003030056,0.00017838183,0.000011584968,0.08121163],"study_design_scores_gemma":[0.000687932,0.00004130033,0.00007402569,0.00020939052,0.0001016512,0.000024234689,0.00037774417,0.99641585,0.0015201473,0.000035174053,0.000081965496,0.00043056702],"about_ca_topic_score_codex":0.000014025964,"about_ca_topic_score_gemma":4.3961072e-7,"teacher_disagreement_score":0.43924737,"about_ca_system_score_codex":0.00019844345,"about_ca_system_score_gemma":0.00007447339,"threshold_uncertainty_score":0.999875},"labels":[],"label_agreement":null},{"id":"W2015948517","doi":"10.1109/ieem.2010.5674468","title":"Optimimization of group scheduling using simulation with the meta-heuristic Extended Great Deluge (EGD) approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Meta heuristic; Flow shop scheduling; Group technology; Cellular manufacturing; Distributed computing; Algorithm; Engineering; Mathematics; Manufacturing engineering; Embedded system","score_opus":0.028309255401526904,"score_gpt":0.24220089656574126,"score_spread":0.21389164116421436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015948517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05066206,0.00008669043,0.94730884,0.000017163175,0.00013260981,0.0002043859,0.0000027412134,0.00024231573,0.0013431768],"genre_scores_gemma":[0.5433385,0.0000032922624,0.45652613,0.000013523525,0.000043679516,0.000008383434,0.000015955417,0.000027421154,0.000023100616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991397,0.000029818466,0.00025005624,0.00018118789,0.00022506248,0.00017412854],"domain_scores_gemma":[0.99931705,0.000109738765,0.00007574932,0.000292775,0.00015110496,0.00005361031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024939727,0.00018378557,0.00023202549,0.00010159949,0.00011282176,0.000055967,0.00013887318,0.000098313394,0.00012653726],"category_scores_gemma":[0.000050880353,0.000115430004,0.00007416395,0.00038374076,0.000059592363,0.00019004034,0.00001721018,0.00022164146,0.0000022503045],"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.000008246833,0.000020287463,0.000040365267,0.000024976294,0.000177036,3.5063206e-7,0.00010902705,0.9974371,0.00073780894,0.0009900692,0.0000021732526,0.0004525205],"study_design_scores_gemma":[0.0002859982,0.00001548724,0.00007691088,0.000004985182,0.00041230774,0.000007583213,0.00010107332,0.99803734,0.00084946887,0.000037771606,0.000014320426,0.00015675643],"about_ca_topic_score_codex":0.000014423664,"about_ca_topic_score_gemma":0.000006758639,"teacher_disagreement_score":0.49267644,"about_ca_system_score_codex":0.000015551257,"about_ca_system_score_gemma":0.000014282929,"threshold_uncertainty_score":0.47070992},"labels":[],"label_agreement":null},{"id":"W2016668986","doi":"10.5555/338219.338653","title":"New and improved algorithms for minsum shop scheduling","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Job shop scheduling; Multiprocessor scheduling; Open shop; Linear programming relaxation; Approximation algorithm; Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Multiprocessing; Schedule; Computer science; Relaxation (psychology); Greedy algorithm; Mathematics; Algorithm; Linear programming; Parallel computing","score_opus":0.012929543550041707,"score_gpt":0.23247776066850948,"score_spread":0.21954821711846778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016668986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016805414,0.0005642669,0.97647274,0.00018056968,0.00028571076,0.00021469154,0.000005970192,0.0006540681,0.004816587],"genre_scores_gemma":[0.009440668,0.00014805055,0.98297375,0.00009583716,0.00025297687,0.000015456202,0.000012429019,0.000037705777,0.007023131],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994635,0.0000028229222,0.00014046699,0.00014759763,0.000051195293,0.00019439004],"domain_scores_gemma":[0.9997059,0.000031914326,0.0000071807544,0.00010704998,0.000021181344,0.00012675654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060601356,0.00011542068,0.0001115977,0.000040852803,0.000051834682,0.00006003299,0.000060818784,0.000073335905,0.0005958908],"category_scores_gemma":[0.000012265519,0.00011155325,0.000033966706,0.000091214606,0.000009296931,0.00009462712,0.000005601965,0.00006334,0.000026092639],"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.000011983818,0.000009729862,0.000038600287,0.000033001794,0.000043259988,6.6304744e-7,0.00019145034,0.14721188,0.0006030562,0.00018256674,0.000880298,0.85079354],"study_design_scores_gemma":[0.0006213241,0.00002080851,0.000031309177,0.000007583462,0.000011035202,0.0000042536517,0.00004685483,0.9924347,0.0018485774,0.00010242464,0.004707754,0.00016337524],"about_ca_topic_score_codex":0.000012370532,"about_ca_topic_score_gemma":0.0000029172759,"teacher_disagreement_score":0.85063016,"about_ca_system_score_codex":0.000012305716,"about_ca_system_score_gemma":0.000013329234,"threshold_uncertainty_score":0.6524586},"labels":[],"label_agreement":null},{"id":"W2016986747","doi":"10.1016/j.cor.2010.04.009","title":"Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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 Windsor","funders":"","keywords":"Metaheuristic; Ant colony optimization algorithms; Parallel metaheuristic; Mathematical optimization; Flow shop scheduling; Computer science; Scheduling (production processes); Ant colony; Operator (biology); Job shop scheduling; Mathematics; Meta-optimization; Routing (electronic design automation)","score_opus":0.029658794550711406,"score_gpt":0.28614994640391,"score_spread":0.2564911518531986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016986747","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10739425,0.000111099296,0.88978314,0.0012712431,0.00024761714,0.0007555518,0.000019733292,0.00016609539,0.00025125567],"genre_scores_gemma":[0.34847835,0.000033373915,0.65066147,0.000062217274,0.00024340967,0.00016204188,0.00009590615,0.00004531796,0.00021793638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836177,0.0001491858,0.00026102617,0.0003471478,0.0005069571,0.0003739345],"domain_scores_gemma":[0.99863,0.00021592829,0.000010267544,0.0003951816,0.0005250744,0.00022356788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006392611,0.00019016945,0.00020016979,0.00025347632,0.0007242417,0.0007162823,0.00028068514,0.00008451082,0.00010216106],"category_scores_gemma":[0.000078931545,0.00014499832,0.000029694751,0.0005911573,0.00014507321,0.00029555915,0.00014111421,0.0005434028,0.00004700786],"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.000017982728,0.0000359078,0.000008157789,0.000010624497,0.000040301264,0.0000038133664,0.00090080476,0.9964297,0.0011713032,0.00024557565,0.0003823459,0.00075351447],"study_design_scores_gemma":[0.0004216595,0.00006746955,0.00008514383,0.000029908746,0.000015765252,0.000042688705,0.00014629118,0.99869096,0.00020787404,0.000005942526,0.00009629452,0.00018999695],"about_ca_topic_score_codex":0.000030341522,"about_ca_topic_score_gemma":0.000016948,"teacher_disagreement_score":0.2410841,"about_ca_system_score_codex":0.000060310613,"about_ca_system_score_gemma":0.00009362279,"threshold_uncertainty_score":0.69071263},"labels":[],"label_agreement":null},{"id":"W2017773796","doi":"10.1023/b:apin.0000027769.48098.91","title":"Local Search Genetic Algorithms for the Job Shop Scheduling Problem","year":2004,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":128,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Brock University","keywords":"Computer science; Crossover; Job shop scheduling; Tabu search; Genetic algorithm; Mathematical optimization; Operator (biology); Algorithm; Scheduling (production processes); Deadlock; Genetic operator; Local search (optimization); Schedule; Population-based incremental learning; Distributed computing; Artificial intelligence; Mathematics; Machine learning","score_opus":0.02769975547881486,"score_gpt":0.2645209188918796,"score_spread":0.23682116341306475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017773796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016126542,0.0007593217,0.99507,0.00015378713,0.00025167342,0.0005759026,0.0000042117867,0.00033298548,0.001239507],"genre_scores_gemma":[0.4839574,0.00021081498,0.515329,0.000086028514,0.00014234976,0.00018503101,0.000004840964,0.000044616278,0.000039899554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882174,0.000005618492,0.0002871066,0.00026108624,0.00022121686,0.0004032355],"domain_scores_gemma":[0.99935246,0.00015736818,0.000020372287,0.00029387555,0.00008273123,0.00009320098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023637243,0.00018885752,0.00014193928,0.000062533385,0.00019260982,0.000083887106,0.0003905942,0.00010224738,0.00004423557],"category_scores_gemma":[0.000014429568,0.00015278648,0.0000642748,0.00034340893,0.000118605,0.000045307293,0.000039895007,0.0002601314,0.00017641814],"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.0000050574818,0.000010101733,0.000003883472,0.00002765119,0.000026684136,8.301256e-7,0.00037027244,0.87214077,0.00017636076,0.0061094156,0.000011073253,0.12111793],"study_design_scores_gemma":[0.00015619624,0.000025576715,0.000018414774,0.000022710097,0.000017949606,0.000008236947,0.0008966235,0.9608138,0.034527555,0.0030067558,0.00028561076,0.00022055343],"about_ca_topic_score_codex":0.000016963651,"about_ca_topic_score_gemma":0.0000056469967,"teacher_disagreement_score":0.48234475,"about_ca_system_score_codex":0.00008916895,"about_ca_system_score_gemma":0.000050566265,"threshold_uncertainty_score":0.62304515},"labels":[],"label_agreement":null},{"id":"W2018507331","doi":"10.1111/j.1937-5956.2002.tb00494.x","title":"PRACTICE‐FOCUSED RESEARCH ISSUES FOR SCHEDULING SYSTEMS*","year":2002,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Scheduling (production processes); Computer science; Operations research; Industrial engineering; Operations management; Engineering","score_opus":0.07076953537627277,"score_gpt":0.32749958126723455,"score_spread":0.25673004589096177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018507331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011052247,0.025292162,0.88046944,0.035710882,0.006565898,0.0056173843,0.000013589808,0.001951101,0.033327296],"genre_scores_gemma":[0.24387404,0.0070887185,0.72358716,0.00009567144,0.0010430426,0.0009387757,0.00002499824,0.00005799425,0.023289591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924356,0.00004406079,0.00016806646,0.00021419833,0.00016802044,0.00016210553],"domain_scores_gemma":[0.99950135,0.000026456115,0.000009520073,0.00018311164,0.0002364672,0.000043101172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006020058,0.00007973738,0.00007484751,0.00019730684,0.0004249067,0.0002686654,0.000054959302,0.000031875323,0.00003626716],"category_scores_gemma":[0.00020423642,0.0000807576,0.000014108894,0.0002862432,0.000025025824,0.0003098161,0.000018604822,0.00009548728,0.000056204437],"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.0000033343042,0.000049265,0.0000042715997,0.0001292264,0.00005700873,6.917708e-7,0.0005728818,0.96773434,0.000039897117,0.012709323,0.007063211,0.011636546],"study_design_scores_gemma":[0.00017714218,0.000022462042,0.0000058201526,0.000030462134,0.000020876729,0.0000044185012,0.0018385965,0.91655105,0.00018153689,0.000023506243,0.08104164,0.00010248469],"about_ca_topic_score_codex":0.0000064236883,"about_ca_topic_score_gemma":0.000002998595,"teacher_disagreement_score":0.23282179,"about_ca_system_score_codex":0.00004102074,"about_ca_system_score_gemma":0.0000019658987,"threshold_uncertainty_score":0.32931995},"labels":[],"label_agreement":null},{"id":"W2019041940","doi":"10.3182/20090819-3-pl-3002.00038","title":"Fairness of schedules in the control of packet-switched networks","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Fairness measure; Network packet; Scheduling (production processes); Computer science; Apportionment; Measure (data warehouse); Max-min fairness; Context (archaeology); Maximum throughput scheduling; Upper and lower bounds; Transformation (genetics); Mathematical optimization; Resource allocation; Computer network; Mathematics; Round-robin scheduling; Dynamic priority scheduling; Quality of service; Throughput; Telecommunications","score_opus":0.006649252761787493,"score_gpt":0.20741793165431766,"score_spread":0.20076867889253017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019041940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89913213,0.001467721,0.09638129,0.00034045943,0.0001577682,0.00030517732,0.000005024355,0.00018476637,0.0020256706],"genre_scores_gemma":[0.9908838,0.00006581595,0.0088809,0.0000637195,0.00006955836,0.000009981932,0.0000022463546,0.000013200139,0.000010736336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992021,0.000006254113,0.00031349,0.00011163297,0.00017446636,0.00019207127],"domain_scores_gemma":[0.9996331,0.000044777717,0.00007918051,0.000086536274,0.00012729164,0.000029143428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002962274,0.00012491937,0.00024704312,0.00009480684,0.000022433582,0.000025772722,0.0002287474,0.000098462675,0.000010366154],"category_scores_gemma":[0.00008482098,0.00009906148,0.000055584034,0.0003968529,0.00004457048,0.00012829369,0.000006514299,0.0001600305,0.0000016003738],"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.00015740388,0.0004049547,0.12019498,0.0004632845,0.00018714376,0.0000050325293,0.008842121,0.74430513,0.0067099887,0.029296,0.0007149988,0.088718936],"study_design_scores_gemma":[0.0007729172,0.000065279564,0.024927838,0.00009070518,0.000021993103,0.00000298847,0.0012854501,0.9690609,0.0027921265,0.00078853045,0.000039295228,0.0001519511],"about_ca_topic_score_codex":0.00000669885,"about_ca_topic_score_gemma":0.0000015090919,"teacher_disagreement_score":0.22475576,"about_ca_system_score_codex":0.000013968736,"about_ca_system_score_gemma":0.0000094799725,"threshold_uncertainty_score":0.40396097},"labels":[],"label_agreement":null},{"id":"W2019210465","doi":"10.1080/00207540310001595855","title":"Finding effective schedules for the economic lot scheduling problem: A simple mixed integer programming approach","year":2003,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Mathematical optimization; Scheduling (production processes); Computer science; Operations research; Production schedule; Schedule; Heuristic; Job shop scheduling; Simple (philosophy); Variety (cybernetics); Integer (computer science); Mathematics; Artificial intelligence","score_opus":0.05762750957929855,"score_gpt":0.35478228505134807,"score_spread":0.2971547754720495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019210465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093194604,0.0010353312,0.8991625,0.0009840787,0.0039983033,0.0010952624,0.000005900992,0.00007877757,0.00044525586],"genre_scores_gemma":[0.7558454,0.00010863379,0.24249002,0.000008278159,0.0012503972,0.0001596862,0.0000069127523,0.000038645216,0.00009197166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983345,0.00016895436,0.00044890612,0.00020713596,0.00054327986,0.000297213],"domain_scores_gemma":[0.9979325,0.00048314393,0.00013561288,0.00014912142,0.001224686,0.000074927295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042439396,0.00012953098,0.00016181581,0.0004791561,0.0002219495,0.00026713204,0.00041752265,0.00007743017,0.00003149589],"category_scores_gemma":[0.0015674215,0.000099429875,0.00012820099,0.00024866607,0.00009890993,0.00033550966,0.000032786196,0.0007258829,0.000012628038],"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.000069667854,0.000055094897,0.0002680216,0.00004230452,0.00036367626,0.0000018004503,0.0004150518,0.9615951,0.0004897745,0.0054048635,0.00034266076,0.030951966],"study_design_scores_gemma":[0.0020121662,0.00027704725,0.00026578884,0.00022587185,0.000065553395,0.00042940528,0.006764859,0.9073163,0.042067718,0.005539822,0.03461351,0.00042193636],"about_ca_topic_score_codex":0.000008164213,"about_ca_topic_score_gemma":0.0000042110814,"teacher_disagreement_score":0.6626508,"about_ca_system_score_codex":0.00050535845,"about_ca_system_score_gemma":0.00017435773,"threshold_uncertainty_score":0.40546325},"labels":[],"label_agreement":null},{"id":"W2019692413","doi":"10.1007/s10951-013-0350-0","title":"Single-machine scheduling with periodic maintenance to minimize makespan revisited","year":2013,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Southeast University","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Schedule; Single-machine scheduling; Algorithm; Mathematics","score_opus":0.011178495713697754,"score_gpt":0.21233287039486404,"score_spread":0.2011543746811663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019692413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45366046,0.0014528052,0.5424584,0.0009371463,0.00046422254,0.00021344221,0.0000032721437,0.00017200077,0.00063823105],"genre_scores_gemma":[0.46797323,0.000056935776,0.53128564,0.0002540048,0.00029000718,0.000005742009,0.0000021584506,0.000057197725,0.00007511114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803174,0.000039381717,0.0007961633,0.00021158412,0.00045386347,0.00046729963],"domain_scores_gemma":[0.9983351,0.00009680725,0.00025808468,0.00026225403,0.00062489195,0.00042282307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043038753,0.0003111665,0.0005169275,0.00040476082,0.00011949976,0.0002894721,0.0003427181,0.000115621304,0.00023387454],"category_scores_gemma":[0.0003098573,0.00024825666,0.00013862012,0.0005506235,0.00004460909,0.00049699575,0.000033631222,0.00058121944,0.000114051734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006264964,0.000053799486,0.0014208958,0.000075404285,0.0001308264,0.00004794765,0.0006591891,0.97710645,0.010952587,0.00003077613,0.00013162244,0.009327842],"study_design_scores_gemma":[0.0027078083,0.00045288505,0.001827308,0.0019325045,0.00013448256,0.00076162297,0.0019500167,0.98019135,0.0076917014,0.00007564119,0.0013679034,0.0009067749],"about_ca_topic_score_codex":0.0000063023203,"about_ca_topic_score_gemma":0.0000016593777,"teacher_disagreement_score":0.01431276,"about_ca_system_score_codex":0.00014431713,"about_ca_system_score_gemma":0.000056761284,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W2021924891","doi":"10.1080/00207540600821009","title":"A manufacturing network design model based on processor and worker capabilities","year":2008,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation, Science and Economic Development Canada; École de Technologie Supérieure; Université Laval","funders":"","keywords":"Time horizon; Integer programming; Linear programming; Product (mathematics); Computer science; Industrial engineering; Set (abstract data type); State (computer science); Network planning and design; Operations research; Engineering; Manufacturing engineering; Mathematical optimization","score_opus":0.0807416098307426,"score_gpt":0.3248878511365718,"score_spread":0.2441462413058292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021924891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33609936,0.00056111603,0.65603733,0.0041732304,0.0020499388,0.00026192493,0.0000023896707,0.00010053361,0.00071419217],"genre_scores_gemma":[0.8794609,0.00023766581,0.118848816,0.000042195785,0.0009584435,0.000008976957,0.0000010297452,0.000018144212,0.0004238554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867964,0.000068144174,0.00023140207,0.00011195312,0.00075056625,0.00015827175],"domain_scores_gemma":[0.9987622,0.00012561145,0.000044886074,0.00008009655,0.00092076656,0.0000664266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518994,0.00007388193,0.000090631765,0.00032512026,0.00010517477,0.000051091254,0.00016332844,0.000040909097,0.000030463887],"category_scores_gemma":[0.0003787115,0.00006489736,0.000029934943,0.00011999361,0.00008080387,0.00018238641,0.000014577991,0.00037897253,0.0000049580376],"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.0001083582,0.00002646842,0.00013087285,0.000007639655,0.000029880744,0.0000130231065,0.00025572302,0.9937073,0.000072873176,0.000019109704,0.0022098694,0.0034188742],"study_design_scores_gemma":[0.00028004037,0.000057522306,0.00029589614,0.000091511196,0.0000026631715,0.00012393718,0.00008936573,0.9893666,0.008619825,0.0007131368,0.00028940866,0.00007012361],"about_ca_topic_score_codex":0.0000013695294,"about_ca_topic_score_gemma":3.9731358e-7,"teacher_disagreement_score":0.54336154,"about_ca_system_score_codex":0.00011152693,"about_ca_system_score_gemma":0.000090428635,"threshold_uncertainty_score":0.26464373},"labels":[],"label_agreement":null},{"id":"W2022678111","doi":"10.3182/20070523-3-es-4908.00011","title":"DSOPP: AN INTELLIGENT PLATFORM FOR DISTRIBUTED SIMULATION OF ORDER PROMISING PROTOCOLS IN SUPPLY CHAIN NETWORKS","year":2007,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Supply chain; Order (exchange); Distributed computing; Feature (linguistics); Systems engineering; Engineering","score_opus":0.02188073905257827,"score_gpt":0.2872795255594124,"score_spread":0.26539878650683413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022678111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21772657,0.000039275088,0.7761639,0.000013673813,0.00009379833,0.0055979686,0.000013526104,0.00026062928,0.00009067907],"genre_scores_gemma":[0.9295883,0.0000038887893,0.06920881,0.000010675008,0.00013710129,0.00089919864,0.00008365631,0.00004559373,0.000022736876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988032,0.0000019475674,0.00049036014,0.00020074981,0.00015344533,0.00035031175],"domain_scores_gemma":[0.999379,0.00006230694,0.00009857404,0.00007558731,0.00029911974,0.00008540766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056219025,0.0001704303,0.00022598323,0.00017077083,0.00005164371,0.00006333785,0.00013093119,0.00016087662,0.000012115436],"category_scores_gemma":[0.00017901289,0.00017888236,0.00004089439,0.0005101831,0.00002730621,0.00034534486,0.000016485685,0.00014509354,9.084541e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079718346,0.000054760505,0.007530445,0.0001533232,0.000013348953,3.3726164e-7,0.00079224113,0.9690168,0.00022809097,0.00017801241,0.000022794999,0.021930149],"study_design_scores_gemma":[0.00060733967,0.00010322371,0.0017364376,0.0001574464,0.0000071667714,0.0000011426102,0.00048161577,0.9902704,0.005936934,0.00020319689,0.0002929872,0.00020210659],"about_ca_topic_score_codex":0.000008414397,"about_ca_topic_score_gemma":0.000013194199,"teacher_disagreement_score":0.7118618,"about_ca_system_score_codex":0.00010597917,"about_ca_system_score_gemma":0.000018065546,"threshold_uncertainty_score":0.7294611},"labels":[],"label_agreement":null},{"id":"W2022779730","doi":"10.1007/s00170-009-2210-9","title":"A mixed-integer linear programming model along with an electromagnetism-like algorithm for scheduling job shop production system with sequence-dependent set-up times","year":2009,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"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 Windsor","funders":"","keywords":"Metaheuristic; Job shop scheduling; Mathematical optimization; Benchmark (surveying); Integer programming; Computer science; Algorithm; Scheduling (production processes); Linear programming; Set (abstract data type); Sequence (biology); Mathematics; Schedule","score_opus":0.012238747756288797,"score_gpt":0.24421806958097128,"score_spread":0.23197932182468248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022779730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3443245,0.0001373676,0.65369135,0.0006651242,0.00049782835,0.00025730047,0.0000043252426,0.0004101745,0.000011999406],"genre_scores_gemma":[0.53539795,0.000036673282,0.46422926,0.00002272101,0.00018983633,0.00002353553,0.0000067452784,0.000035186706,0.00005809748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984603,0.000016794149,0.0004583938,0.00026428615,0.00046042935,0.00033982523],"domain_scores_gemma":[0.9988395,0.00003422574,0.0002915062,0.0002613989,0.00050338916,0.000069999565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031157004,0.00026764793,0.00028674354,0.0004364945,0.00012942609,0.00008358873,0.00068355113,0.00012772802,0.0000020651091],"category_scores_gemma":[0.000030270181,0.00018492495,0.00006407385,0.00015506479,0.0000742734,0.0004794707,0.000027420076,0.000542385,0.000001307644],"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.00016572041,0.000020932328,0.000004697727,0.000013431142,0.00014761981,0.000031138086,0.00013761192,0.8681716,0.0020821674,0.0003179166,0.0000046788286,0.1289025],"study_design_scores_gemma":[0.0009790212,0.0007776206,0.0000060298025,0.00024778215,0.000058181777,0.0020086244,0.0012163854,0.84455436,0.14922759,0.000630164,0.000055599532,0.00023865727],"about_ca_topic_score_codex":0.0000028614872,"about_ca_topic_score_gemma":0.00001243073,"teacher_disagreement_score":0.19107345,"about_ca_system_score_codex":0.00029110932,"about_ca_system_score_gemma":0.00008680952,"threshold_uncertainty_score":0.7541021},"labels":[],"label_agreement":null},{"id":"W2022951309","doi":"10.3182/20060517-3-fr-2903.00254","title":"OUTLINE OF A FRAMEWORK FOR ANALYSIS OF MANUFACTURING SYSTEMS USING THE PAC SCHEME","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Dalhousie University","funders":"","keywords":"Kanban; Scheme (mathematics); Computer science; Variety (cybernetics); Process (computing); Industrial engineering; Artificial neural network; Production control; Engineering; Production (economics); Control (management); Artificial intelligence","score_opus":0.01825073001928108,"score_gpt":0.2536511326116452,"score_spread":0.2354004025923641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022951309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6777107,0.0005467829,0.32111478,0.000020547799,0.00015481765,0.00018226441,0.000027042404,0.000113270704,0.0001297885],"genre_scores_gemma":[0.8011056,0.000009665356,0.19866925,0.0000038501244,0.00011857931,0.0000154347,0.0000073714086,0.000023890912,0.000046344554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912196,0.0000025845357,0.0003854616,0.00013364156,0.00017479777,0.00018152721],"domain_scores_gemma":[0.9994562,0.00007257871,0.00015904213,0.000103621045,0.00018326614,0.00002524023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019804873,0.00012913112,0.00033229258,0.0002205725,0.000058869264,0.000045497767,0.00014948491,0.000100640296,0.000007958407],"category_scores_gemma":[0.000067311754,0.000104804094,0.00015001422,0.00052816985,0.000040523606,0.00008800141,0.00001775404,0.000094029485,4.1263337e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009986255,0.000025196663,0.009488347,0.00040055503,0.00065795105,1.226479e-7,0.00044416304,0.9832274,0.0024832934,0.0028645818,0.00007269513,0.0003257591],"study_design_scores_gemma":[0.00012172536,0.000011272813,0.0008540539,0.00008277263,0.0003683004,8.298091e-7,0.00062857126,0.96749526,0.030029736,0.00020753364,0.00008458767,0.00011534948],"about_ca_topic_score_codex":0.0000813199,"about_ca_topic_score_gemma":0.0000019228694,"teacher_disagreement_score":0.123394884,"about_ca_system_score_codex":0.00003041308,"about_ca_system_score_gemma":0.000008188308,"threshold_uncertainty_score":0.4273787},"labels":[],"label_agreement":null},{"id":"W2023874278","doi":"10.1016/j.ejor.2010.02.026","title":"A unified approach for scheduling with convex resource consumption functions using positional penalties","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"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; Job shop scheduling; Mathematical optimization; Subroutine; Computer science; Scheduling (production processes); Time complexity; Deadline-monotonic scheduling; Assignment problem; Convex function; Regular polygon; Algorithm; Mathematics; Flow shop scheduling","score_opus":0.0885473385718951,"score_gpt":0.3211434306441951,"score_spread":0.23259609207229998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023874278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3082182,0.00011434374,0.6883522,0.00017085901,0.0001775195,0.00017256456,0.000019023744,0.000032804553,0.0027424146],"genre_scores_gemma":[0.56285596,0.0000081314765,0.43620035,0.000027159314,0.00060568296,0.0000041947515,0.00005298945,0.000037720492,0.00020782516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984746,0.00021304502,0.00034718137,0.00012764473,0.0006175949,0.0002199603],"domain_scores_gemma":[0.99818516,0.00023644626,0.00006174943,0.00011239741,0.0012570914,0.00014713922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026176604,0.00010771965,0.00013194112,0.000341741,0.00043572029,0.00023439918,0.00017034182,0.000035361114,0.00013027915],"category_scores_gemma":[0.0002387495,0.000090658,0.000055780478,0.00022324815,0.0001492791,0.00026721298,0.000020489451,0.00077542843,0.000015516938],"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.00015844678,0.000044000055,0.0002695789,0.00003340604,0.00007676442,0.000011456511,0.00020166193,0.9807443,0.016014233,0.0016226838,0.0004329151,0.00039054977],"study_design_scores_gemma":[0.0013435772,0.00020633238,0.0012872001,0.00006188943,0.000022268105,0.00046023988,0.0005532403,0.9931847,0.0010127238,0.000021540254,0.0016822394,0.00016405674],"about_ca_topic_score_codex":7.7354736e-7,"about_ca_topic_score_gemma":6.6809366e-7,"teacher_disagreement_score":0.25463772,"about_ca_system_score_codex":0.000051773262,"about_ca_system_score_gemma":0.00018366406,"threshold_uncertainty_score":0.3696926},"labels":[],"label_agreement":null},{"id":"W2023921780","doi":"10.1080/09537287.2010.543556","title":"An improved genetic algorithm approach for on-line optimisation problems","year":2011,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Genetic algorithm; Process (computing); Cache; Quality (philosophy); Mathematical optimization; Machine learning; Parallel computing","score_opus":0.03549112459139859,"score_gpt":0.24255261170516784,"score_spread":0.20706148711376926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023921780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031912653,0.000215754,0.99366885,0.00003309513,0.00089106173,0.0008980737,0.000016715741,0.00077087904,0.00031428257],"genre_scores_gemma":[0.36266038,0.000009434258,0.63598275,0.000048547383,0.00068903266,0.00035774749,0.00010274215,0.000054567266,0.00009483786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998917,0.000028682754,0.00028683047,0.00037969524,0.00012085816,0.00026692607],"domain_scores_gemma":[0.99938124,0.000019362717,0.000071614275,0.00028919434,0.00014424682,0.00009431347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028072175,0.00019850054,0.00018633586,0.00014103868,0.00012569789,0.00004633473,0.00012298746,0.000101595346,0.000014940196],"category_scores_gemma":[0.000059840128,0.00019851055,0.00004992843,0.00014174619,0.000022670461,0.0001829329,0.0000034904215,0.00014979832,0.0000066542043],"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.00004664452,0.000092541355,0.00008540225,0.00003543076,0.000050458824,2.712885e-7,0.00062158203,0.96427125,0.0011723517,0.000011156598,0.00009174338,0.033521194],"study_design_scores_gemma":[0.001027384,0.0002725204,0.00027192023,0.000014828258,0.000043011114,0.000009594577,0.00009910681,0.99435335,0.0034861767,0.000053475393,0.00012915008,0.00023946201],"about_ca_topic_score_codex":0.000005334357,"about_ca_topic_score_gemma":1.2137126e-7,"teacher_disagreement_score":0.3594691,"about_ca_system_score_codex":0.00004141278,"about_ca_system_score_gemma":0.000015509391,"threshold_uncertainty_score":0.80950254},"labels":[],"label_agreement":null},{"id":"W2024953459","doi":"10.1007/s10489-006-0005-3","title":"Assigning data to dual memory banks in DSPs with a genetic algorithm using a repair heuristic","year":2006,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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; University of Guelph","funders":"","keywords":"Computer science; Parallel computing; Heuristics; Memory bandwidth; High memory; Interleaved memory; Digital signal processing; Compiler; Registered memory; Digital signal processor; Memory management; Semiconductor memory; Algorithm; Computer hardware","score_opus":0.029084334703382116,"score_gpt":0.2481957560623313,"score_spread":0.21911142135894918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024953459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020476373,0.00022801777,0.9772022,0.000008166763,0.00013641441,0.0002690363,0.0000140281945,0.0004374077,0.0012283658],"genre_scores_gemma":[0.35476062,0.000007968384,0.64492196,0.000050980707,0.00012765979,0.000025170477,0.00003017221,0.000046398258,0.000029068817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856746,0.000015489413,0.0003680045,0.00045269702,0.00023405689,0.0003622618],"domain_scores_gemma":[0.99913675,0.000097177275,0.00003568055,0.00060580164,0.000036532012,0.00008804409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002080972,0.00021689312,0.00020896723,0.00018502663,0.00005914048,0.00005610775,0.00031144603,0.000081478924,0.00004165628],"category_scores_gemma":[0.000029296178,0.00022063589,0.000019294532,0.00067458756,0.000040116865,0.00008320515,0.00010092016,0.00022444493,0.000065874316],"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.0000066471553,0.000022879198,0.00007347656,0.000018754265,0.000012422982,0.00004369541,0.00016091637,0.97035074,0.00039092518,0.00006772291,0.00007704341,0.028774748],"study_design_scores_gemma":[0.00010044931,0.000020114472,0.00023336241,0.000059369457,0.000017787062,0.00002439219,0.00018583145,0.9954719,0.003411808,0.00007162783,0.000094457144,0.00030887837],"about_ca_topic_score_codex":0.00016932464,"about_ca_topic_score_gemma":0.000040676492,"teacher_disagreement_score":0.33428425,"about_ca_system_score_codex":0.000084265615,"about_ca_system_score_gemma":0.000041059437,"threshold_uncertainty_score":0.89972705},"labels":[],"label_agreement":null},{"id":"W2025389484","doi":"10.1016/j.cor.2008.08.008","title":"Scheduling with uncertain durations: Modeling -robust scheduling with constraints","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":62,"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":"Enterprise Ireland","keywords":"Mathematical optimization; Computer science; Scheduling (production processes); Dynamic priority scheduling; Job shop scheduling; Schedule; Robustness (evolution); Mathematics","score_opus":0.09082031233015848,"score_gpt":0.30642897843153327,"score_spread":0.2156086661013748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025389484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18936849,0.00023143223,0.80844223,0.00030115203,0.0001197182,0.00038895066,0.000006078314,0.00040723573,0.0007346843],"genre_scores_gemma":[0.512243,0.000076241835,0.4872966,0.000032719527,0.00012806596,0.000066230874,0.00004975748,0.000045475255,0.00006189734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997743,0.00012341395,0.0003685239,0.00044532656,0.00070561375,0.0006141279],"domain_scores_gemma":[0.99822176,0.0001522036,0.00001468436,0.00044042818,0.00092930865,0.0002416131],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005001747,0.00026248282,0.0002493559,0.000512403,0.0013589164,0.00035455177,0.0003380023,0.00011581089,0.000069768015],"category_scores_gemma":[0.000084840685,0.00022777314,0.00004046305,0.0013072891,0.0003979858,0.0005127613,0.000045535515,0.00076805655,0.00007516915],"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.000015548187,0.000041531206,0.00012062382,0.000022890628,0.0000689199,0.000053685348,0.0010525071,0.99684954,0.00013048726,0.00063684105,0.000037691047,0.00096976355],"study_design_scores_gemma":[0.0007902471,0.000095540236,0.000020250724,0.0001865716,0.000009137135,0.00020607896,0.0012935053,0.9967491,0.00030316453,0.000008115998,0.000021119618,0.00031719008],"about_ca_topic_score_codex":0.000054470598,"about_ca_topic_score_gemma":0.00007199762,"teacher_disagreement_score":0.32287452,"about_ca_system_score_codex":0.00018045022,"about_ca_system_score_gemma":0.00043360546,"threshold_uncertainty_score":0.9999412},"labels":[],"label_agreement":null},{"id":"W2025837542","doi":"10.1007/s00170-013-5187-3","title":"Two-stage flow-shop scheduling problem with non-identical second stage assembly machines","year":2013,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Windsor","funders":"","keywords":"Mathematical optimization; Job shop scheduling; Flow shop scheduling; Heuristic; Generalization; Integer programming; Scheduling (production processes); Minification; Computer science; Linear programming; Mathematics; Algorithm; Schedule","score_opus":0.0055082780566454905,"score_gpt":0.23472860748316415,"score_spread":0.22922032942651865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025837542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.857076,0.000118309435,0.13983488,0.0013469814,0.0006543685,0.00015539944,0.000006255415,0.0002126125,0.0005952101],"genre_scores_gemma":[0.6669703,0.000048680355,0.33218116,0.00008444313,0.00015949,0.000014659,0.0000027834508,0.000039379713,0.000499085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986474,0.000013578436,0.0005158032,0.0001554529,0.00039348163,0.00027426926],"domain_scores_gemma":[0.9990531,0.00009221795,0.00024942623,0.00023320036,0.00030085584,0.00007120714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021282343,0.00021912466,0.00025113238,0.00042846194,0.00007624062,0.0001347874,0.00092384877,0.00010020678,0.0003704933],"category_scores_gemma":[0.00005396298,0.00015049118,0.00007378986,0.0001325566,0.000093036186,0.00046298822,0.00011885205,0.0006973615,0.000036688667],"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.000037373855,0.00002577182,0.00013552216,0.000022042572,0.00022593171,0.000057792586,0.00008644054,0.97247446,0.011045506,0.000386785,0.000032509648,0.015469882],"study_design_scores_gemma":[0.0027278143,0.000172224,0.000461301,0.00023566905,0.000037536312,0.00078823493,0.001065562,0.5195111,0.46907076,0.0039012458,0.0015810778,0.00044746845],"about_ca_topic_score_codex":0.0000064281894,"about_ca_topic_score_gemma":0.000019973864,"teacher_disagreement_score":0.45802525,"about_ca_system_score_codex":0.00011990396,"about_ca_system_score_gemma":0.000034404322,"threshold_uncertainty_score":0.61368525},"labels":[],"label_agreement":null},{"id":"W2025939476","doi":"10.1080/0020754031000106443","title":"Parallel flowshop scheduling using Tabu search","year":2003,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Computer science; Fair-share scheduling; Flow shop scheduling; Schedule; Mathematics","score_opus":0.10803915416766921,"score_gpt":0.38712156148461646,"score_spread":0.2790824073169472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025939476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71621466,0.0013061252,0.27086678,0.0012187909,0.00801034,0.00017226009,0.0000026082514,0.000081549275,0.0021269172],"genre_scores_gemma":[0.739747,0.00038358523,0.25803104,0.000014408589,0.0014458594,0.0000024765072,0.0000020692953,0.000032635045,0.00034095222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768406,0.00017966218,0.000413774,0.0001499079,0.0013095275,0.000263062],"domain_scores_gemma":[0.9971732,0.00007471761,0.000056000325,0.00014443471,0.0024338067,0.00011787315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027766142,0.00009423287,0.00012799696,0.00075526896,0.000108129636,0.00013865335,0.00033433837,0.00006682179,0.00025314745],"category_scores_gemma":[0.0010375247,0.000090937014,0.0000746717,0.00047234574,0.00007156495,0.00036298562,0.000026657839,0.00070146465,0.000040316103],"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.00002810789,0.000047825022,0.0003536602,0.000010183028,0.00010956026,0.000026537818,0.00024717292,0.98726654,0.008254831,0.00066025986,0.00029944952,0.0026958738],"study_design_scores_gemma":[0.001550085,0.00011853392,0.0003290026,0.00027417322,0.00002218794,0.0017051956,0.002621999,0.8918177,0.08928063,0.0016830822,0.010196224,0.0004011809],"about_ca_topic_score_codex":0.0000057984926,"about_ca_topic_score_gemma":9.998345e-7,"teacher_disagreement_score":0.09544884,"about_ca_system_score_codex":0.00027105695,"about_ca_system_score_gemma":0.00017701674,"threshold_uncertainty_score":0.3708304},"labels":[],"label_agreement":null},{"id":"W2027524005","doi":"10.1287/ijoc.1100.0388","title":"Combining Constraint Programming and Local Search for Job-Shop Scheduling","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"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; Sandia National Laboratories; U.S. Department of Energy","keywords":"Tabu search; Constraint programming; Computer science; Job shop scheduling; Mathematical optimization; Guided Local Search; Flow shop scheduling; Hybrid algorithm (constraint satisfaction); Job shop; Local search (optimization); Scheduling (production processes); Iterated local search; Algorithm; Mathematics; Constraint logic programming; Schedule","score_opus":0.016612609349493813,"score_gpt":0.26632303167577015,"score_spread":0.24971042232627633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027524005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43273044,0.00003412174,0.5656422,0.00005800257,0.0007861825,0.00010473992,8.2175956e-7,0.00015256848,0.00049096986],"genre_scores_gemma":[0.69973576,0.0000063649177,0.2998414,0.00006763838,0.0003154722,0.0000016455991,0.0000018609878,0.000024550378,0.000005272317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988297,0.000007858608,0.00041812012,0.000116969844,0.00021078213,0.00041653504],"domain_scores_gemma":[0.9992033,0.00024136927,0.00007246103,0.00009316115,0.00016601606,0.00022369342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008870304,0.00016832074,0.0001927549,0.00018072018,0.00039920022,0.0004015408,0.00013964652,0.0001156562,0.000009469171],"category_scores_gemma":[0.00008665665,0.00014872721,0.00006961469,0.00014164741,0.00008788185,0.00018945984,0.000036263067,0.0010498364,0.0000060074613],"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.000008709229,0.000007707475,0.0006645634,0.000035244,0.0000312057,0.0000061699975,0.00059636537,0.58891046,0.0001745848,0.0014427439,0.0000053393705,0.40811688],"study_design_scores_gemma":[0.000874997,0.00009316657,0.00015267258,0.0001380126,0.000007708453,0.00039428583,0.0011128095,0.99568,0.0008120388,0.00006469776,0.00046763703,0.00020200858],"about_ca_topic_score_codex":0.0000011427028,"about_ca_topic_score_gemma":9.090926e-7,"teacher_disagreement_score":0.40791488,"about_ca_system_score_codex":0.000037268703,"about_ca_system_score_gemma":0.000050676223,"threshold_uncertainty_score":0.606492},"labels":[],"label_agreement":null},{"id":"W2027686000","doi":"10.1016/j.ejor.2005.03.036","title":"Production control in a two-stage system","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Mount Saint Vincent University","funders":"","keywords":"Upstream (networking); Markov decision process; Mathematical optimization; Production (economics); Computer science; Markov chain; Markov process; Work (physics); Stage (stratigraphy); Production system (computer science); Decision rule; Downstream (manufacturing); Function (biology); Process (computing); Production control; Mathematics; Engineering; Operations management; Statistics","score_opus":0.044077936007186784,"score_gpt":0.32860564889492216,"score_spread":0.2845277128877354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027686000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7633943,0.0019142835,0.16534069,0.0054365224,0.001564428,0.00057351793,0.000013763961,0.00016088231,0.06160161],"genre_scores_gemma":[0.98050654,0.000027534052,0.017747102,0.00002537958,0.0010727645,0.0000016973614,0.0000016911829,0.00002174681,0.0005955202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984209,0.0004537943,0.00037386813,0.00007744356,0.00051391457,0.00016010017],"domain_scores_gemma":[0.99926263,0.00006371558,0.000029986937,0.000082518134,0.00048237495,0.00007879669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041983915,0.000059602535,0.000097477765,0.00032814848,0.00007023692,0.00008880726,0.00014826228,0.000009148052,0.00007486951],"category_scores_gemma":[0.00025871006,0.000052544794,0.000029027335,0.00026635267,0.000025674277,0.00025386026,0.000010338828,0.00042243506,0.0001442864],"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.000025923438,0.00002139145,0.0001736408,0.000012295699,0.000012394747,0.000056737546,0.00021271776,0.99327344,0.0020390537,0.00054520887,0.00072360603,0.0029035863],"study_design_scores_gemma":[0.001699206,0.00007364186,0.0020470987,0.00013527625,0.0000028794452,0.00015482352,0.00044865554,0.98590064,0.0011916425,0.0000022203271,0.008244059,0.00009987529],"about_ca_topic_score_codex":0.0000011958795,"about_ca_topic_score_gemma":0.0000032696305,"teacher_disagreement_score":0.21711226,"about_ca_system_score_codex":0.00018089311,"about_ca_system_score_gemma":0.0000668153,"threshold_uncertainty_score":0.21427146},"labels":[],"label_agreement":null},{"id":"W2029826506","doi":"10.1007/s10951-010-0208-7","title":"A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates","year":2010,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Function (biology); Single-machine scheduling; Due date; Regular polygon; Assignment problem; Time complexity; Resource consumption; Convex function; Job shop scheduling; Mathematics; Algorithm","score_opus":0.006204005759576244,"score_gpt":0.21502024176032247,"score_spread":0.20881623600074622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029826506","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8575115,0.00066088693,0.13964763,0.0002356804,0.0002968268,0.00015128596,0.0000037798352,0.00004407694,0.0014483273],"genre_scores_gemma":[0.5607341,0.00001030994,0.43898496,0.00002311064,0.00015615406,0.0000035870135,8.8583624e-7,0.000022843698,0.0000640487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893296,0.000026425912,0.0004529777,0.000120954435,0.00025363974,0.00021302643],"domain_scores_gemma":[0.99906826,0.00009895252,0.00020432252,0.00012921171,0.00036229004,0.000136938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327994,0.00016645684,0.00039975246,0.00010626524,0.000102352074,0.00016959698,0.00016571331,0.00009011823,0.00006144704],"category_scores_gemma":[0.000098701705,0.000105522464,0.000048031012,0.00028950666,0.00007243757,0.00029897594,0.00002474826,0.000404933,0.0000026555201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058276835,0.0002624868,0.0112025235,0.0005045858,0.0006718072,0.0000352817,0.0042023733,0.83566904,0.1400573,0.00044886747,0.00029333882,0.006069659],"study_design_scores_gemma":[0.0020933785,0.00006703296,0.0014469678,0.00025044408,0.00013300634,0.000791121,0.0019742772,0.97537607,0.017364845,0.00007066707,0.00015918878,0.00027300228],"about_ca_topic_score_codex":0.00000580524,"about_ca_topic_score_gemma":3.9163157e-7,"teacher_disagreement_score":0.29933733,"about_ca_system_score_codex":0.000012439247,"about_ca_system_score_gemma":0.00007704653,"threshold_uncertainty_score":0.4303081},"labels":[],"label_agreement":null},{"id":"W2030395122","doi":"10.1016/j.aei.2006.05.004","title":"Applications of agent-based systems in intelligent manufacturing: An updated review","year":2006,"lang":"en","type":"article","venue":"Advanced Engineering Informatics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":547,"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; National Research Council Canada","funders":"","keywords":"Manufacturing execution system; Negotiation; Supply chain; Multi-agent system; Computer science; Manufacturing engineering; Process management; Computer-integrated manufacturing; Scheduling (production processes); Engineering; Systems engineering; Engineering management; Business; Operations management; Artificial intelligence","score_opus":0.006032637507384548,"score_gpt":0.21834671266059372,"score_spread":0.21231407515320916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030395122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062729893,0.0023829807,0.98995066,0.0000047837134,0.00016417463,0.00040040232,0.000013261364,0.00039648134,0.0004142499],"genre_scores_gemma":[0.5358009,0.0011896953,0.46179268,0.00006141493,0.00005836219,0.00026944024,0.00071595836,0.00008024407,0.00003130711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989509,0.000004572493,0.0006688199,0.00005899221,0.000133507,0.00018318265],"domain_scores_gemma":[0.99954283,0.000018938703,0.00007361858,0.00027046615,0.000042978576,0.00005119054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011040232,0.00015095684,0.00022242629,0.00018484822,0.000013441934,0.000015485539,0.00014507066,0.000054149477,0.000010178172],"category_scores_gemma":[0.000005348994,0.00016289024,0.000033263772,0.00030521423,0.000008755392,0.00021034104,0.000008766682,0.00012485766,0.000011796232],"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":[6.410152e-7,0.000014945838,0.000008993573,0.0012561458,0.0000052541986,3.558302e-7,0.000030768715,0.9938846,0.0000521306,0.00021439225,0.000025686943,0.0045060855],"study_design_scores_gemma":[0.00018168663,0.000009942312,0.000047427817,0.00041793202,0.000009612586,0.0000020412688,0.000042689357,0.97930443,0.006205764,0.000005000191,0.013599571,0.00017392015],"about_ca_topic_score_codex":0.000007993865,"about_ca_topic_score_gemma":0.0000015065172,"teacher_disagreement_score":0.5295279,"about_ca_system_score_codex":0.00007358583,"about_ca_system_score_gemma":0.00001024306,"threshold_uncertainty_score":0.6642471},"labels":[],"label_agreement":null},{"id":"W2031002773","doi":"10.1007/s10479-011-0835-1","title":"Single-machine scheduling problems with time and position dependent processing times","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Job shop scheduling; Single-machine scheduling; Theory of computation; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Due date; Position (finance); Learning effect; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.10754502795539035,"score_gpt":0.33211064105787114,"score_spread":0.2245656131024808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031002773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8866403,0.0042446074,0.090946615,0.00080188905,0.000043574404,0.0007705487,0.00003171147,0.00034475056,0.016175965],"genre_scores_gemma":[0.90904266,0.0001229671,0.09041118,0.00001585501,0.000024704637,0.000024622428,0.000027458807,0.000025007645,0.00030554706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.000049380542,0.00017827413,0.00014590618,0.00027781364,0.00021148215],"domain_scores_gemma":[0.9992214,0.000024254816,0.000011051733,0.00012604322,0.0005387892,0.00007849979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047714927,0.000087789434,0.00010811566,0.00023287763,0.00019662389,0.00010087666,0.00008961418,0.00005124666,0.00013002405],"category_scores_gemma":[0.00004507127,0.00007509701,0.000013073721,0.00033564764,0.00008649987,0.00032003102,0.000026262494,0.00018006311,0.00002185034],"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.000036491663,0.00021311072,0.00023682974,0.00014243434,0.00007032645,0.0000063243583,0.003126031,0.95915854,0.01985391,0.00037152134,0.000046000798,0.016738461],"study_design_scores_gemma":[0.00017852777,0.00018573194,0.00014531071,0.00012729205,0.0000052745672,0.0000148148965,0.00013948488,0.9422455,0.056781113,0.000053871634,0.000014214787,0.00010886474],"about_ca_topic_score_codex":0.000055692984,"about_ca_topic_score_gemma":0.00003274672,"teacher_disagreement_score":0.036927205,"about_ca_system_score_codex":0.000011056121,"about_ca_system_score_gemma":0.000042063,"threshold_uncertainty_score":0.30623668},"labels":[],"label_agreement":null},{"id":"W2031053758","doi":"10.1016/j.dam.2010.06.015","title":"‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"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":"Mathematics; Series (stratigraphy); Computational complexity theory; Scheduling (production processes); Modular design; Combinatorics; Computer science; Algorithm; Mathematical optimization","score_opus":0.011927761941974542,"score_gpt":0.24181885120117422,"score_spread":0.22989108925919968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031053758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16669953,0.00002618642,0.7927395,0.0003567047,0.0006264369,0.0007969509,0.000014680441,0.0008289829,0.037911016],"genre_scores_gemma":[0.26921982,0.000010951354,0.7303469,0.000045340537,0.00005562117,0.00010655427,0.000015025077,0.000058262503,0.00014154274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883455,0.000004104702,0.00036140566,0.00023196972,0.00020483184,0.00036312325],"domain_scores_gemma":[0.99923164,0.00006275615,0.00003958518,0.00044637837,0.000042544354,0.00017708428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017317203,0.00023060059,0.00025894216,0.00013709709,0.000070616064,0.00006746338,0.00026454352,0.00013678058,0.00013542033],"category_scores_gemma":[0.0001146593,0.00022881395,0.000042013515,0.0003985688,0.000045071967,0.00009556426,0.000061086605,0.00040257027,0.00021998853],"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.000012265268,0.00006833124,0.000031450414,0.00013232592,0.000025637799,0.0000036529464,0.0023435112,0.8844478,0.014895717,0.09676703,0.0002732553,0.0009990095],"study_design_scores_gemma":[0.0007201805,0.000028292427,0.00013333654,0.00009973513,0.000029408111,0.00001959635,0.0031060702,0.9834488,0.0042705364,0.006163108,0.0012097902,0.0007711647],"about_ca_topic_score_codex":0.000003550067,"about_ca_topic_score_gemma":0.00006080738,"teacher_disagreement_score":0.10252028,"about_ca_system_score_codex":0.000024079813,"about_ca_system_score_gemma":0.000025530144,"threshold_uncertainty_score":0.9330762},"labels":[],"label_agreement":null},{"id":"W2031319552","doi":"10.1007/s10845-009-0250-5","title":"A robust genetic algorithm for scheduling realistic hybrid flexible flow line problems","year":2009,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","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":"University of Calgary","funders":"","keywords":"Flow line; Scheduling (production processes); Mathematical optimization; Computer science; Flow shop scheduling; Algorithm; Job shop scheduling; Genetic algorithm; Evolutionary algorithm; Engineering; Mathematics; Schedule","score_opus":0.029219916358054536,"score_gpt":0.24321144445976936,"score_spread":0.21399152810171482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031319552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011707751,0.0015249769,0.98510903,0.00012225677,0.0010067176,0.00023048463,0.000011127919,0.00016279492,0.00012488851],"genre_scores_gemma":[0.093592726,0.00077374256,0.904276,0.00010610667,0.0010458515,0.0000062763083,0.000013088787,0.000057438014,0.00012874583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823236,0.000018147768,0.000880067,0.00017696772,0.0002996954,0.00039276946],"domain_scores_gemma":[0.9990752,0.00009205777,0.00022707797,0.00018995612,0.000209584,0.00020617478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037350645,0.00026814107,0.0003833373,0.00033378133,0.0000993605,0.00013295808,0.00028849364,0.00008518094,0.000053877662],"category_scores_gemma":[0.00007529375,0.00024571636,0.00023520591,0.000109681976,0.000017506227,0.00018033,0.000015354652,0.00037292915,0.000012197015],"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.0000103201055,0.00003395388,0.0000014678209,0.000046308094,0.000057833582,0.000019039117,0.0000911287,0.7659025,0.0001023069,0.0000044624758,0.00011365209,0.23361702],"study_design_scores_gemma":[0.00040255758,0.00019704807,0.00002682349,0.00022698913,0.00006193342,0.00023065801,0.000056503974,0.8712178,0.12597477,0.00060592557,0.0007555739,0.0002434448],"about_ca_topic_score_codex":0.0000020006723,"about_ca_topic_score_gemma":4.9567006e-7,"teacher_disagreement_score":0.23337358,"about_ca_system_score_codex":0.00015229335,"about_ca_system_score_gemma":0.00003777843,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W203241322","doi":"","title":"NOTERE’2006: nouvelles technologies de la répartition","year":2006,"lang":"fr","type":"book","venue":"Hermès-Lavoisier eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Political science; Art","score_opus":0.00892133880625538,"score_gpt":0.2220074320006154,"score_spread":0.21308609319436003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203241322","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024345228,0.0028110403,0.13805908,0.0003259068,0.0015117242,0.0006876345,0.00027003314,0.0040373527,0.8498627],"genre_scores_gemma":[0.04591724,0.00044528535,0.29404262,0.00023867852,0.0016325483,0.00033101955,0.00049607665,0.00074009877,0.6561564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966796,0.00024980734,0.0008501062,0.0007411708,0.00045207675,0.0010272274],"domain_scores_gemma":[0.9980142,0.0005735528,0.00024987568,0.00083477586,0.00015815975,0.00016942555],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006334186,0.0009354135,0.00076032354,0.00048560638,0.00032078702,0.00030959936,0.0005766927,0.0023934604,0.00023416062],"category_scores_gemma":[0.00015402398,0.0010809734,0.00036245675,0.00015261237,0.0010125942,0.00010636942,0.00015754861,0.0016339603,0.00066371216],"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.000078153585,0.000328808,0.0006162261,0.0021853675,0.00095565786,0.0009346446,0.0022349632,0.3764085,0.0020667668,0.10049328,0.080283344,0.4334143],"study_design_scores_gemma":[0.0019566657,0.00012304123,0.0004367903,0.0021802273,0.000599057,0.0003465438,0.00059242034,0.108156584,0.016546581,0.02657352,0.83924156,0.0032469826],"about_ca_topic_score_codex":0.00015193853,"about_ca_topic_score_gemma":0.000051407394,"teacher_disagreement_score":0.7589582,"about_ca_system_score_codex":0.00097528356,"about_ca_system_score_gemma":0.00052401214,"threshold_uncertainty_score":0.99916404},"labels":[],"label_agreement":null},{"id":"W2032485544","doi":"","title":"Existence of Optimal Feedback Production Plans in Stochastic Flowshops with Limited Buffers","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bellman equation; Mathematical optimization; Production (economics); Dynamic programming; Lipschitz continuity; Function (biology); Computer science; Markov decision process; Markov chain; Work (physics); Boundary (topology); Value (mathematics); Markov process; Optimal control; Process (computing); Mathematics; Engineering; Economics","score_opus":0.010061018417188393,"score_gpt":0.2033952437881647,"score_spread":0.1933342253709763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032485544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63522595,0.000036398134,0.3616807,0.00024127189,0.0001298678,0.00015436362,0.0000020602922,0.0002543292,0.002275076],"genre_scores_gemma":[0.8496143,0.0000074465247,0.15020521,0.000025432691,0.000019912412,0.000003393943,0.0000071972972,0.000009027731,0.000108041546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995346,0.000007675056,0.00013453003,0.00011188365,0.00009837093,0.00011291248],"domain_scores_gemma":[0.99979377,0.000014826123,0.000015094486,0.00010954996,0.000036647103,0.000030110146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000068058594,0.0000830657,0.000102572616,0.00009849351,0.000010068378,0.000009313005,0.000052465148,0.00003474655,0.000016205247],"category_scores_gemma":[0.000027476124,0.00007116301,0.000012256741,0.00028694086,0.000015283786,0.000093049755,0.0000026593973,0.00008813496,0.000004425479],"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.000022695533,0.000023436121,0.00006525825,0.0000068574636,0.0000050674944,0.0000011109522,0.00033461163,0.9979797,0.00030962497,0.00011754975,0.000017723734,0.0011163377],"study_design_scores_gemma":[0.00035964316,0.00010288688,0.0037293255,0.00006531724,0.0000062286954,0.00001083243,0.00033792818,0.9927001,0.002541218,0.000016471833,0.0000030381866,0.00012700997],"about_ca_topic_score_codex":0.000005866961,"about_ca_topic_score_gemma":0.000016784406,"teacher_disagreement_score":0.2143884,"about_ca_system_score_codex":0.000021328506,"about_ca_system_score_gemma":0.000011243027,"threshold_uncertainty_score":0.29019433},"labels":[],"label_agreement":null},{"id":"W2032640896","doi":"10.1504/ijise.2006.009796","title":"A hybrid environment for real-time distributed manufacturing control benchmarking","year":2006,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmarking; Latency (audio); Scheduling (production processes); Computer science; Real-time Control System; Java; Benchmark (surveying); Control (management); Manufacturing execution system; Distributed computing; Embedded system; Real-time computing; Engineering; Manufacturing engineering; Computer-integrated manufacturing; Operating system; Operations management","score_opus":0.008964150340218162,"score_gpt":0.18751424784221696,"score_spread":0.1785500975019988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032640896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34388945,0.000346297,0.651585,0.000070650116,0.0036022123,0.00020397175,0.00015149075,0.00008427732,0.00006666016],"genre_scores_gemma":[0.992225,0.00005202393,0.0044945376,0.0000025204304,0.003130473,0.000009495469,0.000037500027,0.000024121398,0.000024355182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902445,0.000010485631,0.0005040706,0.000080020145,0.00023606681,0.00014489781],"domain_scores_gemma":[0.99956506,0.00012577153,0.00012879045,0.000046486846,0.000069178124,0.00006469943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027934636,0.0001303898,0.00022066178,0.00014931176,0.000026817308,0.00011042914,0.00012318803,0.00006954853,0.000010245151],"category_scores_gemma":[0.000029538525,0.0001230219,0.000076116165,0.000019849136,0.00000790535,0.00012395166,0.000010250471,0.00013931237,0.0000013257917],"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.000025123985,0.000008527854,0.000102650716,0.000010111323,0.00013789342,0.000018844445,0.000009498862,0.9957618,0.0015861028,0.000067312256,0.0003386262,0.001933512],"study_design_scores_gemma":[0.0021857969,0.00004548997,0.00017252874,0.00018350568,0.000034141685,0.00019552915,0.00001528812,0.9893149,0.0025380582,0.000014118854,0.005130678,0.00016997255],"about_ca_topic_score_codex":0.000018938994,"about_ca_topic_score_gemma":9.374606e-8,"teacher_disagreement_score":0.6483355,"about_ca_system_score_codex":0.00012954374,"about_ca_system_score_gemma":0.00001124396,"threshold_uncertainty_score":0.50166875},"labels":[],"label_agreement":null},{"id":"W2032740850","doi":"10.1287/opre.51.4.585.16095","title":"Operations and Shipment Scheduling of a Batch on a Flexible Machine","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Batch processing; Mathematical optimization; Dynamic programming; Heuristic; Sequence (biology); Job shop scheduling; Set (abstract data type); Operations research; Algorithm; Schedule; Mathematics; Artificial intelligence; Operating system","score_opus":0.057835699636865384,"score_gpt":0.34438555306586766,"score_spread":0.2865498534290023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032740850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7858681,0.0020225707,0.18496689,0.0008796477,0.00026559428,0.0008079866,0.00004000375,0.00024810957,0.024901072],"genre_scores_gemma":[0.8534333,0.00029366947,0.14516474,0.00001891426,0.000024131508,0.00007118432,0.00001828691,0.000020593268,0.0009551837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990844,0.000101598605,0.00018866803,0.00015106377,0.0002748526,0.0001994303],"domain_scores_gemma":[0.99942523,0.0000736955,0.00000277592,0.0002065653,0.00020282688,0.00008889154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062480255,0.000082876206,0.00010208712,0.0002549827,0.00029318748,0.0001170894,0.000078764555,0.00005324211,0.0002357862],"category_scores_gemma":[0.00026140982,0.000078849174,0.00001819017,0.00040140442,0.000048438735,0.00010376038,0.000017439184,0.00025627651,0.00004518878],"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.0000023223213,0.000046381065,0.000059064103,0.000014296706,0.000014328765,8.4293515e-7,0.00039335035,0.9834161,0.0021206343,0.013014834,0.00002548612,0.0008923531],"study_design_scores_gemma":[0.0002922961,0.00006030888,0.000057772126,0.000029063036,0.0000029350006,0.0000030133724,0.0003403057,0.9761698,0.022417672,0.00004255369,0.00049739936,0.00008688505],"about_ca_topic_score_codex":0.00005519962,"about_ca_topic_score_gemma":0.0001239488,"teacher_disagreement_score":0.06756517,"about_ca_system_score_codex":0.000044679655,"about_ca_system_score_gemma":0.00007181466,"threshold_uncertainty_score":0.32153758},"labels":[],"label_agreement":null},{"id":"W2034518184","doi":"10.1080/00207543.2014.974846","title":"Studying the effect of server side-constraints on the makespan of the no-wait flow-shop problem with sequence-dependent set-up times","year":2014,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Job shop scheduling; Benchmark (surveying); Computer science; Sequence (biology); Set (abstract data type); Scheduling (production processes); Mathematical optimization; Flow shop scheduling; Schedule; Mathematics; Operating system","score_opus":0.046388116559194906,"score_gpt":0.3200890932633548,"score_spread":0.2737009767041599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034518184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848212,0.00005953688,0.002325591,0.00756999,0.0022880211,0.0005978097,0.0000088231,0.000024177461,0.0023048364],"genre_scores_gemma":[0.997991,0.000023286226,0.00091079535,0.0000164703,0.0004851274,0.000011859238,0.0000010555577,0.00001737378,0.00054302724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99730307,0.00049538753,0.0003728812,0.000121161786,0.001558449,0.00014902561],"domain_scores_gemma":[0.9975372,0.00052225206,0.00019108811,0.0002588235,0.0014572503,0.00003341208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041249143,0.00010368967,0.0001448962,0.00017104977,0.00011410191,0.00006344399,0.00067600614,0.000037830487,0.00014664441],"category_scores_gemma":[0.0010217358,0.000046300862,0.00007948646,0.00027392787,0.00025016392,0.00011719606,0.000061026953,0.0006164777,0.000013345587],"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.00034449282,0.000048382888,0.002962787,0.00007775343,0.00055174984,0.0000040432315,0.0015455121,0.96755004,0.006680148,0.00061595434,0.0011576272,0.018461537],"study_design_scores_gemma":[0.004163422,0.0026432527,0.0067341286,0.0026921611,0.00015822297,0.0008045744,0.004514356,0.33766714,0.6369142,0.0013047133,0.0019013312,0.0005025368],"about_ca_topic_score_codex":0.000011685012,"about_ca_topic_score_gemma":0.0000068149157,"teacher_disagreement_score":0.630234,"about_ca_system_score_codex":0.0000956312,"about_ca_system_score_gemma":0.000074697185,"threshold_uncertainty_score":0.2678323},"labels":[],"label_agreement":null},{"id":"W2035028561","doi":"10.1080/07408170490257871","title":"Exact algorithms for the job sequencing and tool switching problem","year":2004,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canada Research Chairs","keywords":"Computer science; Algorithm","score_opus":0.019647533044199077,"score_gpt":0.23742910148012267,"score_spread":0.21778156843592358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035028561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008135054,0.0003148889,0.9899989,0.0004319248,0.00028708388,0.00026741563,0.000012246004,0.00034069552,0.00021181794],"genre_scores_gemma":[0.6572462,0.0002007012,0.3420937,0.00006747956,0.00011397639,0.00012915266,0.0000029788707,0.00004051513,0.00010532564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994902,0.000004814538,0.00014370128,0.000117091135,0.000071566385,0.00017261221],"domain_scores_gemma":[0.99970925,0.000092645474,0.000012517574,0.00011430865,0.00002895433,0.00004235105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011526063,0.0001055563,0.00008468035,0.00004643983,0.0003092152,0.000073124946,0.000064248336,0.000052603413,0.00002072726],"category_scores_gemma":[0.000006257692,0.00008529514,0.000052245727,0.00013046752,0.000017659097,0.00015555888,0.000001306782,0.00015605726,0.0000047829903],"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.00000233039,0.0000047530434,0.0000025344764,0.00002351066,0.00004068756,6.007513e-7,0.00081593666,0.960956,0.0006603062,0.00014348945,0.0000051739603,0.03734472],"study_design_scores_gemma":[0.00083696103,0.000026620408,0.000100198624,0.000045542016,0.00008391601,0.00004266478,0.0007283769,0.9932231,0.0031598627,0.0009243352,0.00060186576,0.0002265988],"about_ca_topic_score_codex":0.00004695871,"about_ca_topic_score_gemma":0.000037681744,"teacher_disagreement_score":0.6491111,"about_ca_system_score_codex":0.00007492426,"about_ca_system_score_gemma":0.000030542302,"threshold_uncertainty_score":0.3478235},"labels":[],"label_agreement":null},{"id":"W2035097950","doi":"10.1080/00207540412331282024","title":"Implementing global factory schedules in the face of stochastic disruptions","year":2005,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vale (Canada); PricewaterhouseCoopers (Canada)","funders":"Intel Corporation; National Science Foundation","keywords":"Factory (object-oriented programming); Face (sociological concept); Computer science; Operations management; Business; Operations research; Engineering; Manufacturing engineering","score_opus":0.0680261338510062,"score_gpt":0.4058154806756964,"score_spread":0.3377893468246902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035097950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85849434,0.00058466697,0.13418506,0.005095875,0.0010716994,0.00013371134,0.000013496662,0.000018224737,0.00040293354],"genre_scores_gemma":[0.99085325,0.000057913025,0.008322021,0.00000810004,0.00071806536,0.0000036972738,0.0000030014662,0.0000058088212,0.000028140514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846095,0.000091833936,0.0003764766,0.00007233917,0.0008306825,0.00016770614],"domain_scores_gemma":[0.9989861,0.000084493324,0.00007879348,0.00009101906,0.0007305272,0.000029054969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018699598,0.000053874726,0.000077662226,0.0002866292,0.000049748942,0.000048105714,0.00036786587,0.000027056625,0.00006632028],"category_scores_gemma":[0.000492932,0.000042062267,0.00004646888,0.0003274153,0.00005691843,0.00023685694,0.000033192984,0.00032571543,0.000009030742],"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.000023478819,0.0001003358,0.0015380465,0.000009036231,0.00006953215,0.000003484202,0.0009972784,0.9690578,0.0007843014,0.0012585026,0.00033204144,0.025826175],"study_design_scores_gemma":[0.004842113,0.00045826499,0.094709225,0.0009171827,0.00007663589,0.0012820781,0.05867278,0.795371,0.02125587,0.0070282565,0.014536199,0.00085040496],"about_ca_topic_score_codex":0.000009325289,"about_ca_topic_score_gemma":0.000029230534,"teacher_disagreement_score":0.1736868,"about_ca_system_score_codex":0.00018020057,"about_ca_system_score_gemma":0.000055935496,"threshold_uncertainty_score":0.17152496},"labels":[],"label_agreement":null},{"id":"W2035133691","doi":"10.1287/opre.48.1.177.12451","title":"Minimizing Cycle Time in a Blocking Flowshop","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blocking (statistics); Heuristic; Computer science; Set (abstract data type); Mathematical optimization; Throughput; Algorithm; Mathematics; Artificial intelligence","score_opus":0.02777353314887171,"score_gpt":0.3146552187995641,"score_spread":0.2868816856506924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035133691","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394111,0.0002662034,0.0016726295,0.00042000556,0.00006730444,0.00024300968,0.000005528672,0.00024102259,0.057673194],"genre_scores_gemma":[0.9239958,0.00017674785,0.06540516,0.000031848234,0.00015878692,0.00009483416,0.000030823274,0.000044558616,0.01006145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912983,0.00006658645,0.00015534747,0.0001409495,0.0002247785,0.00028251563],"domain_scores_gemma":[0.9996285,0.000059101436,0.0000011630632,0.00018318732,0.00006714367,0.00006091424],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004563697,0.00006454957,0.00007829047,0.00024726667,0.00017334742,0.00014182938,0.00012620934,0.00005640668,0.0035361391],"category_scores_gemma":[0.00006514691,0.00006921489,0.000017706147,0.00073456095,0.00002713514,0.00014040025,0.000014093543,0.00027688532,0.0014334978],"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.0000018087012,0.000018189523,0.00002365172,0.0000033272872,0.0000036918584,0.000005002477,0.00047645936,0.9825862,0.00088627345,0.000031198288,0.00021556129,0.015748644],"study_design_scores_gemma":[0.00018937263,0.000008157442,0.0001095167,0.000022720027,7.1860904e-7,0.0000030907388,0.00009153011,0.9975412,0.00077016634,0.000012192523,0.0011720425,0.00007929794],"about_ca_topic_score_codex":0.000057316174,"about_ca_topic_score_gemma":0.000086614295,"teacher_disagreement_score":0.063732535,"about_ca_system_score_codex":0.000070490554,"about_ca_system_score_gemma":0.000035159548,"threshold_uncertainty_score":0.999344},"labels":[],"label_agreement":null},{"id":"W2036072219","doi":"10.1109/cloudcom.2011.71","title":"Scoring System Utilization through Business Profiles","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Server; Cloud computing; Context (archaeology); Service provider; Risk analysis (engineering); Service (business); Data science; World Wide Web","score_opus":0.06888237322499688,"score_gpt":0.2306465252986177,"score_spread":0.16176415207362083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036072219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010637315,0.00012517371,0.87521756,0.0000040948707,0.000698787,0.000089830275,0.0000010775117,0.0015342308,0.11169194],"genre_scores_gemma":[0.7714331,0.00002933452,0.2281995,0.000010741155,0.00007960507,0.000014448498,0.000008334588,0.000026197162,0.00019875343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960434,0.000005742209,0.000121661375,0.00008793178,0.00006995762,0.000110335764],"domain_scores_gemma":[0.9997708,0.0000053321614,0.00001256379,0.00011515944,0.00007242883,0.000023672017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004061477,0.00007782591,0.00007487947,0.00003418548,0.000038021582,0.000018811326,0.00006250336,0.000044080116,0.00012702671],"category_scores_gemma":[0.000009311268,0.0000706445,0.00001383383,0.0002564252,0.000008618096,0.00017242636,0.0000092671935,0.000035284083,0.000093411836],"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.00002685005,0.00013250952,0.008988661,0.0021329054,0.00020280229,0.00003395575,0.009187967,0.78181237,0.0010878639,0.16508591,0.0014662097,0.02984197],"study_design_scores_gemma":[0.00022136881,0.0000068564746,0.003142466,0.00011121457,0.0000141695045,0.000011694896,0.0010601047,0.97035205,0.024511803,0.00006119116,0.0002671306,0.00023997453],"about_ca_topic_score_codex":0.000022444228,"about_ca_topic_score_gemma":0.0000013657459,"teacher_disagreement_score":0.7607958,"about_ca_system_score_codex":0.000024451989,"about_ca_system_score_gemma":0.000006504502,"threshold_uncertainty_score":0.28807992},"labels":[],"label_agreement":null},{"id":"W2036199750","doi":"10.1016/j.dam.2006.08.006","title":"Partially ordered knapsack and applications to scheduling","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"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":"Knapsack problem; Mathematics; Combinatorics; Continuous knapsack problem; Generalization; Scheduling (production processes); Bounded function; Discrete mathematics; Polynomial-time approximation scheme; Partially ordered set; Time complexity; Class (philosophy); Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.00967514078976895,"score_gpt":0.22611988469736596,"score_spread":0.21644474390759702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036199750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110327415,0.00009292226,0.9698119,0.000059744158,0.000034824236,0.00041660035,0.000009866557,0.00047298925,0.018068422],"genre_scores_gemma":[0.22664574,0.000015308462,0.77270776,0.000054822012,0.00015146707,0.0002429905,0.000034227727,0.000055082164,0.00009261013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922943,0.0000022556644,0.00026571515,0.00016414937,0.0001286337,0.00020983604],"domain_scores_gemma":[0.9995697,0.00004266729,0.000030311905,0.00023622626,0.000028693483,0.00009239763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008428919,0.00015560215,0.00017014089,0.000065987,0.0000841348,0.00008135401,0.00010407925,0.000065918524,0.000026744372],"category_scores_gemma":[0.000008394705,0.00015648897,0.000023855835,0.00023246212,0.000024670093,0.000035497513,0.000031256088,0.00008424386,0.00011790738],"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.0000031039028,0.000048732294,0.000018960976,0.00022130444,0.000033884982,8.5625226e-7,0.00048928946,0.83739305,0.005275818,0.15094765,0.0002610798,0.005306298],"study_design_scores_gemma":[0.00057552464,0.000014155666,0.00007877741,0.000046429108,0.000065452965,0.000007554202,0.0007360036,0.9636957,0.008120629,0.021491371,0.004519663,0.00064875686],"about_ca_topic_score_codex":0.0000021174,"about_ca_topic_score_gemma":0.0000057088314,"teacher_disagreement_score":0.215613,"about_ca_system_score_codex":0.000017178221,"about_ca_system_score_gemma":0.000008153268,"threshold_uncertainty_score":0.6381435},"labels":[],"label_agreement":null},{"id":"W2037780491","doi":"10.1007/s10951-009-0113-0","title":"Understanding the behavior of Solution-Guided Search for job-shop scheduling","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backtracking; Exploit; Constructive; Computer science; Beam stack search; Scheduling (production processes); Local search (optimization); Mathematical optimization; Search algorithm; Mathematics; Artificial intelligence; Beam search; Best-first search; Process (computing)","score_opus":0.10504197035125641,"score_gpt":0.3123846638750536,"score_spread":0.2073426935237972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037780491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23583698,0.00077766733,0.7619079,0.0004355976,0.0005727165,0.00020356035,0.0000031214086,0.000047578007,0.00021490287],"genre_scores_gemma":[0.7302015,0.00010618249,0.26924825,0.00004233267,0.0003586042,0.000004284625,0.0000012302745,0.000024279394,0.000013348461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983218,0.000037238064,0.00079210463,0.00011098467,0.0004162189,0.00032169308],"domain_scores_gemma":[0.9988357,0.00023833141,0.0002294658,0.00017506386,0.00040366687,0.0001177618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00134388,0.00016798836,0.00032329818,0.00026747392,0.0002073173,0.000082221726,0.00032339696,0.00012031034,0.000019067824],"category_scores_gemma":[0.00018170623,0.00013277582,0.00024387888,0.00037441167,0.000054186265,0.0002659408,0.000015988673,0.00044000533,0.0000019278507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027144242,0.00003695006,0.000489307,0.000038544767,0.00006766402,0.0000043894293,0.0005082781,0.9829693,0.012426808,0.0013876173,0.000043998592,0.0020000064],"study_design_scores_gemma":[0.0012230085,0.00016743093,0.00044777666,0.00026643532,0.00015425282,0.00011528785,0.0023680974,0.9783114,0.015962908,0.0007416933,0.000023474724,0.00021822088],"about_ca_topic_score_codex":0.0000012218868,"about_ca_topic_score_gemma":5.7656274e-7,"teacher_disagreement_score":0.4943645,"about_ca_system_score_codex":0.0001875263,"about_ca_system_score_gemma":0.0000980338,"threshold_uncertainty_score":0.54144406},"labels":[],"label_agreement":null},{"id":"W2039040122","doi":"10.1504/ejie.2011.039869","title":"An efficient hybrid algorithm for the two-machine no-wait flow shop problem with separable setup times and single server","year":2011,"lang":"en","type":"article","venue":"European J of Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Tabu search; Separable space; Job shop scheduling; Mathematical optimization; Algorithm; Variable neighborhood search; Computer science; Variable (mathematics); Branch and bound; Neighbourhood (mathematics); Mathematics; Metaheuristic","score_opus":0.020781175535914548,"score_gpt":0.19423571144111543,"score_spread":0.17345453590520088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039040122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04799189,0.00048537468,0.9456404,0.000017808716,0.0008912134,0.0008402518,0.00010847245,0.0007382402,0.0032863477],"genre_scores_gemma":[0.47019792,0.000016442667,0.528595,0.000015908152,0.00070424046,0.000027342232,0.000056064848,0.00021857896,0.0001685332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906176,0.000029926754,0.0002810532,0.00020951645,0.00014561471,0.00027210827],"domain_scores_gemma":[0.9994189,0.00007444602,0.00005104608,0.0002588762,0.000082764185,0.00011397461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043345263,0.00023240143,0.0002092247,0.00008564715,0.000073239506,0.00005438092,0.00020252798,0.000038539318,0.00004822443],"category_scores_gemma":[0.00003596956,0.00017701834,0.00004409265,0.00016962404,0.00003317584,0.000112124486,0.00003146471,0.000225686,0.000008060038],"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.00002280171,0.000036883524,0.000016333453,0.00002116251,0.00007590235,0.0000059370955,0.00023655992,0.9734309,0.0002381024,0.000017960687,0.0000880055,0.025809472],"study_design_scores_gemma":[0.001337469,0.00021650047,0.000015949912,0.00009081101,0.0000496919,0.000017116652,0.000044313958,0.9921001,0.005182823,9.95151e-7,0.0007052669,0.00023895307],"about_ca_topic_score_codex":0.000015396126,"about_ca_topic_score_gemma":8.923135e-7,"teacher_disagreement_score":0.422206,"about_ca_system_score_codex":0.00002415349,"about_ca_system_score_gemma":0.000013943785,"threshold_uncertainty_score":0.7218598},"labels":[],"label_agreement":null},{"id":"W2039338492","doi":"10.1063/1.4912428","title":"Improving the ADACOR2 supervisor holon scheduling mechanism with genetic algorithms","year":2015,"lang":"en","type":"article","venue":"AIP conference proceedings","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Supervisor; USable; Computer science; Scheduling (production processes); Workstation; Genetic algorithm; Job shop scheduling; Dynamic priority scheduling; Distributed computing; Algorithm; Mathematical optimization; Embedded system; Schedule; Routing (electronic design automation); Operating system","score_opus":0.024997089613584614,"score_gpt":0.21646558029927404,"score_spread":0.19146849068568944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039338492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30244756,0.00036085,0.69373107,0.00037873906,0.00039001493,0.0003408884,0.0000037096388,0.0008479911,0.0014991581],"genre_scores_gemma":[0.7972635,0.000041536205,0.2021411,0.00013082566,0.00019226574,0.00006754527,0.0000039944707,0.000059116785,0.00010012104],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861884,0.0000075696335,0.00024600886,0.000324744,0.00037205708,0.0004307896],"domain_scores_gemma":[0.99903053,0.000024230943,0.000063653206,0.0001695139,0.0004968283,0.0002152591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028381209,0.00027780977,0.00020940877,0.000091220434,0.00014576997,0.00031992188,0.000402879,0.00012379923,0.0000300203],"category_scores_gemma":[0.00008847685,0.00019997435,0.000037363912,0.0003594648,0.00007085651,0.00031496544,0.00006578603,0.00035323718,0.000057831563],"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.0005430159,0.0006324153,0.042804055,0.0018964618,0.0014729587,0.00020302791,0.12458566,0.27311367,0.12321175,0.04777057,0.002959008,0.38080743],"study_design_scores_gemma":[0.0005461557,0.00013593362,0.00017468486,0.00005977939,0.000040798426,0.0000580971,0.0037563918,0.9905497,0.0036016428,0.0006317944,0.000104641156,0.0003404053],"about_ca_topic_score_codex":0.000043438213,"about_ca_topic_score_gemma":0.0000045675783,"teacher_disagreement_score":0.717436,"about_ca_system_score_codex":0.00006771675,"about_ca_system_score_gemma":0.00010909298,"threshold_uncertainty_score":0.81547177},"labels":[],"label_agreement":null},{"id":"W2041242280","doi":"10.1016/j.endm.2010.05.151","title":"Scheduling flexible flowshops with unit-time operations and minimum time delays","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Heuristic; Unit (ring theory); Simple (philosophy); Execution time; Real-time computing; Mathematics; Parallel computing; Schedule","score_opus":0.006051890991454484,"score_gpt":0.22193491661081496,"score_spread":0.21588302561936049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041242280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79500204,0.00022331403,0.2026486,0.0001316684,0.00006449506,0.0002551805,0.0000091774555,0.00037984233,0.0012857065],"genre_scores_gemma":[0.5500898,0.000033104378,0.44931158,0.00002333741,0.00007084284,0.000030781448,0.000033452594,0.0000751065,0.00033202718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989332,0.000014066972,0.0002779133,0.00019067053,0.00015214257,0.00043203862],"domain_scores_gemma":[0.9993873,0.00016344528,0.000025747373,0.00029431758,0.00004538773,0.000083774765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002497948,0.00021979702,0.0002395285,0.0001346731,0.00009806066,0.00010780277,0.00015971878,0.00012101256,0.0001903717],"category_scores_gemma":[0.00012444705,0.00019461005,0.000027258277,0.0003306857,0.000065603694,0.00016047951,0.00003209804,0.00049996655,0.00009095403],"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.0000100173775,0.000068513735,0.00010969131,0.00010515663,0.00008746948,0.000005009403,0.0013306832,0.9672455,0.023049535,0.0064135524,0.000010997161,0.0015638724],"study_design_scores_gemma":[0.00036286123,0.00005968947,0.000011253695,0.000060077018,0.000027091834,0.00003469245,0.000060007013,0.99095625,0.006766124,0.0013548869,0.00003382403,0.0002732484],"about_ca_topic_score_codex":0.0000043643836,"about_ca_topic_score_gemma":0.000064748485,"teacher_disagreement_score":0.246663,"about_ca_system_score_codex":0.000036352405,"about_ca_system_score_gemma":0.00007147734,"threshold_uncertainty_score":0.79359674},"labels":[],"label_agreement":null},{"id":"W2041970045","doi":"10.1016/j.ejor.2005.12.013","title":"A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Simulated annealing; Tabu search; Mathematical optimization; Benchmark (surveying); Adaptive simulated annealing; Scheduling (production processes); Job shop scheduling; Parallel computing; Algorithm; Mathematics; Schedule","score_opus":0.09740541192268706,"score_gpt":0.35527291791973253,"score_spread":0.25786750599704544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041970045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97599447,0.00034335288,0.022548797,0.000103373495,0.0000523581,0.00028901055,0.0000040345535,0.00001124334,0.00065337174],"genre_scores_gemma":[0.9799947,0.0000041202593,0.019778077,0.000005958038,0.00015444674,9.2986795e-7,0.0000022128413,0.000020414775,0.000039128132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801606,0.0006760161,0.0005363841,0.000107461885,0.0005156113,0.00014844115],"domain_scores_gemma":[0.99807507,0.00064694876,0.00010618569,0.00011693701,0.000967118,0.00008776639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023146253,0.00010461924,0.00021299571,0.00026853383,0.00016655332,0.000072472234,0.00015292736,0.000016549957,0.000018650551],"category_scores_gemma":[0.00027839426,0.00007565669,0.00003933493,0.0004107613,0.00009564474,0.00008635522,0.00002736327,0.00044827996,0.000001866679],"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.00015305409,0.00014411323,0.00017605854,0.000012229225,0.000054398133,0.0003646372,0.0023090704,0.9953961,0.00020702086,0.00007704356,0.000074021096,0.0010322945],"study_design_scores_gemma":[0.0014989174,0.0010486406,0.0014339022,0.00010751787,0.000018377415,0.00009955439,0.005474601,0.9898013,0.0004210131,0.000011418196,0.000014024333,0.00007076327],"about_ca_topic_score_codex":0.000051082392,"about_ca_topic_score_gemma":0.000013071953,"teacher_disagreement_score":0.005594789,"about_ca_system_score_codex":0.000033306453,"about_ca_system_score_gemma":0.00013162784,"threshold_uncertainty_score":0.30851904},"labels":[],"label_agreement":null},{"id":"W2043498421","doi":"10.1080/00207543.2010.518993","title":"Complexity analysis of an operation in demand-based manufacturing","year":2010,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Production (economics); Computer science; Feature (linguistics); Learning curve; Demand patterns; Industrial engineering; Mathematical optimization; Operations research; Mathematics; Demand management; Economics; Engineering; Microeconomics","score_opus":0.07277452078611005,"score_gpt":0.3886822193291274,"score_spread":0.31590769854301737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043498421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98462766,0.000016701712,0.013566147,0.00054106815,0.0010714077,0.00005100523,0.0000036878698,0.00001318222,0.00010916585],"genre_scores_gemma":[0.9694349,0.000014431465,0.030185703,0.0000063017205,0.00031659714,0.0000019294564,0.000016301507,0.0000072868015,0.000016521737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986752,0.00008446543,0.00037492512,0.00009388757,0.0006746978,0.00009677183],"domain_scores_gemma":[0.9988513,0.000050568324,0.00007223114,0.000116686475,0.00085848663,0.000050744336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018105895,0.00005165662,0.00013045291,0.0016664286,0.00002878926,0.000050715593,0.00025763488,0.000045868936,0.00021298],"category_scores_gemma":[0.00024373965,0.000049085786,0.000056900964,0.00043273802,0.00006281333,0.00028210407,0.000012812966,0.00046681374,0.0000023658167],"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.000042793057,0.00008383046,0.0019970064,0.0000057898674,0.00014858418,0.000005713073,0.00016366385,0.9769961,0.01612567,0.00008791451,0.000020772777,0.004322164],"study_design_scores_gemma":[0.0003142175,0.00003465887,0.03180606,0.00001563608,0.000020252553,0.000012340587,0.00010954964,0.7796823,0.18766323,0.00018975521,0.0000981134,0.00005389995],"about_ca_topic_score_codex":0.00003359806,"about_ca_topic_score_gemma":0.00020320628,"teacher_disagreement_score":0.1973138,"about_ca_system_score_codex":0.00007001121,"about_ca_system_score_gemma":0.000051167826,"threshold_uncertainty_score":0.23319817},"labels":[],"label_agreement":null},{"id":"W2044003064","doi":"10.1007/s10601-009-9088-x","title":"A global constraint for total weighted completion time for unary resources","year":2009,"lang":"en","type":"article","venue":"Constraints","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"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":"Unary operation; Mathematical optimization; Constraint (computer-aided design); Computer science; Schedule; Job shop scheduling; Resource constraints; Scheduling (production processes); Constraint programming; Upper and lower bounds; Mathematics; Algorithm; Distributed computing; Discrete mathematics","score_opus":0.01036900503029169,"score_gpt":0.23317875355569895,"score_spread":0.22280974852540725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044003064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06251976,0.00016223842,0.925197,0.00040965845,0.00044273672,0.0008110561,0.0006789821,0.00080024404,0.008978293],"genre_scores_gemma":[0.7455343,0.0000032563773,0.2536619,0.00018837817,0.00022357036,0.000038200687,0.00021988091,0.000018634026,0.000111882044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992573,0.000010186187,0.00021615223,0.00017267531,0.000087468536,0.00025617887],"domain_scores_gemma":[0.9995951,0.000080646605,0.00003101941,0.00011012553,0.00008755539,0.00009552836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012020491,0.00014463451,0.00018153511,0.000044222143,0.00008584203,0.000045657278,0.00008598205,0.000099323915,0.00014031082],"category_scores_gemma":[0.000051078812,0.00015384727,0.000094979456,0.000111084526,0.00011874838,0.000050739607,0.000004994326,0.000047450594,0.000024667683],"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.0003215753,0.00031076555,0.00032633293,0.0002257925,0.00041454,0.000021784264,0.0010103547,0.13046582,0.0045753247,0.028633682,0.021952698,0.81174135],"study_design_scores_gemma":[0.0018087222,0.0001593719,0.0012133702,0.0000536999,0.000035231307,0.0000749739,0.00011556449,0.99135643,0.00030564857,0.0025391928,0.0020185104,0.0003192954],"about_ca_topic_score_codex":4.2474338e-7,"about_ca_topic_score_gemma":3.101122e-7,"teacher_disagreement_score":0.8608906,"about_ca_system_score_codex":0.00005924768,"about_ca_system_score_gemma":0.000025255067,"threshold_uncertainty_score":0.627371},"labels":[],"label_agreement":null},{"id":"W2044396877","doi":"10.1007/s00170-011-3554-5","title":"Scheduling a single machine to maintain a dynamic WIP profile in coordinated manufacturing chains","year":2011,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Time horizon; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Robustness (evolution); Discretization; Integer programming; Distributed computing; Dynamic priority scheduling; Algorithm; Mathematics; Computer network","score_opus":0.009784748860536102,"score_gpt":0.22898415174277015,"score_spread":0.21919940288223405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044396877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8523787,0.0001875835,0.14463514,0.0012576209,0.00085019396,0.00016919489,0.0000062396543,0.00024506703,0.00027021658],"genre_scores_gemma":[0.83622843,0.000057777994,0.16346563,0.00009603847,0.000047396672,0.000013929997,0.0000029808334,0.000039936156,0.000047886762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99867386,0.000021997108,0.00055703794,0.0001761969,0.0002446983,0.00032620062],"domain_scores_gemma":[0.9993272,0.00005800299,0.00019047398,0.0002307474,0.00012096593,0.0000726101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003212605,0.00021618811,0.0002654235,0.0010343159,0.00004861211,0.000032973057,0.0010157415,0.0001228411,0.00008053611],"category_scores_gemma":[0.00012500685,0.00017913051,0.0000743634,0.0002093843,0.00005685477,0.00019099849,0.00015644787,0.0006237616,0.000018042669],"study_design_candidate":"bench_or_experimental","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.00025823046,0.0001359656,0.00014471578,0.000020848587,0.00021604932,0.0003025769,0.00085471064,0.8694283,0.022835376,0.0005901726,0.000011262577,0.10520179],"study_design_scores_gemma":[0.0011894542,0.00014730236,0.0006411117,0.00024288337,0.0000156803,0.00054374547,0.00084758387,0.061150238,0.9296303,0.005111421,0.0001904693,0.00028984074],"about_ca_topic_score_codex":0.0000125336455,"about_ca_topic_score_gemma":0.000053154323,"teacher_disagreement_score":0.9067949,"about_ca_system_score_codex":0.00038307972,"about_ca_system_score_gemma":0.000022205986,"threshold_uncertainty_score":0.73047304},"labels":[],"label_agreement":null},{"id":"W2044612972","doi":"10.1016/j.procir.2014.01.072","title":"Robust Metaheuristics for Scheduling Cellular Flowshop with Family Sequence-Dependent Setup Times","year":2014,"lang":"en","type":"article","venue":"Procedia CIRP","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Metaheuristic; Particle swarm optimization; Mathematical optimization; Flow shop scheduling; Job shop scheduling; Computer science; Minification; Scheduling (production processes); Robustness (evolution); Profitability index; Algorithm; Mathematics; Schedule","score_opus":0.025559139184580755,"score_gpt":0.214669913453017,"score_spread":0.18911077426843625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044612972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016718455,0.00046256674,0.97917366,0.00006173605,0.00050148694,0.0003177426,0.00002444133,0.0006828175,0.0020571097],"genre_scores_gemma":[0.43485707,0.000046722635,0.5639872,0.00009724252,0.0004353621,0.000106499414,0.00007000956,0.00009848642,0.0003013793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885494,0.000013183931,0.00024367949,0.00029699598,0.00023950823,0.00035171252],"domain_scores_gemma":[0.99928564,0.000105709165,0.000048994625,0.00024427933,0.00017892715,0.00013642799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026895484,0.00023488128,0.00024617882,0.00009412767,0.000113665934,0.00009547576,0.0001941521,0.000113665854,0.000025830092],"category_scores_gemma":[0.00018281257,0.0002141641,0.00005491324,0.00018088002,0.000034346376,0.00012383104,0.000018030385,0.00017990224,0.00005377472],"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.000011351825,0.00001663735,0.00010479013,0.0001800422,0.000060212176,0.0000024460055,0.00017208303,0.99500763,0.001658591,0.0004899747,0.00019259148,0.0021036477],"study_design_scores_gemma":[0.000560972,0.000056833964,0.000014557986,0.00004499545,0.000081278784,0.000006583779,0.00011691075,0.9891715,0.008210595,0.00023569471,0.0011703017,0.00032974698],"about_ca_topic_score_codex":0.0000028818204,"about_ca_topic_score_gemma":0.0000023310622,"teacher_disagreement_score":0.41813862,"about_ca_system_score_codex":0.000044678764,"about_ca_system_score_gemma":0.000049317827,"threshold_uncertainty_score":0.8733359},"labels":[],"label_agreement":null},{"id":"W2046050612","doi":"10.1007/s00170-005-0190-y","title":"A neural network for dispatching rule selection in a job shop","year":2006,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial neural network; Job shop scheduling; Job shop; Selection (genetic algorithm); Computer science; Artificial intelligence; Flow shop scheduling; Machine learning; Operations research; Data mining; Engineering; Computer network","score_opus":0.004985739371800884,"score_gpt":0.22833544568317174,"score_spread":0.22334970631137085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046050612","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8841898,0.0002450661,0.113037705,0.0013692554,0.0008916861,0.000080961625,0.0000017768948,0.00012136296,0.00006242662],"genre_scores_gemma":[0.8959379,0.00003954533,0.10349559,0.00003916584,0.00042184888,0.000011133775,0.0000020518655,0.000018863067,0.00003385909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928474,0.000007805957,0.0003212639,0.00007447043,0.00013822317,0.00017346715],"domain_scores_gemma":[0.99964446,0.00008595569,0.00011768922,0.000056523546,0.00008182234,0.000013565882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000168715,0.00009508435,0.00012942002,0.00026436703,0.00004361718,0.000029185745,0.00037559573,0.000067573856,0.000006081082],"category_scores_gemma":[0.00004063752,0.00007650157,0.000057216792,0.000113417205,0.00002348849,0.00013526357,0.00002962876,0.00029617516,9.384334e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041625502,0.000009299998,0.00057555933,0.0000031748523,0.000025170111,0.0000060567977,0.000017371427,0.9781948,0.0015636396,0.0005332341,0.00008380805,0.018946316],"study_design_scores_gemma":[0.0024061669,0.0001119275,0.007371099,0.00016122122,0.00002640395,0.0006736814,0.00021471072,0.77614367,0.13225351,0.078113504,0.002207114,0.00031698853],"about_ca_topic_score_codex":0.0000073611673,"about_ca_topic_score_gemma":0.00005433524,"teacher_disagreement_score":0.20205107,"about_ca_system_score_codex":0.00012800875,"about_ca_system_score_gemma":0.000010766692,"threshold_uncertainty_score":0.31196436},"labels":[],"label_agreement":null},{"id":"W2046052560","doi":"10.1109/icsssm.2006.320611","title":"Selecting machines and buffers in unreliable series-parallel production lines","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Simulated annealing; Mathematical optimization; Computer science; Production line; Series (stratigraphy); Production (economics); Production rate; Series and parallel circuits; Decomposition; Failure rate; Algorithm; Reliability engineering; Mathematics; Engineering; Industrial engineering","score_opus":0.005187189726394836,"score_gpt":0.1951011468863728,"score_spread":0.18991395715997797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046052560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95603925,0.00080865895,0.03030619,0.00058450253,0.0008648582,0.00018976329,8.7376105e-7,0.0009848995,0.010221009],"genre_scores_gemma":[0.7463073,0.00012801627,0.24816793,0.000023422357,0.0003425414,0.000015698772,0.00001481233,0.000032885757,0.0049673896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960256,0.000006201669,0.00012040974,0.000108737644,0.00004574276,0.000116376774],"domain_scores_gemma":[0.99988824,0.000011106834,0.000009173199,0.000053438445,0.000021869131,0.000016196853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007580726,0.00007688774,0.00007460685,0.00007412879,0.000035225406,0.00002919529,0.000022712215,0.000036635312,0.000017872986],"category_scores_gemma":[0.000028039363,0.00007235152,0.000008333843,0.00022156238,0.000008929398,0.0001397109,0.0000057928332,0.000069304435,0.0000040880777],"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.0000032255277,0.0000071003374,0.008977961,0.000020930955,0.0000028532957,6.8021774e-7,0.00004478289,0.9884843,0.00076708256,0.00012233404,0.00045371449,0.0011150305],"study_design_scores_gemma":[0.00019758845,0.000009436932,0.0042238724,0.00001645007,0.000003213661,0.000016334092,0.00007031824,0.9917167,0.003040996,0.00025519577,0.0003101487,0.00013978312],"about_ca_topic_score_codex":0.00020764594,"about_ca_topic_score_gemma":0.00021853874,"teacher_disagreement_score":0.21786174,"about_ca_system_score_codex":0.000016319893,"about_ca_system_score_gemma":0.0000040836753,"threshold_uncertainty_score":0.29504094},"labels":[],"label_agreement":null},{"id":"W2046059743","doi":"10.1016/j.cor.2005.02.047","title":"Multi-item dynamic production-distribution planning in process industries with divergent finishing stages","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":72,"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":"Bottleneck; Mathematical optimization; Computer science; Production (economics); Process (computing); Linear programming; Production planning; Piecewise linear function; Integer programming; Piecewise; Mathematics","score_opus":0.05081746576595451,"score_gpt":0.3466062186514448,"score_spread":0.2957887528854903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046059743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6861785,0.00027090276,0.3120102,0.00072774757,0.0001870091,0.00036652692,0.000016044838,0.00021412672,0.000028937648],"genre_scores_gemma":[0.93445104,0.00003909411,0.06491095,0.00000950953,0.00010846832,0.00008603783,0.00020101311,0.000021028447,0.00017286692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988286,0.00007052978,0.00020919382,0.0002511076,0.00032660319,0.00031398074],"domain_scores_gemma":[0.9993846,0.000061362625,0.000009066517,0.00017123604,0.00029981538,0.00007393236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072058,0.000116955765,0.00010903344,0.00025083852,0.0003527988,0.00025972835,0.00017823801,0.00007352883,0.000014515763],"category_scores_gemma":[0.00015240093,0.000112493406,0.000011715294,0.0009686581,0.00006633751,0.00046369704,0.000040314302,0.0005190828,0.000016616157],"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.0000055609403,0.000049157097,0.003185439,0.000020519265,0.000013131113,0.000004204623,0.0017421308,0.9892331,0.00007402116,0.000013911492,0.00026250168,0.005396319],"study_design_scores_gemma":[0.00031746336,0.000028595043,0.005300047,0.0001231323,0.000002082535,0.000005670021,0.0009234867,0.9916814,0.0012637859,0.000001094338,0.0002157467,0.0001375267],"about_ca_topic_score_codex":0.000021142398,"about_ca_topic_score_gemma":0.00012896379,"teacher_disagreement_score":0.24827252,"about_ca_system_score_codex":0.00026559012,"about_ca_system_score_gemma":0.000109840614,"threshold_uncertainty_score":0.45873478},"labels":[],"label_agreement":null},{"id":"W2046678043","doi":"10.1016/j.ejor.2005.02.077","title":"Integrated production and material handling scheduling using mathematical programming and constraint programming","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":128,"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":"Computer science; Constraint programming; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Resource constraints; Industrial engineering; Stochastic programming; Distributed computing; Mathematics; Engineering; Schedule","score_opus":0.06525778728490876,"score_gpt":0.32527964883993704,"score_spread":0.26002186155502827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046678043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9018309,0.0004170494,0.09681023,0.0003610855,0.00017575316,0.00018176361,0.0000018375587,0.000044657765,0.00017672927],"genre_scores_gemma":[0.5551499,0.00004200099,0.44427156,0.000004892559,0.00049086387,0.0000011497483,0.0000023720252,0.000021326174,0.000015940803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985174,0.00024053788,0.0004542841,0.00013709486,0.00041636635,0.00023430053],"domain_scores_gemma":[0.99910605,0.00007129917,0.000051819767,0.00006352145,0.000560439,0.00014684888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033421873,0.00011183227,0.00015062142,0.00024298632,0.00024727633,0.0004915108,0.000084594365,0.00002922674,0.000044115008],"category_scores_gemma":[0.0006420422,0.00009550195,0.000023862394,0.00019535438,0.00016746768,0.00035432124,0.000039588205,0.00044514652,0.000005400796],"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.00013017854,0.00015168879,0.00042730462,0.00021053081,0.00017662851,0.0001243496,0.0032877335,0.54814976,0.053248517,0.001974967,0.000054690423,0.39206365],"study_design_scores_gemma":[0.0007114741,0.00019887566,0.00015844287,0.00073741213,0.00002584085,0.0016857884,0.0020995608,0.9834367,0.008718951,0.000047541176,0.0019220446,0.0002573828],"about_ca_topic_score_codex":7.88453e-7,"about_ca_topic_score_gemma":5.3917444e-7,"teacher_disagreement_score":0.4352869,"about_ca_system_score_codex":0.00006878485,"about_ca_system_score_gemma":0.000078494886,"threshold_uncertainty_score":0.473965},"labels":[],"label_agreement":null},{"id":"W2049188596","doi":"10.1016/j.cor.2012.11.017","title":"Efficient symmetry breaking formulations for the job grouping problem","year":2012,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Solver; Set (abstract data type); Reduction (mathematics); Computer science; Symmetry breaking; Mathematical optimization; Relaxation (psychology); Variable (mathematics); Order (exchange); Upper and lower bounds; Symmetry (geometry); Mathematics; Algorithm; Combinatorics","score_opus":0.059079703233797375,"score_gpt":0.34241495667157845,"score_spread":0.2833352534377811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049188596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01933503,0.0006421097,0.9774075,0.00047312016,0.00056972477,0.0006811502,0.0000066671873,0.000186757,0.0006979205],"genre_scores_gemma":[0.72877944,0.00001390932,0.27041993,0.00003184664,0.0004108884,0.00020148452,0.000019056717,0.000026804973,0.00009665846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988836,0.00005378867,0.00019849418,0.00012623315,0.00027101726,0.00046684913],"domain_scores_gemma":[0.99884474,0.0005369244,0.0000065068953,0.0002526118,0.00026093892,0.00009827741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983386,0.00009539459,0.000085217915,0.00021542369,0.001057406,0.00026443374,0.00023627895,0.000053050753,0.000017935638],"category_scores_gemma":[0.00007896328,0.00007575136,0.000052611234,0.00062843336,0.000048852093,0.00013182304,0.00006978578,0.00024940877,0.000040805993],"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.0000011757002,0.00002172809,0.00008010031,0.000017898428,0.000025470828,8.442013e-8,0.0008351979,0.9744177,0.00008068618,0.01185924,0.00063176197,0.012028993],"study_design_scores_gemma":[0.00018461079,0.00001530826,0.00053440704,0.000026293661,0.000007036023,0.0000045975303,0.0001964819,0.99738425,0.00014144156,0.000027293814,0.0013816479,0.00009663101],"about_ca_topic_score_codex":0.000021038159,"about_ca_topic_score_gemma":0.000010452193,"teacher_disagreement_score":0.7094444,"about_ca_system_score_codex":0.00011309749,"about_ca_system_score_gemma":0.00003216652,"threshold_uncertainty_score":0.8132819},"labels":[],"label_agreement":null},{"id":"W2049333831","doi":"10.1111/itor.12056","title":"A new hybrid parallel genetic algorithm for the job‐shop scheduling problem","year":2013,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Crossover; Tabu search; Computer science; Mathematical optimization; Job shop scheduling; Genetic algorithm; Algorithm; Local search (optimization); Scheduling (production processes); Mathematics; Artificial intelligence; Schedule","score_opus":0.04438914968532886,"score_gpt":0.33320812557028884,"score_spread":0.28881897588495997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049333831","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007466216,0.00031385207,0.99169457,0.0040973118,0.0006291749,0.00083465263,0.000032940934,0.000086711996,0.0015641593],"genre_scores_gemma":[0.06229002,0.00038530148,0.92977875,0.000093774506,0.0005151341,0.001453247,0.000046474674,0.000044505254,0.0053927605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833524,0.000046143705,0.00036175884,0.00024416973,0.0006777054,0.0003349791],"domain_scores_gemma":[0.9984715,0.0006268053,0.00001437114,0.00016545449,0.00061775907,0.00010408964],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048341692,0.00013643758,0.00010398908,0.00033527153,0.0002908415,0.00036809055,0.0004444696,0.00006808629,0.0024440219],"category_scores_gemma":[0.000071589355,0.000117316325,0.000077166675,0.00034813464,0.00006156055,0.00035790663,0.000011664305,0.00047659557,0.00019471886],"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.0000051090556,0.00002566156,0.000030461904,0.00000508493,0.000060135957,0.0000010824338,0.000111636306,0.8578354,0.00007272651,0.00060239446,0.0008051884,0.1404451],"study_design_scores_gemma":[0.0006372664,0.000020303909,0.0005072021,0.0000247289,0.0000044328935,0.000019019737,0.00019038748,0.99280804,0.0002935275,0.0016804149,0.0036841577,0.00013050623],"about_ca_topic_score_codex":0.0002868888,"about_ca_topic_score_gemma":0.000055109474,"teacher_disagreement_score":0.1403146,"about_ca_system_score_codex":0.00021290297,"about_ca_system_score_gemma":0.00021228637,"threshold_uncertainty_score":0.99846786},"labels":[],"label_agreement":null},{"id":"W2049723152","doi":"10.5267/j.dsl.2013.04.005","title":"Scheduling stochastic two-machine flow shop problems to minimize expected makespan","year":2013,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Flow shop scheduling; Minification; Scheduling (production processes); Computer science; Heuristic; Stochastic process; Mathematics; Schedule; Statistics","score_opus":0.013723413056224524,"score_gpt":0.24776886527400835,"score_spread":0.23404545221778383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049723152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2926759,0.000037633905,0.7047004,0.0010993547,0.00079210504,0.00026971247,0.0000025288887,0.00032842674,0.00009391097],"genre_scores_gemma":[0.44679928,0.0000014107636,0.5516944,0.0013066308,0.000087300505,0.000058263922,0.0000032526584,0.00002846995,0.000021008882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768203,0.000017128867,0.00039164737,0.0005027507,0.00083052326,0.00057591166],"domain_scores_gemma":[0.998733,0.00019870912,0.00003928172,0.00048366154,0.00015547125,0.00038987113],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004689111,0.00023175153,0.00021822428,0.00059519935,0.00024058123,0.0004594633,0.0006706529,0.00004702033,0.00029427966],"category_scores_gemma":[0.0005323048,0.0002065003,0.000057631274,0.001908172,0.00013048103,0.0005275669,0.00010119973,0.00020757748,0.00092778704],"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.0000030645722,0.00000883868,0.00006556718,0.0000024762307,0.0000037627847,0.000002073512,0.00043598705,0.9478954,0.031038363,0.000005896119,0.000386552,0.02015202],"study_design_scores_gemma":[0.00042892664,0.0000125910055,0.00059095706,0.000063011656,0.000004363565,0.000009684894,0.00013660865,0.9973301,0.0010424384,0.00004539968,0.000051734733,0.00028417524],"about_ca_topic_score_codex":0.000015942118,"about_ca_topic_score_gemma":0.000002642739,"teacher_disagreement_score":0.15412335,"about_ca_system_score_codex":0.00011434265,"about_ca_system_score_gemma":0.000026694957,"threshold_uncertainty_score":0.9998501},"labels":[],"label_agreement":null},{"id":"W2050014461","doi":"10.5539/jmr.v4n1p101","title":"A Stochastic Model for Reserve Inventory Between Machines in","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inventory investment; Mathematics; Buffer stock scheme; Stock (firearms); Inventory control; Control (management); Mathematical optimization; Process (computing); Production (economics); Computer science; Operations research; Econometrics; Economics; Artificial intelligence; Engineering","score_opus":0.19229586227593248,"score_gpt":0.4038069536010173,"score_spread":0.21151109132508483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050014461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25935692,0.0006703389,0.7392965,0.000119982025,0.00012569976,0.00017106842,0.000004698045,0.000016930228,0.0002378943],"genre_scores_gemma":[0.7810879,0.000024831697,0.2183489,0.0000028223349,0.0003260682,0.000011991308,0.0000012960048,0.000033424465,0.00016277365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987534,0.0000389658,0.00040780564,0.00003847959,0.0004496094,0.0003117288],"domain_scores_gemma":[0.9990368,0.0004172805,0.00005745098,0.00011219135,0.00023728138,0.00013899103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034790784,0.00006966277,0.00020043741,0.00045130495,0.000035729794,0.000029293493,0.00021039706,0.0000656267,0.000011500906],"category_scores_gemma":[0.00075421407,0.000058435322,0.000059559497,0.00021661058,0.000024260911,0.00016618322,0.000028741833,0.00040352644,0.0000070370684],"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.000009880695,0.00012659878,0.0013804795,0.00035684605,0.00004484402,0.0000013026436,0.003976564,0.99162537,0.00008401836,0.0005466719,0.0011662535,0.00068119646],"study_design_scores_gemma":[0.00035936674,0.000027435668,0.000053511358,0.00012007347,0.0000073395554,0.0000066691873,0.00028993736,0.9933355,0.000063997744,0.0056660525,0.000013443195,0.00005666814],"about_ca_topic_score_codex":0.0000014664535,"about_ca_topic_score_gemma":0.0000025482987,"teacher_disagreement_score":0.52173096,"about_ca_system_score_codex":0.00009977587,"about_ca_system_score_gemma":0.000042971682,"threshold_uncertainty_score":0.23829232},"labels":[],"label_agreement":null},{"id":"W2050028837","doi":"10.1016/j.ejor.2006.06.004","title":"On-line supply chain scheduling problems with preemption","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Preemption; Competitive analysis; Computer science; Scheduling (production processes); Supply chain; Total cost; Operations research; Holding cost; Lead time; Supply chain management; Online algorithm; Mathematical optimization; Operations management; Business; Microeconomics; Algorithm; Marketing; Economics; Mathematics; Upper and lower bounds; Operating system","score_opus":0.04593923085254975,"score_gpt":0.2958616965913797,"score_spread":0.24992246573882992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050028837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57303804,0.00064936554,0.4008279,0.0014305634,0.00030429836,0.00028028115,0.000010295225,0.00009394258,0.023365313],"genre_scores_gemma":[0.933429,0.000046424677,0.065033,0.00002879953,0.00073327235,0.0000024972069,0.000019833844,0.000045552297,0.0006615907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.0002699607,0.00036395228,0.000108604574,0.00085519685,0.00021924301],"domain_scores_gemma":[0.99888694,0.0001327458,0.000046186007,0.00010645509,0.00073330116,0.00009437759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024320157,0.00010256968,0.00011038803,0.00031960884,0.00015640933,0.00017709892,0.00019129465,0.000020302747,0.0001510921],"category_scores_gemma":[0.00013683065,0.000078714686,0.00003556841,0.0003214567,0.00005401987,0.00020431502,0.000016084912,0.00054891413,0.000106438914],"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.000043798267,0.000052010924,0.0001452261,0.000011720327,0.000018709468,0.000055986027,0.00008215564,0.9949314,0.0010806733,0.0017241462,0.0007889122,0.0010652639],"study_design_scores_gemma":[0.0018984957,0.0011783205,0.003255296,0.00037885248,0.0000077923905,0.00019516575,0.00010434548,0.9881393,0.0026328538,0.0002731432,0.0017044103,0.0002320286],"about_ca_topic_score_codex":0.0000022328263,"about_ca_topic_score_gemma":0.000002259729,"teacher_disagreement_score":0.360391,"about_ca_system_score_codex":0.00007498886,"about_ca_system_score_gemma":0.00008292777,"threshold_uncertainty_score":0.3209892},"labels":[],"label_agreement":null},{"id":"W2051723428","doi":"10.5267/j.ijiec.2013.02.002","title":"An imperialist competitive algorithm for a bi-objective parallel machine scheduling problem with load balancing consideration","year":2013,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Imperialist competitive algorithm; Mathematical optimization; Computer science; Scheduling (production processes); Load balancing (electrical power); Job shop scheduling; Algorithm; Mathematics; Optimization problem; Multi-swarm optimization; Schedule","score_opus":0.01238465732272886,"score_gpt":0.243074439820891,"score_spread":0.23068978249816213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051723428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018095938,0.00007933675,0.97914755,0.0002653829,0.0017158365,0.00039587542,0.0000588621,0.00015636993,0.00008482393],"genre_scores_gemma":[0.4094534,0.000009864401,0.5892723,0.00003055922,0.0010718821,0.000040364703,0.00007373242,0.0000420417,0.000005868756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861616,0.000027850649,0.0005937102,0.00014948414,0.0004125711,0.00020025304],"domain_scores_gemma":[0.9975826,0.00025624988,0.00020934708,0.000080894184,0.0017231806,0.00014768398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025641153,0.00021451742,0.00027145608,0.00031403557,0.00008341143,0.0003358357,0.00022760162,0.00011352802,0.00003719095],"category_scores_gemma":[0.00015109361,0.00020187232,0.00008751731,0.00019733791,0.00002878703,0.0006688487,0.000013206178,0.00034931037,0.0000045121683],"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.00002466282,0.000045180797,0.000070542046,0.000005345805,0.00030218947,0.000007748336,0.00036529225,0.9877825,0.00051622116,0.00064696604,0.00007337219,0.010159986],"study_design_scores_gemma":[0.0027023812,0.0002079665,0.000095666655,0.00018411336,0.00003872239,0.00014488323,0.00026999682,0.9952145,0.0005815864,0.00017823337,0.0001508748,0.00023105743],"about_ca_topic_score_codex":0.000057847643,"about_ca_topic_score_gemma":0.000007745276,"teacher_disagreement_score":0.39135745,"about_ca_system_score_codex":0.00031560124,"about_ca_system_score_gemma":0.00022279834,"threshold_uncertainty_score":0.82321143},"labels":[],"label_agreement":null},{"id":"W2052122947","doi":"10.3166/jesa.43.513-535","title":"Architecture de systèmes contrôlés par le produit pour un environnement de juste à temps","year":2009,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Architecture; Flexibility (engineering); Automation; Computer science; Context (archaeology); Product (mathematics); Manufacturing engineering; Engineering; Mathematics","score_opus":0.010454005305512324,"score_gpt":0.2223959224000664,"score_spread":0.21194191709455407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052122947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1481095,0.05406917,0.7725734,0.015460988,0.0022053379,0.0007851115,0.000068133755,0.0010969174,0.0056314184],"genre_scores_gemma":[0.56406194,0.001979685,0.42665994,0.00053535355,0.0018164236,0.00001759149,0.000010399546,0.00017615432,0.00474251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953773,0.0008321799,0.0012453242,0.0004666132,0.0006277547,0.0014508493],"domain_scores_gemma":[0.9977897,0.00020176753,0.0005127165,0.00050986756,0.00020169746,0.00078428764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014798596,0.0007103257,0.0008044938,0.0003616584,0.00081349845,0.00073285354,0.0006261985,0.00037924718,0.0004405882],"category_scores_gemma":[0.00047848333,0.00071237143,0.0003780278,0.00047222959,0.00017187651,0.0003755256,0.00006755466,0.0012922888,0.00026861674],"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.00002215207,0.00027536397,0.0005884206,0.00045985932,0.00039803528,0.0006974673,0.0033642973,0.5607761,0.0019921572,0.003017413,0.002581769,0.42582697],"study_design_scores_gemma":[0.0041675153,0.0006246945,0.18331733,0.0039737774,0.00071567117,0.015711721,0.0011768986,0.7502195,0.0060628993,0.024651563,0.007676162,0.0017022184],"about_ca_topic_score_codex":0.000090651105,"about_ca_topic_score_gemma":0.000014365536,"teacher_disagreement_score":0.42412475,"about_ca_system_score_codex":0.0012126,"about_ca_system_score_gemma":0.0006287744,"threshold_uncertainty_score":0.99953276},"labels":[],"label_agreement":null},{"id":"W2052776381","doi":"10.1108/13552510510601348","title":"Optimal design of series production lines with unreliable machines and finite buffers","year":2005,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec; Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Mathematical optimization; Series (stratigraphy); Production line; Optimal design; Heuristic; Computer science; Production (economics); Constraint (computer-aided design); Ant colony optimization algorithms; Ant colony; Engineering; Mathematics","score_opus":0.015711455222996988,"score_gpt":0.2395742402575183,"score_spread":0.2238627850345213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052776381","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36405003,0.0007498601,0.63432,0.00042699784,0.00030553315,0.00007953103,0.0000019268432,0.000048927664,0.000017141729],"genre_scores_gemma":[0.4726355,0.00048552832,0.5266063,0.000009962919,0.00016423281,0.0000027790072,5.957277e-7,0.000022174825,0.00007290471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991217,0.000022930482,0.00047292016,0.000078203135,0.00014901662,0.000155199],"domain_scores_gemma":[0.9995057,0.000104846484,0.000119353535,0.00008460518,0.00013884826,0.000046652134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007036846,0.0001262744,0.00026752884,0.00017432697,0.000014661272,0.000017893291,0.00007392368,0.00004610106,0.000006356],"category_scores_gemma":[0.0003642335,0.00010307701,0.000027540133,0.00022456948,0.000028670145,0.00035461818,0.000007798945,0.00021349853,4.93315e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006919039,0.000014871337,0.0004327341,0.00011840458,0.000027196042,0.000003662178,0.0005222068,0.995973,0.0020580182,0.000033609263,0.00003617294,0.0007109387],"study_design_scores_gemma":[0.0005300231,0.000106347026,0.0015191804,0.00045427767,0.000013748011,0.00010278458,0.00033715434,0.9903373,0.006274009,0.000014047329,0.00013833633,0.00017276475],"about_ca_topic_score_codex":0.0000038973535,"about_ca_topic_score_gemma":0.0000025882848,"teacher_disagreement_score":0.10858547,"about_ca_system_score_codex":0.00004817502,"about_ca_system_score_gemma":0.00001806661,"threshold_uncertainty_score":0.42033583},"labels":[],"label_agreement":null},{"id":"W2052916058","doi":"10.1016/j.cor.2009.02.022","title":"Scheduling identical parallel machines and operators within a period based changing mode","year":2009,"lang":"en","type":"article","venue":"Computers & Operations Research","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":"Université du Québec à Chicoutimi; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Job shop scheduling; Computer science; Scheduling (production processes); Operator (biology); Mathematical optimization; Heuristic; Mathematics; Artificial intelligence; Schedule","score_opus":0.03143613342911021,"score_gpt":0.33225399679858925,"score_spread":0.300817863369479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052916058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23939343,0.00032505897,0.75832415,0.0011610122,0.00020364311,0.00022018321,0.0000034034329,0.00025323802,0.000115888855],"genre_scores_gemma":[0.61015534,0.000020848134,0.3894629,0.0001229346,0.00012378547,0.000019781271,0.000021135076,0.000019030746,0.000054247354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860364,0.00010322279,0.00026358088,0.0002744638,0.0003429613,0.00041214272],"domain_scores_gemma":[0.99931973,0.000060778988,0.0000059385043,0.00023204439,0.00019470819,0.00018680443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059290836,0.00015623777,0.00016489964,0.0005208525,0.0005932976,0.00064319844,0.00020410687,0.00008280698,0.000027693883],"category_scores_gemma":[0.00010231606,0.0001536157,0.000035226312,0.0007014592,0.00007628969,0.00024823952,0.000052150284,0.0004112059,0.000025876629],"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.0000046628443,0.000025794725,0.000054212065,0.000012436079,0.000011673228,0.000009544087,0.0011772825,0.9929201,0.00066935644,0.0021188254,0.000045778237,0.0029503542],"study_design_scores_gemma":[0.0004103742,0.000049143884,0.000132841,0.00005558117,0.0000042361066,0.000012422594,0.0002459951,0.9985259,0.00031882705,0.000048907834,0.000024033296,0.00017174489],"about_ca_topic_score_codex":0.000012542363,"about_ca_topic_score_gemma":0.000011197035,"teacher_disagreement_score":0.3707619,"about_ca_system_score_codex":0.00006201821,"about_ca_system_score_gemma":0.000070944276,"threshold_uncertainty_score":0.62642664},"labels":[],"label_agreement":null},{"id":"W2052949763","doi":"10.3182/20060517-3-fr-2903.00029","title":"USING JOHNSON'S ALGORITHM TO APPROXIMATE SOME FLOW SHOP SCHEDULING PROBLEMS WITH UNAVAILABILITY PERIODS","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Unavailability; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Scheduling (production processes); Computer science; Focus (optics); Heuristic; Flow (mathematics); Algorithm; Time complexity; Mathematics","score_opus":0.01298295494278786,"score_gpt":0.21975555999919244,"score_spread":0.20677260505640457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052949763","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5500672,0.000829604,0.44393492,0.00015419774,0.00043345062,0.00083046395,0.00003208413,0.0021362575,0.0015818332],"genre_scores_gemma":[0.13248578,0.000025556232,0.8664372,0.000053514617,0.0005045291,0.00009150554,0.000018788505,0.00014110669,0.0002420216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977358,0.000007463277,0.00045808993,0.000608286,0.00045188807,0.0007384762],"domain_scores_gemma":[0.99911845,0.000017890443,0.000082988125,0.00020546351,0.00034623934,0.00022895368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033976632,0.00045619634,0.0004269068,0.0002602422,0.0002757647,0.00043406116,0.0002818478,0.0001860814,0.00005515234],"category_scores_gemma":[0.000046910365,0.0004376656,0.000085214386,0.0008303326,0.00009405962,0.00073683873,0.00007112591,0.0003275936,0.000046164758],"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.000014538942,0.00007306338,0.0038063044,0.00030314253,0.000056324247,0.0000041165013,0.00063449034,0.9814469,0.0025267892,0.00014944487,0.00024387197,0.010740991],"study_design_scores_gemma":[0.00047542973,0.00006586992,0.0002820012,0.00016347297,0.0000415195,0.00003310118,0.00029697068,0.9926406,0.0041770544,0.00022511347,0.0009633516,0.00063549867],"about_ca_topic_score_codex":0.000063519605,"about_ca_topic_score_gemma":0.000006276314,"teacher_disagreement_score":0.42250228,"about_ca_system_score_codex":0.00024042347,"about_ca_system_score_gemma":0.00005650448,"threshold_uncertainty_score":0.99980754},"labels":[],"label_agreement":null},{"id":"W2053052668","doi":"10.1007/s10951-007-0015-y","title":"Optimal due date assignment in multi-machine scheduling environments","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Scheduling (production processes); Due date; Single-machine scheduling; Assignment problem; Time complexity; Job shop scheduling; Generalized assignment problem; Weapon target assignment problem; Function (biology); Mathematics; Algorithm; Schedule","score_opus":0.01833816959217388,"score_gpt":0.2556672366537828,"score_spread":0.23732906706160894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053052668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38655782,0.001033732,0.61163336,0.000039357834,0.00053563266,0.000059983933,0.0000015224405,0.00003239931,0.00010618494],"genre_scores_gemma":[0.5567696,0.0001630505,0.44285178,0.00003385378,0.00012165329,8.6701715e-7,0.000002698498,0.000034266715,0.000022233518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789125,0.00003326883,0.0010129513,0.00016853695,0.00044345774,0.00045053713],"domain_scores_gemma":[0.99920565,0.00010084741,0.00024407789,0.00016901246,0.00004411326,0.00023630219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017245939,0.00024244945,0.00037562614,0.00044838118,0.00006772335,0.00006071322,0.0002762175,0.00015088542,0.000061106424],"category_scores_gemma":[0.0001291526,0.00023673476,0.00012316424,0.00030151266,0.00003415587,0.00037775227,0.00004381872,0.0007633475,0.000027611799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004296114,0.00010190615,0.0022575075,0.000017597698,0.000058898862,0.00018195271,0.00031698062,0.9868846,0.00726524,0.000014380709,0.0000015600754,0.0028563952],"study_design_scores_gemma":[0.0020922618,0.000060493127,0.0025450273,0.00020205995,0.00003083992,0.0001428243,0.00062677375,0.96778727,0.025962267,0.000007357848,0.0002447659,0.00029808612],"about_ca_topic_score_codex":0.0000036533754,"about_ca_topic_score_gemma":0.0000042086313,"teacher_disagreement_score":0.17021176,"about_ca_system_score_codex":0.00019362911,"about_ca_system_score_gemma":0.00003103835,"threshold_uncertainty_score":0.9653764},"labels":[],"label_agreement":null},{"id":"W2053855832","doi":"10.1007/s10479-006-0148-y","title":"Coordinating decentralized local schedulers in complex supply chain manufacturing","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scheduling (production processes); Computer science; Supply chain; Theory of computation; Distributed computing; Schedule; Production schedule; Dynamic priority scheduling; Job shop scheduling; Production planning; Industrial engineering; Production (economics); Operations management; Engineering; Business; Algorithm","score_opus":0.10344290171120704,"score_gpt":0.3753957638955624,"score_spread":0.2719528621843553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053855832","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9307402,0.00059329637,0.062228028,0.002118305,0.00007542082,0.00038314244,0.000025166028,0.00013741278,0.0036990289],"genre_scores_gemma":[0.97277266,0.00010047162,0.026759436,0.00002463856,0.00005339305,0.00003150099,0.00008695223,0.000022771883,0.00014817309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863654,0.000111831665,0.00034152417,0.00015164212,0.00034341315,0.00041503974],"domain_scores_gemma":[0.9994205,0.00009616663,0.000008928759,0.00017076537,0.00023887299,0.00006476313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007917135,0.00009773719,0.00015779675,0.0004384101,0.00013969249,0.00008196556,0.00017229984,0.00006868304,0.00026457358],"category_scores_gemma":[0.00008428449,0.000104623745,0.000038025544,0.0005063272,0.000107332584,0.00016178338,0.00003346199,0.00027613036,0.000027214988],"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.000005505913,0.000044415912,0.0003573353,0.000023929864,0.000008723761,0.0000042237225,0.000119546115,0.992227,0.001103039,0.0010386347,0.00105494,0.0040126666],"study_design_scores_gemma":[0.0003848386,0.000018830739,0.0048849937,0.000036929872,8.7285514e-7,0.0000017603325,0.00040753375,0.94137704,0.052215803,0.00008053275,0.00048403317,0.00010679914],"about_ca_topic_score_codex":0.0007329223,"about_ca_topic_score_gemma":0.00036979665,"teacher_disagreement_score":0.051112764,"about_ca_system_score_codex":0.0000431861,"about_ca_system_score_gemma":0.000041134845,"threshold_uncertainty_score":0.42664325},"labels":[],"label_agreement":null},{"id":"W2055063007","doi":"10.1016/j.ijpe.2007.02.031","title":"Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times","year":2007,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Manitoba","funders":"","keywords":"Job shop scheduling; Heuristics; Computer science; Mathematical optimization; Tabu search; Simulated annealing; Scheduling (production processes); Meta heuristic; Metaheuristic; Algorithm; Mathematics; Schedule","score_opus":0.03375852091847666,"score_gpt":0.24805551411129678,"score_spread":0.2142969931928201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055063007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3612905,0.000294991,0.6344991,0.00026761214,0.0032604567,0.00010006834,0.000020835714,0.00004582972,0.0002206373],"genre_scores_gemma":[0.61884683,0.00026299877,0.37928203,0.00006055527,0.0012880818,0.0000034451705,0.000013260999,0.000032479926,0.00021028965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901605,0.000006976747,0.0005374731,0.00014040033,0.00014892383,0.00015019046],"domain_scores_gemma":[0.999127,0.00006306012,0.0002636961,0.00009787042,0.00037339234,0.00007498454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000648347,0.0001392951,0.00020749598,0.00023576604,0.00004250692,0.000076026074,0.00021657972,0.000050427436,0.000027696928],"category_scores_gemma":[0.00004644437,0.00012537006,0.00011021641,0.000035802914,0.0000225379,0.00032493737,0.000013202862,0.00017891703,0.0000050569133],"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.00008608209,0.000026935852,0.000036568024,0.000014041236,0.0007494225,0.000007639755,0.00008859543,0.9952133,0.0009559221,0.00006434934,0.000052884145,0.0027042052],"study_design_scores_gemma":[0.0020637084,0.00018673377,0.00015853773,0.0000662372,0.00076808914,0.0008044207,0.0006892123,0.46382043,0.52366173,0.0011028909,0.0060995542,0.00057844067],"about_ca_topic_score_codex":0.0000017330392,"about_ca_topic_score_gemma":0.0000041950107,"teacher_disagreement_score":0.53139293,"about_ca_system_score_codex":0.00020423191,"about_ca_system_score_gemma":0.000052274918,"threshold_uncertainty_score":0.51124424},"labels":[],"label_agreement":null},{"id":"W2055258732","doi":"10.1080/00207543.2013.778434","title":"Then and now – 50 years of production research","year":2013,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Agencia Estatal de Investigación; Chinese University of Hong Kong; University of Hong Kong","keywords":"Production (economics); Distribution (mathematics); Business; Operations research; Management science; Engineering; Economics; Mathematics; Microeconomics","score_opus":0.08245329137136254,"score_gpt":0.3849266971234604,"score_spread":0.30247340575209786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055258732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.986262,0.0010361648,0.0013224139,0.0074513573,0.002771993,0.00029119113,0.0000024137496,0.000035809415,0.00082662527],"genre_scores_gemma":[0.9833684,0.001331207,0.0122095095,0.0000052226133,0.0016737315,0.00001311755,0.0000025124418,0.000022728129,0.0013735596],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99767405,0.00017636006,0.00037099552,0.00015212264,0.0014303833,0.00019607686],"domain_scores_gemma":[0.99545795,0.000101095065,0.00007538734,0.00014789223,0.0041342992,0.00008337628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031017174,0.00006349271,0.00011708077,0.00097206736,0.000060719452,0.000100266465,0.00030203044,0.000058797326,0.00017488023],"category_scores_gemma":[0.0011179579,0.000060343005,0.00003720311,0.0004235936,0.00019196213,0.00044798575,0.00006257915,0.0006371981,0.000059125843],"study_design_candidate":"bench_or_experimental","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.00029674132,0.0005005712,0.004401119,0.00019692894,0.00060504104,0.000030359803,0.005486266,0.15993223,0.16096102,0.0009484329,0.09219666,0.57444465],"study_design_scores_gemma":[0.005027292,0.002072762,0.19752875,0.0022609257,0.000079551515,0.003107239,0.02000244,0.17215866,0.42774725,0.032467335,0.13603222,0.0015155552],"about_ca_topic_score_codex":0.000036484464,"about_ca_topic_score_gemma":0.0000031509703,"teacher_disagreement_score":0.5729291,"about_ca_system_score_codex":0.00012089489,"about_ca_system_score_gemma":0.00007327186,"threshold_uncertainty_score":0.2768344},"labels":[],"label_agreement":null},{"id":"W2055289342","doi":"10.1007/s00170-011-3766-8","title":"A genetic algorithm and particle swarm optimization for no-wait flow shop problem with separable setup times and makespan criterion","year":2011,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":29,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Mathematical optimization; Flow shop scheduling; Particle swarm optimization; Computer science; Separable space; Benchmark (surveying); Algorithm; Genetic algorithm; Scheduling (production processes); Mathematics; Schedule","score_opus":0.0073597222028981635,"score_gpt":0.21125238723313594,"score_spread":0.20389266503023779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055289342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27212238,0.00045424982,0.7262431,0.0004953031,0.00029340322,0.00018186396,0.0000074321556,0.00012868599,0.00007364233],"genre_scores_gemma":[0.12378183,0.00034602036,0.8756665,0.00003966911,0.000068153,0.000018166278,0.0000020554714,0.000024701025,0.00005289572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.000007791751,0.00024071189,0.00011395822,0.00012804566,0.00014890608],"domain_scores_gemma":[0.9995273,0.00004009951,0.00011363296,0.00009589136,0.00018236894,0.000040720817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010806233,0.00012232809,0.00014076672,0.00014519006,0.000060537164,0.00004207134,0.00021158821,0.00006449382,0.00003126832],"category_scores_gemma":[0.000023487266,0.00008978083,0.000022713062,0.000054967648,0.00006685782,0.00018403906,0.000042634227,0.0001458154,0.0000011501644],"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.00012444986,0.000022016766,0.000057496956,0.000018573059,0.00013018028,0.0000135504915,0.00027132186,0.8851588,0.00043322626,0.000099202975,0.000025727466,0.11364548],"study_design_scores_gemma":[0.0011480114,0.00026399034,0.00012766,0.00008642827,0.000041639014,0.0005092025,0.00021621004,0.9011153,0.092437945,0.0034922434,0.0004065884,0.00015480389],"about_ca_topic_score_codex":0.0000016751918,"about_ca_topic_score_gemma":0.0000013952391,"teacher_disagreement_score":0.14942345,"about_ca_system_score_codex":0.000035318433,"about_ca_system_score_gemma":0.000012260708,"threshold_uncertainty_score":0.3661156},"labels":[],"label_agreement":null},{"id":"W2055312886","doi":"10.1007/s10479-011-1000-6","title":"Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"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":"Due date; Theory of computation; Polynomial-time approximation scheme; Mathematical optimization; Scheduling (production processes); Computer science; Job shop scheduling; Time complexity; Approximation algorithm; Scheme (mathematics); Mathematics; Algorithm; Schedule","score_opus":0.16662900496635066,"score_gpt":0.3454053241298946,"score_spread":0.17877631916354395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055312886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798063,0.00015284709,0.013068095,0.00037976715,0.00002894547,0.00021534855,0.000026568834,0.000029376079,0.0062927394],"genre_scores_gemma":[0.93738663,0.00024560088,0.06218894,0.000014218797,0.00001522097,0.00002647223,0.0000059089853,0.000012175775,0.00010482338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991849,0.00009032388,0.00019643448,0.00010019482,0.00025815063,0.00016999904],"domain_scores_gemma":[0.99916375,0.000084617,0.000013281755,0.00019321384,0.00049216865,0.00005295664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005476919,0.00007356847,0.00012335506,0.000091056936,0.00016054389,0.00003633488,0.00012363419,0.000038299524,0.00020543473],"category_scores_gemma":[0.00006317881,0.000050247945,0.0000184026,0.0002727524,0.0003251507,0.0001469592,0.00003062043,0.00015397827,0.0000054477264],"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.00082552846,0.0013349006,0.037709936,0.0009910945,0.003119114,0.000078806115,0.12504327,0.62989265,0.030865094,0.1324858,0.0042278497,0.033425953],"study_design_scores_gemma":[0.00096877053,0.00033636746,0.010208217,0.0002160071,0.00003362641,0.00005212532,0.008204962,0.6043418,0.3743526,0.00027532695,0.0006383908,0.00037181686],"about_ca_topic_score_codex":0.00021259526,"about_ca_topic_score_gemma":0.000059709255,"teacher_disagreement_score":0.3434875,"about_ca_system_score_codex":0.0000041103817,"about_ca_system_score_gemma":0.00004275204,"threshold_uncertainty_score":0.22493662},"labels":[],"label_agreement":null},{"id":"W2056411353","doi":"10.1080/00207543.2014.980452","title":"Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives","year":2014,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Unavailability; Schedule; Mathematical optimization; Computer science; Heuristic; Set (abstract data type); Integer programming; Operations research; Algorithm; Reliability engineering; Engineering; Mathematics","score_opus":0.025541160178776997,"score_gpt":0.34641207565158155,"score_spread":0.32087091547280455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056411353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80371827,0.00042886983,0.1915933,0.0015384878,0.00089354743,0.0003717551,0.000006201092,0.00004816162,0.0014014085],"genre_scores_gemma":[0.93659645,0.00007001387,0.06249617,0.000005824281,0.0005639994,0.000010199603,0.0000024218014,0.000018742325,0.00023617825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989339,0.0000498593,0.0002752485,0.00011176285,0.0004941637,0.00013505241],"domain_scores_gemma":[0.99808246,0.00015596558,0.00011253775,0.00006253259,0.001533966,0.000052514897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658118,0.00007165739,0.00014455008,0.000249304,0.000071987284,0.00008585565,0.00013303287,0.00003552403,0.000027085498],"category_scores_gemma":[0.000502018,0.00005785908,0.00002798166,0.00010281372,0.00007995608,0.00028274127,0.000016643318,0.00021751666,0.0000015819112],"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.0016868565,0.00016802609,0.0072468175,0.00039017372,0.00066433643,0.000007874382,0.0015841767,0.82655793,0.015172991,0.0007391313,0.00066807575,0.14511362],"study_design_scores_gemma":[0.004799543,0.00037903507,0.004333563,0.0010614345,0.00005914468,0.00055786467,0.0022901257,0.55433244,0.4234997,0.0025467784,0.0057815323,0.00035885247],"about_ca_topic_score_codex":0.000004079912,"about_ca_topic_score_gemma":0.0000020742295,"teacher_disagreement_score":0.4083267,"about_ca_system_score_codex":0.00005901455,"about_ca_system_score_gemma":0.000047658585,"threshold_uncertainty_score":0.23594248},"labels":[],"label_agreement":null},{"id":"W2056881568","doi":"10.1007/s10951-007-0025-9","title":"Single machine batch scheduling to minimize total completion time and resource consumption costs","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Job scheduler; Partition (number theory); Scheduling (production processes); Job queue; Batch processing; Job shop scheduling; Non-renewable resource; Resource consumption; Batch production; Time complexity; Mathematical optimization; Operations research; Operations management; Algorithm; Schedule; Mathematics; Economics; Engineering; Operating system","score_opus":0.015102725161988472,"score_gpt":0.23897285323385165,"score_spread":0.22387012807186318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056881568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67290926,0.0009865984,0.32520866,0.00015780343,0.00032036216,0.00007938262,0.000003961231,0.000086595144,0.00024736047],"genre_scores_gemma":[0.53483546,0.000038570197,0.4645718,0.00010473483,0.00036715588,5.8083583e-7,0.0000073329743,0.00003826503,0.00003609966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984103,0.00003589872,0.00070835924,0.00016059702,0.00036441055,0.0003204343],"domain_scores_gemma":[0.99892795,0.00022984152,0.00018708735,0.00012455069,0.00020235885,0.00032822657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238871,0.0002032616,0.00034371094,0.00037661177,0.00011734527,0.000115905736,0.00012456354,0.00013033426,0.0000707687],"category_scores_gemma":[0.00024969754,0.00020749362,0.00008372862,0.0002708341,0.000037737358,0.00023248105,0.000037312333,0.0004054421,0.000046573063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018930875,0.00007276585,0.002285578,0.000054091634,0.000094469826,0.000045830762,0.00057106576,0.9012276,0.07491076,0.00003207526,0.00005911578,0.020457327],"study_design_scores_gemma":[0.0020653687,0.00021533191,0.0065614795,0.0005858946,0.00009301427,0.0008368551,0.00048916676,0.97015756,0.017893154,0.00001866526,0.0005656235,0.00051785726],"about_ca_topic_score_codex":0.0000033091562,"about_ca_topic_score_gemma":0.0000019599772,"teacher_disagreement_score":0.13936314,"about_ca_system_score_codex":0.00018737865,"about_ca_system_score_gemma":0.000016952188,"threshold_uncertainty_score":0.8461344},"labels":[],"label_agreement":null},{"id":"W2058503288","doi":"10.1016/s0925-5273(00)00086-4","title":"The impact of worker differences on production system output","year":2002,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Productivity; Task (project management); Production (economics); Computer science; Production system (computer science); Operations management; Risk analysis (engineering); Business; Microeconomics; Economics","score_opus":0.021516446380096897,"score_gpt":0.23064784565550725,"score_spread":0.20913139927541036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058503288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856575,0.0002971625,0.00157035,0.00091697386,0.010684845,0.00006733,0.0000038800986,0.00003604028,0.0007659316],"genre_scores_gemma":[0.9962813,0.00076165755,0.0010659955,0.0000033465242,0.0015272066,0.0000018468553,9.115976e-7,0.000012501288,0.00034520525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999257,0.000020564734,0.00043628056,0.000082976396,0.00012569121,0.000077477234],"domain_scores_gemma":[0.999199,0.000034335048,0.00029160714,0.0001130914,0.00032926173,0.000032733944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002676187,0.00008596063,0.00012322143,0.00014894329,0.000044611188,0.000056395635,0.00020536178,0.000033418364,0.000021957703],"category_scores_gemma":[0.00012962944,0.00005953639,0.00011341484,0.000060513452,0.00003401934,0.00020095125,0.000007578666,0.0001369777,0.000014959618],"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.00003711626,0.000037629736,0.0010742507,0.0000039809984,0.00026440452,6.5460785e-7,0.00018529267,0.9695485,0.00005912041,0.00020778857,0.0015255638,0.02705566],"study_design_scores_gemma":[0.000948486,0.00036183064,0.01945015,0.00034661323,0.000058467867,0.0007557007,0.001281255,0.9636316,0.010227589,0.000460129,0.0020911302,0.0003870479],"about_ca_topic_score_codex":0.0000026208097,"about_ca_topic_score_gemma":9.792864e-7,"teacher_disagreement_score":0.026668612,"about_ca_system_score_codex":0.0002656595,"about_ca_system_score_gemma":0.00001670976,"threshold_uncertainty_score":0.24278235},"labels":[],"label_agreement":null},{"id":"W2059082648","doi":"10.5267/j.msl.2015.4.002","title":"Optimization of rewards in single machine scheduling in the rewards-driven systems","year":2015,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Operations research; Mathematical optimization; Mathematics","score_opus":0.020440351017682587,"score_gpt":0.22870109281722842,"score_spread":0.20826074179954585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059082648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31687897,0.00018612755,0.67402613,0.0019349011,0.00097268773,0.00055012834,0.0000020158516,0.00014973355,0.005299299],"genre_scores_gemma":[0.90625995,0.000014516531,0.093364656,0.00028887417,0.000025842519,0.00001955583,0.000004422608,0.000010799515,0.000011368304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987899,0.000041999276,0.00026560877,0.00018544747,0.00048220626,0.00023483766],"domain_scores_gemma":[0.99963087,0.000017921273,0.00004466273,0.00024835728,0.000019935202,0.000038227543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532031,0.00009517799,0.0001147454,0.0004587681,0.00003549512,0.0000942996,0.0004413772,0.000022819495,0.0000023890532],"category_scores_gemma":[0.000046223555,0.000080261154,0.00001713712,0.0015069827,0.00009547414,0.00026365227,0.000050087754,0.00009884655,0.000004272625],"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.000002066976,0.000018792924,0.002200346,0.000031899584,0.0000029744963,0.000008351816,0.00077881425,0.99629295,0.00018297714,0.00016000749,0.000063167216,0.0002576662],"study_design_scores_gemma":[0.00033863774,0.0000115547755,0.00078013545,0.000069147995,0.0000044074827,0.0000014833827,0.001200427,0.9973444,0.000087850654,0.000006199186,0.00006265277,0.00009315567],"about_ca_topic_score_codex":0.000051916402,"about_ca_topic_score_gemma":0.000006496176,"teacher_disagreement_score":0.589381,"about_ca_system_score_codex":0.000165143,"about_ca_system_score_gemma":0.000006047851,"threshold_uncertainty_score":0.32729548},"labels":[],"label_agreement":null},{"id":"W2059913108","doi":"10.1081/stm-100001401","title":"OPTIMAL CONTROL OF A DETERIORATING PRODUCTION PROCESS","year":2001,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Consiliului National al Cercetarii Stiintifice din Invatamantul Superior","keywords":"Mathematics; Optimal control; Reset (finance); Control limits; Process (computing); Production (economics); Limit (mathematics); Mathematical optimization; Control theory (sociology); Control (management); Statistics; Control chart; Computer science; Mathematical analysis; Economics","score_opus":0.014688258352785274,"score_gpt":0.2314122260681173,"score_spread":0.216723967715332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059913108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13894227,0.00008683841,0.86018574,0.000019479021,0.0001875288,0.00013412448,0.0000026047412,0.00016382895,0.00027755598],"genre_scores_gemma":[0.9588774,0.0000022829036,0.04093372,0.0000067786323,0.000098192635,0.000030403831,0.0000026472576,0.000020018022,0.000028590117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943936,0.0000064517867,0.00018433292,0.00011400721,0.000119423115,0.00013640377],"domain_scores_gemma":[0.9997091,0.000014692141,0.000034432764,0.00010654712,0.000096574135,0.000038626527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008334866,0.00008799704,0.0001274926,0.000058551588,0.000031439886,0.000011288868,0.00005996819,0.000039200953,0.000016358717],"category_scores_gemma":[0.000044050594,0.00008849444,0.000024278368,0.00014849268,0.000020083366,0.00013554403,0.000004072321,0.00006836129,0.000003684953],"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.0000117706595,0.000009061187,0.000005886482,0.000022528464,0.0000119326,5.944135e-7,0.0004433233,0.99723434,0.00044057006,0.00006593945,0.0000025834509,0.0017514367],"study_design_scores_gemma":[0.0002691726,0.000022919838,0.0000039421975,0.000037336955,0.000014109559,0.000013750509,0.00012239329,0.9986894,0.00041979126,0.00031557397,6.428441e-7,0.000090968766],"about_ca_topic_score_codex":0.0000016885695,"about_ca_topic_score_gemma":5.3245867e-7,"teacher_disagreement_score":0.8199351,"about_ca_system_score_codex":0.000014634463,"about_ca_system_score_gemma":0.000015204156,"threshold_uncertainty_score":0.36086985},"labels":[],"label_agreement":null},{"id":"W2060173669","doi":"10.1007/s13198-014-0291-9","title":"Practical implications of managerial decisions to integrate production scheduling and maintenance","year":2014,"lang":"en","type":"article","venue":"International Journal of Systems Assurance Engineering and Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of New Brunswick","funders":"King Fahd University of Petroleum and Minerals","keywords":"Preventive maintenance; Scheduling (production processes); Corrective maintenance; Production (economics); Computer science; Operations research; Risk analysis (engineering); Planned maintenance; Integrated production; Operations management; Reliability engineering; Engineering; Business; Economics; Microeconomics","score_opus":0.011870746093431188,"score_gpt":0.2540783675071591,"score_spread":0.24220762141372792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060173669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080046915,0.00018755326,0.91592807,0.00092625635,0.0025408294,0.00012508787,0.0000033462843,0.000039764214,0.0002021862],"genre_scores_gemma":[0.8391849,0.0006903764,0.15977955,0.000012320167,0.0002673655,0.0000110031,0.0000010511645,0.0000138702935,0.00003956091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917597,0.000013376773,0.00039726135,0.00010824161,0.00020616692,0.00009897355],"domain_scores_gemma":[0.9993904,0.00008575626,0.00010729296,0.00009524164,0.00024335104,0.000077945406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043158472,0.000098325414,0.00017476077,0.00026228363,0.000021228498,0.00006592209,0.00011503556,0.000029451749,9.751565e-7],"category_scores_gemma":[0.00027941397,0.00009026547,0.000028916815,0.000120442346,0.000013084457,0.00015546649,0.000031597374,0.00009685409,0.0000012241103],"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.000016227294,0.000013717493,0.00015932047,0.00008440688,0.00016426947,0.0000040714453,0.00009135165,0.98134214,0.0010606835,0.008216392,0.00032667944,0.008520757],"study_design_scores_gemma":[0.0010941449,0.00010306932,0.01731981,0.0021038307,0.00007906221,0.00042548592,0.0004978898,0.96011806,0.00065702247,0.00021650984,0.01702531,0.00035979957],"about_ca_topic_score_codex":0.000002860299,"about_ca_topic_score_gemma":9.4817597e-7,"teacher_disagreement_score":0.759138,"about_ca_system_score_codex":0.0000402901,"about_ca_system_score_gemma":0.0000054830434,"threshold_uncertainty_score":0.3680919},"labels":[],"label_agreement":null},{"id":"W2060500675","doi":"10.1016/j.ejor.2012.09.013","title":"Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":31,"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":"Single-machine scheduling; Computer science; Time complexity; Scheduling (production processes); Algorithm; Learning effect; Job shop scheduling; Dynamic priority scheduling; Mathematical optimization; Mathematics; Schedule","score_opus":0.035291033282661435,"score_gpt":0.30108530348599505,"score_spread":0.2657942702033336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060500675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21166205,0.00508427,0.7709817,0.0005492741,0.00031019613,0.0005380984,0.000007964205,0.00013012698,0.0107363],"genre_scores_gemma":[0.8358149,0.000031436342,0.16280216,0.000026713926,0.0006266286,0.000004214868,0.0000080150385,0.00006434411,0.0006215637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985138,0.00027825194,0.00024172326,0.00010592388,0.0005646903,0.00029557841],"domain_scores_gemma":[0.9989222,0.00032685432,0.000052282783,0.000057224926,0.00045385334,0.00018758261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002700922,0.00012001427,0.00014492939,0.00024069805,0.00028985576,0.00022241285,0.000113358736,0.00002193938,0.000033028275],"category_scores_gemma":[0.00040419184,0.000091932336,0.000028461734,0.00016403962,0.000047891936,0.00033403694,0.000025944486,0.0005144546,0.00003628932],"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.0001531947,0.00012741954,0.00038925814,0.00011528082,0.00007696309,0.00003192352,0.0009958294,0.92425334,0.006936642,0.000112862224,0.0001216745,0.06668559],"study_design_scores_gemma":[0.0017307134,0.0014074171,0.00065503805,0.0004381552,0.000019795341,0.0002234041,0.0002453113,0.9870185,0.0070285257,0.000008960357,0.0010034469,0.00022069275],"about_ca_topic_score_codex":2.7513275e-7,"about_ca_topic_score_gemma":7.256662e-8,"teacher_disagreement_score":0.6241529,"about_ca_system_score_codex":0.00006184518,"about_ca_system_score_gemma":0.00004716965,"threshold_uncertainty_score":0.3748892},"labels":[],"label_agreement":null},{"id":"W2061449261","doi":"10.3182/20060517-3-fr-2903.00244","title":"AGENT-BASED CONTROL FOR THERMOFORMING PROCESSES","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","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":"National Research Council Canada; McGill University","funders":"","keywords":"Thermoforming; Interoperability; Process (computing); Architecture; Process modeling; Computer science; Control (management); Process control; Systems engineering; Manufacturing engineering; Engineering; Software engineering; Control engineering; Work in process; Artificial intelligence; Mechanical engineering; Operations management","score_opus":0.007368756975353165,"score_gpt":0.20368894859712258,"score_spread":0.19632019162176942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061449261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28345114,0.0018537955,0.69502914,0.0004237775,0.0007491134,0.001276381,0.00007617811,0.0035447204,0.013595776],"genre_scores_gemma":[0.9477262,0.0000070547712,0.05115885,0.00009404693,0.00031002777,0.00019064867,0.000017962015,0.000059752416,0.00043544272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.0000010560091,0.000210412,0.00017402752,0.00013590096,0.000306422],"domain_scores_gemma":[0.9995561,0.000046207973,0.000047321635,0.00005089277,0.00025038488,0.000049056827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105743704,0.00016806788,0.00016449187,0.00008949862,0.000117034884,0.00012225583,0.00012743006,0.00008312716,0.000023953366],"category_scores_gemma":[0.000091959475,0.00016432434,0.000058255057,0.00022053375,0.000026496726,0.00019522887,0.0000037525676,0.000069752234,0.000016332448],"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.00020248553,0.00034241664,0.03482696,0.0052878605,0.0002891477,0.000005365529,0.0012285945,0.8512114,0.021416243,0.0041892296,0.027596543,0.053403717],"study_design_scores_gemma":[0.0013045054,0.00004239906,0.00039355695,0.00006335683,0.000038561506,0.0000027124904,0.00014449011,0.96710443,0.02432877,0.00043960012,0.0058100065,0.00032761777],"about_ca_topic_score_codex":0.000007877105,"about_ca_topic_score_gemma":0.000002927771,"teacher_disagreement_score":0.6642751,"about_ca_system_score_codex":0.000041040283,"about_ca_system_score_gemma":0.000031885615,"threshold_uncertainty_score":0.67009526},"labels":[],"label_agreement":null},{"id":"W2062006607","doi":"10.5267/j.ijiec.2011.04.003","title":"A mathematical model for weighted tardy jobs scheduling problem with a batched delivery system","year":2011,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simulated annealing; Computer science; Scheduling (production processes); Due date; Mathematical optimization; Single-machine scheduling; Operations research; Heuristic; Operations management; Finished good; Job shop scheduling; Supply chain; Schedule; Production (economics); Mathematics; Business; Economics; Algorithm; Microeconomics","score_opus":0.037038459307314336,"score_gpt":0.23073734263687243,"score_spread":0.1936988833295581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062006607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042792488,0.000034883324,0.9557776,0.000061508275,0.0007311991,0.00019505453,0.000022087474,0.00019749551,0.000187705],"genre_scores_gemma":[0.4862706,0.000002727181,0.5133464,0.0000076758415,0.00030847394,0.000014821722,0.000008467581,0.000032987165,0.0000078719895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874717,0.000010750191,0.0006164529,0.00010588434,0.000342209,0.00017750461],"domain_scores_gemma":[0.998755,0.00014089627,0.0001641148,0.00007827361,0.0007365999,0.00012515488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023962339,0.00017661738,0.00025412499,0.0003640164,0.000040999366,0.000073920724,0.00029345302,0.00011787039,0.000012162217],"category_scores_gemma":[0.00007142694,0.00015907055,0.00011615778,0.00018442445,0.000017109307,0.00024323407,0.000017516297,0.00029702467,0.000004132204],"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.000066323075,0.00004128384,0.000026322365,0.000028725557,0.0003785669,0.000015826805,0.0006390784,0.9947235,0.00007284768,0.0028771823,0.000057711593,0.001072658],"study_design_scores_gemma":[0.001634816,0.00006950698,0.000008938729,0.00043945477,0.000073136835,0.00012393086,0.00017849871,0.9965727,0.00041518794,0.00029347118,0.000018016488,0.0001723589],"about_ca_topic_score_codex":0.0000023470125,"about_ca_topic_score_gemma":4.6305993e-7,"teacher_disagreement_score":0.4434781,"about_ca_system_score_codex":0.00018220139,"about_ca_system_score_gemma":0.0001245903,"threshold_uncertainty_score":0.64867085},"labels":[],"label_agreement":null},{"id":"W2062601646","doi":"10.1007/s10951-005-5314-6","title":"Scheduling in Reentrant Robotic Cells: Algorithms and Complexity","year":2005,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reentrancy; Job shop scheduling; Scheduling (production processes); Computer science; Robot; Minification; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Embedded system; Routing (electronic design automation)","score_opus":0.02816764618713669,"score_gpt":0.24745185509983172,"score_spread":0.21928420891269504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062601646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67165875,0.0044766674,0.32228488,0.000496872,0.0007126437,0.00008966837,0.0000015893066,0.00008324275,0.00019570094],"genre_scores_gemma":[0.5015649,0.00047749546,0.49753895,0.00004799238,0.00033895526,6.948625e-7,7.3217683e-7,0.000023259376,0.0000069792463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846923,0.000037439033,0.00075126986,0.0001421875,0.00027998997,0.0003198583],"domain_scores_gemma":[0.99933445,0.000087143846,0.00015238521,0.00011951922,0.00011660688,0.00018987551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069264404,0.00019264547,0.00038473212,0.0003271124,0.000064653825,0.00008794623,0.00017608741,0.00011392451,0.000040792245],"category_scores_gemma":[0.00006822159,0.0001880756,0.000086436725,0.00030058666,0.000059361573,0.00040374487,0.0000254169,0.00060869707,0.000010914858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011753697,0.000037240472,0.0004981319,0.000037137226,0.000032244134,0.000025418653,0.0003961068,0.9869748,0.0017731588,0.000080280835,0.0000070555016,0.010126704],"study_design_scores_gemma":[0.0010419553,0.0000364829,0.0006935859,0.00022561244,0.000026870686,0.00013567778,0.0005017948,0.9929339,0.0039711003,0.0001360948,0.00008786913,0.00020903068],"about_ca_topic_score_codex":0.0000049008454,"about_ca_topic_score_gemma":0.000009176806,"teacher_disagreement_score":0.17525406,"about_ca_system_score_codex":0.00011455999,"about_ca_system_score_gemma":0.000038527764,"threshold_uncertainty_score":0.7669501},"labels":[],"label_agreement":null},{"id":"W2062987972","doi":"10.1080/15320370108500209","title":"Structure of a Simulation Model for a Manufacturing System Coordinated by Production Authorization Cards","year":2001,"lang":"en","type":"article","venue":"Journal of Design and Manufacturing Automation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Production (economics); Subroutine; Authorization; Variety (cybernetics); Process (computing); Control (management); Discrete event simulation; Manufacturing engineering; Industrial engineering; Distributed computing; Simulation; Engineering; Operating system","score_opus":0.013636481955222265,"score_gpt":0.23159417514781375,"score_spread":0.21795769319259148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062987972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3074336,0.00008573125,0.6918566,0.00001968438,0.00026871442,0.00022098415,0.0000056239983,0.000104280036,0.0000047847147],"genre_scores_gemma":[0.91904414,0.00003574746,0.08074692,0.000002960716,0.00009127581,0.000003448656,0.000017213259,0.000025780319,0.000032504882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990524,0.000038869286,0.00048709626,0.00010973786,0.00018822339,0.00012364384],"domain_scores_gemma":[0.9993347,0.0000604706,0.00032003986,0.00007801172,0.0001516265,0.00005517663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000285817,0.00014085924,0.00022952196,0.00023679974,0.000079690835,0.00004411097,0.000059231876,0.00011754413,0.0000020984785],"category_scores_gemma":[0.0000424748,0.00013127887,0.000050747738,0.00007032448,0.00001144677,0.00037852387,0.0000052116216,0.000103847924,1.5245047e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005198184,0.00000865697,0.0000056847357,0.00023842884,0.000044748405,4.845009e-7,0.0003545881,0.9759285,0.014643036,0.000014094905,0.00007802557,0.008631761],"study_design_scores_gemma":[0.00040137817,0.000043248885,0.00007290969,0.000104890714,0.000051898893,0.000032187072,0.00007137447,0.7315166,0.26748294,0.00011686231,0.000015525151,0.00009017157],"about_ca_topic_score_codex":0.0000014118474,"about_ca_topic_score_gemma":2.5094764e-7,"teacher_disagreement_score":0.61161053,"about_ca_system_score_codex":0.000113920585,"about_ca_system_score_gemma":0.000018982026,"threshold_uncertainty_score":0.53533965},"labels":[],"label_agreement":null},{"id":"W2063461301","doi":"10.1080/00207543.2011.574952","title":"Jobshop lot streaming with routing flexibility, sequence-dependent setups, machine release dates and lag time","year":2011,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Distributed computing; Flow shop scheduling; Flexibility (engineering); Real-time computing; Sequence (biology); Algorithm; Routing (electronic design automation); Mathematics; Embedded system","score_opus":0.09754097223539378,"score_gpt":0.3448485246241702,"score_spread":0.24730755238877644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063461301","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884365,0.00038301,0.0076026972,0.0011466979,0.00086515123,0.00015551112,0.000017071825,0.00009596876,0.0012973645],"genre_scores_gemma":[0.9810317,0.00019861294,0.017703982,0.000011809767,0.0004796612,0.0000027290578,0.000009246521,0.000023843528,0.00053838897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984032,0.00009057935,0.00032765654,0.00017735713,0.00082045246,0.00018078592],"domain_scores_gemma":[0.99847776,0.00005974829,0.00008990797,0.00013503798,0.0011283335,0.00010923014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014327638,0.000099267505,0.00012034245,0.00036577246,0.00008302649,0.000092898605,0.0002556931,0.000042530573,0.00022252092],"category_scores_gemma":[0.00042882582,0.00008143902,0.000026046679,0.00019276077,0.00009941,0.0004142854,0.00006216857,0.00048201968,0.000021168187],"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.002499684,0.0011981997,0.06257607,0.00028081314,0.0024551156,0.0012475261,0.013733029,0.6314256,0.06721263,0.0014454123,0.0023795879,0.21354632],"study_design_scores_gemma":[0.0033552556,0.0010777949,0.00925313,0.0010372741,0.000095532676,0.0051614363,0.0034452216,0.77733374,0.1946827,0.0022733854,0.0013733662,0.0009111428],"about_ca_topic_score_codex":0.00006074903,"about_ca_topic_score_gemma":0.000012836736,"teacher_disagreement_score":0.21263517,"about_ca_system_score_codex":0.00014354837,"about_ca_system_score_gemma":0.0000736622,"threshold_uncertainty_score":0.3320987},"labels":[],"label_agreement":null},{"id":"W2063635201","doi":"10.1016/j.cie.2009.01.010","title":"A genetic approach to two-phase optimization of dynamic supply chain scheduling","year":2009,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Procurement; Supply chain; Scheduling (production processes); Computer science; Tardiness; Build to order; Supply chain optimization; Mass customization; Job shop scheduling; Industrial engineering; Operations research; Personalization; Mathematical optimization; Supply chain management; Schedule; Engineering; Operations management; Production (economics); Business","score_opus":0.01511577713601886,"score_gpt":0.2282072735914384,"score_spread":0.21309149645541953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063635201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07541293,0.00013615166,0.92260194,0.000036734426,0.00089544343,0.00030369213,0.0000072727635,0.00051625894,0.000089569774],"genre_scores_gemma":[0.49788016,0.000007491959,0.5017861,0.000022021475,0.00023608553,0.000007817802,0.000023814939,0.000032769967,0.000003709563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.000016065937,0.00044166698,0.0002552684,0.00019585046,0.00033784288],"domain_scores_gemma":[0.9994125,0.000040581082,0.00004695514,0.000254061,0.00005584067,0.00019008131],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015020046,0.0002565224,0.0003194178,0.0003836006,0.00003772082,0.000058981164,0.00025144286,0.0001537981,0.000006743993],"category_scores_gemma":[0.000059955175,0.0003069419,0.00007910007,0.0007225767,0.00001024596,0.00010420049,0.000027656077,0.0002753913,0.0000037399516],"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.000010808862,0.00004832542,0.0000044552476,0.000015266012,0.000028816534,0.0000023751145,0.00018788532,0.9703077,0.0009767644,0.00006428174,0.000024610621,0.028328674],"study_design_scores_gemma":[0.0018891164,0.00009395581,0.00003829306,0.000101113794,0.000020114696,0.000010362481,0.000024390501,0.9968578,0.00063185627,0.000002671342,0.000032661563,0.00029763085],"about_ca_topic_score_codex":0.0000030578842,"about_ca_topic_score_gemma":7.488613e-8,"teacher_disagreement_score":0.42246723,"about_ca_system_score_codex":0.000107484186,"about_ca_system_score_gemma":0.00002668109,"threshold_uncertainty_score":0.99993825},"labels":[],"label_agreement":null},{"id":"W2063946149","doi":"10.3182/20060517-3-fr-2903.00065","title":"OPERATOR'S ASSIGNMENT PROBLEM IN WORKSHOP SCHEDULING","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Operator (biology); Scheduling (production processes); Computer science; Mathematical optimization; Integer programming; Operations research; Algorithm; Mathematics","score_opus":0.007344124982307067,"score_gpt":0.20711628299555732,"score_spread":0.19977215801325024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063946149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93633807,0.0017298021,0.030871341,0.0004580276,0.00055389747,0.0005349615,0.0000045525003,0.001669517,0.027839832],"genre_scores_gemma":[0.806516,0.000035054956,0.19243942,0.00003663289,0.00022022474,0.00007011147,0.0000070433043,0.000050499,0.00062502635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988259,0.0000032179034,0.00032780116,0.00025258644,0.00021208271,0.00037843376],"domain_scores_gemma":[0.99973357,0.000015820458,0.000034204324,0.000071070644,0.00007771158,0.000067630535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001902465,0.00020083511,0.0001933002,0.0001700672,0.000067231,0.00019012165,0.00015932787,0.0001297277,0.00005437458],"category_scores_gemma":[0.00002836419,0.00021231161,0.00004064246,0.00047535982,0.000026287305,0.00030802435,0.000030312656,0.00023928507,0.00005924557],"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.000007246169,0.00008414807,0.031708375,0.0001210459,0.000024481842,0.0000066571365,0.0006441125,0.95390797,0.0027656544,0.001732379,0.002018213,0.0069797025],"study_design_scores_gemma":[0.0006850474,0.00001824508,0.0020460116,0.00018847226,0.000011385053,0.000008108642,0.0007572939,0.98661464,0.0065781185,0.00061097636,0.0019862405,0.0004954312],"about_ca_topic_score_codex":0.000023861216,"about_ca_topic_score_gemma":0.00000857582,"teacher_disagreement_score":0.16156808,"about_ca_system_score_codex":0.00013794491,"about_ca_system_score_gemma":0.00001829795,"threshold_uncertainty_score":0.86578166},"labels":[],"label_agreement":null},{"id":"W2064028888","doi":"10.5267/j.ijiec.2012.03.004","title":"Evolutionary approaches for scheduling a flexible manufacturing system with automated guided vehicles and robots","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robot; Scheduling (production processes); Automated guided vehicle; Flexible manufacturing system; Computer science; Manufacturing engineering; Job shop scheduling; Engineering; Systems engineering; Embedded system; Artificial intelligence; Operations management","score_opus":0.04984062304677636,"score_gpt":0.256247388944878,"score_spread":0.2064067658981016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064028888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17446758,0.00033391215,0.822664,0.00012370746,0.001750704,0.00014152066,0.000015374784,0.00045828542,0.00004488607],"genre_scores_gemma":[0.76110786,0.000005667552,0.23795147,0.0000048379466,0.00087262824,0.000009388234,0.00001610636,0.000027732269,0.000004274574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990672,0.000012521053,0.00040705307,0.00007776175,0.0002493264,0.00018615155],"domain_scores_gemma":[0.9993226,0.000167344,0.0001237074,0.00005216976,0.00020814457,0.00012604939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023702958,0.00014457578,0.00018070583,0.00033402318,0.00006003491,0.00008477898,0.0001445794,0.000091865986,0.0000019395304],"category_scores_gemma":[0.00007394469,0.00013531387,0.000056227596,0.00011306011,0.000016674454,0.00037140644,0.00001859133,0.00020036288,0.0000011810455],"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.000020319076,0.00001930774,0.0002639693,0.000025454661,0.0002537519,0.0000028323182,0.00013894131,0.9963676,0.00005487347,0.0008089607,0.00011797575,0.0019260397],"study_design_scores_gemma":[0.0011930367,0.000031000935,0.0006717773,0.00026848726,0.00004029901,0.00035672405,0.00020006234,0.99588233,0.0010679525,0.000007440265,0.00013394328,0.00014695393],"about_ca_topic_score_codex":0.000002651249,"about_ca_topic_score_gemma":8.9717176e-8,"teacher_disagreement_score":0.5866403,"about_ca_system_score_codex":0.00018018488,"about_ca_system_score_gemma":0.00004527122,"threshold_uncertainty_score":0.5517939},"labels":[],"label_agreement":null},{"id":"W2064816527","doi":"10.1016/j.disopt.2008.04.001","title":"The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":118,"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","funders":"","keywords":"Tardiness; Travelling salesman problem; Sequence (biology); Mathematical optimization; Single-machine scheduling; Scheduling (production processes); Computation; Branch and bound; Integer programming; Computer science; Job shop scheduling; Linear programming relaxation; Mathematics; Algorithm; Schedule","score_opus":0.011725880689997945,"score_gpt":0.19932865616627973,"score_spread":0.1876027754762818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064816527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012417078,0.0013267805,0.9811237,0.00024179068,0.00012229275,0.00061929156,0.000024956811,0.00069814303,0.003425999],"genre_scores_gemma":[0.5418719,0.0012621032,0.45527253,0.000043861204,0.000092653274,0.0000771334,0.00024261697,0.00013931037,0.0009978941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856305,0.000050381543,0.00035176074,0.0003339689,0.00034448496,0.00035632428],"domain_scores_gemma":[0.99934447,0.00006695664,0.00009761749,0.0002505655,0.000116472904,0.00012394854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024601162,0.00028485316,0.00020220071,0.00007219983,0.00058105664,0.00019198666,0.00017403539,0.00010445341,0.000040500287],"category_scores_gemma":[0.000028394728,0.00021176333,0.000033842807,0.00026443126,0.00012135493,0.00032936904,0.00003874699,0.00022786568,0.000017265544],"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.000016174075,0.000015364769,0.00024402484,0.000030611816,0.000047282392,0.000007513815,0.00051492057,0.99761814,0.0004549061,0.00006309851,0.000008551435,0.0009794261],"study_design_scores_gemma":[0.00055952807,0.000071666975,0.000018716231,0.00008681413,0.000034284163,0.00012857556,0.000116455994,0.99750715,0.001081247,0.00004465852,0.00003159177,0.00031933564],"about_ca_topic_score_codex":0.000016283213,"about_ca_topic_score_gemma":0.000017593033,"teacher_disagreement_score":0.5294548,"about_ca_system_score_codex":0.000078471334,"about_ca_system_score_gemma":0.00003629341,"threshold_uncertainty_score":0.86354584},"labels":[],"label_agreement":null},{"id":"W2064818654","doi":"10.1002/aic.690481226","title":"Chronological decomposition heuristic for scheduling: Divide and conquer method","year":2002,"lang":"en","type":"article","venue":"AIChE Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Honeywell (Canada)","funders":"","keywords":"Spec#; Scheduling (production processes); Heuristics; Operations research; Computer science; Decomposition; Mathematics; Mathematical optimization; Chemistry; Programming language","score_opus":0.026105297760443413,"score_gpt":0.28456502136342765,"score_spread":0.25845972360298425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064818654","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023812732,0.0015417708,0.9731702,0.00060120726,0.0003401246,0.00008701938,0.0000028660759,0.000110489564,0.00033354544],"genre_scores_gemma":[0.3193388,0.00033700504,0.6796852,0.0001353617,0.00041628588,0.000009604066,0.0000034410173,0.000019274605,0.000055085835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994199,0.000032616597,0.00020380464,0.000090413545,0.00008013545,0.00017312284],"domain_scores_gemma":[0.99956805,0.00016346647,0.00003846418,0.000061259845,0.000059054182,0.00010971147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028581475,0.00009632147,0.00013206707,0.00006090558,0.00012971833,0.000087174965,0.00006110256,0.000085890475,0.00015695588],"category_scores_gemma":[0.0001301742,0.00008461219,0.000043874505,0.000059726743,0.000019446063,0.00009326187,0.000010224107,0.00022469094,0.000019733194],"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.000032704367,0.00009741014,0.0007937115,0.00008873127,0.00026205924,0.000040550447,0.0007648961,0.84223104,0.0039004122,0.000757041,0.0064108856,0.14462055],"study_design_scores_gemma":[0.00064147287,0.00005055625,0.00027148207,0.000022434955,0.000034932727,0.00040575824,0.00003495829,0.9952368,0.00084372296,0.00082381646,0.0015016645,0.0001324111],"about_ca_topic_score_codex":3.0409262e-7,"about_ca_topic_score_gemma":2.2878729e-7,"teacher_disagreement_score":0.29552606,"about_ca_system_score_codex":0.000033073404,"about_ca_system_score_gemma":0.0000043723403,"threshold_uncertainty_score":0.3450385},"labels":[],"label_agreement":null},{"id":"W2065819816","doi":"10.1016/s0377-2217(01)00083-2","title":"Two-machine flow shops with limited machine availability","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":116,"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":"Flow shop scheduling; Computer science; Time horizon; Mathematical optimization; Heuristic; Job shop scheduling; Flow (mathematics); Upper and lower bounds; Constant (computer programming); Time complexity; Algorithm; Mathematics; Routing (electronic design automation)","score_opus":0.05547564325294014,"score_gpt":0.2931843484889926,"score_spread":0.23770870523605248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065819816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3741129,0.012372917,0.34823197,0.009591433,0.0014749147,0.0008914322,0.00015373949,0.0004694909,0.2527012],"genre_scores_gemma":[0.88108283,0.00022811703,0.11691293,0.00007981701,0.00046161332,0.000001443275,0.000016864813,0.000055686945,0.0011607087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977409,0.0005416729,0.00042238767,0.00013472531,0.00091059704,0.00024970397],"domain_scores_gemma":[0.99845374,0.00019468696,0.00003953719,0.0001925241,0.0009061655,0.0002133606],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027461334,0.00012644021,0.00015619752,0.00026808534,0.00018777796,0.00017340724,0.00030052307,0.000017812885,0.0023651954],"category_scores_gemma":[0.000429565,0.00009432217,0.00005160866,0.0004651864,0.0000912256,0.0002560888,0.00003676204,0.0007947131,0.00031381694],"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.00007037536,0.00012356724,0.0008856449,0.00001570908,0.000078255754,0.00023269952,0.00038945014,0.980944,0.0005040743,0.00011437438,0.004134525,0.012507333],"study_design_scores_gemma":[0.0012083396,0.00028848022,0.0013591865,0.000044196182,0.0000066286625,0.00020327288,0.000043088643,0.991718,0.00030633537,0.0000063104626,0.0046891524,0.00012702358],"about_ca_topic_score_codex":0.0000020528198,"about_ca_topic_score_gemma":0.000003878691,"teacher_disagreement_score":0.5069699,"about_ca_system_score_codex":0.00008109382,"about_ca_system_score_gemma":0.00003843294,"threshold_uncertainty_score":0.9985468},"labels":[],"label_agreement":null},{"id":"W2067017621","doi":"10.1016/s0020-0255(00)00033-5","title":"Fault recovery in distributed manufacturing systems by emergent holonic re-configuration: A fuzzy multi-agent modeling approach","year":2000,"lang":"en","type":"article","venue":"Information Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":35,"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":"Universitatea Politehnica din București","keywords":"Computer science; Multi-agent system; Distributed computing; Fuzzy logic; Fault (geology); Distributed manufacturing; Artificial intelligence; Manufacturing engineering; Engineering; Geology","score_opus":0.02639395114470789,"score_gpt":0.23949717817727664,"score_spread":0.21310322703256876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067017621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23273942,0.00033894193,0.7589361,0.00007017736,0.00051661464,0.00030413165,0.00004857986,0.000296935,0.006749124],"genre_scores_gemma":[0.9895943,0.00021770905,0.009757618,0.000045086388,0.000028280048,0.00005064236,0.00022305513,0.0000058199716,0.00007751037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.000022323555,0.00051291444,0.00012398827,0.00030623435,0.00023270586],"domain_scores_gemma":[0.99971896,0.000014152797,0.00005456288,0.00011561724,0.00003548199,0.000061219944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041540767,0.00012444169,0.00012169372,0.00015870044,0.00015020037,0.000283855,0.00018714256,0.00007318524,0.00007797539],"category_scores_gemma":[0.000019424082,0.000115665345,0.00003058216,0.00038542764,0.00002711816,0.0015237035,0.000008899544,0.00011037577,0.000107237254],"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.0000022216927,0.000008233786,0.000014192691,0.000020970454,0.0000038955222,1.4321922e-7,0.0006359949,0.99334043,0.000007672586,0.000008613163,0.0002172156,0.00574044],"study_design_scores_gemma":[0.00024805943,0.000010254509,0.000043638767,0.00002418579,0.000002248828,0.0000031099999,0.0012432208,0.99693936,0.00029043944,0.0000060763628,0.0010373867,0.00015200788],"about_ca_topic_score_codex":0.00009398635,"about_ca_topic_score_gemma":0.0000042665806,"teacher_disagreement_score":0.75685483,"about_ca_system_score_codex":0.00009502428,"about_ca_system_score_gemma":0.000023762514,"threshold_uncertainty_score":0.47166958},"labels":[],"label_agreement":null},{"id":"W2067739037","doi":"10.1287/msom.5.4.372.24885","title":"Erratum to Bounds in “Serial Production/Distribution Systems Under Service Constraints”","year":2003,"lang":"en","type":"erratum","venue":"Manufacturing & Service Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Production (economics); Service (business); Computer science; Distribution (mathematics); Operations research; Operations management; Business; Mathematical optimization; Microeconomics; Economics; Mathematics; Marketing","score_opus":0.012037829363685321,"score_gpt":0.2217445529151714,"score_spread":0.20970672355148606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067739037","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016399764,0.0022249762,0.27186972,0.017601572,0.4686532,0.015190395,0.0013579811,0.0054412154,0.20126116],"genre_scores_gemma":[0.1075697,0.0030381791,0.08479842,0.014694838,0.015687399,0.008514523,0.05742437,0.0021084554,0.7061641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99682564,0.00011420195,0.00089266925,0.00089406077,0.0005595398,0.0007138824],"domain_scores_gemma":[0.99849296,0.0000120301665,0.0000814367,0.0009406144,0.00026145647,0.00021153352],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004195965,0.00072536286,0.0005655123,0.00055439514,0.00036749017,0.00088511605,0.0005319877,0.0004874449,0.00021755454],"category_scores_gemma":[0.00001572084,0.0008377892,0.00007992031,0.0010709638,0.000026398999,0.0003360652,0.0001494781,0.00089152995,0.00049758964],"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.000005993212,0.000059166014,9.2984834e-7,0.0008582702,0.00014563948,0.000011480541,0.0002416807,0.82572633,0.000006063275,0.0003901836,0.17226106,0.0002931935],"study_design_scores_gemma":[0.0017258232,0.00006214898,0.00072339876,0.00213014,0.00042279015,0.00005671568,0.005299223,0.37304926,0.00064508157,0.00012979103,0.61263424,0.003121377],"about_ca_topic_score_codex":0.0003760786,"about_ca_topic_score_gemma":0.0024787346,"teacher_disagreement_score":0.50490296,"about_ca_system_score_codex":0.0010031469,"about_ca_system_score_gemma":0.00011084394,"threshold_uncertainty_score":0.9994073},"labels":[],"label_agreement":null},{"id":"W2067880102","doi":"10.1002/jos.94","title":"Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times","year":2002,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Dominance (genetics); Algorithm; Flow shop scheduling; Scheduling (production processes); Branch and bound; Retard; Sequence (biology); Mathematics; Schedule","score_opus":0.018494260968069845,"score_gpt":0.23333070528570254,"score_spread":0.2148364443176327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067880102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19414604,0.0033599425,0.788087,0.010655302,0.0012807401,0.0005402814,0.000017251754,0.00017669989,0.001736705],"genre_scores_gemma":[0.42614776,0.00022535597,0.571887,0.00076277636,0.000631602,0.000012547433,0.000002214123,0.00006918861,0.00026153744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984636,0.00008840551,0.00052662427,0.00014095624,0.0004589624,0.00032145524],"domain_scores_gemma":[0.999058,0.00024585446,0.0001284308,0.0002624995,0.00014093472,0.00016425332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073832326,0.00022826581,0.00030260993,0.000206525,0.00013212806,0.00017228605,0.00049542234,0.00006745062,0.00026953415],"category_scores_gemma":[0.00018246863,0.0001129443,0.0000900722,0.0007304452,0.000038461698,0.00020445455,0.000025126335,0.00063790794,0.00003219584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008191416,0.00005056973,0.00028149743,0.000013880863,0.00005295344,0.00015614956,0.0018415019,0.97431225,0.00004208363,0.000008584696,0.00010322392,0.0230554],"study_design_scores_gemma":[0.0013806897,0.00009240171,0.00023254925,0.0001837323,0.00005027193,0.0004984195,0.002180657,0.9945702,0.00021279353,0.000024046441,0.0003730695,0.00020116183],"about_ca_topic_score_codex":0.000007284201,"about_ca_topic_score_gemma":0.0000148150075,"teacher_disagreement_score":0.2320017,"about_ca_system_score_codex":0.00005671913,"about_ca_system_score_gemma":0.000034089473,"threshold_uncertainty_score":0.4605735},"labels":[],"label_agreement":null},{"id":"W2067884717","doi":"10.1016/j.cor.2005.07.004","title":"Scheduling and routing of automated guided vehicles: A hybrid approach","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":161,"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":"Computer science; Scheduling (production processes); Mathematical optimization; Integer programming; Job shop scheduling; Routing (electronic design automation); Constraint programming; Distributed computing; Algorithm; Computer network; Mathematics","score_opus":0.05043721699695757,"score_gpt":0.3291782384169027,"score_spread":0.2787410214199451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067884717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43361238,0.00038350277,0.5641868,0.00018800459,0.0000763501,0.00021527482,0.0000044150624,0.00055694836,0.00077632454],"genre_scores_gemma":[0.57844603,0.000034138222,0.42135534,0.000013634438,0.00007672125,0.000011555583,0.000016090762,0.000015277086,0.000031230484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998919,0.00008267311,0.00028366255,0.00018930597,0.00026242973,0.00026290567],"domain_scores_gemma":[0.99933,0.000092334674,0.000008957865,0.00020628776,0.00026883133,0.00009358231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357919,0.00009741656,0.00014356477,0.00027034292,0.00023276858,0.00015622441,0.00017309192,0.000047118836,0.000009268195],"category_scores_gemma":[0.00009429474,0.00010116909,0.000025213905,0.00044876497,0.00008610155,0.00018075998,0.00008069667,0.0002461005,0.000015328613],"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.0000011689729,0.000025721716,0.00004160487,0.000025742753,0.000020911002,8.2185767e-7,0.0006153305,0.9896868,0.0011747245,0.00036583946,0.00038188734,0.007659432],"study_design_scores_gemma":[0.00030801335,0.000015066937,0.00009446499,0.000039933937,0.0000031526106,0.00001509772,0.00020103416,0.99529564,0.0038462635,0.000003945515,0.000078899946,0.000098508855],"about_ca_topic_score_codex":0.000020321413,"about_ca_topic_score_gemma":0.0000022428014,"teacher_disagreement_score":0.14483362,"about_ca_system_score_codex":0.00005961765,"about_ca_system_score_gemma":0.00004955664,"threshold_uncertainty_score":0.41255558},"labels":[],"label_agreement":null},{"id":"W2069541979","doi":"10.1007/s10951-011-0255-8","title":"Single machine batch scheduling with release times and delivery costs","year":2011,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Windsor","funders":"","keywords":"Metaheuristic; Mathematical optimization; Computer science; Job shop scheduling; Single-machine scheduling; Scheduling (production processes); Mathematics","score_opus":0.015761895206830193,"score_gpt":0.1994266802483037,"score_spread":0.18366478504147352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069541979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88028276,0.004326256,0.11326811,0.00006024464,0.000331788,0.00006734895,0.0000024681524,0.000116641386,0.0015443738],"genre_scores_gemma":[0.59773153,0.00025504988,0.40179092,0.000040087838,0.00012752305,7.3733656e-7,0.0000011222737,0.00003519863,0.000017863455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.000027050595,0.00045015005,0.00013504225,0.00025480048,0.00024663116],"domain_scores_gemma":[0.99913716,0.000069217334,0.0001800596,0.00013352797,0.0002454022,0.00023460621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033061008,0.00020387347,0.0002956147,0.0002255799,0.00008951351,0.00007180898,0.00015056599,0.00009696933,0.00009395904],"category_scores_gemma":[0.00008156612,0.0001695787,0.00006500729,0.00023262404,0.000054180775,0.00042500108,0.00002564984,0.00042848062,0.00000960395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005763188,0.0003400562,0.0144684315,0.000229799,0.00071234273,0.0005404444,0.0032974074,0.9027374,0.010329207,0.0003939103,0.00006674821,0.066307984],"study_design_scores_gemma":[0.0026595509,0.0005668716,0.0011029245,0.00084350293,0.00023079831,0.0011154722,0.0016852367,0.96146,0.029358646,0.00015882935,0.00015651526,0.0006616583],"about_ca_topic_score_codex":0.000011841008,"about_ca_topic_score_gemma":0.0000040811547,"teacher_disagreement_score":0.2885228,"about_ca_system_score_codex":0.00007297938,"about_ca_system_score_gemma":0.00004496938,"threshold_uncertainty_score":0.6915219},"labels":[],"label_agreement":null},{"id":"W2071226715","doi":"10.1007/s10951-006-8790-4","title":"Approximation algorithms for shop scheduling problems with minsum objective: A correction","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Approximation algorithm; Job shop scheduling; Algorithm; Flow shop scheduling; Mathematics; Schedule","score_opus":0.01281881357312941,"score_gpt":0.230134956859749,"score_spread":0.21731614328661958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071226715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13605961,0.0007611378,0.8609313,0.00007064141,0.0013858393,0.00028156387,0.0000032442401,0.00016008026,0.00034663163],"genre_scores_gemma":[0.3778686,0.000036260302,0.62101835,0.0000130133885,0.00088677224,0.0000222818,0.000012980245,0.000060944534,0.000080768754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984262,0.000024679313,0.0006900985,0.00017998513,0.00036162065,0.00031741383],"domain_scores_gemma":[0.99867797,0.00012731002,0.0003517144,0.00012540545,0.00062016805,0.000097451215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964482,0.00024129284,0.00034744845,0.00035239465,0.00015898264,0.00014770488,0.00014934989,0.0001456732,0.000009682778],"category_scores_gemma":[0.000098755234,0.0002104228,0.00014399055,0.0004545481,0.000035586465,0.0005493861,0.000009600904,0.00038386707,0.0000038626185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005361565,0.00006063578,0.00046730842,0.00009272301,0.00007762675,0.000003840669,0.00020947927,0.9899993,0.002050718,0.00007121559,0.00005250071,0.0068610534],"study_design_scores_gemma":[0.0015159283,0.00019528992,0.00021414841,0.00033458634,0.000087963606,0.0001935917,0.0006650843,0.9870935,0.008976422,0.00027766664,0.00016709573,0.00027873457],"about_ca_topic_score_codex":0.0000069716666,"about_ca_topic_score_gemma":0.0000065576714,"teacher_disagreement_score":0.241809,"about_ca_system_score_codex":0.00017710803,"about_ca_system_score_gemma":0.00008182069,"threshold_uncertainty_score":0.8580793},"labels":[],"label_agreement":null},{"id":"W2071356625","doi":"10.3138/infor.48.3.171","title":"Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration","year":2010,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Duration (music); Single-machine scheduling; Sequence (biology); Optimal maintenance; Time complexity; Mathematics; Algorithm; Schedule","score_opus":0.0328483672833578,"score_gpt":0.3003176171823294,"score_spread":0.2674692498989716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071356625","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83026886,0.000051914958,0.16543609,0.00020539641,0.00041193416,0.00082444225,0.000039568116,0.00023815199,0.0025236697],"genre_scores_gemma":[0.9809282,0.000009914418,0.018351005,0.000056552548,0.00018583577,0.00017106638,0.00021377292,0.00002005259,0.000063636195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982516,0.00008693703,0.00042135167,0.00015741476,0.00076671696,0.00031598387],"domain_scores_gemma":[0.99845517,0.00023993087,0.000074081676,0.00018471354,0.0008765666,0.00016954057],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017698298,0.0001886466,0.00018307412,0.00031406985,0.0005894618,0.0014679282,0.000107561136,0.00014343408,0.000032714946],"category_scores_gemma":[0.00020303283,0.00015076547,0.000021504466,0.00030766125,0.00011862081,0.003659058,0.00003182227,0.0006188604,0.000034912435],"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.00003810956,0.000017500737,0.00083100743,0.00018190408,0.000029721721,8.199909e-7,0.00072285155,0.97475624,0.0077918214,0.009444351,0.000030163481,0.006155484],"study_design_scores_gemma":[0.0007654483,0.00019996386,0.0010251622,0.00009651026,0.0000036253002,0.00008626151,0.00035952288,0.99434847,0.0015984304,0.00002035817,0.0012796761,0.00021659578],"about_ca_topic_score_codex":0.00009932224,"about_ca_topic_score_gemma":0.00009186283,"teacher_disagreement_score":0.15065932,"about_ca_system_score_codex":0.000084330466,"about_ca_system_score_gemma":0.00013703723,"threshold_uncertainty_score":0.99956864},"labels":[],"label_agreement":null},{"id":"W2071713280","doi":"10.1002/nav.20051","title":"A robust policy for serial agile production systems","year":2004,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Foundation","keywords":"Markovian arrival process; Computer science; Agile software development; Production (economics); Process (computing); Upstream (networking); Focus (optics); Operations research; Arrival time; Workstation; Mathematical optimization; Markov process; Markov decision process; Queueing theory; Industrial engineering; Economics; Mathematics; Microeconomics; Statistics; Telecommunications; Engineering","score_opus":0.15902731055303307,"score_gpt":0.3659694919759751,"score_spread":0.20694218142294205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071713280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009149398,0.0005667649,0.9779697,0.00096513634,0.003960527,0.0014427239,0.00012533915,0.0007662685,0.00505416],"genre_scores_gemma":[0.89812505,0.00026140647,0.09282198,0.000017586624,0.0062191114,0.00030843826,0.00012462176,0.00010980425,0.0020119927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.00005087387,0.00024111597,0.0002642578,0.00051148253,0.0005698097],"domain_scores_gemma":[0.99877506,0.0001470563,0.000023100276,0.0002923888,0.00060083286,0.00016156337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010492472,0.00013260424,0.00016414443,0.00029761528,0.00022185664,0.0001672505,0.00021256761,0.00015492448,0.000009135386],"category_scores_gemma":[0.003931727,0.00013176753,0.00004668144,0.0006063096,0.000117402466,0.00008542278,0.000039782975,0.00035842526,0.0000859359],"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.000033386492,0.00003496645,0.000005425059,0.0001425394,0.000020236306,0.000004159892,0.000116807416,0.9848166,0.0008491607,0.011461469,0.0016724874,0.0008427243],"study_design_scores_gemma":[0.001802517,0.000351498,0.000051948286,0.00015510047,0.000019367639,0.00003244683,0.00048057712,0.97347665,0.0076351203,0.0062764147,0.00927162,0.00044673763],"about_ca_topic_score_codex":0.00026390795,"about_ca_topic_score_gemma":0.000023318536,"teacher_disagreement_score":0.8889757,"about_ca_system_score_codex":0.0004743357,"about_ca_system_score_gemma":0.00026603637,"threshold_uncertainty_score":0.5373324},"labels":[],"label_agreement":null},{"id":"W2072214393","doi":"10.5539/jmr.v2n3p57","title":"Solving Single Machine Scheduling Problem with Maximum Lateness Using a Genetic Algorithm","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Single-machine scheduling; Due date; Mathematical optimization; Scheduling (production processes); Algorithm; Genetic algorithm; Job shop scheduling; Computer science; Schedule","score_opus":0.04796260677904627,"score_gpt":0.30928737256169725,"score_spread":0.26132476578265096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072214393","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3065916,0.00032547576,0.6922121,0.000055585664,0.00023281979,0.00014079481,0.0000022351132,0.000053083422,0.00038628376],"genre_scores_gemma":[0.08774337,0.000044374872,0.9118366,0.0000046228206,0.00025521297,0.0000028879724,7.362533e-7,0.000076075616,0.000036109574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979071,0.000048835842,0.000563473,0.000120040175,0.0009205424,0.00044002643],"domain_scores_gemma":[0.9983228,0.00021966816,0.00015236356,0.00024531438,0.00081074756,0.00024914264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017125333,0.00016745245,0.0003077891,0.00049189676,0.00016490619,0.00023280733,0.00035640446,0.00012305209,0.000098100165],"category_scores_gemma":[0.00021610597,0.00012953053,0.000068216796,0.00052481174,0.00009015369,0.00019967923,0.00005760448,0.0012446782,0.000011293809],"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.000013839832,0.00033877662,0.00016561737,0.00048920914,0.0001741051,0.0001865066,0.0014706146,0.9262211,0.047413893,0.00009032535,0.000022856699,0.023413204],"study_design_scores_gemma":[0.00050777174,0.00011354852,0.000017357006,0.000306993,0.000025678259,0.0009082295,0.00043496114,0.98889303,0.007060921,0.0015152182,0.000052861087,0.00016342264],"about_ca_topic_score_codex":0.000006593049,"about_ca_topic_score_gemma":0.000005088182,"teacher_disagreement_score":0.21962449,"about_ca_system_score_codex":0.000085000625,"about_ca_system_score_gemma":0.00015250075,"threshold_uncertainty_score":0.54075766},"labels":[],"label_agreement":null},{"id":"W2074379456","doi":"10.1115/msec2006-21111","title":"Agent-Based Dynamic Manufacturing Scheduling","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Profitability index; Scheduling (production processes); Computer science; Software; Manufacturing engineering; Dynamic priority scheduling; Advanced manufacturing; Productivity; Industrial engineering; Job shop scheduling; Engineering; Operations management; Business; Embedded system; Telecommunications; Operating system","score_opus":0.005886035071542907,"score_gpt":0.20214738105523275,"score_spread":0.19626134598368986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074379456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19392666,0.00013125401,0.7934834,0.000055877288,0.00033360778,0.000052828793,0.0000016760641,0.0011862633,0.010828459],"genre_scores_gemma":[0.7282926,0.0000030005763,0.2710933,0.000045571778,0.00004968287,0.0000045092,0.000020591748,0.000025195146,0.0004655173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946856,0.000005028789,0.00013931302,0.0001080872,0.00009609142,0.00018291108],"domain_scores_gemma":[0.999793,0.000018535682,0.000010903684,0.00012751124,0.000012255655,0.000037816917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004691716,0.00010535022,0.00007840821,0.00008269085,0.000047573896,0.000045602923,0.00007275988,0.00005144232,0.0002331628],"category_scores_gemma":[0.0000033151334,0.00010544639,0.00004117712,0.0000764687,0.000009580324,0.00005569213,0.0000062281583,0.00008431686,0.00014807399],"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":[6.401322e-7,0.0000066806374,0.000049132163,0.00001199034,0.00000437605,0.0000042620463,0.00000364789,0.9971876,0.0003387446,0.000067693116,0.00005394741,0.0022712818],"study_design_scores_gemma":[0.00022425459,0.0000029291275,0.000560383,0.000009022528,0.000004815344,0.0000013654638,0.000016317194,0.9716614,0.026979905,0.00006187965,0.00033597014,0.00014179292],"about_ca_topic_score_codex":0.000016925005,"about_ca_topic_score_gemma":0.000012989651,"teacher_disagreement_score":0.53436595,"about_ca_system_score_codex":0.000046327983,"about_ca_system_score_gemma":0.000006489258,"threshold_uncertainty_score":0.42999786},"labels":[],"label_agreement":null},{"id":"W2074693897","doi":"10.1108/13552510710829489","title":"A comparative study of heuristic algorithms to solve maintenance scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"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; Simulated annealing; Heuristics; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Heuristic; Job shop scheduling; Metaheuristic; Schedule; Mathematics","score_opus":0.03140479321001383,"score_gpt":0.31168796674356525,"score_spread":0.2802831735335514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074693897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45762196,0.00013263604,0.5414482,0.000038050326,0.00041779745,0.00020727566,0.0000027402682,0.000046546324,0.000084775675],"genre_scores_gemma":[0.7006919,0.00001718778,0.29911295,0.000020228108,0.000113888644,0.0000054921557,5.3606146e-7,0.000027665286,0.000010166921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971603,0.000034424473,0.0016510414,0.00018293787,0.00046783988,0.00050343],"domain_scores_gemma":[0.998501,0.00032388532,0.00031041793,0.00022138553,0.00044313818,0.00020016701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028970132,0.0002623602,0.0007855468,0.0005628331,0.000027798073,0.000029646573,0.00033134824,0.00008478454,0.00000600592],"category_scores_gemma":[0.00046790732,0.00024841123,0.000110436624,0.00089919794,0.000024483832,0.00019849314,0.00003888397,0.00061474973,0.0000037214295],"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.000065193664,0.00018852645,0.00065560103,0.00011423278,0.000082284336,0.000057842324,0.007351704,0.9888835,0.0015359296,0.00025975524,0.000030960226,0.00077448157],"study_design_scores_gemma":[0.00439665,0.00085962925,0.025603872,0.0018355051,0.00005389129,0.00012274065,0.029245611,0.9326885,0.0039189016,0.00019644389,0.00018599995,0.0008923049],"about_ca_topic_score_codex":0.000025285764,"about_ca_topic_score_gemma":0.000039727158,"teacher_disagreement_score":0.2430699,"about_ca_system_score_codex":0.00027152733,"about_ca_system_score_gemma":0.000036785084,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W2074707342","doi":"10.1007/s10479-013-1446-9","title":"Scheduling the two-machine open shop problem under resource constraints for setting the jobs","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Job shop scheduling; Theory of computation; Open shop; Computer science; Scheduling (production processes); Schedule; Mathematical optimization; Heuristic; Flow shop scheduling; Job shop; Distributed computing; Operations research; Mathematics; Algorithm; Artificial intelligence","score_opus":0.14985774713197367,"score_gpt":0.4181182125822349,"score_spread":0.2682604654502613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074707342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14922994,0.0032278202,0.5749714,0.19481726,0.00034413228,0.013126442,0.00020533227,0.0004024076,0.063675284],"genre_scores_gemma":[0.889232,0.00008494002,0.1079347,0.00056692946,0.00015382274,0.00060957816,0.000051789106,0.00004651136,0.0013197495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986182,0.0002025237,0.00031633137,0.00016941171,0.00032269448,0.0003708808],"domain_scores_gemma":[0.99797493,0.00070471264,0.000018221594,0.00039151835,0.00083901244,0.000071587194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002804582,0.00010505288,0.00012683615,0.000101855854,0.00079853967,0.00065457786,0.0007631099,0.000051316816,0.00029327648],"category_scores_gemma":[0.0004706795,0.000064331034,0.000051602372,0.00045951747,0.00025508605,0.0002759166,0.00017032417,0.00038921947,0.000055405242],"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.0000035203238,0.000020439324,0.000030332101,0.000016925556,0.000051692383,1.3137604e-7,0.0006393763,0.9787579,0.000613768,0.007995645,0.0036386335,0.0082316175],"study_design_scores_gemma":[0.00028153334,0.000030999356,0.00007799117,0.000045195844,0.000004145844,0.000003134657,0.0026091316,0.9916266,0.0028592087,0.0007102699,0.0016604045,0.00009136238],"about_ca_topic_score_codex":0.00021162127,"about_ca_topic_score_gemma":0.00008348179,"teacher_disagreement_score":0.74000204,"about_ca_system_score_codex":0.000015043258,"about_ca_system_score_gemma":0.00010155397,"threshold_uncertainty_score":0.6312109},"labels":[],"label_agreement":null},{"id":"W2076551060","doi":"10.1002/nav.21497","title":"Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Centre National de la Recherche Scientifique","keywords":"Price of anarchy; Scheduling (production processes); Job shop scheduling; Bounded function; Computer science; Constant (computer programming); Mathematical optimization; Minification; Job scheduler; Mathematical economics; Mathematics; Schedule; Economics; Cloud computing; Price of stability","score_opus":0.05297727917503071,"score_gpt":0.33129348522452784,"score_spread":0.27831620604949714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076551060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86791027,0.00037901886,0.11545549,0.0001039166,0.00023341723,0.00061583996,0.00008915844,0.00026815955,0.014944727],"genre_scores_gemma":[0.9743079,0.00003278836,0.025106156,0.0000049681344,0.00019199557,0.000016342936,0.00015625365,0.000042780583,0.00014079174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768555,0.00014155779,0.00037098976,0.00018728495,0.00087895023,0.00073564326],"domain_scores_gemma":[0.9987827,0.00040402045,0.000053604563,0.00019835771,0.00038120107,0.00018011888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076097,0.00017019873,0.00027497887,0.00044244755,0.00014137599,0.00004849117,0.00023005043,0.00017528744,0.00014977634],"category_scores_gemma":[0.0008570549,0.00015533449,0.00003719431,0.001402196,0.00024669684,0.00013418788,0.0000877,0.00070730376,0.00012314177],"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.0015670425,0.0017303613,0.01446863,0.000644129,0.0002427612,0.00011368018,0.0033553678,0.886785,0.044104498,0.033823814,0.0006499623,0.012514786],"study_design_scores_gemma":[0.0010320646,0.00017213545,0.0040793642,0.000057500183,0.000010187835,0.000010816265,0.00012540125,0.9924668,0.0016087148,0.0001594751,0.00008251906,0.00019502956],"about_ca_topic_score_codex":0.00014557235,"about_ca_topic_score_gemma":0.000011194621,"teacher_disagreement_score":0.10639766,"about_ca_system_score_codex":0.0002541573,"about_ca_system_score_gemma":0.0001291971,"threshold_uncertainty_score":0.63343567},"labels":[],"label_agreement":null},{"id":"W2077698456","doi":"10.1002/nav.20066","title":"On the asymptotic optimality of algorithms for the flow shop problem with release dates","year":2005,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Heuristics; Heuristic; Probabilistic logic; Focus (optics); Probabilistic analysis of algorithms; Computer science; Mathematical optimization; Asymptotically optimal algorithm; Algorithm; Flow (mathematics); Flow shop scheduling; Analysis of algorithms; Mathematics; Artificial intelligence; Job shop scheduling; Routing (electronic design automation)","score_opus":0.09894512376433645,"score_gpt":0.34545330772966626,"score_spread":0.2465081839653298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077698456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037871678,0.00059585803,0.9852685,0.0031439036,0.0001699378,0.0014776017,0.0001934518,0.000208556,0.0051550344],"genre_scores_gemma":[0.6991305,0.00024701693,0.29925132,0.00007895478,0.0003493357,0.00021985637,0.000041676492,0.00006865998,0.0006127286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980602,0.00011809828,0.00028190363,0.00024115879,0.00078664045,0.0005119991],"domain_scores_gemma":[0.9950193,0.003688088,0.00004071343,0.00056778337,0.00057138025,0.00011272492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021977848,0.0001706155,0.00018217161,0.00009294562,0.00030432496,0.000106172905,0.0005452765,0.00009743235,0.000079529476],"category_scores_gemma":[0.0021578255,0.00009213372,0.00006150922,0.0004409533,0.00038959872,0.00005856093,0.0000670848,0.00060808595,0.000038568647],"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.00009376884,0.00006984653,0.000021663283,0.0000613797,0.00006971913,0.0000023334603,0.0001364941,0.97397625,0.000037527396,0.009592044,0.0022446085,0.013694365],"study_design_scores_gemma":[0.00043208635,0.00024810105,0.00005223842,0.000054055028,0.000023000372,0.0000029086862,0.00017129176,0.9945313,0.0017826268,0.0012497964,0.0013277207,0.00012492794],"about_ca_topic_score_codex":0.00002695583,"about_ca_topic_score_gemma":0.000020078938,"teacher_disagreement_score":0.6953433,"about_ca_system_score_codex":0.00010613543,"about_ca_system_score_gemma":0.000115487215,"threshold_uncertainty_score":0.3757104},"labels":[],"label_agreement":null},{"id":"W2078385421","doi":"10.1016/j.cor.2010.10.013","title":"Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Transport Canada; Université Laval","funders":"","keywords":"Production planning; Scheduling (production processes); Computer science; Production (economics); Integer programming; Mathematical optimization; Production manager; Operations research; Mathematics; Algorithm","score_opus":0.060086847871840626,"score_gpt":0.3486038398374031,"score_spread":0.28851699196556246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078385421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928898,0.00004047612,0.0052821687,0.00031237016,0.00045898734,0.0008659663,7.650536e-7,0.00008431625,0.00006511855],"genre_scores_gemma":[0.9869705,0.0000025795746,0.012596314,0.0000064768587,0.00019890744,0.00017376573,0.0000060517878,0.000016246295,0.000029158537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987627,0.00021453701,0.00021016561,0.0002820765,0.0003060536,0.00022446946],"domain_scores_gemma":[0.99942714,0.00006385408,0.000008392161,0.00029221183,0.00015295263,0.00005543003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335099,0.00010637253,0.000116995194,0.00035713305,0.00039526357,0.0002432992,0.00013300964,0.000087908535,0.0000042407955],"category_scores_gemma":[0.00007681647,0.00008436059,0.000008340591,0.00094240083,0.000073840085,0.00019939172,0.000039822495,0.001320057,0.0000037997625],"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.000009461895,0.00010440148,0.037408095,0.000026917116,0.000013756097,0.00033819207,0.009027219,0.9524836,0.00008831322,0.00005431661,0.000046006513,0.00039972775],"study_design_scores_gemma":[0.000583781,0.00008612132,0.007138341,0.00009260266,0.0000041187036,0.0008335842,0.037443507,0.9535902,0.000100463614,7.394084e-7,0.000009120612,0.000117429365],"about_ca_topic_score_codex":0.00034388946,"about_ca_topic_score_gemma":0.0010068573,"teacher_disagreement_score":0.030269753,"about_ca_system_score_codex":0.000070544455,"about_ca_system_score_gemma":0.000058288242,"threshold_uncertainty_score":0.5735064},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"design_other","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"split"},{"id":"W2079550833","doi":"10.1016/j.cie.2005.01.019","title":"Flow shop vs. permutation shop with time delays","year":2005,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"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é du Québec à Chicoutimi","funders":"","keywords":"Flow shop scheduling; Permutation (music); Schedule; Job shop scheduling; Computer science; Flow (mathematics); Bounded function; Unit (ring theory); Mathematical optimization; Mathematics; Operating system","score_opus":0.011137198743218297,"score_gpt":0.1833768608229847,"score_spread":0.1722396620797664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079550833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06965108,0.000119113145,0.92639494,0.00020583854,0.0012927321,0.00023445139,0.000008967545,0.00168029,0.00041260786],"genre_scores_gemma":[0.5672414,0.000016809934,0.42871168,0.00008910816,0.003426154,0.00003131257,0.00013158466,0.00017528608,0.00017672131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.000010718438,0.000263528,0.00021709388,0.0002044679,0.00033279415],"domain_scores_gemma":[0.9995084,0.00007205695,0.000027086446,0.00019336533,0.000047476315,0.00015165102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011472644,0.00025760932,0.00023200175,0.0001862642,0.000055909946,0.00010637844,0.00017590716,0.00018112137,0.00007295394],"category_scores_gemma":[0.000025621699,0.00026657264,0.000055628756,0.0003619919,0.000014594656,0.00025109822,0.00002501077,0.00036128252,0.000109764886],"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.00001165531,0.000009108862,0.000018308658,0.000007808655,0.000052184318,0.0000066633897,0.00016767065,0.96534574,0.00015103101,0.000021331816,0.00076978887,0.033438686],"study_design_scores_gemma":[0.0010118189,0.00004561381,0.000022995251,0.00007601859,0.000023768685,0.000025743517,0.0000133713065,0.99399513,0.0008666784,6.133175e-7,0.0035837702,0.00033449155],"about_ca_topic_score_codex":0.0000014500615,"about_ca_topic_score_gemma":4.8501863e-7,"teacher_disagreement_score":0.49768326,"about_ca_system_score_codex":0.00014893599,"about_ca_system_score_gemma":0.000028494582,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W2079570072","doi":"10.1080/002075400411475","title":"A multi-level heuristic search algorithm for production scheduling","year":2000,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Computer science; Production (economics); Algorithm; Heuristic; Mathematics; Economics","score_opus":0.12154572932753757,"score_gpt":0.3902121092480238,"score_spread":0.26866637992048625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079570072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19851306,0.0010683303,0.7834728,0.0051891822,0.010502541,0.0007468756,0.00004228261,0.00019208212,0.00027285298],"genre_scores_gemma":[0.15336885,0.0010247169,0.8345651,0.000021634909,0.00594094,0.000039405622,0.000024468427,0.000065349086,0.004949555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976735,0.00010669578,0.0005209277,0.000242565,0.0011438108,0.00031247534],"domain_scores_gemma":[0.99617916,0.000096589436,0.000059827842,0.00016722562,0.003375726,0.00012146319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024730102,0.00012573187,0.00016396424,0.0007008707,0.00015781845,0.00013406071,0.00041910206,0.00008149371,0.00027615565],"category_scores_gemma":[0.00082435115,0.00012260319,0.000105669795,0.00044175325,0.00011793057,0.00040822924,0.000021814973,0.0006159877,0.00007102869],"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.0000861878,0.00014912526,0.00003714273,0.000025295272,0.00016034154,0.000011367399,0.00044818126,0.5048233,0.0032512331,0.000016430866,0.001514594,0.48947677],"study_design_scores_gemma":[0.0012939401,0.00016318943,0.00054277753,0.00020236832,0.000019980154,0.0005442848,0.00074561813,0.95642275,0.031172002,0.0002679327,0.008374538,0.00025059417],"about_ca_topic_score_codex":0.000007083848,"about_ca_topic_score_gemma":0.0000020705502,"teacher_disagreement_score":0.48922616,"about_ca_system_score_codex":0.00026595322,"about_ca_system_score_gemma":0.00013231678,"threshold_uncertainty_score":0.49996132},"labels":[],"label_agreement":null},{"id":"W2081207311","doi":"10.1007/s00170-014-6343-0","title":"Cyclic hybrid flow shop scheduling problem with limited buffers and machine eligibility constraints","year":2014,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Heuristics; Flow shop scheduling; Computer science; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Simulated annealing; Integer programming; Batch production; Operations research; Industrial engineering; Economics; Mathematics; Operations management; Engineering; Algorithm; Routing (electronic design automation)","score_opus":0.006187222570836608,"score_gpt":0.22345277130582683,"score_spread":0.2172655487349902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081207311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77276516,0.00019422625,0.22465777,0.0016946899,0.000299356,0.000077136225,0.000004193657,0.00018176441,0.00012569748],"genre_scores_gemma":[0.75462395,0.0001336903,0.24507599,0.00006863048,0.00006698263,0.0000031580673,0.0000025852385,0.000018784618,0.0000062476443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990763,0.000018177128,0.00034331743,0.00014011064,0.00024477855,0.00017733064],"domain_scores_gemma":[0.9993185,0.00012499354,0.00016769592,0.00017743418,0.00015658229,0.000054806867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002905977,0.00016189876,0.00021021388,0.000285036,0.000073606774,0.000060599526,0.00046975954,0.00006376073,0.00001642011],"category_scores_gemma":[0.00012477308,0.000112353286,0.000039862825,0.00007594923,0.0002525551,0.00014743663,0.00006569332,0.00047455897,0.0000024626277],"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.00008111711,0.000019073548,0.0003027119,0.00001348178,0.00017173047,0.000020141053,0.00006426608,0.82614267,0.0024707324,0.00031423476,0.000007157081,0.17039269],"study_design_scores_gemma":[0.0033337614,0.00030461422,0.00072187406,0.00033733016,0.00007251442,0.003303895,0.0003668993,0.4178839,0.5565332,0.015496425,0.0011859473,0.0004596322],"about_ca_topic_score_codex":0.0000014372444,"about_ca_topic_score_gemma":0.0000042983906,"teacher_disagreement_score":0.5540625,"about_ca_system_score_codex":0.00007377293,"about_ca_system_score_gemma":0.000019674835,"threshold_uncertainty_score":0.4581634},"labels":[],"label_agreement":null},{"id":"W2081245261","doi":"10.1109/tsmcc.2012.2213809","title":"Agent-Based Decision Support and Simulation for Wood Products Manufacturing","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","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":"Simon Fraser University","funders":"","keywords":"Mill; Decision support system; Doors; Steel mill; Computer science; Production (economics); Manufacturing engineering; Negotiation; Industrial engineering; Ontology; Engineering; Artificial intelligence; Mechanical engineering","score_opus":0.027431891209747733,"score_gpt":0.26618805332561174,"score_spread":0.238756162115864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081245261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006953839,0.007166966,0.98370343,0.000039857405,0.00036541236,0.0015050774,0.000035021905,0.00010468497,0.00012572546],"genre_scores_gemma":[0.9715447,0.006721968,0.02010386,0.000053683576,0.00017677323,0.0009690427,0.000023537594,0.000039221366,0.0003672175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999135,0.000023931956,0.00035324518,0.0002143378,0.00008906442,0.00018439261],"domain_scores_gemma":[0.99943656,0.00010386677,0.00006114362,0.00021291409,0.000039425577,0.00014611866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027574375,0.00017289781,0.00022463412,0.000092535825,0.00020701892,0.00007448631,0.000040797735,0.00008532342,0.0000079573565],"category_scores_gemma":[0.000003405202,0.00015204541,0.00003869402,0.00009029388,0.000032713964,0.000087353605,0.0000010273521,0.00008787062,0.000014661499],"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.000022053222,0.00015170092,0.000040023613,0.0013549377,0.000063126594,1.7015735e-7,0.00031196375,0.5461475,0.00016412915,0.00027415907,0.0004148541,0.45105535],"study_design_scores_gemma":[0.0010696128,0.00007362887,0.00014059327,0.0002552866,0.00019467689,0.000016733804,0.000094361894,0.5105834,0.002852266,0.000018794195,0.48427135,0.0004293083],"about_ca_topic_score_codex":0.0000020260898,"about_ca_topic_score_gemma":0.0000015517717,"teacher_disagreement_score":0.96459085,"about_ca_system_score_codex":0.000018951481,"about_ca_system_score_gemma":0.0000062335043,"threshold_uncertainty_score":0.6200232},"labels":[],"label_agreement":null},{"id":"W2081396989","doi":"10.1016/j.ipl.2013.05.005","title":"The complexity of two supply chain scheduling problems","year":2013,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"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 New Brunswick","funders":"Beijing Postdoctoral Science Foundation","keywords":"Unary operation; Bottleneck; Scheduling (production processes); Computer science; Component (thermodynamics); Binary number; Supply chain; Job shop scheduling; Product (mathematics); Mathematical optimization; Mathematics; Combinatorics; Arithmetic; Business; Operating system","score_opus":0.015604487879058953,"score_gpt":0.21738352685074533,"score_spread":0.20177903897168636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081396989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20019002,0.0002197763,0.7914505,0.0048368922,0.00041902091,0.0004252111,0.0000050788667,0.00059341587,0.0018600955],"genre_scores_gemma":[0.9166128,0.0000112733815,0.08258799,0.00065399555,0.00004311716,0.00004544573,0.000024724759,0.000011925649,0.0000087119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00001121365,0.00038436253,0.000046451903,0.0001863803,0.00018254083],"domain_scores_gemma":[0.99956876,0.000027100885,0.0001140099,0.00011785335,0.00013330276,0.000038975108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019079582,0.00009898306,0.00009081094,0.000079730096,0.00018263991,0.00024584407,0.00015912023,0.000029940848,0.00002359703],"category_scores_gemma":[0.000032992066,0.00007688625,0.000028316113,0.0002252557,0.00013959425,0.0011867033,0.000015003986,0.00012740504,0.00007070821],"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.0000012243542,0.0000035957496,0.00019326954,0.0001557016,0.000012076229,4.308888e-8,0.0019203515,0.94621927,0.0010624861,0.00042688978,0.00041678638,0.049588315],"study_design_scores_gemma":[0.00026055714,0.0000039551405,0.00037569628,0.00006389352,0.0000036674655,0.0000026371642,0.00030317667,0.99639654,0.0017190201,0.00031843572,0.00044344217,0.00010900007],"about_ca_topic_score_codex":0.000020472175,"about_ca_topic_score_gemma":0.0000012471836,"teacher_disagreement_score":0.7164228,"about_ca_system_score_codex":0.000029758801,"about_ca_system_score_gemma":0.000016030943,"threshold_uncertainty_score":0.31353304},"labels":[],"label_agreement":null},{"id":"W2081401598","doi":"10.1007/s10951-009-0109-9","title":"Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Schedule; Job scheduler; Mathematical optimization; Scheduling (production processes); Due date; Supply chain; Job shop scheduling; Batch processing; Batch production; Time complexity; Supply chain management; Parametric statistics; Algorithm; Mathematics; Operations management; Economics; Statistics; Queue; Business","score_opus":0.019058539760618463,"score_gpt":0.26216035725873044,"score_spread":0.24310181749811197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081401598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6849781,0.00021468672,0.31407177,0.000283425,0.00017543015,0.00016222111,0.000007098157,0.000026782,0.00008046869],"genre_scores_gemma":[0.5350656,0.000059941947,0.4646715,0.000026383554,0.00012623241,0.0000039273973,0.0000037191876,0.000017649489,0.00002508134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987704,0.000027502176,0.0006117618,0.00010074473,0.0002575702,0.00023198841],"domain_scores_gemma":[0.99915326,0.000118181444,0.00027356477,0.0001096668,0.00028263126,0.00006268357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164652,0.00016553226,0.00031263006,0.0001590438,0.00007229133,0.00005458857,0.00015369874,0.00006486398,0.000012339194],"category_scores_gemma":[0.000056151457,0.00011819421,0.00009871731,0.0003305437,0.00003485498,0.00034138304,0.000009086583,0.0002904273,0.0000012543085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102763,0.000039973656,0.00090641977,0.000035899277,0.00006788569,0.000007380976,0.0016485896,0.985731,0.001596476,0.00023520402,0.000004214501,0.009624173],"study_design_scores_gemma":[0.0018366836,0.00009145685,0.0042360774,0.00028374555,0.00004550356,0.00008465279,0.000678655,0.98665744,0.005628298,0.00028669712,0.000007685422,0.00016309577],"about_ca_topic_score_codex":0.000005790342,"about_ca_topic_score_gemma":0.000004099817,"teacher_disagreement_score":0.15059973,"about_ca_system_score_codex":0.000057009696,"about_ca_system_score_gemma":0.000047890888,"threshold_uncertainty_score":0.48198202},"labels":[],"label_agreement":null},{"id":"W2081646635","doi":"10.1080/07408170802375760","title":"Optimization of production control policies in failure-prone homogenous transfer lines","year":2009,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Parameterized complexity; Mathematical optimization; Production line; Computer science; Transfer line; Heuristic; Line (geometry); Mathematics; Algorithm; Engineering; Industrial engineering; Mechanical engineering","score_opus":0.008095758904509085,"score_gpt":0.20817028128519335,"score_spread":0.20007452238068427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081646635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03876229,0.00018125604,0.95933086,0.0008009861,0.00023302394,0.00023095567,0.000016048944,0.0002588041,0.00018580722],"genre_scores_gemma":[0.9675353,0.00015058166,0.03211802,0.000026861,0.00006824652,0.000019601408,0.000010760209,0.000017882512,0.000052703854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934006,0.00001832366,0.0002717557,0.000118083524,0.00009682652,0.00015496125],"domain_scores_gemma":[0.9997398,0.00001505134,0.000012650214,0.00012551167,0.00006956714,0.0000373984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007218641,0.00011416143,0.00016515802,0.00022394455,0.00005131077,0.000013624093,0.000057321948,0.00008313621,0.00006310509],"category_scores_gemma":[0.000008048125,0.00012218773,0.000054683373,0.00045189992,0.000025501968,0.00016779573,2.0963684e-7,0.0001239056,0.0000029692706],"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.000014884445,0.00008194754,0.000017778593,0.00001532571,0.000016721107,4.530761e-7,0.00073017867,0.9909897,0.0039129574,0.000023138158,0.0000065402246,0.004190385],"study_design_scores_gemma":[0.0010250154,0.00007878531,0.000977901,0.000041932853,0.0000579879,0.00001347142,0.00026873418,0.97294754,0.024262838,0.00004763078,0.00005809082,0.00022009511],"about_ca_topic_score_codex":0.000024402898,"about_ca_topic_score_gemma":0.00008082062,"teacher_disagreement_score":0.92877305,"about_ca_system_score_codex":0.000034178145,"about_ca_system_score_gemma":0.00001670586,"threshold_uncertainty_score":0.4982671},"labels":[],"label_agreement":null},{"id":"W2081840458","doi":"10.1145/1073970.1073983","title":"Scheduling malleable tasks with precedence constraints","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Rounding; Computer science; Scheduling (production processes); Speedup; Parallel computing; Approximation algorithm; Allotment; Mathematical optimization; Algorithm; Mathematics","score_opus":0.010061925031257558,"score_gpt":0.2120432341109385,"score_spread":0.20198130907968095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081840458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03992526,0.00016510738,0.84411836,0.0002234011,0.00012031946,0.0001017564,0.0000022919999,0.0010179238,0.114325605],"genre_scores_gemma":[0.5078237,0.000018034143,0.49126846,0.00006971532,0.00006231665,0.0000053104545,0.0000022998556,0.000014876715,0.00073529576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949217,0.000004576533,0.00010712095,0.00011140598,0.00010207075,0.00018263861],"domain_scores_gemma":[0.99973905,0.000020188834,0.000010448451,0.00012038556,0.000035721267,0.000074188356],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006354214,0.00009596715,0.000080472855,0.00004017258,0.000042144864,0.000042529748,0.00008132433,0.00004549839,0.001103888],"category_scores_gemma":[0.000011062077,0.00008050067,0.000014939837,0.00012095201,0.000040808136,0.00014417092,0.00000764406,0.00010319528,0.00023344847],"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.0000020973778,0.00000761923,0.0001645925,0.000007148454,0.000014807501,0.0000013416213,0.000072165436,0.98556155,0.0001224225,0.0004391251,0.000102737744,0.013504393],"study_design_scores_gemma":[0.00030902927,0.000014303519,0.00006538836,0.000027986665,0.0000058664245,0.000023240687,0.00016678443,0.99245435,0.00578928,0.000009068291,0.0009668237,0.00016789614],"about_ca_topic_score_codex":0.0000021158164,"about_ca_topic_score_gemma":0.000009454895,"teacher_disagreement_score":0.46789843,"about_ca_system_score_codex":0.000024739467,"about_ca_system_score_gemma":0.000015978492,"threshold_uncertainty_score":0.99980927},"labels":[],"label_agreement":null},{"id":"W2081872308","doi":"10.1016/j.ejor.2003.10.045","title":"A half-product based approximation scheme for agreeably weighted completion time variance","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","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":"Scheme (mathematics); Polynomial-time approximation scheme; Variance (accounting); Computer science; Product (mathematics); Mathematical optimization; Time complexity; Algorithm; Mathematics","score_opus":0.05691974236027591,"score_gpt":0.30408017325751946,"score_spread":0.24716043089724354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081872308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022367163,0.00022694335,0.9714913,0.0024196545,0.00023047706,0.00028906687,0.000013464575,0.000055555072,0.0029063716],"genre_scores_gemma":[0.31947485,0.000017607295,0.67927337,0.00007051509,0.00077379553,0.0000068775385,0.00008140272,0.00004685813,0.0002547337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983667,0.00022619429,0.000407752,0.00013177498,0.0006583167,0.00020921906],"domain_scores_gemma":[0.99816525,0.00012267503,0.000060936847,0.00013106856,0.0014116698,0.0001084288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031976977,0.00009887656,0.0001351303,0.00027577847,0.00020852775,0.00016244766,0.000225478,0.000020382013,0.0001420512],"category_scores_gemma":[0.0004879598,0.00009105848,0.00006304594,0.0003466446,0.000048540118,0.0002821611,0.000014371012,0.00031338594,0.00016905734],"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.000094946845,0.00009307614,0.000013000762,0.000042928415,0.00004428653,0.000020716383,0.00014714923,0.9679962,0.024646426,0.002607188,0.0021870185,0.00210708],"study_design_scores_gemma":[0.0021214022,0.00023072834,0.00066590006,0.000118350355,0.0000063923035,0.000042929416,0.000020374746,0.98431504,0.0070590843,0.00023070126,0.0050468864,0.00014221082],"about_ca_topic_score_codex":9.91253e-7,"about_ca_topic_score_gemma":2.558144e-7,"teacher_disagreement_score":0.2971077,"about_ca_system_score_codex":0.00014655817,"about_ca_system_score_gemma":0.00018526494,"threshold_uncertainty_score":0.3713257},"labels":[],"label_agreement":null},{"id":"W2082357232","doi":"10.1016/s0925-5273(01)00169-4","title":"The dual-phase learning–forgetting model","year":2002,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","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":"Toronto Metropolitan University","funders":"","keywords":"Forgetting; Task (project management); Computer science; Dual (grammatical number); Artificial intelligence; Machine learning; Cognitive psychology; Simple (philosophy); Interval (graph theory); Psychology; Mathematics; Engineering","score_opus":0.017724535416720092,"score_gpt":0.23815666758449236,"score_spread":0.22043213216777227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082357232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81035554,0.0012275213,0.15608221,0.011062973,0.017475955,0.00010989671,0.000004640413,0.00016723572,0.0035140314],"genre_scores_gemma":[0.96766824,0.0028336162,0.02564245,0.000060575225,0.0019410534,0.000002127294,0.0000024863057,0.0000278601,0.0018215994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938726,0.000010723234,0.000360071,0.00006319934,0.0000942747,0.00008446198],"domain_scores_gemma":[0.99945265,0.000030210958,0.00017301677,0.00006537115,0.00024145914,0.00003730527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030813832,0.00006482783,0.00007214402,0.000089487745,0.000083535335,0.000100654586,0.00015467765,0.000027578122,0.000038736896],"category_scores_gemma":[0.00019413109,0.00005503092,0.00006031207,0.000036037927,0.000022312975,0.00027736783,0.000011785009,0.00020791488,0.00002112856],"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.000007559808,0.000017760298,0.000027834007,8.9829047e-7,0.00006740886,0.0000012658036,0.00017999571,0.956695,0.00009520625,0.00027581028,0.0012737002,0.04135754],"study_design_scores_gemma":[0.0003183138,0.000016354019,0.000005577374,0.0000067106002,0.000006303902,0.00014247689,0.00009664573,0.98566073,0.001302396,0.0003683988,0.012016235,0.000059842736],"about_ca_topic_score_codex":2.3597264e-7,"about_ca_topic_score_gemma":4.7281108e-7,"teacher_disagreement_score":0.1573127,"about_ca_system_score_codex":0.00010210747,"about_ca_system_score_gemma":0.000011020924,"threshold_uncertainty_score":0.22440958},"labels":[],"label_agreement":null},{"id":"W2082466487","doi":"10.1016/j.ijar.2007.08.013","title":"Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines","year":2007,"lang":"en","type":"article","venue":"International Journal of Approximate Reasoning","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Job scheduler; Scheduling (production processes); Schedule; Fuzzy logic; Job shop scheduling; Batch processing; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.008588213284734778,"score_gpt":0.2725715511262319,"score_spread":0.2639833378414971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082466487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7180259,0.0004311409,0.27838573,0.000048914688,0.00034689947,0.000045384728,0.0000027955195,0.00004384068,0.0026693726],"genre_scores_gemma":[0.68015885,0.000042687003,0.31959173,0.000015562968,0.00014681015,7.8432396e-7,0.0000029306611,0.000028522441,0.0000121359335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984609,0.00001667113,0.0006580698,0.00011789654,0.0005204134,0.00022605823],"domain_scores_gemma":[0.9990035,0.00008384706,0.00030222847,0.000082155384,0.00044582802,0.00008243301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087988423,0.00016406075,0.00026676603,0.0005327903,0.000029647877,0.00007280722,0.00030340508,0.0000501008,0.000020052348],"category_scores_gemma":[0.00013409946,0.00014264305,0.00006957308,0.0003459372,0.000041535972,0.000375896,0.00002622815,0.00033604566,0.000001043485],"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.00016710974,0.00004022723,0.015074846,0.000055231343,0.00011340075,0.00014039593,0.00086088077,0.9620448,0.0016414459,0.0006316256,0.0000016666194,0.019228367],"study_design_scores_gemma":[0.0020466412,0.000039941755,0.0020721091,0.0012039435,0.000021982974,0.0002856263,0.0012897643,0.9881571,0.0044591883,0.00016673972,0.00003104326,0.00022593682],"about_ca_topic_score_codex":0.000034275366,"about_ca_topic_score_gemma":0.000043346692,"teacher_disagreement_score":0.041205987,"about_ca_system_score_codex":0.00012199651,"about_ca_system_score_gemma":0.00006686008,"threshold_uncertainty_score":0.5816815},"labels":[],"label_agreement":null},{"id":"W2083195002","doi":"10.1080/09537280410001662501","title":"Performance analysis of a multi-agent scheduling and control system under manufacturing disturbances","year":2004,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Adaptability; Flexibility (engineering); Control (management); Scheduling (production processes); Control system; Computer science; Architecture; Engineering; Control engineering; Operations management; Artificial intelligence; Mathematics","score_opus":0.012671114931510154,"score_gpt":0.2219372223486653,"score_spread":0.20926610741715515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083195002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61711955,0.0014033113,0.3805737,0.00006071987,0.00040466827,0.00015591914,0.000007703739,0.00025029056,0.000024154251],"genre_scores_gemma":[0.9865634,0.000042750686,0.013172551,0.000018563762,0.00012595556,0.000028928662,0.000010339584,0.000020489804,0.000017026905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900496,0.000022193555,0.00033651327,0.00026454226,0.0001678067,0.00020398299],"domain_scores_gemma":[0.9995527,0.000032607088,0.00010602948,0.00017644648,0.000067628345,0.0000645565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025723758,0.00016958608,0.00036169434,0.00029428193,0.00012318602,0.000039662536,0.00007239315,0.00006120021,0.0000030855902],"category_scores_gemma":[0.00003173787,0.0001615689,0.00007085769,0.00028659403,0.00003824186,0.00017098272,0.000006787508,0.0001389399,0.0000028767913],"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.00002642,0.000015265994,0.0111387195,0.000125455,0.00068734976,0.0000012081701,0.00029445722,0.9859541,0.0009983588,0.000018622302,8.922785e-7,0.00073916087],"study_design_scores_gemma":[0.0015091102,0.000019282706,0.04049878,0.00013140791,0.00061251206,0.000008626328,0.00044217223,0.95102245,0.005566407,0.0000015280506,0.000010187148,0.00017756446],"about_ca_topic_score_codex":0.000012391304,"about_ca_topic_score_gemma":0.000001771789,"teacher_disagreement_score":0.36944383,"about_ca_system_score_codex":0.00009157584,"about_ca_system_score_gemma":0.000012273619,"threshold_uncertainty_score":0.65885884},"labels":[],"label_agreement":null},{"id":"W2083859858","doi":"10.1504/ijps.2011.044546","title":"Inter-domain translational research on planning and scheduling: operating rooms vs. job shops","year":2011,"lang":"en","type":"article","venue":"International Journal of Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Industrial engineering; Translational research; Field (mathematics); Operations research; Operations management; Engineering; Mathematics; Medicine","score_opus":0.08679686363456976,"score_gpt":0.3415164192481073,"score_spread":0.25471955561353754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083859858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84030145,0.001915028,0.15433237,0.00029974853,0.0010238307,0.00006680243,0.000007397425,0.00007020499,0.0019831737],"genre_scores_gemma":[0.81395423,0.00005791988,0.18525247,0.00008287301,0.0005826399,0.0000029910439,0.000007089256,0.00003502218,0.000024767196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980163,0.000101730824,0.0006560641,0.00023651485,0.00067748135,0.000311921],"domain_scores_gemma":[0.9987705,0.00035924415,0.00013669516,0.00009678928,0.0004298209,0.00020699199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015941737,0.00022231328,0.00028097257,0.0007256815,0.00022330768,0.00026294723,0.00032672868,0.00014661379,0.000044351662],"category_scores_gemma":[0.00023088879,0.00021071722,0.00007434721,0.00017166193,0.000097939075,0.0003955297,0.000053127587,0.0010077114,0.000005127177],"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.00030517098,0.00006371252,0.05038443,0.00004237392,0.00039288183,0.0003415873,0.014705071,0.9239975,0.0013007498,0.001787692,0.000065699984,0.0066130883],"study_design_scores_gemma":[0.0025554164,0.0004249875,0.015091089,0.002457226,0.00004035982,0.00089697447,0.0081560565,0.96475035,0.0025046074,0.0021104298,0.00042668043,0.0005858095],"about_ca_topic_score_codex":0.0000075501825,"about_ca_topic_score_gemma":9.2259955e-7,"teacher_disagreement_score":0.04075282,"about_ca_system_score_codex":0.00005755016,"about_ca_system_score_gemma":0.000055685236,"threshold_uncertainty_score":0.8592799},"labels":[],"label_agreement":null},{"id":"W2084084982","doi":"10.1007/s10951-007-0043-7","title":"Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem","year":2007,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tabu search; Variable neighborhood search; Simulated annealing; Mathematical optimization; Hill climbing; Guided Local Search; Computer science; Local search (optimization); Scheduling (production processes); Beam search; Metaheuristic; Variable (mathematics); Search algorithm; Mathematics","score_opus":0.010202036304215211,"score_gpt":0.22944902329603215,"score_spread":0.21924698699181694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084084982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22473806,0.00044426383,0.7729392,0.00025617756,0.00024908961,0.00023891739,0.0000021706035,0.00015915028,0.0009729506],"genre_scores_gemma":[0.5031011,0.000007722463,0.4961869,0.00013349621,0.0004912182,0.0000011183408,0.0000020079842,0.00006368511,0.000012721201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972396,0.00004010116,0.001005599,0.0002468957,0.0006902737,0.00077751494],"domain_scores_gemma":[0.99792206,0.0004549067,0.00027052508,0.00029346786,0.0006478081,0.00041121274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034922457,0.0003232999,0.00041748615,0.00045351565,0.00034997019,0.00029203852,0.00048724265,0.00017919349,0.000036785543],"category_scores_gemma":[0.00030149965,0.0002321652,0.00012363245,0.0012749146,0.00006485251,0.00036788394,0.00006184979,0.0011697016,0.000010405326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001307503,0.000026166816,0.00026287162,0.000059188587,0.00015572,0.000049098635,0.0013424794,0.98254955,0.007502632,0.0003205155,0.000005868872,0.0075951815],"study_design_scores_gemma":[0.0012856723,0.0002152057,0.00006578019,0.00049614836,0.000091072696,0.00025691898,0.004170003,0.98468333,0.008178281,0.00006668456,0.00012796625,0.00036290742],"about_ca_topic_score_codex":0.000014766971,"about_ca_topic_score_gemma":0.0000034909856,"teacher_disagreement_score":0.27836305,"about_ca_system_score_codex":0.00017281334,"about_ca_system_score_gemma":0.00020296253,"threshold_uncertainty_score":0.9467422},"labels":[],"label_agreement":null},{"id":"W2084812016","doi":"10.1007/s10951-014-0387-8","title":"On-line preemptive machine scheduling with $$\\ell _p$$ ℓ p norm on two uniform machines","year":2014,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Preemption; Unavailability; Scheduling (production processes); Job shop scheduling; Computer science; Competitive analysis; Mathematical optimization; Upper and lower bounds; Mathematics; Combinatorics; Algorithm","score_opus":0.01192599861620092,"score_gpt":0.24210018299619737,"score_spread":0.23017418437999645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084812016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5294378,0.00033420438,0.4648752,0.0003194863,0.0008584602,0.0001344649,0.000007314013,0.00019030627,0.0038427853],"genre_scores_gemma":[0.7197867,0.00007313467,0.27894905,0.000243373,0.00077963964,0.0000027732992,0.000007420096,0.00008775314,0.00007015574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788374,0.000055319975,0.0007491559,0.00024522975,0.0006421883,0.0004243821],"domain_scores_gemma":[0.9983352,0.00035359734,0.00036877888,0.0003102894,0.00033616507,0.00029600962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008357525,0.00042158412,0.00054914254,0.00048261022,0.0001699516,0.00012477327,0.00037177643,0.00013015207,0.00008415478],"category_scores_gemma":[0.00028115182,0.00031675628,0.00017192049,0.00043368043,0.00006096438,0.00032867907,0.0000295542,0.0011001443,0.00006199807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022374539,0.00009322842,0.00037290342,0.000040008483,0.00014617367,0.000025249356,0.00024167544,0.9894463,0.00030187186,0.0011519495,0.000013515911,0.007943384],"study_design_scores_gemma":[0.0027491872,0.0009932901,0.00013554482,0.00062369654,0.00007786122,0.00014100298,0.00011449006,0.9896893,0.004423666,0.0005132444,0.00013147731,0.0004072547],"about_ca_topic_score_codex":0.0000074416666,"about_ca_topic_score_gemma":0.0000092839755,"teacher_disagreement_score":0.19034891,"about_ca_system_score_codex":0.00013865641,"about_ca_system_score_gemma":0.00005609681,"threshold_uncertainty_score":0.9999285},"labels":[],"label_agreement":null},{"id":"W2085242433","doi":"10.1007/s00170-002-1468-y","title":"Real-time scheduling with deadlock avoidance in flexible manufacturing systems","year":2003,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":31,"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 Windsor","funders":"","keywords":"Scheduling (production processes); Downtime; Flexible manufacturing system; Schedule; Deadlock; Computer science; Routing (electronic design automation); Deadlock prevention algorithms; Job shop scheduling; Petri net; Distributed computing; Flexibility (engineering); Real-time computing; Mathematical optimization; Embedded system; Mathematics","score_opus":0.00605177093928277,"score_gpt":0.22056785875123686,"score_spread":0.21451608781195408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085242433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96793133,0.00050337764,0.028923543,0.00035983563,0.00091167114,0.00012344858,0.0000018683305,0.00026998387,0.00097496295],"genre_scores_gemma":[0.90004224,0.00046175637,0.09920131,0.000020447591,0.00009037486,0.000010415418,0.0000011768769,0.00004256839,0.00012972044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986514,0.000029387873,0.00051259313,0.00015596239,0.00035961965,0.0002910732],"domain_scores_gemma":[0.9992272,0.000112275266,0.00024194816,0.00023979857,0.00012938937,0.000049383496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003548781,0.00020558358,0.00028102437,0.00059239374,0.000058603695,0.00006632308,0.0007290578,0.00011771929,0.000023875464],"category_scores_gemma":[0.000073906376,0.0001527267,0.00005158752,0.00015838249,0.0000686684,0.00025525977,0.000042380405,0.00057276455,0.000016597422],"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.000047101785,0.00001784452,0.00010531024,0.000012249791,0.00009312331,0.000077140685,0.000059193793,0.99052316,0.0051132734,0.00072382996,0.000009213495,0.0032185367],"study_design_scores_gemma":[0.0016530231,0.000093308154,0.00030210312,0.00043601904,0.00002092207,0.0015593802,0.0007551082,0.025620507,0.96530527,0.0026581222,0.0012678213,0.00032844458],"about_ca_topic_score_codex":0.000007266017,"about_ca_topic_score_gemma":0.0000046364285,"teacher_disagreement_score":0.9649027,"about_ca_system_score_codex":0.00026954143,"about_ca_system_score_gemma":0.000043386695,"threshold_uncertainty_score":0.62280136},"labels":[],"label_agreement":null},{"id":"W2085583139","doi":"10.1016/j.rcim.2007.09.010","title":"Design patterns for real-time distributed control system benchmarking","year":2008,"lang":"en","type":"article","venue":"Robotics and Computer-Integrated Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"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":"Benchmarking; Scheduling (production processes); Computer science; Automation; Control (management); Embedded system; Distributed computing; Control system; Software; Systems engineering; Industrial engineering; Engineering; Operating system","score_opus":0.011914637493710049,"score_gpt":0.1884891577799322,"score_spread":0.17657452028622214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085583139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030543948,0.000048688973,0.96768326,0.000017689901,0.0005164648,0.00034415914,0.00006267924,0.0007526315,0.000030486637],"genre_scores_gemma":[0.6900233,0.00009684974,0.30937222,0.000017415907,0.0002469849,0.000022319995,0.00015235064,0.000050156537,0.000018415492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888885,0.000035440877,0.0003244855,0.00027122055,0.00012018109,0.00035980082],"domain_scores_gemma":[0.99937105,0.00018001081,0.000060959985,0.00017924552,0.00007176797,0.00013694188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012928784,0.00028200683,0.00035041422,0.0000981282,0.00023371303,0.00010713502,0.00013317527,0.00012478343,0.0000068822646],"category_scores_gemma":[0.0000038608946,0.0002641969,0.00007120007,0.00007185815,0.00002119069,0.00008042859,0.000022384924,0.00015491298,0.0000058566757],"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.000013706543,0.000011442703,0.00007105088,0.00009222273,0.000088572015,0.000023952996,0.000070228634,0.9962548,0.000065023814,0.000056634024,0.00014754495,0.0031048462],"study_design_scores_gemma":[0.00087016413,0.000073077186,0.0005609836,0.00015495185,0.00004029939,0.000073656964,0.0000306756,0.9946483,0.0031975056,0.000008629882,0.000040467006,0.00030131912],"about_ca_topic_score_codex":0.000024402065,"about_ca_topic_score_gemma":9.694812e-7,"teacher_disagreement_score":0.6594793,"about_ca_system_score_codex":0.00010036367,"about_ca_system_score_gemma":0.000017981327,"threshold_uncertainty_score":0.99998105},"labels":[],"label_agreement":null},{"id":"W2086111473","doi":"10.1016/j.cor.2004.01.001","title":"Parallel machine selection and job scheduling to minimize machine cost and job tardiness","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Computer science; Tabu search; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Selection (genetic algorithm); Due date; Heuristic; Algorithm; Schedule; Artificial intelligence; Mathematics","score_opus":0.03315502815199124,"score_gpt":0.3158891169154314,"score_spread":0.2827340887634402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086111473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15206993,0.0007387109,0.84462094,0.001554993,0.0002122264,0.0004373789,0.000011661816,0.00019252054,0.00016164331],"genre_scores_gemma":[0.45565325,0.00026401604,0.54355586,0.000088919434,0.00015175978,0.00007502662,0.000034479337,0.00003526841,0.00014139795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987723,0.00007247026,0.00022249823,0.0003135848,0.0002704589,0.0003486938],"domain_scores_gemma":[0.9992415,0.00008318367,0.000005974507,0.00017170467,0.00024181548,0.00025583198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004528771,0.00016174011,0.00017952152,0.00039021758,0.000515301,0.0004078597,0.00014178347,0.000081488484,0.000022813529],"category_scores_gemma":[0.000098236414,0.00016416011,0.000022446398,0.0006967742,0.000057660825,0.00020636889,0.00011113828,0.00038474277,0.000031067408],"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.000012388091,0.00001734325,0.00056630495,0.000021819247,0.000026268226,0.0000038304274,0.00043321564,0.9921819,0.0004987041,0.00050663593,0.00008533274,0.00564629],"study_design_scores_gemma":[0.00095083273,0.000051512416,0.0023054879,0.00004860081,0.0000060648485,0.000035967743,0.00007211778,0.9956868,0.00034196704,0.000040905103,0.00027476676,0.00018497332],"about_ca_topic_score_codex":0.00025010994,"about_ca_topic_score_gemma":0.00027385927,"teacher_disagreement_score":0.30358332,"about_ca_system_score_codex":0.00011575014,"about_ca_system_score_gemma":0.000056045246,"threshold_uncertainty_score":0.6694255},"labels":[],"label_agreement":null},{"id":"W2087358380","doi":"10.3166/jesa.37.391-404","title":"Balanced hoist scheduling problem with unbounded or zero-width processing windows","year":2003,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hoist (device); Computer science; Scheduling (production processes); Mathematical optimization; Mathematics; Engineering; Structural engineering","score_opus":0.014984027384574316,"score_gpt":0.2334175349915036,"score_spread":0.21843350760692928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087358380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08901047,0.0019389337,0.8973701,0.00006404255,0.0005082543,0.00039197254,0.000005191249,0.0015007227,0.009210299],"genre_scores_gemma":[0.4987239,0.00010939252,0.50028104,0.000046251775,0.00011813758,0.000015406315,0.0000032458777,0.00012161383,0.0005810429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976889,0.00018637278,0.0007045341,0.00028129478,0.0005173194,0.00062157377],"domain_scores_gemma":[0.9988127,0.000070883216,0.00027420936,0.00024674594,0.0002906513,0.00030482755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006362636,0.00040607806,0.00046820258,0.00024617187,0.0005591108,0.00082951324,0.00027665947,0.00012163407,0.00014329699],"category_scores_gemma":[0.00017612109,0.00029752209,0.00008968596,0.00084451685,0.00010609455,0.0006283799,0.0000190762,0.00054605474,0.00006044376],"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.00003576114,0.00007127187,0.0020348527,0.00051064417,0.00020585285,0.0002551915,0.0011131493,0.8740362,0.00060884136,0.00025677134,0.00022577902,0.12064569],"study_design_scores_gemma":[0.003514134,0.00036330833,0.011874725,0.0024745008,0.0001726083,0.006733658,0.00058100605,0.9673673,0.0021545454,0.002019864,0.0014904963,0.0012538492],"about_ca_topic_score_codex":0.000002743868,"about_ca_topic_score_gemma":0.000009167005,"teacher_disagreement_score":0.40971342,"about_ca_system_score_codex":0.0002721536,"about_ca_system_score_gemma":0.000268872,"threshold_uncertainty_score":0.99994767},"labels":[],"label_agreement":null},{"id":"W2087393302","doi":"10.1111/j.1467-8640.2005.00278.x","title":"APPLYING MACHINE LEARNING TO LOW-KNOWLEDGE CONTROL OF OPTIMIZATION ALGORITHMS","year":2005,"lang":"en","type":"article","venue":"Computational Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Irish Research Council; Science Foundation Ireland","keywords":"Computer science; Machine learning; Domain knowledge; Algorithm; Artificial intelligence; Control (management); Set (abstract data type); Optimization algorithm; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.015170915684077952,"score_gpt":0.26136747809042954,"score_spread":0.2461965624063516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087393302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062097824,0.00059209875,0.99738556,0.00007010338,0.00019889789,0.00024375072,0.000008286212,0.00023718138,0.0006431633],"genre_scores_gemma":[0.5590617,0.000021037966,0.44058394,0.00008347938,0.00009775974,0.000038996815,0.000034299235,0.000020619542,0.000058141784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991186,0.000026805363,0.00035472587,0.00016422528,0.00017643225,0.00015917973],"domain_scores_gemma":[0.9992562,0.0001884615,0.000047967973,0.00008338904,0.00033019925,0.00009376949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000162923,0.00013427295,0.000162189,0.00017488743,0.000069125395,0.000028939528,0.00015219956,0.000052107524,0.00014965166],"category_scores_gemma":[0.000107581676,0.00014975094,0.000046480647,0.00039566908,0.000025557554,0.00010961704,0.000021096665,0.00014298121,0.00013866939],"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.000004970265,0.00002647106,0.000039805487,0.000019632434,0.000018542722,3.6044193e-7,0.00036278417,0.92512447,0.000034278088,0.00034750043,0.000018608967,0.0740026],"study_design_scores_gemma":[0.00012695836,0.000024029498,0.000022996546,0.000041253727,0.000007470315,0.0000038417675,0.000057649133,0.9973548,0.0015855796,0.00007974034,0.0005414417,0.0001542598],"about_ca_topic_score_codex":0.000002766836,"about_ca_topic_score_gemma":0.0000013298843,"teacher_disagreement_score":0.55844074,"about_ca_system_score_codex":0.000058365786,"about_ca_system_score_gemma":0.00002381762,"threshold_uncertainty_score":0.61066663},"labels":[],"label_agreement":null},{"id":"W2087681531","doi":"10.1016/j.dam.2010.02.010","title":"Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"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; Scheduling (production processes); Mathematical optimization; Due date; Job shop scheduling; Mathematics; Computer science; Time complexity; Assignment problem; Algorithm; Schedule","score_opus":0.009948922805564427,"score_gpt":0.2184411400504964,"score_spread":0.20849221724493197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087681531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1603629,0.000023209914,0.83589494,0.00008682292,0.000288149,0.0008043498,0.000024759818,0.00015571644,0.0023591355],"genre_scores_gemma":[0.3226943,0.000023714307,0.67682433,0.00004973195,0.00004673605,0.00022428857,0.00003505782,0.000067771165,0.000034087676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988386,0.0000058362966,0.00037879738,0.00026216905,0.00019531605,0.00031928063],"domain_scores_gemma":[0.9994098,0.000050104725,0.000048322596,0.0003244211,0.000007783278,0.00015958556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023615085,0.00024756306,0.0003016228,0.00011743885,0.000053889187,0.00010406691,0.00016867944,0.00012304987,0.00006625822],"category_scores_gemma":[0.000024596715,0.00024176348,0.000024016494,0.00016417529,0.000036188143,0.00006689131,0.00009181164,0.0002507551,0.00006359245],"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.000033044304,0.0002593854,0.00016287455,0.0007198656,0.0001246895,0.000025868103,0.0076405895,0.766657,0.20680839,0.0063427263,0.00005893224,0.011166651],"study_design_scores_gemma":[0.0018349678,0.000021430611,0.00045656253,0.00015665586,0.00005843537,0.000026049938,0.0010276833,0.96859866,0.022167437,0.003365347,0.0013727307,0.00091406616],"about_ca_topic_score_codex":0.000003373413,"about_ca_topic_score_gemma":0.00000551434,"teacher_disagreement_score":0.20194164,"about_ca_system_score_codex":0.000026816419,"about_ca_system_score_gemma":0.0000075978787,"threshold_uncertainty_score":0.9858829},"labels":[],"label_agreement":null},{"id":"W2088390964","doi":"10.1115/imece2004-62040","title":"Agent-Based Distributed Collaborative Sourcing of Stamped Parts","year":2004,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Supply chain; Computer science; Task (project management); Process (computing); Negotiation; Production (economics); Product (mathematics); Manufacturing engineering; Process management; Supply chain management; Multi-agent system; Distributed manufacturing; Domain (mathematical analysis); Systems engineering; Business; Engineering","score_opus":0.00878260522290103,"score_gpt":0.21492496651509974,"score_spread":0.2061423612921987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088390964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06525181,0.000066643595,0.93301505,0.00007866267,0.00013046271,0.00008441293,0.00004784601,0.0003048636,0.0010202407],"genre_scores_gemma":[0.9078575,0.000004807956,0.09198944,0.000026972555,0.000016846441,0.000005768451,0.00006199014,0.000012893168,0.000023803972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995653,0.000007811257,0.00014730761,0.00007225147,0.00009517464,0.00011213642],"domain_scores_gemma":[0.9997216,0.00002285069,0.000022334325,0.00009903247,0.00008514928,0.00004904014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047470872,0.00007657031,0.00010496145,0.000042048177,0.000026282254,0.000013626919,0.000047162615,0.000038584665,0.000083782776],"category_scores_gemma":[0.000027440108,0.00007298028,0.000024739245,0.00032175868,0.000018159268,0.00003853003,0.0000047506046,0.00004522056,0.0000126969735],"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.0000031201691,0.00001701408,0.000092829185,0.000013840046,0.0000139576005,0.0000014267813,0.00016963804,0.9988225,0.0003940387,0.00019692299,0.00007205886,0.00020265151],"study_design_scores_gemma":[0.0014759825,0.000037049896,0.00023344696,0.00004187356,0.000015845486,4.811913e-7,0.00079194846,0.72121006,0.2755546,0.000088075605,0.0003520587,0.00019859617],"about_ca_topic_score_codex":0.000008862235,"about_ca_topic_score_gemma":0.000007472521,"teacher_disagreement_score":0.84260565,"about_ca_system_score_codex":0.000042012165,"about_ca_system_score_gemma":0.00003820451,"threshold_uncertainty_score":0.29760495},"labels":[],"label_agreement":null},{"id":"W2090170663","doi":"10.1139/x05-267","title":"Scheduling fire-fighting tasks using the concept of \"deteriorating jobs\"","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Forest Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Firefighting; Wildfire suppression; Software deployment; Scheduling (production processes); Computer science; Environmental science; Environmental resource management; Operations research; Engineering; Operations management; Geography; Cartography","score_opus":0.044086679057140934,"score_gpt":0.30090298239397295,"score_spread":0.25681630333683203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090170663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806977,0.0024836631,0.015564343,0.00013053087,0.00032321425,0.00008377101,0.000007790136,0.000010763412,0.00069826155],"genre_scores_gemma":[0.9661117,0.000008256278,0.03334134,0.000008290051,0.0004661878,9.632088e-7,0.0000021510384,0.000027753478,0.000033343145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850655,0.000096085816,0.0004774835,0.000078796744,0.00037860364,0.00046245777],"domain_scores_gemma":[0.9986845,0.0002072682,0.00011245342,0.00015983496,0.00059260207,0.00024333161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272826,0.0000981372,0.00017993571,0.0003438865,0.00033412734,0.00014706151,0.00034439244,0.000079541365,0.000062059764],"category_scores_gemma":[0.00036512956,0.00007797983,0.000077958364,0.00062217726,0.00020354278,0.00015591213,0.000013805381,0.0006207144,0.0000023712948],"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.0000021515752,0.0000027873677,0.014369616,0.000017698781,0.00001930555,0.000044876895,0.00044172542,0.9821749,0.00079272717,0.00029367598,0.00014579736,0.0016947642],"study_design_scores_gemma":[0.0004167481,0.0000760996,0.0059337174,0.00038241714,0.000015935051,0.00014636159,0.0016247611,0.98488736,0.005314438,0.0003901755,0.0006379737,0.00017403216],"about_ca_topic_score_codex":0.0056425156,"about_ca_topic_score_gemma":0.0077595594,"teacher_disagreement_score":0.017777,"about_ca_system_score_codex":0.00019700493,"about_ca_system_score_gemma":0.00068623165,"threshold_uncertainty_score":0.85298336},"labels":[],"label_agreement":null},{"id":"W2090543144","doi":"10.1145/2344422.2344430","title":"An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tardiness; Due date; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Computer science; Retard; Mathematics; Schedule; Medicine; Operating system","score_opus":0.013286626800288642,"score_gpt":0.2519840459485223,"score_spread":0.23869741914823367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090543144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032840203,0.00009448821,0.9652341,0.00015678703,0.00054360233,0.00047009683,0.00020515622,0.00029715753,0.00015843073],"genre_scores_gemma":[0.61783797,0.000015873975,0.3814513,0.000018367318,0.00015548499,0.00024340746,0.000055962704,0.000063054715,0.00015859627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989735,0.000027021708,0.0002665684,0.00018656797,0.00020415583,0.00034222446],"domain_scores_gemma":[0.9988767,0.00027741282,0.000050197366,0.00054111605,0.00012598159,0.00012860188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015854994,0.00023075435,0.0002317229,0.00006918195,0.0001930317,0.000039486975,0.00027200812,0.00009808653,0.00019190948],"category_scores_gemma":[0.000012359432,0.00015960744,0.0000935993,0.00035886595,0.00007422245,0.00029419182,0.0000031115937,0.00018360109,0.000018227025],"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.00040794542,0.0015724598,0.0013521924,0.00033567418,0.0014302572,0.000004782559,0.0033283744,0.663873,0.000884955,0.00026648433,0.00033780027,0.32620606],"study_design_scores_gemma":[0.0019360475,0.00023665075,0.0028003529,0.00007242519,0.00034377893,0.00011298283,0.00084826065,0.97881734,0.013320482,0.000097140444,0.0008419468,0.0005725874],"about_ca_topic_score_codex":0.000030773732,"about_ca_topic_score_gemma":0.000009666903,"teacher_disagreement_score":0.5849977,"about_ca_system_score_codex":0.000031196698,"about_ca_system_score_gemma":0.00002146995,"threshold_uncertainty_score":0.65086025},"labels":[],"label_agreement":null},{"id":"W2090986925","doi":"10.1016/s0196-6774(02)00251-1","title":"A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Approximation algorithm; Open shop; Mathematics; Algorithm; Mathematical optimization; Computer science; Job shop scheduling; Flow shop scheduling","score_opus":0.024416593517046954,"score_gpt":0.24623961560496757,"score_spread":0.22182302208792062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090986925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007605253,0.0014589775,0.99447376,0.00043473058,0.0005400076,0.0010338414,0.00003244503,0.00007166513,0.0011940739],"genre_scores_gemma":[0.0028419865,0.0003855425,0.9950391,0.00008771419,0.0006026574,0.000107365275,0.000007628575,0.00007276869,0.0008552127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985694,0.000050552262,0.0005305199,0.00017412109,0.00037663843,0.00029876656],"domain_scores_gemma":[0.9985582,0.00022047157,0.00030218475,0.0002139439,0.0005834793,0.00012170155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005480985,0.00024454322,0.00037480288,0.00015025598,0.00017812473,0.00026693215,0.0005658198,0.00010106269,0.00009796116],"category_scores_gemma":[0.00004273888,0.00015374801,0.000136529,0.00039004534,0.00006198096,0.00058426184,0.00004246086,0.00030984762,0.000009344883],"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.00012002238,0.0002641385,0.00003969155,0.000056218694,0.0012153352,0.000026204385,0.0049446146,0.37888578,0.000095136886,0.000183348,0.0063977563,0.60777175],"study_design_scores_gemma":[0.0028345382,0.00042801845,0.00005198521,0.000082438404,0.00014351071,0.0001988162,0.00076057256,0.991533,0.0011414754,0.00023110569,0.002351141,0.00024341901],"about_ca_topic_score_codex":0.000008949107,"about_ca_topic_score_gemma":0.000004015275,"teacher_disagreement_score":0.6126472,"about_ca_system_score_codex":0.00013161972,"about_ca_system_score_gemma":0.000044259854,"threshold_uncertainty_score":0.62696624},"labels":[],"label_agreement":null},{"id":"W2091606894","doi":"10.1002/cjce.20039","title":"A genetic‐algorithm‐based optimal scheduling system for full‐filled tanks in the processing of starting materials for alumina production","year":2008,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Raw material; Slurry; Initialization; Population; Mathematical optimization; Process engineering; Genetic algorithm; Scheduling (production processes); Computer science; Production (economics); Environmental science; Engineering; Mathematics; Environmental engineering; Chemistry","score_opus":0.012430886167132766,"score_gpt":0.20093900901777298,"score_spread":0.18850812285064023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091606894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6756098,0.0004206434,0.3230384,0.0001372132,0.0004421578,0.00030984997,0.000012819678,0.000025698391,0.0000034195964],"genre_scores_gemma":[0.74053615,0.0000012703495,0.2590312,0.000008934908,0.00035656642,0.000031435742,0.0000026744958,0.00003081598,9.585866e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988302,0.000015990652,0.0005677035,0.000094572184,0.0001877967,0.00030373316],"domain_scores_gemma":[0.99923724,0.000116695664,0.00014493694,0.00011832034,0.0002744357,0.000108401386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083080627,0.00014434598,0.0002691583,0.00016838394,0.00010112195,0.00004426,0.00024596282,0.00008258987,0.0000019397826],"category_scores_gemma":[0.00042419744,0.000108617554,0.00008423919,0.00023593733,0.000042584983,0.00008159797,0.000003638398,0.00018737954,1.5390285e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018195267,0.0000043513674,0.0000058662567,0.00029509785,0.00001904581,0.000005710473,0.0006895391,0.9388219,0.05932185,0.000010125465,0.000016883761,0.0007914019],"study_design_scores_gemma":[0.0004378284,0.000027305048,0.000010945947,0.00028632864,0.000028950048,0.000122966,0.00017388922,0.77984923,0.21892975,0.0000040805994,0.000023544218,0.00010517474],"about_ca_topic_score_codex":0.000046826404,"about_ca_topic_score_gemma":0.000011513658,"teacher_disagreement_score":0.1596079,"about_ca_system_score_codex":0.00022545419,"about_ca_system_score_gemma":0.00027408195,"threshold_uncertainty_score":0.44292954},"labels":[],"label_agreement":null},{"id":"W2091706292","doi":"10.1080/00207540903055685","title":"Hybrid simulated annealing with memory: an evolution-based diversification approach","year":2009,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Simulated annealing; Metaheuristic; Computer science; Heuristics; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Economic shortage; Job shop; Artificial intelligence; Flow shop scheduling; Algorithm; Mathematics","score_opus":0.04930509127594975,"score_gpt":0.3286149233449412,"score_spread":0.27930983206899146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091706292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62196445,0.00021688468,0.37309247,0.0023745557,0.0011982912,0.0002172801,0.000005836135,0.00015508123,0.0007751476],"genre_scores_gemma":[0.96560824,0.000019136523,0.03343612,0.000020615327,0.00079566176,0.0000013739796,0.000030655465,0.000013904381,0.00007427351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823666,0.00009982534,0.00027826143,0.00016021311,0.00105905,0.00016596651],"domain_scores_gemma":[0.9970645,0.00003650473,0.00009086413,0.00015499517,0.0025507503,0.00010241045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011290519,0.00008814151,0.000102422266,0.0006680061,0.00010886855,0.00011142064,0.00033445627,0.000039236544,0.000031831903],"category_scores_gemma":[0.0002148679,0.00007767742,0.000038147453,0.00034942853,0.000054409968,0.0004773241,0.0000071138547,0.00039386496,0.000007815322],"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.0001362547,0.00011297148,0.00018637895,0.0000045860834,0.000047638394,0.000010937005,0.0001586076,0.9916221,0.001573052,0.00008854299,0.00032001513,0.005738905],"study_design_scores_gemma":[0.00074360793,0.00023525172,0.001867911,0.000050727667,0.000011064397,0.00011287214,0.00041305932,0.984029,0.011940795,0.00027630586,0.00019735172,0.00012204321],"about_ca_topic_score_codex":0.000008382414,"about_ca_topic_score_gemma":4.536506e-7,"teacher_disagreement_score":0.3436438,"about_ca_system_score_codex":0.00029838918,"about_ca_system_score_gemma":0.00011301234,"threshold_uncertainty_score":0.31675932},"labels":[],"label_agreement":null},{"id":"W2091736936","doi":"10.3166/ts.28.477-513","title":"egmentation multi-échelle. Injection d'a priori spatial dans la construction d'une hiérarchie optimale de régions","year":2011,"lang":"fr","type":"article","venue":"Traitement du signal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.023274617804525367,"score_gpt":0.23321872918256445,"score_spread":0.2099441113780391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091736936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10730961,0.00020789825,0.8870869,0.00023021363,0.0015708928,0.00037458452,0.00004961922,0.00029283526,0.0028774277],"genre_scores_gemma":[0.40268704,0.00019753982,0.59585273,0.000035271605,0.00048451527,0.000061883795,0.00010337126,0.00006306927,0.00051459705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982004,0.00019673198,0.0005338884,0.00034495382,0.0002661962,0.00045778384],"domain_scores_gemma":[0.99932414,0.00007060229,0.00014016242,0.00016434574,0.0000937777,0.00020699741],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031645317,0.000319952,0.00022460753,0.00020989862,0.0002443483,0.00008556285,0.00014251267,0.00024287328,0.0015405045],"category_scores_gemma":[0.000021584454,0.00039627196,0.00013460593,0.00035458716,0.00022134579,0.00035090325,0.000028993194,0.00034590228,0.00010126406],"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.00014460522,0.0008722879,0.009041975,0.00020263843,0.0003728692,0.00006481422,0.031930346,0.83097994,0.0134506,0.0061301123,0.0001967666,0.106613055],"study_design_scores_gemma":[0.0026196572,0.00032053873,0.019655172,0.00015235612,0.00026465842,0.00026446662,0.0039130673,0.9488707,0.022664439,0.00036165907,0.00037755162,0.00053569576],"about_ca_topic_score_codex":0.0015185138,"about_ca_topic_score_gemma":0.000235569,"teacher_disagreement_score":0.29537743,"about_ca_system_score_codex":0.00038459862,"about_ca_system_score_gemma":0.00012037516,"threshold_uncertainty_score":0.9998489},"labels":[],"label_agreement":null},{"id":"W2093411841","doi":"10.4236/ajor.2015.52006","title":"Deep Cutting Plane Inequalities for Stochastic Non-Preemptive Single Machine Scheduling Problem","year":2015,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cutting-plane method; Scheduling (production processes); Plane (geometry); Computer science; Inequality; Due date; Preemption; Mathematical optimization; Mathematics; Algorithm; Operations research; Geometry; Integer programming; Programming language; Mathematical analysis; Queue; Operating system","score_opus":0.07349344966246948,"score_gpt":0.3500015452314819,"score_spread":0.27650809556901246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093411841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09256205,0.00034284714,0.90602815,0.00029924122,0.00015934955,0.00022376001,0.000012591703,0.000036516358,0.0003355081],"genre_scores_gemma":[0.6097782,0.000011344309,0.38983843,0.000014658651,0.00023078008,0.00002212706,0.000012786071,0.000027606857,0.00006406707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848634,0.00011994712,0.00045910114,0.00011405631,0.0004858122,0.00033475005],"domain_scores_gemma":[0.99781656,0.00034369668,0.000058305704,0.00013113931,0.0014134952,0.00023682768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015614158,0.00011866313,0.00026006385,0.00043762152,0.00019588105,0.00017969433,0.00023134978,0.00003373553,0.000016159793],"category_scores_gemma":[0.0008199637,0.000107347616,0.000054717388,0.0005638541,0.00014641134,0.00027979986,0.000032248452,0.00043479892,0.000011063379],"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.00003869182,0.000040209507,0.00003207272,0.000013422743,0.000055545916,0.0000032745331,0.003328035,0.9897944,0.00037151764,0.00011150431,0.000066345456,0.0061449795],"study_design_scores_gemma":[0.00059495727,0.0008028712,0.0000073002147,0.00007530549,0.000011802163,0.00005254016,0.010822366,0.9868035,0.0005718541,0.000081422586,0.00005482017,0.000121298974],"about_ca_topic_score_codex":0.000065465494,"about_ca_topic_score_gemma":0.000028433464,"teacher_disagreement_score":0.51721615,"about_ca_system_score_codex":0.00018002577,"about_ca_system_score_gemma":0.00021118132,"threshold_uncertainty_score":0.43775088},"labels":[],"label_agreement":null},{"id":"W2093517648","doi":"10.1007/s001860400411","title":"Scheduling Stochastic jobs on a repairable machine with general phase type uptime","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exponential distribution; Erlang (programming language); Erlang distribution; Scheduling (production processes); Mathematical optimization; Permutation (music); Phase-type distribution; Exponential function; Mathematics; Statistics; Theoretical computer science","score_opus":0.10467536501262836,"score_gpt":0.46319898868527754,"score_spread":0.35852362367264917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093517648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043074057,0.000168683,0.9529735,0.00026494815,0.00003968541,0.00032025855,0.000007212224,0.0001626778,0.0029889906],"genre_scores_gemma":[0.06653847,0.000010401132,0.9324715,0.000024583747,0.00010535859,0.00005776908,0.000010673453,0.000045677963,0.00073553866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834764,0.00026858487,0.00037015643,0.00021308662,0.00047029072,0.00033021302],"domain_scores_gemma":[0.9984844,0.0005636219,0.000012867367,0.00041231935,0.00037677615,0.00015002329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082833,0.00014731332,0.00027158947,0.000297358,0.00017977128,0.000087354,0.00019769516,0.000082924336,0.0007514588],"category_scores_gemma":[0.0012386042,0.000114578375,0.000042392563,0.00072059437,0.00011127027,0.00012645901,0.00003626501,0.00044880988,0.0001599444],"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.00004107288,0.00025829763,5.2414293e-7,0.000049596423,0.0000424544,0.0000015240987,0.0002524565,0.9745656,0.003310238,0.011424535,0.00003664748,0.010017028],"study_design_scores_gemma":[0.0006132172,0.0003114448,0.0000012588413,0.00008683737,0.000013293905,0.0000110545125,0.0000667092,0.9877289,0.010444409,0.0005286428,0.00006624589,0.00012800848],"about_ca_topic_score_codex":0.0000059569766,"about_ca_topic_score_gemma":0.000003919166,"teacher_disagreement_score":0.023464411,"about_ca_system_score_codex":0.000069113994,"about_ca_system_score_gemma":0.00005793982,"threshold_uncertainty_score":0.8227947},"labels":[],"label_agreement":null},{"id":"W2093528244","doi":"10.1016/j.tcs.2005.11.039","title":"Approximation algorithms for minimizing the total weighted tardiness on a single machine","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":26,"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; European Social Fund; Ministry of National Education and Religious Affairs","keywords":"Tardiness; Algorithm; Single-machine scheduling; Computer science; Approximation algorithm; Mathematical optimization; Mathematics; Job shop scheduling","score_opus":0.009993433012399786,"score_gpt":0.21974957702617523,"score_spread":0.20975614401377546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093528244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023587821,0.000027967943,0.97343713,0.00032813905,0.0006379377,0.00020251531,0.000005962278,0.00026874896,0.0015037757],"genre_scores_gemma":[0.6571548,4.26848e-7,0.3424825,0.00005795498,0.0002604134,0.000015056839,0.000007761918,0.000012073899,0.000009031423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990155,0.0000202609,0.00017592986,0.00022807809,0.00027694655,0.00028328638],"domain_scores_gemma":[0.99941516,0.00020048906,0.00002211033,0.00021760052,0.000089077395,0.000055565695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045537858,0.00012613382,0.00011112351,0.000082446444,0.00026872443,0.0001829132,0.00030772455,0.00003642468,0.0000145222375],"category_scores_gemma":[0.00002774777,0.000085337924,0.000045782912,0.00045846315,0.0004947017,0.00011223824,0.00004484192,0.000096333526,0.000011488515],"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.000013528447,0.000064351974,0.000002938886,0.000013772852,0.000005371033,0.0000010183307,0.00014296711,0.5108594,0.00080320914,0.45192188,0.000075848344,0.036095716],"study_design_scores_gemma":[0.00023745006,0.00006649022,0.00007137137,0.000015028485,0.0000056899717,0.000009075846,0.0000062334975,0.98021185,0.008198218,0.011025023,0.00002615619,0.0001274069],"about_ca_topic_score_codex":0.0000014973275,"about_ca_topic_score_gemma":1.2716282e-7,"teacher_disagreement_score":0.633567,"about_ca_system_score_codex":0.000045567354,"about_ca_system_score_gemma":0.000011478998,"threshold_uncertainty_score":0.34799796},"labels":[],"label_agreement":null},{"id":"W2094141022","doi":"10.1287/opre.1080.0622","title":"Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"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":"Supply chain; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Holding cost; Supply chain management; Approximation algorithm; Total cost; Inventory cost; Algorithm; Mathematics; Economics; Schedule; Business; Microeconomics; Marketing","score_opus":0.04923602046159838,"score_gpt":0.3225391663908933,"score_spread":0.27330314592929494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094141022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0945974,0.0011576648,0.8956295,0.004972297,0.0002174207,0.0024431455,0.000042649637,0.00024333177,0.0006965646],"genre_scores_gemma":[0.3784172,0.00029163572,0.61972666,0.00016066249,0.0002706309,0.0006065907,0.00007810887,0.000036199403,0.00041228245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998755,0.00006416658,0.00023664522,0.00024834016,0.00031499335,0.0003808511],"domain_scores_gemma":[0.99906474,0.00022193091,0.000007952968,0.00023156509,0.00033037068,0.00014341825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012054051,0.0001277098,0.00012197001,0.0002827243,0.0007212445,0.00041825225,0.00019954758,0.00008494294,0.000029377985],"category_scores_gemma":[0.00020487106,0.000109630324,0.00003239479,0.00052142795,0.0000464456,0.00022867069,0.000037599733,0.00026955936,0.000021860309],"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.000012710694,0.000027956654,0.000028991313,0.000021259611,0.00002070162,6.62278e-7,0.0010986223,0.9358908,0.0028098628,0.0019248482,0.0006371501,0.057526458],"study_design_scores_gemma":[0.0004065407,0.000058630565,0.00016683686,0.00004127897,0.0000069520033,0.0000035261933,0.00090929127,0.9951579,0.0025383502,0.00008575737,0.00048755165,0.00013741618],"about_ca_topic_score_codex":0.000030455738,"about_ca_topic_score_gemma":0.000028261227,"teacher_disagreement_score":0.2838198,"about_ca_system_score_codex":0.0001474641,"about_ca_system_score_gemma":0.000061870516,"threshold_uncertainty_score":0.55473024},"labels":[],"label_agreement":null},{"id":"W2095179834","doi":"10.5267/j.ijiec.2015.1.002","title":"Scheduling a maintenance activity under skills constraints to minimize total weighted tardiness and late tasks","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Operations management; Operations research; Engineering; Mathematics; Schedule","score_opus":0.02387084335700035,"score_gpt":0.25752550882264397,"score_spread":0.23365466546564362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095179834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4002816,0.000031848824,0.5961957,0.0005250992,0.0027525097,0.00006508783,0.000019354338,0.00007054459,0.00005824998],"genre_scores_gemma":[0.8682018,0.0000078507,0.13102914,0.000042188924,0.00066129945,0.000003302945,0.000006681171,0.000025911444,0.000021854372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998915,0.0000211038,0.00040715223,0.00011714135,0.00036462693,0.00017497472],"domain_scores_gemma":[0.9987862,0.00016724129,0.00010705955,0.00006649045,0.0005907068,0.00028231405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027532293,0.0001652644,0.00023467757,0.00038023395,0.000028218288,0.00012903592,0.00018568963,0.00010809005,0.000013851507],"category_scores_gemma":[0.00040370272,0.00016883563,0.000066023786,0.00025876542,0.000032840617,0.00025241374,0.00004146201,0.00036108732,0.000006931898],"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.00002804744,0.00002941488,0.000101991514,0.0000024758174,0.00018527887,0.000025758958,0.0002215968,0.989761,0.00029718154,0.00015363579,0.00012939633,0.009064219],"study_design_scores_gemma":[0.0023523844,0.000043790988,0.0011006367,0.00021717993,0.000027883312,0.0002738373,0.0001298416,0.9947977,0.0005700096,0.000103059894,0.00015921718,0.00022444449],"about_ca_topic_score_codex":0.0000057805664,"about_ca_topic_score_gemma":3.7765966e-7,"teacher_disagreement_score":0.46792018,"about_ca_system_score_codex":0.00018389306,"about_ca_system_score_gemma":0.00011918327,"threshold_uncertainty_score":0.6884917},"labels":[],"label_agreement":null},{"id":"W2095614028","doi":"10.1007/s00236-011-0146-7","title":"An efficient algorithm for finding ideal schedules","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Ideal (ethics); Theory of computation; Schedule; Computer science; Scheduling (production processes); Algorithm; Time complexity; Mathematics; Mathematical optimization","score_opus":0.021974009486994895,"score_gpt":0.2399925613728733,"score_spread":0.2180185518858784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095614028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398907,0.000027463619,0.95306045,0.000009692807,0.000407039,0.00021823886,0.00002135181,0.0005321331,0.005832953],"genre_scores_gemma":[0.2856219,0.0000075857774,0.7141602,0.00005555741,0.00005671687,0.000035568177,0.000032559015,0.000020650587,0.000009221515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992754,0.0000049722235,0.0002759759,0.00007114104,0.00011327769,0.0002592492],"domain_scores_gemma":[0.9995559,0.000037692123,0.00003603215,0.0002051081,0.000051280127,0.0001140291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016762222,0.00012474069,0.000122521,0.000106127634,0.0000934993,0.00005418044,0.0001803395,0.00007620065,0.000107140404],"category_scores_gemma":[0.00003165492,0.00011810498,0.00004561905,0.00011646659,0.000021376458,0.00028628932,0.00001408906,0.00008999883,0.0000727317],"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.00002874472,0.00023453862,0.00016535821,0.00040564776,0.00024264779,0.000004031439,0.023387574,0.35079202,0.00018313786,0.010783197,0.0010710667,0.6127021],"study_design_scores_gemma":[0.00028737308,0.00004524246,0.00011770428,0.000020832313,0.000012049347,0.00000371963,0.0005499217,0.9964714,0.0017469614,0.00008764974,0.00048825456,0.00016886105],"about_ca_topic_score_codex":0.0000025548009,"about_ca_topic_score_gemma":3.4715936e-7,"teacher_disagreement_score":0.6456794,"about_ca_system_score_codex":0.000026713647,"about_ca_system_score_gemma":0.000014511373,"threshold_uncertainty_score":0.48161814},"labels":[],"label_agreement":null},{"id":"W2096151535","doi":"10.1142/s0129054101000485","title":"EFFICIENT PARALLEL JOB SCHEDULING USING GANG SERVICE","year":2001,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; McMaster University; National Aeronautics and Space Administration","keywords":"Computer science; Dynamic priority scheduling; Rate-monotonic scheduling; Scheduling (production processes); Gang scheduling; Fair-share scheduling; Two-level scheduling; Distributed computing; Multiprocessor scheduling; Workload; Bin packing problem; Earliest deadline first scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Bin; Quality of service","score_opus":0.02467930034830723,"score_gpt":0.29136593413513984,"score_spread":0.2666866337868326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096151535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41325513,0.000038861832,0.58481556,0.00018303697,0.0015199417,0.000019565414,7.750677e-7,0.000017071156,0.00015006549],"genre_scores_gemma":[0.5537039,0.000013459732,0.44601545,0.000052560492,0.00020687,2.2053435e-7,5.578268e-7,0.0000048639886,0.0000021155226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986398,0.000011533024,0.0004459992,0.00009523876,0.00067482225,0.00013256253],"domain_scores_gemma":[0.99791276,0.000054643784,0.00018923302,0.00011554553,0.0016481571,0.00007966589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044944364,0.00008213948,0.00011854948,0.00050749746,0.00008648701,0.00015425532,0.00074435864,0.00002389448,0.000030688476],"category_scores_gemma":[0.00005414421,0.00008057695,0.00005892487,0.00067544694,0.00009525741,0.00035086804,0.000063186526,0.00011275315,0.0000073438728],"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.0000049995874,0.000025894247,0.0004816288,0.000002915293,0.000027837652,0.0000060709253,0.00021564314,0.99164575,0.0015535025,0.00048064403,0.000004258236,0.0055508562],"study_design_scores_gemma":[0.00029903496,0.000015454238,0.002107014,0.000083502826,0.00000823666,0.00023172017,0.00004651882,0.9965653,0.0003769169,0.00012630512,0.00006256024,0.00007747171],"about_ca_topic_score_codex":0.000007482572,"about_ca_topic_score_gemma":0.0000015385369,"teacher_disagreement_score":0.14044878,"about_ca_system_score_codex":0.00012490372,"about_ca_system_score_gemma":0.00016948667,"threshold_uncertainty_score":0.32858327},"labels":[],"label_agreement":null},{"id":"W2096691748","doi":"10.1155/2013/972358","title":"Scheduling with Learning Effects and/or Time-Dependent Processing Times to Minimize the Weighted Number of Tardy Jobs on a Single Machine","year":2013,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"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":"Single-machine scheduling; Scheduling (production processes); Learning effect; Computer science; Due date; Mathematical optimization; Response time; Job shop scheduling; Mathematics; Schedule","score_opus":0.005597428197517109,"score_gpt":0.19912287874309761,"score_spread":0.1935254505455805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096691748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12983863,0.00019022712,0.86763006,0.00010724352,0.000046392408,0.0006995503,6.8527936e-7,0.00040004752,0.0010871618],"genre_scores_gemma":[0.72911674,0.0000049387604,0.27047354,0.000015494637,0.000025241832,0.00013619046,0.0000012100439,0.00007285833,0.00015375725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988606,0.000024136689,0.00036418284,0.00019936818,0.00024327589,0.0003084385],"domain_scores_gemma":[0.9992572,0.00039470955,0.000043877546,0.00015888884,0.00004396335,0.000101334976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002550124,0.00024573746,0.00034547297,0.00012611123,0.000046293728,0.0000835813,0.00013435469,0.00008072406,0.00010892956],"category_scores_gemma":[0.00022339857,0.00015679885,0.000027868016,0.00034771595,0.000026234864,0.000114322946,0.000044057,0.00034215118,0.00007316188],"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.000007925954,0.000055789962,0.00021555887,0.0010137586,0.000027898803,0.0000030138642,0.0008147965,0.9933339,0.001971111,0.000092405346,0.0000031973282,0.002460642],"study_design_scores_gemma":[0.00045490413,0.00007433349,0.00008032459,0.0014446131,0.000016859112,0.000024262896,0.00006848692,0.9948075,0.002611621,0.00018247313,0.000008376726,0.00022627563],"about_ca_topic_score_codex":0.0000049550754,"about_ca_topic_score_gemma":4.4608572e-7,"teacher_disagreement_score":0.59927815,"about_ca_system_score_codex":0.000046058205,"about_ca_system_score_gemma":0.000008787834,"threshold_uncertainty_score":0.63940716},"labels":[],"label_agreement":null},{"id":"W2096699448","doi":"10.1080/09537280410001658344","title":"Coordination and control in distributed and agent-based manufacturing systems","year":2004,"lang":"en","type":"article","venue":"Production Planning & Control","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Distributed manufacturing; Control (management); Manufacturing engineering; Supply chain; Engineering; Computer science; Business; Artificial intelligence","score_opus":0.007793994639211258,"score_gpt":0.20562741969304804,"score_spread":0.19783342505383678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096699448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52245337,0.0016153436,0.4737921,0.00070458214,0.0006699795,0.00039703972,0.000020046828,0.00032795608,0.000019602017],"genre_scores_gemma":[0.99870557,0.000011613306,0.0010156231,0.00003656739,0.00012392054,0.000047066915,0.000031290998,0.000017405118,0.000010953031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929583,0.000027368227,0.00020375416,0.00020748434,0.0000982379,0.00016730472],"domain_scores_gemma":[0.9997408,0.000037670135,0.000042168347,0.000088672394,0.000034619712,0.00005607126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022972214,0.0001263464,0.00017048448,0.00014461872,0.00007286394,0.000078850026,0.0000307661,0.00006272349,0.0000014158985],"category_scores_gemma":[0.00007443834,0.00013262224,0.000012942674,0.000092270435,0.00002285688,0.00014156716,0.0000031833083,0.00013241425,0.0000020525315],"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.000026018843,0.000010715592,0.0057906816,0.000054792847,0.000019135163,0.000004890656,0.00008578529,0.9923607,0.00090388785,0.00002393466,0.000022554283,0.0006969135],"study_design_scores_gemma":[0.004471483,0.000027346865,0.016639858,0.00013402198,0.00002982448,0.000023673258,0.00013704633,0.97586477,0.0022135316,0.000029169643,0.00022505123,0.00020424658],"about_ca_topic_score_codex":0.000026763364,"about_ca_topic_score_gemma":0.0000020821046,"teacher_disagreement_score":0.4762522,"about_ca_system_score_codex":0.000079281774,"about_ca_system_score_gemma":0.000010250782,"threshold_uncertainty_score":0.5408178},"labels":[],"label_agreement":null},{"id":"W2097629978","doi":"10.1109/cdc.1992.371149","title":"Parameter optimization of a control policy for unreliable manufacturing systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Tandem; Simple (philosophy); Control (management); Perturbation (astronomy); Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Engineering","score_opus":0.008660156014019196,"score_gpt":0.222820541501114,"score_spread":0.2141603854870948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097629978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016950504,0.00012845623,0.9954651,0.00009291556,0.00018439008,0.00024101498,0.000011609409,0.00022553866,0.0019558978],"genre_scores_gemma":[0.6145198,0.000021052549,0.38464415,0.00005559346,0.00019146677,0.000040353218,0.000009720092,0.000023523722,0.0004943747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949735,0.00000597148,0.0002077137,0.00007792571,0.00006694633,0.00014411178],"domain_scores_gemma":[0.99968624,0.000091572314,0.000028243836,0.00010847819,0.00004533099,0.00004012906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866134,0.00008140339,0.00013583238,0.000104684084,0.000022451437,0.00002593186,0.000057936402,0.000057125562,0.000037242156],"category_scores_gemma":[0.000042007356,0.00007543954,0.000040691688,0.00006804835,0.000007528017,0.000092747934,0.0000034639352,0.000032144893,0.0000064207816],"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.0000047785725,0.000007314653,0.000009245842,0.000042900203,0.00002358163,3.6461458e-8,0.000026756832,0.9980951,0.000028610812,0.00037838437,0.0002005776,0.0011827396],"study_design_scores_gemma":[0.00066478713,0.000013957104,0.000005117207,0.000015714946,0.000011373553,0.0000013633862,0.000026852058,0.9918801,0.006377023,0.000010870995,0.0009065814,0.00008622212],"about_ca_topic_score_codex":0.000021473306,"about_ca_topic_score_gemma":8.102107e-7,"teacher_disagreement_score":0.6128247,"about_ca_system_score_codex":0.00003957668,"about_ca_system_score_gemma":0.000010789672,"threshold_uncertainty_score":0.30763352},"labels":[],"label_agreement":null},{"id":"W2097714267","doi":"10.1109/robot.1991.131794","title":"Resource allocation in a flexible manufacturing system by graph matching","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"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; Matching (statistics); Graph; Flexible manufacturing system; Resource allocation; Blossom algorithm; Distributed computing; Cardinality (data modeling); Theoretical computer science; Mathematical optimization; Data mining; Mathematics; Computer network; Scheduling (production processes)","score_opus":0.009402348641347362,"score_gpt":0.18971802298632617,"score_spread":0.1803156743449788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097714267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17076305,0.0008929162,0.74065304,0.00021459878,0.00028791957,0.00021071304,0.000003202497,0.0026397337,0.084334835],"genre_scores_gemma":[0.9757454,0.00002600691,0.022838756,0.000043122982,0.000031630683,0.000013151388,0.00000911921,0.000026365795,0.0012664883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994717,0.000012097732,0.00016257283,0.000108393746,0.00009343019,0.00015178116],"domain_scores_gemma":[0.99980634,0.000018504046,0.000012695162,0.00011632778,0.00000570122,0.00004043076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000087556145,0.000085882864,0.00008357929,0.000115151044,0.000033407538,0.00004073364,0.000073021576,0.000052390784,0.000089510926],"category_scores_gemma":[0.0000026142018,0.00008827028,0.000019965126,0.0001391764,0.000004525665,0.000088176195,0.000007848255,0.000095783726,0.00007995633],"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":[7.0139004e-7,0.000008446773,0.00002910317,0.00005368574,0.000006574816,0.0000017530714,0.00035651034,0.99465764,0.0002033103,0.00022793633,0.001440629,0.0030137103],"study_design_scores_gemma":[0.00026368749,0.0000043568384,0.000046803983,0.00006517477,0.0000031341158,0.0000068272966,0.0007846146,0.9816913,0.015939537,0.000029909634,0.000999367,0.0001652569],"about_ca_topic_score_codex":0.000034173987,"about_ca_topic_score_gemma":0.000004389889,"teacher_disagreement_score":0.8049823,"about_ca_system_score_codex":0.00006206257,"about_ca_system_score_gemma":7.873498e-7,"threshold_uncertainty_score":0.35995576},"labels":[],"label_agreement":null},{"id":"W2097745607","doi":"10.1109/iscas.2013.6572198","title":"Rules maps for scheduling algorithm knowledge","year":2013,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Algorithm; Association rule learning; Visualization; Two-level scheduling; Data mining; Mathematical optimization; Mathematics; Schedule","score_opus":0.013070307938524353,"score_gpt":0.23247599486902143,"score_spread":0.21940568693049708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097745607","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025422329,0.0005185377,0.98078173,0.00007878167,0.0006280303,0.0002534408,0.000010766586,0.0008678221,0.014318646],"genre_scores_gemma":[0.008700397,0.000029823259,0.98856676,0.000051134855,0.0002790303,0.00013682981,0.00004248392,0.000043928307,0.0021496275],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994363,0.0000051342054,0.00015765673,0.00012348047,0.000053750846,0.0002236321],"domain_scores_gemma":[0.99960804,0.00006274323,0.000010569599,0.00012855613,0.00010361488,0.00008650505],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007164166,0.00011790724,0.0001128293,0.000071734125,0.00006079376,0.000076527554,0.000101115336,0.00007444401,0.00037935132],"category_scores_gemma":[0.000024301733,0.00010917618,0.000055162487,0.000096396754,0.00001335185,0.00014112634,0.000013411111,0.00006912371,0.0010192477],"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.0000015316858,0.000066831206,0.00006235266,0.000129582,0.00010817119,6.064671e-7,0.0004510016,0.21758215,0.00046682643,0.0044292784,0.017913826,0.7587878],"study_design_scores_gemma":[0.00028288038,0.000009937949,0.00003907411,0.000010835328,0.0000061713686,0.0000017358863,0.00012828638,0.992148,0.001772994,0.00093338976,0.00449855,0.00016813615],"about_ca_topic_score_codex":0.0000064410865,"about_ca_topic_score_gemma":0.0000010179504,"teacher_disagreement_score":0.7745659,"about_ca_system_score_codex":0.000023387975,"about_ca_system_score_gemma":0.000009976588,"threshold_uncertainty_score":0.9997586},"labels":[],"label_agreement":null},{"id":"W2098959416","doi":"10.1287/opre.1060.0270","title":"On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scheduling (production processes); Mathematical optimization; Heuristic; Bounded function; Computer science; Set (abstract data type); Asymptotically optimal algorithm; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.060112270423902034,"score_gpt":0.31740270179026403,"score_spread":0.257290431366362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098959416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033173468,0.000342107,0.9611373,0.0025646414,0.00006119219,0.0017442071,0.00026697718,0.000106416504,0.00060369744],"genre_scores_gemma":[0.95753014,0.000018855926,0.041115068,0.00004732886,0.00012015429,0.00027754888,0.0002161075,0.0000375573,0.00063721434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989009,0.00012131739,0.00023678782,0.00017230933,0.00033942077,0.00022925464],"domain_scores_gemma":[0.99780464,0.0014176717,0.000013741781,0.00024943196,0.00047157513,0.000042924883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008234175,0.00011122358,0.00013016512,0.00012536976,0.0006633165,0.00010314373,0.00014619104,0.00005086637,0.000116471834],"category_scores_gemma":[0.00025560055,0.00006798112,0.00003531798,0.00040737216,0.000092766786,0.00005269653,0.00003401185,0.00025105217,0.000030843894],"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.000009169603,0.00010532775,4.6096747e-7,0.000008623969,0.000019637951,2.3771658e-7,0.000051164294,0.98841214,0.001310354,0.007701496,0.00048776096,0.0018936024],"study_design_scores_gemma":[0.00033416713,0.00019708625,0.000041094354,0.000029739409,0.000011357626,0.000002629129,0.00002987709,0.99758804,0.0011435489,0.00047862795,0.00006855843,0.00007529662],"about_ca_topic_score_codex":0.00005685734,"about_ca_topic_score_gemma":0.00003247692,"teacher_disagreement_score":0.9243567,"about_ca_system_score_codex":0.000048138732,"about_ca_system_score_gemma":0.00003197012,"threshold_uncertainty_score":0.5101762},"labels":[],"label_agreement":null},{"id":"W2099583394","doi":"10.5267/j.msl.2013.06.022","title":"ATM cash management using genetic algorithm","year":2013,"lang":"en","type":"article","venue":"Management Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cash; Genetic algorithm; Algorithm; Cash management; Business; Finance; Machine learning","score_opus":0.008819749481747557,"score_gpt":0.20705076099964842,"score_spread":0.19823101151790087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099583394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102300085,0.000052428266,0.8903672,0.00046631342,0.0009786342,0.000486362,8.707157e-7,0.0004292681,0.0049188132],"genre_scores_gemma":[0.050749004,0.00006340457,0.9471386,0.0016328311,0.00007985141,0.000053774173,0.000001970502,0.000030093152,0.00025044804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998489,0.000009358249,0.00019491545,0.00033754588,0.00046747897,0.00050166156],"domain_scores_gemma":[0.9994825,0.000005644605,0.00002588903,0.00035691532,0.000015236567,0.00011380595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017716463,0.00016536635,0.00009839399,0.00035007868,0.0002073898,0.0003034991,0.00047231908,0.00002025352,0.00015740519],"category_scores_gemma":[0.000001686946,0.00017002865,0.000036506484,0.0008967379,0.00015162706,0.00036885036,0.0001424867,0.00007418861,0.00039549964],"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":[2.1065401e-7,0.000012240848,0.00028787553,0.000045116907,0.000037974212,0.00004274531,0.00007511724,0.86156535,0.00059278123,0.00011859639,0.0019392917,0.13528273],"study_design_scores_gemma":[0.00019900558,0.0000044234434,0.009227213,0.000021856229,0.00002359038,0.000005257167,0.00017294525,0.9890747,0.0002579701,0.00003851387,0.0007267009,0.00024780168],"about_ca_topic_score_codex":0.00001959394,"about_ca_topic_score_gemma":1.3940543e-7,"teacher_disagreement_score":0.13503492,"about_ca_system_score_codex":0.00015686722,"about_ca_system_score_gemma":0.0000016440857,"threshold_uncertainty_score":0.6933567},"labels":[],"label_agreement":null},{"id":"W2100308419","doi":"10.1016/s0004-3702(00)00035-7","title":"Constraint-directed techniques for scheduling alternative activities","year":2000,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":68,"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); Mathematical optimization; Schedule; Constraint programming; Mathematics","score_opus":0.03535660262591858,"score_gpt":0.2865996582321427,"score_spread":0.25124305560622406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100308419","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04319161,0.000103484635,0.95039505,0.00012692982,0.00035705836,0.0002856867,0.000025341746,0.0016326618,0.0038821565],"genre_scores_gemma":[0.6871153,0.00010945481,0.3121665,0.000095198695,0.0002670305,0.00008032668,0.000012879098,0.000032705102,0.00012057355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925363,0.000014013343,0.0002426195,0.0001699262,0.00009391298,0.00022587397],"domain_scores_gemma":[0.99959576,0.000143902,0.000021370191,0.00012225071,0.0000620103,0.00005469997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001256921,0.00013402804,0.00013254333,0.00007391552,0.00009780614,0.00007141638,0.00013081811,0.00007132056,0.00044695372],"category_scores_gemma":[0.000057642723,0.00014398665,0.000056695433,0.00017354966,0.000089802925,0.00014093689,0.0000059366935,0.000115541865,0.000056298923],"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.000019707511,0.000023270237,0.0000036958033,0.000013300598,0.000028553211,0.0000016404687,0.0005545035,0.2518945,0.0017703035,0.0033009835,0.000048899503,0.7423406],"study_design_scores_gemma":[0.0000103419,0.000022192475,8.2172676e-7,0.000022374237,0.0000056211265,0.0000023711136,0.00029746417,0.6385434,0.35582563,0.004577777,0.0005564491,0.0001355233],"about_ca_topic_score_codex":0.000014215517,"about_ca_topic_score_gemma":0.000009687492,"teacher_disagreement_score":0.7422051,"about_ca_system_score_codex":0.000033724846,"about_ca_system_score_gemma":0.000012186219,"threshold_uncertainty_score":0.5871605},"labels":[],"label_agreement":null},{"id":"W2101166479","doi":"","title":"Electroplating Line Flexible Control using P-Time Petri Nets Modeling and Hoist Waiting Times Calculation","year":2008,"lang":"en","type":"article","venue":"International journal of industrial engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Hoist (device); Petri net; Scheduling (production processes); Computer science; Real-time computing; Reliability engineering; Simulation; Control theory (sociology); Engineering; Distributed computing; Operations management; Control (management); Mechanical engineering; Artificial intelligence","score_opus":0.027365097786041518,"score_gpt":0.23428828041467464,"score_spread":0.20692318262863313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101166479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577957,0.00032205833,0.4205855,0.000065305816,0.0008571757,0.000052670373,0.0000048622546,0.00009720961,0.000058225734],"genre_scores_gemma":[0.9725785,0.00005435087,0.02562285,0.000017079064,0.0016632567,8.494345e-7,0.000006990312,0.000040169467,0.000015938076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987044,0.000015944583,0.00060408725,0.000102392434,0.00037364953,0.0001995633],"domain_scores_gemma":[0.99927795,0.00010909742,0.00015171453,0.00005430923,0.0003036291,0.000103313476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002455021,0.00016836709,0.00025044748,0.00037660255,0.000068403744,0.00007572625,0.00014494154,0.00012814403,0.000021784084],"category_scores_gemma":[0.00034021522,0.00017841591,0.000079684396,0.0001731382,0.000013073866,0.0003698831,0.00001869092,0.00043069618,0.0000022785978],"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.000026893113,0.0000072980383,0.0002696007,0.0000029129476,0.0001391645,0.000037496466,0.00006931246,0.989429,0.008253744,0.000026888762,0.000019240319,0.0017184278],"study_design_scores_gemma":[0.0014984042,0.00003216586,0.000011676363,0.00015540031,0.000026065372,0.0006545028,0.000022753273,0.99471164,0.0026756632,0.000006231232,0.000040817173,0.00016469389],"about_ca_topic_score_codex":0.000014066899,"about_ca_topic_score_gemma":1.3721494e-7,"teacher_disagreement_score":0.39496267,"about_ca_system_score_codex":0.0001711462,"about_ca_system_score_gemma":0.000060003928,"threshold_uncertainty_score":0.727559},"labels":[],"label_agreement":null},{"id":"W2101656720","doi":"10.5555/1162708.1162961","title":"Lot-sizing within capacity-constrained manufacturing systems using time-phased planning","year":2005,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Capacity planning; Queueing theory; Computer science; Order (exchange); Production (economics); Build to order; Due date; Material requirements planning; Operations research; Mathematical optimization; Industrial engineering; Engineering; Operations management; Business; Mathematics; Economics; Queue; Finance","score_opus":0.048364372410060745,"score_gpt":0.2688107403407163,"score_spread":0.22044636793065553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101656720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33871976,0.000059031383,0.65865654,0.00001645024,0.00042642152,0.00012797643,0.000006944366,0.0004799012,0.0015070033],"genre_scores_gemma":[0.9529574,6.039609e-7,0.046522465,0.000035849764,0.00028814073,0.000004360607,0.000015343123,0.000037323687,0.00013854184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998889,0.00003762046,0.0004097345,0.00022573478,0.00018673763,0.000251141],"domain_scores_gemma":[0.9994338,0.00009680091,0.000087364955,0.00019087436,0.000092840295,0.000098316865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001720935,0.00021472704,0.00021228814,0.00016349048,0.00011014161,0.00021924001,0.00013599436,0.00010924037,0.00016559761],"category_scores_gemma":[0.000033367738,0.00023245784,0.00004671569,0.000095921685,0.000034343033,0.00037675732,0.000013942469,0.00020464227,0.00008537642],"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.000005746976,0.0000068373665,0.00008557713,0.000025599762,0.000028024802,0.0000018729015,0.0011819882,0.9943846,0.0029967378,0.000046051784,0.0000038634125,0.0012331052],"study_design_scores_gemma":[0.00043526755,0.00000908857,0.00005256037,0.0002181991,0.000016245702,0.000010545004,0.00019987323,0.987944,0.010628808,0.00001035342,0.0002075331,0.00026752017],"about_ca_topic_score_codex":0.000008667322,"about_ca_topic_score_gemma":0.0000013536028,"teacher_disagreement_score":0.6142376,"about_ca_system_score_codex":0.000108862456,"about_ca_system_score_gemma":0.000024712454,"threshold_uncertainty_score":0.9479355},"labels":[],"label_agreement":null},{"id":"W2102040161","doi":"10.1109/cdc.1993.325809","title":"Optimal production and maintenance planning for flexible manufacturing systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Production planning; Production (economics); Computer science; Manufacturing engineering; Engineering","score_opus":0.023278469206668366,"score_gpt":0.22249140188736674,"score_spread":0.19921293268069837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102040161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09089257,0.0013178721,0.90069616,0.00011901145,0.0011994911,0.00030586048,0.0000029216583,0.001117541,0.004348587],"genre_scores_gemma":[0.81570905,0.000071634044,0.17624886,0.000015423342,0.00027080113,0.000049687354,0.0000034180396,0.000029708028,0.0076014358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999602,0.0000026263428,0.00009630059,0.00011445136,0.000045405395,0.00013917485],"domain_scores_gemma":[0.9998531,0.000014280301,0.000011250831,0.000070003734,0.000017016146,0.000034393448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006128707,0.000071753755,0.000073009294,0.000043669494,0.000057436744,0.00004959369,0.000029093013,0.000033386303,0.000018284838],"category_scores_gemma":[0.000018068784,0.00006632604,0.0000126110435,0.000033972527,0.00000825271,0.0000989332,0.0000052152477,0.000045330005,0.0000075862977],"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.000001645467,0.0000025698598,0.000025081956,0.00005699034,0.000008616936,4.2635477e-7,0.00013671504,0.99643844,0.000056178043,0.000071836155,0.0021270178,0.0010744819],"study_design_scores_gemma":[0.00012722863,0.000010728008,0.000031419502,0.0000431783,0.0000043270506,0.00001864265,0.00022891056,0.99079704,0.006861699,0.000004301666,0.0017737406,0.000098805314],"about_ca_topic_score_codex":0.0000016827755,"about_ca_topic_score_gemma":1.2519797e-7,"teacher_disagreement_score":0.72481644,"about_ca_system_score_codex":0.000017027081,"about_ca_system_score_gemma":7.389315e-7,"threshold_uncertainty_score":0.27046975},"labels":[],"label_agreement":null},{"id":"W2102704639","doi":"10.1109/tsm.2007.914388","title":"A Multiagent-Based Decision-Making System for Semiconductor Wafer Fabrication With Hard Temporal Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Semiconductor Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Workcell; Wafer fabrication; Job shop scheduling; Computer science; Scheduling (production processes); Semiconductor device fabrication; Schedule; Distributed computing; Mathematical optimization; Engineering; Artificial intelligence; Wafer; Robot; Mathematics","score_opus":0.02399545512018482,"score_gpt":0.23318466116225164,"score_spread":0.2091892060420668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102704639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44267684,0.000025777328,0.5550335,0.0000092189675,0.0009863235,0.00042853173,0.00009681585,0.00070270785,0.00004025317],"genre_scores_gemma":[0.85586643,0.000009177699,0.14355093,0.00005843255,0.00012501783,0.00018400486,0.000023731332,0.000119320124,0.00006297778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981292,0.00003297005,0.00050280476,0.00052310695,0.00034486104,0.0004670837],"domain_scores_gemma":[0.99875665,0.00033981682,0.0001101446,0.00046352422,0.00015161774,0.00017826866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013502156,0.00043851748,0.00038672434,0.00038835217,0.00042493053,0.0000732815,0.00023213857,0.00020363965,0.0001518999],"category_scores_gemma":[0.000012625945,0.00041197392,0.00018453144,0.00019985111,0.00012061808,0.0003236465,0.0000011770978,0.0003681052,0.000048712453],"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.00013863586,0.00007557605,0.00004617607,0.0001860526,0.00015249892,0.00001888744,0.00043151452,0.9734082,0.014774831,0.0000026323055,0.00011583166,0.010649136],"study_design_scores_gemma":[0.0019898333,0.00008404263,0.00010539998,0.00046390478,0.00008742011,0.00012709897,0.0005174509,0.28221783,0.7135956,0.000004214505,0.00016401394,0.0006431881],"about_ca_topic_score_codex":0.0000107340675,"about_ca_topic_score_gemma":0.000007680053,"teacher_disagreement_score":0.69882077,"about_ca_system_score_codex":0.00038644287,"about_ca_system_score_gemma":0.00009317641,"threshold_uncertainty_score":0.9998332},"labels":[],"label_agreement":null},{"id":"W2102964470","doi":"10.1109/cec.2013.6557871","title":"A genetic algorithm for solving a hybrid flexible flowshop with sequence dependent setup times","year":2013,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Crossover; Job shop scheduling; Sequence (biology); Computer science; Genetic algorithm; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.01178898491899654,"score_gpt":0.21611606882216786,"score_spread":0.2043270839031713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102964470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009672542,0.00018397221,0.98701674,0.00005402743,0.0001747999,0.00043316657,0.000014301052,0.0007630525,0.001687423],"genre_scores_gemma":[0.05553205,0.000028388795,0.941471,0.00011256435,0.00011401267,0.0002463152,0.000018511815,0.000058691352,0.0024184887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911946,0.0000053438785,0.00017745653,0.00022107898,0.00015309617,0.00032356151],"domain_scores_gemma":[0.9994945,0.000047278983,0.000019910665,0.00021286472,0.00010953091,0.00011594797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000620333,0.0001739102,0.00014849189,0.000075738695,0.000078482524,0.00012928927,0.00013680504,0.000042793537,0.0006447953],"category_scores_gemma":[0.0000114859,0.000144936,0.000039332677,0.00011706854,0.00002123134,0.00018027682,0.000017959628,0.00008344373,0.00017992953],"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.0000027548522,0.000022644424,0.00006510043,0.000048545593,0.00008477647,0.000008118904,0.00012521292,0.8547449,0.00077507144,0.000045172943,0.0021737993,0.14190389],"study_design_scores_gemma":[0.00039672255,0.000046278907,0.000046593068,0.000021893364,0.000016374654,0.000047033842,0.00008364724,0.98893595,0.009849784,0.00013810128,0.0001743486,0.00024324513],"about_ca_topic_score_codex":0.00005278292,"about_ca_topic_score_gemma":0.0000043361792,"teacher_disagreement_score":0.14166065,"about_ca_system_score_codex":0.000046439633,"about_ca_system_score_gemma":0.0000304781,"threshold_uncertainty_score":0.70600563},"labels":[],"label_agreement":null},{"id":"W2103241900","doi":"10.1109/iciea.2008.4582472","title":"An Adaptive Annealing Genetic Algorithm for job-shop scheduling","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Crossover; Simulated annealing; Computer science; Mathematical optimization; Adaptive simulated annealing; Population; Scheduling (production processes); Genetic algorithm; Job shop scheduling; Algorithm; Artificial intelligence; Mathematics","score_opus":0.02341959804686678,"score_gpt":0.2418676508232656,"score_spread":0.21844805277639884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103241900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039666668,0.00038609156,0.9576274,0.000014815975,0.00038660134,0.00018875068,0.000012186412,0.00081407954,0.0009034103],"genre_scores_gemma":[0.094726175,0.00009011014,0.9044458,0.00007181542,0.0003719746,0.000040779843,0.000016142492,0.000061641884,0.00017551125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908704,0.000012746012,0.00023156502,0.0002270645,0.00013189876,0.0003096644],"domain_scores_gemma":[0.9994485,0.00005084236,0.000021169151,0.00020869439,0.000119093274,0.00015171964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008884788,0.00017376395,0.00016874603,0.00010328941,0.00018351298,0.00003313755,0.00014612173,0.00010334614,0.000063098436],"category_scores_gemma":[0.000015592643,0.00017959569,0.00006719232,0.00018867919,0.000030236912,0.00015993543,0.000009592451,0.00010977402,0.000030288851],"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.0000034610803,0.00001245448,0.00007345913,0.0000065861045,0.000026823269,0.0000055502937,0.0002308123,0.9604889,0.00012893064,0.00006734214,0.00006723624,0.03888841],"study_design_scores_gemma":[0.00042154186,0.00007967233,0.00021922735,0.000009665787,0.000012037818,0.00002817779,0.0002799061,0.99664813,0.0018859076,0.00005550257,0.00010221932,0.00025803616],"about_ca_topic_score_codex":0.000009468545,"about_ca_topic_score_gemma":0.0000019627844,"teacher_disagreement_score":0.05505951,"about_ca_system_score_codex":0.000037271435,"about_ca_system_score_gemma":0.000025966716,"threshold_uncertainty_score":0.73237},"labels":[],"label_agreement":null},{"id":"W2103762423","doi":"10.1109/cec.2011.5949919","title":"A Machine Operation Lists based Memetic Algorithm for Job Shop Scheduling","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Crossover; Job shop scheduling; Flow shop scheduling; Memetic algorithm; Computer science; Mathematical optimization; Benchmark (surveying); Job shop; Scheduling (production processes); Schedule; Genetic algorithm; Algorithm; Local search (optimization); Mathematics; Artificial intelligence","score_opus":0.025720894309477035,"score_gpt":0.23510595584536415,"score_spread":0.2093850615358871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103762423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010647157,0.00018047723,0.9926439,0.00003967599,0.0004387813,0.00023534686,0.000011988216,0.00061579264,0.004769334],"genre_scores_gemma":[0.077220805,0.000013270013,0.9220116,0.00014393796,0.00010724465,0.000066029635,0.000041327898,0.00004655129,0.00034919768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929655,0.000012060198,0.00021486264,0.00016787915,0.00010480429,0.00020383099],"domain_scores_gemma":[0.99960643,0.000038477585,0.00001648123,0.00016875264,0.00008292693,0.00008692216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017763521,0.00014652226,0.00013457816,0.00010801944,0.00007678052,0.00004710936,0.00010851502,0.00008199166,0.000617225],"category_scores_gemma":[0.00003582363,0.00013850858,0.00006262833,0.0001409511,0.000013182076,0.00012326895,0.000009269478,0.00008548991,0.000047535676],"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.000015862224,0.00008650775,0.00023361649,0.000085912296,0.00008457918,0.000004137153,0.00056273217,0.85083854,0.0005148667,0.0015496206,0.00021183248,0.14581178],"study_design_scores_gemma":[0.00061763014,0.00003462336,0.000060383492,0.000011966859,0.000019643583,0.0000019529261,0.000044818975,0.9923551,0.0064410046,0.00005560114,0.00016501888,0.00019226747],"about_ca_topic_score_codex":0.000019309333,"about_ca_topic_score_gemma":0.000009688013,"teacher_disagreement_score":0.14561951,"about_ca_system_score_codex":0.000031252308,"about_ca_system_score_gemma":0.000019670795,"threshold_uncertainty_score":0.6758181},"labels":[],"label_agreement":null},{"id":"W2104291846","doi":"10.1504/ejie.2007.015388","title":"Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times","year":2007,"lang":"en","type":"article","venue":"European J of Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Job shop scheduling; Heuristics; Mathematical optimization; Flow shop scheduling; Scheduling (production processes); Computer science; Genetic algorithm; Cellular manufacturing; Mathematics","score_opus":0.022329596359407282,"score_gpt":0.2156353314236699,"score_spread":0.1933057350642626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104291846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82009315,0.00015692839,0.17446713,0.000006112404,0.0006480705,0.00016468996,0.000017482083,0.00037747525,0.0040689744],"genre_scores_gemma":[0.9194895,0.000012671465,0.08004606,0.000003776073,0.0003021016,0.0000012022448,0.000011741739,0.000093424314,0.000039536462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986371,0.000024611005,0.00053667027,0.00020426424,0.00026191273,0.00033549007],"domain_scores_gemma":[0.9993663,0.00008164337,0.000097767734,0.0002686256,0.0000559383,0.00012973999],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006674673,0.0002482197,0.00028811875,0.00026834305,0.000028576476,0.000027198921,0.00024260543,0.00008919463,0.000059921967],"category_scores_gemma":[0.000062685394,0.00024616806,0.000060994524,0.000257269,0.000028976947,0.00014001392,0.000046007823,0.00035836032,0.00001110437],"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.0000282289,0.00001533987,0.000065267086,0.00008038342,0.000044188106,0.00004259992,0.00020756772,0.9569882,0.03838604,0.000011836725,0.000011107998,0.0041192495],"study_design_scores_gemma":[0.0012827658,0.00009232467,0.00012844088,0.00040533725,0.000036985697,0.000023654098,0.00022933056,0.2615287,0.7357325,9.178036e-7,0.0001559576,0.0003830719],"about_ca_topic_score_codex":0.0000097796865,"about_ca_topic_score_gemma":9.0604107e-7,"teacher_disagreement_score":0.69734645,"about_ca_system_score_codex":0.000049961836,"about_ca_system_score_gemma":0.000022456692,"threshold_uncertainty_score":0.99999905},"labels":[],"label_agreement":null},{"id":"W2104313259","doi":"10.1109/icsmc.2009.5346681","title":"An integer programming model and heuristic algorithm for automatic scheduling in synchrotron facilities","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Concordia University","funders":"Canarie","keywords":"Computer science; Integer programming; Scheduling (production processes); Heuristics; Computation; Mathematical optimization; Algorithm; Fair-share scheduling; Job shop scheduling; Two-level scheduling; Mathematics; Schedule; Operating system","score_opus":0.012115186594007045,"score_gpt":0.2480512137382205,"score_spread":0.23593602714421347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104313259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08701482,0.00020895214,0.91171545,0.0000382309,0.00005548158,0.00027057985,0.0000058569417,0.00057266577,0.00011796886],"genre_scores_gemma":[0.39140806,0.000009824735,0.6084073,0.000024261743,0.00002303682,0.000034031338,0.0000108194645,0.000013362681,0.000069285845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924403,0.000009349843,0.00023336112,0.00017436441,0.00008297084,0.00025592218],"domain_scores_gemma":[0.99972016,0.000030207693,0.000014928252,0.00012046271,0.000034746827,0.000079487385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015434381,0.00014724676,0.00017145369,0.00013056242,0.00004698063,0.00009290818,0.00007170794,0.0000752072,0.000009248718],"category_scores_gemma":[0.000033047556,0.00014469039,0.000025855801,0.000109108005,0.000019154022,0.00020960995,0.000005300538,0.0001057769,0.0000020147613],"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":[9.053263e-7,0.000018505816,0.000011393544,0.000037605576,0.0000040559703,6.381943e-7,0.0004039806,0.7023109,0.000040211475,0.00017690365,0.0000035250907,0.29699132],"study_design_scores_gemma":[0.0003495395,0.00006395404,0.000047443005,0.000042207997,0.000006663704,0.0000036029974,0.0005674207,0.9979234,0.00012447474,0.00067325245,0.000013684105,0.00018435954],"about_ca_topic_score_codex":0.0000066263037,"about_ca_topic_score_gemma":0.000005524453,"teacher_disagreement_score":0.30439326,"about_ca_system_score_codex":0.000042986478,"about_ca_system_score_gemma":0.000014450922,"threshold_uncertainty_score":0.59003025},"labels":[],"label_agreement":null},{"id":"W2105782335","doi":"10.5267/j.dsl.2013.07.003","title":"Multi-objective scheduling in an agent based Holonic manufacturing system","year":2013,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Computer science; Manufacturing engineering; Industrial engineering; Engineering; Distributed computing; Operations research; Operations management","score_opus":0.019542408871308696,"score_gpt":0.26016015488884703,"score_spread":0.24061774601753833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105782335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63950175,0.000013778029,0.35960072,0.00008453324,0.00045292074,0.00013785301,6.26404e-7,0.00018601018,0.00002178397],"genre_scores_gemma":[0.69909424,9.2543854e-7,0.30050993,0.00032846144,0.000025876689,0.000023530865,0.0000010899856,0.000014629344,0.0000013062852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844444,0.000027057105,0.00028029838,0.00038397164,0.00046902572,0.0003952263],"domain_scores_gemma":[0.9992999,0.00009462784,0.000036260135,0.00035009946,0.00005381561,0.00016533617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059890084,0.0001493817,0.00014706209,0.0005652242,0.00014490195,0.00029669513,0.00044501928,0.000051243565,0.00003065185],"category_scores_gemma":[0.000076026095,0.00013762066,0.000037361264,0.0006545858,0.000094657706,0.00075681857,0.000037845377,0.00019131179,0.00022110988],"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.0000016461937,0.000010114422,0.00082880305,0.000006195802,0.000001110656,0.000009384642,0.00020179928,0.97488606,0.017148288,0.0000020124473,0.000008752708,0.006895845],"study_design_scores_gemma":[0.00038286168,0.000008548986,0.03157211,0.00007825431,0.0000015315517,0.0000035823539,0.00040706733,0.9496391,0.01773113,0.0000026448424,0.0000052464566,0.000167932],"about_ca_topic_score_codex":0.000028937327,"about_ca_topic_score_gemma":0.0000058326723,"teacher_disagreement_score":0.059592474,"about_ca_system_score_codex":0.00032811356,"about_ca_system_score_gemma":0.000024994517,"threshold_uncertainty_score":0.5612008},"labels":[],"label_agreement":null},{"id":"W2106081565","doi":"10.1080/07408170309342349","title":"Optimization-based manufacturing scheduling with multiple resources, setup requirements, and transfer lots","year":2003,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capital District Health Authority","funders":"University of Connecticut; University of California, Santa Cruz; National Science Foundation","keywords":"Subgradient method; Mathematical optimization; Schedule; Computer science; Scheduling (production processes); Job shop scheduling; Integer programming; Heuristic; Linear programming; Mathematics","score_opus":0.011414599928153503,"score_gpt":0.19975513272835876,"score_spread":0.18834053280020527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106081565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036033053,0.00019531649,0.9621223,0.00005513319,0.00014379407,0.00017570853,0.00001786275,0.0004657355,0.000791086],"genre_scores_gemma":[0.74725664,0.000050484192,0.25246942,0.00004268327,0.00001783147,0.000029892815,0.000013196731,0.000051644492,0.0000681805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991458,0.000028408627,0.00020232999,0.00022169792,0.00015412051,0.00024761836],"domain_scores_gemma":[0.99958515,0.000067053996,0.000012311888,0.00017021954,0.000035343626,0.00012989726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000089920344,0.00019493423,0.00014517347,0.00014031999,0.0002440225,0.00007572008,0.000058953734,0.000088162284,0.0002689824],"category_scores_gemma":[0.000007117098,0.0001929035,0.000040196483,0.00019188324,0.000046656773,0.00018525112,6.224114e-7,0.00019117586,0.000005751631],"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.000015339698,0.00002736503,0.0000913941,0.000036825106,0.00004730595,0.0000037292787,0.00022803895,0.9986968,0.00008147234,0.000008195324,0.0000020407745,0.0007614759],"study_design_scores_gemma":[0.0014468465,0.00002948583,0.00009666299,0.00005740967,0.000065102715,0.000012368841,0.00020309575,0.9827632,0.014320634,0.0000046041896,0.0007121014,0.00028850537],"about_ca_topic_score_codex":0.000014266786,"about_ca_topic_score_gemma":0.000041727853,"teacher_disagreement_score":0.7112236,"about_ca_system_score_codex":0.000043222964,"about_ca_system_score_gemma":0.00002361003,"threshold_uncertainty_score":0.78663766},"labels":[],"label_agreement":null},{"id":"W2106360850","doi":"10.1287/inte.1120.0650","title":"Ford Motor Company Implements Integrated Planning and Scheduling in a Complex Automotive Manufacturing Environment","year":2012,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Automotive industry; Scheduling (production processes); Stamping; Manufacturing engineering; Production planning; Supply chain; Engineering; Overtime; Industrial engineering; Operations research; Operations management; Business; Production (economics); Marketing; Economics","score_opus":0.027610855958282308,"score_gpt":0.2549771217926849,"score_spread":0.2273662658344026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106360850","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8591964,0.00012555315,0.13787173,0.00003421175,0.00018588082,0.00020740858,0.00001383438,0.00012386609,0.0022410874],"genre_scores_gemma":[0.9467006,0.000076620425,0.052874986,0.00015476474,0.00011723471,0.000005722079,0.000024756755,0.00002997755,0.000015354684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986708,0.00000756525,0.0005073972,0.00009764588,0.00025254636,0.0004640469],"domain_scores_gemma":[0.99946904,0.000047321606,0.00011674495,0.00010472325,0.000017288281,0.00024486985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033789998,0.00023192645,0.0002663757,0.0003458646,0.0001176052,0.000116989104,0.000116410585,0.00008434563,0.00008997476],"category_scores_gemma":[0.000012685361,0.00019744919,0.000046318793,0.00011337065,0.000028394807,0.00022140845,0.00003808687,0.0005691204,0.000028111002],"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.000027925735,0.00003533755,0.0036137898,0.000019008676,0.00009095076,0.000006031373,0.0009268455,0.9862174,0.00012654364,0.0001801368,0.00003189201,0.00872416],"study_design_scores_gemma":[0.0015012379,0.00005305283,0.019542972,0.00008473595,0.000031084208,0.000047644695,0.0023932762,0.97175395,0.0018742683,0.00012410605,0.0022168078,0.00037686038],"about_ca_topic_score_codex":0.000001773048,"about_ca_topic_score_gemma":4.96695e-7,"teacher_disagreement_score":0.087504156,"about_ca_system_score_codex":0.0002650213,"about_ca_system_score_gemma":0.000012179293,"threshold_uncertainty_score":0.8051744},"labels":[],"label_agreement":null},{"id":"W2107911578","doi":"10.1287/opre.1110.0948","title":"Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Due date; Computer science; Mathematical optimization; Retard; Scheme (mathematics); Job shop scheduling; Operations research; Mathematics; Schedule; Queue; Computer network","score_opus":0.06483650528397482,"score_gpt":0.29525844216900915,"score_spread":0.23042193688503432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107911578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9442557,0.00032725668,0.04194951,0.00011150953,0.00007932722,0.00045150038,0.0000056346503,0.00021942394,0.012600133],"genre_scores_gemma":[0.8301165,0.00010167047,0.16888984,0.000009470666,0.000049155344,0.000099919285,0.000031784733,0.00002888653,0.00067276374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904907,0.00009152642,0.0001781417,0.0001566614,0.00027640435,0.00024820166],"domain_scores_gemma":[0.99933714,0.000048338687,0.000004859972,0.00018348494,0.00036370027,0.00006245394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005565177,0.00008818548,0.00010768488,0.0003680033,0.00017144706,0.00010430925,0.0001328745,0.0000540417,0.00048353767],"category_scores_gemma":[0.00009337506,0.00007942184,0.00001537516,0.0008064869,0.000054672175,0.00030705036,0.000019475732,0.00026920828,0.0002759198],"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.000018797215,0.000032357384,0.0005044106,0.00002251362,0.00001377759,0.000008092505,0.0017464384,0.99473906,0.0012180107,0.00041138826,0.00004570832,0.0012394452],"study_design_scores_gemma":[0.00036042894,0.00003736452,0.0010013346,0.00006728554,0.0000028770698,0.000003963207,0.000652327,0.9948772,0.0028124987,0.000016764097,0.00004634926,0.0001216094],"about_ca_topic_score_codex":0.00018486126,"about_ca_topic_score_gemma":0.00017820319,"teacher_disagreement_score":0.12694032,"about_ca_system_score_codex":0.00007525693,"about_ca_system_score_gemma":0.0000766686,"threshold_uncertainty_score":0.52943987},"labels":[],"label_agreement":null},{"id":"W2110472530","doi":"10.1287/msom.1060.0139","title":"Optimal Due Date Assignment and Resource Allocation to Minimize the Weighted Number of Tardy Jobs on a Single Machine","year":2007,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"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; Due date; Computer science; Mathematical optimization; Scheduling (production processes); Function (biology); Job shop scheduling; Allowance (engineering); Operations research; Time complexity; Resource allocation; Operations management; Queue; Mathematics; Economics; Algorithm","score_opus":0.009263775871631704,"score_gpt":0.22356627100148121,"score_spread":0.2143024951298495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110472530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55732447,0.000040589683,0.43027377,0.002559768,0.0002030854,0.00070132787,0.000011000887,0.00020632957,0.008679652],"genre_scores_gemma":[0.80744463,0.000019463467,0.1907202,0.0009347732,0.00006457453,0.000056003257,0.000058308513,0.000040894356,0.0006611542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989264,0.000029863542,0.00033188701,0.00023754346,0.0002538652,0.00022044303],"domain_scores_gemma":[0.999417,0.000049271563,0.000032525822,0.00037814048,0.00003965876,0.00008338096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035157218,0.00018612512,0.0001441874,0.00012739506,0.00018557883,0.00011284414,0.00019875322,0.000042896292,0.000089480505],"category_scores_gemma":[0.0000051242027,0.00015388936,0.000026738657,0.00020913301,0.000013855683,0.00008680302,0.00010372868,0.0001108068,0.000049604165],"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.000030382203,0.00007016918,0.000032385007,0.0000605417,0.00008169845,0.0000046058653,0.00077166304,0.99167687,0.00016976791,0.00040441004,0.000090177804,0.0066073555],"study_design_scores_gemma":[0.0015626234,0.0000919353,0.017798407,0.00020733841,0.00017804661,0.00001579218,0.0029422534,0.82556164,0.12675926,0.000022044984,0.024172936,0.0006877252],"about_ca_topic_score_codex":0.00006261498,"about_ca_topic_score_gemma":0.00006797511,"teacher_disagreement_score":0.25012016,"about_ca_system_score_codex":0.00006674927,"about_ca_system_score_gemma":0.0000032805417,"threshold_uncertainty_score":0.62754256},"labels":[],"label_agreement":null},{"id":"W2110515532","doi":"10.1111/itor.12105","title":"A simulated annealing with multiple‐search paths and parallel computation for a comprehensive flowshop scheduling problem","year":2014,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Simulated annealing; Computer science; Computation; Job shop scheduling; Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics; Schedule","score_opus":0.06234362332256328,"score_gpt":0.3542725529256587,"score_spread":0.2919289296030954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110515532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111551836,0.00006519804,0.8864528,0.0006202477,0.00014858166,0.00059040094,0.000048389655,0.000118876946,0.00040367505],"genre_scores_gemma":[0.7494507,0.000049897048,0.24993117,0.00003485762,0.000068609945,0.00020118442,0.00016662324,0.000029681289,0.00006726371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836326,0.00012254826,0.00029990877,0.00030110936,0.00063813187,0.00027504796],"domain_scores_gemma":[0.997889,0.0011572076,0.000015900265,0.00008732914,0.00076936634,0.000081225044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072752155,0.00013311695,0.00013778842,0.00051891187,0.00036695646,0.0001731975,0.00014987154,0.00007064897,0.00010976665],"category_scores_gemma":[0.00009009668,0.00013628649,0.000032206597,0.0003929591,0.00008427756,0.00026871217,0.0000119294455,0.00045735834,0.000005138588],"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.00013275769,0.000056697707,0.0003634191,0.000033218297,0.00005259966,0.0000015829711,0.00052211084,0.99203163,0.0003657946,0.0007363658,0.000008567787,0.0056952354],"study_design_scores_gemma":[0.0018752809,0.00009770178,0.00063725986,0.00005014389,0.0000037646512,0.000012937569,0.0005506574,0.9956079,0.00015428761,0.0002095438,0.00064785185,0.00015264563],"about_ca_topic_score_codex":0.00007689914,"about_ca_topic_score_gemma":0.00007754267,"teacher_disagreement_score":0.63789886,"about_ca_system_score_codex":0.00018307356,"about_ca_system_score_gemma":0.00008222526,"threshold_uncertainty_score":0.5557602},"labels":[],"label_agreement":null},{"id":"W2111730029","doi":"10.5555/510378.510634","title":"A simulation test-bed to evaluate multi-agent control of manufacturing systems","year":2000,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Architecture; Discrete event simulation; Computer science; Multi-agent system; Distributed computing; Event (particle physics); Variety (cybernetics); Control (management); Control system; Computer-integrated manufacturing; Manufacturing execution system; Software; Systems engineering; Engineering; Simulation; Artificial intelligence; Operating system","score_opus":0.032392712882554395,"score_gpt":0.27990329474073283,"score_spread":0.24751058185817842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111730029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18572108,0.000033101373,0.8129955,0.000023689554,0.0002656565,0.0003651509,0.000020600655,0.00022922686,0.00034601457],"genre_scores_gemma":[0.99304813,0.0000030171193,0.0064054304,0.000049113438,0.000067353634,0.000021234548,0.000013984239,0.000027035034,0.00036471788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989276,0.0000424408,0.00042595685,0.0001990784,0.00022370496,0.00018124055],"domain_scores_gemma":[0.9991097,0.00030654136,0.000053890035,0.00023353187,0.00019907858,0.000097268094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015475466,0.00016793597,0.00022039296,0.00011967384,0.000045014458,0.00006864144,0.00012618257,0.00007530305,0.00062327157],"category_scores_gemma":[0.00010554197,0.00017072944,0.00005146192,0.0001098532,0.000013736651,0.00014449353,0.000009266436,0.00008613407,0.00018540001],"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.000019414929,0.000021958997,0.00026883656,0.00002906575,0.000023749424,6.564278e-7,0.00054478244,0.9878158,0.00025452764,0.0000050186572,0.000003441364,0.01101275],"study_design_scores_gemma":[0.0009781063,0.000037758655,0.0015403555,0.00009888169,0.000021541618,4.3540302e-7,0.0000426299,0.99487096,0.0019385833,0.000005506489,0.00028576367,0.0001794834],"about_ca_topic_score_codex":0.000011110018,"about_ca_topic_score_gemma":0.000002442743,"teacher_disagreement_score":0.80732703,"about_ca_system_score_codex":0.000053465632,"about_ca_system_score_gemma":0.000014370129,"threshold_uncertainty_score":0.69621444},"labels":[],"label_agreement":null},{"id":"W2115919109","doi":"10.1109/tsmcc.2007.900670","title":"Toward Real-Time Distributed Intelligent Control: A Survey of Research Themes and Applications","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":94,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Real-time Control System; Distributed manufacturing; Control (management); Computer science; Key (lock); Scheduling (production processes); Intelligent control; Supply chain; Distributed computing; Process management; Systems engineering; Manufacturing engineering; Engineering; Operations management; Computer security; Artificial intelligence; Business","score_opus":0.051481716987064656,"score_gpt":0.308105615226717,"score_spread":0.2566238982396523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115919109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023993177,0.013051029,0.9819478,0.00003536427,0.000066721565,0.0015405962,0.0002627249,0.00009930853,0.0005971813],"genre_scores_gemma":[0.91357225,0.08298509,0.0018953228,0.000012377214,0.00007548864,0.00090050563,0.000059934056,0.000037727146,0.00046127735],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986529,0.000118551136,0.00057989324,0.00026564358,0.00016643014,0.00021658663],"domain_scores_gemma":[0.9988747,0.00035072753,0.00007961709,0.00031506288,0.00020323573,0.00017663046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012957802,0.00016752932,0.00035757443,0.00016165686,0.00019511823,0.000061906336,0.00009648034,0.00011277246,0.0000112772],"category_scores_gemma":[0.000007197155,0.00014652724,0.00003944568,0.0004930404,0.00019067383,0.00003496448,0.0000025728236,0.00019182227,0.000021317373],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016860114,0.001482654,0.0018788278,0.005764333,0.0010706016,0.0000045808633,0.003730909,0.08060139,0.00383312,0.017985376,0.0028914185,0.8805882],"study_design_scores_gemma":[0.003961958,0.00066572544,0.011017438,0.0021813586,0.00080641865,0.00020681169,0.003022623,0.334797,0.0063050925,0.000579449,0.6339157,0.0025403944],"about_ca_topic_score_codex":0.00012207283,"about_ca_topic_score_gemma":0.00004021534,"teacher_disagreement_score":0.9800524,"about_ca_system_score_codex":0.000025881296,"about_ca_system_score_gemma":0.000013531008,"threshold_uncertainty_score":0.5975207},"labels":[],"label_agreement":null},{"id":"W2116009168","doi":"10.5267/j.ijiec.2010.03.005","title":"A new mathematical model for the job shop scheduling problem with uncertain processing times","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Scheduling (production processes); Flow shop scheduling; Computer science; Job shop; Operations research; Industrial engineering; Engineering; Mathematics; Schedule","score_opus":0.02836308810103123,"score_gpt":0.26949974974184054,"score_spread":0.24113666164080932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116009168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040484774,0.000054366712,0.9937001,0.0010218247,0.0007917653,0.00016169314,0.0000064888027,0.00009835763,0.00011694713],"genre_scores_gemma":[0.2988939,0.0000035750752,0.6998813,0.000016952063,0.0010857934,0.0000103599195,0.000004543073,0.000034146502,0.000069410846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990114,0.0000045086695,0.00041934906,0.00008142105,0.00033588748,0.00014744527],"domain_scores_gemma":[0.9989296,0.00031233174,0.000117482086,0.00007145203,0.00046726278,0.00010183354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026162816,0.00014008439,0.0001551931,0.00018769754,0.000068473026,0.00020409284,0.00035093134,0.0000937524,0.000022146143],"category_scores_gemma":[0.000219264,0.00010133171,0.000080099264,0.00017559108,0.000019741825,0.00022144195,0.000015715514,0.00053278747,0.0000018569729],"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.000019347612,0.000011930533,0.000012404565,0.00000803895,0.00013984114,0.000002516084,0.0002918237,0.9795937,0.00016991599,0.0023518458,0.00022542792,0.017173229],"study_design_scores_gemma":[0.000984891,0.000025246132,0.0000055921773,0.00015495386,0.0000483372,0.00012153338,0.000064180866,0.99743736,0.00016243872,0.0006980499,0.00017645076,0.00012097772],"about_ca_topic_score_codex":0.0000016219425,"about_ca_topic_score_gemma":0.0000016245855,"teacher_disagreement_score":0.29484543,"about_ca_system_score_codex":0.000051007573,"about_ca_system_score_gemma":0.0002589809,"threshold_uncertainty_score":0.4132187},"labels":[],"label_agreement":null},{"id":"W2116513298","doi":"10.5555/1218112.1218461","title":"The effects of backorder information and reduced-setup dispatching under reorder point or Kanban replenishment","year":2006,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reorder point; Kanban; Computer science; Lead time; Point (geometry); Time point; Upstream (networking); Workstation; Operations research; Economic order quantity; Operations management; Mathematics; Engineering; Supply chain; Computer network; Operating system","score_opus":0.007387597915480334,"score_gpt":0.2298609514416628,"score_spread":0.22247335352618247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116513298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23210627,0.00012261723,0.76529396,0.00031789692,0.0005401863,0.00028871663,0.000004381767,0.00016369288,0.0011623064],"genre_scores_gemma":[0.9951016,0.000026829814,0.0045580463,0.000054575114,0.000040194773,0.00001097323,0.000023660263,0.000010554203,0.0001735984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993025,0.000026812251,0.00031958055,0.00009281358,0.00013611809,0.00012215716],"domain_scores_gemma":[0.9993004,0.00028935677,0.000075539785,0.0001706173,0.00013492216,0.000029117844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116231364,0.000110781286,0.000103712264,0.00005180271,0.00008741346,0.00012590698,0.00007454014,0.000050781277,0.000036365956],"category_scores_gemma":[0.00010400644,0.00007941331,0.000023726432,0.00009918662,0.00003671033,0.00036154658,0.00002550093,0.00008631791,0.000006393538],"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.000029547075,0.000011416786,0.00029602498,0.00009282336,0.000023914177,4.2230928e-7,0.00074872794,0.97975653,0.00019698429,0.0015976056,0.00018609756,0.017059907],"study_design_scores_gemma":[0.0004635781,0.00003289422,0.0061285724,0.00009546069,0.000012142355,0.0000019291097,0.00018144082,0.9903209,0.0012506462,0.0006697467,0.00071937754,0.0001232966],"about_ca_topic_score_codex":0.00002614192,"about_ca_topic_score_gemma":0.000023707946,"teacher_disagreement_score":0.7629953,"about_ca_system_score_codex":0.00002540483,"about_ca_system_score_gemma":0.000018086432,"threshold_uncertainty_score":0.32383808},"labels":[],"label_agreement":null},{"id":"W2117593136","doi":"10.1007/s10951-015-0416-2","title":"A two-stage coupled algorithm for an integrated maintenance planning and flowshop scheduling problem with deteriorating machines","year":2015,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Innovation Foundation; University of Toronto","keywords":"Time horizon; Scheduling (production processes); Computer science; Schedule; Job shop scheduling; Production planning; Production schedule; Optimal maintenance; Integrated production; Interdependence; Production (economics); Mathematical optimization; Operations research; Reliability engineering; Engineering; Mathematics","score_opus":0.026896234385800404,"score_gpt":0.275037016954549,"score_spread":0.2481407825687486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117593136","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31271875,0.0008626481,0.6857791,0.000033725686,0.0002597958,0.00017241674,0.0000069656644,0.00012072927,0.00004584647],"genre_scores_gemma":[0.21261472,0.000019297606,0.78685045,0.00004295963,0.00035460317,0.000011540583,0.000010232537,0.00007548635,0.000020697318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829453,0.000043028107,0.00070877,0.00023459013,0.00032140763,0.00039765218],"domain_scores_gemma":[0.9982524,0.00010776641,0.0003411352,0.00015041242,0.00076903397,0.00037928883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012414712,0.0003151185,0.00048751384,0.0002653806,0.00014860157,0.00028807297,0.00020673095,0.000108453234,0.0000038290855],"category_scores_gemma":[0.00020474575,0.00024845134,0.000068894406,0.00033137406,0.00005529777,0.00079818757,0.000025608013,0.00051062205,8.232193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010696429,0.000024565657,0.00057815213,0.00006253365,0.00009144711,0.000035744128,0.0011877458,0.97370625,0.0017240378,0.000025690751,0.000003954769,0.022452908],"study_design_scores_gemma":[0.0031185052,0.000446462,0.000021598402,0.0006444435,0.000061986415,0.00031558183,0.004702297,0.9895801,0.0006305186,0.00007251626,0.000071605275,0.00033440156],"about_ca_topic_score_codex":0.000013517987,"about_ca_topic_score_gemma":0.000009686167,"teacher_disagreement_score":0.10107135,"about_ca_system_score_codex":0.00010556828,"about_ca_system_score_gemma":0.00016034918,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W2118798909","doi":"10.1109/dexa.2001.953128","title":"Deadline control in holonic manufacturing using mobile agents","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Control reconfiguration; Task (project management); Computer science; Control (management); Quality (philosophy); Product (mathematics); Order (exchange); Mobile agent; Controller (irrigation); Distributed manufacturing; Manufacturing engineering; Distributed computing; Embedded system; Systems engineering; Business; Engineering; Artificial intelligence","score_opus":0.020991168748143236,"score_gpt":0.2301261453828966,"score_spread":0.20913497663475336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118798909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8705971,0.0004008884,0.12591332,0.000020088184,0.00025184095,0.00013840487,0.000002057618,0.00033273106,0.0023435482],"genre_scores_gemma":[0.97537273,0.000041970357,0.024193212,0.00009347097,0.000045301033,0.000008628919,0.0000015932803,0.000020291232,0.00022277955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995177,0.000008428148,0.00014268361,0.00009079324,0.0000665957,0.0001738136],"domain_scores_gemma":[0.9998276,0.000016628363,0.000009720814,0.00009808211,0.0000070448605,0.000040900337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049653056,0.00008267621,0.00009769629,0.000085805485,0.000020668867,0.000019987501,0.000058503247,0.000048159014,0.000899935],"category_scores_gemma":[0.0000046208384,0.00008287106,0.000023695946,0.000080592734,0.0000063562343,0.00006894027,0.0000064558085,0.000091026406,0.000095820746],"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":[5.896073e-7,0.000012043033,0.00043407676,0.000005791155,0.0000065694103,0.000007198435,0.0000564224,0.99690807,0.00008455646,0.0000024478306,0.000055451288,0.0024267838],"study_design_scores_gemma":[0.00058410986,0.0000056986546,0.00035803864,0.000009465866,0.000003956454,0.0000049823957,0.000022844128,0.9964518,0.0021895033,0.0000047433746,0.00026471214,0.00010013075],"about_ca_topic_score_codex":0.0000116615265,"about_ca_topic_score_gemma":0.000004864943,"teacher_disagreement_score":0.10477563,"about_ca_system_score_codex":0.00005009087,"about_ca_system_score_gemma":0.0000013694629,"threshold_uncertainty_score":0.98536575},"labels":[],"label_agreement":null},{"id":"W2119172014","doi":"10.1109/cse.2009.401","title":"A Coarse-Grain Parallel Genetic Algorithm for Flexible Job-Shop Scheduling with Lot Streaming","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Parallel computing; Distributed computing; Mathematical optimization; Algorithm; Mathematics; Computer network","score_opus":0.012849889546641057,"score_gpt":0.23474018051192724,"score_spread":0.22189029096528617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119172014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052389116,0.0003925617,0.9902452,0.0001071484,0.0001703506,0.00032950964,0.000008648723,0.0011922929,0.002315361],"genre_scores_gemma":[0.022174533,0.000052234085,0.97597337,0.00020643795,0.00019851566,0.00004425983,0.000027505892,0.00005995086,0.0012631771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.000010318667,0.00026958727,0.00028012905,0.00018370236,0.0004407842],"domain_scores_gemma":[0.9994277,0.000051055347,0.00003296762,0.00024419703,0.00009456928,0.00014951178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001108108,0.0002548024,0.00023809112,0.00013473383,0.000118228665,0.000106883606,0.0001587061,0.00010572489,0.000058750527],"category_scores_gemma":[0.000017478966,0.00022729467,0.00006979948,0.00029329144,0.000023749291,0.0001238858,0.000009231806,0.00013889634,0.000024004321],"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.000009045707,0.000026278058,0.000037335638,0.0000154441,0.00003913698,0.0000052061005,0.000121152174,0.8324839,0.00009673065,0.00033305204,0.00015938083,0.16667336],"study_design_scores_gemma":[0.0011507419,0.00016373528,0.00015560567,0.000044363995,0.000030371417,0.000019130639,0.00031268538,0.99629,0.0009087136,0.00023847769,0.00033042202,0.00035573172],"about_ca_topic_score_codex":0.00000882349,"about_ca_topic_score_gemma":0.00000603803,"teacher_disagreement_score":0.16631764,"about_ca_system_score_codex":0.000047504072,"about_ca_system_score_gemma":0.00003401324,"threshold_uncertainty_score":0.9268808},"labels":[],"label_agreement":null},{"id":"W2119459533","doi":"10.1109/tsm.2003.822725","title":"An Optimal Residency-Aware Scheduling Technique for Cluster Tools With Buffer Module","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Semiconductor Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Scheduling (production processes); Semiconductor device fabrication; Computer science; Time constraint; Distributed computing; Resource constraints; Job shop scheduling; Cluster (spacecraft); Throughput; Resource (disambiguation); Buffer (optical fiber); Wafer; Real-time computing; Mathematical optimization; Computer network; Engineering; Operating system; Mathematics; Routing (electronic design automation)","score_opus":0.019707882770221605,"score_gpt":0.2438777265884775,"score_spread":0.2241698438182559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119459533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35816148,0.000018097011,0.6402109,0.00003564858,0.00037635825,0.00051108946,0.00004649318,0.0006134361,0.000026467735],"genre_scores_gemma":[0.67934877,0.00001529203,0.32002667,0.000062503954,0.00010799695,0.00028269444,0.000013954234,0.00010678945,0.00003535932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985517,0.000017965282,0.00032109205,0.00044476378,0.00021809565,0.0004463477],"domain_scores_gemma":[0.99915373,0.00008835556,0.000044144075,0.00046128893,0.00007251672,0.00017996941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014201601,0.00036895392,0.0002719791,0.0002635054,0.00025672992,0.00016059632,0.00024111172,0.00022547475,0.00008828054],"category_scores_gemma":[0.0000036067838,0.00035190617,0.00011380478,0.00013232439,0.000043628992,0.00078556483,0.0000011564233,0.00046410764,0.00001778298],"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.00009133655,0.000055037643,9.533678e-7,0.00006672908,0.000058890513,0.000003198793,0.00023224836,0.9732743,0.024123976,0.0000055333503,0.000004137945,0.002083659],"study_design_scores_gemma":[0.00120157,0.00016781208,0.000010969854,0.00017609252,0.00004874167,0.000045330085,0.00021247729,0.07731926,0.920232,0.00008476775,0.000027390328,0.00047362407],"about_ca_topic_score_codex":0.000013678444,"about_ca_topic_score_gemma":0.000024607289,"teacher_disagreement_score":0.896108,"about_ca_system_score_codex":0.0002309252,"about_ca_system_score_gemma":0.00006598815,"threshold_uncertainty_score":0.9998933},"labels":[],"label_agreement":null},{"id":"W2120131607","doi":"10.5267/j.ijiec.2013.10.003","title":"An economic production model for time dependent demand with rework and multiple production setups","year":2014,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Rework; Production (economics); Production model; Computer science; Economics; Microeconomics; Embedded system","score_opus":0.01545120035900783,"score_gpt":0.23046000507990005,"score_spread":0.21500880472089223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120131607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2551377,0.000016989858,0.74285626,0.00023901142,0.0015452125,0.000117720934,0.000009399583,0.000071683324,0.0000060195857],"genre_scores_gemma":[0.90693927,0.0000093187155,0.09134659,0.000006703618,0.0016187219,0.000005805371,0.00002547764,0.000027655706,0.000020437416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993178,0.00001323468,0.00030480282,0.00011932031,0.0001506961,0.000094120966],"domain_scores_gemma":[0.9994338,0.00008023531,0.000106168416,0.000068509245,0.0002359603,0.000075299824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030308764,0.000109005116,0.00013357274,0.0002201123,0.000045878198,0.00007828769,0.000114505194,0.00006706742,0.0000024601136],"category_scores_gemma":[0.00019672129,0.00010659039,0.000030525778,0.000053682194,0.000013374268,0.00033879082,0.0000068734726,0.00016352779,0.0000014727538],"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.000043254404,0.000017825905,0.00012636672,0.000004507982,0.00009390719,4.525867e-7,0.00013908964,0.9955985,0.00055181625,0.000058446818,0.000114830465,0.003251005],"study_design_scores_gemma":[0.0008203957,0.00007761225,0.000053466403,0.00007180161,0.000029322187,0.00008676498,0.000017938371,0.997297,0.0012730409,0.00008083295,0.00007475624,0.000117102914],"about_ca_topic_score_codex":0.0000014848172,"about_ca_topic_score_gemma":0.00000201023,"teacher_disagreement_score":0.6518016,"about_ca_system_score_codex":0.00010751248,"about_ca_system_score_gemma":0.000041948657,"threshold_uncertainty_score":0.434663},"labels":[],"label_agreement":null},{"id":"W2121605956","doi":"10.1613/jair.4278","title":"Integrating Queueing Theory and Scheduling for Dynamic Scheduling Problems","year":2014,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Queueing theory; Computer science; Scheduling (production processes); Mathematical optimization; Layered queueing network; Dynamic priority scheduling; Schedule; Distributed computing; Mathematics; Computer network","score_opus":0.06363703394117042,"score_gpt":0.36788600686330775,"score_spread":0.3042489729221373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121605956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14278598,0.00092850096,0.85537,0.00016756769,0.00037423256,0.00016755768,9.815507e-7,0.00004726044,0.0001579281],"genre_scores_gemma":[0.72141594,0.00022703597,0.27794954,0.00001056336,0.0003331892,0.0000087004755,9.251071e-7,0.00003583153,0.000018238685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979596,0.00024530667,0.0007386039,0.00017327651,0.0004315979,0.0004516161],"domain_scores_gemma":[0.99696016,0.0017796265,0.00012108802,0.0001418948,0.0008206675,0.0001765877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009382523,0.00014778996,0.00026894978,0.00051519636,0.00028626688,0.000276302,0.00027946546,0.00012070905,0.000020336449],"category_scores_gemma":[0.0036168578,0.00013000185,0.000093467126,0.0004527305,0.00014528037,0.00028328615,0.000043184224,0.00083957566,0.000009567536],"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.00005757514,0.000025371843,0.000027814633,0.00012878896,0.000041199914,0.0000020006298,0.001249121,0.6619287,0.01289427,0.026976677,0.000003160494,0.2966653],"study_design_scores_gemma":[0.00005169657,0.00017551241,0.0000041107,0.00033554784,0.000010681107,0.000023076853,0.0039082584,0.9286614,0.015717182,0.050907776,0.00007390278,0.00013084688],"about_ca_topic_score_codex":0.000004884969,"about_ca_topic_score_gemma":0.000013596618,"teacher_disagreement_score":0.57863,"about_ca_system_score_codex":0.00009743746,"about_ca_system_score_gemma":0.00007400612,"threshold_uncertainty_score":0.5301322},"labels":[],"label_agreement":null},{"id":"W2123428140","doi":"","title":"The makespan problem of scheduling multi groups of jobs on multi processors at different speeds","year":2012,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Upper and lower bounds; Parallel computing; Mathematics; Computer network; Routing (electronic design automation)","score_opus":0.0685321649947203,"score_gpt":0.3414718059983619,"score_spread":0.2729396410036416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123428140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9221289,0.0016780588,0.07355894,0.00029500967,0.0004156941,0.0011642586,0.000046251276,0.00015734618,0.0005555343],"genre_scores_gemma":[0.8467963,0.00035162628,0.15136404,0.000005745211,0.00015688542,0.00014330719,0.000029017989,0.00005275123,0.0011003402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786997,0.00016905593,0.0005017125,0.00019937163,0.00067045516,0.00058943994],"domain_scores_gemma":[0.99857664,0.0003020209,0.00003414927,0.00041187165,0.0005156363,0.00015969951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010317414,0.0001898239,0.00023347854,0.00028641077,0.00050638575,0.00006842256,0.00036651237,0.0001221589,0.00005707833],"category_scores_gemma":[0.00021613069,0.0001370251,0.0000735809,0.0006733932,0.00020887058,0.00017744912,0.000110097404,0.0004760856,0.000063797495],"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.000033008182,0.00061061035,0.003639718,0.00020504584,0.00016468846,0.0000010164243,0.0042787,0.96150434,0.012358927,0.0018948164,0.00008371299,0.015225418],"study_design_scores_gemma":[0.00064780563,0.00007809047,0.0025746196,0.00007947412,0.000011019467,0.000003735352,0.0009345783,0.9511015,0.044259094,0.000007960673,0.0001454321,0.00015671938],"about_ca_topic_score_codex":0.000047141508,"about_ca_topic_score_gemma":0.00009503422,"teacher_disagreement_score":0.07780511,"about_ca_system_score_codex":0.00016574308,"about_ca_system_score_gemma":0.000044308843,"threshold_uncertainty_score":0.55877215},"labels":[],"label_agreement":null},{"id":"W2123490024","doi":"10.1007/s10951-008-0068-6","title":"A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine","year":2008,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Mathematical optimization; Computer science; Single-machine scheduling; Scheduling (production processes); Job shop scheduling; Heuristic; Guided Local Search; Sequence (biology); Operations research; Mathematics; Schedule","score_opus":0.03508282374171459,"score_gpt":0.25634219489471294,"score_spread":0.22125937115299835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123490024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64716846,0.0021361103,0.34900826,0.00028323548,0.00044605767,0.00037758448,0.000022653983,0.00017776185,0.000379847],"genre_scores_gemma":[0.658695,0.00028100912,0.34042397,0.000058673053,0.00034361926,0.000008657671,0.0000044859876,0.00006807058,0.0001165538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800193,0.00004957969,0.00072457973,0.00024105082,0.00055859034,0.00042427983],"domain_scores_gemma":[0.99875766,0.0002539307,0.00020299597,0.00016836412,0.000338858,0.0002781687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084159785,0.00027736067,0.00044854733,0.00037146997,0.00024121154,0.00010982216,0.00022646922,0.00014160304,0.00003683643],"category_scores_gemma":[0.0002446824,0.00025531687,0.00013905812,0.00022717004,0.000063885054,0.0002606536,0.000038381317,0.0006184018,0.000022826907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011727233,0.00011124316,0.00024404298,0.0001244178,0.000118619144,0.000106814136,0.0007424781,0.9819921,0.013343668,0.00006082969,0.000017047956,0.0030214263],"study_design_scores_gemma":[0.0020903081,0.0005400816,0.00003657307,0.00040962137,0.00006743186,0.0012545664,0.00028747518,0.98358005,0.011111628,0.00020916054,0.00005656047,0.00035651794],"about_ca_topic_score_codex":0.0000050460994,"about_ca_topic_score_gemma":0.0000011184911,"teacher_disagreement_score":0.011526482,"about_ca_system_score_codex":0.00018590532,"about_ca_system_score_gemma":0.00011187873,"threshold_uncertainty_score":0.9999899},"labels":[],"label_agreement":null},{"id":"W2123622158","doi":"10.1109/rtcsa.1999.811284","title":"Hybrid genetic algorithms for scheduling partially ordered tasks in a multi-processor environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Fair-share scheduling; Dynamic priority scheduling; Genetic algorithm; Quality control and genetic algorithms; Combinatorial optimization; Parallel computing; Optimization problem; Algorithm; Theoretical computer science; Distributed computing; Meta-optimization; Mathematics; Machine learning; Schedule","score_opus":0.025530002643548207,"score_gpt":0.24433368583145343,"score_spread":0.21880368318790522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123622158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028586136,0.0006065208,0.9696685,0.000033538046,0.00022825283,0.0003747565,0.0000085885995,0.00022517669,0.0002685009],"genre_scores_gemma":[0.23589009,0.00010625899,0.76348764,0.000058543857,0.000032479227,0.0001609851,0.000013058204,0.000049420716,0.00020155519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887383,0.000019664953,0.00033851826,0.00026971308,0.00012560314,0.00037265854],"domain_scores_gemma":[0.9996132,0.00004416967,0.000027647891,0.00018703057,0.000025040972,0.00010289364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017190262,0.00019403426,0.00019104267,0.00010231337,0.000053327203,0.000042725827,0.00010889706,0.000072747214,0.00017639935],"category_scores_gemma":[0.00008316425,0.00020113261,0.00005434233,0.00011185323,0.00001967439,0.000070581256,0.000010496844,0.00011352998,0.00005176992],"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.0000035242722,0.000057240788,0.00023120175,0.000033084052,0.000018300669,0.000004370893,0.00009289498,0.99341935,0.00030074976,0.000061646635,0.00001638658,0.0057612606],"study_design_scores_gemma":[0.0014846913,0.000024639658,0.0001742927,0.00001450932,0.000011957711,0.0000068693075,0.00009945321,0.9860776,0.010661888,0.00010301943,0.0010637338,0.0002773362],"about_ca_topic_score_codex":0.0000059085714,"about_ca_topic_score_gemma":0.000009510834,"teacher_disagreement_score":0.20730394,"about_ca_system_score_codex":0.00006422912,"about_ca_system_score_gemma":0.000027852067,"threshold_uncertainty_score":0.82019496},"labels":[],"label_agreement":null},{"id":"W2125276392","doi":"10.1007/s00170-009-2028-5","title":"A developed production control and scheduling model in the semiconductor manufacturing systems with hybrid make-to-stock/make-to-order products","year":2009,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Build to order; Scheduling (production processes); Workstation; Due date; Queue; Job shop; Computer science; Production control; Semiconductor device fabrication; Industrial engineering; Job shop scheduling; Flow shop scheduling; Idle; Production (economics); Engineering; Schedule; Operations management; Operating system","score_opus":0.010074633915861974,"score_gpt":0.2326971972156933,"score_spread":0.22262256329983132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125276392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89775443,0.00026614856,0.08858647,0.012123399,0.000615422,0.000485183,0.000003626576,0.00013742699,0.000027900736],"genre_scores_gemma":[0.89010525,0.000065971755,0.109149285,0.00038264343,0.00020403758,0.00002790567,0.0000015330663,0.000027702537,0.000035669087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852306,0.00002869094,0.00048720711,0.00025491376,0.0004150085,0.00029110108],"domain_scores_gemma":[0.9991272,0.00005894507,0.00018629072,0.00028222855,0.00028838817,0.000056958255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004838971,0.00023777262,0.0002795592,0.0006430061,0.00008885027,0.00010240924,0.00075363985,0.00007046778,0.0000010148004],"category_scores_gemma":[0.00021642912,0.0001526688,0.00002646448,0.00022920016,0.00004474418,0.00018675457,0.000047677113,0.000597857,0.0000025904494],"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.00014940427,0.00002199213,0.000017788638,0.000011719908,0.000066465895,0.000032763248,0.00036349118,0.96875423,0.009543056,0.00008474656,0.000015014304,0.020939324],"study_design_scores_gemma":[0.0035594646,0.00042209544,0.0015007178,0.00083696464,0.000083630184,0.0051689628,0.002021253,0.26748675,0.71419173,0.0028674784,0.001056933,0.00080401654],"about_ca_topic_score_codex":0.0000028755308,"about_ca_topic_score_gemma":0.000007944469,"teacher_disagreement_score":0.7046487,"about_ca_system_score_codex":0.00017295414,"about_ca_system_score_gemma":0.00005502298,"threshold_uncertainty_score":0.62256527},"labels":[],"label_agreement":null},{"id":"W21256856","doi":"10.1016/j.neuropsychologia.2011.01.027","title":"Rescheduling in the OR: A decision support system keeps stakeholders and OR-manager happy","year":2013,"lang":"en","type":"article","venue":"Neuropsychologia","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Institutes of Health Research; Autism Speaks","keywords":"Business; Decision support system; Process management; Computer science; Operations management; Knowledge management; Economics; Artificial intelligence","score_opus":0.04495853257196385,"score_gpt":0.26087714915570154,"score_spread":0.21591861658373768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W21256856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582951,0.00011741586,0.030279944,0.00028098506,0.000992892,0.0005694472,0.000003756056,0.0006211665,0.008839311],"genre_scores_gemma":[0.9667589,0.000105302235,0.032164495,0.0006383203,0.00006336282,0.000050854604,0.00000302308,0.00003964644,0.00017609616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989273,0.0000727712,0.00028822478,0.0002706618,0.00018041066,0.0002606483],"domain_scores_gemma":[0.9992494,0.00025516286,0.000031590913,0.00037206945,0.000030285868,0.00006148563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003123272,0.00016217992,0.00015640308,0.00012875785,0.000065227854,0.00015244343,0.0002534072,0.00009741991,0.00016233868],"category_scores_gemma":[0.0001501391,0.00009710673,0.000026045029,0.00042068333,0.000037708178,0.00013815856,0.000025780959,0.00029277414,0.00015513718],"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.000591388,0.00034292153,0.011342049,0.00061214034,0.00012932385,0.0024746398,0.007479212,0.3884936,0.0025198075,0.0011753213,0.05580948,0.52903014],"study_design_scores_gemma":[0.002979888,0.00048995495,0.12671325,0.00033580008,0.00003991168,0.0008083631,0.008650967,0.85438293,0.000108530934,0.000096027325,0.0044878963,0.0009064781],"about_ca_topic_score_codex":0.000010349265,"about_ca_topic_score_gemma":0.00000766707,"teacher_disagreement_score":0.5281237,"about_ca_system_score_codex":0.00001925528,"about_ca_system_score_gemma":0.000007711109,"threshold_uncertainty_score":0.39598975},"labels":[],"label_agreement":null},{"id":"W2125990606","doi":"10.1613/jair.2169","title":"Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling","year":2007,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tabu search; Constructive; Set (abstract data type); Computer science; Guided Local Search; Mathematical optimization; Job shop scheduling; Benchmark (surveying); Scheduling (production processes); Beam search; Iterative deepening depth-first search; Search algorithm; Incremental heuristic search; Mathematics; Artificial intelligence; Schedule","score_opus":0.2050300271260984,"score_gpt":0.43022691183994627,"score_spread":0.22519688471384786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125990606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09277709,0.00035362935,0.90517724,0.00024606698,0.000798632,0.00026202784,0.0000045611114,0.000045276676,0.00033550078],"genre_scores_gemma":[0.637368,0.00012658536,0.36175007,0.0000097569055,0.00066625915,0.000004588907,0.0000011987231,0.000032820615,0.000040691408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973146,0.000096276584,0.0009699153,0.0001539241,0.00073750335,0.0007278101],"domain_scores_gemma":[0.9959591,0.0009765931,0.000087702276,0.00017291636,0.0025031837,0.00030047275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007815317,0.00014532602,0.00026685058,0.00082913344,0.0002971517,0.00014956042,0.0003747689,0.0001572274,0.00009114465],"category_scores_gemma":[0.0011737293,0.00013770502,0.00016687695,0.00081753056,0.00027586677,0.00027287332,0.00004714272,0.0009425461,0.00005311254],"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.0003004738,0.00015873168,0.00034619874,0.00010054067,0.00016913442,0.000048328024,0.0032636777,0.76832104,0.039097928,0.0084909,0.0001973918,0.17950565],"study_design_scores_gemma":[0.00011092907,0.00015153279,0.000036062032,0.00008690978,0.000009077538,0.000070936105,0.009176262,0.7806533,0.20795202,0.0015640312,0.000045060428,0.00014387094],"about_ca_topic_score_codex":0.000015916867,"about_ca_topic_score_gemma":0.000022221078,"teacher_disagreement_score":0.54459095,"about_ca_system_score_codex":0.00030209386,"about_ca_system_score_gemma":0.00022566614,"threshold_uncertainty_score":0.5615448},"labels":[],"label_agreement":null},{"id":"W2126074884","doi":"10.1007/s10696-010-9067-y","title":"An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem","year":2010,"lang":"en","type":"article","venue":"Flexible Services and Manufacturing Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":58,"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 Manitoba","funders":"","keywords":"Job shop scheduling; Computer science; Benchmark (surveying); Mathematical optimization; Architecture; Genetic algorithm; Scheduling (production processes); Population; Job shop; Algorithm; Flow shop scheduling; Mathematics; Machine learning; Schedule","score_opus":0.006928841356162337,"score_gpt":0.22625474495972653,"score_spread":0.2193259036035642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126074884","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4084937,0.0011175557,0.5879116,0.00025513623,0.0013656046,0.0003507611,0.000015312318,0.00038135657,0.000108971704],"genre_scores_gemma":[0.20441546,0.00031840464,0.79323554,0.00021504586,0.0015563377,0.000043579315,0.000013408948,0.00009961004,0.00010263149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985409,0.000024215027,0.00037213808,0.00028140988,0.000259905,0.00052143075],"domain_scores_gemma":[0.99910724,0.00010537315,0.00009994289,0.00031373586,0.00008592761,0.00028775583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043639782,0.00030626508,0.0002409038,0.00017276467,0.0007482877,0.00067765836,0.0004362921,0.00013234043,0.00007266633],"category_scores_gemma":[0.0000051329407,0.00021892523,0.00011207975,0.00010014565,0.00004652975,0.00015507433,0.000049138012,0.00080604124,0.0000063505468],"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.000019171737,0.000018678724,0.000021802309,0.00012472467,0.00006582767,0.000003737156,0.0004764885,0.90483135,0.0009070312,0.00002183011,0.000013479204,0.0934959],"study_design_scores_gemma":[0.0009523355,0.00006622937,0.0006177582,0.00006935987,0.00007177521,0.00037427337,0.00037823903,0.972376,0.020711897,0.00062098395,0.0034324666,0.00032870355],"about_ca_topic_score_codex":0.000017776154,"about_ca_topic_score_gemma":0.000020727408,"teacher_disagreement_score":0.2053239,"about_ca_system_score_codex":0.00002155607,"about_ca_system_score_gemma":0.00003279258,"threshold_uncertainty_score":0.8927512},"labels":[],"label_agreement":null},{"id":"W2126310456","doi":"10.5539/mas.v3n6p83","title":"The Work in Process (WIP) Control Model and Its Application Simulation in Small-batch and Multi-varieties Production Mode","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Batch production; Production line; Factory (object-oriented programming); Scheduling (production processes); Computer science; Production (economics); Process (computing); Work in process; Production control; Manufacturing engineering; Work (physics); Volume (thermodynamics); Process control; Industrial engineering; Process engineering; Engineering; Operations management; Mechanical engineering","score_opus":0.013973130853296654,"score_gpt":0.25078945543238496,"score_spread":0.2368163245790883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126310456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34618554,0.00016317688,0.6530357,0.00012241954,0.000019327395,0.0003492653,3.707258e-7,0.000065250875,0.00005893422],"genre_scores_gemma":[0.9905637,0.00003529303,0.009258891,0.00002991224,0.000013792454,0.00007783442,9.923275e-7,0.00000761834,0.00001194983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992293,0.0000062504264,0.00016160031,0.00027517386,0.00013740832,0.00019027542],"domain_scores_gemma":[0.9997404,0.000026391863,0.000028169969,0.000116561554,0.000049048023,0.00003943385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003960771,0.000095708005,0.00008757055,0.0000969352,0.00015664569,0.000085032865,0.000112398,0.000048160866,8.136077e-8],"category_scores_gemma":[0.000039903447,0.00008284025,0.0000046220516,0.00047995313,0.0000747564,0.00016894177,0.000009858891,0.00012103437,6.1649246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018629404,0.000012845762,0.00012936753,0.0000066871053,5.0753664e-7,4.1392227e-8,0.0015383338,0.9696127,0.007081329,0.00037384723,1.0132221e-7,0.02122557],"study_design_scores_gemma":[0.00033394006,0.0000033446752,0.0021459677,0.000007946787,0.0000018223208,3.0957455e-7,0.000083047766,0.9930216,0.0008894963,0.0034137522,4.846487e-7,0.000098289485],"about_ca_topic_score_codex":0.0000026238752,"about_ca_topic_score_gemma":0.000026413629,"teacher_disagreement_score":0.6443782,"about_ca_system_score_codex":0.000046855108,"about_ca_system_score_gemma":0.000028842465,"threshold_uncertainty_score":0.33781272},"labels":[],"label_agreement":null},{"id":"W2126394800","doi":"10.1007/s10951-006-7041-z","title":"On the connection between a cyclic job shop and a reentrant flow shop scheduling problem","year":2006,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Reentrancy; Flow shop scheduling; Job shop; Job shop scheduling; Computer science; Flow (mathematics); Mathematical optimization; Scheduling (production processes); Mathematics; Schedule; Operating system","score_opus":0.012741533451711364,"score_gpt":0.21722542229965386,"score_spread":0.2044838888479425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126394800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80524194,0.0009300316,0.19176146,0.00086966105,0.000359225,0.00013881124,0.0000031706784,0.000103891456,0.0005917787],"genre_scores_gemma":[0.82895654,0.00012476055,0.16993687,0.000056204506,0.0008519935,0.0000040116574,0.000002878415,0.000043391265,0.000023356446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984157,0.000060971528,0.0006848819,0.00016053271,0.00037332624,0.00030459205],"domain_scores_gemma":[0.99898046,0.0003845707,0.00020379647,0.00015126252,0.00016042913,0.0001194675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091446994,0.00022493667,0.00032616535,0.00023118357,0.00021515306,0.00018253516,0.00017890582,0.000117996926,0.00003156246],"category_scores_gemma":[0.00015715111,0.0001664467,0.00013007234,0.00032933574,0.000048034442,0.0002413991,0.00001988025,0.0006905968,0.000009630161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022824144,0.000020926176,0.0022639085,0.000036993297,0.000091525624,0.000014719857,0.00016964212,0.99222666,0.0013005988,0.00085680524,0.00005454722,0.0029408687],"study_design_scores_gemma":[0.0010484752,0.00012173634,0.0013915658,0.00047929655,0.00011515349,0.00015675703,0.0005339064,0.99057543,0.003078698,0.002103749,0.0000993451,0.0002958953],"about_ca_topic_score_codex":0.000006425051,"about_ca_topic_score_gemma":0.000003852977,"teacher_disagreement_score":0.023714568,"about_ca_system_score_codex":0.000083668776,"about_ca_system_score_gemma":0.00003563261,"threshold_uncertainty_score":0.6787499},"labels":[],"label_agreement":null},{"id":"W2127277545","doi":"10.1287/opre.51.6.981.24912","title":"Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematical optimization; Parametric statistics; Linear programming relaxation; Scheduling (production processes); Linear programming; Decomposition; Computer science; Mathematics; Relaxation (psychology); Permutation (music); Schedule; Job shop scheduling; Algorithm","score_opus":0.036609564681968756,"score_gpt":0.3075154858989144,"score_spread":0.2709059212169457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127277545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116045296,0.006494645,0.84380794,0.0008368933,0.00038406294,0.0011966897,0.000036013338,0.0006685152,0.030529939],"genre_scores_gemma":[0.49413994,0.00017177785,0.5052988,0.000015321204,0.00005844628,0.00007000147,0.00002744532,0.000020799429,0.00019747695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879986,0.0001851247,0.00021214249,0.00020533381,0.00023450893,0.00036304502],"domain_scores_gemma":[0.99929476,0.00014524846,0.000005256073,0.00018329368,0.00022918692,0.0001422461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082763797,0.00011146801,0.000112873655,0.00014200815,0.000611804,0.00031383728,0.00009668805,0.000076306984,0.00018170792],"category_scores_gemma":[0.00020631801,0.00011412998,0.00001982401,0.00062046334,0.000089502624,0.00018778254,0.000024574352,0.00035597457,0.000043603806],"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.0000018946544,0.000030406438,0.00008681018,0.000016802753,0.00001732898,0.0000021396263,0.00018951022,0.99130094,0.0020676192,0.004308655,0.000092964176,0.0018849088],"study_design_scores_gemma":[0.00026759866,0.000040071234,0.000021147325,0.000057081903,0.0000045795064,0.000031990017,0.00013337997,0.9973022,0.0012067134,0.00019706026,0.0006021481,0.00013604676],"about_ca_topic_score_codex":0.000018361347,"about_ca_topic_score_gemma":0.00015257487,"teacher_disagreement_score":0.37809464,"about_ca_system_score_codex":0.00005864749,"about_ca_system_score_gemma":0.000074940515,"threshold_uncertainty_score":0.47055638},"labels":[],"label_agreement":null},{"id":"W2127515805","doi":"10.1109/etfa.1999.815417","title":"Experimental approach of control for unreliable manufacturing systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Corrective maintenance; Formalism (music); Computer science; Reliability engineering; Production control; Maintenance engineering; Control system; Production (economics); Mathematical optimization; Industrial engineering; Engineering; Preventive maintenance; Mathematics","score_opus":0.011771952640828715,"score_gpt":0.2118221431528722,"score_spread":0.20005019051204348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127515805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009508146,0.0005783733,0.96539956,0.0000011474119,0.0004107447,0.0002322172,0.000004396207,0.00014827058,0.023717122],"genre_scores_gemma":[0.8700946,0.0000019253412,0.12938485,0.0000064569113,0.00002080419,0.00005110611,0.0000035244193,0.000015962636,0.00042080114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962443,0.0000066639814,0.0001322433,0.00006990811,0.000055991946,0.00011073266],"domain_scores_gemma":[0.9998275,0.000029286455,0.000013941928,0.000082722276,0.000015704392,0.00003084371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081311955,0.000066612534,0.000113878166,0.00003142593,0.000020266847,0.000014045976,0.00003940156,0.000037280282,0.000027759079],"category_scores_gemma":[0.000008012911,0.0000606923,0.000031900003,0.000027503158,0.0000066183593,0.000037173442,0.0000015524737,0.00002526029,0.0000029727958],"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.0000024305596,0.000018457069,0.0000120347395,0.00005184181,0.000022265607,5.960315e-8,0.000041567226,0.9951385,0.00102277,0.0034791688,0.00018374837,0.000027132839],"study_design_scores_gemma":[0.0006735538,0.000013484366,0.0000018942986,0.000005630988,0.000005182675,0.0000021445874,0.00047461133,0.7381462,0.26001367,0.0000065139902,0.00058459985,0.00007251876],"about_ca_topic_score_codex":0.0000042710253,"about_ca_topic_score_gemma":2.6746575e-8,"teacher_disagreement_score":0.8605864,"about_ca_system_score_codex":0.000017670882,"about_ca_system_score_gemma":0.000004125534,"threshold_uncertainty_score":0.24749601},"labels":[],"label_agreement":null},{"id":"W2131433807","doi":"10.1109/tsm.2002.801379","title":"Optimal scheduling techniques for cluster tools with process-module and transport-module residency constraints","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Semiconductor Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Correctness; Heuristics; Computer science; Scheduling (production processes); Process (computing); Turnaround time; Mathematical optimization; Linear programming; Benchmark (surveying); Distributed computing; Algorithm; Mathematics; Programming language","score_opus":0.023156218931489152,"score_gpt":0.23677106212008966,"score_spread":0.21361484318860052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131433807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.460635,0.00006730303,0.5378302,0.000049150145,0.00019231829,0.00041784864,0.000058000627,0.0005872471,0.0001629357],"genre_scores_gemma":[0.7969549,0.00009129785,0.20243108,0.000060210496,0.00007965191,0.00016445736,0.000006718755,0.00008688098,0.00012480334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985815,0.0000131904035,0.00035296523,0.00043812534,0.00020235259,0.0004118474],"domain_scores_gemma":[0.9993487,0.00012457135,0.00005241417,0.00025418153,0.00006537479,0.00015477915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011594045,0.00035872246,0.000302898,0.0002324922,0.00023519147,0.000099421646,0.00014378398,0.00018903134,0.00023392943],"category_scores_gemma":[0.000005200535,0.00034303847,0.000086555374,0.00011677238,0.00012121776,0.00058560265,7.4673284e-7,0.00039585406,0.000008711151],"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.00006607623,0.00006809641,0.000015885013,0.00027161057,0.00012075159,0.000005527724,0.0008501919,0.96167946,0.0033973893,0.000007572932,0.000018820469,0.033498645],"study_design_scores_gemma":[0.0011225971,0.00013640207,0.000031805004,0.00026551966,0.00008776726,0.000079470454,0.0003263534,0.19375317,0.80349785,0.00004143137,0.00007989991,0.000577725],"about_ca_topic_score_codex":0.000003654924,"about_ca_topic_score_gemma":0.000010085345,"teacher_disagreement_score":0.80010045,"about_ca_system_score_codex":0.00006734136,"about_ca_system_score_gemma":0.000018737876,"threshold_uncertainty_score":0.9999022},"labels":[],"label_agreement":null},{"id":"W2132366614","doi":"10.5267/j.ijiec.2012.03.002","title":"A parallel machine extension to aversion dynamics scheduling","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Carnegie Mellon University","keywords":"Extension (predicate logic); Scheduling (production processes); Computer science; Mathematical optimization; Mathematics; Programming language","score_opus":0.022583107963247875,"score_gpt":0.2563867569650616,"score_spread":0.23380364900181372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132366614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08471055,0.00016642094,0.9074904,0.00048574415,0.006842876,0.00007243478,0.000014773335,0.00011880164,0.00009799914],"genre_scores_gemma":[0.7818931,0.000018835806,0.21666661,0.000044770713,0.0013083657,0.0000018198751,0.000024190727,0.000028388784,0.000013977184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891174,0.000013872376,0.00044353437,0.00006886,0.0003702378,0.00019173836],"domain_scores_gemma":[0.99917006,0.00011359697,0.00008918969,0.00007374402,0.00033096186,0.00022244826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027614296,0.00013561193,0.00016311515,0.00048578408,0.000036532598,0.00006299776,0.0002414693,0.000093879025,0.000029035104],"category_scores_gemma":[0.00029141997,0.0001402677,0.00009228271,0.00026287296,0.0000071024633,0.00030594773,0.00003681791,0.00034536197,0.000026429683],"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.000017062397,0.000032544234,0.000361857,0.0000022535605,0.000095756164,0.000006979926,0.00016584268,0.99239635,0.0001519717,0.00049350376,0.00022468608,0.006051163],"study_design_scores_gemma":[0.0007312509,0.000030168341,0.00030765642,0.00011775911,0.000020369935,0.00011486735,0.00007074808,0.9973785,0.00019168813,0.000021235135,0.00086923665,0.00014646957],"about_ca_topic_score_codex":0.000004297504,"about_ca_topic_score_gemma":5.379806e-7,"teacher_disagreement_score":0.6971825,"about_ca_system_score_codex":0.00026600843,"about_ca_system_score_gemma":0.000031659132,"threshold_uncertainty_score":0.5719951},"labels":[],"label_agreement":null},{"id":"W2136004943","doi":"10.1007/s10951-009-0139-3","title":"Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki","keywords":"Job shop scheduling; Minification; Computer science; Time complexity; Scheduling (production processes); Schedule; Mathematical optimization; Running time; Single-machine scheduling; Algorithm; Mathematics","score_opus":0.022401129049784016,"score_gpt":0.2536726972704223,"score_spread":0.23127156822063827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136004943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9032843,0.0015848717,0.09421899,0.00025444373,0.00028315236,0.00009593695,0.0000021441892,0.000060240003,0.00021589115],"genre_scores_gemma":[0.5967784,0.00015591811,0.40283412,0.0000620766,0.00012478717,4.5352897e-7,0.0000020641446,0.000021173075,0.000021025811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856853,0.00003907953,0.00074278837,0.00013651823,0.00029427878,0.00021879068],"domain_scores_gemma":[0.9992533,0.00009745311,0.00026284312,0.000118947304,0.00014999062,0.00011746651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170946,0.00019573793,0.0003955596,0.00044137434,0.000044760433,0.000060377097,0.00016368915,0.00012895997,0.000019768107],"category_scores_gemma":[0.00022887078,0.00018577545,0.00008658102,0.00031454928,0.000027866225,0.00024669094,0.00001221537,0.00033794862,0.0000044151443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060933253,0.00014325752,0.0010057925,0.00003401539,0.00002616145,0.000013675851,0.0003714169,0.9788566,0.010384116,0.00004929194,0.000004098206,0.009050639],"study_design_scores_gemma":[0.0016809449,0.00020683989,0.0036127788,0.00042962484,0.00003298557,0.000048775993,0.00019874163,0.9886525,0.004852021,0.00007436706,0.000012576705,0.00019782371],"about_ca_topic_score_codex":0.0000014807607,"about_ca_topic_score_gemma":9.612268e-7,"teacher_disagreement_score":0.30861512,"about_ca_system_score_codex":0.00005683763,"about_ca_system_score_gemma":0.000024357401,"threshold_uncertainty_score":0.7575703},"labels":[],"label_agreement":null},{"id":"W2138319780","doi":"10.5539/ibr.v6n3p192","title":"A Simple Multiproduct Multimachine Production Planning Model","year":2013,"lang":"en","type":"article","venue":"International Business Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"USable; Production (economics); Production planning; Business; Business system planning; Competence (human resources); Operations management; Computer science; Simple (philosophy); Operations research; Industrial organization; Marketing; Process management; Economics; Microeconomics; Management; Engineering","score_opus":0.0672901305834902,"score_gpt":0.35872040719436726,"score_spread":0.29143027661087706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138319780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72539526,0.00034302575,0.2583417,0.0033727626,0.002176939,0.0007602899,0.00002001846,0.00092128513,0.008668736],"genre_scores_gemma":[0.9547084,0.00004931614,0.043116912,0.000022886019,0.0005681852,0.0001379766,0.000098847995,0.000041199422,0.0012562869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986413,0.000025500307,0.0001978109,0.00025832426,0.00059424894,0.00028279354],"domain_scores_gemma":[0.99828297,0.000056377277,0.000017293469,0.00021034364,0.0013644045,0.00006863505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033071742,0.000113491034,0.00009334068,0.00038010275,0.00011680615,0.00016242998,0.000289418,0.000057747347,0.00030490625],"category_scores_gemma":[0.00068052625,0.00010874049,0.000023592349,0.0005331087,0.00005419023,0.0004607221,0.00006993385,0.00030789626,0.00035737315],"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.0000068314876,0.000034418106,0.0016485996,0.000018616618,0.000023407138,0.0000020167668,0.00014713642,0.98267275,0.00568378,0.000022067848,0.005106569,0.004633819],"study_design_scores_gemma":[0.00020059122,0.0000034274155,0.011262575,0.000025651747,0.0000012751555,0.0000064432975,0.00005676651,0.9851757,0.0021487926,0.00040454778,0.0005945924,0.00011960435],"about_ca_topic_score_codex":0.00012800861,"about_ca_topic_score_gemma":0.0000026569185,"teacher_disagreement_score":0.22931314,"about_ca_system_score_codex":0.00011415057,"about_ca_system_score_gemma":0.00003210882,"threshold_uncertainty_score":0.4593428},"labels":[],"label_agreement":null},{"id":"W2138502430","doi":"10.1007/s00236-011-0132-0","title":"Nonatomic dual bakery algorithm with bounded tokens","year":2011,"lang":"en","type":"article","venue":"Acta Informatica","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":"University of Northern British Columbia","funders":"","keywords":"Theory of computation; Bounded function; Dual (grammatical number); Computer science; Algorithm; Mathematics; Theoretical computer science; Discrete mathematics","score_opus":0.011188192693208738,"score_gpt":0.17994344259313597,"score_spread":0.16875524989992724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138502430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18904129,0.000102396225,0.46515596,0.00012346837,0.0013083955,0.0006075913,0.0000527319,0.0028916376,0.34071654],"genre_scores_gemma":[0.40843013,0.000033564844,0.5909478,0.00025289544,0.000068387744,0.000024802035,0.000036116155,0.000041166593,0.00016510967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992339,0.000005491567,0.0002589831,0.000068661626,0.00016860358,0.00026435038],"domain_scores_gemma":[0.9995452,0.0000249172,0.000036297824,0.00023225794,0.00004947114,0.000111825546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000852717,0.00015423833,0.0001448873,0.0000944469,0.000066086446,0.00005632648,0.00012434441,0.00007619799,0.00039063496],"category_scores_gemma":[0.000013029284,0.00012908338,0.000032230397,0.00017298502,0.00004356563,0.0005017427,0.0000226171,0.00016187428,0.00033787053],"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.00041435388,0.0009128179,0.002642078,0.0017405404,0.0036427714,0.00039578092,0.17305596,0.0722566,0.00035316663,0.014156968,0.050083164,0.6803458],"study_design_scores_gemma":[0.0007325524,0.00007267327,0.0006013357,0.00003828766,0.000031670254,0.00010629334,0.0007822238,0.9906002,0.0016921016,0.00011407743,0.0048388215,0.00038972357],"about_ca_topic_score_codex":0.000006454407,"about_ca_topic_score_gemma":0.0000019762242,"teacher_disagreement_score":0.91834366,"about_ca_system_score_codex":0.000034365912,"about_ca_system_score_gemma":0.000031435622,"threshold_uncertainty_score":0.5263867},"labels":[],"label_agreement":null},{"id":"W2139061105","doi":"10.1109/tcad.2013.2293067","title":"Variation-Aware Geometric Programming Models for the Clock Network Buffer Sizing Problem","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Compute Canada; CMC Microsystems","keywords":"Geometric programming; Skew; Mathematical optimization; Sizing; Computer science; Reduction (mathematics); Robustness (evolution); Heuristic; Clock network; Clock skew; Mathematics; Jitter","score_opus":0.0290336320966531,"score_gpt":0.21287268830427608,"score_spread":0.18383905620762298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139061105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000185349,0.00059585844,0.99614704,0.000019217241,0.0015506592,0.001121934,0.000019406774,0.0003324109,0.000028128838],"genre_scores_gemma":[0.9199236,0.000102184276,0.0793219,0.000029295177,0.00022514044,0.00028639933,0.00000772208,0.000057736717,0.00004601375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850935,0.00012815472,0.0005587101,0.00027433003,0.00021231352,0.0003171661],"domain_scores_gemma":[0.99818176,0.0010175518,0.00011810707,0.00025089225,0.00032691157,0.00010478781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007389157,0.0002604998,0.0003683685,0.00024724548,0.00029536136,0.00020221491,0.00018817301,0.00016572594,0.000003881542],"category_scores_gemma":[0.000010009682,0.0001954777,0.0000995047,0.0007850034,0.0000306688,0.00014577503,9.512659e-7,0.00024371584,0.000001885822],"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.0000079206975,0.000031156862,0.000001110853,0.000109424516,0.00016062154,2.2362867e-7,0.00021709893,0.89339495,0.000050006944,0.00038718228,0.00006760232,0.10557269],"study_design_scores_gemma":[0.0005226615,0.00022017604,0.000004906066,0.00026043778,0.00008098866,0.000013165863,0.00009584193,0.9980553,0.00021979977,0.00010921875,0.00019920328,0.0002183006],"about_ca_topic_score_codex":0.00007173292,"about_ca_topic_score_gemma":0.000002678145,"teacher_disagreement_score":0.9197383,"about_ca_system_score_codex":0.000062544146,"about_ca_system_score_gemma":0.0000429742,"threshold_uncertainty_score":0.79713494},"labels":[],"label_agreement":null},{"id":"W2143228176","doi":"10.1080/07408170590948495","title":"Empirical Bayes forecasting methods for job flow times","year":2005,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; National Science Foundation","keywords":"Bayes' theorem; Parametric statistics; Econometrics; Mathematics; Exponential distribution; Statistics; Computer science; Bayesian probability","score_opus":0.04940613717440935,"score_gpt":0.33822777687704847,"score_spread":0.28882163970263913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143228176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003714517,0.0002349374,0.99606496,0.0005037921,0.0003818516,0.0001160781,0.000018973325,0.0005353974,0.0017725489],"genre_scores_gemma":[0.028822372,0.000023081306,0.97005904,0.00007204498,0.00021006798,0.00006600421,0.000006811624,0.00003617842,0.00070438883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994574,0.000017825638,0.00016910599,0.00011837759,0.000048885126,0.00018841361],"domain_scores_gemma":[0.99955714,0.00021888452,0.000010312113,0.00010080823,0.000040243685,0.000072637224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014118891,0.00010414807,0.00011509403,0.0000762125,0.00014111234,0.000033198132,0.000063139276,0.0000763367,0.00043690848],"category_scores_gemma":[0.000024798535,0.00010678896,0.000100200945,0.00015589083,0.000015365635,0.00012589467,9.639255e-7,0.000118404176,0.000024215802],"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.0000030164529,0.000009994275,0.0000037960294,0.00000969442,0.000026543245,1.1387627e-7,0.00022832365,0.7399585,0.00006790898,0.000006362138,0.00029374647,0.25939196],"study_design_scores_gemma":[0.0002484364,0.000012478562,0.000020973874,0.000008107881,0.000036437967,0.000008762722,0.00004746929,0.9794825,0.0026335588,0.00008997949,0.017284622,0.0001267082],"about_ca_topic_score_codex":0.000001350129,"about_ca_topic_score_gemma":0.000010069318,"teacher_disagreement_score":0.25926524,"about_ca_system_score_codex":0.000036261816,"about_ca_system_score_gemma":0.000013662192,"threshold_uncertainty_score":0.47838417},"labels":[],"label_agreement":null},{"id":"W2143862728","doi":"10.1243/095440502320192932","title":"Evaluating alternative manufacturing control strategies using a benchmark system","year":2002,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Benchmark (surveying); Adaptability; Job shop; Heuristics; Control (management); Discrete event simulation; Computer science; Production (economics); Control system; Industrial engineering; Routing (electronic design automation); Engineering; Simulation; Flow shop scheduling; Job shop scheduling; Artificial intelligence; Embedded system","score_opus":0.022231575425774558,"score_gpt":0.23546178151412908,"score_spread":0.21323020608835452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143862728","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71908015,0.0007298897,0.2764849,0.000058248635,0.0028229598,0.00031700573,0.000020312815,0.00016044806,0.00032608194],"genre_scores_gemma":[0.9628409,0.000046279103,0.03676417,0.000006632401,0.00029635362,0.0000035692367,5.1062443e-7,0.000035904126,0.0000056759877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979699,0.0000106518655,0.000948573,0.0001455736,0.000644259,0.00028101457],"domain_scores_gemma":[0.9987951,0.00008480177,0.00051223976,0.0001222856,0.00036159827,0.00012395428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005874789,0.00030217267,0.00055174675,0.0002732396,0.00006658796,0.000048914364,0.0004812902,0.00018053148,0.000026721174],"category_scores_gemma":[0.00023209128,0.00023532509,0.00028255399,0.00024667793,0.00004666582,0.00048863323,0.000038119288,0.00058160396,8.364598e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016615328,0.00002059192,0.0000035438384,0.000471037,0.00020991621,0.00000209491,0.00019114996,0.9770933,0.019264223,0.0024176135,0.000033106367,0.00027683043],"study_design_scores_gemma":[0.00074142875,0.00007889689,0.000016711285,0.0008644333,0.00013931899,0.00010983781,0.00032293255,0.7902166,0.20721307,0.000047476376,0.00007206772,0.00017720567],"about_ca_topic_score_codex":0.0000026362502,"about_ca_topic_score_gemma":8.793239e-8,"teacher_disagreement_score":0.24376075,"about_ca_system_score_codex":0.00020339088,"about_ca_system_score_gemma":0.000027751114,"threshold_uncertainty_score":0.9596278},"labels":[],"label_agreement":null},{"id":"W2143959861","doi":"10.1109/wsc.2002.1166373","title":"Optimization of buffer sizes in assembly systems using intelligent techniques","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Buffer (optical fiber); Distributed computing","score_opus":0.019843600316455143,"score_gpt":0.24877312169250412,"score_spread":0.228929521376049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143959861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014184582,0.00028516373,0.9785667,0.0000024442093,0.0001967773,0.00012422792,6.4499704e-7,0.00020956698,0.0064298743],"genre_scores_gemma":[0.5384453,0.00008216022,0.4613754,0.0000052390983,0.0000119498245,0.0000063729753,0.0000020317166,0.000017692357,0.00005388451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994659,0.000026289603,0.0002472789,0.00007706229,0.00008266386,0.000100846235],"domain_scores_gemma":[0.99977523,0.000026867408,0.000024286253,0.0000968235,0.000052828742,0.000023933737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016209115,0.00007893557,0.00012772295,0.00013881478,0.000010707223,0.0000189702,0.000044441775,0.000068405236,0.00004336682],"category_scores_gemma":[0.000042688345,0.00007617352,0.000019912852,0.000250909,0.000008383301,0.00007448976,0.0000045857596,0.00005254413,0.0000016296171],"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":[6.6197276e-7,0.000011937106,0.00024614212,0.000029060708,0.0000057187954,4.4896777e-7,0.000049650815,0.9980051,0.00066092244,0.0007430338,0.000008844568,0.0002384995],"study_design_scores_gemma":[0.00005693273,0.0000071955283,0.000006496294,0.00004766947,0.0000035895623,0.0000027731057,0.00016369541,0.93375653,0.06581484,0.000008110424,0.000049462764,0.000082713894],"about_ca_topic_score_codex":0.000034730783,"about_ca_topic_score_gemma":0.0000020029156,"teacher_disagreement_score":0.5242607,"about_ca_system_score_codex":0.00005127924,"about_ca_system_score_gemma":0.000011595052,"threshold_uncertainty_score":0.31062663},"labels":[],"label_agreement":null},{"id":"W2144089590","doi":"10.1109/isic.1998.713641","title":"Evaluating the relative performance of alternative control architectures for manufacturing","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Control (management); Architecture; Control system; Work (physics); Computer-integrated manufacturing; Industrial engineering; Manufacturing engineering; Engineering; Artificial intelligence","score_opus":0.03334041470905396,"score_gpt":0.27441754794971324,"score_spread":0.24107713324065927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144089590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7452914,0.00015501356,0.2505209,0.0000932816,0.0001474516,0.00026126235,0.00000579822,0.000096408156,0.0034284699],"genre_scores_gemma":[0.9362794,0.000009387224,0.0632502,0.000040249455,0.00006399194,0.000032236054,7.1527256e-7,0.000012730235,0.0003110746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.00001590642,0.00014118107,0.000070999995,0.00010333774,0.00011020237],"domain_scores_gemma":[0.99951726,0.00030149333,0.00003357732,0.00009405737,0.00003661473,0.000016973225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015254953,0.00007465807,0.000088808,0.000034081713,0.00006370794,0.00000907252,0.00009063088,0.000022570528,0.000104379185],"category_scores_gemma":[0.000054558044,0.00004838906,0.000042101838,0.000038337403,0.00002411102,0.000026088075,0.0000058624532,0.000086143715,0.000005576694],"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.000007563663,0.0000033562237,0.00004505375,0.000015519365,0.000042678694,4.15322e-8,0.00068078475,0.9795841,0.00009068757,0.00008762643,0.000013787499,0.019428784],"study_design_scores_gemma":[0.00047704295,0.00008115742,0.00020954784,0.0000144546175,0.000014045009,0.000001185492,0.000037337864,0.9706194,0.02829655,0.00017130938,0.00001591497,0.00006205892],"about_ca_topic_score_codex":0.0000021659125,"about_ca_topic_score_gemma":6.013564e-7,"teacher_disagreement_score":0.190988,"about_ca_system_score_codex":0.000013062121,"about_ca_system_score_gemma":0.0000016632056,"threshold_uncertainty_score":0.19732486},"labels":[],"label_agreement":null},{"id":"W2144175900","doi":"10.5539/mas.v5n1p68","title":"Research on the Optimization Method of Virtual Enterprise’s Task Scheduling Problems in Aluminum Industry","year":2011,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Particle swarm optimization; Scheduling (production processes); Energy consumption; Mathematical optimization; Dynamic priority scheduling; Fair-share scheduling; Genetic algorithm scheduling; Two-level scheduling; Job shop scheduling; Industrial engineering; Algorithm; Engineering; Mathematics","score_opus":0.06824854641958825,"score_gpt":0.3061752596966633,"score_spread":0.23792671327707507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144175900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050580814,0.000014689217,0.937515,0.000029926827,0.00009974162,0.0002556675,0.0000016937636,0.00007403807,0.011428419],"genre_scores_gemma":[0.80214083,0.000006352375,0.19772235,0.00002713066,0.000016678589,0.00004990344,9.246251e-7,0.000015761318,0.00002008659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984482,0.000053452295,0.00025396657,0.00029738268,0.0005914378,0.00035555684],"domain_scores_gemma":[0.99931735,0.00012322895,0.000040332015,0.0003391361,0.000106495885,0.0000734555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028258215,0.000110476496,0.0001232625,0.0003852228,0.00014460609,0.000048372476,0.0005779493,0.00013061409,0.000048519232],"category_scores_gemma":[0.00008282043,0.00008861503,0.000018308123,0.0014500364,0.0002908268,0.0001239989,0.00009077397,0.0006640361,0.000012641197],"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.0000059940044,0.000034562956,0.000069635804,0.0000062210725,0.0000027297785,3.2707604e-7,0.0030715957,0.98071516,0.011194324,0.0021671385,0.0000032354294,0.00272911],"study_design_scores_gemma":[0.00014537988,0.000023208659,0.000148023,0.0000375059,0.00000159846,8.0365027e-7,0.0009679141,0.97525406,0.02270824,0.0006188921,0.0000017241798,0.00009263576],"about_ca_topic_score_codex":0.000021574391,"about_ca_topic_score_gemma":0.000002711657,"teacher_disagreement_score":0.75156003,"about_ca_system_score_codex":0.00008688791,"about_ca_system_score_gemma":0.00008448172,"threshold_uncertainty_score":0.36136162},"labels":[],"label_agreement":null},{"id":"W2144300893","doi":"10.1007/s10107-005-0588-1","title":"The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","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":"University of British Columbia","funders":"","keywords":"Heuristic; Scheduling (production processes); Probabilistic logic; Bounded function; Mathematical optimization; Computer science; Mathematics; Algorithm; Competitive analysis; Job shop scheduling; Job scheduler; Upper and lower bounds; Schedule; Artificial intelligence","score_opus":0.015704423003646266,"score_gpt":0.24866394673604508,"score_spread":0.2329595237323988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144300893","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026268546,0.00013464731,0.9723757,0.00014409896,0.000043387387,0.0005165811,0.0000049452924,0.00027904141,0.0002330425],"genre_scores_gemma":[0.20801643,0.000019679395,0.7915806,0.000019002204,0.00010657335,0.0001019749,0.000029816367,0.00004541964,0.00008051858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.000013470813,0.00038953917,0.00016320286,0.0002281642,0.0003265428],"domain_scores_gemma":[0.9991892,0.0002474084,0.00007042729,0.00029225575,0.00008987539,0.000110839705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000404744,0.00019263022,0.00021970429,0.000050724775,0.00020587465,0.00009336144,0.0001992324,0.00006163369,0.000012574362],"category_scores_gemma":[0.00008648592,0.00012319976,0.000050257968,0.0001715937,0.000080070735,0.00017967583,0.000015838583,0.00017272393,0.000014612255],"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.000021085852,0.00009484519,0.0000064081373,0.000108072476,0.000033836815,5.0671247e-7,0.00014518597,0.58261514,0.000005141703,0.0016446841,0.0000014745715,0.41532364],"study_design_scores_gemma":[0.0006569481,0.00033442833,0.0000035938021,0.00011245092,0.000032905336,0.000010455224,0.00013165725,0.9963385,0.0015959342,0.0002960995,0.00031326068,0.00017379294],"about_ca_topic_score_codex":7.413373e-7,"about_ca_topic_score_gemma":0.0000027822864,"teacher_disagreement_score":0.41514984,"about_ca_system_score_codex":0.000032379292,"about_ca_system_score_gemma":0.000018163635,"threshold_uncertainty_score":0.502394},"labels":[],"label_agreement":null},{"id":"W2145245983","doi":"10.5555/1162708.1163005","title":"Optimal lot-sizing in a two-stage system with auto-correlated arrivals","year":2005,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Independence (probability theory); Computer science; Mathematical optimization; Constant (computer programming); Product (mathematics); Production (economics); Stage (stratigraphy); Industrial engineering; Mathematics; Statistics; Engineering","score_opus":0.018029304888906632,"score_gpt":0.25817074026298836,"score_spread":0.24014143537408172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145245983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24376424,0.000037490343,0.752274,0.0000396632,0.00015827174,0.00014861325,0.0000042873844,0.00056412496,0.00300933],"genre_scores_gemma":[0.96203727,0.0000016809313,0.037496477,0.000029762497,0.00007810338,0.000012193144,0.000015040194,0.000031972722,0.0002975109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990653,0.00003089951,0.0003181547,0.00020975072,0.00015559483,0.00022031703],"domain_scores_gemma":[0.9995224,0.000066391614,0.000050831844,0.00019081388,0.00009986678,0.00006968219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012373822,0.00017197087,0.00018881596,0.00015771558,0.000036849535,0.000097206525,0.00012253219,0.00006225417,0.00017121508],"category_scores_gemma":[0.000018404819,0.00016455019,0.000028060047,0.00023406342,0.00002003019,0.000276543,0.000016771983,0.0001914916,0.000106489664],"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.000017987973,0.000010131542,0.0013666624,0.000023751149,0.000014913366,0.000006802574,0.0009255469,0.9954148,0.00008143268,0.00029933813,0.0000024738792,0.001836139],"study_design_scores_gemma":[0.0009379675,0.00001717891,0.0007675099,0.0002293958,0.000007364335,0.000004713997,0.00034648314,0.9968915,0.00039079238,9.435733e-7,0.00019811223,0.00020802431],"about_ca_topic_score_codex":0.00001465027,"about_ca_topic_score_gemma":0.000037609712,"teacher_disagreement_score":0.71827304,"about_ca_system_score_codex":0.00012913937,"about_ca_system_score_gemma":0.0000274429,"threshold_uncertainty_score":0.6710162},"labels":[],"label_agreement":null},{"id":"W2146059336","doi":"10.1109/ismvl.1994.302208","title":"On scheduling in multiprocessor systems using fuzzy logic","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multiprocessing; Fuzzy logic; Computer science; Parallel computing; Scheduling (production processes); Scheme (mathematics); Processor scheduling; Artificial intelligence; Mathematical optimization; Mathematics; Operating system","score_opus":0.03852134970030522,"score_gpt":0.2414291428450411,"score_spread":0.2029077931447359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146059336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6388971,0.0020479665,0.31998843,0.000059890397,0.0013038705,0.00028446456,0.000002629561,0.0012273503,0.036188275],"genre_scores_gemma":[0.9116367,0.000033063003,0.0879716,0.00005619994,0.00006576053,0.000006767419,0.0000013044099,0.00002516736,0.00020343463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993725,0.000010732533,0.0001855127,0.00013130187,0.00010728796,0.00019270823],"domain_scores_gemma":[0.99976456,0.00003824868,0.000015388188,0.000111037625,0.000023396995,0.00004734802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008022291,0.00011059712,0.00012292904,0.00014493347,0.000031946107,0.000047045247,0.000072791816,0.000078011944,0.00010272147],"category_scores_gemma":[0.000046216148,0.00010305452,0.000021065738,0.0002746132,0.000007908471,0.00007916346,0.000006716902,0.00013129406,0.00014234781],"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":[8.336304e-7,0.000017441338,0.000108905646,0.000027922717,0.000004266851,0.0000047825856,0.000086634725,0.9984219,0.000112672824,0.0007622269,0.000013071522,0.0004393188],"study_design_scores_gemma":[0.00030150817,0.000008166485,0.000015905776,0.00005909486,0.0000022787972,0.000004685145,0.00014300352,0.99904704,0.00021837199,0.00004570358,0.000016226442,0.00013799824],"about_ca_topic_score_codex":0.000015989308,"about_ca_topic_score_gemma":0.0000019853617,"teacher_disagreement_score":0.2727396,"about_ca_system_score_codex":0.0000621703,"about_ca_system_score_gemma":0.0000023760756,"threshold_uncertainty_score":0.42024413},"labels":[],"label_agreement":null},{"id":"W2147337787","doi":"","title":"A discussion of production planning approaches in the process industry","year":2001,"lang":"en","type":"preprint","venue":"ORBi (University of Liège)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Production planning; Production (economics); Process (computing); Computer science; Discrete manufacturing; Material flow; Control (management); Process industry; Focus (optics); Management science; Production control; Industrial engineering; Manufacturing engineering; Engineering; Economics; Artificial intelligence","score_opus":0.04342695162640251,"score_gpt":0.23373322207454067,"score_spread":0.19030627044813817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147337787","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97858304,0.000141206,0.017992003,0.0009249251,0.00025090514,0.0002637471,0.000008382625,0.000088256034,0.001747528],"genre_scores_gemma":[0.992558,0.00004177933,0.007090301,0.0000021302913,0.00005535371,7.4369797e-7,0.000026026724,0.000010840917,0.00021482471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941915,0.000035322362,0.00011233169,0.00016670315,0.0001685556,0.00009792477],"domain_scores_gemma":[0.999612,0.00001215586,0.00009927703,0.00021920764,0.00003616278,0.000021200842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020207369,0.000109215754,0.00018417794,0.00016317739,0.00003953724,0.000007934166,0.00029032092,0.0003219103,0.000019193756],"category_scores_gemma":[0.0000065250288,0.00008897261,0.000046277375,0.00028435266,0.000052593266,0.00008589042,0.000072259034,0.00067419995,9.996288e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012662107,0.000049582155,0.013346535,0.0003795546,0.000024158451,0.00000630993,0.010364491,0.974523,0.000015802454,0.000012760894,0.00007552684,0.0011895803],"study_design_scores_gemma":[0.0010704293,0.00007067268,0.091183655,0.0030694313,0.0002060312,0.000029213883,0.12379296,0.77745396,0.0011726341,0.00089958607,0.00016317295,0.000888275],"about_ca_topic_score_codex":0.00006399626,"about_ca_topic_score_gemma":0.000009784848,"teacher_disagreement_score":0.19706911,"about_ca_system_score_codex":0.00003271488,"about_ca_system_score_gemma":0.00004007694,"threshold_uncertainty_score":0.36281976},"labels":[],"label_agreement":null},{"id":"W2147702352","doi":"10.1108/13552510810861914","title":"Ant colonies for structure optimisation in a failure prone series‐parallel production system","year":2008,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Series (stratigraphy); Production line; Mathematical optimization; Series and parallel circuits; Ant colony optimization algorithms; Production (economics); Ant colony; Computer science; Constraint (computer-aided design); Line (geometry); Homogeneous; Algorithm; Mathematics; Engineering","score_opus":0.017087117484387366,"score_gpt":0.2395639069053787,"score_spread":0.22247678942099133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147702352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8408696,0.00023361345,0.15714845,0.0004416524,0.00088549725,0.00031676827,0.000009303265,0.0000897517,0.0000053800695],"genre_scores_gemma":[0.794773,0.00006297778,0.20486161,0.000005909545,0.0002406907,0.000018122164,0.000004841195,0.000016358339,0.00001651404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987893,0.000026822048,0.0006747467,0.000108440836,0.00017538658,0.00022531603],"domain_scores_gemma":[0.9995015,0.00005285067,0.00014661213,0.00008968013,0.00016376481,0.00004555209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057820877,0.0001447592,0.0003247146,0.0001950556,0.000028476503,0.000016951488,0.000101493606,0.0000988497,0.0000018374622],"category_scores_gemma":[0.0003233968,0.00012616832,0.00005593309,0.00028120968,0.000014057674,0.00033422865,0.0000068142094,0.00029483257,2.6095074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005734327,0.000013441647,0.0005973136,0.00033020484,0.000017190427,0.000014711564,0.0011846257,0.993959,0.0033884228,0.00021707636,0.000057302215,0.00016336715],"study_design_scores_gemma":[0.0016749339,0.00011157566,0.012635621,0.00096128247,0.000011852054,0.0007241607,0.002462078,0.9763741,0.0042175814,0.000050747498,0.000386921,0.00038915887],"about_ca_topic_score_codex":0.000006279987,"about_ca_topic_score_gemma":0.000035153556,"teacher_disagreement_score":0.047713157,"about_ca_system_score_codex":0.0003950896,"about_ca_system_score_gemma":0.00003821702,"threshold_uncertainty_score":0.5144995},"labels":[],"label_agreement":null},{"id":"W2147965468","doi":"10.1287/opre.1040.0144","title":"Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hoist (device); Integer programming; Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Engineering; Algorithm; Mathematics; Operating system; Structural engineering","score_opus":0.0718429271301883,"score_gpt":0.34431680421789984,"score_spread":0.27247387708771154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147965468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09134617,0.00031392986,0.9053591,0.00023950747,0.00018478055,0.00049542735,0.0000058022065,0.00045863388,0.0015966701],"genre_scores_gemma":[0.41660777,0.000030483254,0.582482,0.00000849899,0.0001079914,0.00022178123,0.00006376131,0.000040745108,0.0004370227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839014,0.00007677267,0.00026899728,0.00030720266,0.00043290356,0.00052399724],"domain_scores_gemma":[0.9990844,0.00003685396,0.000006376176,0.00034487632,0.00034116334,0.00018628995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068551133,0.00016038655,0.00015119568,0.0003509178,0.0005093106,0.00045771376,0.00028626472,0.00013476594,0.00005110572],"category_scores_gemma":[0.00026687855,0.00015676758,0.000058492074,0.0010042394,0.00013312443,0.00024712074,0.00006760781,0.0006921621,0.00027692795],"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.0000030192396,0.00015206501,0.000020956717,0.00002105108,0.000025790736,0.000004271851,0.0007399783,0.99473053,0.0007217336,0.0011144363,0.000026733054,0.0024394407],"study_design_scores_gemma":[0.0007144619,0.00003373907,0.00004374226,0.000027597776,0.000004613366,0.000013505912,0.0013018483,0.9943292,0.0026288116,0.000006016457,0.0007054885,0.00019094501],"about_ca_topic_score_codex":0.000098438395,"about_ca_topic_score_gemma":0.00006574922,"teacher_disagreement_score":0.3252616,"about_ca_system_score_codex":0.00020264338,"about_ca_system_score_gemma":0.00013630309,"threshold_uncertainty_score":0.63927966},"labels":[],"label_agreement":null},{"id":"W2148717184","doi":"10.1007/978-3-540-24840-8_59","title":"Scheduling Using Constraint-Directed Search","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Windsor","funders":"","keywords":"Job shop scheduling; Computer science; Constraint satisfaction problem; Schedule; Mathematical optimization; Scheduling (production processes); Constraint satisfaction; Constraint programming; Constraint satisfaction dual problem; Constraint (computer-aided design); Local consistency; Mathematics; Artificial intelligence","score_opus":0.023723774562969,"score_gpt":0.2514761038039608,"score_spread":0.22775232924099179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148717184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007019317,0.00048297152,0.9945024,0.000040819144,0.0014082543,0.00017365844,0.000005908052,0.00057439756,0.0021096128],"genre_scores_gemma":[0.10413024,0.000035973764,0.89520663,0.000121476696,0.000401687,0.0000012475791,0.0000076175,0.00006219664,0.000032910095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981171,0.000009314867,0.0003260429,0.0005624301,0.0005070568,0.00047806153],"domain_scores_gemma":[0.9991333,0.00012717508,0.000047239144,0.00038511824,0.0001699553,0.0001372493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034769252,0.0003539699,0.00033093686,0.0006174293,0.00014486576,0.00021485238,0.0005346584,0.00030721503,0.00010264775],"category_scores_gemma":[0.00004806477,0.0003709626,0.000071914495,0.0004338159,0.00047588226,0.000141794,0.00012635105,0.0008370493,0.000026582076],"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":[9.28042e-7,0.0000033260774,0.000006969156,0.00003088344,0.000008986299,0.000026340113,0.00019064908,0.92285305,0.000157649,0.0004938393,2.2502367e-7,0.076227166],"study_design_scores_gemma":[0.00019631,0.000015703205,0.000005585623,0.00048873655,0.0000075112166,0.00004628699,3.64793e-7,0.99174774,0.0019231013,0.0051502036,0.000013415364,0.00040505538],"about_ca_topic_score_codex":0.000012975655,"about_ca_topic_score_gemma":0.000007668653,"teacher_disagreement_score":0.10342831,"about_ca_system_score_codex":0.00045556654,"about_ca_system_score_gemma":0.00041962744,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W2149179348","doi":"10.1109/cimat.1994.389041","title":"The use of batch sizing to improve flow and waiting times in FMS","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sizing; Scheduling (production processes); Computer science; Flexible manufacturing system; Product (mathematics); Genetic algorithm; Job shop scheduling; Process (computing); Industrial engineering; Manufacturing engineering; Mathematical optimization; Engineering; Mathematics; Machine learning; Operating system; Schedule","score_opus":0.021343661619269757,"score_gpt":0.19918382928323292,"score_spread":0.17784016766396316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149179348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8839292,0.0012615045,0.10211708,0.0012989911,0.0006084416,0.00040230213,0.000006891006,0.00047346644,0.00990213],"genre_scores_gemma":[0.79080856,0.000106921834,0.20815162,0.000061573024,0.000032026794,0.0000050976923,4.788187e-7,0.000014717418,0.000818984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967945,0.0000056981808,0.00011235613,0.000058506022,0.000045882127,0.00009808235],"domain_scores_gemma":[0.99975735,0.00011970185,0.0000074069317,0.000073400966,0.00001486322,0.00002727414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006273017,0.000046511883,0.00005698201,0.000030593532,0.000025646454,0.00003757025,0.000033829812,0.000022400254,0.00004341356],"category_scores_gemma":[0.00007723194,0.00003467155,0.000009426365,0.00010572144,0.000007943372,0.000060161787,0.000014103884,0.000047444588,0.0000073152432],"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.0000014946108,0.0000049911114,0.00041167802,0.000010829551,0.000008089084,7.4238835e-7,0.0006755631,0.8589933,0.00058385346,0.00011871342,0.00027643493,0.13891433],"study_design_scores_gemma":[0.000086024236,0.0000079177635,0.00010308628,0.000011356903,0.0000013186304,5.364429e-7,0.00012386589,0.99746937,0.001673288,0.000006139805,0.00046904405,0.000048066522],"about_ca_topic_score_codex":0.000019608688,"about_ca_topic_score_gemma":0.000015266225,"teacher_disagreement_score":0.13886626,"about_ca_system_score_codex":0.0000075679436,"about_ca_system_score_gemma":9.3807444e-7,"threshold_uncertainty_score":0.14138648},"labels":[],"label_agreement":null},{"id":"W2149623236","doi":"10.1109/icsmc.2000.886346","title":"Holonic self-organization of multi-agent systems by fuzzy modeling with application to intelligent manufacturing","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Fuzzy logic; Multi-agent system; Intelligent agent; Systems engineering; Distributed computing; Software engineering; Artificial intelligence; Engineering","score_opus":0.011683034422036779,"score_gpt":0.19940366167652998,"score_spread":0.1877206272544932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149623236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09217693,0.0001928672,0.9065114,0.000023706367,0.00008317193,0.0002609305,0.0000025187717,0.00046557203,0.0002828603],"genre_scores_gemma":[0.9283736,0.00009571884,0.07130537,0.000018293766,0.000023166067,0.000023161587,0.000016922653,0.00003953683,0.000104279454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935037,0.000007981989,0.0002254972,0.00015102333,0.0001336354,0.00013150508],"domain_scores_gemma":[0.99963486,0.000008063155,0.000028990016,0.00017696145,0.00007945865,0.000071678885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005495658,0.00011393762,0.000116027666,0.00008134907,0.000035060562,0.000028585853,0.00009030971,0.000052851097,0.000024631016],"category_scores_gemma":[0.0000048512356,0.00010335504,0.000013088687,0.00021570297,0.000003599325,0.000062825886,0.0000125564675,0.0000584972,0.00007545562],"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":[5.3433894e-7,0.00003178569,0.00005435619,0.0000429863,0.000021511902,1.5495738e-7,0.0004049492,0.9978391,0.0005314438,0.0000313892,0.00006157906,0.0009801908],"study_design_scores_gemma":[0.00013702105,0.000013905393,0.0000068606423,0.000019994473,0.000012012386,0.000002712312,0.00016845689,0.96360123,0.035829496,4.979342e-7,0.00008037177,0.00012742648],"about_ca_topic_score_codex":0.000024154717,"about_ca_topic_score_gemma":0.0000017974809,"teacher_disagreement_score":0.8361966,"about_ca_system_score_codex":0.00007915543,"about_ca_system_score_gemma":0.0000025916472,"threshold_uncertainty_score":0.42146963},"labels":[],"label_agreement":null},{"id":"W2151504680","doi":"10.1504/ijise.2010.030744","title":"Stochastic cycle time analysis in robotic cells","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial and Systems Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Robot; Computer science; Parametric statistics; Cellular manufacturing; Graph; Real-time computing; Simulation; Engineering; Artificial intelligence; Mathematical optimization; Mathematics; Theoretical computer science","score_opus":0.010166384082196191,"score_gpt":0.2076001092707483,"score_spread":0.1974337251885521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151504680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8817026,0.00018298086,0.110262945,0.000049715836,0.0075792666,0.00007145856,0.0000070803158,0.000051528652,0.00009244208],"genre_scores_gemma":[0.9975941,0.000007978344,0.0015212427,0.000002575251,0.00083117833,0.0000014083582,0.000002379278,0.000012688856,0.000026424199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991697,0.000009772448,0.00042628378,0.00006354054,0.00022444455,0.000106244435],"domain_scores_gemma":[0.9996002,0.00008478474,0.000076223674,0.00005268025,0.00010500695,0.00008110479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030140587,0.0000955919,0.00023346393,0.0005935938,0.000009201526,0.0000893454,0.00015352655,0.000106026826,0.000025293482],"category_scores_gemma":[0.0000909922,0.00008978171,0.00006517221,0.00025655254,0.000007907574,0.00012703237,0.000012414524,0.00038968032,0.00000455906],"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.0000051902234,0.0000077781015,0.00021316584,0.0000027040185,0.00024741265,0.000018445848,0.00006216808,0.9948914,0.00393156,0.000039293223,0.000019210298,0.0005616545],"study_design_scores_gemma":[0.0004997532,0.00001039689,0.00015866317,0.00005731087,0.000046154622,0.000058855312,0.000026866588,0.99875534,0.00024223034,0.000003144596,0.0000510398,0.00009024288],"about_ca_topic_score_codex":0.000014736126,"about_ca_topic_score_gemma":0.0000022964798,"teacher_disagreement_score":0.115891546,"about_ca_system_score_codex":0.000040014293,"about_ca_system_score_gemma":0.000016143005,"threshold_uncertainty_score":0.36611918},"labels":[],"label_agreement":null},{"id":"W2151705548","doi":"10.12785/isl/010106","title":"Performance Assessment of Feasible Scheduling Multiprocessor Tasks Solutions by using DEA FDH method","year":2012,"lang":"en","type":"article","venue":"Information Sciences Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiprocessing; Parallel computing; Computer science; Scheduling (production processes); Multiprocessor scheduling; Mathematical optimization; Dynamic priority scheduling; Operating system; Mathematics; Two-level scheduling; Schedule","score_opus":0.04219280169622666,"score_gpt":0.3170622354368769,"score_spread":0.2748694337406502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151705548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27016947,0.000050504535,0.72827196,0.00010091016,0.0003280281,0.00007632872,0.000008125392,0.000093197574,0.00090146647],"genre_scores_gemma":[0.5713699,0.000010028973,0.42835474,0.00021816492,0.000026574313,0.0000061701317,0.000009099043,0.000003894247,0.0000014492882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886656,0.000020411073,0.0003600434,0.00006652295,0.00035700554,0.00032945914],"domain_scores_gemma":[0.9995748,0.000049561444,0.00012619726,0.000099493904,0.00007362577,0.00007631802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091665547,0.00010612844,0.0001149761,0.00021966225,0.0002598811,0.000082417086,0.00018158049,0.00004469329,0.000023658256],"category_scores_gemma":[0.00003716801,0.00010129653,0.00003365358,0.0006087269,0.0000831227,0.0030937293,0.000025693756,0.00010729856,0.000012997784],"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":[4.7519433e-7,0.000006648139,0.004040444,0.000040933595,0.000006969318,1.0209658e-8,0.00051278557,0.9862814,0.0051146075,0.00003232596,0.00009646191,0.0038669615],"study_design_scores_gemma":[0.00015548385,0.0000070775204,0.00080080697,0.000024928097,0.000008679358,0.0000042987854,0.0003303708,0.99152374,0.0067800246,7.745739e-7,0.00023466263,0.00012914809],"about_ca_topic_score_codex":0.000017048178,"about_ca_topic_score_gemma":1.6610855e-7,"teacher_disagreement_score":0.3012004,"about_ca_system_score_codex":0.000079768826,"about_ca_system_score_gemma":0.00004074338,"threshold_uncertainty_score":0.41307524},"labels":[],"label_agreement":null},{"id":"W2152294486","doi":"10.1287/inte.1110.0590","title":"Kimberly-Clark Latin America Builds an Optimization-Based System for Machine Scheduling","year":2011,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kimberly-Clark (Canada)","funders":"","keywords":"Scheduling (production processes); Sizing; Operations research; Production planning; Single-machine scheduling; Computer science; Job shop scheduling; Mathematical optimization; Production (economics); Engineering; Operations management; Schedule; Economics; Mathematics; Microeconomics","score_opus":0.021953395711161623,"score_gpt":0.22904342655600082,"score_spread":0.2070900308448392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152294486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014718863,0.000040588737,0.98648703,0.000021539705,0.00039336475,0.00021183309,0.000023951225,0.00040822334,0.010941591],"genre_scores_gemma":[0.38558626,0.000026347527,0.6137227,0.0002553082,0.00022129033,0.000018075767,0.0000663797,0.00007226076,0.000031405696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998459,0.000009120633,0.0006803599,0.00016293034,0.00031216102,0.0003764516],"domain_scores_gemma":[0.9988907,0.000073003655,0.00023937553,0.00028239464,0.00019761431,0.0003168877],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031330768,0.000289678,0.00033632273,0.00035944264,0.00022665937,0.00015860217,0.00028817527,0.00016251166,0.00011484254],"category_scores_gemma":[0.000041421365,0.00024907733,0.00013873747,0.00042350232,0.000036447025,0.00019492058,0.00001091109,0.00042476898,0.00003259873],"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.00006543864,0.000042370593,0.000050856,0.00005256125,0.00008229453,0.0000041492717,0.00019156736,0.9925255,0.000012592193,0.0010629585,0.000032839052,0.005876851],"study_design_scores_gemma":[0.001107797,0.00014386949,0.000019350844,0.000059522714,0.00006845445,0.0000131674515,0.00039641192,0.9967645,0.0006722291,0.00006127881,0.0003624246,0.00033099725],"about_ca_topic_score_codex":0.0000033349538,"about_ca_topic_score_gemma":0.0000010297076,"teacher_disagreement_score":0.38411438,"about_ca_system_score_codex":0.0001700725,"about_ca_system_score_gemma":0.00007351601,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2152839609","doi":"10.1002/nav.21620","title":"Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems","year":2015,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Order (exchange); Business","score_opus":0.18232144162654743,"score_gpt":0.40719826499271466,"score_spread":0.22487682336616724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152839609","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013577415,0.015370276,0.9749825,0.00066110975,0.0010418887,0.0014234436,0.000094448296,0.0003749847,0.004693606],"genre_scores_gemma":[0.21403019,0.007998267,0.76884604,0.00028547365,0.0018990913,0.0016905906,0.0007614438,0.00028889018,0.004199994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761605,0.00013301003,0.00039017215,0.0003102007,0.00092069426,0.00062988984],"domain_scores_gemma":[0.9967021,0.00040629753,0.000033878685,0.00040046524,0.0019949598,0.00046234843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028478,0.0001921532,0.0003085724,0.00022162171,0.00016084236,0.00023949974,0.00039494399,0.00015565612,0.000023410621],"category_scores_gemma":[0.0052564465,0.00018351861,0.00005516279,0.0005966011,0.00008428256,0.00009668962,0.00008053158,0.0003765986,0.0004856692],"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.000029567997,0.000046975623,0.000021145175,0.0011190197,0.00004411484,0.0000072757607,0.0001734611,0.9573116,0.00009093413,0.0038351053,0.032719973,0.0046008546],"study_design_scores_gemma":[0.00045209916,0.00019924676,0.000017232709,0.00044853595,0.000024105739,0.000010844023,0.0002912094,0.9583502,0.00016598226,0.00013316442,0.039640646,0.00026676187],"about_ca_topic_score_codex":0.000062152896,"about_ca_topic_score_gemma":0.0000066624343,"teacher_disagreement_score":0.21267246,"about_ca_system_score_codex":0.0002950898,"about_ca_system_score_gemma":0.0003020895,"threshold_uncertainty_score":0.7483672},"labels":[],"label_agreement":null},{"id":"W2153168201","doi":"10.1109/icsmc.2007.4413614","title":"Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices","year":2007,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Integer programming; Computer science; Deadlock; Scheduling (production processes); Job shop scheduling; Heuristic; Mathematical optimization; Rank (graph theory); Blocking (statistics); Distributed computing; Mathematics; Algorithm; Schedule; Artificial intelligence","score_opus":0.015480939717817598,"score_gpt":0.24624170265538572,"score_spread":0.23076076293756811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153168201","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27826083,0.001067255,0.7183558,0.000026310425,0.0003371879,0.00010333796,7.054606e-7,0.00055766397,0.0012909685],"genre_scores_gemma":[0.33884355,0.000038930208,0.66084987,0.000024722098,0.00013483554,0.0000023375358,0.0000023383725,0.00003493578,0.00006849114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900234,0.000010143462,0.0002829331,0.00018877255,0.00016134515,0.00035446225],"domain_scores_gemma":[0.99948597,0.000087748995,0.00002863251,0.00019797709,0.00006783519,0.00013182471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043145457,0.00017427011,0.00016498307,0.00019333667,0.00010473697,0.00013008372,0.0001405184,0.00011635656,0.000044104716],"category_scores_gemma":[0.0000765236,0.00016556346,0.000041608815,0.00036395263,0.000032919856,0.0001811157,0.00005574144,0.00017730467,0.000009767176],"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.000036218476,0.00004698263,0.0112853795,0.0002757195,0.00018159872,0.000044666234,0.0010900103,0.8707568,0.0030690576,0.0014108906,0.000115897994,0.11168679],"study_design_scores_gemma":[0.00053956825,0.000011826756,0.0002372082,0.000057617737,0.00003072593,0.00003439256,0.0010797778,0.9933683,0.0040435554,0.00005485595,0.00025749556,0.0002846399],"about_ca_topic_score_codex":0.000026379012,"about_ca_topic_score_gemma":0.000025993466,"teacher_disagreement_score":0.122611545,"about_ca_system_score_codex":0.00004483828,"about_ca_system_score_gemma":0.000010979905,"threshold_uncertainty_score":0.6751482},"labels":[],"label_agreement":null},{"id":"W2154429979","doi":"10.1016/j.ejor.2003.08.027","title":"Executing production schedules in the face of uncertainties: A review and some future directions","year":2003,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":690,"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":"Computer science; Scheduling (production processes); Production (economics); Schedule; Operations research; Production schedule; Face (sociological concept); Work schedule; Work (physics); Management science; Operations management; Economics; Mathematics; Engineering; Microeconomics; Sociology","score_opus":0.09072389035271536,"score_gpt":0.37211004441088047,"score_spread":0.28138615405816514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154429979","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022304697,0.9980474,0.00022685515,0.0005193103,0.0002941191,0.00033793258,0.000006289124,0.0000068952168,0.00053889863],"genre_scores_gemma":[0.000026690925,0.9945705,0.0045959307,0.000027368209,0.00058607437,0.000008899541,0.000010412234,0.000034365006,0.00013976701],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965271,0.0018210093,0.0007924521,0.00013678997,0.000558699,0.00016396369],"domain_scores_gemma":[0.99890965,0.00022469071,0.00015601963,0.00016711296,0.0004912785,0.000051249095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068321363,0.00015593061,0.00053145154,0.00039863138,0.0001330426,0.00008559164,0.00028763738,0.000042332755,0.000027942671],"category_scores_gemma":[0.0008867825,0.00010070347,0.00011571782,0.000792205,0.00007898322,0.00018727548,0.000026529955,0.0011107952,0.000007914515],"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.0000062856043,0.000116146155,0.0000042336383,0.030630019,0.00030467604,0.000059957554,0.0015176028,0.020457987,0.0000030718063,0.0019913092,0.005610241,0.93929845],"study_design_scores_gemma":[0.00010589424,0.000057560024,0.000008926327,0.016204147,0.00010744865,0.0003193846,0.0006564101,0.00031836427,0.0000013005988,0.000012761096,0.98207706,0.00013073585],"about_ca_topic_score_codex":6.4499477e-7,"about_ca_topic_score_gemma":4.8648883e-7,"teacher_disagreement_score":0.97646683,"about_ca_system_score_codex":0.00007710333,"about_ca_system_score_gemma":0.00020917115,"threshold_uncertainty_score":0.4825914},"labels":[],"label_agreement":null},{"id":"W2155576477","doi":"10.1109/asmc.1990.111216","title":"Hub-centered production control of wafer fabrication","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control (management); Production (economics); Wafer; Production control; Process (computing); Computer science; Wafer fabrication; Process control; Photolithography; Fabrication; Flow control (data); Manufacturing engineering; Engineering; Artificial intelligence; Computer network; Electrical engineering; Programming language; Nanotechnology; Materials science","score_opus":0.015688184164135012,"score_gpt":0.1974765012769489,"score_spread":0.1817883171128139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155576477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03131685,0.00031427605,0.95470476,0.0003989971,0.0008229802,0.00017556443,0.000002533391,0.00048704137,0.011777],"genre_scores_gemma":[0.98433495,0.00004101605,0.014580273,0.000019960764,0.00007531986,0.0000053946746,0.0000031757404,0.000008478524,0.0009314136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997095,0.0000058243695,0.00010885971,0.000059456674,0.00005885766,0.00005748792],"domain_scores_gemma":[0.9998077,0.000006041184,0.000014173952,0.000096359916,0.000058068035,0.000017624669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000329629,0.0000410429,0.000055709173,0.000038932485,0.000011491108,0.0000052312043,0.000030895313,0.00002389969,0.00037549433],"category_scores_gemma":[0.000029041823,0.00003845642,0.000017013312,0.00009606947,0.0000072961325,0.000056045992,0.0000016515606,0.000028676066,0.000056557627],"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.0000065667687,0.00011564314,0.0014618471,0.00007147793,0.000050751452,2.8893768e-7,0.00047794046,0.9363478,0.008636915,0.00040669797,0.00741482,0.04500927],"study_design_scores_gemma":[0.00028274843,0.0000079429365,0.0004884293,0.000005587378,0.000006892473,0.0000010735705,0.000025508512,0.9869309,0.011806052,0.000011374346,0.00037869526,0.000054815322],"about_ca_topic_score_codex":0.0000015065383,"about_ca_topic_score_gemma":3.483681e-7,"teacher_disagreement_score":0.9530181,"about_ca_system_score_codex":0.000011748156,"about_ca_system_score_gemma":7.503621e-7,"threshold_uncertainty_score":0.41113994},"labels":[],"label_agreement":null},{"id":"W2156448584","doi":"10.1109/cscwd.2011.5960185","title":"Towards an agent oriented smart manufacturing system","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Visibility; Computer science; Automation; Supply chain; Agile software development; Manufacturing engineering; Engineering; Business; Software engineering","score_opus":0.021687272182721744,"score_gpt":0.21027444537335754,"score_spread":0.1885871731906358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156448584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21656467,0.00004147922,0.6146547,0.000005702138,0.0015168777,0.00011757274,0.000003136655,0.0027104418,0.16438541],"genre_scores_gemma":[0.8533423,0.000004269639,0.14622875,0.000019343694,0.000056638968,0.000008127646,0.000008168023,0.000024237195,0.00030815127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951535,0.000009370363,0.00012894817,0.000107988846,0.00008908178,0.00014928436],"domain_scores_gemma":[0.99968773,0.0000027156036,0.000009951355,0.00017773797,0.000019674158,0.00010220106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006964297,0.00009338786,0.000082937935,0.000053976317,0.0000352432,0.000017179584,0.000082400045,0.000046573456,0.00036305896],"category_scores_gemma":[0.0000024581761,0.00008321781,0.000026079748,0.00005511329,0.000006436979,0.00009549909,0.000012229545,0.00005954114,0.00013914058],"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.00010266956,0.0005309294,0.0040870733,0.0013524746,0.00083448493,0.00034020364,0.024245597,0.7128005,0.0010128887,0.05039463,0.0025419497,0.2017566],"study_design_scores_gemma":[0.000324206,0.00003661968,0.00243564,0.000028899134,0.000017548286,0.000018725268,0.0014412707,0.8987279,0.09545808,0.000016035581,0.0011988695,0.00029623133],"about_ca_topic_score_codex":0.000057728445,"about_ca_topic_score_gemma":0.0000058354294,"teacher_disagreement_score":0.63677764,"about_ca_system_score_codex":0.000045147608,"about_ca_system_score_gemma":0.0000050036015,"threshold_uncertainty_score":0.3975241},"labels":[],"label_agreement":null},{"id":"W2157120658","doi":"10.1016/j.ejor.2003.06.050","title":"A -approximation algorithm for the two-machine routing open-shop problem on a two-node network","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":39,"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; The Scarborough Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Russian Foundation for Basic Research","keywords":"Routing (electronic design automation); Interval (graph theory); Computer science; Node (physics); Job shop scheduling; Mathematical optimization; Approximation algorithm; Upper and lower bounds; Value (mathematics); Open shop; Mathematics; Algorithm; Flow shop scheduling; Combinatorics; Computer network","score_opus":0.06340619909870253,"score_gpt":0.34675181512074565,"score_spread":0.2833456160220431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157120658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011317444,0.0004085529,0.98620325,0.0025494874,0.0003295156,0.00057990005,0.00001238224,0.000034236054,0.008750943],"genre_scores_gemma":[0.227456,0.00009178051,0.7697457,0.00025618938,0.0019661733,0.000022351658,0.00002958871,0.000083554696,0.00034865315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979737,0.0003549558,0.0004748061,0.00014895292,0.00071104703,0.00033655323],"domain_scores_gemma":[0.99842304,0.0004726637,0.00008870166,0.00017358073,0.0007238567,0.000118157506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072973245,0.00013370214,0.0001567982,0.00013746873,0.00057031197,0.0006117075,0.0006553608,0.000018550343,0.000052045954],"category_scores_gemma":[0.0003232224,0.00009356579,0.00007403139,0.00041435316,0.00004358996,0.00031856415,0.000094704235,0.00065355113,0.00005041831],"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.00003799057,0.000041547035,0.000009074735,0.0000057090565,0.000054993063,0.00001538705,0.0002513323,0.9589522,0.00009493474,0.005236308,0.0009432919,0.03435725],"study_design_scores_gemma":[0.002822858,0.00025156076,0.00009519796,0.00016937015,0.0000100079815,0.00006871662,0.00012255817,0.99299926,0.00030157046,0.0004943942,0.002543914,0.00012061934],"about_ca_topic_score_codex":0.000005855614,"about_ca_topic_score_gemma":0.0000034293143,"teacher_disagreement_score":0.22632426,"about_ca_system_score_codex":0.00015785819,"about_ca_system_score_gemma":0.000175421,"threshold_uncertainty_score":0.5898709},"labels":[],"label_agreement":null},{"id":"W2157541676","doi":"10.1287/ijoc.1100.0446","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Mathematical optimization; Computer science; Metaheuristic; Branch and bound; Scheduling (production processes); Benchmark (surveying); Constraint logic programming; Mathematics; Stochastic programming","score_opus":0.03676578007654528,"score_gpt":0.25975812623899247,"score_spread":0.22299234616244717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157541676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030387526,0.000026128815,0.9154805,0.000049740214,0.0004989668,0.00042202143,0.00000110386,0.00025917092,0.052874837],"genre_scores_gemma":[0.42249113,0.0000022151894,0.577063,0.00019522356,0.00020822157,0.0000040982013,0.000002273778,0.000021656258,0.000012161319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885225,0.000020659698,0.00041961262,0.00012412066,0.0002160681,0.00036727087],"domain_scores_gemma":[0.99933803,0.000027152822,0.00009561041,0.00019738107,0.00010625429,0.00023559642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089148,0.00016955035,0.00015992233,0.000112124166,0.00032436926,0.00066487293,0.00074048416,0.0000592286,0.000026369702],"category_scores_gemma":[0.000026036463,0.000110381705,0.000052639556,0.0002643105,0.00002797467,0.00036602718,0.00008633157,0.0005291282,0.000036224494],"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.0000116482015,0.000041333304,0.0000517261,0.000006647801,0.000027166454,0.0000043427963,0.003954827,0.7766873,0.0000026382563,0.0007648505,0.00007162135,0.21837589],"study_design_scores_gemma":[0.00038327952,0.00019745681,0.00012808375,0.00007942989,0.000007832269,0.00036816293,0.0022322899,0.9931008,0.00018095813,0.00002912668,0.0030600177,0.00023252808],"about_ca_topic_score_codex":0.000003651773,"about_ca_topic_score_gemma":4.6474713e-7,"teacher_disagreement_score":0.3921036,"about_ca_system_score_codex":0.000056407487,"about_ca_system_score_gemma":0.000042664786,"threshold_uncertainty_score":0.6411385},"labels":[],"label_agreement":null},{"id":"W2159107566","doi":"10.5555/1516744.1517070","title":"Clarifying CONWIP versus push system behavior using simulation","year":2008,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workload; Computer science; Throughput; Real-time computing; Discrete event simulation; Control system; Simulation; Reliability engineering; Engineering; Operating system","score_opus":0.11107614759418377,"score_gpt":0.3043242369969059,"score_spread":0.19324808940272215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159107566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3372285,0.0000351155,0.6598052,0.0000041964213,0.0011485632,0.00016394773,0.0000061450405,0.0005632582,0.0010450972],"genre_scores_gemma":[0.9839272,0.0000033635597,0.01574449,0.000013293548,0.00016612765,0.000010186925,0.000030458586,0.000036745616,0.00006811951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989873,0.000035205245,0.00033897065,0.00021464251,0.00021573885,0.00020812865],"domain_scores_gemma":[0.9992423,0.00014795663,0.000065968474,0.00022164828,0.00023745076,0.00008468988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000078677585,0.00018869368,0.00018601313,0.000103561324,0.00016141089,0.000072945324,0.00011681492,0.00014949605,0.00012281029],"category_scores_gemma":[0.00004526769,0.00020577379,0.00006195308,0.00018543922,0.000036576377,0.0003187699,0.000021597227,0.00017801017,0.00008492621],"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.000020596091,0.00000940668,0.0013782664,0.00002193062,0.000016812099,0.000007843809,0.00038338313,0.9969397,0.00013533514,0.00008729695,0.000003984938,0.0009954297],"study_design_scores_gemma":[0.0007918827,0.0000176385,0.0010696247,0.000059798163,0.000033624776,0.0000072003645,0.00013783303,0.9972322,0.00029559623,0.0000020970801,0.00012691822,0.00022561353],"about_ca_topic_score_codex":0.0000058579367,"about_ca_topic_score_gemma":0.000002163015,"teacher_disagreement_score":0.6466987,"about_ca_system_score_codex":0.00014839892,"about_ca_system_score_gemma":0.000033283883,"threshold_uncertainty_score":0.83912116},"labels":[],"label_agreement":null},{"id":"W2159636504","doi":"10.1504/ijmr.2012.048697","title":"Task scheduling and management using genetic algorithms with application in production process optimisation","year":2012,"lang":"en","type":"article","venue":"International Journal of Manufacturing Research","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":"University of British Columbia","funders":"British Columbia Knowledge Development Fund; Canada Research Chairs","keywords":"Unavailability; Scheduling (production processes); Computer science; Genetic algorithm scheduling; Unexpected events; Genetic algorithm; Task (project management); Schedule; Distributed computing; Dynamic priority scheduling; Two-level scheduling; Industrial engineering; Operations research; Reliability engineering; Engineering; Operations management; Machine learning; Systems engineering; Operating system","score_opus":0.03284677024170914,"score_gpt":0.3295975687090703,"score_spread":0.2967507984673612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159636504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8845642,0.00034002753,0.11436968,0.00011778853,0.00032914925,0.00016532863,5.94435e-7,0.000021268195,0.000091917274],"genre_scores_gemma":[0.8592279,0.00031784258,0.13999577,0.0000046174728,0.00041045778,0.000011221335,0.0000022257527,0.00001956334,0.000010424029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862176,0.00003962826,0.0002893615,0.00011612041,0.0007064435,0.00022667318],"domain_scores_gemma":[0.99943656,0.000036095083,0.000079870646,0.000081228856,0.00028368848,0.0000825585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008752124,0.000093034374,0.00009891778,0.00065367616,0.000051377276,0.00007733747,0.00018031351,0.000044990767,0.0000055111564],"category_scores_gemma":[0.000029510851,0.00008384477,0.000016759337,0.00016415476,0.00003925492,0.00043953385,0.00003045996,0.0003081994,0.000002576949],"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.000040821316,0.000048222963,0.0041424767,0.000063027794,0.00006406236,0.000011354302,0.0005630897,0.95858616,0.0003460767,0.000012481546,0.0000028066627,0.0361194],"study_design_scores_gemma":[0.0016206459,0.00008451228,0.06364058,0.0006612297,0.000037219994,0.000767771,0.0020310667,0.8506883,0.07943938,0.0004067651,0.0002479098,0.00037461266],"about_ca_topic_score_codex":0.00000984598,"about_ca_topic_score_gemma":0.000001931726,"teacher_disagreement_score":0.10789787,"about_ca_system_score_codex":0.00023059486,"about_ca_system_score_gemma":0.000019816101,"threshold_uncertainty_score":0.34190902},"labels":[],"label_agreement":null},{"id":"W2159737632","doi":"10.1111/j.1937-5956.2005.tb00019.x","title":"Setup Time Reduction for Electronics Assembly: Combining Simple (SMED) and IT‐Based Methods","year":2005,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sheridan College","funders":"Alfred P. Sloan Foundation; University of California, San Diego; National Science Foundation","keywords":"Key (lock); Computer science; Printed circuit board; Electronics; Reduction (mathematics); Simple (philosophy); Process (computing); Manufacturing engineering; Reliability engineering; Embedded system; Electrical engineering; Mathematics; Engineering; Computer security; Operating system","score_opus":0.015308183917479047,"score_gpt":0.29372145966722957,"score_spread":0.2784132757497505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159737632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041135,0.00057943707,0.9811129,0.005677414,0.0004263767,0.00077057,0.0000038955795,0.0003895505,0.0009987205],"genre_scores_gemma":[0.10010696,0.0005207677,0.89629865,0.00018004757,0.0002808523,0.0002079065,0.00010340757,0.00003202919,0.002269366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936056,0.000030625662,0.00017326887,0.00022479522,0.00006679058,0.00014393317],"domain_scores_gemma":[0.9997396,0.000013000079,0.000015823098,0.00013029121,0.000057802194,0.000043501008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035601656,0.000106496394,0.00009548473,0.00012731423,0.0002584036,0.00011419518,0.0000329553,0.000035517125,0.000027964921],"category_scores_gemma":[0.000033629403,0.00011447284,0.000018219787,0.00015837737,0.000018397359,0.00020866621,0.000013126679,0.00006744575,0.000006765998],"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.0000066626985,0.000042265016,0.0000028870859,0.00005740368,0.000052705338,6.7714225e-8,0.0002089691,0.88272184,0.0014865946,0.0017691142,0.0036193694,0.11003212],"study_design_scores_gemma":[0.00030120058,0.000031187014,0.000017006276,0.00001037101,0.000048995735,0.0000044570993,0.00019794324,0.9586123,0.00846695,0.00006539849,0.032105125,0.00013902763],"about_ca_topic_score_codex":0.0000010246973,"about_ca_topic_score_gemma":0.000004950487,"teacher_disagreement_score":0.10989309,"about_ca_system_score_codex":0.000052839587,"about_ca_system_score_gemma":0.000006797847,"threshold_uncertainty_score":0.46680668},"labels":[],"label_agreement":null},{"id":"W2160682719","doi":"10.1080/09511920903440339","title":"Optimal resource allocation for hybrid flow shop in one-of-a-kind production","year":2010,"lang":"en","type":"article","venue":"International Journal of Computer Integrated Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pruning; Production (economics); Resource (disambiguation); Operations research; Computer science; Interval (graph theory); Resource allocation; Plan (archaeology); Industrial engineering; Mathematical optimization; Engineering; Mathematics; Economics; Geography","score_opus":0.012001733732084293,"score_gpt":0.23297712806946924,"score_spread":0.22097539433738494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160682719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5699459,0.000016018126,0.426952,0.00021939243,0.002702719,0.000082418046,0.0000055525743,0.000030989802,0.000045053665],"genre_scores_gemma":[0.6754139,0.000011299279,0.32369822,0.000021943844,0.00079023914,0.000003576467,0.000024463292,0.000018895988,0.000017451328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988743,0.000017173332,0.0005748856,0.00011900528,0.0002876766,0.0001269509],"domain_scores_gemma":[0.99915594,0.00007505107,0.00019411834,0.000099070625,0.0004272149,0.000048604317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034065262,0.00012894733,0.00018979084,0.00047345084,0.000022302947,0.00008384315,0.00033763598,0.00006706474,0.000030277875],"category_scores_gemma":[0.00006904727,0.00012522738,0.000089561545,0.00007137595,0.000028796007,0.00026202487,0.000021222952,0.00042148412,0.0000017428938],"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.000078024306,0.000053946183,0.00007169766,0.000016386455,0.00010203741,0.0000065277072,0.0003033205,0.94416326,0.0032385304,0.000025641213,0.0002983074,0.051642336],"study_design_scores_gemma":[0.0005612861,0.000046293546,0.0005429646,0.00017209347,0.000010915897,0.00010150241,0.000048141785,0.67719,0.31921357,0.000094885916,0.0019059024,0.00011244555],"about_ca_topic_score_codex":0.000004497815,"about_ca_topic_score_gemma":0.000010824179,"teacher_disagreement_score":0.31597504,"about_ca_system_score_codex":0.00008317896,"about_ca_system_score_gemma":0.000046834433,"threshold_uncertainty_score":0.51066244},"labels":[],"label_agreement":null},{"id":"W2161003186","doi":"10.1109/acc.2001.945916","title":"Optimal production scheduling for manufacturing systems with preventive maintenance in an uncertain environment","year":2001,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Preventive maintenance; Scheduling (production processes); Computer science; Workstation; Parameterized complexity; Mathematical optimization; Discrete manufacturing; Job shop scheduling; Poisson process; Production (economics); Reliability engineering; Quadratic equation; Schedule; Poisson distribution; Engineering; Mathematics; Algorithm","score_opus":0.012727082809809278,"score_gpt":0.218786121220545,"score_spread":0.20605903841073572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161003186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43781134,0.00006845334,0.56123656,0.000036860085,0.00015598231,0.00039801438,0.0000013133607,0.00014747186,0.00014399366],"genre_scores_gemma":[0.67662895,0.00005244492,0.3223474,0.0000057533375,0.000106806096,0.0001501572,0.000015616217,0.000030560674,0.0006622926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999241,0.000014839271,0.00017340151,0.00023307414,0.000099948076,0.00023776054],"domain_scores_gemma":[0.99974275,0.000014195398,0.000026247637,0.00014820503,0.000017456901,0.000051134106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016956673,0.00012974271,0.0001227026,0.00007847054,0.000044241096,0.000041139672,0.000067850946,0.000046934292,0.000016728573],"category_scores_gemma":[0.0000074929594,0.00011143878,0.000018428615,0.0000693288,0.000014793669,0.00021802766,0.0000067517835,0.000086716565,0.000005726488],"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.000030886604,0.000026007514,0.0003650936,0.000033575147,0.000012816241,0.0000033983558,0.00016871963,0.9979531,0.00010488414,0.000032117092,0.0000059047006,0.0012634976],"study_design_scores_gemma":[0.00045035756,0.00006571192,0.00035113384,0.00007961732,0.000007501332,0.000017759578,0.0010757742,0.9933567,0.0041955262,0.0000087702165,0.00020713314,0.00018402231],"about_ca_topic_score_codex":0.000013480032,"about_ca_topic_score_gemma":0.000009984221,"teacher_disagreement_score":0.23888916,"about_ca_system_score_codex":0.00013131252,"about_ca_system_score_gemma":0.000007307258,"threshold_uncertainty_score":0.45443416},"labels":[],"label_agreement":null},{"id":"W2161358529","doi":"10.1109/tsmcc.2004.843224","title":"iShopFloor : An Internet-Enabled Agent-Based Intelligent Shop Floor","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Distributed manufacturing; Architecture; The Internet; Intelligent agent; Scheduling (production processes); Job shop; Multi-agent system; Markup language; Software engineering; Distributed computing; Manufacturing engineering; World Wide Web; Job shop scheduling; XML; Engineering; Flow shop scheduling; Embedded system; Artificial intelligence","score_opus":0.02305979237163171,"score_gpt":0.2490010170002898,"score_spread":0.22594122462865807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161358529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044969264,0.010646202,0.982331,0.00012814747,0.00035704774,0.0010163466,0.000030934196,0.0002670699,0.0007263591],"genre_scores_gemma":[0.9486717,0.02440194,0.018768722,0.00034856674,0.00041410062,0.0018350156,0.00005088218,0.000105730585,0.005403349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998699,0.00006488996,0.0005437457,0.00033985512,0.00013062595,0.00022189436],"domain_scores_gemma":[0.9992053,0.00002974078,0.00006745094,0.0003882947,0.000061043305,0.0002481694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024482096,0.00026013667,0.00033001206,0.00013656473,0.00015884289,0.00015569614,0.00012966731,0.00012081764,0.00010914987],"category_scores_gemma":[0.000001634092,0.00023281871,0.00007676376,0.00022104797,0.00006401952,0.00009537345,0.0000015458717,0.00020219394,0.00019066139],"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.00001234163,0.00033622616,0.000013073106,0.00056253775,0.00009808343,0.0000011288383,0.0004717101,0.38472196,0.00016977577,0.0005269828,0.0011066463,0.61197954],"study_design_scores_gemma":[0.0003117732,0.000056482593,0.000007661774,0.0001793883,0.000091504306,0.000015052819,0.00013527404,0.6362661,0.0014015313,0.000005014065,0.3612292,0.0003009654],"about_ca_topic_score_codex":0.00001607803,"about_ca_topic_score_gemma":0.000034214132,"teacher_disagreement_score":0.96356225,"about_ca_system_score_codex":0.00004666138,"about_ca_system_score_gemma":0.000013536967,"threshold_uncertainty_score":0.9494071},"labels":[],"label_agreement":null},{"id":"W2161966861","doi":"10.1109/icsmc.1995.537890","title":"A generic mediator for multi-agent coordination in a distributed manufacturing system","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Distributed manufacturing; Task (project management); Intelligent agent; Multi-agent system; Concurrent engineering; Systems engineering; Engineering; Artificial intelligence; Manufacturing engineering","score_opus":0.02887283770791757,"score_gpt":0.2233807811431821,"score_spread":0.19450794343526454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161966861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045325987,0.00015211888,0.9532253,0.000055360364,0.00035694093,0.00023631466,0.000022610166,0.0004763133,0.00014906512],"genre_scores_gemma":[0.86679846,0.000008959506,0.13278864,0.000010653963,0.000056826128,0.00010308708,0.000045703688,0.00002048721,0.00016715923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995072,0.00000740929,0.00016783473,0.00010188996,0.0000658111,0.00014988417],"domain_scores_gemma":[0.9998163,0.000023150738,0.00001560859,0.000078114026,0.000019377298,0.000047430178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006474005,0.0000847548,0.000098411045,0.00008203547,0.000026247872,0.00002260589,0.00005373114,0.000052464275,0.00004621594],"category_scores_gemma":[0.000017786939,0.00008227826,0.000028904466,0.00010737729,0.0000037177347,0.00005349654,0.0000062167587,0.000043083546,0.000028851124],"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.0000024714575,0.000045667148,0.000270585,0.00019778051,0.000024766801,0.000004958865,0.00027144526,0.9899508,0.00016997209,0.00014154948,0.0012703233,0.0076497155],"study_design_scores_gemma":[0.0006760677,0.000005475356,0.0002691365,0.000015035956,0.000004726949,0.0000019999136,0.00017361753,0.9932598,0.005086531,0.0000010350491,0.00040318293,0.00010339992],"about_ca_topic_score_codex":0.000005140404,"about_ca_topic_score_gemma":0.00000894524,"teacher_disagreement_score":0.8214725,"about_ca_system_score_codex":0.00014106809,"about_ca_system_score_gemma":0.0000019197491,"threshold_uncertainty_score":0.335521},"labels":[],"label_agreement":null},{"id":"W2162009963","doi":"10.1287/ijoc.1070.0225","title":"Time-Indexed Formulations and the Total Weighted Tardiness Problem","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":true,"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","funders":"","keywords":"Tardiness; Column generation; Mathematical optimization; Mathematics; Integer programming; Time horizon; Computer science; Job shop scheduling","score_opus":0.006188593073335101,"score_gpt":0.21915751475273254,"score_spread":0.21296892167939743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162009963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4344585,0.00009487849,0.5537718,0.00015458741,0.000514162,0.00015409474,8.2231196e-7,0.00021805211,0.010633109],"genre_scores_gemma":[0.94080144,0.0000096013255,0.058544327,0.00010586466,0.0003993872,5.796459e-7,0.0000031139625,0.000018727946,0.000116965566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991681,0.000007974989,0.00036535092,0.00005400668,0.00018146505,0.00022313389],"domain_scores_gemma":[0.9994595,0.00020747603,0.00008418704,0.00007373998,0.000087199944,0.000087915934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080998306,0.00011066145,0.00013381797,0.00012281869,0.0003232655,0.00015113749,0.00008616981,0.000053216405,0.000018455527],"category_scores_gemma":[0.00003597736,0.00006823987,0.000053615062,0.00020777316,0.00003860084,0.00017905248,0.000023228307,0.00034570307,0.000022713755],"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.00003046993,0.0000056347226,0.00008783096,0.00000718235,0.000044473407,0.0000048571505,0.0009563248,0.94076604,0.000012634807,0.0009148653,0.00006650739,0.057103198],"study_design_scores_gemma":[0.001243057,0.000018813382,0.00094882445,0.000051445622,0.00000841316,0.0002711848,0.00010018361,0.9966177,0.00009443199,0.00033252596,0.00020409413,0.000109377776],"about_ca_topic_score_codex":9.201767e-7,"about_ca_topic_score_gemma":2.3395104e-7,"teacher_disagreement_score":0.50634295,"about_ca_system_score_codex":0.000041337717,"about_ca_system_score_gemma":0.000013016811,"threshold_uncertainty_score":0.27827412},"labels":[],"label_agreement":null},{"id":"W2162193020","doi":"10.1109/ipdps.2001.925215","title":"On preemption redundancy in scheduling unit processing time jobs on two parallel machines","year":2005,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Conjecture; Counterexample; Redundancy (engineering); Parallel computing; Processor scheduling; Schedule; Algorithm; Combinatorics; Mathematics; Mathematical optimization; Operating system","score_opus":0.013010728780114118,"score_gpt":0.25574638541262884,"score_spread":0.24273565663251473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162193020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8072394,0.00041177863,0.13914333,0.0006861815,0.00026608564,0.0003364946,0.0000031229888,0.0016357274,0.050277855],"genre_scores_gemma":[0.76194113,0.000023265622,0.23595421,0.00020053404,0.00021466296,0.000017587676,0.000021778354,0.000049645794,0.0015771488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991511,0.00002129724,0.00024022853,0.00019594526,0.00016367182,0.00022771997],"domain_scores_gemma":[0.99969,0.000041727086,0.000027497885,0.00014969124,0.000029292585,0.00006177304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014560472,0.00017255105,0.00014065435,0.00020784022,0.000062932006,0.00006891605,0.00010120951,0.00007567959,0.00029023032],"category_scores_gemma":[0.00004090353,0.00016222891,0.00003087913,0.0002761233,0.000012223458,0.00018681103,0.000009975791,0.00023729257,0.0004858636],"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.000015697507,0.000042590906,0.00026255092,0.000015745849,0.000004803737,0.0000014392265,0.00013420377,0.9601137,0.00014323089,0.0004188258,0.00003729811,0.038809925],"study_design_scores_gemma":[0.00070911116,0.000029513636,0.00069700135,0.00014621043,0.00000385413,0.0000025217694,0.000016914963,0.9973342,0.00056756684,0.00018239494,0.00010950421,0.00020120318],"about_ca_topic_score_codex":0.000008907127,"about_ca_topic_score_gemma":0.000022221788,"teacher_disagreement_score":0.09681088,"about_ca_system_score_codex":0.00006860054,"about_ca_system_score_gemma":0.000015185756,"threshold_uncertainty_score":0.66155034},"labels":[],"label_agreement":null},{"id":"W2162870855","doi":"10.1287/moor.26.1.31.10590","title":"A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"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; Multiprocessor scheduling; Preemption; Time complexity; Multiprocessing; Algorithm; Scheduling (production processes); Job shop scheduling; Parallel computing; Schedule; Mathematics; Flow shop scheduling; Mathematical optimization; Operating system","score_opus":0.05539017173752653,"score_gpt":0.354648109459684,"score_spread":0.2992579377221575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162870855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109894656,0.00013720842,0.88778114,0.000119625416,0.00006144333,0.0005921587,0.000025685038,0.0001290987,0.0012589967],"genre_scores_gemma":[0.1330945,0.00005306656,0.86578757,0.0000053429444,0.00013123547,0.00021309161,0.00001823664,0.000051484436,0.0006454467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.000022610195,0.00032015995,0.00016160744,0.00039043196,0.00032729335],"domain_scores_gemma":[0.9986746,0.000245603,0.000015374066,0.000268872,0.0007061792,0.000089370704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066632306,0.00012745557,0.00020343732,0.0002841425,0.0002484074,0.00012539636,0.00022539118,0.00006417224,0.00005859129],"category_scores_gemma":[0.0002448661,0.00011044224,0.00004217987,0.0005410277,0.00008896628,0.0001733396,0.000028027323,0.00021664776,0.00002414208],"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.0000099880335,0.00013113096,0.000024174191,0.0001450771,0.00006244472,0.0000023079258,0.0013158052,0.98314,0.001445011,0.0004008238,0.00015408144,0.013169135],"study_design_scores_gemma":[0.00093607715,0.0000753096,0.0000045040388,0.000077957084,0.000010619021,0.00001415133,0.0009978919,0.9919132,0.005615949,0.000039825936,0.00018156512,0.000132975],"about_ca_topic_score_codex":0.000019346775,"about_ca_topic_score_gemma":0.00004948974,"teacher_disagreement_score":0.02319985,"about_ca_system_score_codex":0.00004870325,"about_ca_system_score_gemma":0.000093479786,"threshold_uncertainty_score":0.4503704},"labels":[],"label_agreement":null},{"id":"W2163928079","doi":"10.1109/ipps.1999.760426","title":"The characterization of data-accumulating algorithms","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computer science; Algorithm; Parallelism (grammar); Computation; Class (philosophy); Geodetic datum; Parallel algorithm; Parallel computing; Characterization (materials science); Unitary state; Artificial intelligence","score_opus":0.04020316304903815,"score_gpt":0.2698056974153192,"score_spread":0.22960253436628103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163928079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023592422,0.000091265916,0.9669095,0.000035403384,0.0004760441,0.00008996822,0.000013585137,0.00023515224,0.00855661],"genre_scores_gemma":[0.591141,0.00019358328,0.40744323,0.000046183,0.000103764,0.0000073041597,0.00018798534,0.000044340304,0.0008326201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995718,0.00001607269,0.00016530474,0.000073182506,0.00008278123,0.00009082887],"domain_scores_gemma":[0.99957895,0.00005032985,0.00002492158,0.00029095766,0.000034285615,0.000020525446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020884382,0.000053217136,0.000059253012,0.0000179194,0.00006025875,0.000027535756,0.0001399752,0.000025768808,0.000059330036],"category_scores_gemma":[0.00005775854,0.000038165686,0.000011536851,0.00013710433,0.000013592234,0.00014285174,0.000013888329,0.000042879048,0.000010013767],"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.0000077063605,0.00007435648,0.0018951877,0.000103776714,0.0002678353,0.0000024692617,0.00086682016,0.4319688,0.059250355,0.025635436,0.00052801246,0.47939923],"study_design_scores_gemma":[0.000084692234,0.0000030561475,0.0002483893,0.0000036959455,0.0000044888607,0.0000013694593,0.000055296434,0.986688,0.008942719,0.000027916098,0.0038816992,0.000058664307],"about_ca_topic_score_codex":0.0000013146049,"about_ca_topic_score_gemma":7.7785813e-7,"teacher_disagreement_score":0.5675486,"about_ca_system_score_codex":0.0000057025927,"about_ca_system_score_gemma":0.0000074712343,"threshold_uncertainty_score":0.15563515},"labels":[],"label_agreement":null},{"id":"W2163947109","doi":"10.5267/j.ijiec.2010.01.007","title":"A robust multi-objective production planning","year":2010,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production planning; Production (economics); Computer science; Environmental science; Mathematical optimization; Economics; Mathematics; Microeconomics","score_opus":0.039483052832837116,"score_gpt":0.2661522685904813,"score_spread":0.22666921575764418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163947109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25151077,0.000049027243,0.7291127,0.00023248118,0.018739786,0.00007762369,0.000007409887,0.00018233899,0.00008786699],"genre_scores_gemma":[0.8153693,0.0000063215234,0.18209815,0.000010329996,0.0024585694,0.0000032884764,0.000009750898,0.000027912569,0.000016386386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991213,0.000009456488,0.0003928165,0.00008414987,0.0002767671,0.00011551392],"domain_scores_gemma":[0.99915314,0.00008828353,0.0001122876,0.0000648469,0.00049857015,0.00008284813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021170675,0.000117144045,0.00013231147,0.0004195832,0.000036741036,0.00008560407,0.00022776876,0.00010688479,0.000022238673],"category_scores_gemma":[0.00045002752,0.00012262064,0.000075791046,0.00021634996,0.000016844753,0.0002682877,0.000015385089,0.00070397055,0.0000060398415],"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.0000077724935,0.000028032951,0.0002502091,0.000001734528,0.00012982605,0.0000144430605,0.00021612097,0.9941573,0.0017692046,0.00009731042,0.00030116076,0.0030268498],"study_design_scores_gemma":[0.00084614777,0.000022451532,0.0006471872,0.000089897316,0.00001908874,0.00023973768,0.00012105098,0.99479216,0.0024335177,0.000015320631,0.0006293649,0.00014406047],"about_ca_topic_score_codex":0.0000025704294,"about_ca_topic_score_gemma":9.942263e-7,"teacher_disagreement_score":0.5638585,"about_ca_system_score_codex":0.00007429345,"about_ca_system_score_gemma":0.00006144043,"threshold_uncertainty_score":0.5000324},"labels":[],"label_agreement":null},{"id":"W2167498917","doi":"10.1109/coase.2008.4626414","title":"An adaptive and optimal setup planning system","year":2008,"lang":"en","type":"article","venue":"","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":"University of British Columbia; Western University; National Research Council Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Architecture; Production planning; Adaptive strategies; Job shop scheduling; Industrial engineering; Engineering; Embedded system; Operations management; Production (economics)","score_opus":0.018001830068883708,"score_gpt":0.21798590072325982,"score_spread":0.19998407065437612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167498917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4053586,0.00024801027,0.58306545,0.0000048392667,0.00015007007,0.000050030318,0.000002902731,0.0009918945,0.010128221],"genre_scores_gemma":[0.7948884,0.000006475628,0.20494696,0.000009904494,0.000049249455,0.0000027182257,0.00000360914,0.000011990431,0.00008070544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996918,0.0000065587737,0.000071510185,0.000081373946,0.000054436765,0.00009432622],"domain_scores_gemma":[0.99983037,0.000011492395,0.0000061294922,0.00006957074,0.00001504028,0.00006740319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003331464,0.000064956585,0.0000698225,0.00003591146,0.00006298371,0.000014181631,0.000034242956,0.00003716355,0.0000148192985],"category_scores_gemma":[0.0000018679768,0.000061011608,0.000007153201,0.00005486134,0.00001414084,0.000097903256,0.0000050251874,0.000052906784,0.000013030587],"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.0000033879833,0.0000029147643,0.0003043145,0.000008048501,0.000010153103,0.000018618593,0.0005646224,0.998363,0.00004955517,0.00028271572,0.00011703051,0.00027563417],"study_design_scores_gemma":[0.00012744778,0.000034821132,0.00051636365,0.0000117746495,0.0000028877819,0.00008015956,0.0009804617,0.9977366,0.00038389937,5.898284e-7,0.00003711198,0.00008791831],"about_ca_topic_score_codex":0.0000050512303,"about_ca_topic_score_gemma":1.8866697e-7,"teacher_disagreement_score":0.38952976,"about_ca_system_score_codex":0.000014482659,"about_ca_system_score_gemma":0.000004363969,"threshold_uncertainty_score":0.24879812},"labels":[],"label_agreement":null},{"id":"W2168480783","doi":"10.1007/978-3-540-31996-2_18","title":"The Use of Meta-heuristics to Solve Economic Lot Scheduling Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Tabu search; Simulated annealing; Heuristics; Mathematical optimization; Computer science; Scheduling (production processes); Job shop scheduling; Mathematics; Schedule","score_opus":0.03834756714255014,"score_gpt":0.23679867176615116,"score_spread":0.19845110462360102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168480783","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006345891,0.0006637075,0.9974234,0.0001945245,0.00093334494,0.00023488706,0.000012571679,0.000101290694,0.0003728012],"genre_scores_gemma":[0.0045550927,0.0001252448,0.9945399,0.00022704543,0.0003579298,0.000007361123,0.0000030672998,0.000046702116,0.00013764812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985473,0.00000645821,0.0004467225,0.00041369992,0.00026612004,0.00031966268],"domain_scores_gemma":[0.99866384,0.00049905234,0.000102829385,0.0005274828,0.00010944149,0.00009734019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038274354,0.0002982937,0.00038749137,0.00026777768,0.00011823651,0.0002479031,0.0006821924,0.00016577455,0.000023354196],"category_scores_gemma":[0.0000734793,0.00022787157,0.00011544104,0.00014593711,0.00021461994,0.00013061664,0.00017302202,0.00042922894,0.00003148443],"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.0000015339201,0.000002191216,0.0000012868516,0.000012389102,0.00005027238,0.0000013642403,0.00014255819,0.9176164,0.000007120662,0.0011634905,0.0000125802535,0.0809888],"study_design_scores_gemma":[0.00006208843,0.000026060517,0.0000025524591,0.00007068689,0.000052655912,0.0000056427825,1.3465345e-7,0.9930309,0.00053954683,0.0020272722,0.003925268,0.0002571651],"about_ca_topic_score_codex":0.000007930396,"about_ca_topic_score_gemma":0.00007241858,"teacher_disagreement_score":0.08073164,"about_ca_system_score_codex":0.00016847962,"about_ca_system_score_gemma":0.00012623286,"threshold_uncertainty_score":0.92923325},"labels":[],"label_agreement":null},{"id":"W2168514560","doi":"10.5267/j.uscm.2013.10.006","title":"A state of art review on optimization techniques in just in time","year":2013,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"State (computer science); Computer science; Algorithm","score_opus":0.009535127507824584,"score_gpt":0.23130204990969985,"score_spread":0.22176692240187526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168514560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017697081,0.01170614,0.7484077,0.012097499,0.00093156146,0.022941995,0.000080170386,0.0034524552,0.18268535],"genre_scores_gemma":[0.08503606,0.05345739,0.8429424,0.0040753055,0.00008729772,0.0026282684,0.00054910046,0.00023376747,0.010990412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.00004527513,0.00038687183,0.0001706417,0.00019886366,0.00019915287],"domain_scores_gemma":[0.99963814,0.00002951077,0.000043757344,0.00022465581,0.000030533116,0.000033413144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036690367,0.00014479354,0.00022220107,0.00036682456,0.000009631946,0.00001926256,0.00016338639,0.00003451694,0.0004919137],"category_scores_gemma":[0.000017728275,0.00014459422,0.000030633044,0.0005388531,0.000015185047,0.00008310437,0.00003211505,0.00009878492,0.00011663278],"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.0000031184481,0.0000474868,0.00012550541,0.00058068655,0.000010717155,0.000006088423,0.000082044535,0.9767636,0.000007682172,0.000054180255,0.004797133,0.017521745],"study_design_scores_gemma":[0.00032987577,0.00003544743,0.00027520568,0.0021371294,0.000007968303,3.7693286e-7,0.000050106668,0.9950203,0.00023620593,0.00010360897,0.0016058981,0.00019790378],"about_ca_topic_score_codex":0.000027376815,"about_ca_topic_score_gemma":0.0000053485705,"teacher_disagreement_score":0.17169493,"about_ca_system_score_codex":0.000119916425,"about_ca_system_score_gemma":0.000004409284,"threshold_uncertainty_score":0.5896381},"labels":[],"label_agreement":null},{"id":"W2168711310","doi":"","title":"MSDL the Road to Balloting","year":2007,"lang":"en","type":"article","venue":"","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":"CAE (Canada)","funders":"","keywords":"Environmental science","score_opus":0.009403970239744803,"score_gpt":0.2273109986798454,"score_spread":0.2179070284401006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168711310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04722603,0.00005028531,0.86678207,0.00028672296,0.00040563563,0.00005902911,2.1800584e-7,0.00049371406,0.08469627],"genre_scores_gemma":[0.8521985,0.000002617768,0.14577173,0.0005931697,0.00016017874,0.0000018282113,7.313336e-7,0.000014173525,0.0012571207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.000002156669,0.00007485718,0.000044703764,0.000061485785,0.000120088545],"domain_scores_gemma":[0.99982196,0.000032254713,0.000003218847,0.00008396884,0.000014732683,0.000043841712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019546763,0.000040488572,0.000030760963,0.000024636269,0.000036888025,0.000021021611,0.000069980204,0.000018700817,0.000119892065],"category_scores_gemma":[0.000032255684,0.000027476734,0.000013736728,0.00013715558,0.0000035229104,0.000020208308,0.000009186355,0.000048060905,0.00019403097],"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.0000012188348,0.0000037269494,0.0001861665,0.0000027654362,0.000010116024,0.0000016827502,0.0005442064,0.9122424,0.00034220773,0.0008044626,0.0016302952,0.08423072],"study_design_scores_gemma":[0.00011118181,0.000008557175,0.003389992,0.000006770503,0.0000036511399,0.0000041386197,0.0007038686,0.9790174,0.0063022315,0.00001948879,0.0102903545,0.00014240379],"about_ca_topic_score_codex":0.000008315531,"about_ca_topic_score_gemma":0.000011055144,"teacher_disagreement_score":0.8049724,"about_ca_system_score_codex":0.000011392324,"about_ca_system_score_gemma":0.0000017831719,"threshold_uncertainty_score":0.24939404},"labels":[],"label_agreement":null},{"id":"W2169719374","doi":"10.1109/icmit.2000.916799","title":"Supply chain management systems: state of the art and vision","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Pace; Supply chain management; Supply chain; Service management; Supply chain risk management; Computer science; Process management; Process (computing); Information management; Materials management; Demand chain; State (computer science); Systems engineering; Risk analysis (engineering); Business; Knowledge management; Engineering; Marketing","score_opus":0.006440230681485386,"score_gpt":0.1963808933564594,"score_spread":0.189940662674974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169719374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20462228,0.0049680443,0.51851565,0.0012836058,0.0026106394,0.001343197,0.000026698151,0.0010739609,0.26555592],"genre_scores_gemma":[0.9703198,0.00045568042,0.014360599,0.00003309056,0.000014151094,0.000006157351,0.0000010400433,0.000012400049,0.014797045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974823,0.000006748816,0.00008104351,0.00004352767,0.000066745604,0.00005368893],"domain_scores_gemma":[0.99986935,0.0000071618524,0.000008630286,0.000091050264,0.000008190798,0.000015601574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048216494,0.000037854694,0.000044311095,0.000023513081,0.000015339992,0.000014113042,0.000037515387,0.00000986713,0.000056461216],"category_scores_gemma":[0.0000014561782,0.000025294423,0.0000098455,0.00006897399,0.000008594398,0.00002284173,0.00001414557,0.000023030056,0.000019775154],"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":[7.5641503e-7,0.0000123426635,0.00022118204,0.00012686368,0.000028219067,0.0000010708233,0.00023527688,0.97395974,0.000043734766,0.00074565085,0.006628363,0.01799681],"study_design_scores_gemma":[0.000118645316,0.0000053376675,0.00053693296,0.000029045721,0.0000035036087,0.0000011756282,0.000060776423,0.99686694,0.00023512324,0.000009570472,0.0020966441,0.000036332716],"about_ca_topic_score_codex":0.0000017319112,"about_ca_topic_score_gemma":7.767164e-7,"teacher_disagreement_score":0.76569754,"about_ca_system_score_codex":0.0000058459323,"about_ca_system_score_gemma":2.3913753e-7,"threshold_uncertainty_score":0.10314766},"labels":[],"label_agreement":null},{"id":"W2171618037","doi":"10.1007/s00170-009-2388-x","title":"A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups","year":2009,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Flow shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Job shop; Fair-share scheduling; Sequence (biology); Minification; Algorithm; Mathematics; Routing (electronic design automation); Schedule","score_opus":0.011082330466334495,"score_gpt":0.2520856453898344,"score_spread":0.2410033149234999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171618037","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16106741,0.0004653548,0.83541614,0.0021146291,0.00036506794,0.00020137231,0.0000068900054,0.00028923017,0.00007391484],"genre_scores_gemma":[0.23016204,0.00023536354,0.7692226,0.000121453806,0.00015295786,0.000017823459,0.0000025081515,0.000024501338,0.00006074565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988245,0.000008541136,0.00041504402,0.00015470122,0.0003336029,0.0002636389],"domain_scores_gemma":[0.9992067,0.000060344057,0.00021733329,0.00019089071,0.00027138615,0.000053353036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017136006,0.00018818559,0.00021679627,0.00034294507,0.00008036165,0.000058866983,0.0008421867,0.000101082944,0.00000919889],"category_scores_gemma":[0.000031548992,0.00013596908,0.00007150903,0.00011763005,0.000058304577,0.00019183585,0.00003824271,0.00039121314,0.0000033078518],"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.000053817792,0.000017347616,0.00000872018,0.000004964568,0.000107743,0.00003495409,0.000052685828,0.8013642,0.0018908521,0.00023432441,0.000010210239,0.1962202],"study_design_scores_gemma":[0.0042182705,0.00081411976,0.00020922678,0.00038430814,0.000097783595,0.0039859624,0.0006673911,0.5282966,0.41362253,0.045876127,0.0012340808,0.00059360237],"about_ca_topic_score_codex":0.0000011161483,"about_ca_topic_score_gemma":0.0000019312365,"teacher_disagreement_score":0.41173166,"about_ca_system_score_codex":0.00015734675,"about_ca_system_score_gemma":0.000050061968,"threshold_uncertainty_score":0.55446583},"labels":[],"label_agreement":null},{"id":"W2171724490","doi":"10.15764/aphy.2015.01003","title":"Approximation Algorithms for Subclasses of the Makespan Problem on Unrelated Parallel Machines with Restricted Processing Times","year":2015,"lang":"en","type":"article","venue":"SOP Transactions on Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Job shop scheduling; Computer science; Algorithm; Mathematical optimization; Parallel computing; Mathematics; Computer network","score_opus":0.024945010887153906,"score_gpt":0.238016168670221,"score_spread":0.2130711577830671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171724490","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017943031,0.000021841284,0.9932286,0.0001163606,0.00007276062,0.0009120154,0.000022843415,0.0003686841,0.003462582],"genre_scores_gemma":[0.20070833,0.000008100997,0.7986183,0.000019320985,0.000022415941,0.00029030934,0.000020715586,0.000072773815,0.00023970031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990539,0.000009997906,0.00032367633,0.00015543292,0.0002837814,0.000173205],"domain_scores_gemma":[0.9993458,0.000099767974,0.00011927454,0.00024487753,0.00012939879,0.000060926468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012316307,0.00020530196,0.00021915816,0.000118884316,0.00012396154,0.000041584855,0.00014378477,0.00011254235,0.0000073753754],"category_scores_gemma":[0.000012231342,0.00013930952,0.000052934625,0.0004968257,0.000050118273,0.000059502814,0.0000017001229,0.00019219544,0.00000594105],"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.00005569092,0.00021127031,0.0000010235188,0.00032295054,0.000061292776,1.3987592e-7,0.001118762,0.9869077,0.0001574325,0.0025721188,0.000051016763,0.008540557],"study_design_scores_gemma":[0.00118208,0.000098406184,0.0000055358446,0.0001620136,0.00009659772,0.000004694413,0.00065367116,0.9866312,0.006677912,0.0042508096,0.000043367305,0.00019369561],"about_ca_topic_score_codex":0.0000012845477,"about_ca_topic_score_gemma":0.0000027390543,"teacher_disagreement_score":0.19891404,"about_ca_system_score_codex":0.000054846234,"about_ca_system_score_gemma":0.000059520306,"threshold_uncertainty_score":0.5680877},"labels":[],"label_agreement":null},{"id":"W2171995692","doi":"10.5555/1161734.1161930","title":"Optimal lot-sizing with capacity constraints and auto-correlated interarrival times","year":2004,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Heuristics; Queueing theory; Computer science; Mathematical optimization; Product (mathematics); Sample (material); Mathematics","score_opus":0.017372065048051128,"score_gpt":0.22373384646406852,"score_spread":0.20636178141601738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171995692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37082842,0.000015246689,0.62725204,0.00004793806,0.00014195894,0.00007864612,0.0000051815705,0.00029079782,0.0013397854],"genre_scores_gemma":[0.9419224,0.000002776497,0.057911742,0.000041954918,0.000033394586,0.0000036435324,0.000012561863,0.000020152615,0.00005137565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993357,0.000013528553,0.00018731187,0.00018801345,0.0001112481,0.00016418111],"domain_scores_gemma":[0.99960583,0.000046732304,0.000033932603,0.00011846339,0.00010926703,0.00008578786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049096612,0.00015947058,0.00014168327,0.0000775633,0.000057061454,0.00011114906,0.00007561389,0.000076375436,0.00023417988],"category_scores_gemma":[0.00002684253,0.00014784829,0.000021174861,0.00010165413,0.00012279693,0.00023420296,0.00001844841,0.00017837425,0.000032414486],"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.000013270942,0.000008704531,0.00037975257,0.000010792323,0.000031292508,0.00000403945,0.0014771313,0.99441206,0.00011772651,0.00055043667,0.0000022115096,0.002992586],"study_design_scores_gemma":[0.0008796803,0.000044725555,0.0007749849,0.00014174935,0.000013968467,0.000019412004,0.00017444503,0.9965968,0.0010106299,0.000108219196,0.000037431742,0.00019795285],"about_ca_topic_score_codex":0.0000068066115,"about_ca_topic_score_gemma":0.000004391118,"teacher_disagreement_score":0.571094,"about_ca_system_score_codex":0.000042804382,"about_ca_system_score_gemma":0.000028329694,"threshold_uncertainty_score":0.60290784},"labels":[],"label_agreement":null},{"id":"W2172214464","doi":"10.1017/s0956796810000250","title":"Special Issue Dedicated to ICFP 2008 Editorial","year":2010,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scope (computer science); Computer science; Library science; Cover (algebra); Operations research; Data science; Programming language","score_opus":0.007906516086205687,"score_gpt":0.22354119635551592,"score_spread":0.21563468026931024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172214464","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038102273,0.000100599835,0.15237594,0.0013757255,0.80360734,0.00026931564,0.0000053392987,0.00034202993,0.0038214338],"genre_scores_gemma":[0.015984211,0.00000778703,0.17933175,0.00007938779,0.8043048,0.0000055437026,0.000007666564,0.000037821006,0.00024104558],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988796,0.000009617641,0.0003571459,0.00008080757,0.00048444537,0.00018836431],"domain_scores_gemma":[0.99919116,0.000051538515,0.000083069644,0.000076280776,0.0003721842,0.00022578915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030181606,0.00010843453,0.00014691414,0.0001868392,0.000076533295,0.00008040836,0.0001215816,0.00012391318,0.0007568049],"category_scores_gemma":[0.00026131468,0.00009984407,0.000088281566,0.00028363115,0.0000217944,0.00016667186,0.000012915941,0.0005909179,0.000121973695],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00010187982,0.00007972094,0.00053572265,0.00001219645,0.00009929886,0.000016710117,0.00014793164,0.119956404,0.0020688546,0.00004900828,0.7505933,0.12633899],"study_design_scores_gemma":[0.00051247474,0.0000984653,0.0003272963,0.000015136868,0.000022535147,0.00009553064,0.00007545998,0.005050156,0.00048751602,0.000028275119,0.99315387,0.00013327296],"about_ca_topic_score_codex":0.0000018805334,"about_ca_topic_score_gemma":0.0000049598966,"teacher_disagreement_score":0.2425606,"about_ca_system_score_codex":0.000038152517,"about_ca_system_score_gemma":0.000064936874,"threshold_uncertainty_score":0.82864827},"labels":[],"label_agreement":null},{"id":"W2184454626","doi":"","title":"A Logic-Based Benders Approach to Scheduling with Alternative Resources and Setup Times","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Benders' decomposition; Job shop scheduling; Mathematical optimization; Integer programming; Scheduling (production processes); Travelling salesman problem; Computer science; Decomposition; Sequence (biology); Mathematics; Routing (electronic design automation)","score_opus":0.02762839945275901,"score_gpt":0.2073665028997146,"score_spread":0.17973810344695557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184454626","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051209144,0.00008798464,0.8693085,0.00003880393,0.00004079997,0.00013679288,0.0000024303072,0.0004122777,0.078763284],"genre_scores_gemma":[0.43049833,0.0000027508763,0.56919384,0.00014249995,0.00001915921,0.000011657162,0.0000029425541,0.00001694107,0.00011189757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994666,0.000010845608,0.00009091207,0.0001740247,0.000101579004,0.00015602692],"domain_scores_gemma":[0.99971634,0.000020458818,0.000013346428,0.00011044896,0.000032573196,0.00010681156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007452592,0.00012333746,0.00010673484,0.000098561926,0.000045709214,0.00003533516,0.00008139245,0.000040333733,0.00006954192],"category_scores_gemma":[0.0000113199485,0.000094295974,0.000014207386,0.00015263684,0.000030415089,0.000062095976,0.000013633499,0.000080514954,0.000013021897],"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.0000240351,0.00002832336,0.00047348122,0.000021226435,0.00004905627,0.0000025158377,0.0031382125,0.9941947,0.000017068443,0.0011878111,0.00005246766,0.0008111306],"study_design_scores_gemma":[0.00036711525,0.00006282184,0.00022270207,0.000018112229,0.000012261451,0.0000040768073,0.0014919352,0.9954362,0.0020279344,0.00009411691,0.00006643396,0.00019628751],"about_ca_topic_score_codex":0.000032201788,"about_ca_topic_score_gemma":0.0000033790604,"teacher_disagreement_score":0.37928918,"about_ca_system_score_codex":0.000012894305,"about_ca_system_score_gemma":0.000006599047,"threshold_uncertainty_score":0.3845278},"labels":[],"label_agreement":null},{"id":"W2198954614","doi":"10.1016/j.omega.2015.12.006","title":"Optimal coordination of resource allocation, due date assignment and scheduling decisions","year":2016,"lang":"en","type":"article","venue":"Omega","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Scheduling (production processes); Computer science; Due date; Resource allocation; Assignment problem; Resource consumption; Single-machine scheduling; Time complexity; Polynomial-time approximation scheme; Regular polygon; Job shop scheduling; Deadline-monotonic scheduling; Operations research; Dynamic priority scheduling; Mathematics; Algorithm; Rate-monotonic scheduling; Schedule","score_opus":0.012973100408818506,"score_gpt":0.2270800008963192,"score_spread":0.2141069004875007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198954614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2695366,0.00015379171,0.72872835,0.00042260523,0.00009361182,0.00006356199,0.000006700026,0.00010206054,0.0008926971],"genre_scores_gemma":[0.8828716,0.00006331668,0.11670245,0.000013795033,0.000036129215,0.0000075620114,0.000007265594,0.000015459036,0.00028236746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947697,0.000014545215,0.00017468544,0.000110645655,0.00012199218,0.00010118697],"domain_scores_gemma":[0.9995865,0.00012906798,0.0000323093,0.00013910657,0.000057184687,0.00005580336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000170331,0.000072706236,0.000093362614,0.000084364634,0.000041702544,0.000017123872,0.00006672634,0.00004762239,0.000027252092],"category_scores_gemma":[0.00014524134,0.00005725405,0.000016472422,0.00012797631,0.000028202623,0.0001017839,0.000021620444,0.000038083053,0.000012093214],"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.00001815218,0.00003558936,0.0005543192,0.000020741738,0.000054293676,0.0000022044069,0.00034079625,0.9000322,0.017475937,0.0025407034,0.0005206615,0.078404374],"study_design_scores_gemma":[0.0015243362,0.0000592718,0.0026071756,0.0002651891,0.000033356504,0.000014218511,0.00027707178,0.92718565,0.058507815,0.00016167309,0.009025857,0.00033836425],"about_ca_topic_score_codex":0.000001175675,"about_ca_topic_score_gemma":5.061121e-7,"teacher_disagreement_score":0.613335,"about_ca_system_score_codex":0.000020718648,"about_ca_system_score_gemma":0.000009332141,"threshold_uncertainty_score":0.23347524},"labels":[],"label_agreement":null},{"id":"W2214231849","doi":"10.5267/j.ijiec.2015.9.004","title":"M-machine, no-wait flowshop scheduling with sequence dependent setup times and truncated learning function to minimize the makespan","year":2015,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Simulated annealing; Learning effect; Computer science; Mathematical optimization; Scheduling (production processes); Sequence (biology); Integer programming; Artificial intelligence; Algorithm; Mathematics; Schedule","score_opus":0.02869135250695101,"score_gpt":0.24544416302020294,"score_spread":0.21675281051325193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214231849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07719077,0.00016492607,0.918635,0.000789367,0.002746843,0.000124567,0.000011651052,0.0001533985,0.00018348974],"genre_scores_gemma":[0.905623,0.000014846784,0.09330856,0.00005948411,0.0008624834,0.0000064205083,0.000022410917,0.00003696632,0.00006583432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988753,0.000033286153,0.00038221505,0.00011241853,0.00045400692,0.000142734],"domain_scores_gemma":[0.9987966,0.000186171,0.000108799264,0.00006928127,0.0006611146,0.00017807151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037999716,0.00015737169,0.00016402265,0.00028738833,0.00006234618,0.00018710105,0.00021973664,0.000075537726,0.000015860252],"category_scores_gemma":[0.00053485355,0.00012356702,0.00004006593,0.00026844183,0.000018810513,0.00022078273,0.0000308597,0.0005131305,0.000012891469],"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.000076231314,0.000010947137,0.000336055,0.000002316755,0.00018344051,0.000013847228,0.0002950466,0.9945392,0.00015092015,0.00009965374,0.000082558494,0.0042097573],"study_design_scores_gemma":[0.0012886511,0.00011197229,0.0001829845,0.00012369287,0.00004358993,0.00019371019,0.00026643445,0.9964923,0.00011794334,0.000020199866,0.0010073857,0.00015109681],"about_ca_topic_score_codex":0.000013167888,"about_ca_topic_score_gemma":0.0000015032199,"teacher_disagreement_score":0.8284322,"about_ca_system_score_codex":0.00013673566,"about_ca_system_score_gemma":0.00010568485,"threshold_uncertainty_score":0.5038917},"labels":[],"label_agreement":null},{"id":"W2218755409","doi":"","title":"The Application of Production Scheduling Techniques to Nigerian Industry","year":2013,"lang":"en","type":"article","venue":"Mechanical Engineering Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fist; Software deployment; Scheduling (production processes); Production schedule; Production (economics); Computer science; Schedule; Manufacturing engineering; Operations management; Business; Industrial engineering; Operations research; Engineering; Economics","score_opus":0.02311384706344267,"score_gpt":0.2978877042978223,"score_spread":0.27477385723437964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218755409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14744802,0.00014404384,0.8482888,0.0014322344,0.0004426549,0.001092794,0.0000014894044,0.0008837124,0.00026629353],"genre_scores_gemma":[0.8777111,0.00002866499,0.12137557,0.000009628785,0.00024094988,0.0004944603,0.0000023422026,0.00004314276,0.000094127594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988643,0.000026785683,0.00024103135,0.00017281865,0.00036178247,0.00033326188],"domain_scores_gemma":[0.99911714,0.00011003047,0.00001340457,0.00034941084,0.00027953452,0.00013046751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010011996,0.000096420175,0.000108668995,0.00017069989,0.00010455886,0.00006565774,0.00027381518,0.0001823196,0.000016825463],"category_scores_gemma":[0.0007129853,0.00008005697,0.00002834783,0.000778045,0.000022247104,0.00008551334,0.00006353776,0.0006963369,0.000066103006],"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.000004489325,0.000020922364,0.000014614508,0.00006763945,0.000016726694,2.916637e-7,0.00008182955,0.6658775,0.23486753,0.0033260745,0.00037461036,0.09534774],"study_design_scores_gemma":[0.000035115663,0.000031048843,0.000068615765,0.000040083818,0.0000015000027,0.000001786361,0.00008624693,0.7617578,0.23552774,0.00022250957,0.0021282688,0.000099272445],"about_ca_topic_score_codex":0.000024071138,"about_ca_topic_score_gemma":0.0000016517904,"teacher_disagreement_score":0.7302631,"about_ca_system_score_codex":0.00007719811,"about_ca_system_score_gemma":0.000016836315,"threshold_uncertainty_score":0.32646284},"labels":[],"label_agreement":null},{"id":"W2219185070","doi":"10.1609/icaps.v23i1.13575","title":"An Optimal Constraint Programming Approach to the Open-Shop Problem","year":2013,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Constraint programming; Heuristics; Computer science; Mathematical optimization; Metaheuristic; Scheduling (production processes); Job shop scheduling; Benchmark (surveying); Concurrent constraint logic programming; Constraint (computer-aided design); Constraint satisfaction; Constraint logic programming; Artificial intelligence; Mathematics; Stochastic programming; Schedule","score_opus":0.03285429607784356,"score_gpt":0.27679911591896517,"score_spread":0.2439448198411216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219185070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93523073,0.000063195315,0.009826641,0.0020316066,0.000424155,0.0012061615,0.000014001181,0.0010592154,0.050144307],"genre_scores_gemma":[0.79200625,0.0000041769354,0.20766157,0.00011748134,0.000050801926,0.000083685954,0.0000072812686,0.000019594278,0.00004917534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892265,0.000008349831,0.00029479107,0.0002538437,0.0002985008,0.00022186841],"domain_scores_gemma":[0.9992897,0.000031261745,0.00010509925,0.00010286817,0.00036713504,0.00010395561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003824008,0.00018298227,0.00016490198,0.00009887214,0.0001713692,0.00093460514,0.0010604304,0.00007771041,0.000026795173],"category_scores_gemma":[0.000077009245,0.000120121884,0.000032463406,0.00020491668,0.00006614216,0.0003416557,0.00015105018,0.0002835308,0.000008715601],"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.000039663664,0.00011590356,0.0015681819,0.00008102178,0.00015540207,4.1849435e-7,0.0043384843,0.9496284,0.0087771015,0.02436524,0.0006278545,0.010302316],"study_design_scores_gemma":[0.0002136134,0.000045113,0.0004075221,0.00027308558,0.000010056716,0.0000194387,0.0039965454,0.99184364,0.002801093,0.00012855444,0.00009693967,0.00016437907],"about_ca_topic_score_codex":0.000018765264,"about_ca_topic_score_gemma":2.423923e-7,"teacher_disagreement_score":0.19783492,"about_ca_system_score_codex":0.000030540174,"about_ca_system_score_gemma":0.000029585455,"threshold_uncertainty_score":0.9012419},"labels":[],"label_agreement":null},{"id":"W2219261791","doi":"","title":"Modeling Poset Convex Subsets","year":2015,"lang":"en","type":"preprint","venue":"Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B))","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Convex hull; Regular polygon; Discrete mathematics","score_opus":0.014487719060913399,"score_gpt":0.2089598535555082,"score_spread":0.1944721344945948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219261791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6943176,0.004496783,0.12440364,0.006386522,0.0015362655,0.0027580801,0.0025472988,0.003357345,0.1601965],"genre_scores_gemma":[0.97145975,0.0022798283,0.0076091858,0.0013417765,0.00043211828,0.000021215355,0.001903053,0.00045006207,0.014503013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950378,0.00033032047,0.00064771983,0.0014927796,0.0008644686,0.0016268879],"domain_scores_gemma":[0.9956332,0.00038622526,0.0003652483,0.0014405561,0.0006464646,0.0015283413],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.00069158134,0.0014762119,0.0015364849,0.0015777303,0.001317271,0.0023305696,0.0036625643,0.0013372516,0.00025864845],"category_scores_gemma":[0.00017983533,0.0016230391,0.00066380185,0.0015955722,0.0007319091,0.001304435,0.00603987,0.0019052395,0.00011865733],"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.0026778758,0.00017557178,0.0013557995,0.0005952332,0.0014707684,0.0018876164,0.09909755,0.833846,0.000039016057,0.04579289,0.0074369544,0.0056247604],"study_design_scores_gemma":[0.0066128946,0.0001645037,0.00043563737,0.0005592758,0.00089928915,0.00040589107,0.0070060426,0.8643586,0.00023409766,0.006997548,0.10916697,0.0031592294],"about_ca_topic_score_codex":0.00084547146,"about_ca_topic_score_gemma":0.00009070676,"teacher_disagreement_score":0.27714217,"about_ca_system_score_codex":0.0031515153,"about_ca_system_score_gemma":0.0007837933,"threshold_uncertainty_score":0.9999829},"labels":[],"label_agreement":null},{"id":"W2220822187","doi":"10.1609/icaps.v22i1.13524","title":"Long-Run Stability in Dynamic Scheduling","year":2012,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Polling; Computer science; Queueing theory; Dynamic priority scheduling; Scheduling (production processes); Mathematical optimization; Stability (learning theory); Flow shop scheduling; Schedule; Distributed computing; Mathematics; Computer network","score_opus":0.029926027054536772,"score_gpt":0.27560620595054924,"score_spread":0.24568017889601246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2220822187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99358815,0.00028083887,0.0006924785,0.00024013309,0.0006008779,0.00011028652,0.000006761265,0.0004481261,0.0040323627],"genre_scores_gemma":[0.9822624,0.000037217626,0.017554404,0.00003955927,0.000048283757,0.0000109262455,0.0000056855542,0.000021768703,0.000019773208],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988829,0.000007799836,0.00035232047,0.00018100104,0.0002994076,0.00027656084],"domain_scores_gemma":[0.9995072,0.00006094103,0.00010988929,0.00007497566,0.00016693567,0.00008004082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051051774,0.00018043662,0.00019167365,0.00018314556,0.00007198295,0.00009939195,0.0003224214,0.0001122811,0.00003308757],"category_scores_gemma":[0.00022124847,0.00015326086,0.000044446777,0.00023067796,0.00005617119,0.00030158745,0.00007119798,0.00036324692,0.000004905911],"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.00010974027,0.00019285317,0.53346676,0.0003293317,0.00017175601,0.0000019274064,0.00518079,0.41131482,0.037682246,0.009371631,0.000030160978,0.002147993],"study_design_scores_gemma":[0.00029091418,0.000011566275,0.025981434,0.0005039957,0.000008914675,0.000010278497,0.0010691877,0.9628811,0.008920834,0.00015272382,0.000003845443,0.00016521558],"about_ca_topic_score_codex":0.0000064076835,"about_ca_topic_score_gemma":0.0000010942106,"teacher_disagreement_score":0.55156624,"about_ca_system_score_codex":0.000087062384,"about_ca_system_score_gemma":0.000021121841,"threshold_uncertainty_score":0.6249797},"labels":[],"label_agreement":null},{"id":"W2221027144","doi":"10.1504/ijmor.2015.072277","title":"Failure-prone manufacturing systems with setups: feasibility and optimality under various hypotheses about perturbations and setup interplay","year":2015,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Matching (statistics); Computer science; Mathematical optimization; Type (biology); Mathematics; Bellman equation; Statistics","score_opus":0.09162658443519967,"score_gpt":0.36411708095620443,"score_spread":0.27249049652100477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221027144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91841954,0.00091327366,0.07822706,0.0008867991,0.00032592786,0.0002673885,0.000023637702,0.000025640333,0.00091072905],"genre_scores_gemma":[0.93318415,0.00015259141,0.06634577,0.000021670614,0.00013678546,0.000013445244,0.000008181892,0.000020208854,0.00011721238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980198,0.0001096436,0.00050112413,0.00014132948,0.0010601867,0.00016787258],"domain_scores_gemma":[0.9980455,0.0005831688,0.000078796205,0.0001134315,0.0010245529,0.00015454489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021017704,0.00012776304,0.00020738791,0.00036822772,0.00006543005,0.00038884036,0.00024206012,0.00007338147,0.000026549445],"category_scores_gemma":[0.0005670348,0.00010029425,0.000021432636,0.00010772442,0.0001350541,0.00041275806,0.00007188206,0.000449553,0.000003944653],"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.0000964173,0.00026739624,0.0036941064,0.00012901473,0.00025511227,0.00005845168,0.003914462,0.9778759,0.00012311817,0.012778535,0.00031947927,0.00048799108],"study_design_scores_gemma":[0.002121491,0.00019927743,0.00534181,0.0006308286,0.000017412354,0.0011119171,0.007540621,0.97303367,0.00048419126,0.008978952,0.00026745946,0.00027236494],"about_ca_topic_score_codex":0.000029477482,"about_ca_topic_score_gemma":0.000045479872,"teacher_disagreement_score":0.014764585,"about_ca_system_score_codex":0.0003514956,"about_ca_system_score_gemma":0.00017136244,"threshold_uncertainty_score":0.4089881},"labels":[],"label_agreement":null},{"id":"W2222844974","doi":"","title":"Ordonnancement d'atelier de type flow shop hybride avec tâches multiprocesseurs","year":2011,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Humanities; Processor scheduling; Philosophy; Operating system","score_opus":0.01957621587903445,"score_gpt":0.22174987794738404,"score_spread":0.20217366206834958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2222844974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04785285,0.004935857,0.9066296,0.0041323937,0.0016221245,0.00053600664,0.00007836065,0.0006988726,0.033513907],"genre_scores_gemma":[0.11088436,0.005385758,0.85223264,0.00012068492,0.000111529494,0.00010772029,0.0006266022,0.0001765562,0.03035415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949299,0.0020176256,0.0008376735,0.00096804945,0.00045964317,0.0007871071],"domain_scores_gemma":[0.99378926,0.0007233858,0.00039420874,0.0019960292,0.0026777189,0.00041939397],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0039553707,0.0006551418,0.00057144737,0.0002221727,0.00037367584,0.00039146823,0.0013732495,0.00050984847,0.0012143634],"category_scores_gemma":[0.0017515911,0.000775334,0.00024963028,0.00062674924,0.00026325884,0.00019845915,0.00071119156,0.0010419121,0.0004617366],"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.00009095393,0.0021228073,0.0064281793,0.0017259739,0.0009156047,0.00006719497,0.09391874,0.49567896,0.0030538419,0.059693377,0.0037507045,0.33255365],"study_design_scores_gemma":[0.00071566104,7.99588e-7,0.0014030881,0.002434459,0.0001293594,0.000027735121,0.00024194834,0.89975566,0.07108074,0.0015816013,0.021707902,0.0009210566],"about_ca_topic_score_codex":0.0011038588,"about_ca_topic_score_gemma":0.00063981325,"teacher_disagreement_score":0.4040767,"about_ca_system_score_codex":0.00040906126,"about_ca_system_score_gemma":0.0004711521,"threshold_uncertainty_score":0.99969864},"labels":[],"label_agreement":null},{"id":"W2227132767","doi":"","title":"Simulation Based Modeling of Inventory Policies and Operating Procedures in Complex, Low-Volume Electronics Manufacturing","year":2011,"lang":"en","type":"article","venue":"Library and Archives Canada (Government of Canada)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Electronics; Volume (thermodynamics); Computer science; Manufacturing engineering; Industrial engineering; Engineering; Electrical engineering","score_opus":0.00811991575937096,"score_gpt":0.15679502619272387,"score_spread":0.1486751104333529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2227132767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98543596,0.0003050037,0.0063715656,0.000090403104,0.00003118896,0.00011047915,0.000021228723,0.000019579124,0.0076145777],"genre_scores_gemma":[0.9908241,0.000036657064,0.008960386,0.00009846406,0.000008876352,0.0000023389628,0.0000034846398,0.0000135295995,0.0000521409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926555,0.000013685521,0.00019606596,0.00008723999,0.00029447893,0.00014296122],"domain_scores_gemma":[0.99979407,0.000046299294,0.00003693369,0.000058748952,5.1573613e-7,0.00006345081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000008255809,0.000091906215,0.00012730123,0.000030757994,0.00004275321,0.000007813991,0.000058412712,0.000016300564,0.000009460573],"category_scores_gemma":[0.0000039315946,0.000098529046,0.000007752113,0.000035302,0.00001948967,0.00015611462,0.000022006612,0.00006919488,2.8687852e-10],"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.00001953805,0.0000054929988,0.005621612,0.00020539305,0.000010487371,0.0000015922827,0.00019647331,0.99213713,0.0009016115,0.0005268667,0.0000014294784,0.0003723981],"study_design_scores_gemma":[0.00016682585,0.000015897776,0.004449037,0.00005006915,0.0000051276543,2.3130441e-7,0.00061120786,0.96679735,0.027720945,0.00007416841,0.00001293465,0.000096228934],"about_ca_topic_score_codex":0.0010081395,"about_ca_topic_score_gemma":0.0064469003,"teacher_disagreement_score":0.026819333,"about_ca_system_score_codex":0.0000064382366,"about_ca_system_score_gemma":0.00024032818,"threshold_uncertainty_score":0.40178978},"labels":[],"label_agreement":null},{"id":"W2236520910","doi":"10.1016/j.tcs.2016.01.002","title":"Solving the Many to Many assignment problem by improving the Kuhn–Munkres algorithm with backtracking","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":117,"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; Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Backtracking; Algorithm; Task (project management); Assignment problem; Computer science; Mathematics; Process (computing); Mathematical optimization","score_opus":0.0047725030374459534,"score_gpt":0.19742278774281283,"score_spread":0.19265028470536688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2236520910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00600379,0.00005864875,0.99039346,0.0020061943,0.00029494066,0.00026593433,0.0000034529223,0.00025584578,0.00071770954],"genre_scores_gemma":[0.68896234,0.000006720108,0.31045422,0.00036608326,0.0001393221,0.000023613775,2.96718e-7,0.000021666878,0.000025738156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823564,0.000052435225,0.00020898668,0.00036972645,0.00057425554,0.0005589706],"domain_scores_gemma":[0.9989377,0.0002902434,0.00003312782,0.0004777052,0.00008995363,0.000171248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011464083,0.0001915703,0.00012771126,0.000056076336,0.00052355864,0.00040848608,0.0010399353,0.0000355646,0.00005597351],"category_scores_gemma":[0.000029730038,0.000080670085,0.000032448974,0.0004908479,0.0010460323,0.00022232175,0.0002656836,0.00017621531,0.000052414944],"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.0000127639005,0.000032551983,0.000026941108,0.0000140036655,0.000025908606,0.0000066137072,0.002080337,0.049670465,0.005756429,0.15181547,0.0003866134,0.7901719],"study_design_scores_gemma":[0.00018127539,0.00011697721,0.00007320192,0.000106343185,0.00000952186,0.000020095425,0.00009116574,0.9882178,0.0090971375,0.0017048628,0.00015594166,0.00022568487],"about_ca_topic_score_codex":0.000002901188,"about_ca_topic_score_gemma":3.6679845e-7,"teacher_disagreement_score":0.9385473,"about_ca_system_score_codex":0.00009057255,"about_ca_system_score_gemma":0.000033198972,"threshold_uncertainty_score":0.4026843},"labels":[],"label_agreement":null},{"id":"W2237596682","doi":"10.47749/t/unicamp.2005.363239","title":"Implementação e analise de uma abordagem de busca orientada por restrições atraves de heuristicas baseadas na folga para plantas multiproposito operando em batelada","year":2005,"lang":"pt","type":"dissertation","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Environmental science; Physics; Humanities; Philosophy","score_opus":0.015530111555823308,"score_gpt":0.29650264288200345,"score_spread":0.28097253132618016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2237596682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64810807,0.0029658626,0.34115538,0.00018747605,0.0016795559,0.0016208325,0.0013117733,0.0009774113,0.0019936163],"genre_scores_gemma":[0.6976428,0.0028185437,0.28279087,0.00040921252,0.0008817979,0.00021492287,0.008963185,0.00042929352,0.0058493605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945383,0.00031787707,0.0014857173,0.0010891373,0.00078306405,0.0017859071],"domain_scores_gemma":[0.99722606,0.00045627117,0.00033482746,0.0007460705,0.00028025746,0.00095648534],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007951594,0.0012566461,0.0010385095,0.0005182729,0.00064703287,0.0006859626,0.0007393381,0.00082189613,0.002236544],"category_scores_gemma":[0.0002625704,0.0013364978,0.00040425203,0.0007280661,0.000050591,0.00036008068,0.000070287984,0.0010482275,0.000109620785],"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.0043295925,0.0012398884,0.038890425,0.0029607862,0.0042610243,0.0026669211,0.036391415,0.8279388,0.009528813,0.0015561472,0.00866227,0.061573915],"study_design_scores_gemma":[0.006662953,0.00031448694,0.009628476,0.0008575046,0.0014308267,0.00033400249,0.026321841,0.8787896,0.07148854,0.000037749767,0.0013579918,0.002776034],"about_ca_topic_score_codex":0.0043098694,"about_ca_topic_score_gemma":0.0024891978,"teacher_disagreement_score":0.061959725,"about_ca_system_score_codex":0.0010563235,"about_ca_system_score_gemma":0.0008930585,"threshold_uncertainty_score":0.99890846},"labels":[],"label_agreement":null},{"id":"W2252530814","doi":"10.5267/j.dsl.2015.10.003","title":"Multi-objective optimization for supply chain management problem: A literature review","year":2015,"lang":"en","type":"review","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Supply chain; Supply chain management; Multi-objective optimization; Business; Management science; Mathematical optimization; Computer science; Process management; Operations management; Engineering; Mathematics; Marketing","score_opus":0.03308207202808843,"score_gpt":0.3258728882834501,"score_spread":0.2927908162553617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252530814","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.7529226e-8,0.5685631,0.42896724,0.000076016084,0.00053740694,0.0016197821,0.000038885,0.00013493487,0.000062594605],"genre_scores_gemma":[1.7821574e-8,0.54059684,0.4583414,0.00043578664,0.00005891853,0.00037197664,0.00011100682,0.000041209943,0.00004283235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723804,0.000051437066,0.00071809965,0.00074509875,0.00078887737,0.00045842925],"domain_scores_gemma":[0.99856853,0.0001320459,0.0001930804,0.00059240777,0.00031284234,0.00020110169],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001934061,0.0004612616,0.0009858602,0.00082206086,0.00016606583,0.00035872922,0.0008929529,0.00016128512,0.000017883858],"category_scores_gemma":[0.00020757539,0.0003636275,0.000286416,0.0032138468,0.000104535306,0.00040446935,0.00011084145,0.00029470384,0.00004877178],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001322448,0.000011591037,4.8714984e-8,0.011694218,0.00002600409,0.000010051941,0.00006990709,0.12361005,2.2436325e-7,0.000012615552,0.008309322,0.85625464],"study_design_scores_gemma":[0.00031836584,0.0000155188,1.5853216e-7,0.080588534,0.00021649069,0.000033305343,0.000010631563,0.26362902,4.6255184e-7,0.000009151561,0.6546777,0.00050065195],"about_ca_topic_score_codex":2.4681881e-7,"about_ca_topic_score_gemma":1.7081103e-7,"teacher_disagreement_score":0.855754,"about_ca_system_score_codex":0.0003932861,"about_ca_system_score_gemma":0.00008426226,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W2255734301","doi":"10.1287/ijoc.2015.0666","title":"Decomposition Methods for the Parallel Machine Scheduling Problem with Setups","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Solver; Mathematical optimization; Computer science; Travelling salesman problem; Scheduling (production processes); Metaheuristic; Decomposition; Benders' decomposition; Integer programming; Branch and bound; Algorithm; Mathematics; Routing (electronic design automation)","score_opus":0.015181017383475675,"score_gpt":0.3035211131566281,"score_spread":0.28834009577315245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2255734301","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004815283,0.00022113959,0.99326134,0.0005682622,0.00032846606,0.0001809594,0.0000019407262,0.00017671646,0.0004458844],"genre_scores_gemma":[0.12014943,0.000055209723,0.8792222,0.00017398823,0.0003181353,0.000006269019,0.0000022867728,0.000031882304,0.000040568993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991189,0.00002174331,0.0003487597,0.00008930316,0.00014505505,0.00027623284],"domain_scores_gemma":[0.9989094,0.0006297139,0.00013016272,0.00011989494,0.00012070975,0.000090102956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008726877,0.00015701824,0.00014933788,0.0000960383,0.0003813052,0.00015326923,0.00018606446,0.000052478852,0.000014079026],"category_scores_gemma":[0.000054823046,0.00007153482,0.000078789024,0.00013619025,0.000022859771,0.00022076548,0.000018223609,0.00025928795,0.000009819558],"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.00003097714,0.000005128304,0.00006311683,0.00001010644,0.000060972663,9.697924e-7,0.00011390089,0.75529605,0.00008721799,0.00030393357,0.000025385554,0.24400225],"study_design_scores_gemma":[0.0011002123,0.0001262181,0.000096135314,0.00024489535,0.000020009958,0.00020068337,0.00005259316,0.99481726,0.0007621802,0.00045729347,0.001957644,0.00016486306],"about_ca_topic_score_codex":7.7295806e-7,"about_ca_topic_score_gemma":5.1351014e-7,"teacher_disagreement_score":0.24383739,"about_ca_system_score_codex":0.00007730929,"about_ca_system_score_gemma":0.0000252601,"threshold_uncertainty_score":0.29327297},"labels":[],"label_agreement":null},{"id":"W2261682292","doi":"10.1155/2016/4930817","title":"Production Planning of a Failure-Prone Manufacturing System under Different Setup Scenarios","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Economic shortage; Control reconfiguration; Production (economics); Mathematical optimization; Context (archaeology); Production planning; Inventory control; Operations research; Reliability engineering; Engineering; Mathematics; Economics","score_opus":0.013648483974307866,"score_gpt":0.212144862127825,"score_spread":0.19849637815351712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261682292","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51629555,0.000045191173,0.4826464,0.00006331108,0.00031761875,0.00011663095,0.000001451444,0.00007591636,0.00043795543],"genre_scores_gemma":[0.8397269,0.000013309299,0.1600437,0.0000024237881,0.00016174711,0.0000030507026,3.5588252e-7,0.000027300193,0.000021204194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990103,0.0000047348385,0.00053151546,0.000066679364,0.00025835162,0.00012840702],"domain_scores_gemma":[0.9993819,0.0000580247,0.0003003678,0.00014237556,0.000059551647,0.000057753034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021266933,0.00012689689,0.00029593587,0.00013352378,0.000027845083,0.00001662139,0.000108459346,0.0000637875,0.000011863484],"category_scores_gemma":[0.000014853236,0.00007890888,0.00005761106,0.000054501346,0.000017738848,0.00006930651,0.000014549447,0.00011911253,0.0000056572117],"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.000041427502,0.00012961614,0.000018373063,0.001978034,0.0003326169,0.000007474666,0.0024237458,0.90939075,0.07850123,0.0028274003,0.0004258841,0.003923457],"study_design_scores_gemma":[0.0018460249,0.000093335606,0.00016184342,0.0036444422,0.00023190232,0.00031347468,0.0074634715,0.09689021,0.8863785,0.0024312388,0.000081674116,0.00046386666],"about_ca_topic_score_codex":7.572938e-8,"about_ca_topic_score_gemma":1.1701127e-7,"teacher_disagreement_score":0.81250054,"about_ca_system_score_codex":0.00010344158,"about_ca_system_score_gemma":0.00001151082,"threshold_uncertainty_score":0.32178107},"labels":[],"label_agreement":null},{"id":"W2262433705","doi":"10.71781/20872","title":"Inférence exacte simulée et techniques d'estimation dans les modèles VAR et VARMA avec applications macroéconomiques","year":2008,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mod; Macro; Humanities; Computer science; Physics; Mathematics; Philosophy; Artificial intelligence; Programming language","score_opus":0.029506532939292805,"score_gpt":0.3071573741083564,"score_spread":0.27765084116906363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262433705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0363659,0.00035459865,0.8210448,0.000071745504,0.0002696767,0.0020541898,0.0002954221,0.00030787216,0.13923578],"genre_scores_gemma":[0.0576641,0.0016686663,0.9271171,0.00004395832,0.00009548167,0.0008342157,0.006918415,0.0001541945,0.005503887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987697,0.00005344829,0.00045514686,0.0003863187,0.00013852051,0.00019686141],"domain_scores_gemma":[0.99912,0.00010012284,0.00017640534,0.00037718538,0.00014281161,0.00008345582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020974378,0.00034848336,0.0003249312,0.00019067046,0.00015030977,0.00032930583,0.0005375443,0.00035510634,0.00029375835],"category_scores_gemma":[0.000037454833,0.00039434747,0.00006896385,0.00020663362,0.00003397452,0.00046163265,0.000044803193,0.00038582922,0.00013162485],"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.000019724657,0.000086456006,0.000052993062,0.0001158032,0.00009899421,0.0000062630857,0.008021342,0.6143279,0.0011810089,0.0002734936,0.0002842913,0.3755317],"study_design_scores_gemma":[0.00028451585,0.000037979287,0.0005505028,0.00037577262,0.00009231852,0.000017862147,0.00087683933,0.9037086,0.06434666,0.00024755148,0.028480645,0.0009807766],"about_ca_topic_score_codex":0.00009014125,"about_ca_topic_score_gemma":0.00029970493,"teacher_disagreement_score":0.37455094,"about_ca_system_score_codex":0.000094979296,"about_ca_system_score_gemma":0.00014975212,"threshold_uncertainty_score":0.99985087},"labels":[],"label_agreement":null},{"id":"W2272717858","doi":"10.5267/j.dsl.2015.12.005","title":"An integrated model of scheduling, batch delivery and supplier selection in a make-to-order manufacturing system","year":2015,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Order (exchange); Selection (genetic algorithm); Computer science; Manufacturing engineering; Industrial engineering; Operations research; Operations management; Business; Engineering; Artificial intelligence","score_opus":0.018034901862114216,"score_gpt":0.2513877778137968,"score_spread":0.23335287595168258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272717858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54918814,0.000006696646,0.45052406,0.000038125374,0.00009901985,0.000060753824,0.0000014434071,0.000061649174,0.000020147336],"genre_scores_gemma":[0.64234,0.0000017690318,0.35751536,0.00011516803,0.000010893048,0.0000045685842,9.903297e-7,0.000009378226,0.0000018461324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988023,0.0000153429,0.00026011709,0.00027893344,0.00041914356,0.00022417336],"domain_scores_gemma":[0.99947983,0.000032368334,0.000029221705,0.00014960991,0.00012277199,0.00018621987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007367438,0.00011394628,0.00014750139,0.00057996204,0.00005073085,0.000097056734,0.00022050898,0.00005147233,0.0000025039335],"category_scores_gemma":[0.000073806754,0.00010504597,0.000013042284,0.0009199987,0.00006276207,0.00032330517,0.000032986387,0.00012686377,0.000007303745],"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.000013328024,0.000005986015,0.0005097296,0.0000059160056,0.0000013328591,0.0000012995545,0.0005006344,0.9711319,0.019614797,0.000009991328,0.00001780212,0.008187251],"study_design_scores_gemma":[0.00029785428,0.00001709356,0.0005911532,0.000057317146,0.0000024006085,0.000006675844,0.00060634915,0.9806951,0.01758465,0.00001274089,0.000009412335,0.0001192228],"about_ca_topic_score_codex":0.000036772202,"about_ca_topic_score_gemma":0.000015926964,"teacher_disagreement_score":0.09315193,"about_ca_system_score_codex":0.00016642387,"about_ca_system_score_gemma":0.00004921955,"threshold_uncertainty_score":0.42836502},"labels":[],"label_agreement":null},{"id":"W2285906795","doi":"","title":"Production planning for a ramp-up process with learning in production and growth in demand","year":2012,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Production (economics); Process (computing); Production planning; Structuring; Production line; Production rate; Economics; Computer science; Operations research; Operations management; Industrial engineering; Microeconomics; Engineering; Mechanical engineering","score_opus":0.025865390854254388,"score_gpt":0.2921398424842351,"score_spread":0.2662744516299807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285906795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963177,0.00041303103,0.00045783838,0.00012831383,0.0005008652,0.0012135784,0.0000024321007,0.00010324379,0.00086302054],"genre_scores_gemma":[0.9900002,0.0019468118,0.006756002,0.0000027873696,0.00029712557,0.0006791185,0.000039071474,0.000074905336,0.00020397469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983634,0.000083231665,0.00036431913,0.0005739353,0.00012109791,0.0004940632],"domain_scores_gemma":[0.9994609,0.00010561982,0.0000721666,0.00019142711,0.00009596699,0.00007396281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017265675,0.00021125787,0.0003151929,0.0006774504,0.00007166876,0.000081849525,0.00012274088,0.00025045828,0.0000021146727],"category_scores_gemma":[0.00077721686,0.00022867447,0.000021888516,0.0002176626,0.00007317066,0.00020947949,0.00007581251,0.0013301002,4.744703e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010584048,0.00002905406,0.061628737,0.00073739915,0.000018328352,0.0000017722032,0.0025001788,0.91972196,0.000031928408,0.000008060428,0.0000018820625,0.015214838],"study_design_scores_gemma":[0.0011824874,0.00008476638,0.023585763,0.0018373523,0.000011675613,0.000030258896,0.0034068117,0.9671559,0.0015889346,0.00031605468,0.000115430215,0.0006845717],"about_ca_topic_score_codex":0.000016374877,"about_ca_topic_score_gemma":0.000095570686,"teacher_disagreement_score":0.04743391,"about_ca_system_score_codex":0.00041228766,"about_ca_system_score_gemma":0.0001254382,"threshold_uncertainty_score":0.9325074},"labels":[],"label_agreement":null},{"id":"W2294069062","doi":"10.1007/978-3-319-26626-8_7","title":"Variants of Multi-resource Scheduling Problems with Equal Processing Times","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Computer science; Time complexity; Monotonic function; Scheduling (production processes); Generalization; Job shop scheduling; Polynomial; Function (biology); Mathematical optimization; Algorithm; Set (abstract data type); Mathematics; Schedule","score_opus":0.02513931037187123,"score_gpt":0.23903700938180816,"score_spread":0.21389769900993694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294069062","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007783398,0.0014229054,0.99631953,0.000023740104,0.000249048,0.00019946697,0.0000042991883,0.00019598046,0.0015071962],"genre_scores_gemma":[0.095697105,0.000009729515,0.90383375,0.000046100355,0.00018360066,0.0000039760102,0.000008186201,0.000065962515,0.0001515719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998253,0.00000923481,0.00034761798,0.00048669323,0.0005665102,0.00033695388],"domain_scores_gemma":[0.99907404,0.00007694392,0.0001395391,0.00033308018,0.00026199938,0.000114394075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004478382,0.00033480168,0.00037890064,0.00039766092,0.000064192944,0.00012469864,0.0005564372,0.000218888,0.00001537105],"category_scores_gemma":[0.000046676945,0.00028263708,0.00003509934,0.00036586786,0.00031762308,0.00018433765,0.00011560055,0.00048738145,0.0000070232077],"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.0000030081821,0.000008966178,0.000011675079,0.00009914001,0.000009023628,0.000006272849,0.00070372655,0.8849832,0.00003410487,0.00007043951,0.0000011421233,0.1140693],"study_design_scores_gemma":[0.0003393815,0.00006041551,0.000006254039,0.0009836117,0.000012002591,0.00002204357,8.630352e-7,0.9966925,0.0003705395,0.0010621558,0.00009592696,0.00035435404],"about_ca_topic_score_codex":0.0000043126197,"about_ca_topic_score_gemma":0.00000929627,"teacher_disagreement_score":0.11371495,"about_ca_system_score_codex":0.00011066184,"about_ca_system_score_gemma":0.00027255566,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W2297009783","doi":"10.71781/10394","title":"Intégration d'un système d'exploitation dans le flot de développement logiciel/matériel","year":2008,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.007441317899866512,"score_gpt":0.17827539508263235,"score_spread":0.17083407718276583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297009783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59268916,0.013886639,0.3740398,0.00065569143,0.0029033779,0.00065311935,0.00007272501,0.0006377977,0.014461691],"genre_scores_gemma":[0.8526388,0.0034355451,0.12158626,0.0001040097,0.00045686468,0.00011602952,0.0021737337,0.00012936952,0.019359408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971651,0.0001976989,0.0006820177,0.00063522806,0.0007098295,0.0006101387],"domain_scores_gemma":[0.99831456,0.00010722384,0.00037922995,0.00037605764,0.00043277233,0.0003901745],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0002608889,0.0006185691,0.00047158683,0.00042390087,0.0066508497,0.000105654275,0.00039514058,0.0007313012,0.000049144644],"category_scores_gemma":[0.00009909106,0.00080373324,0.00031561696,0.0005533317,0.00017873403,0.00051839964,0.000076435404,0.0005516075,0.00010892216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025575326,0.0003161825,0.004013401,0.00032470128,0.00053855317,0.0010505386,0.11491505,0.81222457,0.028006544,0.032180455,0.00029369668,0.0058805263],"study_design_scores_gemma":[0.0028966356,0.00022431873,0.13957398,0.0008521454,0.0006207805,0.0016525246,0.098627925,0.60951453,0.14124803,0.00076737686,0.002134994,0.0018867691],"about_ca_topic_score_codex":0.027225472,"about_ca_topic_score_gemma":0.0033523776,"teacher_disagreement_score":0.25994962,"about_ca_system_score_codex":0.01361246,"about_ca_system_score_gemma":0.0021191356,"threshold_uncertainty_score":0.9994413},"labels":[],"label_agreement":null},{"id":"W2297558499","doi":"","title":"Designing an advanced available-to-promise mechanism compatible with the make-to-forecast production systems through integrating inventory allocation and job shop scheduling with due dates and weighte","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop; Scheduling (production processes); Production (economics); Computer science; Job shop scheduling; Operations research; Operations management; Flow shop scheduling; Manufacturing engineering; Industrial engineering; Engineering; Economics; Microeconomics; Schedule","score_opus":0.027735369555964774,"score_gpt":0.23720485666102678,"score_spread":0.209469487105062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297558499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36803705,0.000066855384,0.6302381,0.00067859754,0.0006820915,0.00021305014,0.0000047634403,0.0000665941,0.000012895794],"genre_scores_gemma":[0.7865836,0.000019962197,0.21281447,0.00002052484,0.00047684892,0.0000221057,0.000005903335,0.00003666189,0.000019924571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.000039612583,0.0003782963,0.00018376012,0.00033849015,0.00015868562],"domain_scores_gemma":[0.99890286,0.00015333394,0.00015228392,0.00010168503,0.0005536426,0.00013617282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037762098,0.00018740587,0.0001998817,0.00028529376,0.000111502595,0.00021419236,0.00019043185,0.000059767128,0.0000035529442],"category_scores_gemma":[0.00017822115,0.000119062155,0.000018240773,0.00027657847,0.000025457133,0.00056211813,0.000028069144,0.00024175116,0.000002013147],"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.00006967935,0.000011697917,0.00012819025,0.000009300253,0.00013472945,0.0000060836637,0.00082124124,0.98815626,0.005685074,0.00089580216,0.000026480133,0.004055463],"study_design_scores_gemma":[0.0014139969,0.00031284755,0.000072353454,0.0014060002,0.000050067774,0.0003316544,0.001055266,0.9895742,0.005322098,0.00004031467,0.0001609656,0.00026023883],"about_ca_topic_score_codex":0.0000126335835,"about_ca_topic_score_gemma":0.000011527761,"teacher_disagreement_score":0.41854656,"about_ca_system_score_codex":0.00013015239,"about_ca_system_score_gemma":0.00006885346,"threshold_uncertainty_score":0.4855214},"labels":[],"label_agreement":null},{"id":"W2298490962","doi":"10.1007/s10287-016-0252-7","title":"Computational management science special issue on “Robust Optimization and Applications”","year":2016,"lang":"en","type":"article","venue":"Computational Management Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Computer science; Robust optimization; Management science; Mathematical optimization; Operations research; Engineering; Mathematics","score_opus":0.01011924166497953,"score_gpt":0.23185884088266523,"score_spread":0.2217395992176857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298490962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066379947,0.000015994407,0.9588554,0.00038909167,0.0004442516,0.000436462,0.0000074493764,0.00023290323,0.038954668],"genre_scores_gemma":[0.1499124,0.000081793376,0.8481551,0.00033137348,0.0007124626,0.000107690445,0.000021713016,0.000025089117,0.00065236865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979295,0.000010301461,0.00025022842,0.00054886803,0.00095139735,0.00030969252],"domain_scores_gemma":[0.99935865,0.000073375086,0.000053469037,0.00020477544,0.00016227538,0.00014742157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004826199,0.00016405048,0.000098861005,0.0006750429,0.0005630107,0.00025266493,0.00045536342,0.000022486493,0.00014662773],"category_scores_gemma":[0.000014497862,0.0001436926,0.000020323827,0.0015196999,0.0007334496,0.00054616283,0.00015958174,0.00005106309,0.0001870416],"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.0000029470348,0.000026012514,0.000049477032,0.00002132842,0.000009210178,0.0000017606203,0.000025335052,0.869933,0.0000033242584,0.066490635,0.00036012792,0.06307685],"study_design_scores_gemma":[0.000493822,0.000019371166,0.0051080743,0.000048946276,0.00001062054,0.0000037127802,0.00006772059,0.9867517,0.00002628219,0.0050558965,0.002194161,0.00021972867],"about_ca_topic_score_codex":3.183723e-7,"about_ca_topic_score_gemma":9.209915e-8,"teacher_disagreement_score":0.14924861,"about_ca_system_score_codex":0.00021297712,"about_ca_system_score_gemma":0.000027613021,"threshold_uncertainty_score":0.5859614},"labels":[],"label_agreement":null},{"id":"W2301530155","doi":"10.2139/ssrn.1668633","title":"Scheduling of a Job Shop with Two Machine Centers Having Parallel Machines","year":2010,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Flow shop scheduling; Parallel computing; Job shop scheduling; Operations management; Engineering; Operating system; Schedule","score_opus":0.004345362079038653,"score_gpt":0.2168148239565853,"score_spread":0.21246946187754664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301530155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62861985,0.001256837,0.36879387,0.00014687686,0.00040378157,0.000072489456,0.0000024570902,0.00013735182,0.00056647847],"genre_scores_gemma":[0.9195718,0.00054369104,0.079448864,0.0000191749,0.00021824596,0.0000029415,0.0000049505156,0.000054486318,0.0001358061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.00002113395,0.00029148933,0.00013368623,0.0002226547,0.0010978411],"domain_scores_gemma":[0.9995325,0.000029260518,0.00008972024,0.00016557904,0.00008198077,0.00010094254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005909484,0.00019035608,0.00021003497,0.00015857472,0.00011412818,0.000050529317,0.00023631199,0.000062539206,0.000045345296],"category_scores_gemma":[0.000033961165,0.00015534917,0.000080800586,0.00020239697,0.00004079591,0.00016498672,0.00001675132,0.0021182236,0.000005755516],"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.00008527011,0.00005527549,0.028635101,0.000029304687,0.0003747206,0.000008788,0.000288981,0.9309424,0.00633688,0.012762859,0.000006091204,0.020474324],"study_design_scores_gemma":[0.0021061061,0.00014241283,0.00053634157,0.00006523989,0.00006636287,0.00091645337,0.000430717,0.99161077,0.0005799878,0.0031450056,0.000050656938,0.00034992304],"about_ca_topic_score_codex":0.00004306082,"about_ca_topic_score_gemma":0.0009053599,"teacher_disagreement_score":0.29095197,"about_ca_system_score_codex":0.000112373265,"about_ca_system_score_gemma":0.00025735743,"threshold_uncertainty_score":0.92027456},"labels":[],"label_agreement":null},{"id":"W2312398210","doi":"10.1061/40513(279)128","title":"Hierarchical Scheduling: Conceptual and Implementation Issues","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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); Schedule; Conceptual framework; Management science; Knowledge management; Engineering; Operations management; Sociology","score_opus":0.012955838266495724,"score_gpt":0.2732656642741894,"score_spread":0.2603098260076937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312398210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9473146,0.00068508956,0.026493756,0.0005728122,0.00021684094,0.00013428973,0.000005615007,0.0008698291,0.023707172],"genre_scores_gemma":[0.6997233,0.0005206478,0.29730156,0.00022861465,0.00035435692,0.000010525988,0.000033950622,0.000024550502,0.001802498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996525,0.000007449919,0.00009631392,0.00007901424,0.000062742765,0.000101968515],"domain_scores_gemma":[0.9998685,0.000013874882,0.0000034202183,0.000051380608,0.000009608143,0.00005320673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000039625986,0.000060206134,0.000057722562,0.000023783978,0.000034952394,0.000030560906,0.000028940607,0.000030665447,0.004161149],"category_scores_gemma":[0.0000028426173,0.00005749338,0.000010808449,0.000058845555,0.000032778255,0.00007142881,0.000003884781,0.00005743701,0.00007158739],"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.000012926444,0.000025343772,0.0016908167,0.000021953292,0.00006570396,0.0000065866625,0.004177467,0.27692494,0.00032957527,0.013055137,0.0038936133,0.69979596],"study_design_scores_gemma":[0.0009987012,0.000050154,0.0013772614,0.000007993069,0.000012468559,0.000014928324,0.0019341568,0.95601255,0.0036255205,0.00031551401,0.035345286,0.0003054599],"about_ca_topic_score_codex":0.0000092303235,"about_ca_topic_score_gemma":0.0000033202748,"teacher_disagreement_score":0.6994905,"about_ca_system_score_codex":0.0000065665076,"about_ca_system_score_gemma":0.0000037179047,"threshold_uncertainty_score":0.99674916},"labels":[],"label_agreement":null},{"id":"W2314795393","doi":"10.1061/40513(279)168","title":"Architecture Issues for Distributed AEC/FM Systems","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"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; Architecture; Scheduling (production processes); Systems engineering; Data exchange; Distributed database; Variety (cybernetics); Modal; Systems architecture; Information system; Distributed computing; Data modeling; Information exchange; Database transaction; Software engineering; Reference architecture; Architecture framework; Database; Engineering; Software architecture; Operating system; Telecommunications","score_opus":0.007651617730765181,"score_gpt":0.21995765918618812,"score_spread":0.21230604145542295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314795393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005070033,0.0008184966,0.98574907,0.00022085167,0.00037508088,0.00022530192,0.000087248176,0.0010931023,0.0063608442],"genre_scores_gemma":[0.57959294,0.0002324161,0.38730735,0.00017976295,0.0013000822,0.00014219624,0.0007970421,0.00014390245,0.030304288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996113,0.000005125811,0.00010561229,0.000082682665,0.000057360456,0.00013791061],"domain_scores_gemma":[0.99979544,0.000024843566,0.0000051035795,0.000107519794,0.000021209256,0.000045911394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000038938815,0.00008046629,0.000092521484,0.000023157256,0.000034681787,0.000044785076,0.00006423279,0.000051823507,0.00041583253],"category_scores_gemma":[0.000008663107,0.000068597,0.000032013664,0.00008804092,0.00000702397,0.000026370415,0.0000021307949,0.000048054946,0.00006763739],"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.0000028543925,0.0000044218873,0.00000778775,0.000025582905,0.000014425626,4.0953026e-7,0.000053204745,0.9860044,0.000017155588,0.00018458626,0.0035346176,0.010150535],"study_design_scores_gemma":[0.0002130691,0.0000114664535,0.0000183349,0.000009698601,0.00000601488,0.000003942577,0.000043371274,0.9150146,0.000487678,0.0000521371,0.0840279,0.00011178061],"about_ca_topic_score_codex":0.000011364131,"about_ca_topic_score_gemma":0.0000015602894,"teacher_disagreement_score":0.5984417,"about_ca_system_score_codex":0.0000128559495,"about_ca_system_score_gemma":0.0000026224584,"threshold_uncertainty_score":0.45530745},"labels":[],"label_agreement":null},{"id":"W2325978006","doi":"10.1115/detc2003/cie-48273","title":"Distributed Management, Monitoring and Control of Manufacturing Shop Floors","year":2003,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Distributed manufacturing; Scheduling (production processes); The Internet; Computer science; Key (lock); Manufacturing engineering; Control (management); Robot; Manufacturing execution system; Monitoring and control; Process (computing); Systems engineering; Computer-integrated manufacturing; Engineering; Artificial intelligence; Control engineering; World Wide Web; Computer security; Operating system; Operations management","score_opus":0.006932868896693756,"score_gpt":0.20318271547114064,"score_spread":0.19624984657444688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325978006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20494795,0.00027391882,0.78732044,0.000008592587,0.0002838452,0.000089244044,0.000006059345,0.00022151912,0.006848425],"genre_scores_gemma":[0.9528296,0.00009994686,0.0469284,0.0000027623316,0.000014149107,0.0000041035746,0.0000022150077,0.000010824921,0.00010799026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996438,0.0000068348827,0.000112684786,0.00007157781,0.0000589215,0.00010618438],"domain_scores_gemma":[0.99984545,0.000017612696,0.000010984073,0.00008044665,0.000009848561,0.000035667425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000057007936,0.00007018699,0.00008597851,0.00004382687,0.000021642463,0.000014550045,0.000033059438,0.000027111271,0.000030405949],"category_scores_gemma":[0.000006714079,0.0000681474,0.000016127024,0.000053629974,0.000009507713,0.000045376437,0.000005220685,0.000040975425,0.0000030851459],"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.000007845099,0.000028418131,0.009638419,0.00021509994,0.00028342629,0.000011491615,0.00012649244,0.9725147,0.0007690184,0.0035306055,0.000060329363,0.012814178],"study_design_scores_gemma":[0.0030724383,0.000024377681,0.0106901685,0.00008505064,0.000102016624,0.000011269461,0.0012458223,0.28229544,0.700178,0.00035992573,0.0014150179,0.00052041886],"about_ca_topic_score_codex":0.0000011256055,"about_ca_topic_score_gemma":1.1403671e-7,"teacher_disagreement_score":0.74788165,"about_ca_system_score_codex":0.000010348253,"about_ca_system_score_gemma":9.3969675e-7,"threshold_uncertainty_score":0.27789703},"labels":[],"label_agreement":null},{"id":"W2338430224","doi":"10.1080/03155986.2016.1166795","title":"Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints","year":2016,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Mathematical optimization; Minification; Computer science; Computation; Integer programming; Scheduling (production processes); Heuristic; Linear programming; Single-machine scheduling; Mathematics; Algorithm; Schedule","score_opus":0.03015870374752165,"score_gpt":0.28405731617870883,"score_spread":0.25389861243118717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338430224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20621893,0.0002895316,0.78813976,0.00022959792,0.00017746548,0.0018364427,0.0004970061,0.000098744065,0.0025125113],"genre_scores_gemma":[0.96505946,0.00011603444,0.034105085,0.000017354907,0.00004292861,0.000204417,0.00014248611,0.000013257603,0.0002989876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860036,0.000032229767,0.0005611307,0.00012380512,0.0004369393,0.00024551977],"domain_scores_gemma":[0.9982356,0.00045165807,0.00007838822,0.00014906404,0.00097029074,0.00011498667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010926087,0.00013058513,0.00019819719,0.00024064699,0.00023967316,0.00021321316,0.000082880106,0.00010399158,0.000027755803],"category_scores_gemma":[0.00042221224,0.00009071816,0.000020164385,0.00019477535,0.00018660876,0.0012494844,0.000028807877,0.000100209996,0.000011129068],"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.00039779634,0.000028258404,0.029644866,0.0012212167,0.00012074011,3.9325573e-7,0.00156852,0.94554883,0.0009766032,0.0074588927,0.00062584487,0.012408014],"study_design_scores_gemma":[0.0023455392,0.00009422296,0.0028494922,0.00020315882,0.0000049400487,0.000009346686,0.0006056335,0.99020433,0.0006729809,0.000019911626,0.0028413674,0.00014908717],"about_ca_topic_score_codex":0.0000893403,"about_ca_topic_score_gemma":0.000021395905,"teacher_disagreement_score":0.7588405,"about_ca_system_score_codex":0.00005867876,"about_ca_system_score_gemma":0.00012475619,"threshold_uncertainty_score":0.36993793},"labels":[],"label_agreement":null},{"id":"W2345289418","doi":"10.5220/0005710701520156","title":"Mixed Integer Program Heuristic for Linear Ordering Problem","year":2016,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Integer programming; Integer (computer science); Heuristic; Computer science; Mathematical optimization; Linear programming; Algorithm; Mathematics; Theoretical computer science; Programming language","score_opus":0.019278224380232564,"score_gpt":0.2437451076151228,"score_spread":0.22446688323489022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345289418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020539043,0.000036419162,0.9934516,0.00015641666,0.00030746323,0.00032400782,0.0000037827456,0.0013440765,0.0023223213],"genre_scores_gemma":[0.115473114,0.0000171653,0.8821428,0.000021800754,0.00014015213,0.00021348389,0.0000059690515,0.000044030916,0.0019414958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995044,0.000003913301,0.00014016918,0.0001122544,0.000055028584,0.00018426566],"domain_scores_gemma":[0.9997077,0.000059680246,0.000010882358,0.000106272644,0.00006120942,0.000054242286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007128814,0.000091866554,0.0000877731,0.000040937026,0.000027985061,0.000021012522,0.00006947827,0.000047758862,0.000091966554],"category_scores_gemma":[0.00005792495,0.00006014588,0.000036448757,0.000086355576,0.0000128746115,0.000057224894,0.000010636288,0.000035569887,0.00006576613],"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.000023854185,0.000119778546,0.00022001498,0.0002948051,0.00012103895,0.0000026174205,0.00022343005,0.20238815,0.0013421066,0.0043101353,0.005023679,0.7859304],"study_design_scores_gemma":[0.00057150656,0.00005846888,0.000017583212,0.00005383748,0.00000892914,0.0000025041795,0.000032289805,0.9769116,0.0043835137,0.00023210072,0.017539201,0.00018843185],"about_ca_topic_score_codex":0.0000012500265,"about_ca_topic_score_gemma":0.0000029643363,"teacher_disagreement_score":0.7857419,"about_ca_system_score_codex":0.0000204194,"about_ca_system_score_gemma":0.000007837104,"threshold_uncertainty_score":0.24526778},"labels":[],"label_agreement":null},{"id":"W2353895277","doi":"","title":"15th IFAC Symposium on Information Control Problems in Manufacturing (INCOM 2015) : Ottawa, Canada 11-13 May 2015","year":2016,"lang":"en","type":"book","venue":"Elsevier eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Control (management); Computer science; Library science; Operations research; Engineering; Artificial intelligence","score_opus":0.004184000612489409,"score_gpt":0.18885690260878724,"score_spread":0.18467290199629782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353895277","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008968919,0.000398373,0.0010335653,0.00039636056,0.002445813,0.0012467618,0.00028889262,0.00036795327,0.9937326],"genre_scores_gemma":[0.0047749896,0.00011419455,0.0010305324,0.00063593267,0.0006230961,0.00022931489,0.00030429248,0.0001878158,0.9920998],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99764663,0.000048765247,0.0008743544,0.00030505605,0.00055902527,0.000566166],"domain_scores_gemma":[0.99880946,0.00011310625,0.00023785641,0.00052936113,0.00009401722,0.0002162313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000323638,0.000601667,0.00062324834,0.000375942,0.000081508275,0.00011076767,0.00036984985,0.00043462604,0.00010773349],"category_scores_gemma":[0.000018294959,0.00053535064,0.00010805403,0.000031425105,0.00003601326,0.00020959886,0.000039598082,0.00063384377,0.00021073408],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020379977,0.000014123445,0.000090771005,0.0008907876,0.00022740055,0.0000321333,0.0005871208,0.45401824,0.0000075925873,0.00009380245,0.040835876,0.50318176],"study_design_scores_gemma":[0.0014493797,0.000031048363,0.00006165532,0.0011393507,0.00004439181,0.0000080010495,0.000011741418,0.012634754,0.00016962108,0.00009894347,0.98357195,0.0007791548],"about_ca_topic_score_codex":0.0012483122,"about_ca_topic_score_gemma":0.059624948,"teacher_disagreement_score":0.9427361,"about_ca_system_score_codex":0.0013699535,"about_ca_system_score_gemma":0.00069425185,"threshold_uncertainty_score":0.9997098},"labels":[],"label_agreement":null},{"id":"W2361742132","doi":"","title":"LOT SIZING WITH NON-ZERO SETUP TIMES FOR REWORK","year":2008,"lang":"en","type":"article","venue":"系统科学与系统工程学报(英文版)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Rework; Sizing; Scheduling (production processes); Product (mathematics); Batch production; Production (economics); Computer science; Reliability engineering; Mathematical optimization; Engineering; Operations management; Mathematics; Economics","score_opus":0.010941428896522819,"score_gpt":0.20127222134062028,"score_spread":0.19033079244409745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2361742132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10220663,0.0010628445,0.87769353,0.00026599213,0.0010059619,0.0006290358,0.000036258974,0.0016867167,0.015413025],"genre_scores_gemma":[0.62396026,0.0001407277,0.3718783,0.00022897402,0.00040953263,0.0000955626,0.00006259499,0.0001435858,0.0030804933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989408,0.000009331557,0.00023017543,0.0002503608,0.00018763401,0.00038167398],"domain_scores_gemma":[0.9993424,0.00010191509,0.00004057665,0.00030636336,0.00008415569,0.00012460866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107325875,0.00022989232,0.00024298311,0.000102492966,0.0001965889,0.000041265004,0.00017312948,0.0001229257,0.0000993292],"category_scores_gemma":[0.000038624534,0.00021047684,0.00007475349,0.00030743016,0.000051148094,0.00014932711,0.00001918014,0.00017271016,0.00011940002],"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.00013556551,0.000115970906,0.0026989754,0.00024524092,0.0003112372,0.00007928986,0.005112317,0.9367922,0.0005626632,0.0006355286,0.042832565,0.010478448],"study_design_scores_gemma":[0.0030154083,0.00030124877,0.0014719028,0.00026524064,0.00009556218,0.00015503618,0.00052723684,0.95148593,0.011085774,0.0003004972,0.03005283,0.001243322],"about_ca_topic_score_codex":0.000014398418,"about_ca_topic_score_gemma":0.000006931141,"teacher_disagreement_score":0.5217536,"about_ca_system_score_codex":0.000047098656,"about_ca_system_score_gemma":0.000035521643,"threshold_uncertainty_score":0.8582996},"labels":[],"label_agreement":null},{"id":"W2363612583","doi":"","title":"Deadlock-free Scheduling of Photolithography Equipment","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Photolithography; Computer science; Wafer fabrication; Bottleneck; Scheduling (production processes); Semiconductor device fabrication; Lithography; Deadlock; Schedule; Wafer; Embedded system; Distributed computing; Materials science; Nanotechnology; Engineering; Operating system","score_opus":0.011085316823231418,"score_gpt":0.20951138226733557,"score_spread":0.19842606544410415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2363612583","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038055357,0.00047719514,0.9596938,0.00003533802,0.000028206354,0.0002699608,0.000015823278,0.0003580865,0.0010662463],"genre_scores_gemma":[0.13423508,0.0000897773,0.8653086,0.000052761257,0.00008890309,0.00015362268,0.000023285314,0.000023888011,0.00002408785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993126,0.000006817891,0.0002571934,0.00015668404,0.000101531776,0.00016518214],"domain_scores_gemma":[0.9994604,0.000024953673,0.00003569327,0.00033811238,0.00007312609,0.000067689456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004532464,0.00011749251,0.00013933811,0.00014069985,0.000094963216,0.0000109638695,0.00029607088,0.00005501916,0.000020973815],"category_scores_gemma":[4.3007887e-7,0.00012955176,0.000077775556,0.00040506394,0.00005114835,0.00004676612,0.000052775424,0.00009101637,0.00003335612],"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.000009295962,0.00048074074,0.0039208974,0.00030318688,0.0003574625,0.000006581986,0.002243363,0.84920895,0.05549276,0.0036480841,0.004254791,0.0800739],"study_design_scores_gemma":[0.0023612909,0.000057356585,0.0044164816,0.0000947989,0.00007620327,0.0001840035,0.00014121526,0.6186666,0.23039861,0.0015521905,0.14089514,0.0011561401],"about_ca_topic_score_codex":0.0000043771065,"about_ca_topic_score_gemma":5.778291e-7,"teacher_disagreement_score":0.23054238,"about_ca_system_score_codex":0.000019507217,"about_ca_system_score_gemma":0.000015201517,"threshold_uncertainty_score":0.5282967},"labels":[],"label_agreement":null},{"id":"W2366430554","doi":"","title":"A Research on Manufacturing Production Activity Control and Scheduling","year":2012,"lang":"en","type":"article","venue":"International Business Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Manufacturing engineering; Computer science; Production (economics); Control (management); Business; Process management; Manufacturing process; Process (computing); Operations management; Engineering; Economics; Microeconomics","score_opus":0.07660421970629704,"score_gpt":0.37460035763879934,"score_spread":0.2979961379325023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366430554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811983,0.00021718584,0.009360721,0.0020147688,0.0014428714,0.0002389005,0.0000058851874,0.00016296678,0.005358416],"genre_scores_gemma":[0.9953464,0.00015598528,0.002759104,0.000013518368,0.0012450619,0.00006622274,0.000006721647,0.000031612148,0.00037532763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9980168,0.00014148538,0.00012673065,0.00021939956,0.0010108851,0.00048475392],"domain_scores_gemma":[0.99863535,0.00034476616,0.000013674737,0.00017759652,0.00070622284,0.00012239713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022035947,0.00010348055,0.00009905835,0.00072186993,0.00023368515,0.00015850956,0.00019040062,0.000086288375,0.000075351556],"category_scores_gemma":[0.00055416906,0.00009982741,0.000017821227,0.00047700596,0.00011324217,0.0004459643,0.000069063004,0.0007013584,0.00014901126],"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.0004959874,0.0005386612,0.011837076,0.00026475466,0.00027857,0.000018802775,0.0008951072,0.86426246,0.021914357,0.0018647842,0.0015168474,0.09611261],"study_design_scores_gemma":[0.0019889327,0.000072554496,0.4508379,0.00042221523,0.000010988094,0.00007952001,0.0008310852,0.42718506,0.10829627,0.0006529059,0.008965494,0.0006570733],"about_ca_topic_score_codex":0.000038589773,"about_ca_topic_score_gemma":0.0000030337667,"teacher_disagreement_score":0.43900084,"about_ca_system_score_codex":0.00020878809,"about_ca_system_score_gemma":0.00002663641,"threshold_uncertainty_score":0.40708438},"labels":[],"label_agreement":null},{"id":"W2371858851","doi":"","title":"The Study of Job Shop Scheduling with Hybrid Genetic Algorithms","year":2001,"lang":"en","type":"article","venue":"Systems Enging-theory Methodology Application","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Simulated annealing; Computer science; Job shop scheduling; Genetic algorithm; Scheduling (production processes); Flow shop scheduling; Algorithm; Mathematical optimization; Mathematics; Machine learning; Embedded system","score_opus":0.03402647511442157,"score_gpt":0.28480551426814577,"score_spread":0.2507790391537242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371858851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24505273,0.0013670578,0.75186557,0.000014000921,0.00038329966,0.0007423578,0.0000016719962,0.00030492898,0.00026837326],"genre_scores_gemma":[0.839521,0.00011199928,0.15946646,0.000006998673,0.00020431724,0.0005111947,0.0000064631536,0.0000660518,0.00010550788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976134,0.00093747326,0.00056199485,0.00033091137,0.00023108961,0.0003251785],"domain_scores_gemma":[0.9974653,0.0014706056,0.00016949861,0.00065341935,0.0001659661,0.00007517349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003304659,0.00023641551,0.0003575212,0.00014975398,0.0002351273,0.000037922913,0.0003433872,0.00010881634,0.000005310815],"category_scores_gemma":[0.00016561113,0.00017945589,0.000044316574,0.00046177523,0.00009735031,0.00006133391,0.000027286102,0.00026410434,0.000015427855],"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.000050849503,0.000044586784,0.0012412444,0.00004473344,0.00017008965,0.000004382144,0.00076396595,0.966045,0.0006956692,0.0031700684,0.000005868958,0.02776353],"study_design_scores_gemma":[0.000820606,0.00016437196,0.0009760775,0.000037016118,0.00011213172,0.00017599699,0.0047858288,0.990244,0.000973841,0.0010087173,0.0003937202,0.00030770304],"about_ca_topic_score_codex":0.00002470368,"about_ca_topic_score_gemma":0.000006026038,"teacher_disagreement_score":0.5944683,"about_ca_system_score_codex":0.000055513214,"about_ca_system_score_gemma":0.000021629592,"threshold_uncertainty_score":0.7317999},"labels":[],"label_agreement":null},{"id":"W2372618435","doi":"","title":"Research on Multi-objective Flexible Scheduling of Workshop Based on the Demand Priority","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Rate-monotonic scheduling; Job shop scheduling; Fair-share scheduling; Dynamic priority scheduling; Flow shop scheduling; Earliest deadline first scheduling; Two-level scheduling; Least slack time scheduling; Scheduling (production processes); Round-robin scheduling; Deadline-monotonic scheduling; Distributed computing; Mathematical optimization; Operations research; Schedule; Operating system; Engineering; Mathematics","score_opus":0.04154526720589182,"score_gpt":0.32253889766723715,"score_spread":0.28099363046134535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2372618435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008016974,0.00008289564,0.98921126,0.0006680114,0.000019547471,0.0005948736,0.000006567311,0.00021665372,0.0011832129],"genre_scores_gemma":[0.5045089,0.000011327389,0.4948941,0.00026669996,0.00011187226,0.00012785729,0.000010644079,0.000017263108,0.00005130925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991261,0.00005649359,0.00019179711,0.00022254801,0.00018903447,0.00021405597],"domain_scores_gemma":[0.9989889,0.0003944751,0.000028951381,0.00037397485,0.0001597972,0.000053894393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004138876,0.00011918369,0.000119461256,0.00018986182,0.00021755631,0.000051463485,0.00028592427,0.00008117449,0.000013009208],"category_scores_gemma":[0.0000047524263,0.00009808594,0.000054010514,0.00072801556,0.000049927858,0.00003122093,0.000018735807,0.00038956967,0.00006419499],"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.0000073483898,0.00016855937,0.000020466123,0.000010394528,0.000012089302,2.0731703e-7,0.00019963813,0.9720605,0.0016467735,0.0016612218,0.00024771286,0.023965096],"study_design_scores_gemma":[0.00033317652,0.000040532264,0.0011333136,0.00006191249,0.000005551561,6.324331e-7,0.00010300573,0.96226424,0.033347815,0.0002792157,0.002304671,0.00012591504],"about_ca_topic_score_codex":0.000002069809,"about_ca_topic_score_gemma":9.0189747e-7,"teacher_disagreement_score":0.49649194,"about_ca_system_score_codex":0.00006323079,"about_ca_system_score_gemma":0.00002955503,"threshold_uncertainty_score":0.39998284},"labels":[],"label_agreement":null},{"id":"W2375969452","doi":"","title":"Object—oriented Intelligent Simulation for FMS Scheduling","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Scheduling (production processes); Computer science; Object-oriented programming; Real-time computing; Distributed computing; Engineering drawing; Engineering; Operations management; Operating system","score_opus":0.015429935774869438,"score_gpt":0.25596841209000404,"score_spread":0.2405384763151346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2375969452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03724285,0.00009318496,0.9560656,0.000021661972,0.00029041833,0.0002061312,0.0000027585404,0.00065517065,0.0054222387],"genre_scores_gemma":[0.64057153,0.00003850152,0.3576285,0.00007868081,0.00015676174,0.000027818376,0.00003898196,0.00003312619,0.0014261156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947435,0.000004805499,0.00017690485,0.00011221054,0.00007689122,0.00015483529],"domain_scores_gemma":[0.99971455,0.00006790011,0.00000905765,0.000106695385,0.00004900238,0.00005276971],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000075560165,0.00009146632,0.000081596554,0.00005094556,0.000052733754,0.000028084229,0.000049528506,0.000056717054,0.0010832467],"category_scores_gemma":[0.000030311774,0.000089810695,0.000048876915,0.00015043392,0.000007355616,0.000077555706,0.0000029969108,0.000054112927,0.00012867975],"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.000009963482,0.000008370374,0.0000184413,0.000008844401,0.000012007111,1.3762988e-7,0.00011969436,0.9567466,0.000025788024,0.00014251593,0.000030098594,0.042877574],"study_design_scores_gemma":[0.00036058223,0.000014829456,0.000018832183,0.000008956236,0.0000072268554,4.900426e-7,0.00006845533,0.9921538,0.0028745905,0.00006459554,0.004308969,0.00011865555],"about_ca_topic_score_codex":0.0000023930363,"about_ca_topic_score_gemma":0.0000013027495,"teacher_disagreement_score":0.60332865,"about_ca_system_score_codex":0.000030176006,"about_ca_system_score_gemma":0.000006000221,"threshold_uncertainty_score":0.9998299},"labels":[],"label_agreement":null},{"id":"W2379257414","doi":"","title":"A Deadlock Free Scheduling of Flexible Manufacturing System Based on Beam Search and Banker's Algorithm","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Deadlock; Computation; Scheduling (production processes); Distributed computing; Algorithm; Heuristic; Dynamic priority scheduling; Mathematical optimization; Quality of service; Computer network","score_opus":0.010578037600939533,"score_gpt":0.20646992421052673,"score_spread":0.1958918866095872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2379257414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034989443,0.00021580706,0.96347964,0.000030965366,0.00003136326,0.00036490857,0.0000327686,0.0004717199,0.00038341398],"genre_scores_gemma":[0.21820945,0.000013809235,0.7814095,0.00003655167,0.00011389573,0.00012395118,0.000025721907,0.000034825924,0.000032280408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991149,0.000012828125,0.0002553934,0.00025123678,0.00015171788,0.00021397785],"domain_scores_gemma":[0.99937856,0.00006373089,0.000027944781,0.00036833144,0.00006194061,0.00009949427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008558419,0.00016112468,0.0001839898,0.00019254466,0.00016800303,0.00002820308,0.00022936959,0.00008254796,0.000009309067],"category_scores_gemma":[3.913527e-7,0.00017491708,0.00005034966,0.00020867717,0.000048013982,0.00005046809,0.00005292214,0.00016145634,0.000027402368],"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.0000027566134,0.000052436706,0.00007827653,0.00014673913,0.00003695087,0.000002831852,0.00020944087,0.95576274,0.0007263386,0.00013787147,0.00008936129,0.04275424],"study_design_scores_gemma":[0.0004823968,0.000019302724,0.00056226086,0.00006256516,0.000011732585,0.0000342291,0.00005962115,0.91693467,0.08067106,0.0000090363055,0.0009729942,0.00018011115],"about_ca_topic_score_codex":0.000016259357,"about_ca_topic_score_gemma":3.4399142e-7,"teacher_disagreement_score":0.18322,"about_ca_system_score_codex":0.000058379035,"about_ca_system_score_gemma":0.000023213668,"threshold_uncertainty_score":0.71329117},"labels":[],"label_agreement":null},{"id":"W2395529118","doi":"10.3233/978-1-61499-098-7-774","title":"Logic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups","year":2012,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"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; Sequence (biology); Benders' decomposition; Scheduling (production processes); Decomposition; Resource (disambiguation); Mathematical optimization; Mathematics; Chemistry; Computer network","score_opus":0.050680935777113044,"score_gpt":0.284458787353464,"score_spread":0.23377785157635098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395529118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00002585186,0.0013483483,0.9925752,0.00009770447,0.00015593602,0.00081290386,0.00010784495,0.00012877997,0.0047473754],"genre_scores_gemma":[0.068758346,0.0011063459,0.924762,0.0002715317,0.00079259614,0.0012349808,0.0009856024,0.00019504514,0.0018935621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998894,0.00000848291,0.00035644136,0.00034022695,0.00015073024,0.00025011555],"domain_scores_gemma":[0.9994236,0.00007468213,0.00010353233,0.0002141686,0.00008075651,0.00010322138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015004585,0.0002649403,0.0002497486,0.00023145032,0.0001474172,0.000060104103,0.00016604728,0.00021191507,0.000020360463],"category_scores_gemma":[0.00000675923,0.00027613807,0.0000515941,0.00008352447,0.00013625808,0.00008752787,0.000014308982,0.000289854,0.0000124499065],"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.000033959597,0.00002617762,0.000017650455,0.00006808935,0.000053340864,0.0000013543406,0.00017125848,0.8378068,0.00004218011,0.05405826,0.00004568184,0.10767522],"study_design_scores_gemma":[0.00008502478,0.000054248532,0.0000010431037,0.00019587016,0.000093882765,0.0000043709115,0.0005713935,0.9076933,0.0056546954,0.07799386,0.0070742294,0.00057804823],"about_ca_topic_score_codex":0.0000051168076,"about_ca_topic_score_gemma":0.000019220843,"teacher_disagreement_score":0.107097164,"about_ca_system_score_codex":0.00014018857,"about_ca_system_score_gemma":0.00003369048,"threshold_uncertainty_score":0.99996907},"labels":[],"label_agreement":null},{"id":"W2397645628","doi":"10.1080/03155986.2001.11732429","title":"A Due-Window Determination In Minmax Scheduling Problems","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Mathematical optimization; Minimax; Scheduling (production processes); Computer science; Upper and lower bounds; Interval (graph theory); Due date; Schedule; Single-machine scheduling; Heuristic; Mathematics; Job shop scheduling; Algorithm; Combinatorics","score_opus":0.041657947316307425,"score_gpt":0.3063424480025656,"score_spread":0.26468450068625815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397645628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7969826,0.0011115379,0.14664628,0.000499103,0.00095263665,0.002224206,0.00004067643,0.00038451437,0.05115848],"genre_scores_gemma":[0.9934549,0.00020679389,0.005524201,0.000049719194,0.00011303669,0.0002336664,0.00011873877,0.000011514465,0.0002874453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984439,0.00004468164,0.00055032957,0.00008970685,0.0005937094,0.00027768302],"domain_scores_gemma":[0.9991508,0.00012475117,0.00003423216,0.00011137447,0.00048452325,0.000094277726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013423983,0.00011019113,0.00013336947,0.00066885934,0.00018743175,0.00057265634,0.00010437743,0.00012098962,0.00003258899],"category_scores_gemma":[0.000201716,0.00010571846,0.000018529347,0.00059919927,0.000038978033,0.0020763993,0.000028542881,0.00026643527,0.0001261148],"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.000012527945,0.000010536226,0.002660146,0.00015979171,0.000008646133,0.0000029500513,0.0021384775,0.9731268,0.000060531576,0.0047841417,0.00010673931,0.016928669],"study_design_scores_gemma":[0.00055080233,0.000025538871,0.0024362789,0.00010025964,9.157467e-7,0.00005090776,0.0011604422,0.98205936,0.00005302904,0.000028722554,0.013403515,0.00013020787],"about_ca_topic_score_codex":0.000099272474,"about_ca_topic_score_gemma":0.000025682963,"teacher_disagreement_score":0.1964723,"about_ca_system_score_codex":0.00012504216,"about_ca_system_score_gemma":0.0000786088,"threshold_uncertainty_score":0.55221385},"labels":[],"label_agreement":null},{"id":"W2398344949","doi":"10.1080/03155986.2002.11732657","title":"Algorithme D’optimisation Par Colonie De Fourmis Avec Matrices De Visibilité Multiples Pour La Résolution D’un Problème D’ordonnancement industriel","year":2002,"lang":"fr","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Scheduling (production processes); Ant colony optimization algorithms; Job shop scheduling; Mathematical optimization; Parallel computing; Algorithm; Mathematics; Schedule","score_opus":0.04868736254836448,"score_gpt":0.29334984440337064,"score_spread":0.24466248185500616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398344949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13563411,0.009719423,0.81841177,0.013990872,0.0015234546,0.004095702,0.00073904597,0.0004281253,0.015457471],"genre_scores_gemma":[0.839219,0.0048357835,0.14766654,0.0001997384,0.00088882574,0.0007553808,0.00040818847,0.000052838725,0.0059737395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964754,0.00037406932,0.0010872526,0.00023288873,0.0010788905,0.00075149233],"domain_scores_gemma":[0.99734414,0.00059769425,0.00019059483,0.00023939548,0.0012947412,0.0003334656],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037567806,0.00029550414,0.00028288574,0.00054218457,0.00075945066,0.0014366561,0.00022596134,0.0005732111,0.00033886242],"category_scores_gemma":[0.00082845695,0.00031288536,0.00007024402,0.0006968892,0.00016477607,0.002576818,0.00008762312,0.0007195176,0.00031742456],"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.00003733968,0.00011698433,0.0014786175,0.0007005969,0.0001273254,0.000007696815,0.01520416,0.8589345,0.00008017661,0.023883963,0.0063955225,0.09303311],"study_design_scores_gemma":[0.0012961228,0.00009985921,0.001522849,0.00033685908,0.000017809174,0.0001655345,0.0023473315,0.9298168,0.00034279606,0.00008392356,0.063663945,0.00030616176],"about_ca_topic_score_codex":0.0012232981,"about_ca_topic_score_gemma":0.000018772258,"teacher_disagreement_score":0.70358485,"about_ca_system_score_codex":0.0009181122,"about_ca_system_score_gemma":0.00048112994,"threshold_uncertainty_score":0.99993235},"labels":[],"label_agreement":null},{"id":"W2400713680","doi":"10.14288/1.0075216","title":"Evolution programs, simulated annealing and hill climbing applied to harvest scheduling problems","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hill climbing; Simulated annealing; Computer science; Scheduling (production processes); Mathematical optimization; Mathematics; Algorithm","score_opus":0.007612869292755537,"score_gpt":0.16673526426828264,"score_spread":0.1591223949755271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400713680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9425534,0.00022264228,0.055810697,0.000039201223,0.00008391453,0.00033394134,0.000012812571,0.0004624522,0.00048095742],"genre_scores_gemma":[0.96764696,0.000046547273,0.032157343,0.000025009189,0.00003069701,3.8981185e-7,0.000029316203,0.00001795192,0.00004580335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991481,0.000016786522,0.00014751141,0.00027896324,0.00014839014,0.00026027713],"domain_scores_gemma":[0.9995089,0.0000166965,0.0000476582,0.0001417438,0.00011395218,0.00017105785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019329794,0.000058589798,0.0002041987,0.00007207488,0.00019401716,0.00015460157,0.00013014431,0.00011903669,0.000007648485],"category_scores_gemma":[0.00002030251,0.00020627039,0.000042371983,0.00042261276,0.000047146925,0.0002220287,0.000031683776,0.00014337164,0.000007987032],"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.0000043218706,0.000039676903,0.0016013711,0.000065427186,0.000020585006,0.000010945943,0.00030156193,0.5862575,0.00081969943,0.0000046966784,0.00003245901,0.41084173],"study_design_scores_gemma":[0.0008651096,0.00007795637,0.37192345,0.00028485243,0.00002996427,0.00001667861,0.0009137533,0.62540317,0.0000043825517,0.00013725547,0.000040923274,0.0003025099],"about_ca_topic_score_codex":0.002725909,"about_ca_topic_score_gemma":0.0053536333,"teacher_disagreement_score":0.4105392,"about_ca_system_score_codex":0.00007859,"about_ca_system_score_gemma":0.000017176184,"threshold_uncertainty_score":0.84114623},"labels":[],"label_agreement":null},{"id":"W2401877381","doi":"10.1080/03155986.2000.11732403","title":"Continuous-Time Models For Production Scheduling In Constrained Subcontracting Conditions","year":2000,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Production (economics); Computer science; Operations management; Economics; Microeconomics","score_opus":0.034820828632640785,"score_gpt":0.3059532147854689,"score_spread":0.2711323861528281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401877381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87359965,0.0004347088,0.07503824,0.00078915997,0.0007082156,0.004078658,0.00032851243,0.00047968264,0.044543184],"genre_scores_gemma":[0.9902514,0.00007585997,0.007860433,0.00004270596,0.00016766711,0.00043744282,0.0004129946,0.00001309397,0.00073837076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986778,0.00003656629,0.00056370074,0.00010320605,0.0003484424,0.00027031713],"domain_scores_gemma":[0.9990091,0.00022094895,0.000031333773,0.000094844785,0.0005649438,0.000078879224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001388016,0.00010540391,0.00015757915,0.000352003,0.0003057159,0.00039971503,0.000069837195,0.00010580995,0.00009288715],"category_scores_gemma":[0.00024720666,0.00010669894,0.000025017302,0.00027769344,0.000071858674,0.0024648597,0.0000073690903,0.00020883902,0.000088890316],"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.00002005114,0.0000068812856,0.00004861353,0.00006746834,0.000012258162,1.9533854e-7,0.001001301,0.9874268,0.00009437753,0.0069215656,0.00022469026,0.0041757617],"study_design_scores_gemma":[0.0006418749,0.000023668952,0.00008479769,0.000082773775,0.0000019972583,0.000018581983,0.0017701021,0.99330986,0.00011310395,0.00011680925,0.0037130893,0.00012333892],"about_ca_topic_score_codex":0.000047743466,"about_ca_topic_score_gemma":0.0000047386175,"teacher_disagreement_score":0.11665179,"about_ca_system_score_codex":0.00008490579,"about_ca_system_score_gemma":0.00010008514,"threshold_uncertainty_score":0.43510568},"labels":[],"label_agreement":null},{"id":"W2404050011","doi":"10.1080/03155986.2001.11732441","title":"The Basic Cyclic Scheduling Model For Robotic Flow Shops","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Robot; Scheduling (production processes); Computer science; Production cycle; Context (archaeology); Simulation; Engineering; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.058193936655970634,"score_gpt":0.31705310276186954,"score_spread":0.25885916610589893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404050011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007837575,0.0005293042,0.9852777,0.0004804306,0.00044735117,0.00084398256,0.000021716385,0.00013042992,0.0044315215],"genre_scores_gemma":[0.96826607,0.0006941261,0.027858153,0.00014922956,0.0003436956,0.00068426883,0.00022559366,0.000025724788,0.0017531503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985844,0.000024880646,0.00046509106,0.000078985104,0.000530056,0.0003166084],"domain_scores_gemma":[0.9986441,0.00034611727,0.00002991782,0.00015599631,0.000717672,0.000106206564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014717766,0.00010767649,0.00011122115,0.00018756386,0.00087131676,0.0010086453,0.00015267699,0.00009120423,0.000006922633],"category_scores_gemma":[0.00032226843,0.00008046806,0.000033892047,0.00027669792,0.0000551815,0.0011984748,0.000028775457,0.00020218459,0.000066842],"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.000012736941,0.0000022046981,0.000044596527,0.000044754277,0.000014890719,9.216354e-8,0.00047995785,0.9798923,0.0000066510756,0.012816399,0.00073025085,0.005955174],"study_design_scores_gemma":[0.00035543105,0.000016448634,0.00004941329,0.000028372382,0.000002283339,0.000012360161,0.00074465794,0.9833263,0.000013485665,0.00008202547,0.01526715,0.00010208014],"about_ca_topic_score_codex":0.000014485823,"about_ca_topic_score_gemma":0.0000098770315,"teacher_disagreement_score":0.9604285,"about_ca_system_score_codex":0.00007804331,"about_ca_system_score_gemma":0.000109162684,"threshold_uncertainty_score":0.972639},"labels":[],"label_agreement":null},{"id":"W2405454180","doi":"","title":"Solving Distributed Constraint Optimization Problems - An Evolutionary Approach.","year":2011,"lang":"en","type":"article","venue":"International Conference on Agents and Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Mathematical optimization; Constraint (computer-aided design); Evolutionary computation; Constrained optimization; Artificial intelligence; Mathematics","score_opus":0.12868525789234414,"score_gpt":0.2848074341875055,"score_spread":0.15612217629516134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405454180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052963495,0.000019900861,0.97484666,0.00007408587,0.00058164436,0.0001518432,0.000066895045,0.00022716042,0.018735481],"genre_scores_gemma":[0.90407497,0.0001254847,0.09537887,0.00006185218,0.00008251959,0.00002300292,0.00020553388,0.000016434971,0.000031330008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990334,0.000024501855,0.00030554138,0.00025949365,0.00020332134,0.00017377589],"domain_scores_gemma":[0.99952066,0.000014483066,0.000052286505,0.00012305929,0.00017299518,0.00011648767],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011113154,0.00015898964,0.00010800724,0.00010939509,0.00010395916,0.00012260811,0.00021097135,0.000076852564,0.0010990168],"category_scores_gemma":[0.000033472123,0.00015814495,0.000029480469,0.0001060616,0.00011241265,0.0002678627,0.000028096449,0.00014627208,0.000028935827],"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.000022001128,0.00018204369,0.00012488934,0.00001044865,0.00004077613,0.00000435703,0.0009961611,0.8525014,0.00008947331,0.12326757,0.000032909185,0.022727996],"study_design_scores_gemma":[0.000033650143,0.000050559385,0.00017668109,0.00003428795,0.0000062897207,0.0000079085485,0.0008624058,0.993439,0.00058182067,0.004579866,0.000040830982,0.00018670429],"about_ca_topic_score_codex":0.00002313309,"about_ca_topic_score_gemma":0.0000028015959,"teacher_disagreement_score":0.8987786,"about_ca_system_score_codex":0.000041732907,"about_ca_system_score_gemma":0.00002079621,"threshold_uncertainty_score":0.9998141},"labels":[],"label_agreement":null},{"id":"W2408639249","doi":"","title":"A Knowledge-Migration-Based Multi-Population Cultural Algorithm to Solve Job Shop Scheduling.","year":2012,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Benchmark (surveying); Population; Computer science; Job shop scheduling; Cultural algorithm; Mathematical optimization; Convergence (economics); Evolutionary algorithm; Local search (optimization); Artificial intelligence; Algorithm; Machine learning; Population-based incremental learning; Mathematics; Genetic algorithm; Geography","score_opus":0.07223342214139727,"score_gpt":0.3728766543825901,"score_spread":0.3006432322411928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408639249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13929285,0.0016064477,0.8526354,0.0022219878,0.002001128,0.00095523783,0.000034317178,0.0008639987,0.00038866745],"genre_scores_gemma":[0.49314934,0.0001273876,0.5021595,0.00033868168,0.0028102975,0.0003107145,0.00014602327,0.00010210343,0.0008559828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786335,0.0000968584,0.0002910925,0.00024367818,0.00063141505,0.0008735953],"domain_scores_gemma":[0.9983839,0.0002814182,0.000023298913,0.0004244222,0.00053909357,0.00034786787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018871628,0.00023088531,0.00019289156,0.00009841054,0.0006622008,0.00021778558,0.0003839243,0.00017738494,0.00007911844],"category_scores_gemma":[0.00022835938,0.0001741331,0.00020236468,0.0011604577,0.00010459134,0.00036493002,0.00009009645,0.00080748054,0.0004267988],"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.000017925866,0.00016460246,0.0034364662,0.000107654865,0.00017516443,8.586934e-7,0.022072125,0.9294555,0.001116848,0.00044750219,0.021759918,0.02124544],"study_design_scores_gemma":[0.00041983952,0.000023406255,0.0022236463,0.00003481319,0.000013215535,0.0000014766927,0.0015391235,0.9917858,0.0014308998,0.000025728996,0.002263019,0.00023898433],"about_ca_topic_score_codex":0.000112440845,"about_ca_topic_score_gemma":0.000041738716,"teacher_disagreement_score":0.35385647,"about_ca_system_score_codex":0.00035208918,"about_ca_system_score_gemma":0.00006558328,"threshold_uncertainty_score":0.7100942},"labels":[],"label_agreement":null},{"id":"W2409994095","doi":"10.1016/j.tcs.2016.04.046","title":"An FPTAS for the parallel two-stage flowshop problem","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Alberta Innovates - Technology Futures; Program for Changjiang Scholars and Innovative Research Team in University; Georgia Southern University","keywords":"Job shop scheduling; Schedule; Subroutine; Computer science; Mathematical optimization; Scheme (mathematics); Dynamic programming; Time complexity; Scheduling (production processes); Polynomial-time approximation scheme; Parallel computing; Algorithm; Mathematics","score_opus":0.01124981111899529,"score_gpt":0.25387417817360247,"score_spread":0.2426243670546072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2409994095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004030716,0.00002035861,0.99387956,0.000561999,0.00038899106,0.00017823464,0.000004981559,0.00027570664,0.0006594635],"genre_scores_gemma":[0.57548606,0.000004370943,0.42421943,0.0001095447,0.00013683649,0.000016273929,4.3606607e-7,0.000009456218,0.000017603053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991219,0.000017787004,0.00012442877,0.00022806526,0.00020039611,0.00030741515],"domain_scores_gemma":[0.99915886,0.00026245083,0.000011540981,0.00036397018,0.000076342185,0.00012681058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007029287,0.00009601915,0.00007919643,0.000039867362,0.00021121823,0.00013098093,0.00065182755,0.000023684313,0.0000749654],"category_scores_gemma":[0.000031191328,0.00004849831,0.000031385385,0.0002261889,0.0008639434,0.00018787413,0.000052702017,0.000055391843,0.000032113316],"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.000005337064,0.000010285666,0.000006434241,0.0000038668823,0.0000034211305,4.729332e-7,0.00011839537,0.24121507,0.0004926996,0.70650893,0.000028364868,0.051606733],"study_design_scores_gemma":[0.00027610973,0.000055283766,0.00003747366,0.000011120023,0.0000037607194,0.0000026422708,0.0000064238025,0.9838573,0.0013201784,0.01411171,0.00021032781,0.00010767325],"about_ca_topic_score_codex":4.764973e-7,"about_ca_topic_score_gemma":3.5793218e-7,"teacher_disagreement_score":0.7426422,"about_ca_system_score_codex":0.000022905666,"about_ca_system_score_gemma":0.000022018203,"threshold_uncertainty_score":0.31832355},"labels":[],"label_agreement":null},{"id":"W2412591217","doi":"10.3390/a9020038","title":"A 3/2-Approximation Algorithm for the Graph Balancing Problem with Two Weights","year":2016,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Job shop scheduling; Graph; Algorithm; Computer science; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science","score_opus":0.007907320130312992,"score_gpt":0.21292157516769591,"score_spread":0.2050142550373829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412591217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006226067,0.0003786174,0.9962987,0.00044211393,0.00045293776,0.00064490834,0.000036980076,0.00060635543,0.0005167878],"genre_scores_gemma":[0.010000046,0.00014528325,0.9881067,0.00008928195,0.000541486,0.0004959741,0.000022380951,0.000096280695,0.00050252554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987849,0.00001979569,0.000262461,0.0002738823,0.0002562578,0.0004027279],"domain_scores_gemma":[0.99907005,0.00030201275,0.000060299768,0.000321863,0.00015283003,0.00009297214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027915844,0.00024372191,0.00019760309,0.00010548847,0.00022011684,0.00008060996,0.00022992783,0.000074092364,0.000035193963],"category_scores_gemma":[0.000015671858,0.00012364167,0.00008350762,0.00033856303,0.00006959225,0.000254323,0.00001802591,0.00010598463,0.000035015284],"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.00001007951,0.000027706765,0.00005564934,0.000028974253,0.0001794787,0.00000418608,0.0003802119,0.018019672,0.0002070798,0.0008934685,0.0005122789,0.9796812],"study_design_scores_gemma":[0.0018745724,0.000078440775,0.000070564325,0.000098493525,0.00006130369,0.000043166063,0.00011796332,0.9891372,0.0036586958,0.0016624767,0.0028589605,0.00033818375],"about_ca_topic_score_codex":0.000012617691,"about_ca_topic_score_gemma":0.000007998119,"teacher_disagreement_score":0.97934306,"about_ca_system_score_codex":0.00006269067,"about_ca_system_score_gemma":0.000027929054,"threshold_uncertainty_score":0.5041961},"labels":[],"label_agreement":null},{"id":"W2415635022","doi":"10.5267/j.ijiec.2016.2.004","title":"A hybrid algorithm for unrelated parallel machines scheduling","year":2016,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Simulated annealing; Mathematical optimization; Job shop scheduling; Genetic algorithm; Computer science; Scheduling (production processes); Hybrid algorithm (constraint satisfaction); Algorithm; Due date; Mathematics; Schedule","score_opus":0.021446033199704947,"score_gpt":0.2565881444881143,"score_spread":0.23514211128840934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415635022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012219761,0.00012601372,0.9815621,0.00059191964,0.0051445346,0.00010351078,0.00006568891,0.00016075619,0.00002575442],"genre_scores_gemma":[0.277395,0.00005951978,0.7200668,0.00003056916,0.002304805,0.000012718174,0.000026172,0.000059407506,0.000045044144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988719,0.000012053416,0.0005708371,0.0000959712,0.0002815556,0.00016763886],"domain_scores_gemma":[0.998746,0.00038753173,0.00013922993,0.00006673429,0.00055245275,0.00010809831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022540866,0.00015401862,0.00019601575,0.00038940398,0.000036250327,0.0000726505,0.00029722395,0.00008568676,0.000028790339],"category_scores_gemma":[0.00037731044,0.00012470609,0.00015023783,0.0001236387,0.000016509135,0.00025590058,0.00001787804,0.00020083385,0.0000075053695],"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.000011789825,0.000017509383,0.000023192346,0.000001942767,0.00025176085,0.000011190845,0.000027139695,0.86051834,0.00026208608,0.00027204253,0.00030588015,0.13829713],"study_design_scores_gemma":[0.002540166,0.00004639954,0.000023810855,0.00020488776,0.000029412276,0.00013084807,0.0000094647785,0.99436617,0.0007268831,0.0003053386,0.0014539241,0.00016270757],"about_ca_topic_score_codex":0.0000015143007,"about_ca_topic_score_gemma":1.2091704e-7,"teacher_disagreement_score":0.26517525,"about_ca_system_score_codex":0.00013951086,"about_ca_system_score_gemma":0.00006623013,"threshold_uncertainty_score":0.5085367},"labels":[],"label_agreement":null},{"id":"W2416427035","doi":"10.1007/978-3-319-24486-0","title":"Algorithmic Learning Theory","year":2015,"lang":"en","type":"book","venue":"Lecture notes in computer science","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":"University of Regina","funders":"","keywords":"Computer science; Mathematics education; Cognitive science; Mathematical economics; Artificial intelligence; Psychology; Mathematics","score_opus":0.009753840205306272,"score_gpt":0.22391939115422574,"score_spread":0.21416555094891948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416427035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021651058,0.0010014527,0.9874645,0.000023063978,0.0021188294,0.00011622815,0.0000019754368,0.00045309504,0.008799203],"genre_scores_gemma":[0.0048927115,0.000095897725,0.98847795,0.00028481972,0.0017680436,0.0000112239195,0.0000351147,0.00011578,0.0043184403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843127,0.000036082187,0.00023161668,0.00044461168,0.0004722222,0.0003842093],"domain_scores_gemma":[0.9991278,0.0002317889,0.000049792776,0.00033331604,0.00013345695,0.00012381266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008658193,0.00028724773,0.00027828573,0.0004322219,0.0000908976,0.00015990467,0.00065163645,0.00024986634,0.000029029487],"category_scores_gemma":[0.0001420487,0.0002774089,0.000049245435,0.0005251797,0.00023238765,0.0001320386,0.00013768302,0.00093921146,0.000077945275],"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":[7.010771e-7,0.0000022320667,0.0000032990495,0.000013612348,0.0000040242344,0.000009338972,0.00032368998,0.7280973,0.0000029072269,0.000041902684,0.000073013325,0.27142796],"study_design_scores_gemma":[0.00013574962,0.000029309558,0.000004415435,0.00012780265,0.0000054749826,0.00001947354,4.277605e-7,0.9793879,0.00011940342,0.017834552,0.0020032504,0.0003322771],"about_ca_topic_score_codex":0.0000012893155,"about_ca_topic_score_gemma":0.000002325333,"teacher_disagreement_score":0.2710957,"about_ca_system_score_codex":0.00043806506,"about_ca_system_score_gemma":0.0004002446,"threshold_uncertainty_score":0.9999678},"labels":[],"label_agreement":null},{"id":"W2418532388","doi":"10.1007/s11740-016-0680-9","title":"Priority allocation rules for single machine total weighted linear and square tardiness problems","year":2016,"lang":"en","type":"article","venue":"Production Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Tardiness; Due date; Mathematical optimization; Computer science; Scheduling (production processes); Process (computing); Constructive; Function (biology); Square (algebra); Job shop scheduling; Operations research; Mathematics; Schedule","score_opus":0.00973515311092604,"score_gpt":0.19790714417236455,"score_spread":0.1881719910614385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418532388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16155139,0.0007655433,0.834357,0.00042792718,0.0014180582,0.00041236685,0.00002141702,0.0010177447,0.000028561859],"genre_scores_gemma":[0.8672861,0.000105093626,0.1314962,0.0000028070328,0.0007112835,0.00010733104,0.0000557882,0.000066609144,0.00016881323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992927,0.0000057861366,0.00019081411,0.00023171485,0.00009386641,0.00018511945],"domain_scores_gemma":[0.9996312,0.000029116705,0.000025308767,0.00014521906,0.00010843308,0.000060695653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014529238,0.00015420238,0.00013172145,0.000110726854,0.000056049194,0.00002574336,0.00004429119,0.00006669906,0.000007745237],"category_scores_gemma":[0.00010953954,0.00012944572,0.000030698142,0.00014104538,0.00001372428,0.0002461099,0.000012540375,0.00006381998,0.000005164498],"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.00001302623,0.000041401403,0.0001973538,0.00047746464,0.000060850078,3.910346e-7,0.00023358983,0.84115183,0.1127424,0.0002463023,0.000054452557,0.044780947],"study_design_scores_gemma":[0.00048135474,0.00003584725,0.00031981323,0.00011700809,0.0000217925,0.000041849748,0.000013466322,0.93623036,0.060562436,0.00005056371,0.0018274685,0.00029801717],"about_ca_topic_score_codex":0.0000018304568,"about_ca_topic_score_gemma":7.1846296e-7,"teacher_disagreement_score":0.70573467,"about_ca_system_score_codex":0.00006249607,"about_ca_system_score_gemma":0.0000059597746,"threshold_uncertainty_score":0.5278643},"labels":[],"label_agreement":null},{"id":"W2427378468","doi":"10.5267/j.dsl.2016.4.002","title":"Integrating the sequence dependent setup time open shop problem and preventive maintenance policies","year":2016,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Preventive maintenance; Sequence (biology); Computer science; Business; Operations research; Mathematical optimization; Risk analysis (engineering); Reliability engineering; Operations management; Engineering; Mathematics","score_opus":0.017816087265433236,"score_gpt":0.27754078526253884,"score_spread":0.2597246979971056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2427378468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43226507,0.000047894355,0.5560724,0.008742943,0.00031517938,0.00046280443,0.000014437029,0.00014648937,0.0019327395],"genre_scores_gemma":[0.78228384,0.00005327401,0.21476674,0.0021531107,0.000055547458,0.000035235338,8.095229e-7,0.00002247768,0.0006289329],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988056,0.000026598167,0.00020368029,0.0002871534,0.00038444166,0.00029256227],"domain_scores_gemma":[0.99923927,0.00028849908,0.000046916004,0.00027650644,0.00006804985,0.00008076873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976964,0.000117350115,0.00010884492,0.00009919832,0.00024814688,0.0004505851,0.0009094964,0.000024332145,0.000038659437],"category_scores_gemma":[0.00032217952,0.00005921234,0.000020571311,0.0004841616,0.00039235578,0.0007021896,0.00027091097,0.00009313932,0.00008025625],"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.000027393393,0.000022130782,0.0019591104,0.000011384035,0.000028018318,0.00002158909,0.004650524,0.044465616,0.4863283,0.0028261691,0.009272362,0.45038742],"study_design_scores_gemma":[0.0022066047,0.0001243643,0.0066032624,0.0017481125,0.000032166765,0.00028004695,0.0023572159,0.92064667,0.05155133,0.00880089,0.0041715424,0.0014777831],"about_ca_topic_score_codex":0.000014059714,"about_ca_topic_score_gemma":0.000005153742,"teacher_disagreement_score":0.87618107,"about_ca_system_score_codex":0.00009241116,"about_ca_system_score_gemma":0.000029308909,"threshold_uncertainty_score":0.43450025},"labels":[],"label_agreement":null},{"id":"W2435530825","doi":"10.1007/s10878-016-0044-6","title":"Approximation algorithms for precedence-constrained identical machine scheduling with rejection","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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":"Theory of computation; Rounding; Submodular set function; Computer science; Job shop scheduling; Scheduling (production processes); Approximation algorithm; Mathematical optimization; Linear programming; Algorithm; Mathematics","score_opus":0.011674666186575705,"score_gpt":0.2380949645483972,"score_spread":0.2264202983618215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2435530825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031710626,0.00010826983,0.99278504,0.00021685309,0.0031967477,0.00025792455,0.0000068831,0.00012171376,0.00013551075],"genre_scores_gemma":[0.20564032,0.00014598892,0.7933742,0.000009612839,0.0007303126,0.000015271748,0.000012298207,0.00004710299,0.000024913397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.00004467344,0.00062342314,0.00012641217,0.00034246946,0.00018912034],"domain_scores_gemma":[0.99861735,0.00016867202,0.00030442225,0.00011071065,0.00068872067,0.000110133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792449,0.00016780755,0.0002618694,0.00023138133,0.00009108523,0.0000862644,0.00012842075,0.00013500854,0.000033301618],"category_scores_gemma":[0.00036862024,0.000116746705,0.00008969411,0.00029127073,0.000042462918,0.00068653806,0.000008006221,0.00013062965,0.0000019220479],"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.0001952397,0.000053220414,0.000050647468,0.000030804094,0.00007441279,0.0000019369734,0.000058404006,0.98945165,0.00053641526,0.0014873209,0.000023443925,0.008036516],"study_design_scores_gemma":[0.0042105797,0.00041088203,0.000015644408,0.00019180881,0.00007946313,0.00008054566,0.00004124639,0.98826146,0.0049514985,0.0014961261,0.00006737876,0.000193337],"about_ca_topic_score_codex":6.906809e-7,"about_ca_topic_score_gemma":1.7998417e-7,"teacher_disagreement_score":0.20246924,"about_ca_system_score_codex":0.00014881215,"about_ca_system_score_gemma":0.00007174522,"threshold_uncertainty_score":0.47607926},"labels":[],"label_agreement":null},{"id":"W2442439325","doi":"10.5267/j.uscm.2016.4.002","title":"Production, technology and capacity planning for textile industry: A case study","year":2016,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production (economics); Textile industry; Business; Textile; Industrial organization; Operations management; Environmental economics; Economics; Microeconomics","score_opus":0.0216667891293142,"score_gpt":0.25262249638114437,"score_spread":0.23095570725183018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2442439325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87514395,0.000109512766,0.12011833,0.0014672627,0.0004740747,0.0016076132,0.000016475218,0.0007139265,0.00034888135],"genre_scores_gemma":[0.96766824,0.000010868463,0.030514276,0.00003064237,0.00010120109,0.00044826747,0.0000029142225,0.000029554649,0.0011940349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991749,0.00001728896,0.00017773977,0.00029034977,0.00009485063,0.0002448811],"domain_scores_gemma":[0.9995951,0.00003673931,0.000027113874,0.00024299258,0.00004503095,0.00005301946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027520122,0.00014970115,0.00013390045,0.0003578873,0.00012914476,0.000028570343,0.000088607994,0.00010584366,0.0000239607],"category_scores_gemma":[0.00004851005,0.00011949094,0.000016955451,0.00034616576,0.00004795607,0.000069473295,0.000046082874,0.00011128142,0.000003563573],"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.00007317016,0.0005832325,0.07881146,0.0006466884,0.0011464051,0.0018197831,0.01067906,0.55637556,0.00035764455,0.00625158,0.015044475,0.32821092],"study_design_scores_gemma":[0.017663978,0.0016318469,0.0040462776,0.0010725938,0.0007018595,0.0023973736,0.23775528,0.6436025,0.0034042813,0.009067659,0.07469193,0.003964442],"about_ca_topic_score_codex":0.000012907374,"about_ca_topic_score_gemma":0.000010213795,"teacher_disagreement_score":0.32424647,"about_ca_system_score_codex":0.00007339048,"about_ca_system_score_gemma":0.000004270957,"threshold_uncertainty_score":0.48726994},"labels":[],"label_agreement":null},{"id":"W2461363908","doi":"10.1016/j.ejor.2016.06.062","title":"Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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; Partition (number theory); Workload; Scheduling (production processes); Algorithm; Partition problem; Variable (mathematics); Mathematical optimization; Mathematics; Combinatorics","score_opus":0.0516137280759147,"score_gpt":0.3146334845926631,"score_spread":0.2630197565167484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461363908","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089650357,0.0005218621,0.9949054,0.0018990862,0.000028037784,0.0004071503,0.0000051602533,0.000024002247,0.0013127733],"genre_scores_gemma":[0.19935046,0.00013249605,0.799342,0.000052335756,0.00062973646,0.00010502977,0.0000038127407,0.00003818999,0.00034595592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989974,0.000099679186,0.0002571678,0.00010741638,0.000369296,0.00016904034],"domain_scores_gemma":[0.99855274,0.00029011577,0.00004385033,0.00008320635,0.0009328922,0.000097179975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023958876,0.00007357808,0.00007747135,0.0001328538,0.00034481633,0.00023164526,0.00014749002,0.000015176327,0.000025234021],"category_scores_gemma":[0.00014908018,0.000039943374,0.000015735961,0.0003179489,0.000054873213,0.00029799002,0.000020412608,0.00014713805,0.000014880931],"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.00007968876,0.000036189474,0.0000532672,0.000057020763,0.000055316585,0.0000020229872,0.00041659072,0.6759918,0.0033848945,0.0046296963,0.00052147056,0.31477207],"study_design_scores_gemma":[0.002264974,0.0006007981,0.00063638284,0.0011608697,0.000044113363,0.00014286225,0.0007300246,0.96429247,0.0031917333,0.0016890492,0.02489535,0.00035139918],"about_ca_topic_score_codex":2.9975715e-7,"about_ca_topic_score_gemma":2.8714837e-7,"teacher_disagreement_score":0.31442067,"about_ca_system_score_codex":0.000045469693,"about_ca_system_score_gemma":0.00009445671,"threshold_uncertainty_score":0.26520833},"labels":[],"label_agreement":null},{"id":"W2470076424","doi":"10.1016/j.cor.2016.07.005","title":"The boolean quadratic programming problem with generalized upper bound constraints","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","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":"Simon Fraser University","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Upper and lower bounds; Quadratic programming; Quadratic assignment problem; Quadratic equation; Mathematics; Mathematical optimization; Computer science; Metaheuristic; Computational complexity theory; Sequential quadratic programming; Theoretical computer science; Combinatorial optimization; Algorithm","score_opus":0.030918578958173733,"score_gpt":0.30292081171189117,"score_spread":0.27200223275371743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470076424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044657893,0.00031279607,0.94941646,0.0030032129,0.0002637466,0.00086455385,0.0000054068855,0.00038401058,0.001091926],"genre_scores_gemma":[0.49829972,0.00017313655,0.49885106,0.000057252884,0.00024492826,0.00034740235,0.000018040255,0.000067247645,0.0019412366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985693,0.00014823476,0.000218124,0.00021249783,0.00038944097,0.000462368],"domain_scores_gemma":[0.99895734,0.00024259767,0.000008059668,0.0003288726,0.00033618527,0.00012695795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006372488,0.00012758568,0.00010920728,0.00012601461,0.00086468505,0.00069453655,0.00029420556,0.000049611048,0.000053679905],"category_scores_gemma":[0.000051496223,0.000068640686,0.00003056137,0.000404654,0.0004345155,0.00018342059,0.000048964383,0.00021093497,0.00010132774],"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.000033965385,0.0000735225,0.0002577557,0.000038063157,0.00019688018,0.000017444709,0.0014633717,0.5146523,0.0014825575,0.01569762,0.0039595254,0.46212697],"study_design_scores_gemma":[0.0011875414,0.00013922085,0.00012320836,0.00017076323,0.00000832077,0.000034639615,0.00039695407,0.9848306,0.0012818531,0.00012581333,0.011412699,0.00028839087],"about_ca_topic_score_codex":0.00001503523,"about_ca_topic_score_gemma":0.00008861512,"teacher_disagreement_score":0.47017828,"about_ca_system_score_codex":0.00010197805,"about_ca_system_score_gemma":0.00013571129,"threshold_uncertainty_score":0.66974324},"labels":[],"label_agreement":null},{"id":"W2471040427","doi":"10.1111/poms.12584","title":"Scheduling Methods for Efficient Stamping Operations at an Automotive Company","year":2016,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Job shop scheduling; Computer science; Automotive industry; Scheduling (production processes); Minification; Mathematical optimization; Time horizon; Schedule; Integer programming; Stamping; Operations research; Algorithm; Mathematics; Engineering","score_opus":0.02514915830401562,"score_gpt":0.3096852936058592,"score_spread":0.28453613530184363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471040427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03665259,0.0001698993,0.95952284,0.0014904903,0.0008179736,0.00066817773,0.000008390089,0.0003825329,0.0002871141],"genre_scores_gemma":[0.15780151,0.00016949045,0.83980054,0.00007561811,0.00016226334,0.00026813356,0.000029260975,0.000027370495,0.00166584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991517,0.000052401487,0.0002250429,0.0003184014,0.000080835576,0.00017161084],"domain_scores_gemma":[0.99950194,0.000021992671,0.00001188908,0.00022133144,0.00016480323,0.000078050616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004175661,0.00013206287,0.00011188154,0.00015640714,0.0005265805,0.000115492294,0.0000658824,0.00003342645,0.000053359166],"category_scores_gemma":[0.00008981701,0.000106582105,0.000027706401,0.00017320432,0.000036973717,0.00022292256,0.000037652273,0.00004055039,0.000015220423],"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.000004316011,0.00003781629,0.000010306458,0.00002633937,0.000042933378,1.0991435e-7,0.00039841316,0.9592575,0.0020075946,0.003885702,0.000061049155,0.03426795],"study_design_scores_gemma":[0.000345169,0.000026251297,0.00014304805,0.000038559,0.00003778593,0.000003248931,0.00045456007,0.989255,0.0073443167,0.000032216598,0.0021377031,0.00018212531],"about_ca_topic_score_codex":0.0000023120788,"about_ca_topic_score_gemma":0.000022718914,"teacher_disagreement_score":0.12114891,"about_ca_system_score_codex":0.000119392564,"about_ca_system_score_gemma":0.000007647692,"threshold_uncertainty_score":0.4346292},"labels":[],"label_agreement":null},{"id":"W24732036","doi":"","title":"A hybrid algorithm with diversification and intensification for permutation flow shop scheduling","year":2008,"lang":"en","type":"article","venue":"international conference on Modelling and simulation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Ottawa","funders":"","keywords":"Computer science; Tabu search; Mathematical optimization; Flow shop scheduling; Population; Adaptive memory; Algorithm; Simulated annealing; Evolutionary algorithm; Parallel computing; Metaheuristic; Benchmark (surveying); Scheduling (production processes); Job shop scheduling; Mathematics; Artificial intelligence","score_opus":0.061450358587370975,"score_gpt":0.2644279912094806,"score_spread":0.2029776326221096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24732036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19666573,0.00003570038,0.8025546,0.0001356317,0.0001281584,0.00016268015,0.000021668793,0.00012353326,0.00017229113],"genre_scores_gemma":[0.7769533,0.00020860456,0.22244485,0.000025720194,0.00007254228,0.000021731832,0.00021365008,0.000016668842,0.00004298051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992663,0.00001187167,0.00018703965,0.00024326904,0.00018496878,0.00010653975],"domain_scores_gemma":[0.99928874,0.00009249912,0.000054146636,0.00008224177,0.00042720448,0.000055185632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000099898956,0.0001360058,0.00010799941,0.00015120511,0.00017592977,0.00007551732,0.000055169014,0.000054837466,0.000008095626],"category_scores_gemma":[0.000025696352,0.00013434522,0.000020304327,0.000053412045,0.00004534209,0.00025241805,0.000006765265,0.00009616596,0.000003130159],"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.00004608696,0.000011971958,0.00007838443,0.00000936032,0.00002351815,7.946915e-7,0.0005168593,0.97803795,0.000056598125,0.0009271079,0.0000023119235,0.02028905],"study_design_scores_gemma":[0.0005745037,0.000054210504,0.00010184557,0.000047708923,0.0000149390335,0.000011675975,0.00018677863,0.99775076,0.00024740314,0.0008129513,0.00003268859,0.00016451767],"about_ca_topic_score_codex":0.0000049680834,"about_ca_topic_score_gemma":5.321121e-7,"teacher_disagreement_score":0.5802875,"about_ca_system_score_codex":0.000041698117,"about_ca_system_score_gemma":0.000017098566,"threshold_uncertainty_score":0.5478439},"labels":[],"label_agreement":null},{"id":"W24773904","doi":"10.1023/a:1014955216633","title":"Operational Decisions in AGV-Served Flowshop Loops: Fleet Sizing and Decomposition","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"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":"Natural Sciences and Engineering Research Council of Canada; University of Texas at Dallas","keywords":"Theory of computation; Computer science; Decomposition; Set (abstract data type); Material flow; Minification; Mathematical optimization; Throughput; Loop (graph theory); Decomposition method (queueing theory); Industrial engineering; Algorithm; Mathematics; Engineering","score_opus":0.17081165853302757,"score_gpt":0.43412470764294725,"score_spread":0.2633130491099197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24773904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977603,0.0009813037,0.017728984,0.0016197464,0.00006962604,0.00022825376,0.000016314341,0.000052662628,0.0017001024],"genre_scores_gemma":[0.96181494,0.0028213784,0.034917656,0.00007605561,0.00006504689,0.00004771149,0.000080914295,0.000018286519,0.00015802572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882317,0.00010515057,0.0003158249,0.00017569495,0.00033119865,0.0002489648],"domain_scores_gemma":[0.9989797,0.00023121452,0.0000061029295,0.0001850408,0.00050207693,0.00009587323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559643,0.00008740137,0.0001299929,0.0004765167,0.00021491919,0.00013742172,0.00012638156,0.00007641144,0.0001491431],"category_scores_gemma":[0.0003798589,0.00009035177,0.000026403943,0.0007757901,0.000060567636,0.00035458448,0.000042912165,0.00023053662,0.000028055276],"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.0000127904395,0.00007045158,0.0009250778,0.0000066530943,0.000014929613,0.0000068878326,0.00043884627,0.98662513,0.0036299764,0.0011387109,0.00036350818,0.006767006],"study_design_scores_gemma":[0.00030879976,0.0000435232,0.006195104,0.00007021515,0.0000015063645,0.000010330239,0.00024044732,0.9883002,0.004137626,0.00015411497,0.00043229992,0.00010583973],"about_ca_topic_score_codex":0.00010985439,"about_ca_topic_score_gemma":0.00041789695,"teacher_disagreement_score":0.017188674,"about_ca_system_score_codex":0.000022140779,"about_ca_system_score_gemma":0.000058682206,"threshold_uncertainty_score":0.36844385},"labels":[],"label_agreement":null},{"id":"W2478557639","doi":"10.1007/978-3-540-70916-9","title":"Multi-Agent-Based Simulation VIII","year":2008,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"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":"Computer science","score_opus":0.018185687051461306,"score_gpt":0.24578746378483987,"score_spread":0.22760177673337856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478557639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000689582,0.0003095968,0.99713093,0.000023576367,0.0016706482,0.00016269757,0.000004497787,0.0003523828,0.00027669637],"genre_scores_gemma":[0.045456454,0.000020004634,0.95337284,0.00037168208,0.00041930834,0.0000053119948,0.00003314366,0.000049127015,0.00027214113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985977,0.000013692926,0.00025151638,0.00043358843,0.00039656356,0.0003069657],"domain_scores_gemma":[0.999159,0.0002265299,0.000052065654,0.00037378957,0.00010440633,0.00008420378],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016136788,0.0002669147,0.00022956633,0.00044525103,0.00011430655,0.00009735076,0.00046740883,0.00023774001,0.0000142151985],"category_scores_gemma":[0.000065076565,0.00027014676,0.00006116953,0.00052728585,0.0001796389,0.00010990925,0.00005230469,0.00041336453,0.00004275651],"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":[8.253876e-7,0.000008484203,0.00001472559,0.000020523292,0.0000027462834,0.000010758178,0.00013574127,0.9401861,0.000013864128,0.0000013415857,0.000017885264,0.059587],"study_design_scores_gemma":[0.00026234143,0.000016286007,0.000050005998,0.00010676395,0.000003653593,0.0000036283122,4.051288e-8,0.9982921,0.00043174095,0.00007977571,0.0004552177,0.00029848513],"about_ca_topic_score_codex":0.0000021416936,"about_ca_topic_score_gemma":0.0000065045483,"teacher_disagreement_score":0.059288517,"about_ca_system_score_codex":0.00032814426,"about_ca_system_score_gemma":0.00027991334,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W2494023685","doi":"10.1007/0-387-27744-7","title":"Multidisciplinary Scheduling: Theory and Applications","year":2005,"lang":"en","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":52,"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":"Multidisciplinary approach; Computer science; Scheduling (production processes); Management science; Sociology; Engineering; Operations management; Social science","score_opus":0.008551397075968335,"score_gpt":0.23102127011638005,"score_spread":0.22246987304041171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2494023685","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.968164e-7,0.0021195118,0.3043403,0.000015728154,0.00005229068,0.00015900313,0.000006253616,0.0007085969,0.6925973],"genre_scores_gemma":[0.000035100984,0.0004391576,0.12984248,0.00002259965,0.0004935564,0.000052292013,0.000054353306,0.00013164835,0.8689288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945927,0.0000079286365,0.00015233831,0.00018478156,0.00007552681,0.00012018601],"domain_scores_gemma":[0.99957865,0.00007466349,0.000023209861,0.00021668433,0.000020116131,0.00008668468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010245554,0.00019079393,0.00015646325,0.00011554229,0.000049470327,0.000027370883,0.00009187831,0.00022964184,0.0007641383],"category_scores_gemma":[0.000005988303,0.00018943082,0.000036983958,0.00004138837,0.000046461224,0.000031573876,0.00002660391,0.00020586983,0.00043443983],"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.000011376716,0.00006143252,0.000015792151,0.00042986867,0.00039209248,0.00000723926,0.00036146093,0.3604313,0.00004053503,0.347246,0.022732537,0.26827037],"study_design_scores_gemma":[0.00047144652,0.000015323882,0.000017760212,0.00012255007,0.00011444334,0.000024230596,0.00010061491,0.2853998,0.00010589084,0.014785744,0.69783455,0.00100761],"about_ca_topic_score_codex":1.1377013e-7,"about_ca_topic_score_gemma":0.000001241838,"teacher_disagreement_score":0.67510206,"about_ca_system_score_codex":0.00004098882,"about_ca_system_score_gemma":0.000029064648,"threshold_uncertainty_score":0.83667785},"labels":[],"label_agreement":null},{"id":"W2502805255","doi":"10.1016/j.ejor.2017.03.002","title":"Shared multi-processor scheduling","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"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); Parallel computing; Job shop scheduling; Processor scheduling; Time complexity; Distributed computing; Mathematical optimization; Algorithm; Mathematics; Operating system; Schedule","score_opus":0.1377006751893111,"score_gpt":0.3782294269064823,"score_spread":0.24052875171717122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502805255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38260427,0.0027632262,0.5376782,0.004581043,0.0025392,0.0003537721,0.000033268418,0.00017098748,0.069276035],"genre_scores_gemma":[0.8015265,0.00008576034,0.19713901,0.000023570521,0.0006170201,9.426647e-7,0.0000034441346,0.000033999106,0.00056979177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861556,0.00016612897,0.00032690912,0.00009356795,0.0006038488,0.00019396577],"domain_scores_gemma":[0.99842364,0.000068848014,0.000072312825,0.00021804779,0.0010632802,0.00015385875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002962144,0.00008098547,0.00011115889,0.00018363081,0.00060392,0.00072069233,0.00065165217,0.00002046606,0.00019183171],"category_scores_gemma":[0.0015979231,0.000070811744,0.00005148941,0.00008277038,0.0000825231,0.0005283399,0.0000702224,0.0005405047,0.00022080458],"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.000056623114,0.000100155776,0.0012417245,0.000053659656,0.00012342424,0.00040896406,0.0008043728,0.96924883,0.0077125593,0.00080468605,0.0027582727,0.016686728],"study_design_scores_gemma":[0.0018514054,0.00013177279,0.020732574,0.00021478717,0.000007719183,0.000114725386,0.0002762953,0.96975577,0.0031244291,0.000043052703,0.0035254695,0.00022198205],"about_ca_topic_score_codex":8.815694e-7,"about_ca_topic_score_gemma":7.042493e-7,"teacher_disagreement_score":0.4189222,"about_ca_system_score_codex":0.00004459091,"about_ca_system_score_gemma":0.00009824845,"threshold_uncertainty_score":0.6949653},"labels":[],"label_agreement":null},{"id":"W2506963688","doi":"10.2495/dne-v11-n3-428-437","title":"Real-time data-driven average active period method for bottleneck detection","year":2016,"lang":"en","type":"article","venue":"International Journal of Design & Nature and Ecodynamics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"VINNOVA","keywords":"Bottleneck; Production (economics); Computer science; Industrial engineering; Process (computing); Set (abstract data type); Material flow; Productivity; Real-time computing; Data mining; Engineering; Embedded system","score_opus":0.012174176847864274,"score_gpt":0.2719964526960295,"score_spread":0.25982227584816525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506963688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007805924,0.00009612172,0.9902749,0.00034985895,0.0011123524,0.00007937176,0.0001372946,0.000037977203,0.00010621297],"genre_scores_gemma":[0.24155493,0.00098735,0.7564056,0.00005758828,0.00069171615,0.0000038795374,0.000034274806,0.00003944394,0.00022520982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999285,0.000032931974,0.00025726497,0.00012473504,0.00019117349,0.00010894157],"domain_scores_gemma":[0.99909955,0.0002735835,0.00013626841,0.00010952817,0.00031819227,0.00006287487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032287106,0.00011116661,0.00015582131,0.00017380156,0.00003809036,0.000057925532,0.00030779288,0.00016423422,0.000025718378],"category_scores_gemma":[0.0001509642,0.000082890096,0.00005803698,0.00005519056,0.000014048671,0.00041223408,0.000030853924,0.00019819131,0.0000032788032],"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.0010472042,0.00009419604,0.000062191044,0.000037842074,0.0017220496,0.00007427469,0.0005355286,0.40667963,0.12164609,0.00061778305,0.0013169433,0.46616626],"study_design_scores_gemma":[0.0008465818,0.00007818469,0.00009589311,0.00005341274,0.000036127738,0.0002066151,0.000028958737,0.9928458,0.004111604,0.0007094886,0.000864983,0.00012236749],"about_ca_topic_score_codex":0.0000010772461,"about_ca_topic_score_gemma":0.0000040746645,"teacher_disagreement_score":0.58616614,"about_ca_system_score_codex":0.00013199574,"about_ca_system_score_gemma":0.000034082666,"threshold_uncertainty_score":0.338016},"labels":[],"label_agreement":null},{"id":"W2507069380","doi":"10.1090/fim/027/08","title":"Lift-and-project ranks for combinatorial optimzation","year":2010,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Lift (data mining); Computer science; Mathematics; Data mining","score_opus":0.013337740995818083,"score_gpt":0.23974954288391614,"score_spread":0.22641180188809806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507069380","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014778887,0.000139404,0.48275286,0.00009976294,0.0011477761,0.0014814794,0.00010976327,0.0011694193,0.51295173],"genre_scores_gemma":[0.0012354724,0.0001662217,0.93217033,0.00030460925,0.001152737,0.00022831988,0.00012940171,0.00040080192,0.06421213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878466,0.000006400472,0.00039153616,0.0002965688,0.00025125835,0.0002696027],"domain_scores_gemma":[0.99903333,0.00033238056,0.00013542552,0.00028042038,0.000097472126,0.00012097806],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020269805,0.00037822072,0.00058970443,0.000033167802,0.00012861387,0.00008286298,0.00015602281,0.0004223619,0.00009478931],"category_scores_gemma":[0.000052297455,0.00036815557,0.00033722396,0.000022630693,0.00046133858,0.000026721815,0.000042384097,0.000567006,0.000027361455],"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.000037428774,0.00004989773,9.997868e-7,0.0012993016,0.0010207898,0.000002707209,0.0036029103,0.0006915102,0.00028662157,0.9206827,0.0042181476,0.06810694],"study_design_scores_gemma":[0.0022693668,0.00035164488,0.0000010869957,0.00037472983,0.0006880871,0.00002572149,0.00041353863,0.5233811,0.00059933256,0.37088424,0.09887162,0.0021395492],"about_ca_topic_score_codex":0.000002614524,"about_ca_topic_score_gemma":4.7200612e-7,"teacher_disagreement_score":0.5497985,"about_ca_system_score_codex":0.000054041557,"about_ca_system_score_gemma":0.000049300448,"threshold_uncertainty_score":0.99987704},"labels":[],"label_agreement":null},{"id":"W2518264398","doi":"10.1016/j.cor.2016.04.006","title":"Mixed Integer Programming models for job shop scheduling: A computational analysis","year":2016,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":227,"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":"Computer science; Integer programming; Mathematical optimization; Job shop scheduling; Constraint programming; Scheduling (production processes); Thread (computing); Algorithm; Mathematics; Stochastic programming; Programming language","score_opus":0.09631262454021754,"score_gpt":0.34752136372957054,"score_spread":0.251208739189353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518264398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132529475,0.00011900729,0.98467225,0.00081338227,0.00024347108,0.0004563302,0.000023676097,0.00029475792,0.00012419424],"genre_scores_gemma":[0.44678542,0.00001400285,0.5525792,0.000017829389,0.000115657385,0.00018513919,0.00006203312,0.000025867728,0.00021481572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984047,0.00009321433,0.0003243129,0.00033183245,0.00041378103,0.00043218862],"domain_scores_gemma":[0.99820906,0.00046680382,0.000010136603,0.00027405232,0.00088019896,0.00015975369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072378304,0.00014850484,0.00021180797,0.0007972874,0.0003874926,0.00033129673,0.00030271898,0.00009061415,0.000040106923],"category_scores_gemma":[0.00012506382,0.00012007695,0.0001426622,0.001388751,0.00010088693,0.00032451074,0.000069625836,0.00018173743,0.000040366904],"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.0000061337782,0.000029841545,0.000050994622,0.000012403669,0.00026236943,9.689685e-7,0.00025394486,0.96940184,0.00006396375,0.006348775,0.00035827217,0.023210485],"study_design_scores_gemma":[0.0004904989,0.000036627906,0.000048577167,0.000032728658,0.00003484332,0.0000018017008,0.00011689558,0.9981953,0.000114830014,0.00044497242,0.0003134753,0.00016947572],"about_ca_topic_score_codex":0.000010143911,"about_ca_topic_score_gemma":0.00003668995,"teacher_disagreement_score":0.43353248,"about_ca_system_score_codex":0.00014986702,"about_ca_system_score_gemma":0.000100557954,"threshold_uncertainty_score":0.48965958},"labels":[],"label_agreement":null},{"id":"W2520179325","doi":"10.1088/1742-6596/616/1/012008","title":"Stochastic optimization of the scheduling of a radiotherapy center","year":2015,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Center (category theory); Computer science; Scheduling (production processes); Mathematical optimization; Mathematics; Chemistry","score_opus":0.02394329520698238,"score_gpt":0.23534663357471097,"score_spread":0.2114033383677286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520179325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03379588,0.00017412446,0.9653327,0.000074229436,0.00045156755,0.00004005065,0.000004306638,0.0000103359425,0.00011681028],"genre_scores_gemma":[0.884028,0.000054605975,0.11577281,0.000008022765,0.000110614106,4.879138e-7,8.8279404e-7,0.000011819756,0.0000127613375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937373,0.000022764369,0.0002951581,0.00003527434,0.0002031283,0.000069919355],"domain_scores_gemma":[0.9990864,0.00001900318,0.00023690939,0.00010098266,0.00051654276,0.00004016682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011673356,0.00007529903,0.00019005015,0.00003605283,0.000015234552,0.000016616274,0.00015304782,0.00003150828,0.000011252387],"category_scores_gemma":[0.000050027316,0.000054918553,0.00006658506,0.00015834448,0.0000635167,0.0002295813,0.000011111333,0.00011041396,2.1812409e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021483787,0.000021964877,0.00010734493,0.000019540994,0.000044189455,1.6798656e-7,0.0011932182,0.99438703,0.0009932666,0.00088459795,0.000011465436,0.0023157187],"study_design_scores_gemma":[0.0007810483,0.00011330411,0.000059610946,0.00021076936,0.000027969825,0.000015397247,0.00092159124,0.947319,0.049550753,0.00089081464,0.000014994945,0.0000947852],"about_ca_topic_score_codex":0.0000010749685,"about_ca_topic_score_gemma":3.4799587e-7,"teacher_disagreement_score":0.8502321,"about_ca_system_score_codex":0.000021946584,"about_ca_system_score_gemma":0.000103606646,"threshold_uncertainty_score":0.22395135},"labels":[],"label_agreement":null},{"id":"W2526913537","doi":"10.1109/wcica.2016.7578238","title":"An MBO algorithm for a flow shop problem with sequence-dependent setup times","year":2016,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Sequence (biology); Process (computing); Computer science; Sensitivity (control systems); Job shop scheduling; Permutation (music); Algorithm; Flow (mathematics); Selection (genetic algorithm); Mathematical optimization; Mathematics; Artificial intelligence; Engineering; Routing (electronic design automation)","score_opus":0.012636091326013859,"score_gpt":0.23227588526159704,"score_spread":0.21963979393558317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526913537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053228077,0.000028260349,0.99578357,0.00015967088,0.00012463328,0.00028442557,0.000057476485,0.000854279,0.0021754329],"genre_scores_gemma":[0.015822655,0.000021647062,0.9805583,0.00005516863,0.00014091413,0.00011738835,0.00002701458,0.000059433743,0.0031974888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992228,0.000009617712,0.00014853415,0.00021298665,0.00014749242,0.0002585694],"domain_scores_gemma":[0.9995211,0.000040070245,0.000017246668,0.000214144,0.000086482054,0.000120953824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110647656,0.0001554079,0.00013243483,0.000060805804,0.00005300585,0.00005428348,0.00013103579,0.00007128739,0.0003591742],"category_scores_gemma":[0.0000054230322,0.00009337333,0.000030732484,0.00009556914,0.000024070201,0.00023919453,0.000007962416,0.000047341236,0.000059014357],"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.000015748356,0.000056266388,0.00008329633,0.00003622302,0.00011010518,0.000008055852,0.00025818564,0.3363982,0.0014327683,0.00043597457,0.0012470534,0.6599181],"study_design_scores_gemma":[0.0007639796,0.00012547379,0.0000044561707,0.0000344137,0.000014833239,0.000015234158,0.00007671463,0.9914543,0.006424455,0.00018885845,0.00066236965,0.00023490786],"about_ca_topic_score_codex":0.000004758477,"about_ca_topic_score_gemma":0.000010584406,"teacher_disagreement_score":0.6596832,"about_ca_system_score_codex":0.000050036044,"about_ca_system_score_gemma":0.000029871151,"threshold_uncertainty_score":0.39327058},"labels":[],"label_agreement":null},{"id":"W2528169968","doi":"","title":"Solving a Task Scheduling Problem using Genetic Algorithms","year":2008,"lang":"en","type":"article","venue":"Kent Academic Repository (University of Kent)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Ottawa","funders":"","keywords":"Computer science; Scheduling (production processes); Task (project management); Algorithm; Mathematical optimization; Mathematics; Engineering","score_opus":0.016948908080158018,"score_gpt":0.20051352522904378,"score_spread":0.18356461714888578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528169968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8065606,0.001662847,0.18968998,0.000025485058,0.00046732384,0.00018427584,0.000003263075,0.0003518137,0.0010544589],"genre_scores_gemma":[0.61039495,0.00077992055,0.38802183,0.0000130421495,0.00018688072,4.999154e-7,0.0000062145004,0.000039568476,0.00055712473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987199,0.000042183645,0.00029355192,0.00029214416,0.00032906607,0.00032319085],"domain_scores_gemma":[0.99932814,0.00003411984,0.00014499085,0.00022915253,0.00009925904,0.00016431152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011372043,0.00019836992,0.00026638576,0.00017371432,0.0004033333,0.00001229533,0.00035950186,0.0002603435,0.000027349515],"category_scores_gemma":[0.000010859435,0.00026445944,0.00012858363,0.00032074694,0.00013896756,0.00029003597,0.00007039933,0.00047662377,0.000015832826],"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.000013441233,0.000028880708,0.008233445,0.00010851079,0.00011923488,0.00013295886,0.003206868,0.9585468,0.028165784,0.000015450367,0.0002874079,0.0011411838],"study_design_scores_gemma":[0.0006211918,0.000025153717,0.002423222,0.00017455479,0.000077567165,0.0002595685,0.00092076143,0.99129367,0.003507186,0.000022234064,0.00033650955,0.0003383968],"about_ca_topic_score_codex":0.00006926736,"about_ca_topic_score_gemma":7.0979394e-7,"teacher_disagreement_score":0.19833183,"about_ca_system_score_codex":0.000201012,"about_ca_system_score_gemma":0.000088241446,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2540307815","doi":"","title":"A GISMOO algorithm for a multi-objective permutation flowshop with sequence-dependent setup times","year":2015,"lang":"en","type":"article","venue":"International Joint Conference on Computational Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Tardiness; Permutation (music); Sequence (biology); Algorithm; Computer science; Job shop scheduling; Mathematical optimization; Algorithm design; Mathematics; Schedule","score_opus":0.11626305329690134,"score_gpt":0.3255878732007519,"score_spread":0.20932481990385055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540307815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013978558,0.00003107409,0.99382436,0.0004128496,0.0009735048,0.00044073505,0.00022737634,0.00034328792,0.0023489678],"genre_scores_gemma":[0.462567,0.0000143999505,0.53608537,0.0001886736,0.00015626295,0.00016549001,0.0003767991,0.00003980607,0.00040621895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981123,0.00003817852,0.0004399115,0.0004411748,0.0007116824,0.00025676118],"domain_scores_gemma":[0.9977202,0.0001668503,0.000114940005,0.00014731174,0.0016649258,0.00018580578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025671255,0.00029802736,0.00022948686,0.0002880367,0.00008549674,0.00020553537,0.00030696616,0.000097873955,0.00016013779],"category_scores_gemma":[0.00013800907,0.00028037885,0.00007841198,0.00020061589,0.000100086065,0.00032091228,0.000031650914,0.00022879436,0.0001958667],"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.00004715341,0.000088567176,0.00001622618,0.000008138835,0.000117990785,0.000012050439,0.00092560955,0.9326745,0.000026457134,0.011118887,0.00013799389,0.054826412],"study_design_scores_gemma":[0.0006104676,0.00021059896,0.00006220369,0.00010324487,0.000015845339,0.000058569483,0.00107068,0.9873838,0.0017255808,0.008301617,0.00010416837,0.00035323403],"about_ca_topic_score_codex":0.0000251862,"about_ca_topic_score_gemma":0.000013036164,"teacher_disagreement_score":0.46116912,"about_ca_system_score_codex":0.0003414936,"about_ca_system_score_gemma":0.0002689174,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W2547360939","doi":"","title":"An exact method for solving the buffer sizing and inspection stations allocations problem","year":2013,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Sizing; Computer science; Process (computing); Mathematical optimization; Measure (data warehouse); Imperfect; Buffer (optical fiber); Production line; Work (physics); Algorithm; Data mining; Engineering; Mathematics","score_opus":0.009768267780498887,"score_gpt":0.2438541838544098,"score_spread":0.2340859160739109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2547360939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014119678,0.0004650794,0.980783,0.0019173049,0.00008581397,0.0010262246,0.000016403517,0.0014140193,0.00017246733],"genre_scores_gemma":[0.32819968,0.00009068311,0.6697908,0.00032206264,0.00008591287,0.0013541711,0.000029381234,0.00005160551,0.00007566835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989991,0.00005042339,0.0002756667,0.00022153463,0.000119841374,0.00033341954],"domain_scores_gemma":[0.9990711,0.00022017851,0.000060543935,0.0003483371,0.00015550476,0.00014434141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043002947,0.00018322971,0.00014658475,0.00018875262,0.00047307397,0.00034179166,0.00017568744,0.00012457161,0.000018908326],"category_scores_gemma":[0.00009620993,0.00015961297,0.000050878105,0.00030461448,0.00003492064,0.00052931684,0.000024104715,0.00021389688,0.000004830857],"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.0000066062485,0.00008033482,0.001615281,0.000057560257,0.00007852642,5.6338655e-7,0.0019011636,0.8961928,0.017867757,0.016463721,0.001357056,0.064378634],"study_design_scores_gemma":[0.00018856498,0.00004201016,0.005504684,0.000016722546,0.000027087359,0.000015703876,0.0005637109,0.98767996,0.0031150733,0.0023522754,0.00029659964,0.0001975998],"about_ca_topic_score_codex":0.0023059878,"about_ca_topic_score_gemma":0.00083529204,"teacher_disagreement_score":0.31408,"about_ca_system_score_codex":0.00014240308,"about_ca_system_score_gemma":0.000043169548,"threshold_uncertainty_score":0.65088284},"labels":[],"label_agreement":null},{"id":"W255402503","doi":"10.1007/s00170-015-7080-8","title":"An improved model and novel simulated annealing for distributed job shop problems","year":2015,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":57,"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 Windsor","funders":"","keywords":"Simulated annealing; Mathematical optimization; Metaheuristic; Computer science; Greedy algorithm; Job shop scheduling; Scheduling (production processes); Integer programming; Local search (optimization); Taguchi methods; Algorithm; Mathematics; Schedule; Machine learning","score_opus":0.017950304553981868,"score_gpt":0.2632512223375084,"score_spread":0.24530091778352656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W255402503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5080482,0.00011155942,0.49065033,0.0006515516,0.00030503163,0.00008237898,0.000018165136,0.00012684472,0.0000060035377],"genre_scores_gemma":[0.8436817,0.000039842387,0.15611134,0.000035753495,0.000083939325,0.0000047964545,0.000011002055,0.000022531296,0.000009101339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.000003273839,0.0003127161,0.00010127994,0.00014945045,0.00015253054],"domain_scores_gemma":[0.9992696,0.000049859427,0.00014021418,0.0001315626,0.0003407537,0.00006802115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022616997,0.00011967027,0.00015343762,0.00020076704,0.000042405016,0.00004712716,0.00047289307,0.0000962693,9.837829e-7],"category_scores_gemma":[0.000120828336,0.00009257318,0.000035191642,0.0000612364,0.00004845149,0.00022577282,0.000045094777,0.0002344877,2.8135193e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060175622,0.00001421207,0.000012821946,0.0000049964465,0.00006988641,0.0000015809559,0.00008500794,0.97815585,0.0156049915,0.00024226127,0.000011451197,0.0057367845],"study_design_scores_gemma":[0.0013756863,0.0000872566,0.00001378515,0.000028192573,0.000015232681,0.00010490037,0.00021920362,0.9304888,0.05892621,0.008504317,0.00013548235,0.00010089102],"about_ca_topic_score_codex":0.0000014046539,"about_ca_topic_score_gemma":0.0000028453198,"teacher_disagreement_score":0.33563355,"about_ca_system_score_codex":0.00009292986,"about_ca_system_score_gemma":0.000027260114,"threshold_uncertainty_score":0.37750247},"labels":[],"label_agreement":null},{"id":"W2555123112","doi":"10.1139/tcsme-2009-0020","title":"A TIME-PHASED PRODUCTION SCHEDULING SYSTEM FOR MULTIPLE ORDER WITH SINGLE ITEM","year":2009,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Production (economics); Scheduling (production processes); Production schedule; Workstation; Mathematical optimization; Production rate; Schedule; Production cost; Algorithm; Real-time computing; Industrial engineering; Mathematics; Engineering","score_opus":0.009170536062394052,"score_gpt":0.18593283372584438,"score_spread":0.17676229766345034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555123112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069898786,0.00006170187,0.9910023,0.0003452016,0.0005105719,0.0006890762,0.00006818281,0.000319373,0.000013690006],"genre_scores_gemma":[0.66183853,0.0000016038539,0.3378796,0.000020581923,0.00008459448,0.00007123652,0.000009607159,0.00004113652,0.000053109496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922013,0.0000037798095,0.00020872365,0.00016328438,0.00011035797,0.00029371865],"domain_scores_gemma":[0.99940264,0.000074173404,0.000030508074,0.00020377613,0.0001449749,0.00014392732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014458776,0.00015396666,0.00018077645,0.000056052984,0.00021395131,0.00002585149,0.00014029215,0.00013107063,0.0000042596157],"category_scores_gemma":[0.000060756574,0.00013678511,0.00026072504,0.00038291962,0.000016089727,0.00009061774,7.212619e-7,0.00014324892,6.3250803e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008731633,0.000013399489,1.8371585e-7,0.00013252461,0.000086431275,4.880267e-8,0.00010190794,0.9772496,0.02136873,0.00010454351,0.000023313652,0.0009105484],"study_design_scores_gemma":[0.0005412644,0.000067497174,0.0000015149554,0.00011689884,0.00008800659,0.000006734848,0.00013617103,0.9268171,0.07168062,0.000006212902,0.00037589515,0.00016206564],"about_ca_topic_score_codex":0.00013579479,"about_ca_topic_score_gemma":0.00069345196,"teacher_disagreement_score":0.65484864,"about_ca_system_score_codex":0.00036504274,"about_ca_system_score_gemma":0.00008694809,"threshold_uncertainty_score":0.5577935},"labels":[],"label_agreement":null},{"id":"W257990243","doi":"10.1023/a:1022283111797","title":"Modeling and reconfiguring intelligent holonic manufacturing systems with Internet-based mobile agents","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"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":"Environmental science; Computer science","score_opus":0.018443382121776188,"score_gpt":0.22829401013417513,"score_spread":0.20985062801239895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W257990243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5797417,0.0016931576,0.4171694,0.000007100827,0.0007844766,0.00017595782,0.0000011535095,0.00008634283,0.00034073467],"genre_scores_gemma":[0.9851762,0.00065892085,0.013796209,0.000031675983,0.00012697659,0.00001436467,0.0000024307649,0.00009007587,0.00010312846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787813,0.00007127127,0.0009353252,0.0002657824,0.00040134927,0.00044816665],"domain_scores_gemma":[0.99903506,0.000092050876,0.0002330659,0.00024969428,0.000109636945,0.00028047748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005808778,0.00039337963,0.00048537308,0.00048272315,0.0000889069,0.00024711838,0.00026066898,0.00013383848,0.00010917011],"category_scores_gemma":[0.00003141602,0.00032846277,0.0001390428,0.000085517706,0.000036280235,0.00028036363,0.000025446452,0.0006155773,0.000017735554],"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.000034913628,0.000033029202,0.00008404056,0.00018119019,0.00016736836,0.00006517661,0.00041430193,0.9921537,0.000048819347,0.000015921736,0.000015409983,0.006786099],"study_design_scores_gemma":[0.0003983417,0.00013855225,0.000013442041,0.0005835645,0.000059817958,0.00034376953,0.00087013067,0.67458415,0.3216287,0.000018302486,0.0010208111,0.00034041092],"about_ca_topic_score_codex":0.00001661926,"about_ca_topic_score_gemma":0.0000040517543,"teacher_disagreement_score":0.40543452,"about_ca_system_score_codex":0.00026605403,"about_ca_system_score_gemma":0.000042851694,"threshold_uncertainty_score":0.99991673},"labels":[],"label_agreement":null},{"id":"W2582191864","doi":"10.1007/s10951-018-0575-z","title":"Rescheduling due to machine disruption to minimize the total weighted completion time","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Ningbo; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unavailability; Mathematical optimization; Interval (graph theory); Time complexity; Computer science; Function (biology); Schedule; Standard deviation; Constraint (computer-aided design); Time constraint; Planner; Bounded function; Mathematics; Polynomial-time approximation scheme; Algorithm; Statistics; Artificial intelligence; Combinatorics","score_opus":0.011212975894958958,"score_gpt":0.24108736843861678,"score_spread":0.22987439254365782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582191864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45611632,0.00016448543,0.541032,0.0012374005,0.00096690527,0.00011974702,0.00000477103,0.00008672042,0.00027162832],"genre_scores_gemma":[0.49726,0.000010329605,0.50075614,0.0002752896,0.0015652052,0.000003598075,0.000004341868,0.000042328407,0.00008277695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984036,0.00006197618,0.0006485007,0.00015608394,0.00042626107,0.00030359783],"domain_scores_gemma":[0.9988074,0.00012457103,0.0001454384,0.0002195287,0.0004299103,0.00027317935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085857656,0.00020139401,0.0003235604,0.00029208744,0.00021392458,0.00014058672,0.0002913906,0.000091070506,0.0002046686],"category_scores_gemma":[0.00026728347,0.00015295939,0.00012488668,0.0006111047,0.000036879086,0.00020918342,0.000053051852,0.0003671086,0.00037859584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017967809,0.000044384844,0.00012954544,0.000019557488,0.00011223592,0.000023124101,0.0015711145,0.9576173,0.031413745,0.00008816696,0.00038180695,0.008419329],"study_design_scores_gemma":[0.0006117119,0.00017837006,0.0024070132,0.00021532744,0.000053517044,0.00031375996,0.00028903945,0.98810774,0.0069520916,0.000064645756,0.00053912424,0.00026767026],"about_ca_topic_score_codex":0.0000044029916,"about_ca_topic_score_gemma":0.0000013214301,"teacher_disagreement_score":0.041143678,"about_ca_system_score_codex":0.000114025075,"about_ca_system_score_gemma":0.000031883155,"threshold_uncertainty_score":0.62375027},"labels":[],"label_agreement":null},{"id":"W2582617327","doi":"10.1287/ijoc.2018.0817","title":"A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Production (economics); Decomposition; Routing (electronic design automation); Computer science; Business; Economics; Microeconomics; Chemistry; Computer network","score_opus":0.011765655494149048,"score_gpt":0.24953612547602821,"score_spread":0.23777046998187917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582617327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75912976,0.00007129512,0.23749186,0.000105811996,0.0017410204,0.00019647779,6.397558e-7,0.00017669846,0.0010864491],"genre_scores_gemma":[0.9565751,0.000022480546,0.042743824,0.00008332123,0.00047186244,0.0000013509069,0.0000037614616,0.00002259817,0.00007567899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992903,0.000011054831,0.00028722157,0.00008567942,0.0001276258,0.00019812369],"domain_scores_gemma":[0.9995466,0.00008266139,0.00009858283,0.00007436384,0.00011606258,0.000081760285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054360763,0.00010033005,0.000120738936,0.00014244312,0.00022316692,0.00017696829,0.0000667936,0.000052212017,0.0000056652325],"category_scores_gemma":[0.000163173,0.00009386732,0.000039232833,0.00009366311,0.00000962491,0.00019948154,0.000012719793,0.00022293319,0.000013207558],"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.000018887815,0.000012289169,0.0014463299,0.00007543994,0.00003901626,0.0000018160758,0.00088896387,0.9751489,0.00017107379,0.0014213759,0.0001742383,0.020601662],"study_design_scores_gemma":[0.00040418038,0.000065495304,0.0004896718,0.00026806397,0.0000090840795,0.00011547184,0.0002393399,0.99716586,0.00036393947,0.00022004213,0.00051068293,0.00014818409],"about_ca_topic_score_codex":7.538705e-7,"about_ca_topic_score_gemma":3.9901172e-7,"teacher_disagreement_score":0.19744538,"about_ca_system_score_codex":0.00008684422,"about_ca_system_score_gemma":0.000026642034,"threshold_uncertainty_score":0.3827798},"labels":[],"label_agreement":null},{"id":"W2586195501","doi":"10.1007/978-3-319-51340-9_12","title":"Debottlenecking High Temperature Metallurgical Plants Through Modeling and Simulation","year":2017,"lang":"en","type":"book-chapter","venue":"˜The œminerals, metals & materials series","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Hatch (Canada)","funders":"","keywords":"Bottleneck; Brainstorming; Process engineering; Throughput; Process (computing); Manufacturing engineering; Engineering; Simulation modeling; Process modeling; Computer science; Industrial engineering; Mechanical engineering; Work in process; Operations management","score_opus":0.025606914953233296,"score_gpt":0.2396230497686631,"score_spread":0.2140161348154298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586195501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6153003,0.069949865,0.071116365,0.002249139,0.045395717,0.008387283,0.0059393393,0.009527887,0.17213409],"genre_scores_gemma":[0.849202,0.0048418776,0.019398937,0.00018707212,0.0023475382,0.0000723949,0.00096537726,0.00045558249,0.12252926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979449,0.00006261258,0.0007251948,0.000494462,0.00039575633,0.0003771087],"domain_scores_gemma":[0.9987344,0.000094794064,0.00026502463,0.00069959817,0.000119731485,0.000086413704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044176145,0.0007400016,0.0010586045,0.00009952275,0.00045725712,0.0009263662,0.00039704723,0.00063279085,0.0004520042],"category_scores_gemma":[0.000033819517,0.000557818,0.00013146581,0.000018080093,0.00014234219,0.0006082628,0.0001509329,0.0003370771,0.00005583959],"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.00006076846,0.000005725961,1.2562545e-7,0.00017868419,0.00040596648,0.00002684414,0.00025472042,0.97639656,0.016925305,0.00545458,0.00011778788,0.00017292674],"study_design_scores_gemma":[0.002062032,0.0001614457,0.0000100038,0.0016749484,0.0016633434,0.0003661575,0.00016375807,0.8490224,0.026440186,0.04297082,0.0710924,0.0043725385],"about_ca_topic_score_codex":0.000046947756,"about_ca_topic_score_gemma":0.000029878418,"teacher_disagreement_score":0.23390165,"about_ca_system_score_codex":0.000037362694,"about_ca_system_score_gemma":0.000026250045,"threshold_uncertainty_score":0.9996873},"labels":[],"label_agreement":null},{"id":"W2590288486","doi":"10.5267/j.uscm.2017.1.002","title":"A two-stage production planning model for perishable products under uncertainty","year":2017,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production (economics); Production planning; Business; Stage (stratigraphy); Computer science; Operations management; Environmental economics; Industrial organization; Microeconomics; Economics","score_opus":0.03474303607002339,"score_gpt":0.2789588770302202,"score_spread":0.24421584096019683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590288486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024444453,0.00038495005,0.9568574,0.0029582987,0.0023161336,0.0027647426,0.00006472051,0.0011468733,0.009062438],"genre_scores_gemma":[0.72632694,0.00008151097,0.24384356,0.00025141437,0.00055535167,0.0007056765,0.00015043054,0.000118709344,0.027966378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838376,0.000018434039,0.0002854243,0.00053232553,0.00026827605,0.00051176065],"domain_scores_gemma":[0.99872726,0.00002143447,0.00013473882,0.0009061531,0.000121199315,0.000089222696],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052461895,0.00028927083,0.00023325454,0.00016407757,0.0006533587,0.00030786885,0.00044183072,0.00006859293,0.000030743642],"category_scores_gemma":[0.000108687105,0.0002982133,0.000072772506,0.00012033996,0.00006470718,0.00028765708,0.00009697844,0.00014344105,0.0000147882465],"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.000029482602,0.00003112207,0.00012802245,0.0002863386,0.00009759877,0.0000063861557,0.00048191252,0.9890712,0.000069698144,0.0024857323,0.0051219235,0.0021905696],"study_design_scores_gemma":[0.00088045927,0.000017538361,0.00012980221,0.00008919085,0.000041796007,0.0000013916199,0.0010136544,0.99193215,0.00026821674,0.00073001237,0.0045222235,0.00037358695],"about_ca_topic_score_codex":0.000031623233,"about_ca_topic_score_gemma":0.00001692354,"teacher_disagreement_score":0.7130138,"about_ca_system_score_codex":0.00020064601,"about_ca_system_score_gemma":0.000022358925,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W2592827424","doi":"10.1016/j.cie.2017.02.021","title":"Order acceptance and scheduling with batch delivery","year":2017,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"BP (Canada)","funders":"National Natural Science Foundation of China","keywords":"Lead time; Scheduling (production processes); Computer science; Mathematical optimization; Due date; Supply chain; Job shop scheduling; Total cost; Order (exchange); Approximation algorithm; Algorithm; Operations management; Mathematics; Engineering; Schedule; Business","score_opus":0.02017966743531964,"score_gpt":0.20856689571019496,"score_spread":0.1883872282748753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592827424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49036282,0.00028104297,0.5065,0.00009352016,0.0018210608,0.00014010063,0.0000029634514,0.00057749747,0.00022099541],"genre_scores_gemma":[0.8099578,0.00005000172,0.1892255,0.00001834372,0.000664282,0.000008187238,0.0000042570223,0.000053739113,0.000017919574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923486,0.0000050151893,0.00016200282,0.00020621785,0.00012542357,0.00026651486],"domain_scores_gemma":[0.9994048,0.000048865455,0.000041602307,0.00032657027,0.000051044346,0.00012712418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009527617,0.00020589291,0.0002022547,0.00008359997,0.00018826162,0.000329349,0.00026044858,0.00013754776,0.00001007409],"category_scores_gemma":[0.00006330061,0.00020725466,0.000024132867,0.00010749235,0.000036550362,0.0003237145,0.000071026174,0.00033426928,0.000005541519],"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.0000068418703,0.0000035321636,0.00069061655,0.000014681081,0.000064835775,0.000011463979,0.00006671338,0.9785393,0.000091662696,0.000059320413,0.000047811023,0.020403238],"study_design_scores_gemma":[0.0010052776,0.00002263756,0.00075630465,0.00014649004,0.00001724161,0.000015487212,0.000023001745,0.9965178,0.00059099164,0.0000019263427,0.00061231595,0.00029055696],"about_ca_topic_score_codex":0.000008465714,"about_ca_topic_score_gemma":0.00000134324,"teacher_disagreement_score":0.31959495,"about_ca_system_score_codex":0.000038293656,"about_ca_system_score_gemma":0.00002196147,"threshold_uncertainty_score":0.84516},"labels":[],"label_agreement":null},{"id":"W2592943388","doi":"10.71781/9766","title":"Architecture de communication générique pour un système de bus du commerce électronique","year":2003,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012377798510353267,"score_gpt":0.26243131988494195,"score_spread":0.2500535213745887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592943388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17291741,0.005957269,0.73756105,0.0035061764,0.00067576393,0.0017264567,0.000109794026,0.000054776876,0.0774913],"genre_scores_gemma":[0.0697549,0.0012571854,0.9099201,0.00018887807,0.00014892493,0.0001598333,0.0019925062,0.00018316311,0.016394539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976927,0.00064413226,0.00052223075,0.00039095845,0.00016731786,0.0005826366],"domain_scores_gemma":[0.99835694,0.00027218668,0.00024390772,0.00070749683,0.0001921184,0.00022733875],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00090677163,0.00046849446,0.00048010648,0.00014681685,0.00035959907,0.0004355167,0.001087588,0.0007772606,0.002087017],"category_scores_gemma":[0.0002319449,0.0005731799,0.00013218167,0.00033860636,0.00004327141,0.0001527257,0.000076772456,0.0012276609,0.00031947973],"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.00006860673,0.00020763063,0.0006116565,0.00018958008,0.00029546118,0.000023907667,0.018576674,0.87626433,0.0015581021,0.0014521378,0.000388684,0.10036323],"study_design_scores_gemma":[0.0027475068,0.0001637569,0.002908294,0.00262334,0.00058005075,0.00059824827,0.008213811,0.8362477,0.11411275,0.0038739732,0.025484126,0.0024464428],"about_ca_topic_score_codex":0.001236109,"about_ca_topic_score_gemma":0.0010437991,"teacher_disagreement_score":0.17235902,"about_ca_system_score_codex":0.0010443093,"about_ca_system_score_gemma":0.0007566845,"threshold_uncertainty_score":0.99967194},"labels":[],"label_agreement":null},{"id":"W2593859287","doi":"","title":"Empirical improvements of a dynamic scheduling engine in an industrial environment","year":2016,"lang":"en","type":"other","venue":"Espace ÉTS (ETS)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut de Technologie Agroalimentaire","funders":"Mitacs","keywords":"Computer science; Flow shop scheduling; Dynamic priority scheduling; Metaheuristic; Scheduling (production processes); Scalability; Job shop scheduling; Distributed computing; Mathematical optimization; Schedule; Industrial engineering; Engineering; Algorithm; Database","score_opus":0.015027499067811577,"score_gpt":0.2568156779947208,"score_spread":0.24178817892690924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593859287","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18900113,0.01088479,0.56391126,0.0018992403,0.018323235,0.008191678,0.0015792634,0.0067314664,0.19947796],"genre_scores_gemma":[0.13755988,0.002813092,0.3528631,0.00019558391,0.0035918655,0.0003505103,0.00068244437,0.0046858457,0.49725768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875206,0.00003962192,0.0003150668,0.00031976006,0.0002618816,0.00031159123],"domain_scores_gemma":[0.9993472,0.00002935158,0.00010938475,0.0003843369,0.000008762512,0.000120963334],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015233009,0.0003172329,0.00039492414,0.00042123217,0.00001264627,0.000017931063,0.0002125896,0.0005075878,0.001753692],"category_scores_gemma":[0.000028300905,0.0002959152,0.000063908476,0.00013554835,0.000037411286,0.000055623153,0.000046357363,0.00034340657,0.00016187965],"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.00023389516,0.0011865713,0.0079954425,0.0007630525,0.001079009,0.00011749344,0.0023745233,0.7056915,0.0066130916,0.000091464455,0.033172794,0.24068117],"study_design_scores_gemma":[0.009093076,0.00032568708,0.0006468836,0.0017671357,0.00013854909,0.000005373262,0.00033233542,0.8781851,0.0016619478,0.00003924625,0.10552324,0.002281416],"about_ca_topic_score_codex":0.000017167526,"about_ca_topic_score_gemma":0.000042913747,"teacher_disagreement_score":0.29777974,"about_ca_system_score_codex":0.00017656569,"about_ca_system_score_gemma":0.00003925591,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W2594565554","doi":"10.5281/zenodo.495155","title":"Production Scheduling in Complex Job Shops from an Industrie 4.0 Perspective: A Review and Challenges in the Semiconductor Industry","year":2017,"lang":"en","type":"review","venue":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"European Commission","keywords":"Perspective (graphical); Semiconductor industry; Industry 4.0; Production (economics); Business; Computer science; Engineering; Operations management; Manufacturing engineering; Economics; Artificial intelligence; Microeconomics","score_opus":0.25369920636190674,"score_gpt":0.37846007096025575,"score_spread":0.12476086459834901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594565554","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060360227,0.9846718,0.000044951852,0.007499053,0.001085189,0.003251223,0.00026507114,0.000492047,0.0020870685],"genre_scores_gemma":[0.00036100778,0.9919651,0.003078895,0.00048322862,0.0018134457,0.0008937302,0.0007626373,0.00038125846,0.0002606691],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9917931,0.0013032214,0.0021859813,0.0023295658,0.00095609494,0.0014320675],"domain_scores_gemma":[0.99456567,0.00053451274,0.00076035556,0.0031109818,0.0004775827,0.0005508997],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.002995862,0.0018057534,0.0040457686,0.0013751859,0.0004329721,0.000705019,0.0025360335,0.0032247964,0.00055241253],"category_scores_gemma":[0.0019205252,0.0015306527,0.00042070975,0.001813904,0.00035987067,0.0014488059,0.00036559073,0.008035129,0.00015090233],"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.000026549296,0.000793998,0.0003232453,0.036761425,0.0008392675,0.0001422108,0.0063892915,0.0018644091,0.000004717183,0.0010982392,0.0064399214,0.94531673],"study_design_scores_gemma":[0.00090560893,0.00010287877,0.00046224025,0.0236119,0.0008611586,0.00018818452,0.0027926813,0.003181654,0.0000028733166,0.00023319393,0.9654692,0.002188432],"about_ca_topic_score_codex":0.0003951776,"about_ca_topic_score_gemma":0.0003766895,"teacher_disagreement_score":0.95902926,"about_ca_system_score_codex":0.00083869154,"about_ca_system_score_gemma":0.0006399559,"threshold_uncertainty_score":0.99946874},"labels":[],"label_agreement":null},{"id":"W2595965212","doi":"10.1142/s0217595917500099","title":"The Supplying Chain Scheduling with Outsourcing and Transportation","year":2017,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Outsourcing; Scheduling (production processes); Supply chain; Computer science; Operations research; Job shop scheduling; Schedule; Supply chain management; Operations management; Mathematical optimization; Business; Mathematics; Engineering; Marketing; Operating system","score_opus":0.03636940252046441,"score_gpt":0.314691723051226,"score_spread":0.2783223205307616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595965212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903209,0.0026962168,0.18788783,0.010809999,0.00067102036,0.00042710511,0.000012892781,0.000051725314,0.007122321],"genre_scores_gemma":[0.9758674,0.00034663462,0.023397632,0.0000034442196,0.00019221762,0.0000051117436,0.00000303896,0.000016357202,0.00016817215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.00004930001,0.0002371783,0.00007885806,0.00058265484,0.00019364894],"domain_scores_gemma":[0.9989513,0.00022081698,0.00006481376,0.00014604689,0.00052465545,0.000092354254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0017924791,0.00007300544,0.000098255216,0.000106290994,0.0013209297,0.0006741163,0.0002084548,0.00003938584,0.000012407053],"category_scores_gemma":[0.00024324475,0.00004745965,0.000024144416,0.00007721874,0.0001465316,0.00037091237,0.000007464683,0.00043876615,0.0000030432975],"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.00015636439,0.000027119464,0.016607247,0.000041224626,0.00017959424,0.00007163884,0.0035366593,0.9435822,0.002449202,0.008930719,0.0002953549,0.02412271],"study_design_scores_gemma":[0.002006017,0.0003007781,0.051292636,0.0003706057,0.000028943492,0.0002660565,0.01686925,0.92063516,0.003750709,0.000672123,0.0034725375,0.00033519103],"about_ca_topic_score_codex":0.000004783364,"about_ca_topic_score_gemma":0.000014213835,"teacher_disagreement_score":0.18554652,"about_ca_system_score_codex":0.000036391215,"about_ca_system_score_gemma":0.00009715403,"threshold_uncertainty_score":0.9999792},"labels":[],"label_agreement":null},{"id":"W2595993238","doi":"","title":"15th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2015","year":2015,"lang":"en","type":"book","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":62,"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é du Québec en Outaouais","funders":"","keywords":"Control (management); Computer science; Artificial intelligence","score_opus":0.007113810965062119,"score_gpt":0.191799756494942,"score_spread":0.18468594552987988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595993238","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072392676,0.0007529884,0.15558547,0.0020003938,0.00064256036,0.0009506221,0.0001465103,0.00094586256,0.83825165],"genre_scores_gemma":[0.15398149,0.0030144285,0.11699028,0.0009537955,0.00035691354,0.00057409273,0.009674457,0.000671933,0.7137826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974998,0.0006921079,0.0006578695,0.00031085213,0.00049615506,0.0003432083],"domain_scores_gemma":[0.99727744,0.00047881645,0.00026321827,0.0009738412,0.0008146125,0.00019206769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002722955,0.00038825386,0.00040456143,0.00047208217,0.00010810526,0.00028682605,0.0006024624,0.000397678,0.0000761959],"category_scores_gemma":[0.00025803034,0.00042548092,0.00010183325,0.00017950789,0.00006964816,0.000386341,0.00010450199,0.0007167681,0.00029504256],"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.000038894297,0.00037471822,0.0002731822,0.00095753826,0.0002691653,0.000010443266,0.018420069,0.8658703,0.00010181673,0.017613888,0.04471456,0.051355407],"study_design_scores_gemma":[0.0035491216,0.0000021814199,0.0002841636,0.004349838,0.00006847101,0.000013786009,0.00009971638,0.7343424,0.005063182,0.0023486211,0.24850357,0.0013749243],"about_ca_topic_score_codex":0.0000897718,"about_ca_topic_score_gemma":0.00024099644,"teacher_disagreement_score":0.20378901,"about_ca_system_score_codex":0.0005297035,"about_ca_system_score_gemma":0.00023140668,"threshold_uncertainty_score":0.9998197},"labels":[],"label_agreement":null},{"id":"W2598668330","doi":"10.3233/978-1-61499-119-9-149","title":"Scheduling a hybrid flowshop with parallel machines for aircraft assembly production","year":2012,"lang":"en","type":"book-chapter","venue":"IOS Press eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Engineering; Operations management","score_opus":0.025063369347924608,"score_gpt":0.2283997300949593,"score_spread":0.2033363607470347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598668330","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004951982,0.006662724,0.5210942,0.00007058407,0.0036075334,0.0029879631,0.00017336865,0.002851364,0.46205705],"genre_scores_gemma":[0.0071003176,0.00024028266,0.46962324,0.000080985126,0.004323847,0.0006939969,0.0003265108,0.000804086,0.5168067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849343,0.000009661611,0.0003659038,0.0004515451,0.00027684917,0.000402606],"domain_scores_gemma":[0.9990043,0.00004983685,0.00012054239,0.0004996641,0.00017783717,0.00014782496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015989374,0.0005355613,0.00044727966,0.0001413314,0.00012127315,0.00008756865,0.0002068966,0.00025816297,0.000020396703],"category_scores_gemma":[0.000024485284,0.00049464515,0.00014528519,0.000007546175,0.000048832047,0.000112432754,0.00003544822,0.00042262947,0.000019511222],"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.00018971028,0.00003338051,0.0000036794836,0.0011761031,0.00088011875,0.000017785274,0.0004847328,0.9100576,0.00033593096,0.015095654,0.0013907332,0.07033455],"study_design_scores_gemma":[0.0017833011,0.00016320999,0.000004163651,0.0012776884,0.0008012321,0.00019537173,0.000014097595,0.7725921,0.007767303,0.0017427661,0.21115014,0.0025085984],"about_ca_topic_score_codex":0.000007454872,"about_ca_topic_score_gemma":0.000008186062,"teacher_disagreement_score":0.2097594,"about_ca_system_score_codex":0.000059997667,"about_ca_system_score_gemma":0.000036634647,"threshold_uncertainty_score":0.9997505},"labels":[],"label_agreement":null},{"id":"W2598696228","doi":"10.1016/j.ejor.2017.03.028","title":"A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":56,"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":"Agence Nationale de la Recherche","keywords":"Tardiness; Mathematical optimization; Travelling salesman problem; Scheduling (production processes); Computer science; Job shop scheduling; Heuristic; Benders' decomposition; Production (economics); Decomposition; Heuristics; Operations research; Mathematics; Schedule","score_opus":0.05202032477694222,"score_gpt":0.3255017149963965,"score_spread":0.2734813902194543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598696228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.382989,0.00015662202,0.61478245,0.0010710111,0.0001756033,0.0003132771,0.0000430715,0.000023689214,0.0004452912],"genre_scores_gemma":[0.8884813,0.000034307286,0.11114017,0.000009182577,0.00024785122,0.0000052288506,0.000038518854,0.000020646687,0.000022800928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886876,0.00016689724,0.00026773548,0.00012793645,0.00039620372,0.00017245438],"domain_scores_gemma":[0.9983595,0.0001707887,0.00008914901,0.00011670904,0.0011510547,0.00011277589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002278106,0.00008860293,0.00010664535,0.00012544083,0.0007548626,0.00047259263,0.0001522942,0.00001897932,0.000013295683],"category_scores_gemma":[0.00090956356,0.00007562437,0.000030057672,0.00007206928,0.0002602347,0.00031295916,0.000015815558,0.00027407068,0.0000034492384],"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.00029560202,0.000064385276,0.0010037463,0.00008909711,0.000094540395,0.000044056127,0.00020965665,0.9887506,0.0010124119,0.0005157457,0.00044145656,0.0074786986],"study_design_scores_gemma":[0.0032117118,0.0009419951,0.016713891,0.00073318364,0.000052474898,0.00028043034,0.0006606512,0.97415704,0.0023423862,0.00012944521,0.00044214356,0.00033466337],"about_ca_topic_score_codex":0.0000012745502,"about_ca_topic_score_gemma":0.0000020297969,"teacher_disagreement_score":0.5054923,"about_ca_system_score_codex":0.00008500476,"about_ca_system_score_gemma":0.00018768662,"threshold_uncertainty_score":0.5805869},"labels":[],"label_agreement":null},{"id":"W2602983699","doi":"","title":"Scheduling Technicians and Tasks in a Telecommunications Company","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Scheduling (production processes); Computer science; Operations research; Technician; Heuristic; Job shop scheduling; Task (project management); Industrial engineering; Operations management; Engineering; Artificial intelligence; Systems engineering; Computer network","score_opus":0.018837360294997066,"score_gpt":0.23224510213460017,"score_spread":0.2134077418396031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602983699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68295056,0.0016124405,0.28464982,0.00042792695,0.000096958865,0.0001829146,0.000002785413,0.0012015977,0.028875038],"genre_scores_gemma":[0.6850235,0.00037005692,0.31448433,0.00003951317,0.0000080706695,0.000007807817,0.000002915997,0.000009382563,0.00005442763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996665,0.0000074594836,0.00012003201,0.00006433861,0.000040127856,0.00010153453],"domain_scores_gemma":[0.99976575,0.00002979392,0.000006854765,0.00015173,0.000013714419,0.00003216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048792714,0.000058638187,0.00007764898,0.000098584795,0.000060677427,0.000009399498,0.00007620329,0.000041665167,0.000028203913],"category_scores_gemma":[0.000015546048,0.00006104501,0.000010618864,0.00021717609,0.00003109159,0.00005274889,0.00001746383,0.00012941491,0.0000148838935],"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.0000014047315,0.000043498043,0.00763646,0.000012264931,0.000012959692,0.0000060341226,0.00087867974,0.98459697,0.0005299676,0.0010605121,0.00015245301,0.0050688144],"study_design_scores_gemma":[0.00021394473,0.0000044352323,0.005007408,0.0000130627,0.000001733834,0.000027203878,0.00018273208,0.9937159,0.00034941718,0.000037662234,0.00034106578,0.00010543377],"about_ca_topic_score_codex":0.000022813803,"about_ca_topic_score_gemma":0.000041580624,"teacher_disagreement_score":0.02983452,"about_ca_system_score_codex":0.000017578597,"about_ca_system_score_gemma":0.0000074731993,"threshold_uncertainty_score":0.24893431},"labels":[],"label_agreement":null},{"id":"W2605057693","doi":"10.1016/j.cie.2017.04.002","title":"An effective and efficient heuristic for no-wait flow shop production to minimize total completion time","year":2017,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"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 Calgary","funders":"Agency for Healthcare Research and Quality; University of Calgary; University of Kentucky","keywords":"Heuristics; Flow shop scheduling; Computation; Mathematical optimization; Computer science; Idle; Scheduling (production processes); Heuristic; Minification; Job shop scheduling; Mathematics; Algorithm; Schedule","score_opus":0.014787049022658443,"score_gpt":0.22335515099424813,"score_spread":0.20856810197158968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605057693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27268693,0.00001886383,0.7214808,0.000062368585,0.0045745987,0.0007407308,0.000018486973,0.00039742622,0.000019825786],"genre_scores_gemma":[0.778146,0.0000018717407,0.21843655,0.000012027913,0.0030994492,0.00012184496,0.00006001296,0.000081276994,0.000040945157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991265,0.000013760846,0.00019343082,0.00029772325,0.00011727829,0.00025133154],"domain_scores_gemma":[0.9993153,0.00009459382,0.000038202743,0.00029937754,0.00008348478,0.00016901855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021630447,0.00020467222,0.00024413563,0.00012388447,0.0001978058,0.00021752487,0.00015454236,0.00012194851,0.000004767123],"category_scores_gemma":[0.0003555603,0.00023306214,0.000044942717,0.000074610754,0.000019768171,0.00012086137,0.000041373987,0.00016687428,0.000018025425],"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.00003446515,0.000015544962,0.000014548113,0.000026705988,0.000030480755,0.0000011865849,0.00013551171,0.9784521,0.001738448,0.000009030938,0.00025112505,0.01929085],"study_design_scores_gemma":[0.0009058378,0.00010986607,0.0010191693,0.000103239734,0.000023374514,0.000008793995,0.0000068037866,0.9962519,0.001093483,9.298368e-7,0.0002147132,0.00026187891],"about_ca_topic_score_codex":0.000003398093,"about_ca_topic_score_gemma":1.2129749e-7,"teacher_disagreement_score":0.5054591,"about_ca_system_score_codex":0.00008802055,"about_ca_system_score_gemma":0.000008652974,"threshold_uncertainty_score":0.95039976},"labels":[],"label_agreement":null},{"id":"W2606942538","doi":"10.23977/jemm.2016.11005","title":"Approximation Algorithm for Scheduling Parallel Machines with Machine Eligibility Restrictions and special jobs","year":2016,"lang":"en","type":"article","venue":"Journal of Engineering Mechanics and Machinery","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Specialized Research Fund for the Doctoral Program of Higher Education of China; National Natural Science Foundation of China","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Algorithm; Path (computing); Vertex (graph theory); Greedy algorithm; Mathematics; Graph; Theoretical computer science","score_opus":0.008530472229660364,"score_gpt":0.21920825192782015,"score_spread":0.2106777796981598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606942538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026813433,0.00089028355,0.97133046,0.00013705259,0.00057656283,0.00012891355,0.00002642001,0.00007869129,0.000018197496],"genre_scores_gemma":[0.12036192,0.0012730255,0.87721616,0.000023518563,0.0010303373,0.000011896387,0.0000052014448,0.00005741533,0.000020539212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917096,0.000010479834,0.0003576334,0.0001360449,0.00014663066,0.00017826323],"domain_scores_gemma":[0.99941,0.00013383158,0.00010143692,0.000101246515,0.00011873434,0.00013479937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036220226,0.00018811424,0.00026147562,0.00020350586,0.000069774804,0.00005370318,0.00007250867,0.00007028403,0.00000529486],"category_scores_gemma":[0.00010581903,0.00012495792,0.00005631663,0.00012760903,0.000009046705,0.00022486993,0.000018186003,0.0001697466,2.689731e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105175175,0.00006996089,0.00032615755,0.00023802242,0.00030922933,0.000014296881,0.0001771816,0.80179524,0.0045199683,0.009881914,0.00015051891,0.18241233],"study_design_scores_gemma":[0.0011911266,0.00013652278,0.00017087262,0.00010244107,0.000054091743,0.00015010487,0.000014029505,0.9963125,0.00019971866,0.0011405371,0.00034265057,0.00018539815],"about_ca_topic_score_codex":0.0000022580527,"about_ca_topic_score_gemma":0.0000022440036,"teacher_disagreement_score":0.19451725,"about_ca_system_score_codex":0.000038409336,"about_ca_system_score_gemma":0.00001824537,"threshold_uncertainty_score":0.5095636},"labels":[],"label_agreement":null},{"id":"W2607302740","doi":"10.1007/s10951-017-0518-0","title":"Scheduling shared continuous resources on many-cores","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Bundesministerium für Bildung und Forschung; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Computer science; Job shop scheduling; Scheduling (production processes); Time complexity; Heuristic; Mathematical optimization; Job scheduler; Parallel computing; Shared resource; Distributed computing; Algorithm; Schedule; Mathematics; Computer network","score_opus":0.018685284151203938,"score_gpt":0.25273428196350617,"score_spread":0.23404899781230223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607302740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.954228,0.0012502376,0.037921086,0.0004807601,0.0020194375,0.000085541884,0.0000050815406,0.00015725894,0.0038525867],"genre_scores_gemma":[0.81150883,0.00016643504,0.1869906,0.00008043992,0.0010896875,0.000001716475,0.0000012827827,0.00005490796,0.000106112995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984097,0.000026836815,0.0006336077,0.00016210608,0.00043872523,0.00032903554],"domain_scores_gemma":[0.9984865,0.00010862821,0.0005108968,0.0004269327,0.00025917808,0.00020784204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312926,0.00023485371,0.0004212601,0.0002611361,0.00042347133,0.0006114011,0.0007022007,0.00015017184,0.00008052811],"category_scores_gemma":[0.0006973493,0.00021162535,0.00019815193,0.00008523848,0.00006972567,0.00052070507,0.000052293257,0.00064878847,0.00005192956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008014344,0.00004763155,0.0028352288,0.00005331661,0.00016629054,0.00013173073,0.0006786431,0.98270196,0.0020934548,0.00029248896,0.00015234444,0.010766747],"study_design_scores_gemma":[0.0030392127,0.00032032587,0.00914757,0.0016005922,0.00013329579,0.00024092794,0.0014914387,0.96696776,0.013410191,0.0005054207,0.002364312,0.0007789232],"about_ca_topic_score_codex":0.0000040276786,"about_ca_topic_score_gemma":0.0000010740649,"teacher_disagreement_score":0.14906952,"about_ca_system_score_codex":0.000067096495,"about_ca_system_score_gemma":0.000032989108,"threshold_uncertainty_score":0.8629831},"labels":[],"label_agreement":null},{"id":"W2607756344","doi":"10.5539/mas.v11n6p56","title":"An Integrated Simulation Optimisation Decision Support Tool for Multi-Product Production Systems","year":2017,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Production (economics); Production planning; Industrial engineering; Product (mathematics); Efficient energy use; Energy (signal processing); Dimension (graph theory); Mathematical optimization; Manufacturing engineering; Operations research; Engineering; Mathematics","score_opus":0.04557162188890151,"score_gpt":0.31044575358825804,"score_spread":0.26487413169935653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607756344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06857188,0.000009259416,0.9290362,0.000012902775,0.0012503673,0.00064432307,0.0000064601154,0.0003325669,0.00013601698],"genre_scores_gemma":[0.7032536,0.0000027701658,0.2964408,0.000004881919,0.00012386711,0.00006884883,0.000023539891,0.000019094747,0.000062596584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871653,0.0000058086894,0.00023891547,0.00047439765,0.0003202542,0.00024410167],"domain_scores_gemma":[0.99882084,0.00001958621,0.00009457261,0.0007187288,0.0002681359,0.00007811126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000902192,0.00013973608,0.00012775826,0.000138187,0.00077623304,0.0005757254,0.0004263273,0.0000567401,0.000004505649],"category_scores_gemma":[0.0002862216,0.0001334432,0.000021276112,0.00016150682,0.00012411241,0.00081719813,0.000022107519,0.00008264234,0.000014524034],"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.000014799777,0.000019288436,0.000032459637,0.000012657059,0.0000021397577,9.162556e-8,0.00024873187,0.8763602,0.047782425,0.00006049827,0.000014416791,0.07545234],"study_design_scores_gemma":[0.00030497962,0.000016454305,0.0005534112,0.000012931891,0.0000071342483,0.0000012538046,0.000056649827,0.9869202,0.011788616,0.000074839314,0.00008515188,0.00017840437],"about_ca_topic_score_codex":0.000005819428,"about_ca_topic_score_gemma":0.000002503068,"teacher_disagreement_score":0.6346817,"about_ca_system_score_codex":0.00012544949,"about_ca_system_score_gemma":0.00006298238,"threshold_uncertainty_score":0.59702355},"labels":[],"label_agreement":null},{"id":"W2608412824","doi":"","title":"Scheduling Multiple Parts in Two-Machine Dual-Gripper Robot Cells: Heuristic Algorithm and Performance Guarantee","year":2004,"lang":"en","type":"article","venue":"International Journal of Operations and Quantitative Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robot; Scheduling (production processes); Job shop scheduling; Dual (grammatical number); Computer science; Sequence (biology); Algorithm; Set (abstract data type); Upper and lower bounds; Heuristic; Mathematical optimization; Artificial intelligence; Mathematics; Schedule","score_opus":0.01445484280042703,"score_gpt":0.2733777627243815,"score_spread":0.2589229199239545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608412824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40471253,0.0012497564,0.5926815,0.00037204294,0.00063127634,0.00011971602,0.000012970096,0.000019216608,0.00020098123],"genre_scores_gemma":[0.650213,0.001735948,0.34792107,0.000045814882,0.000043244185,0.0000048914335,0.0000064013784,0.000009348663,0.00002026935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991714,0.000019539673,0.00037920743,0.000111954636,0.00020942843,0.000108477136],"domain_scores_gemma":[0.99964,0.000044374996,0.000049962273,0.000051073413,0.00017337476,0.00004121549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023707311,0.00011914362,0.00014289473,0.00030417865,0.00006962396,0.00012865166,0.000087493354,0.000018644543,0.000014474959],"category_scores_gemma":[0.000026290247,0.000108634806,0.000027637896,0.0001122343,0.000040738974,0.0003345799,0.00003608234,0.00014759216,0.000004565139],"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.000016173395,0.000055077497,0.0004799503,0.00001428893,0.00011314562,0.00005579585,0.000600971,0.98523384,0.000102507875,0.0031044167,0.000004240069,0.01021961],"study_design_scores_gemma":[0.002001558,0.000080722224,0.0026425144,0.00017168307,0.000020561043,0.000053605396,0.00072000513,0.993446,0.0004479262,0.00018122666,0.00010214919,0.00013207954],"about_ca_topic_score_codex":0.000020850955,"about_ca_topic_score_gemma":0.000038410024,"teacher_disagreement_score":0.24550048,"about_ca_system_score_codex":0.00006210753,"about_ca_system_score_gemma":0.000012119358,"threshold_uncertainty_score":0.44299987},"labels":[],"label_agreement":null},{"id":"W2609401311","doi":"10.1007/s10951-018-0566-0","title":"Shared processor scheduling","year":2018,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Time complexity; Job shop scheduling; Optimization problem; Mathematical optimization; Parallel computing; Mathematics; Algorithm; Schedule","score_opus":0.016660781875116642,"score_gpt":0.24995005742866214,"score_spread":0.2332892755535455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609401311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696988,0.0016968434,0.42362174,0.00024390606,0.002179463,0.00008235022,0.0000026411235,0.00024430503,0.0022299252],"genre_scores_gemma":[0.5813978,0.000047095844,0.41705406,0.00006747443,0.0013680905,0.0000011336688,9.952394e-7,0.000034778717,0.000028601144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865264,0.000017465805,0.00060613255,0.000118578464,0.00033547194,0.00026971387],"domain_scores_gemma":[0.99880564,0.000050739633,0.00019901332,0.00014419842,0.0006202752,0.00018012503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005092814,0.00017176708,0.00027510792,0.00025997453,0.00011529206,0.00012722061,0.00029076033,0.00011549627,0.00016158297],"category_scores_gemma":[0.0002844333,0.0001574895,0.000116654875,0.00042834162,0.000057484696,0.0004801565,0.00002314309,0.00038977826,0.00008616752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006475417,0.000065670756,0.0011096369,0.00013623902,0.00022343104,0.000042154334,0.001386614,0.97345024,0.011032615,0.00025956015,0.00026666236,0.011962392],"study_design_scores_gemma":[0.0010319655,0.0001631416,0.00027597003,0.0003944816,0.000060653092,0.00021685733,0.0006979814,0.96912867,0.02658016,0.00039153564,0.00071368756,0.0003448732],"about_ca_topic_score_codex":5.99153e-7,"about_ca_topic_score_gemma":7.087946e-7,"teacher_disagreement_score":0.015547547,"about_ca_system_score_codex":0.00006453859,"about_ca_system_score_gemma":0.00007579111,"threshold_uncertainty_score":0.64222354},"labels":[],"label_agreement":null},{"id":"W2611857909","doi":"10.1137/16m1086819","title":"A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Knapsack problem; Mathematics; Approximation algorithm; Combinatorics; Polynomial-time approximation scheme; Scheduling (production processes); Algorithm; Time complexity; Cover (algebra); Discrete mathematics; Job shop scheduling; Schedule; Mathematical optimization; Computer science","score_opus":0.028425159824077555,"score_gpt":0.263090745202883,"score_spread":0.23466558537880544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611857909","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056998767,0.00024342803,0.98959666,0.00029951704,0.00080139306,0.00046175226,0.00004100137,0.00022048986,0.002635851],"genre_scores_gemma":[0.046297677,0.00007310583,0.9525666,0.000037399994,0.0005311093,0.000040086343,0.000031414922,0.00011692316,0.00030563876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983501,0.000020143318,0.0006287201,0.00019424937,0.00040178213,0.00040500856],"domain_scores_gemma":[0.9986291,0.00011706798,0.00042751577,0.00045802267,0.0001758389,0.0001924746],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063488964,0.00031163357,0.00037583432,0.00014987403,0.00065950427,0.0007941813,0.00037672947,0.00014313347,0.00003621381],"category_scores_gemma":[0.00033424277,0.00026434503,0.00019142931,0.000072679395,0.000059759568,0.0003996173,0.00004177162,0.00040839252,0.000029951485],"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.000043536915,0.00073204044,0.000045912297,0.0016059071,0.00067561003,0.000042758755,0.0049177525,0.77699715,0.0029843654,0.0061668498,0.0005189555,0.20526919],"study_design_scores_gemma":[0.0010846419,0.00016486138,0.000009744907,0.00043850718,0.000063107946,0.00012227359,0.00022432406,0.99095124,0.0024926416,0.0036937264,0.00041461978,0.0003402994],"about_ca_topic_score_codex":6.1522354e-7,"about_ca_topic_score_gemma":0.0000010320736,"teacher_disagreement_score":0.21395414,"about_ca_system_score_codex":0.00011303481,"about_ca_system_score_gemma":0.000029913712,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W2612374285","doi":"10.1016/j.cie.2018.10.030","title":"Applications of learning curves in production and operations management: A systematic literature review","year":2018,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":201,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Learning curve; Production (economics); Categorization; Computer science; Systematic review; Knowledge management; Work (physics); Management science; Data science; Artificial intelligence; Engineering; Economics; Psychology; Political science","score_opus":0.011358813195421967,"score_gpt":0.2172388100715448,"score_spread":0.20587999687612282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612374285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033397547,0.12266075,0.868003,0.00030133533,0.0016145661,0.003107073,0.0000052889636,0.0007157496,0.0002524923],"genre_scores_gemma":[0.6169533,0.15103534,0.22673975,0.00021936669,0.0027852738,0.0014685487,0.00018507207,0.0002127492,0.00040059286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993557,0.000022451632,0.0003038025,0.00013104391,0.00008397793,0.00010303473],"domain_scores_gemma":[0.9997261,0.000024719639,0.000026459384,0.00013454324,0.00005442622,0.000033732646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022888237,0.000105779734,0.00021693158,0.00018454812,0.000031984793,0.000028325318,0.00008014008,0.00005559531,0.0000026950045],"category_scores_gemma":[0.0000883953,0.00011055299,0.00002188316,0.0007281151,0.000013913546,0.000113429734,0.000023354989,0.00019000041,0.0000021214369],"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.000001071921,0.000012135231,0.000028405428,0.05630174,0.000056667242,0.0000017184885,0.00026917484,0.9390151,0.00005506682,0.00029565959,0.00021886917,0.003744427],"study_design_scores_gemma":[0.00021044869,0.000018359786,0.000018108638,0.13611181,0.000051623723,0.000016073216,0.000031595977,0.86289597,0.0001489265,0.0000014247609,0.00033621193,0.00015945917],"about_ca_topic_score_codex":7.362159e-7,"about_ca_topic_score_gemma":5.862535e-7,"teacher_disagreement_score":0.64126325,"about_ca_system_score_codex":0.000025955536,"about_ca_system_score_gemma":0.0000047334797,"threshold_uncertainty_score":0.450822},"labels":[],"label_agreement":null},{"id":"W2616133052","doi":"10.5267/j.uscm.2017.4.002","title":"Performance evaluation of a GRASP-based approach for stochastic scheduling problems","year":2017,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"GRASP; Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Mathematics","score_opus":0.03467342728039374,"score_gpt":0.26545677759086567,"score_spread":0.23078335031047192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616133052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022443,0.00012716977,0.9725794,0.000076160475,0.0002669299,0.0016204761,0.000011746653,0.0001418523,0.002733245],"genre_scores_gemma":[0.746578,0.00001217376,0.25251317,0.00001534359,0.00005470365,0.0006215216,0.00008944617,0.000030949843,0.000084693056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870825,0.000025303301,0.00028637284,0.0002487931,0.00045940082,0.00027186138],"domain_scores_gemma":[0.99905545,0.00003341382,0.00012553227,0.0005406069,0.00019270016,0.000052319545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012977283,0.0001797347,0.00019081937,0.00017500116,0.0002455847,0.0000794456,0.00035592463,0.000060495473,0.000024579886],"category_scores_gemma":[0.000074396674,0.0001827964,0.00007155108,0.00010126343,0.00005229158,0.00011762273,0.000036902413,0.00007590405,0.0000033190609],"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.000012670893,0.00004097001,0.00022890155,0.00047310817,0.00006595164,1.4667431e-7,0.0001292359,0.97443444,0.00002279228,0.00027054985,0.00003980154,0.024281451],"study_design_scores_gemma":[0.0017131931,0.000041297226,0.0005138748,0.00012886921,0.000118311335,2.424825e-7,0.00020331476,0.9967163,0.00019857183,0.00011885732,0.000043969307,0.00020318032],"about_ca_topic_score_codex":0.000008577464,"about_ca_topic_score_gemma":0.0000019776326,"teacher_disagreement_score":0.724135,"about_ca_system_score_codex":0.00011595636,"about_ca_system_score_gemma":0.000025761063,"threshold_uncertainty_score":0.7454221},"labels":[],"label_agreement":null},{"id":"W2618366617","doi":"","title":"Rapport à mi-parcours du WP1 du projet ANR-05-PADD-0XX-Discotech (Dispositif Innovants pour la conception et l'évaluation des systèmes techniques)","year":2007,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Impact","funders":"","keywords":"Humanities; Political science; Computer science; Art","score_opus":0.02046600304411258,"score_gpt":0.254071779099552,"score_spread":0.2336057760554394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618366617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070990354,0.0011797302,0.88305175,0.009437507,0.0007524804,0.0012817027,0.00014086299,0.0013003085,0.03186529],"genre_scores_gemma":[0.4095373,0.003118193,0.5776983,0.00014016478,0.00019373666,0.00024832386,0.0019226843,0.00019727649,0.006944035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98755664,0.007872535,0.0014895308,0.0012446969,0.00098504,0.00085155346],"domain_scores_gemma":[0.99083704,0.0016244788,0.00089371845,0.0018930201,0.0043942,0.00035752874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.02181451,0.00088412256,0.00079111435,0.0007234529,0.0006706742,0.00083459343,0.0012970534,0.0011125176,0.00034966765],"category_scores_gemma":[0.0022278295,0.0010533353,0.00036289377,0.001299568,0.00066116045,0.0005577132,0.000748076,0.0014792513,0.00013199584],"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.00011660071,0.002547799,0.01584413,0.0017109463,0.0007333153,0.00010947854,0.041748255,0.043334126,0.016957112,0.1100211,0.0074194483,0.7594577],"study_design_scores_gemma":[0.002635822,0.000006132014,0.027240422,0.011852291,0.0004886821,0.00040134048,0.0018723615,0.7278396,0.1937501,0.0076561007,0.023382593,0.0028745718],"about_ca_topic_score_codex":0.0013147233,"about_ca_topic_score_gemma":0.0005300511,"teacher_disagreement_score":0.7565831,"about_ca_system_score_codex":0.00068040827,"about_ca_system_score_gemma":0.00096736586,"threshold_uncertainty_score":0.9991917},"labels":[],"label_agreement":null},{"id":"W2619621338","doi":"10.1016/j.tcs.2017.05.016","title":"Corrigendum to “An FPTAS for the parallel two-stage flowshop problem” [Theoret. Comput. Sci. 657 (2017) 64–72]","year":2017,"lang":"en","type":"erratum","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Mathematics; Computer science; Parallel computing; Combinatorics","score_opus":0.02781184992361467,"score_gpt":0.28506034541367054,"score_spread":0.25724849549005585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619621338","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003105086,0.0002666206,0.9352446,0.0006081213,0.04700965,0.0012530125,0.00010767738,0.00065884006,0.014820393],"genre_scores_gemma":[0.015683556,0.00012115067,0.9595113,0.0013181735,0.007378619,0.00029394933,0.00022339534,0.0002832228,0.015186656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99544185,0.00009862298,0.0006046536,0.0012976482,0.0010816414,0.0014756037],"domain_scores_gemma":[0.9958824,0.00027814778,0.00016571594,0.0024406298,0.00047119285,0.00076193706],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.002864119,0.00072884257,0.0007081094,0.0003205468,0.0018870514,0.0016946153,0.0053054886,0.00035626476,0.00018268892],"category_scores_gemma":[0.00023291758,0.0005354723,0.00022936371,0.0005580981,0.0032648612,0.00037821324,0.0008359237,0.001121014,0.00019844003],"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.000032773354,0.000053858923,0.0000011651712,0.00010563655,0.000049655766,0.0000139147005,0.00064134726,0.35684842,0.000009793255,0.51166207,0.11013437,0.020446993],"study_design_scores_gemma":[0.0004255344,0.00022022396,0.000017884055,0.00018065247,0.000051650353,0.000020768102,0.00002217869,0.94454414,0.000041962438,0.012080351,0.0416289,0.0007657538],"about_ca_topic_score_codex":0.000011322326,"about_ca_topic_score_gemma":0.000011225891,"teacher_disagreement_score":0.5876957,"about_ca_system_score_codex":0.00016049788,"about_ca_system_score_gemma":0.00033330175,"threshold_uncertainty_score":0.99970967},"labels":[],"label_agreement":null},{"id":"W2620347635","doi":"10.11159/icmie17.118","title":"Scheduling Customized Orders: A Case Study at BEST Transformers Company","year":2017,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Mechanical, Chemical, and Material Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bilim, Sanayi ve Teknoloji Bakanliği","keywords":"Computer science; Transformer; Reliability engineering; Engineering; Electrical engineering; Voltage","score_opus":0.01264383052134553,"score_gpt":0.23407559971591188,"score_spread":0.22143176919456636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620347635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975408,0.000010034691,0.000019133213,0.00007820852,0.0014364916,0.0004179081,0.000013602022,0.00022755175,0.0002562723],"genre_scores_gemma":[0.9936063,0.00003000841,0.0059524556,0.000013749744,0.00016217142,0.000056371773,0.0000013385177,0.00006815123,0.00010939992],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872684,0.000003724549,0.000406304,0.00030852217,0.00022536282,0.00032924855],"domain_scores_gemma":[0.99935013,0.00004684266,0.00013389882,0.0002258283,0.00009253949,0.00015075582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021855193,0.000318343,0.0004579181,0.00010528208,0.0003129263,0.0002797912,0.00043734885,0.00010378724,0.000032492848],"category_scores_gemma":[0.000119020544,0.00026400157,0.00009685527,0.000116131465,0.000080242455,0.0001987714,0.00018200377,0.0002524377,0.00000281378],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028664892,0.00020490777,0.00007250903,0.0005953518,0.00027368547,0.00003647245,0.000113807226,0.01365666,0.9831077,0.00063169387,0.00012001776,0.0009005634],"study_design_scores_gemma":[0.002018847,0.00004993502,0.0000029109601,0.00030858978,0.00011709042,0.00010048551,0.0004343187,0.17481813,0.8215892,0.000014478065,0.0001902935,0.00035573344],"about_ca_topic_score_codex":0.000028021572,"about_ca_topic_score_gemma":0.000008178518,"teacher_disagreement_score":0.1615185,"about_ca_system_score_codex":0.00005611005,"about_ca_system_score_gemma":0.000007344106,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2626322824","doi":"10.1002/nav.21744","title":"Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness","year":2017,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Program of Shanghai Subject Chief Scientist; National Science Foundation","keywords":"Tardiness; Computer science; Mathematical optimization; Rule-based system; Scheduling (production processes); Due date; Generalization; Heuristic; Flexibility (engineering); Job shop scheduling; Mathematics; Artificial intelligence; Schedule; Statistics","score_opus":0.053385622953814126,"score_gpt":0.35910513682206563,"score_spread":0.3057195138682515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626322824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17440127,0.00021040377,0.81675,0.0005953037,0.0004393355,0.00055530237,0.00019369408,0.00036639307,0.0064882995],"genre_scores_gemma":[0.6907833,0.000040467603,0.30862913,0.0000233195,0.00019593506,0.000042477808,0.000057407895,0.0000544177,0.0001735176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969438,0.00014069775,0.0004205384,0.00057212065,0.0010070497,0.0009158233],"domain_scores_gemma":[0.9971826,0.00052946946,0.00007518207,0.0010221575,0.00065204763,0.0005385557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015265405,0.0003312686,0.00045419735,0.00022656933,0.00095302524,0.00066854816,0.000772769,0.0001853711,0.00009453627],"category_scores_gemma":[0.0021652982,0.00028750653,0.00008319316,0.0002938162,0.0006524481,0.00019826932,0.00031645317,0.0010496097,0.00013257652],"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.00055328413,0.00020794365,0.013072078,0.00023348481,0.00022336708,0.0002549833,0.00046575326,0.9688301,0.0015618992,0.0019166546,0.00017987836,0.012500545],"study_design_scores_gemma":[0.0016607811,0.00011631388,0.010251574,0.000218132,0.000027501257,0.000033081757,0.00017096652,0.9850011,0.000957494,0.0009613823,0.00010334395,0.0004983566],"about_ca_topic_score_codex":0.00034359162,"about_ca_topic_score_gemma":0.00005730599,"teacher_disagreement_score":0.51638204,"about_ca_system_score_codex":0.00021284589,"about_ca_system_score_gemma":0.00014770981,"threshold_uncertainty_score":0.9999577},"labels":[],"label_agreement":null},{"id":"W2626429397","doi":"10.1016/j.ejor.2017.06.027","title":"Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Job shop scheduling; Flow shop scheduling; Computer science; Permutation (music); Heuristic; Mathematical optimization; Scheduling (production processes); Sequence (biology); Algorithm; Mathematics; Schedule","score_opus":0.056950773368283705,"score_gpt":0.3333236467879199,"score_spread":0.27637287341963623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626429397","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002232124,0.000178674,0.9944376,0.0008675049,0.00017974277,0.00030810072,0.000018871046,0.00002763577,0.0017497538],"genre_scores_gemma":[0.28220204,0.00015370257,0.7164046,0.000024342658,0.0005440366,0.00001908162,0.000025576914,0.000052528747,0.0005740497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998256,0.00021646287,0.00037191925,0.00014324335,0.0007799006,0.00023241993],"domain_scores_gemma":[0.9976377,0.00028571897,0.00013862936,0.00021939112,0.0016247104,0.00009385502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003030089,0.00012272352,0.00012387882,0.00013435404,0.0011208385,0.0008333744,0.0004956743,0.00002557515,0.00008569738],"category_scores_gemma":[0.0004735589,0.00008166946,0.000049537866,0.000120740595,0.00011073564,0.0005992808,0.000039240633,0.0003804614,0.0000142883955],"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.00002482815,0.000013999449,0.0000121441535,0.000011172093,0.00005329076,0.000014164036,0.00048066516,0.94848996,0.0008922798,0.00007005444,0.00024458053,0.049692877],"study_design_scores_gemma":[0.00071012514,0.0001999448,0.00011808867,0.00009613144,0.000013596385,0.00005987316,0.0003444672,0.99502665,0.0031436554,0.00001583529,0.00016538364,0.000106237276],"about_ca_topic_score_codex":0.0000028269571,"about_ca_topic_score_gemma":0.0000041929156,"teacher_disagreement_score":0.27996993,"about_ca_system_score_codex":0.00008807857,"about_ca_system_score_gemma":0.00018381991,"threshold_uncertainty_score":0.86206967},"labels":[],"label_agreement":null},{"id":"W27038116","doi":"10.1093/jnci/djw115","title":"Polyhedral Approaches to Machine Scheduling","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":119,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Polyhedron; Scheduling (production processes); Mathematical optimization; Polyhedral combinatorics; Mathematical proof; Travelling salesman problem; Computer science; Cutting-plane method; Mathematics; Algorithm; Combinatorics; Integer programming; Regular polygon; Convex optimization","score_opus":0.07337646448938698,"score_gpt":0.21197618577768873,"score_spread":0.13859972128830175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27038116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15515514,0.00028530622,0.81737006,0.00035344934,0.00032163254,0.00009948913,0.000002565953,0.001161856,0.025250511],"genre_scores_gemma":[0.5720232,0.000010805731,0.42709443,0.000116860065,0.000080429505,0.000006139547,0.0000053564563,0.000019606716,0.0006431268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994969,0.0000051415404,0.00011610243,0.000111950096,0.000096051,0.00017389517],"domain_scores_gemma":[0.99972314,0.0000121714165,0.0000053389763,0.00013232682,0.000010086505,0.000116935465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046223846,0.00009807781,0.0000930612,0.00008202044,0.00006726612,0.00001510756,0.000088924826,0.000041703654,0.000157685],"category_scores_gemma":[0.000014895635,0.00009154917,0.000031198466,0.00021143319,0.0000118300795,0.000062428124,0.000016724933,0.000085406704,0.00026512405],"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.0000020166217,0.000010294328,0.00066676835,0.0000052074697,0.0000122905885,0.0000041297158,0.000288132,0.99573714,0.000090071735,0.00063773646,0.00018536576,0.002360829],"study_design_scores_gemma":[0.00014688495,0.000009977575,0.00045456117,0.0000036202257,0.0000025174127,0.000024902085,0.000050595863,0.9958233,0.0029417186,0.000016080683,0.0003718254,0.00015401594],"about_ca_topic_score_codex":0.000009246759,"about_ca_topic_score_gemma":0.0000025527531,"teacher_disagreement_score":0.41686812,"about_ca_system_score_codex":0.000018395394,"about_ca_system_score_gemma":0.000007340499,"threshold_uncertainty_score":0.3733267},"labels":[],"label_agreement":null},{"id":"W2734261020","doi":"10.12681/eadd/40218","title":"Scheduling and performance characterization on heterogeneous computing systems","year":2016,"lang":"el","type":"dissertation","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; University of Thessaly; Queen's University; European Commission","keywords":"Computer science; Scheduling (production processes); Distributed computing; Computer architecture; Characterization (materials science); Engineering; Operations management; Nanotechnology","score_opus":0.009963632548431718,"score_gpt":0.2212948544565186,"score_spread":0.2113312219080869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734261020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88903105,0.0004371655,0.103822336,0.000025385792,0.0039040453,0.00040864942,0.000029546563,0.00047528418,0.0018665107],"genre_scores_gemma":[0.98835045,0.001180075,0.006087683,0.000056610974,0.0007514736,0.000018699395,0.0007395152,0.00015900917,0.0026564898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998035,0.00004740458,0.00063726027,0.0005369866,0.00032404205,0.00041928462],"domain_scores_gemma":[0.9990286,0.000096046664,0.0002531696,0.0002794469,0.0001838229,0.00015888584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020676259,0.0005312233,0.00047572792,0.00030052214,0.00033443872,0.0003005103,0.00015338532,0.00047053647,0.000056418357],"category_scores_gemma":[0.000037518625,0.0004729671,0.00006818161,0.00018011691,0.000022116803,0.00018029097,0.000023890048,0.00032529392,0.00021136116],"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.00010679631,0.000054767428,0.0012569736,0.0021774336,0.00025062312,0.00000988696,0.0013193967,0.8556399,0.0067515527,0.0003670931,0.0000039964298,0.13206159],"study_design_scores_gemma":[0.00047836063,0.000111463945,0.0025341478,0.0021945296,0.00004789803,0.00002298339,0.0001542301,0.9897276,0.004055772,8.5371965e-7,0.0000616215,0.0006105277],"about_ca_topic_score_codex":0.000010022715,"about_ca_topic_score_gemma":7.7799183e-7,"teacher_disagreement_score":0.13408771,"about_ca_system_score_codex":0.00012287997,"about_ca_system_score_gemma":0.00003709414,"threshold_uncertainty_score":0.9997722},"labels":[],"label_agreement":null},{"id":"W2737097946","doi":"","title":"RE-PLANNING WITH MINIMAL PERTURBATION","year":2014,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Perturbation (astronomy); Physics","score_opus":0.01262304844881386,"score_gpt":0.21689089334554681,"score_spread":0.20426784489673294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737097946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037863366,0.0016968474,0.85541666,0.010039953,0.000590867,0.00036532007,0.000031142736,0.0005971257,0.09339871],"genre_scores_gemma":[0.35671213,0.0002724921,0.6175984,0.00010026146,0.00011706142,0.000068510344,0.0006742048,0.00013049801,0.02432645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99446946,0.0028955142,0.0006834148,0.0008691358,0.0005424441,0.0005400145],"domain_scores_gemma":[0.99381703,0.0016417599,0.0004456911,0.0017379702,0.0020532785,0.0003042927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00388448,0.0005664265,0.0005220798,0.00023283441,0.00043371302,0.00056531053,0.0008933421,0.0005183692,0.00044023717],"category_scores_gemma":[0.0011379553,0.0006092156,0.00018221635,0.00047399243,0.0002357956,0.00020437087,0.00036766467,0.0009853469,0.00018263135],"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.0000667165,0.00065356237,0.006944113,0.0009389214,0.000502664,0.00002687277,0.048979018,0.739458,0.0007621384,0.1341773,0.002296204,0.06519447],"study_design_scores_gemma":[0.00086237944,0.0000011404301,0.0030286564,0.0042854864,0.00012450884,0.00002035854,0.00050994573,0.9629099,0.010840044,0.0008228054,0.015745034,0.00084977463],"about_ca_topic_score_codex":0.00045970696,"about_ca_topic_score_gemma":0.00031875118,"teacher_disagreement_score":0.31884876,"about_ca_system_score_codex":0.00024451502,"about_ca_system_score_gemma":0.00020572155,"threshold_uncertainty_score":0.99963593},"labels":[],"label_agreement":null},{"id":"W2738975253","doi":"10.1155/2017/1527858","title":"A Variable Interval Rescheduling Strategy for Dynamic Flexible Job Shop Scheduling Problem by Improved Genetic Algorithm","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Initialization; Job shop scheduling; Computer science; Mathematical optimization; Population; Dynamic priority scheduling; Scheduling (production processes); Flow shop scheduling; Interval (graph theory); Algorithm; Mathematics; Schedule","score_opus":0.010509685452828519,"score_gpt":0.26326243507374025,"score_spread":0.2527527496209117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738975253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069801696,0.0009953701,0.9279073,0.000054761786,0.0007593564,0.0002739892,0.000054451317,0.00009226005,0.000060808397],"genre_scores_gemma":[0.17814204,0.00026482472,0.8212209,0.0000122161155,0.0001384759,0.000021755171,0.000049520153,0.000059438076,0.00009083962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998512,0.00001176681,0.00078157656,0.00018959094,0.00020544023,0.00029957798],"domain_scores_gemma":[0.99874103,0.00004643771,0.00047152038,0.00021829549,0.00038849303,0.00013421848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028597214,0.00021909918,0.00033853034,0.00012623119,0.0002374311,0.00016895978,0.0003043496,0.00013068928,0.000013896639],"category_scores_gemma":[0.000047454414,0.00022511891,0.00014557004,0.00009988794,0.000033161134,0.00082072424,0.0000031094398,0.00030829723,0.0000011494275],"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.000073284,0.000028760856,0.000054470154,0.000115876304,0.00008854206,0.000003949372,0.00022223857,0.92337406,0.024735056,0.000051873187,0.0000085185075,0.051243365],"study_design_scores_gemma":[0.0024259172,0.0002609187,0.0013189728,0.0003016703,0.000115673516,0.000013727515,0.0004355437,0.9887312,0.0045364904,0.0013942973,0.00016991657,0.00029565397],"about_ca_topic_score_codex":0.000005595854,"about_ca_topic_score_gemma":0.000010283718,"teacher_disagreement_score":0.108340345,"about_ca_system_score_codex":0.00008719045,"about_ca_system_score_gemma":0.00007910598,"threshold_uncertainty_score":0.91800827},"labels":[],"label_agreement":null},{"id":"W2740520909","doi":"","title":"Symmetry in Scheduling Problems","year":2010,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Scheduling (production processes); Symmetry breaking; Computer science; Fair-share scheduling; Symmetry operation; Symmetry group; Mathematical optimization; Mathematics; Symmetry (geometry); Physics; Geometry; Quantum mechanics; Schedule","score_opus":0.005442328154904626,"score_gpt":0.19132459760863058,"score_spread":0.18588226945372596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740520909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94647235,0.0002308533,0.04715313,0.00017221508,0.0011009004,0.00010388888,0.000002182603,0.00047083315,0.0042936592],"genre_scores_gemma":[0.7652483,0.000046001234,0.23427293,0.00007317668,0.00018583713,0.0000145950025,0.0000081669805,0.00003432757,0.00011669641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993475,0.000010591084,0.00017598513,0.00014173653,0.000101250145,0.00022292532],"domain_scores_gemma":[0.9996822,0.000041200477,0.00001727134,0.00016235975,0.00002309674,0.00007387082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016150383,0.00012048088,0.000121365425,0.0001596572,0.00006235209,0.00004662149,0.00012345637,0.0001910677,0.00006226798],"category_scores_gemma":[0.00006965392,0.00012721684,0.000036195743,0.00030104961,0.000050321603,0.00009380723,0.000009226047,0.000636646,0.000048067803],"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.0000089800715,0.000095955234,0.02272726,0.00019462737,0.00006847625,0.00005059782,0.004473487,0.8635496,0.014988771,0.046379298,0.0002748855,0.047188085],"study_design_scores_gemma":[0.00082900986,0.000014553734,0.002582068,0.000038876587,0.000009705447,0.00002804544,0.00033343124,0.98648536,0.003849159,0.002349102,0.00301044,0.00047022302],"about_ca_topic_score_codex":0.000015999158,"about_ca_topic_score_gemma":0.000033712593,"teacher_disagreement_score":0.1871198,"about_ca_system_score_codex":0.00003892633,"about_ca_system_score_gemma":0.000010798048,"threshold_uncertainty_score":0.5187753},"labels":[],"label_agreement":null},{"id":"W2750879512","doi":"10.1007/978-3-319-89963-3","title":"Tools and Algorithms for the Construction and Analysis of Systems","year":2018,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Exploratory Research for Advanced Technology; Russian Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; Electronic Components and Systems for European Leadership; Agence Nationale de la Recherche; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Conseil Régional, Île-de-France; European Commission; Universität Passau; Boise State University; Vetenskapsrådet; National Science Foundation; Institut national de recherche en informatique et en automatique (INRIA); Région Auvergne-Rhône-Alpes","keywords":"Computer science; Flexibility (engineering); Reliability (semiconductor); Algorithm; Mathematics","score_opus":0.016007538197037194,"score_gpt":0.2382782236521835,"score_spread":0.22227068545514633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750879512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016419617,0.0015124788,0.99694383,0.000021928698,0.0010248879,0.00020088717,0.000037437305,0.000035512825,0.00005881785],"genre_scores_gemma":[0.008172799,0.00027245076,0.99090624,0.0000501901,0.00045683526,0.000016798795,0.000025806556,0.000020461235,0.00007840044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992463,0.000009609504,0.00019719306,0.00025404806,0.00016280988,0.00013003031],"domain_scores_gemma":[0.99890244,0.0006729512,0.0000666297,0.00020666062,0.00011959461,0.000031708154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039694193,0.00012923873,0.0002761769,0.00035623097,0.000082468454,0.00016232958,0.00018634959,0.000113829614,0.0000016043892],"category_scores_gemma":[0.00006530506,0.00009490693,0.000036149435,0.0005642424,0.00047902507,0.000076265176,0.000048434435,0.000113743285,1.6046647e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.3675675e-7,9.795929e-7,0.000053391097,0.000050519913,0.000078186684,1.9551021e-7,0.0001843209,0.7590129,0.0000054134193,0.0000651633,0.000010154863,0.24053788],"study_design_scores_gemma":[0.000080610516,0.000023323266,0.00014477692,0.00006467771,0.000121489604,0.0000076124575,0.0000010536469,0.99882376,0.00009014333,0.00035500346,0.00018122575,0.000106334315],"about_ca_topic_score_codex":0.0000039784977,"about_ca_topic_score_gemma":0.000005520658,"teacher_disagreement_score":0.24043155,"about_ca_system_score_codex":0.000043636075,"about_ca_system_score_gemma":0.000054419743,"threshold_uncertainty_score":0.38701922},"labels":[],"label_agreement":null},{"id":"W2752426119","doi":"10.71781/10738","title":"Méthodes à noyaux appliquées à la gestion de portefeuille","year":2004,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Physics; Political science","score_opus":0.026354565597849117,"score_gpt":0.30280246830407825,"score_spread":0.27644790270622915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752426119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37569106,0.0033678776,0.4369702,0.0009806912,0.0031614634,0.0018296875,0.00018735623,0.00007517709,0.17773649],"genre_scores_gemma":[0.053921156,0.00037724007,0.9172104,0.000018210714,0.0002766658,0.00009036393,0.0016639165,0.00012946659,0.026312586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984474,0.000100364196,0.00043427217,0.0004353789,0.0002064286,0.0003761508],"domain_scores_gemma":[0.999116,0.000163104,0.00015275784,0.00027254035,0.00011859653,0.00017697859],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00060446153,0.0003854011,0.00038145916,0.00013900652,0.00017668138,0.00048141793,0.0004705686,0.00074487284,0.0031604227],"category_scores_gemma":[0.00014889696,0.00045651107,0.00010536668,0.00026676615,0.000040129242,0.0002417128,0.000049646475,0.00053629774,0.0012740226],"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.000026664356,0.00010006281,0.00017599014,0.000120399396,0.00009885745,0.000044792632,0.0050307414,0.7611826,0.00065220473,0.0008239078,0.00007119889,0.23167256],"study_design_scores_gemma":[0.003639312,0.00019598968,0.009410505,0.004111217,0.0008963802,0.00020675796,0.014150036,0.8500256,0.07409593,0.001900864,0.03820517,0.0031622406],"about_ca_topic_score_codex":0.000683207,"about_ca_topic_score_gemma":0.00048142043,"teacher_disagreement_score":0.48024017,"about_ca_system_score_codex":0.0003274375,"about_ca_system_score_gemma":0.0005134185,"threshold_uncertainty_score":0.99978864},"labels":[],"label_agreement":null},{"id":"W2756715505","doi":"10.1609/icaps.v27i1.13829","title":"An Investigation of Phase Transitions in Single-Machine Scheduling Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Advanced Exploration Systems; Ames Research Center; National Aeronautics and Space Administration","keywords":"Parameterized complexity; Scheduling (production processes); Computer science; Phase transition; Distributed computing; Theoretical computer science; Mathematical optimization; Algorithm; Mathematics; Physics","score_opus":0.04681897896836605,"score_gpt":0.29776735699557605,"score_spread":0.25094837802721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756715505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99646384,0.00005969938,0.0010385897,0.00050586386,0.00022369862,0.00012200966,0.00002184497,0.00022652553,0.0013379194],"genre_scores_gemma":[0.97628945,0.000015123767,0.023594277,0.00002011524,0.000031787975,0.000009544018,0.000015112778,0.000018057153,0.000006554149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903876,0.00000713886,0.00038131422,0.00018531525,0.00024972638,0.00013774187],"domain_scores_gemma":[0.9992936,0.000022550179,0.00025675466,0.0001177564,0.00024954163,0.000059756272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003298339,0.0001491126,0.0001942321,0.00020512498,0.00015598918,0.00019044473,0.000469403,0.000094089664,0.000008772058],"category_scores_gemma":[0.00013534723,0.00013175035,0.000036912803,0.0001038773,0.000112618356,0.00042428373,0.000031550917,0.00024438096,5.48467e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060880804,0.00013110726,0.025382776,0.0001758517,0.00007236273,0.0000010969064,0.0041849087,0.54679376,0.41636202,0.005556345,0.0000044401345,0.0012744473],"study_design_scores_gemma":[0.0007934499,0.00006803156,0.0031357901,0.0011184328,0.000013100619,0.0000055390296,0.00065572356,0.94977343,0.043731418,0.0005760629,8.342383e-7,0.0001281616],"about_ca_topic_score_codex":0.000019809635,"about_ca_topic_score_gemma":0.000003431817,"teacher_disagreement_score":0.40297967,"about_ca_system_score_codex":0.000029874029,"about_ca_system_score_gemma":0.000024870502,"threshold_uncertainty_score":0.5372624},"labels":[],"label_agreement":null},{"id":"W2757816263","doi":"","title":"Three meta-heuristics to solve the no-wait two-stage assembly flow shop scheduling problem","year":2013,"lang":"en","type":"article","venue":"Scientia Iranica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Job shop scheduling; Flow shop scheduling; Mathematical optimization; Variable neighborhood search; Computer science; Heuristics; Scheduling (production processes); Differential evolution; Metaheuristic; Algorithm; Mathematics; Schedule","score_opus":0.026669291095300043,"score_gpt":0.24267638203591482,"score_spread":0.21600709094061477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2757816263","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009987041,0.00044012064,0.9766311,0.0010347947,0.0018648013,0.0008282006,0.000029811925,0.00068265264,0.008501483],"genre_scores_gemma":[0.074919246,0.000013712439,0.92326945,0.00039664787,0.0002917566,0.00014350821,0.000016419808,0.00007775163,0.000871514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817187,0.00002158451,0.00038399902,0.00039569038,0.00047931148,0.00054753915],"domain_scores_gemma":[0.99864846,0.00011215802,0.00005197486,0.0006585092,0.00029207315,0.0002368102],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00065099384,0.00026573107,0.0002870912,0.00011774069,0.00031980008,0.000526039,0.0006567172,0.00008141866,0.0011823336],"category_scores_gemma":[0.00017550246,0.00018979292,0.00018609529,0.0007188901,0.0000679241,0.00023652626,0.00013476411,0.00030050788,0.0026817014],"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.0000022549852,0.000024163004,0.000019625131,0.000026479212,0.00024344708,0.0000022732027,0.00024359817,0.99024725,0.001977415,0.0010065224,0.004784196,0.0014228048],"study_design_scores_gemma":[0.00026142885,0.000021938939,0.00005068278,0.000016218386,0.00019024956,0.0000030841015,0.00006708165,0.9927746,0.00091509835,0.00030865674,0.0051097926,0.00028113546],"about_ca_topic_score_codex":0.000042972308,"about_ca_topic_score_gemma":0.0000731576,"teacher_disagreement_score":0.064932205,"about_ca_system_score_codex":0.000041432893,"about_ca_system_score_gemma":0.000043300963,"threshold_uncertainty_score":0.9997307},"labels":[],"label_agreement":null},{"id":"W2760545295","doi":"10.1016/j.tcs.2017.09.018","title":"An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops","year":2017,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Office of the Vice President for Research and Economic Development, University at Buffalo; Kyushu Institute of Technology; Alberta Innovates - Technology Futures; Office of the Vice President for Research and Economic Development, University of Iowa; Georgia Southern University","keywords":"Scheme (mathematics); Job shop scheduling; Mathematical optimization; Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Computer science; Stage (stratigraphy); Scheduling (production processes); Parallel computing; Algorithm; Approximation algorithm; Biology; Routing (electronic design automation); Geometry; Mathematical analysis; Computer network","score_opus":0.03236869020933152,"score_gpt":0.29743998264156546,"score_spread":0.26507129243223393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760545295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058822338,0.000007928538,0.93989736,0.0003217059,0.00048685982,0.0002136271,0.000004176605,0.00006699106,0.00017902676],"genre_scores_gemma":[0.53538525,8.031075e-7,0.46449718,0.00003972093,0.000057673667,0.000007198312,6.204644e-7,0.0000064529067,0.0000050773947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990591,0.000031603708,0.00019914807,0.00019663965,0.00027585228,0.00023768144],"domain_scores_gemma":[0.9988763,0.000111584115,0.000056743902,0.0007700773,0.00010913796,0.00007618875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009279264,0.00009819502,0.00010922471,0.000030645162,0.0006712361,0.00032212937,0.0013969877,0.00004152603,0.000011036774],"category_scores_gemma":[0.00023363554,0.000057896068,0.000059011676,0.00011861955,0.0016718945,0.00024255081,0.00015618671,0.000115157665,0.0000034829875],"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.000012847416,0.00005599434,0.0002524936,0.00004048253,0.000009960806,3.9566643e-7,0.0010168039,0.27286828,0.0015075848,0.71380615,0.000009126146,0.010419856],"study_design_scores_gemma":[0.0002497941,0.000019721298,0.0019575404,0.000020923342,0.0000062711492,0.0000016969193,0.00003609043,0.99117535,0.0034831031,0.0029557748,0.000008594,0.00008515966],"about_ca_topic_score_codex":8.7463644e-7,"about_ca_topic_score_gemma":6.472047e-7,"teacher_disagreement_score":0.7183071,"about_ca_system_score_codex":0.000016647113,"about_ca_system_score_gemma":0.000023153241,"threshold_uncertainty_score":0.6160165},"labels":[],"label_agreement":null},{"id":"W2761748578","doi":"10.1007/s10951-017-0545-x","title":"Two-stage hybrid flowshop scheduling with simultaneous processing machines","year":2017,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Beijing Municipal Natural Science Foundation; Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; China Postdoctoral Science Foundation","keywords":"Heuristics; Computer science; Mathematical optimization; Idle; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Heuristic; Integer programming; Algorithm; Mathematics","score_opus":0.013391782282690893,"score_gpt":0.2608581204676207,"score_spread":0.2474663381849298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761748578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67241,0.0014205985,0.3239491,0.00016307722,0.0007188172,0.00008683747,0.0000042333763,0.0001597952,0.001087497],"genre_scores_gemma":[0.61724865,0.00007101601,0.38189,0.000032370157,0.00062186987,0.0000013214767,0.0000014982242,0.000061892184,0.00007138179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982354,0.000023429302,0.00064609083,0.00020689334,0.00049012847,0.00039804634],"domain_scores_gemma":[0.998192,0.00010951932,0.0005823939,0.00040144543,0.00047038007,0.00024427756],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005835203,0.00031194117,0.00045939183,0.00022970767,0.00059539545,0.00069233705,0.00061098824,0.0000781687,0.00004484985],"category_scores_gemma":[0.00053563307,0.00025428075,0.00013094247,0.00012286351,0.000095187665,0.0009206621,0.000050916784,0.0007238162,0.000013252145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005789325,0.00002726509,0.00096741354,0.00009662703,0.00008447273,0.0003481794,0.00019265932,0.9729757,0.0015010134,0.000023071889,0.000002611084,0.023723101],"study_design_scores_gemma":[0.0014243206,0.000073221934,0.00008335685,0.0005518596,0.000073884614,0.00048694047,0.00032931607,0.99182075,0.0046462794,0.000043948272,0.00012210442,0.00034401685],"about_ca_topic_score_codex":0.0000070217948,"about_ca_topic_score_gemma":0.0000061455985,"teacher_disagreement_score":0.05794089,"about_ca_system_score_codex":0.000082420884,"about_ca_system_score_gemma":0.00012115997,"threshold_uncertainty_score":0.99999094},"labels":[],"label_agreement":null},{"id":"W2763314171","doi":"10.7202/1022285ar","title":"Une critique de la rémunération selon le rendement (II)","year":2014,"lang":"fr","type":"article","venue":"Relations industrielles","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy; Humanities","score_opus":0.010863497461305462,"score_gpt":0.24152272879817296,"score_spread":0.2306592313368675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763314171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017669646,0.0025025613,0.88286847,0.024724886,0.0009063572,0.00019487979,0.000020036246,0.00035210833,0.07076103],"genre_scores_gemma":[0.7498503,0.0006925918,0.21562834,0.00014497286,0.00082316814,0.000043024815,0.00013857531,0.000077974975,0.032601085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872035,0.0002833998,0.00035590882,0.0002017953,0.0001574471,0.00028112667],"domain_scores_gemma":[0.99910724,0.00036235238,0.00006947852,0.00024529337,0.00009116422,0.00012444762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539579,0.0001858187,0.00015258937,0.00013183986,0.00053367496,0.0001005514,0.00011140172,0.0007084915,0.00023566221],"category_scores_gemma":[0.00040479217,0.00023908519,0.00006252923,0.0005678868,0.00010187812,0.00021903108,0.000031586747,0.0006985789,0.00012223142],"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.0000018654207,0.00008603403,0.0005703166,0.00000722834,0.000046190475,0.000001659017,0.001289099,0.8273396,0.00007591033,0.12265127,0.013843279,0.03408757],"study_design_scores_gemma":[0.00052596466,0.000045147455,0.0007914913,0.00015315025,0.00006686919,0.000017680062,0.00069298054,0.7663836,0.0018609161,0.004280692,0.22491096,0.00027058355],"about_ca_topic_score_codex":0.0005838304,"about_ca_topic_score_gemma":0.000023930257,"teacher_disagreement_score":0.7321806,"about_ca_system_score_codex":0.0002058704,"about_ca_system_score_gemma":0.00023513325,"threshold_uncertainty_score":0.9749611},"labels":[],"label_agreement":null},{"id":"W2764221425","doi":"10.5267/j.ijiec.2017.8.005","title":"A two-agent scheduling problem in a two-machine flowshop","year":2017,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Mathematical optimization; Computer science; Mathematics; Schedule","score_opus":0.028881694552218486,"score_gpt":0.2932678206633897,"score_spread":0.2643861261111712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764221425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26668796,0.00029360113,0.7211453,0.0011423553,0.009304117,0.00021261204,0.000027540398,0.00018242717,0.0010041186],"genre_scores_gemma":[0.8457567,0.000023088345,0.15309162,0.000015849733,0.0010582685,0.00000480053,0.000009274873,0.000029892873,0.000010454636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986743,0.000016900323,0.0006436394,0.00011049636,0.00037395195,0.0001807371],"domain_scores_gemma":[0.99910754,0.00010702575,0.00022214538,0.00015234236,0.00029992856,0.00011101953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039066703,0.00016223264,0.00022713865,0.00051467656,0.000077064076,0.00029420643,0.0006045779,0.00006199073,0.000026728696],"category_scores_gemma":[0.00043088786,0.00017140867,0.00010664616,0.00012715068,0.000021090213,0.00040815567,0.000056292585,0.00056395575,0.00000881796],"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.000014170869,0.000035704597,0.0009086083,0.0000037048137,0.00012616748,0.00006548436,0.0001539349,0.9895041,0.00021440188,0.0004942023,0.000028360375,0.008451132],"study_design_scores_gemma":[0.0030143503,0.000020304118,0.00039891043,0.00028577563,0.000016000939,0.00009683435,0.000036832454,0.995303,0.00028990387,0.00011919333,0.00025590727,0.00016298817],"about_ca_topic_score_codex":0.000047231766,"about_ca_topic_score_gemma":0.000014065633,"teacher_disagreement_score":0.5790688,"about_ca_system_score_codex":0.00020954627,"about_ca_system_score_gemma":0.00008593255,"threshold_uncertainty_score":0.69898427},"labels":[],"label_agreement":null},{"id":"W2765177105","doi":"10.21494/iste.op.2018.0279","title":"Un résultat intrigant en commande sans modèle","year":2018,"lang":"fr","type":"article","venue":"Automatique","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Humanities; Physics; Philosophy; Political science","score_opus":0.009553002374716891,"score_gpt":0.23294213796790983,"score_spread":0.22338913559319293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765177105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07953029,0.0024838138,0.88669425,0.0105012795,0.0046368632,0.00035959785,0.00006265656,0.001685202,0.014046041],"genre_scores_gemma":[0.49086,0.0004197206,0.5030378,0.00069000595,0.0015106902,0.000029883167,0.000044741886,0.00011298048,0.0032941718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863076,0.00014235877,0.00038454725,0.00024174189,0.00017223274,0.0004283301],"domain_scores_gemma":[0.99898577,0.0002685512,0.00006409225,0.00037291466,0.00013609392,0.00017256114],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035184997,0.00026613884,0.00026813397,0.00010660868,0.000149523,0.000094520474,0.00025451544,0.00034134308,0.0017044536],"category_scores_gemma":[0.000207882,0.00028958882,0.000078330486,0.00036817483,0.00014689188,0.00020467074,0.00006341277,0.00035099383,0.0013647949],"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.000028204582,0.00047931605,0.000663275,0.0005900863,0.0008965848,0.0001599896,0.046538122,0.4900761,0.001968304,0.13713284,0.034521654,0.28694552],"study_design_scores_gemma":[0.000546681,0.00008194502,0.0011572696,0.00022522057,0.000046364043,0.00004217044,0.00022547053,0.9638386,0.019211063,0.0021973746,0.012072131,0.00035576092],"about_ca_topic_score_codex":0.00012359783,"about_ca_topic_score_gemma":0.00006089823,"teacher_disagreement_score":0.47376245,"about_ca_system_score_codex":0.0001554408,"about_ca_system_score_gemma":0.00007283522,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2767893134","doi":"10.1051/ro/2017086","title":"The cycle shop scheduling: mathematical model, properties and solution algorithms","year":2017,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Job shop scheduling; Heuristics; Mathematical optimization; Algorithm; Flow shop scheduling; Metaheuristic; Scheduling (production processes); Integer programming; Rate-monotonic scheduling; Schedule; Dynamic priority scheduling; Mathematics","score_opus":0.13268067904025993,"score_gpt":0.3536112008502528,"score_spread":0.2209305218099929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767893134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21716383,0.0015077852,0.7612325,0.007765779,0.0002875686,0.0009224794,0.000014150383,0.0004383645,0.010667538],"genre_scores_gemma":[0.89600015,0.0005350606,0.09934685,0.000011081852,0.00016535666,0.00017194271,0.000005993769,0.00003837904,0.0037251827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987899,0.000061013936,0.0002024842,0.0001878699,0.00039370384,0.0003650464],"domain_scores_gemma":[0.99898154,0.00007531423,0.000009287544,0.00056202797,0.00025643056,0.00011542508],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010020051,0.000111436566,0.00010896638,0.00008110211,0.0034907262,0.0013141226,0.00035880797,0.00009017373,0.000019851304],"category_scores_gemma":[0.00066843,0.000078393445,0.000028024655,0.000090826186,0.00038512476,0.0003673357,0.00014085976,0.00037886537,0.00009005453],"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.000004731798,0.000024903582,0.0000118091475,0.00002438196,0.000022070062,9.271847e-7,0.00059475173,0.9800894,0.0011799504,0.00832813,0.00017533924,0.009543561],"study_design_scores_gemma":[0.00018955165,0.000015515749,0.000037214297,0.000029933988,0.000004215128,0.000005032211,0.00026755437,0.99690527,0.0015326625,0.0007780986,0.00012838111,0.000106596504],"about_ca_topic_score_codex":0.0000211076,"about_ca_topic_score_gemma":0.0000471557,"teacher_disagreement_score":0.67883635,"about_ca_system_score_codex":0.000056644843,"about_ca_system_score_gemma":0.000073537725,"threshold_uncertainty_score":0.9997226},"labels":[],"label_agreement":null},{"id":"W2769656321","doi":"10.5539/ibr.v10n12p197","title":"A bi-objective simulation-optimization approach for solving a no-wait two stages flexible flow shop scheduling problem with rework ability","year":2017,"lang":"en","type":"article","venue":"International Business Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Tardiness; Mathematical optimization; Job shop scheduling; Flow shop scheduling; Sorting; Computer science; Multi-objective optimization; Pareto principle; Rework; Metaheuristic; Heuristics; Genetic algorithm; Evolutionary algorithm; Scheduling (production processes); Mathematics; Algorithm; Schedule","score_opus":0.052971520914546814,"score_gpt":0.35445760827406597,"score_spread":0.30148608735951915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769656321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005424849,0.000054972727,0.9858336,0.00031623355,0.0004110895,0.0008692736,0.00004847189,0.00029819188,0.006743309],"genre_scores_gemma":[0.41638651,0.000025582174,0.5822054,0.000008729101,0.00048181048,0.00027474127,0.0001630465,0.00005952953,0.00039464206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977598,0.000046215362,0.00034570365,0.00051325,0.0008722659,0.00046271822],"domain_scores_gemma":[0.9944063,0.00045785485,0.00011073394,0.0005283897,0.004392129,0.0001045934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011232869,0.00023068886,0.00023137411,0.00040011117,0.0008331439,0.000969602,0.0006763446,0.00013026853,0.000116295705],"category_scores_gemma":[0.0018132135,0.00021543656,0.00006075908,0.00045890477,0.0001836589,0.0009084246,0.00014443352,0.0004001633,0.000015644964],"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.00018831046,0.00008538695,0.003919995,0.00014374137,0.000111125606,0.0000019356983,0.00019963244,0.99308157,0.00010992121,0.00013270203,0.000032255044,0.0019934492],"study_design_scores_gemma":[0.0011774633,0.000031102234,0.001738276,0.00016574349,0.0000104915525,0.0000028305726,0.00010077483,0.99591804,0.0002833253,0.00021885906,0.00009691011,0.00025618533],"about_ca_topic_score_codex":0.000075420634,"about_ca_topic_score_gemma":0.000012757741,"teacher_disagreement_score":0.41096166,"about_ca_system_score_codex":0.00031263928,"about_ca_system_score_gemma":0.00017077196,"threshold_uncertainty_score":0.93498945},"labels":[],"label_agreement":null},{"id":"W2770579925","doi":"10.1016/j.eswa.2017.11.030","title":"Exact and metaheuristic algorithms to minimize the total tardiness of cutting tool sharpening operations","year":2017,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Sharpening; Tardiness; Computer science; Scheduling (production processes); Metaheuristic; Algorithm; Mathematical optimization; Minification; Schedule; Job shop scheduling; Artificial intelligence; Mathematics","score_opus":0.014599479612991089,"score_gpt":0.2575661905310628,"score_spread":0.24296671091807168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770579925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00845701,0.0007907072,0.9883791,0.00029670936,0.00019442737,0.00084998814,0.000033593733,0.00014482008,0.0008536531],"genre_scores_gemma":[0.82600856,0.000027860044,0.17153352,0.00002153618,0.00028601623,0.0017414136,0.000015412472,0.00004001792,0.00032564235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915135,0.000020158961,0.00029252388,0.00021041883,0.0001627415,0.00016280521],"domain_scores_gemma":[0.99896723,0.000090898924,0.00006944631,0.0006586857,0.0001308463,0.00008292162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018390692,0.00015008917,0.00022071695,0.000057144953,0.0006476831,0.00027515553,0.00026920115,0.000045966266,0.00000959337],"category_scores_gemma":[0.00007003301,0.0001071383,0.000028735258,0.00012669242,0.000063867155,0.00015321786,0.00005009952,0.000088317494,0.0000129503],"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.000008959455,0.000036374448,0.00047681987,0.00009525603,0.00018963373,0.0000017438016,0.0027005437,0.98319435,0.0030660569,0.0022634435,0.00031323897,0.007653582],"study_design_scores_gemma":[0.0003939646,0.000016946378,0.0021201393,0.00011169183,0.000041083505,0.000051858056,0.0015057652,0.99234957,0.0011365524,0.0000050238336,0.0019854053,0.0002819801],"about_ca_topic_score_codex":0.0001621817,"about_ca_topic_score_gemma":0.0000032599728,"teacher_disagreement_score":0.81755155,"about_ca_system_score_codex":0.000022088483,"about_ca_system_score_gemma":0.000022114647,"threshold_uncertainty_score":0.49815205},"labels":[],"label_agreement":null},{"id":"W2774697324","doi":"10.1007/s00170-017-1429-0","title":"Scheduling in aerospace composite manufacturing systems: a two-stage hybrid flow shop problem","year":2017,"lang":"en","type":"article","venue":"The International Journal of Advanced Manufacturing Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Crossover; Flow shop scheduling; Mathematical optimization; Aerospace; Scheduling (production processes); Genetic algorithm; Computer science; Job shop scheduling; Population; Integer programming; Heuristic; Algorithm; Engineering; Mathematics; Artificial intelligence","score_opus":0.009512957300918,"score_gpt":0.252637454289202,"score_spread":0.24312449698828398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774697324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94582695,0.00052285386,0.04911276,0.0017743466,0.0020257866,0.00017325375,0.0000089854375,0.00021569019,0.00033937424],"genre_scores_gemma":[0.88826406,0.00023534482,0.111101985,0.000029401397,0.00021507763,0.000011906698,0.0000026063133,0.000041632364,0.00009800738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984552,0.000021281447,0.0006130674,0.00018917082,0.00039676533,0.00032450564],"domain_scores_gemma":[0.99872965,0.00008306684,0.0005044739,0.0004798679,0.00014196258,0.000060977054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040993094,0.00024161558,0.0003408335,0.0005334612,0.00023213826,0.00035814254,0.0018821346,0.00009573052,0.0000146911025],"category_scores_gemma":[0.00009116655,0.00019862238,0.00009440164,0.00004438654,0.00014352411,0.00049302605,0.00024864287,0.0008254453,0.0000115256735],"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.000049642902,0.000019522098,0.00020716879,0.000022496255,0.00011699901,0.00017964483,0.0000848226,0.981057,0.0032329687,0.00021130408,0.000009423873,0.014809046],"study_design_scores_gemma":[0.00252993,0.00005120355,0.00050286367,0.0006487491,0.000025149975,0.0009551483,0.0005490564,0.36062354,0.6303755,0.0020780151,0.0012888071,0.00037203555],"about_ca_topic_score_codex":0.000019357833,"about_ca_topic_score_gemma":0.000021448252,"teacher_disagreement_score":0.62714255,"about_ca_system_score_codex":0.00028078436,"about_ca_system_score_gemma":0.00003397447,"threshold_uncertainty_score":0.8099586},"labels":[],"label_agreement":null},{"id":"W2785688695","doi":"10.1109/rtss.2017.00050","title":"Work-in-Progress: Isochronous Execution Models for Mixed-Criticality Systems on Parallel Processors","year":2017,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"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; Correctness; Mixed criticality; Predictability; Generality; Scheduling (production processes); Parallel computing; Criticality; Job shop scheduling; Processor scheduling; Redundancy (engineering); Execution time; Distributed computing; Execution model; Embedded system; Resource (disambiguation); Algorithm; Operating system; Mathematical optimization","score_opus":0.029993469285947275,"score_gpt":0.2771543642720117,"score_spread":0.24716089498606442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785688695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015345344,0.0005681738,0.9730171,0.00034702296,0.00079938734,0.0005925761,0.0000120492095,0.0004939994,0.008824346],"genre_scores_gemma":[0.9412753,0.00003107487,0.05800602,0.000019116222,0.000091852235,0.0002300581,0.000011863515,0.000027567286,0.00030716683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991874,0.0000113310425,0.00021677965,0.00019622741,0.00012533132,0.0002629427],"domain_scores_gemma":[0.99945366,0.000044569875,0.000032222688,0.00032932073,0.00006909049,0.00007110986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019654907,0.00013258134,0.00017248468,0.000049966475,0.00014956182,0.00019591043,0.0001909291,0.00010877619,0.0000060743273],"category_scores_gemma":[0.00006384219,0.00012366165,0.000043637185,0.000045646535,0.0000429475,0.00021461818,0.000013735585,0.00009655132,0.000016862532],"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.000024600424,0.000042586238,0.00012863213,0.00012533531,0.000011498333,0.0000014548818,0.00009016176,0.9869263,0.0000010169299,0.010120739,0.00019409035,0.0023335726],"study_design_scores_gemma":[0.0005188277,0.000024893174,0.00028442979,0.00010712328,0.0000071245086,9.329013e-7,0.00008944714,0.99783885,0.000079423866,0.0007574102,0.00012208466,0.00016942917],"about_ca_topic_score_codex":0.00001571016,"about_ca_topic_score_gemma":0.0000063014704,"teacher_disagreement_score":0.92592996,"about_ca_system_score_codex":0.00006829106,"about_ca_system_score_gemma":0.000013455654,"threshold_uncertainty_score":0.5042776},"labels":[],"label_agreement":null},{"id":"W2788450963","doi":"10.1139/tcsme-2015-0037","title":"PIRAA: DEVELOPMENT OF AN INJECTION MOLDING MACHINE MANUFACTURING MONITORING SYSTEM BASED ON PRODUCTION INFORMATION RETRIEVAL AGENT ARCHITECTURE","year":2015,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Cloud computing; Production (economics); Process (computing); Molding (decorative); Data retrieval; Architecture; Information exchange; Database; Engineering; Mechanical engineering; Operating system","score_opus":0.013673255108881038,"score_gpt":0.19974922899405323,"score_spread":0.1860759738851722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2788450963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11694583,0.000021966025,0.88092613,0.000038061808,0.001497032,0.00034088147,0.000029029761,0.00018794936,0.00001313536],"genre_scores_gemma":[0.84385127,8.6642467e-7,0.15602124,0.0000055213163,0.00005873568,0.000022261702,0.000011618211,0.00002472196,0.000003768044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.00000948693,0.00034188124,0.00010776559,0.00024460742,0.00019916557],"domain_scores_gemma":[0.99944854,0.000021783993,0.00005980619,0.00019912292,0.00008749261,0.00018324915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003691949,0.00014444157,0.00015464293,0.00014454087,0.0001611735,0.000021364865,0.0001392279,0.00012958852,0.0000020337577],"category_scores_gemma":[0.00003503333,0.00013745253,0.00016856089,0.00024931875,0.000009324266,0.00017448439,0.0000028421173,0.00023179916,4.1944523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012538106,0.0000068279483,8.1736397e-7,0.00023299825,0.000043226733,4.040693e-8,0.0006221993,0.9928409,0.00082152383,0.000016313743,0.0000019273787,0.0054006977],"study_design_scores_gemma":[0.00026349357,0.00003676568,0.000016224612,0.00014769676,0.000028829025,0.0000032024088,0.0003307183,0.77338225,0.22559775,0.000003471006,0.000083501945,0.00010607898],"about_ca_topic_score_codex":0.0003585743,"about_ca_topic_score_gemma":0.00032862308,"teacher_disagreement_score":0.72690547,"about_ca_system_score_codex":0.0008872153,"about_ca_system_score_gemma":0.00014405638,"threshold_uncertainty_score":0.56051517},"labels":[],"label_agreement":null},{"id":"W2793260077","doi":"10.1109/ccwc.2018.8301705","title":"Simultaneous scheduling of machines and automated guided vehicles utilizing heuristic search algorithm","year":2018,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Dynamic priority scheduling; Fair-share scheduling; Scheduling (production processes); Two-level scheduling; Rate-monotonic scheduling; Job shop scheduling; Distributed computing; Real-time computing; Embedded system; Mathematical optimization; Schedule; Operating system","score_opus":0.017554185583011965,"score_gpt":0.27583053312701544,"score_spread":0.25827634754400347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793260077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896431,0.00060078135,0.30424738,0.000044413307,0.0003448728,0.000152662,0.000013750975,0.0024959191,0.0024571468],"genre_scores_gemma":[0.62339586,0.000039573075,0.37636662,0.00001811367,0.00007974602,0.0000013870233,0.0000052313108,0.000025293764,0.000068154994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991502,0.00002305452,0.00027733613,0.00016744019,0.00015964884,0.00022232671],"domain_scores_gemma":[0.999377,0.00017147086,0.00002310008,0.00015516534,0.00018392726,0.00008932077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017299506,0.00014181584,0.00018545077,0.00011855667,0.000085381806,0.00004136753,0.00009997347,0.00007972455,0.000090976944],"category_scores_gemma":[0.00014457495,0.0001324877,0.00002596175,0.00023404429,0.0001077055,0.00006556657,0.000040100043,0.00010039371,0.000026817042],"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.000009635289,0.00003681451,0.00075013837,0.00017388246,0.000105277635,0.000020121806,0.00091904233,0.85895544,0.00793872,0.00020436326,0.00014525218,0.13074131],"study_design_scores_gemma":[0.0002819144,0.000031177868,0.00012768852,0.000039872262,0.000012385331,0.00002217816,0.00017163389,0.9886341,0.010481081,0.000025427384,0.000025356492,0.00014716767],"about_ca_topic_score_codex":0.00004841119,"about_ca_topic_score_gemma":0.0000030587253,"teacher_disagreement_score":0.13059415,"about_ca_system_score_codex":0.000016327687,"about_ca_system_score_gemma":0.000015099576,"threshold_uncertainty_score":0.54026914},"labels":[],"label_agreement":null},{"id":"W2793821770","doi":"10.1108/jqme-11-2016-0069","title":"Maintenance and setup planning in manufacturing systems under uncertainties","year":2018,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Robustness (evolution); Production (economics); Computer science; Hamilton–Jacobi–Bellman equation; Mathematical optimization; Paper machine; Optimal control; Industrial engineering; Reliability engineering; Engineering; Mathematics","score_opus":0.022166998238164867,"score_gpt":0.27065885335014706,"score_spread":0.24849185511198219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793821770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.801426,0.0011988071,0.19566736,0.00014289237,0.001244334,0.000082881445,0.0000026159782,0.000070697475,0.00016440907],"genre_scores_gemma":[0.9857404,0.00016814443,0.013722814,0.000042848653,0.00024922992,0.0000038128676,6.529777e-7,0.000031813095,0.000040246043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984496,0.000040090625,0.000784787,0.00013317021,0.00020932488,0.000383012],"domain_scores_gemma":[0.999404,0.00015717,0.00013392912,0.00012933969,0.00008820791,0.00008732262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012139569,0.00019110166,0.00039778612,0.00038389527,0.000025907751,0.00006996067,0.00016077801,0.00009887302,0.0000047268118],"category_scores_gemma":[0.00019210503,0.00017817509,0.00004521714,0.00022772451,0.00004888157,0.00028204086,0.000025373378,0.00046728598,0.0000018827213],"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.000018393925,0.000007848747,0.0015726114,0.00014302589,0.000020986194,0.000036767804,0.001109902,0.99581456,0.0002919637,0.000577028,0.000054134412,0.00035277283],"study_design_scores_gemma":[0.0012048554,0.000057250123,0.03058746,0.0019621344,0.0000072108523,0.00016837852,0.004279361,0.9596673,0.0009438465,0.00024112906,0.00049288815,0.00038816727],"about_ca_topic_score_codex":0.000036110083,"about_ca_topic_score_gemma":0.000012807049,"teacher_disagreement_score":0.18431443,"about_ca_system_score_codex":0.00024624637,"about_ca_system_score_gemma":0.000019921668,"threshold_uncertainty_score":0.7265769},"labels":[],"label_agreement":null},{"id":"W2795943763","doi":"10.1007/978-3-319-89656-4_36","title":"Automated Scheduling: Reinforcement Learning Approach to Algorithm Policy Learning","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Automated planning and scheduling; Artificial intelligence; Machine learning; Mathematical optimization; Mathematics","score_opus":0.013642011004647247,"score_gpt":0.24345368081353472,"score_spread":0.22981166980888748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795943763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005168396,0.00013445792,0.98516726,0.00006909832,0.0008820622,0.000294708,0.0000011688691,0.0018514293,0.011548147],"genre_scores_gemma":[0.020582715,0.00004054528,0.9762351,0.00032578825,0.0013552924,0.000013782676,0.000037880105,0.00011648694,0.0012923889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972406,0.00002229922,0.00048803302,0.00082951173,0.00070801005,0.0007115698],"domain_scores_gemma":[0.99883103,0.000101621896,0.00011561693,0.00044895476,0.00023654573,0.0002662406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006016677,0.0005323282,0.00045142262,0.0012831786,0.00030627887,0.00035227655,0.00080954825,0.00036622747,0.000051942112],"category_scores_gemma":[0.00020281236,0.00054718833,0.0000905451,0.0009045729,0.00024329191,0.00017076547,0.00034125138,0.001179092,0.00016988219],"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.0000014598947,0.000004682601,0.000002844219,0.000025648724,0.000014096103,0.000004131324,0.0009273613,0.84712315,0.000017240243,0.0001242619,0.000009675567,0.15174547],"study_design_scores_gemma":[0.0001913364,0.000111764704,0.000004622148,0.00024332631,0.000008269579,0.000023077677,0.0000015397162,0.9965271,0.00036226882,0.00046976973,0.0014512854,0.0006056564],"about_ca_topic_score_codex":0.000014298997,"about_ca_topic_score_gemma":0.0000015030606,"teacher_disagreement_score":0.15113981,"about_ca_system_score_codex":0.0004849625,"about_ca_system_score_gemma":0.00024428245,"threshold_uncertainty_score":0.999698},"labels":[],"label_agreement":null},{"id":"W2795993153","doi":"10.1007/978-3-319-89656-4_5","title":"Logic-Based Benders Decomposition for Two-Stage Flexible Flow Shop Scheduling with Unrelated Parallel Machines","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Integer programming; Benders' decomposition; Flow shop scheduling; Decomposition; Scheduling (production processes); Schedule; Minification; Parallel computing; Algorithm; Mathematics","score_opus":0.01869293230081087,"score_gpt":0.2630693514547308,"score_spread":0.24437641915391994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795993153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018398144,0.00026127484,0.9968334,0.0001331179,0.000950012,0.00044790248,0.000021595673,0.0005110492,0.0006577006],"genre_scores_gemma":[0.017947054,0.00000973276,0.9809141,0.0004222745,0.0003631872,0.000019104746,0.0001137511,0.00008175079,0.00012905442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981069,0.000011424249,0.00033682876,0.0006973377,0.00038408555,0.00046341142],"domain_scores_gemma":[0.9988689,0.00025257404,0.00010486789,0.00042109904,0.0002303318,0.00012224607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032958545,0.00046807513,0.00037188316,0.0005103993,0.00022829797,0.00023145415,0.00051611377,0.00028062076,0.00008140743],"category_scores_gemma":[0.00003085154,0.00040732374,0.000091085734,0.00033568367,0.00031382256,0.00017755543,0.000056964127,0.000457188,0.000015056717],"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.000029930026,0.000009409403,0.000011196896,0.000059636237,0.00002172772,0.000007989755,0.0001248962,0.9788852,0.00004516279,0.00030696127,0.0000047397316,0.02049318],"study_design_scores_gemma":[0.00086221704,0.00015739896,0.0000032744624,0.0003621464,0.000022561593,0.000010238089,4.7696165e-7,0.99219686,0.0011328147,0.004652118,0.000063028165,0.0005368693],"about_ca_topic_score_codex":0.0000045898646,"about_ca_topic_score_gemma":0.00003989031,"teacher_disagreement_score":0.019956311,"about_ca_system_score_codex":0.00018981959,"about_ca_system_score_gemma":0.00015360696,"threshold_uncertainty_score":0.9998379},"labels":[],"label_agreement":null},{"id":"W2798036437","doi":"10.1016/j.cie.2018.04.021","title":"Permutation flowshop scheduling with time lag constraints and makespan criterion","year":2018,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","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":"McMaster University","funders":"Humanities and Social Sciences Youth Foundation, Ministry of Education of the People's Republic of China; Natural Science Foundation of Beijing Municipality; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Mathematical optimization; Scheduling (production processes); Benchmark (surveying); Minification; Permutation (music); Computer science; Heuristic; Integer programming; Time complexity; Schedule; Heuristics; Mathematics; Algorithm","score_opus":0.013809986667271523,"score_gpt":0.20143540699199744,"score_spread":0.18762542032472593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798036437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40560386,0.00006651442,0.5920389,0.000056078123,0.0011036936,0.00016262819,0.000005593702,0.0007671437,0.00019555984],"genre_scores_gemma":[0.8419191,0.000005495365,0.15669386,0.000034487755,0.001225194,0.000007823272,0.000027048161,0.00006448136,0.00002250936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991473,0.000012529446,0.0002088222,0.00022473001,0.00013831802,0.00026831662],"domain_scores_gemma":[0.9995732,0.00006103817,0.000026003445,0.00013939085,0.00006620046,0.0001341977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013344154,0.0002136228,0.0001962781,0.00016627055,0.00007937093,0.0001356889,0.00009455472,0.00015083849,0.000046472294],"category_scores_gemma":[0.000041924992,0.00022142973,0.000025496774,0.00025704785,0.00008017059,0.00018032108,0.000026478678,0.00024406503,0.000029330115],"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.00001678007,0.0000073003484,0.00006201948,0.000022563005,0.000064343396,0.000011275978,0.00044552752,0.9590566,0.0028668495,0.00009681967,0.00007937878,0.037270524],"study_design_scores_gemma":[0.00090257876,0.00008119701,0.000095253876,0.00017404043,0.000019954527,0.000049558486,0.000042131138,0.9961633,0.0018737187,0.000003090216,0.00031752608,0.0002776426],"about_ca_topic_score_codex":0.000002024767,"about_ca_topic_score_gemma":3.599814e-7,"teacher_disagreement_score":0.43631524,"about_ca_system_score_codex":0.000053432865,"about_ca_system_score_gemma":0.00002259409,"threshold_uncertainty_score":0.9029642},"labels":[],"label_agreement":null},{"id":"W2802130908","doi":"10.1139/tcsme-2005-0012","title":"REAL-TIME SCHEDULING OF DISTRIBUTED MULTI-ROBOT MANIPULATOR SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Transactions of the Canadian Society for Mechanical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Distributed computing; Two-level scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Fair-share scheduling; Fixed-priority pre-emptive scheduling; Robot; Earliest deadline first scheduling; Real-time computing; Round-robin scheduling; Mathematical optimization; Artificial intelligence; Computer network; Mathematics; Quality of service","score_opus":0.013848426472470124,"score_gpt":0.20998761055111745,"score_spread":0.19613918407864733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802130908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077108396,0.00013223116,0.99079746,0.00010037415,0.0004556768,0.00030104164,0.0003117599,0.0001797101,0.000010917581],"genre_scores_gemma":[0.69209445,0.000025757046,0.3076688,0.00000643614,0.00005621692,0.00002992155,0.00001707088,0.000046618192,0.000054738004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.0000056973736,0.00034780026,0.00012066976,0.00012902734,0.00028261673],"domain_scores_gemma":[0.9993851,0.000058497026,0.00004229693,0.00024275747,0.00008509886,0.00018625846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001655373,0.00014832494,0.00023627425,0.000052319134,0.00011182729,0.000016741704,0.00022461636,0.00017913066,0.000021587863],"category_scores_gemma":[0.000024246832,0.00014579232,0.00041045755,0.00029308288,0.000021207617,0.00007676137,0.0000034559341,0.00017859561,0.0000021213923],"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.0000011822069,0.000009741508,7.5506796e-7,0.00011615968,0.00012329906,4.8432494e-8,0.00007145821,0.98745364,0.011642472,0.00037526106,0.000019866264,0.00018613315],"study_design_scores_gemma":[0.00034486648,0.000009889166,0.000012047905,0.00007398793,0.000072384726,0.000002860756,0.000067037625,0.9833823,0.015678972,0.0000028467678,0.00021073816,0.00014207512],"about_ca_topic_score_codex":0.0017779157,"about_ca_topic_score_gemma":0.000988951,"teacher_disagreement_score":0.68438363,"about_ca_system_score_codex":0.00031899218,"about_ca_system_score_gemma":0.00008064217,"threshold_uncertainty_score":0.59452385},"labels":[],"label_agreement":null},{"id":"W2802796399","doi":"","title":"Solution Strategies in Short-term Scheduling for Multitasking Multipurpose Plants","year":2018,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Human multitasking; Term (time); Scheduling (production processes); Computer science; Operations research; Operations management; Engineering; Biology; Neuroscience; Physics","score_opus":0.015327714414231374,"score_gpt":0.22598348264688464,"score_spread":0.21065576823265328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802796399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9902713,0.00019746377,0.007928103,0.0000142786075,0.000828448,0.00035678828,0.000060320133,0.00018783598,0.00015549223],"genre_scores_gemma":[0.68223333,0.0003858496,0.3014766,0.0000031009886,0.00019296796,0.0000046686746,0.002674375,0.00011377268,0.012915359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990937,0.000016161397,0.000170545,0.0002728276,0.00015243875,0.00029433123],"domain_scores_gemma":[0.9995514,0.000034116383,0.00005881474,0.00017303886,0.00012212613,0.000060481165],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000122012694,0.00023968707,0.00033166973,0.00038297928,0.00012444473,0.00003786433,0.00022587358,0.00037088885,0.000033868986],"category_scores_gemma":[0.000012156869,0.00031556564,0.000109486755,0.00012583115,0.000039006696,0.00030826376,0.000017573899,0.00020500347,0.000013556842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080429844,0.00022537922,0.0013961847,0.0034216284,0.0005407606,0.00007024377,0.38041928,0.5499478,0.03518685,0.00013467959,0.00043754352,0.02741536],"study_design_scores_gemma":[0.0012096306,0.000070589056,0.0027029405,0.00079422496,0.00008130547,0.0000017010168,0.17086972,0.81822276,0.0054023354,0.000041323085,0.000044632274,0.0005588368],"about_ca_topic_score_codex":0.0016017908,"about_ca_topic_score_gemma":0.028921727,"teacher_disagreement_score":0.30803797,"about_ca_system_score_codex":0.0001022818,"about_ca_system_score_gemma":0.00004945205,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W2805549752","doi":"10.1007/s10878-018-0314-6","title":"A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"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":"Theory of computation; Computer science; Job shop scheduling; Time complexity; Scheduling (production processes); Mathematical optimization; Polynomial-time approximation scheme; Dynamic programming; Approximation algorithm; Schedule; sort; Algorithm; Parallel computing; Mathematics","score_opus":0.013612547916405274,"score_gpt":0.2620959733299292,"score_spread":0.24848342541352392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805549752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019928051,0.00004325074,0.9731244,0.0001655874,0.005358213,0.0003477444,0.0000070679566,0.00012228584,0.0009033967],"genre_scores_gemma":[0.11647367,0.000019929626,0.87998813,0.000067996625,0.0032119877,0.000012497353,0.000034856614,0.00007271943,0.00011821512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832124,0.0000556267,0.0007957229,0.00016033907,0.00040534954,0.00026172298],"domain_scores_gemma":[0.9984485,0.0001362428,0.00033425548,0.00016748189,0.0007609421,0.00015256643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071433926,0.00021323671,0.0003503677,0.00028480668,0.00015750465,0.00019841362,0.00023634372,0.00016870804,0.00012992953],"category_scores_gemma":[0.00051754975,0.00021261677,0.0001551455,0.0003034032,0.0000521362,0.0005020544,0.000021733591,0.00024119648,0.000037218408],"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.0004016071,0.00008762372,0.00001537817,0.000021362577,0.00006851366,0.0000018946168,0.00011483837,0.9947385,0.0005301442,0.0031343526,0.0005686224,0.00031712596],"study_design_scores_gemma":[0.004571142,0.0004918219,0.000008237909,0.00007769468,0.000047349586,0.000012196446,0.000035234545,0.9916114,0.0020797092,0.00041775775,0.00042409205,0.00022335602],"about_ca_topic_score_codex":8.100104e-7,"about_ca_topic_score_gemma":7.938159e-8,"teacher_disagreement_score":0.096545614,"about_ca_system_score_codex":0.00015853344,"about_ca_system_score_gemma":0.00009076598,"threshold_uncertainty_score":0.86702603},"labels":[],"label_agreement":null},{"id":"W2810067378","doi":"10.1522/revueot.v25n2.314","title":"Nouvelles technologies de production : comment utiliser la méthode de la chaîne critique pour optimiser les délais et l’allocation des ressources dans les projets","year":2016,"lang":"fr","type":"article","venue":"Revue Organisations & territoires","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Humanities; Political science; Art","score_opus":0.027493382123724965,"score_gpt":0.2728704707729289,"score_spread":0.24537708864920396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810067378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15908872,0.0033772676,0.6428564,0.19135606,0.0002747843,0.0004809607,0.00008680812,0.0013964608,0.0010825354],"genre_scores_gemma":[0.57352644,0.0069356477,0.4158548,0.00006066645,0.00028295428,0.00018738335,0.000029985813,0.00011391706,0.0030082166],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977244,0.0006611383,0.000474102,0.00046719014,0.00018041335,0.00049276935],"domain_scores_gemma":[0.99843806,0.0006197038,0.00014741962,0.00047821365,0.0002161408,0.00010043814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009125274,0.00038504376,0.0002852921,0.00028435068,0.0006291551,0.00023720035,0.00035072296,0.0005706467,0.00011067483],"category_scores_gemma":[0.0013713095,0.00036309243,0.00009709616,0.0003534395,0.0006894657,0.0005295365,0.00008637469,0.0003905198,0.000018105977],"study_design_candidate":"bench_or_experimental","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.000050896822,0.001451453,0.04727485,0.0017906817,0.00044759788,0.00004904587,0.13220578,0.20411257,0.15233135,0.020257391,0.010713577,0.4293148],"study_design_scores_gemma":[0.0016483272,0.00021365612,0.022177571,0.0071569425,0.00054265,0.00093504676,0.033503238,0.08197211,0.5894591,0.01769046,0.24265684,0.0020440135],"about_ca_topic_score_codex":0.0025110769,"about_ca_topic_score_gemma":0.0007457921,"teacher_disagreement_score":0.4371278,"about_ca_system_score_codex":0.0013374252,"about_ca_system_score_gemma":0.00036369593,"threshold_uncertainty_score":0.9998821},"labels":[],"label_agreement":null},{"id":"W2810729413","doi":"10.1287/msom.2017.0689","title":"Determining Process Capacity: Intractability and Efficient Special Cases","year":2018,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bottleneck; Human multitasking; Computer science; Process (computing); Capacity management; Mathematical optimization; Simple (philosophy); Mathematics","score_opus":0.014189821609917939,"score_gpt":0.23000288565133295,"score_spread":0.215813064041415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810729413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.979992,0.00000974905,0.014080815,0.0001667475,0.0005281927,0.0002946338,0.0000060687266,0.00030686505,0.004614946],"genre_scores_gemma":[0.9717851,0.000010373062,0.02725335,0.00022194878,0.00058665255,0.000048421956,0.0000117123855,0.00002582471,0.00005657049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908924,0.00001787793,0.0002243336,0.0002701482,0.00016847946,0.00022991722],"domain_scores_gemma":[0.9995591,0.000021360605,0.000016907812,0.0002485779,0.00007319424,0.00008085812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014457856,0.00017568153,0.00012380084,0.00011537071,0.00032675915,0.0002236864,0.00013058296,0.000044142114,0.00019369191],"category_scores_gemma":[0.00001026509,0.00017838409,0.000018445498,0.00014944017,0.00004060072,0.00014666386,0.00006806492,0.00010400845,0.000071362105],"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.0000050733415,0.000048112473,0.000110643516,0.00024808024,0.00004944253,0.000011568339,0.0024371068,0.97689867,0.000027705522,0.00012595953,0.00003129257,0.020006318],"study_design_scores_gemma":[0.00040337825,0.000035847057,0.00588551,0.000061423394,0.000054372005,0.00002363496,0.0015264004,0.9776523,0.012920472,0.00004111684,0.0010342001,0.0003613465],"about_ca_topic_score_codex":0.000023678773,"about_ca_topic_score_gemma":0.00029276696,"teacher_disagreement_score":0.019644972,"about_ca_system_score_codex":0.000062710846,"about_ca_system_score_gemma":0.0000060249627,"threshold_uncertainty_score":0.7274292},"labels":[],"label_agreement":null},{"id":"W2886369417","doi":"10.4212/cjhp.v48i5.2328","title":"Distributed Processing: What We Can Learn from Computer Technology / Le traitement réparti : un modèle informatique exemplaire","year":2018,"lang":"fr","type":"article","venue":"The Canadian Journal of Hospital Pharmacy","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Humanities; Computer science; Art; Artificial intelligence","score_opus":0.015621910747620317,"score_gpt":0.2317760448935863,"score_spread":0.216154134145966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886369417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43033007,0.040539335,0.16310802,0.35433027,0.010554108,0.00049746636,0.00034733396,0.00013062874,0.0001627727],"genre_scores_gemma":[0.9784109,0.00061112683,0.019158747,0.00046327297,0.0011800914,0.0000054278166,0.000032581465,0.00004919674,0.00008867263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829227,0.00007471724,0.0006782012,0.00014001092,0.0002212165,0.0005936128],"domain_scores_gemma":[0.998308,0.000039912098,0.0003214874,0.00020136009,0.0004883103,0.0006409491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034804636,0.00028244883,0.0003246397,0.00026099244,0.00055399153,0.0005948649,0.0006240276,0.00014161432,0.00033040033],"category_scores_gemma":[0.000041186304,0.0002494327,0.000116065705,0.0005372723,0.00045011437,0.0010500841,0.000035452565,0.00079920527,0.00005196909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043606717,0.0001226661,0.00072270597,0.0001100633,0.0006697391,0.00027867348,0.035843905,0.2900762,0.000051912888,0.0008071886,0.015128586,0.65614474],"study_design_scores_gemma":[0.002807498,0.0005531883,0.00048946147,0.001138782,0.00021894518,0.0002522662,0.0061518666,0.83461136,0.009177791,0.0023623724,0.14152852,0.0007079559],"about_ca_topic_score_codex":0.008064414,"about_ca_topic_score_gemma":0.0108183725,"teacher_disagreement_score":0.6554368,"about_ca_system_score_codex":0.00042702488,"about_ca_system_score_gemma":0.0015312688,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W2886895431","doi":"10.1007/s10878-018-0339-x","title":"Approximation algorithms for the graph balancing problem with two speeds and two job lengths","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Approximation algorithm; Combinatorics; Theory of computation; Mathematics; Cardinality (data modeling); Graph; Algorithm; Discrete mathematics; Schedule; Computer science","score_opus":0.009381341884826729,"score_gpt":0.24075798057857492,"score_spread":0.2313766386937482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886895431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004218327,0.00023242515,0.9920261,0.00019103813,0.0025888234,0.0003405866,0.0000024778756,0.00006933824,0.00033090235],"genre_scores_gemma":[0.21833272,0.00016252011,0.7794791,0.000035930185,0.0018952208,0.000014765086,0.000007577697,0.000053558313,0.00001861128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000034878027,0.0004182006,0.00010722458,0.0002861632,0.00017723365],"domain_scores_gemma":[0.99868697,0.00016135428,0.0002428562,0.000118462835,0.0007123889,0.00007793919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159426,0.00015855614,0.000217132,0.00015856161,0.00020491837,0.00015712147,0.00013789423,0.00006327929,0.000011308207],"category_scores_gemma":[0.00007484104,0.00011072834,0.000053702148,0.00035837345,0.000071868286,0.00041515808,0.0000129370555,0.00016993072,7.8614636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008645717,0.00002072967,0.00010653977,0.000023686021,0.00008724249,7.10853e-7,0.00046317314,0.99336386,0.000048473285,0.0022597162,0.00014591352,0.0033935213],"study_design_scores_gemma":[0.0037599187,0.00035046146,0.00003864923,0.000072589,0.00010850088,0.000051365834,0.00015303936,0.99251634,0.00080724445,0.0017930982,0.00019361173,0.00015515473],"about_ca_topic_score_codex":0.000003623354,"about_ca_topic_score_gemma":0.0000010650806,"teacher_disagreement_score":0.2141144,"about_ca_system_score_codex":0.00005577164,"about_ca_system_score_gemma":0.000046551635,"threshold_uncertainty_score":0.45153704},"labels":[],"label_agreement":null},{"id":"W2887054016","doi":"","title":"Magnesium Alloy Die Casting Process Improvement using the Single Minute Exchange of Dies (SMED) Method and Other Techniques","year":2018,"lang":"en","type":"book-chapter","venue":"BCU Open Access Repository (Birmingham City University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Changeover; Downtime; Engineering; Manufacturing engineering; Bottleneck; Throughput; Die (integrated circuit); Process (computing); Operations management; Reliability engineering; Computer science; Mechanical engineering","score_opus":0.07077096430479286,"score_gpt":0.30351731078535465,"score_spread":0.2327463464805618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887054016","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02137025,0.0016454469,0.12796232,0.00007026895,0.0015939202,0.0036363523,0.00015615916,0.00097635994,0.8425889],"genre_scores_gemma":[0.050734304,0.00056284084,0.3007733,0.00029511785,0.0019890764,0.000040637184,0.000046963596,0.00078951736,0.64476824],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984897,0.000047335758,0.00039453927,0.0005074801,0.00028813444,0.00027281573],"domain_scores_gemma":[0.99857676,0.00009927581,0.00045198962,0.0004673196,0.0003018654,0.00010280192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002897108,0.0004352094,0.00052328693,0.0003126833,0.00040178333,0.0004922069,0.0013373167,0.0003068138,0.00009041239],"category_scores_gemma":[0.000020782089,0.00041262482,0.00010323938,0.00015050283,0.00024137564,0.0007456966,0.0011350656,0.0002989201,7.772807e-7],"study_design_candidate":"bench_or_experimental","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.0033635774,0.0022407817,0.009241699,0.04806596,0.0146257095,0.005475947,0.081712455,0.09108761,0.19685443,0.010353775,0.005974632,0.5310034],"study_design_scores_gemma":[0.0032860588,0.0011799113,0.00011451636,0.006028257,0.003774126,0.00043139092,0.00521341,0.15171278,0.5133834,0.0016078018,0.3064626,0.006805796],"about_ca_topic_score_codex":0.0002905569,"about_ca_topic_score_gemma":0.00009748669,"teacher_disagreement_score":0.52419764,"about_ca_system_score_codex":0.00021469791,"about_ca_system_score_gemma":0.000086911554,"threshold_uncertainty_score":0.9998326},"labels":[],"label_agreement":null},{"id":"W2890510167","doi":"10.1016/j.ejor.2018.08.048","title":"Trade-off balancing in scheduling for flow shop production and perioperative processes","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary; University of Kentucky","keywords":"Heuristics; Computer science; Minification; Flow shop scheduling; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Heuristic; Benchmark (surveying); Operations research; Schedule; Mathematics; Artificial intelligence","score_opus":0.05010628717069896,"score_gpt":0.32711245413797563,"score_spread":0.27700616696727665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890510167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87025917,0.0027232866,0.11970129,0.0030973488,0.00081009977,0.0005025541,0.000009534882,0.000048087026,0.0028486392],"genre_scores_gemma":[0.8626472,0.00025134097,0.13569136,0.000024614652,0.0012357717,0.0000051582683,0.000003870241,0.000028690201,0.00011199395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988454,0.00018403245,0.00032217256,0.00012932663,0.00033398846,0.00018507418],"domain_scores_gemma":[0.99881667,0.00013073339,0.000027675193,0.00005785612,0.0008885579,0.00007850696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027595623,0.00008204241,0.00011477452,0.00026507472,0.00020874698,0.00016710354,0.00011080547,0.000019525161,0.000029964196],"category_scores_gemma":[0.0021514676,0.00007165119,0.000018649804,0.00034936704,0.000091989634,0.00036382006,0.000016981163,0.0003050216,0.000006943169],"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.0001791151,0.000073757874,0.00086504064,0.00016975148,0.000055271623,0.000031658776,0.009943413,0.9493195,0.010675556,0.00026400381,0.000802796,0.027620174],"study_design_scores_gemma":[0.00089011254,0.00047987688,0.0022206106,0.00038149496,0.0000055164783,0.0001316984,0.0018691639,0.98233885,0.00910349,0.000025360012,0.0023813883,0.00017243507],"about_ca_topic_score_codex":2.7196285e-7,"about_ca_topic_score_gemma":0.0000052479813,"teacher_disagreement_score":0.03301939,"about_ca_system_score_codex":0.00006033975,"about_ca_system_score_gemma":0.00016170583,"threshold_uncertainty_score":0.29218507},"labels":[],"label_agreement":null},{"id":"W2891018386","doi":"10.1108/bpmj-07-2017-0188","title":"Continuous process improvement implementation framework using multi-objective genetic algorithms and discrete event simulation","year":2018,"lang":"en","type":"article","venue":"Business Process Management Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Discrete event simulation; Computer science; Process (computing); Event (particle physics); Genetic algorithm; Volume (thermodynamics); Continuous optimization; Mathematical optimization; Work in process; Lead time; Algorithm; Optimization problem; Mathematics; Simulation; Engineering; Machine learning; Multi-swarm optimization; Operations management","score_opus":0.014103941200264362,"score_gpt":0.31214850933167276,"score_spread":0.2980445681314084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891018386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19996968,0.00021417782,0.79850775,0.000034460314,0.00060919917,0.00046501757,0.000004929804,0.00013628534,0.000058500016],"genre_scores_gemma":[0.8395542,0.0001559932,0.15961371,0.000057856298,0.0004932944,0.000038771403,0.000008069585,0.00005946035,0.000018624407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983214,0.000026963666,0.0005240869,0.00031436075,0.00041706138,0.0003961016],"domain_scores_gemma":[0.99881154,0.000023003822,0.00022966407,0.00014602805,0.00066671043,0.00012306872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026484698,0.00029083938,0.00022838563,0.00027698986,0.0004001938,0.00034042704,0.00017483997,0.00008486463,0.000080325575],"category_scores_gemma":[0.00003535957,0.00028033895,0.00003852553,0.00062141597,0.00006614155,0.00046919176,0.000052362146,0.00020353874,0.000005719362],"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.000027951317,0.00005406685,0.0019800423,0.0003582395,0.00018367908,0.000015546095,0.0013951443,0.8651182,0.0000507693,0.00002148811,0.000003899496,0.13079095],"study_design_scores_gemma":[0.0013496458,0.00007440045,0.010165183,0.00024764772,0.00015279891,0.00003214825,0.0030725305,0.98151803,0.00058303884,0.0023885535,0.000023408104,0.00039259775],"about_ca_topic_score_codex":0.0000066257103,"about_ca_topic_score_gemma":0.000003521936,"teacher_disagreement_score":0.63958454,"about_ca_system_score_codex":0.0001304363,"about_ca_system_score_gemma":0.000034487894,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2901038528","doi":"10.1007/978-3-030-04618-7_3","title":"Makespan Minimization on Unrelated Parallel Machines with a Few Bags","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"Western University","funders":"","keywords":"Minification; Job shop scheduling; Computer science; Cost-minimization analysis; Parallel computing; Mathematical optimization; Mathematics; Medicine; Operating system; Internal medicine; Schedule","score_opus":0.01023101172302039,"score_gpt":0.2140643128168145,"score_spread":0.20383330109379413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901038528","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026941684,0.00014720585,0.9941636,0.00012608939,0.0008767855,0.00019847469,0.0000048286634,0.00032808358,0.0038855614],"genre_scores_gemma":[0.028068095,0.0000654489,0.9694551,0.00064335275,0.0006257571,0.000008669434,0.000048246155,0.000115777286,0.0009695207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984866,0.000010037303,0.0002450176,0.0005410411,0.0004182355,0.00029910041],"domain_scores_gemma":[0.9991698,0.0001173537,0.00007408837,0.00041752882,0.00012892562,0.00009225375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014678852,0.0003704148,0.00027491376,0.0004562476,0.00010752276,0.00015764822,0.0004348342,0.00025946097,0.0001265011],"category_scores_gemma":[0.0000278677,0.00030148544,0.00004019924,0.0003715413,0.00026521564,0.00010632525,0.00005535714,0.00043214334,0.00006968755],"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.000010537241,0.000006195565,0.000018289607,0.000017238022,0.00001208311,0.000013383741,0.00028870453,0.94756454,0.0000033640986,0.00017864438,0.00002630583,0.051860716],"study_design_scores_gemma":[0.0002888779,0.0001399073,0.000045882312,0.00037082957,0.000010893775,0.00002162644,1.4745342e-7,0.99597627,0.0001169565,0.0023072246,0.00032438018,0.0003970019],"about_ca_topic_score_codex":0.000003555263,"about_ca_topic_score_gemma":0.000029484909,"teacher_disagreement_score":0.051463716,"about_ca_system_score_codex":0.000116687304,"about_ca_system_score_gemma":0.00007630491,"threshold_uncertainty_score":0.99994373},"labels":[],"label_agreement":null},{"id":"W2904955028","doi":"10.1109/coase.2018.8560576","title":"Multiagent Manufacturing Scheduling: An Updated State of the Art Review","year":2018,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scheduling (production processes); Computer science; Open research; State of art; Multi-agent system; Data science; Management science; Operations research; Distributed computing; Artificial intelligence; World Wide Web; Engineering; Operations management","score_opus":0.01549292621781969,"score_gpt":0.24675124001040524,"score_spread":0.23125831379258555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904955028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58993506,0.0037931236,0.3766597,0.00092465716,0.0026556735,0.0010916814,0.000024357876,0.0017656094,0.023150163],"genre_scores_gemma":[0.76453054,0.0014470717,0.23058826,0.0010608457,0.00016050556,0.000010784396,0.00003862481,0.00006455927,0.0020988125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.000020456204,0.00020685379,0.00009915393,0.000116692696,0.00012611363],"domain_scores_gemma":[0.99955124,0.0000063729235,0.00003159206,0.0003002354,0.000058581645,0.000051998006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013388315,0.00009061625,0.00011405129,0.000025340736,0.000041421838,0.00001236555,0.00016111745,0.00002254176,0.0006416187],"category_scores_gemma":[0.000012882184,0.00006138873,0.000039838258,0.00011422362,0.00003445037,0.00007313604,0.000025316043,0.00007861282,0.00011630955],"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.000010451341,0.00010401597,0.00024691445,0.00068062154,0.000177066,0.0000034757468,0.0006141281,0.89881134,0.0028437183,0.00010733522,0.010448247,0.0859527],"study_design_scores_gemma":[0.000206328,0.000022003818,0.0006659739,0.00026182248,0.00002412362,0.000003318181,0.000023338882,0.75581557,0.23295528,0.00002836082,0.009822508,0.00017135641],"about_ca_topic_score_codex":0.0000036679428,"about_ca_topic_score_gemma":0.000008477909,"teacher_disagreement_score":0.23011155,"about_ca_system_score_codex":0.000013390391,"about_ca_system_score_gemma":0.000008424932,"threshold_uncertainty_score":0.70252746},"labels":[],"label_agreement":null},{"id":"W2905262274","doi":"10.1016/j.cor.2018.12.008","title":"Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems","year":2018,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Toronto; University of Windsor","funders":"","keywords":"Iterated local search; Mathematical optimization; Sizing; Linearization; Local search (optimization); Iterated function; Algorithm; Computer science; Local optimum; Integer programming; Time horizon; Mathematics; Nonlinear system","score_opus":0.0403622500725725,"score_gpt":0.30495988380866484,"score_spread":0.26459763373609235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905262274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106691726,0.00020202834,0.8919328,0.00016844041,0.00017759383,0.0006341175,0.000033279706,0.00012059587,0.000039446622],"genre_scores_gemma":[0.6251715,0.00010059378,0.37392926,0.000035376284,0.00034647688,0.00008664646,0.00021970118,0.00004596661,0.000064511034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985339,0.000101442354,0.00037479223,0.00038917706,0.00018339683,0.00041726086],"domain_scores_gemma":[0.9990335,0.0001563006,0.000010257996,0.00020332873,0.0004543371,0.00014225651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009836991,0.0001572587,0.00018389562,0.00053243176,0.0005739983,0.0006528512,0.0001409173,0.00006801267,0.000017804326],"category_scores_gemma":[0.00004774556,0.0001673342,0.000019385916,0.0003275006,0.00023347621,0.00043884682,0.000095163596,0.0002928319,0.00001750776],"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.000004558902,0.000007882217,0.00006282789,0.00003541097,0.000016984795,0.0000023147124,0.001173274,0.9228027,0.0001660663,0.00009943126,0.000085675914,0.075542875],"study_design_scores_gemma":[0.00070889207,0.00009992988,0.0000654122,0.00007833117,0.0000031436666,0.000030066687,0.00019923234,0.9963051,0.0020438798,0.000057073285,0.0002262569,0.0001826687],"about_ca_topic_score_codex":0.00013102972,"about_ca_topic_score_gemma":0.00013971268,"teacher_disagreement_score":0.51847976,"about_ca_system_score_codex":0.00043059752,"about_ca_system_score_gemma":0.00024455492,"threshold_uncertainty_score":0.6823691},"labels":[],"label_agreement":null},{"id":"W2907490482","doi":"10.5267/j.uscm.2018.12.007","title":"Effective cost minimization strategy and an optimization model of a reliable global supply chain system","year":2018,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Supply chain; Minification; Computer science; Chain (unit); Mathematical optimization; Business; Mathematics; Marketing","score_opus":0.010388147235458754,"score_gpt":0.23687434640657015,"score_spread":0.2264861991711114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907490482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006423969,0.00014981255,0.9835715,0.000049865743,0.0002744704,0.0013616204,0.00009073417,0.00042718317,0.0076508177],"genre_scores_gemma":[0.73027736,0.00016572117,0.2685019,0.000055673947,0.00014164661,0.00021385991,0.00026538456,0.00005432397,0.00032412657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985097,0.000073277166,0.00039318713,0.00039461572,0.00028830016,0.00034093575],"domain_scores_gemma":[0.99922186,0.000027375967,0.000094902716,0.00034318748,0.0001791851,0.0001334808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036588413,0.00027555294,0.00028157537,0.00018476935,0.00012697956,0.00008713711,0.00018450008,0.00012648191,0.00003903231],"category_scores_gemma":[0.000013926545,0.0002916632,0.000039923238,0.0005038579,0.000090033485,0.00023099477,0.000058361624,0.00007534355,0.0000068455174],"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.00004448394,0.00004226015,0.00035796233,0.00028182735,0.00007576599,0.00000353916,0.00038375222,0.985706,0.000016355596,0.008120818,0.00025676246,0.0047105155],"study_design_scores_gemma":[0.0010001819,0.00016109292,0.00013417567,0.0001493131,0.00006453604,0.0000028621957,0.0014853238,0.99631166,0.00018746255,0.00013863151,0.00008460222,0.00028018278],"about_ca_topic_score_codex":0.000075179945,"about_ca_topic_score_gemma":0.00002312056,"teacher_disagreement_score":0.7238534,"about_ca_system_score_codex":0.00028780298,"about_ca_system_score_gemma":0.000019291621,"threshold_uncertainty_score":0.99995357},"labels":[],"label_agreement":null},{"id":"W2907856996","doi":"","title":"Multi-objective parallel machine scheduling with incompatible jobs","year":2014,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Processor scheduling; Distributed computing; Operating system; Mathematical optimization; Mathematics; Schedule","score_opus":0.012264653891615913,"score_gpt":0.2211869341664225,"score_spread":0.20892228027480658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907856996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03394655,0.0026876626,0.9403629,0.0042693573,0.00060327153,0.000643904,0.000076834905,0.00074607314,0.016663479],"genre_scores_gemma":[0.23521335,0.0008097311,0.7543639,0.000064903375,0.00006886221,0.00010656424,0.00059533474,0.00016255645,0.008614829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926095,0.0039882474,0.0008902455,0.001174694,0.0006000951,0.00073720404],"domain_scores_gemma":[0.99249476,0.001530012,0.0005936868,0.0022717584,0.0026621674,0.00044761374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044091474,0.0008228434,0.0008350258,0.000330898,0.00061160396,0.0005957695,0.0013075597,0.0005769812,0.0003455904],"category_scores_gemma":[0.0011379315,0.00087090966,0.00027277213,0.00072276924,0.0003587117,0.00024470178,0.00075679214,0.0016314513,0.00028212921],"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.000034687167,0.00070632197,0.009075119,0.00042690782,0.000414719,0.000010840749,0.01120213,0.9339486,0.00045655487,0.029059818,0.00007882372,0.0145855],"study_design_scores_gemma":[0.0018031781,0.0000012184723,0.006596447,0.0031033845,0.00012848493,0.000026788619,0.00021846588,0.9778563,0.0068473467,0.00048972963,0.0019768628,0.00095181505],"about_ca_topic_score_codex":0.0042145727,"about_ca_topic_score_gemma":0.0040201508,"teacher_disagreement_score":0.2012668,"about_ca_system_score_codex":0.00036776203,"about_ca_system_score_gemma":0.00031567574,"threshold_uncertainty_score":0.99937415},"labels":[],"label_agreement":null},{"id":"W2910537293","doi":"10.3166/jesa.51.323-332","title":"An improved bacterial foraging optimization for multi-objective flexible job-shop scheduling problem","year":2018,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Foraging; Computer science; Job shop scheduling; Scheduling (production processes); Mathematical optimization; Ecology; Mathematics; Biology; Embedded system","score_opus":0.02304780594097234,"score_gpt":0.2743759657794912,"score_spread":0.25132815983851886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910537293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062298857,0.0001825264,0.93372643,0.000022985732,0.0016571531,0.0005083219,0.00002146616,0.0011852008,0.0003970642],"genre_scores_gemma":[0.16132762,0.00004913568,0.83680373,0.00003269971,0.0014228863,0.000043966942,0.00002826621,0.0001575744,0.00013411575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801743,0.00011838602,0.0007271885,0.0003200141,0.00023546386,0.00058149255],"domain_scores_gemma":[0.99843407,0.00006500877,0.0002558031,0.00026592726,0.0007012835,0.00027788494],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066372496,0.00034992932,0.00037866837,0.00032582815,0.00068451546,0.00075391715,0.0003319953,0.00016185878,0.00015448777],"category_scores_gemma":[0.00018858135,0.00033895535,0.00014036358,0.00041655157,0.000094727286,0.001075748,0.0000353926,0.00028846465,0.000025250343],"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.00005024741,0.00005609792,0.00014614759,0.00014722157,0.00014256549,0.0000048505312,0.0017764361,0.9266833,0.006269364,0.00007205346,0.00007476807,0.06457694],"study_design_scores_gemma":[0.0016015423,0.00032291014,0.0013034686,0.00023802681,0.000063164975,0.00017102029,0.00033120724,0.9917453,0.003559815,0.0001840714,0.00006694594,0.00041253038],"about_ca_topic_score_codex":0.0000074952545,"about_ca_topic_score_gemma":0.000008598634,"teacher_disagreement_score":0.09902876,"about_ca_system_score_codex":0.00028359733,"about_ca_system_score_gemma":0.00011117022,"threshold_uncertainty_score":0.99990624},"labels":[],"label_agreement":null},{"id":"W2913525679","doi":"10.1007/978-0-387-36594-7_3","title":"Agent-Based Supply Chain Planning in the Forest Products Industry","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Architecture; Supply chain; Business; Order (exchange); Scheduling (production processes); Process management; Globalization; Computer science; Engineering management; Engineering; Operations management; Marketing; Economics","score_opus":0.03578156017577068,"score_gpt":0.24575314437059712,"score_spread":0.20997158419482642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913525679","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000600535,0.0009891386,0.024086608,0.00049312203,0.00089057273,0.0006097478,0.000020247071,0.00060397823,0.97170603],"genre_scores_gemma":[0.106824726,0.000119398355,0.13563552,0.0041758916,0.0037850006,0.00011119218,0.0013231223,0.0007558283,0.74726933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902105,0.000007680506,0.00026832556,0.00021252043,0.00024525603,0.000245153],"domain_scores_gemma":[0.9994939,0.00007304283,0.000039352468,0.00031048773,0.000036866,0.000046330773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033773933,0.00026356717,0.00018723156,0.00025973996,0.000036406007,0.000047946476,0.00022444276,0.0006070532,0.0002492664],"category_scores_gemma":[0.000028267366,0.00020782473,0.00004548071,0.00008956396,0.000028083481,0.00003323832,0.000012771954,0.0010967646,0.00006188796],"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.0000058596793,0.000010504315,0.00036734168,0.00008073154,0.000026652539,0.00011288397,0.000280862,0.9861592,0.0000015744464,0.006321214,0.0040673455,0.0025658105],"study_design_scores_gemma":[0.001459093,0.00008303439,0.0011509034,0.0011265529,0.000075945965,0.00004286241,0.00045302694,0.8064862,0.00036927883,0.0006900149,0.18628551,0.0017775913],"about_ca_topic_score_codex":0.00000866399,"about_ca_topic_score_gemma":0.000024468949,"teacher_disagreement_score":0.22443673,"about_ca_system_score_codex":0.000059569164,"about_ca_system_score_gemma":0.000040885905,"threshold_uncertainty_score":0.84748465},"labels":[],"label_agreement":null},{"id":"W2918488533","doi":"10.1007/978-1-4899-7993-3_900-2","title":"Common Warehouse Metamodel","year":2016,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Ottawa","funders":"","keywords":"Metamodeling; Warehouse; Computer science; Database; Business; Software engineering; Marketing","score_opus":0.016084977152430034,"score_gpt":0.2193602627736628,"score_spread":0.20327528562123276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918488533","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001825817,0.0071866047,0.047156513,0.000011496276,0.003289549,0.00041271703,0.0035059806,0.00059462246,0.93782425],"genre_scores_gemma":[0.0021583089,0.017364973,0.01868104,0.000023816552,0.0022789664,0.00008356604,0.0018167744,0.00064644124,0.95694613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982374,0.000021767066,0.0007489607,0.00032165833,0.00041727207,0.00025297125],"domain_scores_gemma":[0.99844366,0.00013034542,0.00020926085,0.0009566693,0.00010309629,0.00015694977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023098415,0.0004418975,0.0007383744,0.0002493747,0.000037238355,0.000021332791,0.00034982254,0.00030650408,0.00024894436],"category_scores_gemma":[0.000024713316,0.0003758209,0.00015116252,0.000039311668,0.000056352164,0.00017400358,0.00007834942,0.00029896517,0.00043444894],"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.000093053255,0.0001636311,0.00013852221,0.009572784,0.00393636,0.0004132838,0.0011982766,0.36482814,0.00022941142,0.34985057,0.22589086,0.043685123],"study_design_scores_gemma":[0.0007802851,0.000043155305,0.0000018046026,0.0023418227,0.00030295312,0.000033387452,0.000033687713,0.07228629,0.000088991095,0.00032155245,0.9224908,0.0012752861],"about_ca_topic_score_codex":0.000021027703,"about_ca_topic_score_gemma":0.000008126727,"teacher_disagreement_score":0.6965999,"about_ca_system_score_codex":0.000071104856,"about_ca_system_score_gemma":0.000051075116,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null},{"id":"W2920093561","doi":"10.5267/j.ijiec.2019.2.001","title":"Improving effectiveness of parallel machine scheduling with earliness and tardiness costs: A case study","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad de La Sabana; Universidad de Navarra","keywords":"Tardiness; Scheduling (production processes); Computer science; Due date; Mathematical optimization; Job shop scheduling; Mathematics; Schedule","score_opus":0.011875914427762547,"score_gpt":0.24421337612736793,"score_spread":0.2323374616996054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920093561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67908615,0.00008866562,0.3196532,0.000011098389,0.00093802164,0.00016559925,0.000010947109,0.000035850062,0.000010425059],"genre_scores_gemma":[0.9713751,0.0000049558025,0.028379178,0.0000019117606,0.00019804123,0.0000046894647,0.0000056156086,0.000028751858,0.0000017498762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989409,0.000040201634,0.0004458455,0.00010486802,0.0003643703,0.00010385082],"domain_scores_gemma":[0.9986167,0.00036463933,0.00016342936,0.000076954886,0.0007067376,0.00007152722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005193883,0.00014836865,0.00028323274,0.00036627863,0.000023513272,0.00006725552,0.00015397563,0.00006316415,0.0000065260965],"category_scores_gemma":[0.00016218188,0.00013338054,0.000048121045,0.00023942614,0.000015572432,0.00023622345,0.000030781048,0.00031899448,5.9902345e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086075335,0.000065485816,0.0064176773,0.00003350052,0.00035167803,0.00026194163,0.00018248042,0.9897386,0.00027756623,0.000059129543,7.0883345e-7,0.0025251503],"study_design_scores_gemma":[0.0041485433,0.00022088231,0.000694927,0.00037971776,0.000057777917,0.0018916647,0.00074090075,0.9914088,0.00029208063,0.000004572119,0.000004910411,0.000155187],"about_ca_topic_score_codex":0.00008372771,"about_ca_topic_score_gemma":0.0000035440871,"teacher_disagreement_score":0.29228893,"about_ca_system_score_codex":0.00012463144,"about_ca_system_score_gemma":0.00007699434,"threshold_uncertainty_score":0.5439101},"labels":[],"label_agreement":null},{"id":"W2920431827","doi":"10.34989/san-2018-2","title":"Wages: Measurement and Key Drivers","year":2021,"lang":"en","type":"article","venue":"Staff Analytical Notes","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Bank of Canada","funders":"","keywords":"Humanities; Political science; Philosophy","score_opus":0.023078873144500158,"score_gpt":0.22923888611502022,"score_spread":0.20616001297052006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920431827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3397933,0.0024250199,0.64536816,0.0013624276,0.00058623846,0.0001282176,0.000021658654,0.00069585897,0.009619118],"genre_scores_gemma":[0.946971,0.00011805942,0.052752282,0.000037266644,0.000054466866,8.6803897e-7,0.0000041015023,0.000014516086,0.000047445857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947065,0.000010696529,0.000095495154,0.00011541101,0.00017780773,0.00012993238],"domain_scores_gemma":[0.99967265,0.00004036792,0.0000054986526,0.0000972536,0.00008822145,0.00009601347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000705982,0.00007497269,0.000099844234,0.00003017529,0.000032698892,0.00003896693,0.00003160556,0.00004085501,0.000130963],"category_scores_gemma":[0.00018420564,0.00007323968,0.000029764891,0.00013567481,0.000030525793,0.000037184807,0.000015942085,0.00007314394,0.000017204924],"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.000011340301,0.0002127095,0.004693351,0.00021178507,0.00063781225,0.0001963327,0.0014525017,0.95595855,0.003900866,0.010805653,0.0011002735,0.020818813],"study_design_scores_gemma":[0.00018706046,0.000013663301,0.00023664473,0.000015781145,0.000041240135,0.000004788319,0.00023499236,0.99584043,0.0024848392,0.00016807915,0.0006485625,0.00012394218],"about_ca_topic_score_codex":0.0000032260516,"about_ca_topic_score_gemma":0.0000059703543,"teacher_disagreement_score":0.6071777,"about_ca_system_score_codex":0.0000344396,"about_ca_system_score_gemma":0.000020021083,"threshold_uncertainty_score":0.29866275},"labels":[],"label_agreement":null},{"id":"W2926671677","doi":"10.18280/mmep.060104","title":"Makespan reduction using dynamic job sequencing combined with buffer optimization applying genetic algorithm in a manufacturing system","year":2019,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Reduction (mathematics); Genetic algorithm; Computer science; Mathematical optimization; Buffer (optical fiber); Algorithm; Mathematics; Machine learning; Embedded system; Routing (electronic design automation)","score_opus":0.011362768123212416,"score_gpt":0.18349097427652528,"score_spread":0.17212820615331287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2926671677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28537136,0.00012821375,0.71343035,0.000003925242,0.00011947081,0.0004274339,0.000001212624,0.00045299827,0.00006504864],"genre_scores_gemma":[0.4885596,0.000021549216,0.5112587,0.0000010954395,0.000018806875,0.000047548667,0.0000047173176,0.00007058532,0.000017336513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998611,0.000015606518,0.00043783672,0.00032335598,0.00021327022,0.00039898092],"domain_scores_gemma":[0.9995612,0.000040588904,0.000046634577,0.00021486542,0.000031634663,0.00010510765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021297405,0.0003081694,0.00037166342,0.000269182,0.000060025966,0.00011812579,0.000088534325,0.0001439603,0.000007763212],"category_scores_gemma":[0.0000036027595,0.0002949859,0.000035252666,0.00023497234,0.000016052363,0.00017460059,0.000021859143,0.00029081115,0.00000733022],"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.0000048381517,0.000008433288,0.000009880899,0.0012866488,0.000027647482,0.000004544467,0.0004288952,0.99721694,0.00041146172,0.00008734105,6.6455094e-8,0.0005132878],"study_design_scores_gemma":[0.0005238414,0.000036278798,0.000004949264,0.0013149689,0.000030289995,0.00014335863,0.00026867609,0.9968574,0.00036150494,0.00008548448,9.244269e-7,0.00037233927],"about_ca_topic_score_codex":0.000014229688,"about_ca_topic_score_gemma":3.389782e-7,"teacher_disagreement_score":0.20318827,"about_ca_system_score_codex":0.00028676627,"about_ca_system_score_gemma":0.000014063418,"threshold_uncertainty_score":0.99995023},"labels":[],"label_agreement":null},{"id":"W2938732013","doi":"10.1016/j.asoc.2019.03.054","title":"The economic lot scheduling problem in limited-buffer flexible flow shops: Mathematical models and a discrete fruit fly algorithm","year":2019,"lang":"en","type":"article","venue":"Applied Soft Computing","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":"University of Windsor","funders":"","keywords":"Tabu search; Mathematical optimization; Computer science; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Genetic algorithm; Integer programming; Linear programming; Algorithm; Mathematics; Schedule","score_opus":0.010077158433210264,"score_gpt":0.21701515867258364,"score_spread":0.20693800023937337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938732013","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08272331,0.0003298443,0.9120814,0.00006721118,0.00020080183,0.0004928996,0.0000035023124,0.0004921657,0.0036088612],"genre_scores_gemma":[0.4772335,0.000028369352,0.52246517,0.00005017891,0.000091528906,0.000020894444,0.000008466736,0.00005964356,0.00004223381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985564,0.000020166004,0.00045782438,0.00035185492,0.00014478392,0.0004689812],"domain_scores_gemma":[0.99913234,0.00041661935,0.00005589316,0.00028066593,0.000019793439,0.00009470446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325284,0.00025291054,0.00030912075,0.00009622651,0.00016246135,0.00023070186,0.00022072312,0.0001378031,0.000015635547],"category_scores_gemma":[0.000011693947,0.00021836582,0.000047501413,0.00016261582,0.000045082543,0.00012230164,0.00012892428,0.00039902807,0.00012407728],"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.0000046647247,0.000006681441,0.000040242678,0.00005230964,0.000028815768,8.160953e-7,0.0008147184,0.949901,0.00003665034,0.0047952416,0.000008177517,0.044310696],"study_design_scores_gemma":[0.00055407174,0.0000107490505,0.000021848527,0.00009035178,0.000009850869,0.0000074173167,0.00047247313,0.9914655,0.00012976557,0.0069213016,0.000038248123,0.00027842104],"about_ca_topic_score_codex":0.00000517227,"about_ca_topic_score_gemma":0.0000021044789,"teacher_disagreement_score":0.3945102,"about_ca_system_score_codex":0.00011009831,"about_ca_system_score_gemma":0.00003433497,"threshold_uncertainty_score":0.89046997},"labels":[],"label_agreement":null},{"id":"W2941795674","doi":"","title":"A computational study of practical issues arising in short-term scheduling of a multipurpose facility","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Term (time); Scheduling (production processes); Operations research; Computer science; Engineering; Operations management; Physics","score_opus":0.01851288420862474,"score_gpt":0.25572933771326034,"score_spread":0.2372164535046356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941795674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99778765,0.000098855366,0.0014105872,0.000020682028,0.00016567687,0.00039238395,0.00004007532,0.00004691651,0.000037168873],"genre_scores_gemma":[0.9484978,0.000029760895,0.049477037,5.262401e-7,0.000007895222,4.1803074e-7,0.00031729214,0.000017854709,0.0016514359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891317,0.00006237873,0.0002937188,0.0002442029,0.00033560023,0.00015092913],"domain_scores_gemma":[0.99929214,0.000087663735,0.00012542307,0.00020634501,0.00024346633,0.000044993194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016734275,0.00019111315,0.00054624124,0.00038725877,0.000034546174,0.000009415037,0.00016625987,0.00022581298,0.000044208966],"category_scores_gemma":[0.000036089106,0.00024375528,0.000093053946,0.00024523522,0.00004003691,0.00018206258,0.000031479507,0.00029727854,0.000005796012],"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.00017756062,0.00045676422,0.012008586,0.0007498388,0.00018029315,0.000016782245,0.18254854,0.801983,0.0009287873,0.0000097300635,0.000005815993,0.0009343357],"study_design_scores_gemma":[0.0014290025,0.00018216853,0.025095252,0.00037580982,0.0001333481,0.0000014121114,0.38892728,0.58237827,0.001166483,0.000011441815,0.0000014143998,0.00029814363],"about_ca_topic_score_codex":0.004436445,"about_ca_topic_score_gemma":0.0041012242,"teacher_disagreement_score":0.21960472,"about_ca_system_score_codex":0.000058313915,"about_ca_system_score_gemma":0.00006199251,"threshold_uncertainty_score":0.99400514},"labels":[],"label_agreement":null},{"id":"W2944209481","doi":"10.5267/j.ijiec.2019.3.003","title":"Flexible job-shop scheduling with learning and forgetting effect by Multi-Agent System","year":2019,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Forgetting; Job shop; Computer science; Scheduling (production processes); Job shop scheduling; Industrial engineering; Operations management; Operations research; Flow shop scheduling; Engineering; Psychology; Operating system; Cognitive psychology; Schedule","score_opus":0.01152798882352392,"score_gpt":0.23971536870080842,"score_spread":0.2281873798772845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944209481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4146434,0.0002483273,0.58282393,0.000055055454,0.0018367566,0.00011310814,0.0000047726817,0.00018920828,0.00008544634],"genre_scores_gemma":[0.9370653,0.000014517336,0.062438726,0.000005614764,0.00037133327,0.0000035809642,0.000012219164,0.000041541356,0.000047138485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989708,0.000026583626,0.0004059865,0.0001102771,0.00032909657,0.00015724354],"domain_scores_gemma":[0.99922633,0.00024129626,0.00014152616,0.000047854326,0.0002391593,0.00010383863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031651492,0.00016434604,0.00022874499,0.0002904077,0.000047319416,0.00014702383,0.00015795103,0.00009217732,0.000007871395],"category_scores_gemma":[0.00012582415,0.00015094613,0.00005811427,0.00018072975,0.000010573553,0.00022137059,0.000024568086,0.00050564145,0.000007663571],"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.000018582205,0.000008232606,0.0038740907,0.000026027672,0.00021965872,0.000010566849,0.00010220176,0.99149877,0.0009107431,0.0000696309,0.000022068543,0.0032394172],"study_design_scores_gemma":[0.0021134212,0.000117793126,0.000088616165,0.00051470706,0.000030982654,0.00016845463,0.00019740785,0.99444944,0.0017920756,5.807309e-7,0.00036419177,0.00016235559],"about_ca_topic_score_codex":0.0000035104422,"about_ca_topic_score_gemma":1.4956156e-7,"teacher_disagreement_score":0.5224219,"about_ca_system_score_codex":0.00016090013,"about_ca_system_score_gemma":0.00003500455,"threshold_uncertainty_score":0.61554044},"labels":[],"label_agreement":null},{"id":"W2947518691","doi":"10.15377/2409-5710.2018.05.4","title":"A Clustering Algorithm for Block-Cave Production Scheduling","year":2019,"lang":"en","type":"article","venue":"Global Journal of Earth Science and Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheduling (production processes); Cluster analysis; Computer science; Production schedule; Mathematical optimization; Schedule; Algorithm; Industrial engineering; Engineering; Mathematics; Artificial intelligence","score_opus":0.007066089317860959,"score_gpt":0.21470990697524667,"score_spread":0.2076438176573857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947518691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44848806,0.00051386474,0.5482998,0.000036209978,0.002354052,0.00012364516,0.000002809406,0.00007200311,0.00010957754],"genre_scores_gemma":[0.5312338,0.0000655554,0.46842483,0.000012576528,0.00024219962,0.0000013442743,2.7776252e-7,0.000009320574,0.00001011376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909955,0.0000023213208,0.00023392976,0.0001261937,0.000281436,0.00025657134],"domain_scores_gemma":[0.9994512,0.000015219277,0.000049738872,0.000083178275,0.00027370316,0.0001269231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005517428,0.00010694176,0.00015277906,0.00014409123,0.00006294883,0.0001029179,0.00013494836,0.000037855832,0.0000026018974],"category_scores_gemma":[0.00010779566,0.00010181418,0.00004077786,0.00045950784,0.000031437037,0.00045922134,0.000021953863,0.000110049594,0.0000031179766],"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.0000026166424,0.000003467078,0.00015236769,0.0000334806,0.000012623917,0.0000013807224,0.00005124397,0.9683394,0.005572159,0.000019138328,0.000004548239,0.02580758],"study_design_scores_gemma":[0.00027922846,0.000054698794,0.00067134184,0.00010177639,0.00001004622,0.0002454239,0.00010750927,0.9954961,0.0026994902,0.00000981648,0.00020297845,0.0001215804],"about_ca_topic_score_codex":6.757583e-7,"about_ca_topic_score_gemma":2.8549948e-7,"teacher_disagreement_score":0.08274573,"about_ca_system_score_codex":0.00004330144,"about_ca_system_score_gemma":0.00004711066,"threshold_uncertainty_score":0.41518617},"labels":[],"label_agreement":null},{"id":"W2951140915","doi":"10.1007/s10479-019-03296-x","title":"A bi-criteria optimization model for medical device sterilization","year":2019,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Mathematical optimization; Sterilization (economics); Theory of computation; Scheduling (production processes); Computer science; Bottleneck; Job shop scheduling; Integer programming; Linear programming; Pareto principle; Algorithm; Mathematics; Schedule; Embedded system","score_opus":0.1807393677163225,"score_gpt":0.4466198620249063,"score_spread":0.26588049430858374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951140915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032858517,0.00015406219,0.96428186,0.0008908907,0.00013670493,0.000505398,0.000034290024,0.000085330794,0.0010529413],"genre_scores_gemma":[0.7244327,0.0005602389,0.27270165,0.00018402295,0.00011404301,0.00017049341,0.0003249887,0.00005570525,0.0014561217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987806,0.000060046987,0.00029293224,0.00015694668,0.00047798638,0.00023150234],"domain_scores_gemma":[0.99848336,0.000103726794,0.000009570865,0.0002213338,0.0010847147,0.00009731202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009717094,0.0000802604,0.00013175668,0.00026439008,0.000103714134,0.00008446078,0.00018621213,0.000115617906,0.00052203384],"category_scores_gemma":[0.0004043894,0.00008108886,0.00004024294,0.00045873687,0.0000359394,0.0002725222,0.000031223943,0.00012406117,0.000035347744],"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.000012661086,0.000030003739,0.000016233722,0.00006965106,0.000015229371,1.290504e-7,0.0002831602,0.9966456,0.00039737707,0.0008588222,0.0008535278,0.0008176025],"study_design_scores_gemma":[0.0002658784,0.000047045825,0.0000089851765,0.00004477123,0.000002081272,8.663642e-7,0.000089315625,0.9975101,0.0017479672,0.000038678627,0.00016017936,0.000084137224],"about_ca_topic_score_codex":0.000010424739,"about_ca_topic_score_gemma":0.000017826642,"teacher_disagreement_score":0.69158024,"about_ca_system_score_codex":0.000014973946,"about_ca_system_score_gemma":0.00013264744,"threshold_uncertainty_score":0.5715904},"labels":[],"label_agreement":null},{"id":"W2954538625","doi":"10.23977/acss.2018.21002","title":"RGV dynamic scheduling optimization model based on greedy algorithm","year":2018,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Maximization; Greedy algorithm; Minification; Dynamic priority scheduling; Mathematical optimization; Task (project management); Process (computing); Distributed computing; Algorithm; Engineering; Schedule; Mathematics","score_opus":0.009956661245621876,"score_gpt":0.24301431635326115,"score_spread":0.23305765510763926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954538625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011603027,0.0019747165,0.99502146,0.000016078782,0.0011153333,0.00016868468,0.00000783844,0.00021030518,0.0003253063],"genre_scores_gemma":[0.33790174,0.00022894105,0.6614766,0.00007726673,0.00023900898,0.000019155206,0.0000136146,0.000029544393,0.000014124527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989964,0.000037539976,0.00031034256,0.00026525275,0.00017154407,0.00021893354],"domain_scores_gemma":[0.99955493,0.000074058014,0.00004903672,0.00017347961,0.000079334444,0.00006917628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021408158,0.00018141857,0.00022549856,0.00017644295,0.00007763132,0.000100134144,0.0001134233,0.000084693886,0.0000066459506],"category_scores_gemma":[0.000005774145,0.00017584207,0.000027038002,0.00022736385,0.000039875642,0.00024760576,0.000016836402,0.00011345736,0.0000070519336],"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.000003674106,0.000013838974,0.0000385228,0.000043464435,0.0000055025175,0.0000022155505,0.00007122112,0.96572554,0.0000060793245,0.000041757314,0.000005307565,0.03404286],"study_design_scores_gemma":[0.00043165142,0.000083123006,0.0000052247237,0.00023751531,0.0000039584684,0.000003822514,0.000019815972,0.9988925,0.00001938421,0.00004985,0.00004123633,0.00021195423],"about_ca_topic_score_codex":0.0000029288751,"about_ca_topic_score_gemma":0.0000023219716,"teacher_disagreement_score":0.33674145,"about_ca_system_score_codex":0.00004347596,"about_ca_system_score_gemma":0.000012276946,"threshold_uncertainty_score":0.7170631},"labels":[],"label_agreement":null},{"id":"W2954565304","doi":"10.3166/jesa.46.381-395","title":"Analyse par intervalles et optimisation convexe pour résoudre un problème général de faisabilité d’une contrainte robuste","year":2012,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics","score_opus":0.021530126801018876,"score_gpt":0.25744959801146766,"score_spread":0.2359194712104488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954565304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33150452,0.010937458,0.6466236,0.0056813364,0.002661503,0.000453919,0.000058015128,0.00064853946,0.0014310959],"genre_scores_gemma":[0.61371493,0.00090085965,0.3829601,0.00021450843,0.00093343604,0.000017972026,0.000020675829,0.0001601824,0.0010773119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487215,0.0012458717,0.0015720747,0.0003641624,0.0005903354,0.0013554248],"domain_scores_gemma":[0.9970776,0.0004400696,0.0006683767,0.00043470203,0.0004866304,0.000892664],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025709732,0.00067992974,0.00086766644,0.00035717938,0.00044155668,0.00071843696,0.00048921455,0.0004044911,0.0012242242],"category_scores_gemma":[0.0009008289,0.0006917675,0.00053012185,0.0006820346,0.0002895033,0.0014094943,0.000108741406,0.001208974,0.0003632622],"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.000040936022,0.0004326314,0.018535335,0.0007709482,0.0013326149,0.00014713616,0.017573014,0.82350045,0.0010347937,0.0047699283,0.0015731547,0.13028903],"study_design_scores_gemma":[0.0017567608,0.0001590101,0.14622192,0.0014865502,0.0005215655,0.0035498147,0.002792423,0.83917964,0.0008185334,0.0022198432,0.00050808967,0.0007858367],"about_ca_topic_score_codex":0.0001474581,"about_ca_topic_score_gemma":0.000032719738,"teacher_disagreement_score":0.2822104,"about_ca_system_score_codex":0.0009789142,"about_ca_system_score_gemma":0.0002743569,"threshold_uncertainty_score":0.9996888},"labels":[],"label_agreement":null},{"id":"W2954585318","doi":"10.5267/j.uscm.2019.5.002","title":"Meta-heuristics algorithm for two-machine no-wait flow-shop scheduling problem with the effects of learning","year":2019,"lang":"en","type":"article","venue":"Uncertain Supply Chain Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Computer science; Flow shop scheduling; Scheduling (production processes); Algorithm; Job shop scheduling; Mathematical optimization; Artificial intelligence; Mathematics; Schedule","score_opus":0.008128796193543364,"score_gpt":0.21430287241530993,"score_spread":0.20617407622176656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954585318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010530339,0.0008873316,0.9931692,0.00020315565,0.00043470593,0.0020221851,0.00001917654,0.0003075807,0.0019036696],"genre_scores_gemma":[0.05459508,0.00014784635,0.93923044,0.00013326314,0.00015107168,0.00054839125,0.00014125803,0.00012872298,0.004923933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844664,0.000072614115,0.00033767574,0.00034008073,0.00037918237,0.0004238134],"domain_scores_gemma":[0.9988233,0.00045327877,0.00011125864,0.00039082687,0.00015043005,0.00007093559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061046984,0.00033874437,0.0004489497,0.00015990033,0.00012983495,0.00006856235,0.0003264372,0.000060495247,0.0001006294],"category_scores_gemma":[0.000034220033,0.00023323717,0.00016175702,0.00036195343,0.00004233396,0.000075115844,0.000078577206,0.00026167728,0.00003599339],"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.000018156425,0.000034191937,0.00008106995,0.0009200853,0.0016004277,0.000006573214,0.00034349476,0.97749084,0.000052641644,0.00061712944,0.00020278634,0.018632626],"study_design_scores_gemma":[0.0016626801,0.00019983132,0.000007673134,0.000118014366,0.00083087274,0.0000016159302,0.00039526704,0.9909664,0.00041068794,0.000065773165,0.005037895,0.0003033375],"about_ca_topic_score_codex":0.000016061293,"about_ca_topic_score_gemma":0.0000045018105,"teacher_disagreement_score":0.053938724,"about_ca_system_score_codex":0.00006708302,"about_ca_system_score_gemma":0.000012990088,"threshold_uncertainty_score":0.9511136},"labels":[],"label_agreement":null},{"id":"W2958544563","doi":"10.1287/ijoc.2018.0854","title":"An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems","year":2019,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Computer science; Branch and bound; Branch and cut; Integer programming","score_opus":0.009286559904105242,"score_gpt":0.2374896438092046,"score_spread":0.22820308390509936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2958544563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10527727,0.00025955835,0.8923922,0.000048800524,0.0010168019,0.00030072176,0.0000051406623,0.00027317894,0.00042630176],"genre_scores_gemma":[0.39379856,0.00007012624,0.60519713,0.00026012055,0.00052665436,0.0000045742295,0.000017184948,0.00006266584,0.00006298772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987137,0.000011417859,0.00050545455,0.00016952264,0.00018795815,0.00041198684],"domain_scores_gemma":[0.99921256,0.00011326519,0.00015731635,0.00016653416,0.00013659199,0.00021370308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005804647,0.00023110108,0.00026798388,0.00017654784,0.00022291484,0.00031913756,0.00021259423,0.000111308414,0.00002004923],"category_scores_gemma":[0.000033505767,0.00019506029,0.000088582536,0.0001623485,0.000014301018,0.00044938654,0.00002658342,0.0005191795,0.000022306132],"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.000008912103,0.000014030806,0.00018814277,0.000040613882,0.00004051198,9.1486964e-7,0.00028149603,0.7877537,0.00015103482,0.00005974307,0.000006070395,0.21145482],"study_design_scores_gemma":[0.0015502382,0.00024125895,0.00015613863,0.00012283014,0.000009590704,0.00011248096,0.000081937935,0.9965247,0.00017352252,0.00019762991,0.0005439014,0.00028576003],"about_ca_topic_score_codex":0.0000029113596,"about_ca_topic_score_gemma":6.101049e-7,"teacher_disagreement_score":0.2885213,"about_ca_system_score_codex":0.000064703214,"about_ca_system_score_gemma":0.000030192492,"threshold_uncertainty_score":0.7954328},"labels":[],"label_agreement":null},{"id":"W2960830416","doi":"10.1016/j.cie.2019.07.037","title":"The cold rolling mill scheduling problem: Some solution methods","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Mathematical optimization; Scheduling (production processes); Job shop scheduling; Rolling mill; Heuristic; Computer science; Mill; Branch and bound; Perturbation (astronomy); Mathematics; Engineering; Mechanical engineering; Schedule","score_opus":0.022150865646062803,"score_gpt":0.23838597743286696,"score_spread":0.21623511178680416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960830416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019674106,0.0012984648,0.96908325,0.00014134933,0.008119625,0.00044493846,0.0000022701752,0.0010962186,0.00013974878],"genre_scores_gemma":[0.093664445,0.00013824139,0.90374094,0.00005577412,0.0020601235,0.00004612406,0.000015220053,0.0001427735,0.00013633312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856025,0.000048516806,0.00041843622,0.0002570218,0.0002062548,0.00050954096],"domain_scores_gemma":[0.9990455,0.00040415223,0.000056915207,0.0003115284,0.00005267726,0.00012926424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007777673,0.00027073506,0.00027149075,0.00014365814,0.00016003993,0.00020882497,0.00033664523,0.00024158249,0.0000081783155],"category_scores_gemma":[0.000080105856,0.00024882238,0.00011248089,0.00040373305,0.000018381577,0.00025261063,0.000073392475,0.0006346452,0.00004936933],"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.0000047246344,0.000004484076,0.000019630557,0.000019885063,0.000067205896,0.0000010553687,0.00006735994,0.97818553,0.00467664,0.00085694797,0.000110377965,0.01598613],"study_design_scores_gemma":[0.00072641147,0.000024256306,0.000006138297,0.00011840196,0.00001780052,0.0000055963687,0.000023720748,0.9848208,0.004763645,0.000025211062,0.009165009,0.00030301427],"about_ca_topic_score_codex":0.000007246715,"about_ca_topic_score_gemma":2.66515e-7,"teacher_disagreement_score":0.073990345,"about_ca_system_score_codex":0.00015780538,"about_ca_system_score_gemma":0.000035664965,"threshold_uncertainty_score":0.9999964},"labels":[],"label_agreement":null},{"id":"W2961884489","doi":"10.1007/s40305-019-00256-x","title":"Online Scheduling with Unit Processing Times and Processing Set Restrictions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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":"China Scholarship Council; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Competitive analysis; Job shop scheduling; Scheduling (production processes); Computer science; Online algorithm; Set (abstract data type); Unit (ring theory); Algorithm; Combinatorics; Mathematical optimization; Mathematics; Schedule; Upper and lower bounds; Operating system","score_opus":0.03202772653976704,"score_gpt":0.3227148121945191,"score_spread":0.29068708565475204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961884489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9751024,0.0013349223,0.020958293,0.0020651403,0.00006767062,0.00017309503,0.000007881519,0.00002466604,0.00026589129],"genre_scores_gemma":[0.8189848,0.00035800267,0.18001541,0.00001690743,0.00010070206,0.0000017186093,0.000002552695,0.000019175299,0.0005007306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896693,0.000060768118,0.00026903622,0.00007697271,0.00046919216,0.00015710549],"domain_scores_gemma":[0.99907815,0.000047865353,0.000056948276,0.00012657765,0.00062670826,0.00006375982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067330623,0.00008211916,0.00014811725,0.00009868525,0.00037998814,0.0001493915,0.0001993248,0.000056508285,0.000021126036],"category_scores_gemma":[0.000076903634,0.00005223415,0.00006230921,0.0007275138,0.000118815144,0.00039577018,0.00003990643,0.0006500147,9.960132e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067282463,0.00004201937,0.0009957284,0.00012189285,0.000041982046,2.619964e-7,0.0020495586,0.9932585,0.0013787656,0.000022906508,0.00016438996,0.0019173141],"study_design_scores_gemma":[0.00041269275,0.00007610949,0.00315847,0.00042812366,0.000017169088,0.00004262972,0.0030906755,0.99168915,0.0008274753,0.000038898022,0.00014921355,0.00006937918],"about_ca_topic_score_codex":0.000011552262,"about_ca_topic_score_gemma":0.000006404933,"teacher_disagreement_score":0.15905711,"about_ca_system_score_codex":0.00004500405,"about_ca_system_score_gemma":0.00029185074,"threshold_uncertainty_score":0.29226},"labels":[],"label_agreement":null},{"id":"W2963222815","doi":"10.1007/978-3-319-94776-1_18","title":"Approximation Algorithms for Two-Machine Flow-Shop Scheduling with a Conflict Graph","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","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":"University of Alberta","funders":"","keywords":"Computer science; Vertex cover; Combinatorics; Time complexity; Disjoint sets; Job shop scheduling; Flow shop scheduling; Approximation algorithm; Discrete mathematics; Algorithm; Mathematics; Schedule","score_opus":0.017992132275439356,"score_gpt":0.2452845668499694,"score_spread":0.22729243457453005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963222815","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008143626,0.0004884193,0.9964793,0.00006592873,0.0011974358,0.0005591819,0.000025704901,0.0003780771,0.000724555],"genre_scores_gemma":[0.0045997878,0.000028179076,0.9940843,0.00020557771,0.00079578644,0.00003202497,0.00006972668,0.00009293178,0.000091664886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795353,0.000008438634,0.00037626934,0.00072299794,0.0004789284,0.00045980525],"domain_scores_gemma":[0.9987378,0.00020309415,0.00011441285,0.00049743155,0.00031751874,0.00012972181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004760012,0.00047166253,0.0004181878,0.0006049767,0.00019240235,0.00025126233,0.00058009324,0.0002399685,0.000040612074],"category_scores_gemma":[0.000048246387,0.00041040836,0.000089601366,0.00040873096,0.00036997386,0.00021947507,0.000082986975,0.0004607044,0.0000152256625],"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.000009016434,0.0000065513495,0.000003221107,0.00005848017,0.0000216125,0.0000036408,0.00043388145,0.8880228,0.000025604986,0.00019873274,0.000003802395,0.1112127],"study_design_scores_gemma":[0.00065484294,0.00012489663,0.0000015067349,0.00033830255,0.00002232124,0.000027846778,6.0696453e-7,0.99246264,0.0012201159,0.004390599,0.000227503,0.00052882434],"about_ca_topic_score_codex":0.0000042920856,"about_ca_topic_score_gemma":0.000025487023,"teacher_disagreement_score":0.11068387,"about_ca_system_score_codex":0.00013671357,"about_ca_system_score_gemma":0.0001162611,"threshold_uncertainty_score":0.9998348},"labels":[],"label_agreement":null},{"id":"W2963347283","doi":"10.1007/s10951-019-00622-w","title":"Single-machine scheduling with job-dependent machine deterioration","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Ningbo; China Scholarship Council","keywords":"Computer science; Single-machine scheduling; Job shop scheduling; Scheduling (production processes); Schedule; Mathematical optimization; Algorithm; Mathematics; Operating system","score_opus":0.010145540476667771,"score_gpt":0.2135125582657752,"score_spread":0.20336701778910743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963347283","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73388445,0.0017150203,0.2625454,0.00011770137,0.0009071461,0.00011410394,0.0000030705544,0.00012498423,0.00058815174],"genre_scores_gemma":[0.7101382,0.00007824334,0.28934863,0.0000547302,0.00025760205,0.0000012562086,0.0000043784034,0.00005849497,0.000058461144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998266,0.000038322276,0.0006915241,0.00017496584,0.000527676,0.0003015137],"domain_scores_gemma":[0.99892384,0.0000712533,0.0003065846,0.00021962452,0.00030056227,0.0001781659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005445744,0.00026319138,0.00040802834,0.00032044534,0.000078740064,0.00017218973,0.0002480922,0.00012459497,0.00015128974],"category_scores_gemma":[0.000068116824,0.00021579867,0.00011598421,0.00032795192,0.000023678793,0.0006027854,0.000026816679,0.00060292624,0.000061032784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059938622,0.00004037207,0.0059275324,0.00006158507,0.000107860236,0.000025122568,0.00022500756,0.9618037,0.02703229,0.00003269558,0.0000024600304,0.0046814554],"study_design_scores_gemma":[0.0021702382,0.0004253858,0.0006126277,0.0004151856,0.00008932149,0.00044989362,0.00042728265,0.980018,0.014773866,0.00004842905,0.0001438374,0.00042588814],"about_ca_topic_score_codex":0.000004202799,"about_ca_topic_score_gemma":0.00000830878,"teacher_disagreement_score":0.026803246,"about_ca_system_score_codex":0.00014358088,"about_ca_system_score_gemma":0.000058471243,"threshold_uncertainty_score":0.8800014},"labels":[],"label_agreement":null},{"id":"W2966197267","doi":"10.1109/rams.2019.8768908","title":"Energy-efficient optimization of Flexible Job Shop Scheduling and Preventive Maintenance","year":2019,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Job shop scheduling; Scheduling (production processes); Preventive maintenance; Computer science; Energy consumption; Operations research; Mathematical optimization; Reliability engineering; Engineering; Embedded system; Mathematics","score_opus":0.006101823798228012,"score_gpt":0.20315763119133579,"score_spread":0.19705580739310777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966197267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06616956,0.0003207485,0.9208725,0.0000157924,0.00026606963,0.000079678815,0.0000019692982,0.0001689709,0.012104692],"genre_scores_gemma":[0.70379376,0.00007673569,0.29343984,0.000017969129,0.00001864623,0.0000058999135,0.000005678747,0.000019535928,0.0026219361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994623,0.000009600971,0.0001673385,0.00013214405,0.000096668315,0.00013192238],"domain_scores_gemma":[0.9997096,0.000026598906,0.000028431905,0.00012299964,0.00007042609,0.00004196405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008629434,0.000089643676,0.00012115055,0.00007786689,0.000018892917,0.0000172066,0.000055313423,0.000050781135,0.00026586995],"category_scores_gemma":[0.000010296114,0.00008433556,0.000026584832,0.00018280202,0.000017628528,0.000061779174,0.000021229685,0.000047941085,0.000009197104],"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.000003616906,0.000010269062,0.00027879898,0.000022196766,0.000017683242,1.9557974e-7,0.00010811851,0.9947827,0.00013920853,0.0034894866,0.000016367203,0.001131373],"study_design_scores_gemma":[0.0002700464,0.000016523985,0.000100317884,0.000044671076,0.0000068947998,0.000001817787,0.0002543907,0.99539423,0.0037631488,0.000020952193,0.000023312428,0.000103694845],"about_ca_topic_score_codex":0.000006222116,"about_ca_topic_score_gemma":4.6281576e-7,"teacher_disagreement_score":0.6376242,"about_ca_system_score_codex":0.000018619781,"about_ca_system_score_gemma":0.000009243003,"threshold_uncertainty_score":0.34391043},"labels":[],"label_agreement":null},{"id":"W2968482180","doi":"10.1016/j.cie.2019.07.048","title":"Minimizing the makespan in a flow shop environment under minimum and maximum time-lag constraints","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Saskatchewan","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Tabu search; Greedy algorithm; Integer programming; Computer science; Linear programming; Flow shop scheduling; Constraint (computer-aided design); Scheduling (production processes); Mathematics; Schedule","score_opus":0.013040669507570827,"score_gpt":0.1787178682763697,"score_spread":0.16567719876879888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968482180","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7096192,0.00054250774,0.28353003,0.00048254206,0.00370626,0.00092604174,0.000016035345,0.00061511685,0.0005622756],"genre_scores_gemma":[0.9531735,0.00004714078,0.04591763,0.00010057593,0.00051098195,0.000023742068,0.000022609554,0.0000964852,0.00010734072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896353,0.000022464425,0.00028538876,0.00023839631,0.00015374446,0.00033645713],"domain_scores_gemma":[0.99946284,0.00018585933,0.000026522566,0.00022157928,0.000007059869,0.00009610916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021142718,0.00023390986,0.00024466263,0.00014389641,0.000032902833,0.00008557844,0.00017418522,0.00017748433,0.00009547335],"category_scores_gemma":[0.000017452909,0.00022014798,0.000046748464,0.00017658036,0.000041793894,0.000089975976,0.00006875587,0.00040855244,0.00006410279],"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.000005065454,0.000007721536,0.00014150892,0.0000113252545,0.000035388788,0.0000055921437,0.00021226787,0.9844658,0.000481924,0.00002772425,0.0000940437,0.014511682],"study_design_scores_gemma":[0.0012163706,0.000021484,0.00022359514,0.00009815126,0.000010956158,0.000016979324,0.00012510286,0.9970885,0.00020698909,0.0000070026595,0.00072927255,0.00025561513],"about_ca_topic_score_codex":0.0000020820037,"about_ca_topic_score_gemma":1.881797e-7,"teacher_disagreement_score":0.2435543,"about_ca_system_score_codex":0.00010055873,"about_ca_system_score_gemma":0.000014816421,"threshold_uncertainty_score":0.8977374},"labels":[],"label_agreement":null},{"id":"W2973573957","doi":"10.1109/radar.2019.8835636","title":"A Radar Task Scheduling Method Using Random Shifted Start Time with the EST Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Monte Carlo method; Computer science; Algorithm; Scheduling (production processes); Radar; Monte Carlo algorithm; Mathematical optimization; Mathematics; Statistics","score_opus":0.00796717946112787,"score_gpt":0.22333083340543733,"score_spread":0.21536365394430945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973573957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02213005,0.00018015222,0.9732067,0.00017794297,0.00020236793,0.00033257314,0.0000068376444,0.00055755954,0.003205847],"genre_scores_gemma":[0.011306514,0.000008149564,0.9875054,0.00020075259,0.00010684326,0.000008843276,0.000016521206,0.000071728995,0.0007752964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892026,0.000064673186,0.00020768087,0.00023335435,0.00026153744,0.00031251935],"domain_scores_gemma":[0.99926174,0.00019983381,0.000039739705,0.0003364391,0.00007634529,0.00008588642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046821265,0.00022378952,0.0002715828,0.00008655215,0.0001101189,0.00011450507,0.00018700428,0.000087111825,0.00066088105],"category_scores_gemma":[0.000016541575,0.00014344491,0.000065124514,0.000416058,0.000027200727,0.00016840528,0.000027622458,0.00024910705,0.00024027524],"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.000026800228,0.00001150113,0.000024042885,0.000010371098,0.00011721722,0.000003892525,0.00028581204,0.9915506,0.0015756713,0.0000525929,0.000065480584,0.006276003],"study_design_scores_gemma":[0.001752457,0.000025489817,0.000010141003,0.000029619876,0.000045404948,0.00002301121,0.00029030035,0.99491113,0.0018744693,0.000024005312,0.0007601752,0.00025378878],"about_ca_topic_score_codex":0.000035000525,"about_ca_topic_score_gemma":0.000002601629,"teacher_disagreement_score":0.01429868,"about_ca_system_score_codex":0.00004768605,"about_ca_system_score_gemma":0.000043478954,"threshold_uncertainty_score":0.7236184},"labels":[],"label_agreement":null},{"id":"W2973716314","doi":"10.1287/stsy.2019.0041","title":"Open Problem—Size-Based Scheduling with Estimation Errors","year":2019,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Scheduling (production processes); Estimation; Real-time computing; Mathematical optimization; Mathematics; Engineering; Systems engineering","score_opus":0.010279043420449534,"score_gpt":0.22560371918535574,"score_spread":0.21532467576490621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973716314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02847543,0.00012031529,0.96602666,0.00004042823,0.00080919743,0.0011105008,0.000006565723,0.00046121833,0.0029496946],"genre_scores_gemma":[0.8388515,2.577974e-7,0.16062397,0.000017956521,0.000056513454,0.00012770818,0.000020270763,0.000054890654,0.0002469262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.000022986185,0.00025977433,0.00023060034,0.00023674949,0.00023886508],"domain_scores_gemma":[0.9993418,0.0001220696,0.000069394635,0.00029141686,0.000085492364,0.00008984459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023979948,0.00018151959,0.00024805282,0.000081995524,0.000061914965,0.00022447547,0.00028103,0.000078279365,0.00005890387],"category_scores_gemma":[0.00004417077,0.00015719823,0.000024408671,0.00028178518,0.0000172651,0.00018901237,0.000025687592,0.00012297409,0.0002721815],"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.000013948866,0.000009782052,0.00007999488,0.00013808603,0.00002713394,0.0000011180072,0.000114999086,0.99891335,0.000052625663,0.00036883933,0.000020444442,0.00025969517],"study_design_scores_gemma":[0.0009917652,0.000067272216,0.000035052777,0.00046988108,0.000018600436,0.000011639757,0.00025850907,0.9978123,0.00005128171,0.000021418984,0.000026912501,0.00023540223],"about_ca_topic_score_codex":0.00005795108,"about_ca_topic_score_gemma":0.000003185516,"teacher_disagreement_score":0.81037605,"about_ca_system_score_codex":0.00008067354,"about_ca_system_score_gemma":0.00007203866,"threshold_uncertainty_score":0.64103574},"labels":[],"label_agreement":null},{"id":"W2974941647","doi":"","title":"XML-based Message Services for Internet-enabled, Agent-based, Intelligent Shop Floors","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; The Internet; XML; World Wide Web; Computer security; Database; Computer network","score_opus":0.012940646390193267,"score_gpt":0.2327039487511988,"score_spread":0.21976330236100552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974941647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021562934,0.00031392716,0.96998835,0.0006400682,0.00063794525,0.00033828526,0.000025566074,0.0007373419,0.0057555935],"genre_scores_gemma":[0.6933692,0.000020526299,0.30439055,0.0007326427,0.0002665663,0.00010420984,0.000099194964,0.000070454524,0.0009466454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990389,0.000015625857,0.00026027378,0.00021368111,0.00016478954,0.00030672588],"domain_scores_gemma":[0.9994745,0.00007274918,0.000033763532,0.0002269966,0.00007055094,0.00012142955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016469423,0.0001936748,0.00016990738,0.00012583961,0.000049089485,0.00008031262,0.00023999941,0.00009903128,0.0010303434],"category_scores_gemma":[0.000016652193,0.00019359367,0.00010599536,0.00015789646,0.000018952416,0.000095319345,0.000016389156,0.00012247136,0.00018140324],"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.000025455362,0.000049516162,0.00008708266,0.0001581541,0.000036067227,0.0000022096726,0.00018603148,0.96750695,0.00056778797,0.00021668576,0.001561637,0.029602401],"study_design_scores_gemma":[0.00058314664,0.000027813117,0.00000795249,0.00005898788,0.000023315291,7.016549e-7,0.00008764257,0.91948676,0.04667599,0.000049435857,0.03278872,0.00020956097],"about_ca_topic_score_codex":0.000005347232,"about_ca_topic_score_gemma":0.000026585267,"teacher_disagreement_score":0.6718063,"about_ca_system_score_codex":0.00009289319,"about_ca_system_score_gemma":0.00002336146,"threshold_uncertainty_score":0.9998829},"labels":[],"label_agreement":null},{"id":"W2981143387","doi":"10.1007/s10589-019-00142-5","title":"Heuristics for the single machine weighted sum of completion times scheduling problem with periodic maintenance","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Integer programming; Computer science; Heuristic; Mathematics; Algorithm; Schedule","score_opus":0.008094846714795557,"score_gpt":0.20937194582739083,"score_spread":0.20127709911259528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981143387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066737615,0.00031671344,0.99726635,0.00032171872,0.000037234357,0.00077068043,0.00006224282,0.00011596126,0.00044169708],"genre_scores_gemma":[0.31154668,0.000051050323,0.68764937,0.000059625094,0.00003346069,0.00014590341,0.00039972184,0.00002368496,0.00009052303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938047,0.000009584806,0.00023266766,0.00014920389,0.00012526508,0.000102787184],"domain_scores_gemma":[0.99924415,0.00021621045,0.00008699811,0.0001159588,0.00029966736,0.00003702577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000081523685,0.000109620145,0.00012975345,0.00006260558,0.00015082826,0.00004907751,0.00008572318,0.00003768235,0.00004658291],"category_scores_gemma":[0.0000074813775,0.00008548176,0.000026359501,0.0002616848,0.00007043713,0.00006785535,0.000012016376,0.00006311785,0.0000050113686],"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.000008918144,0.000030146206,0.0001630048,0.00005628304,0.000026953112,2.215138e-8,0.000054683445,0.986798,0.000030708983,0.011590249,0.000035961933,0.0012050591],"study_design_scores_gemma":[0.0005520227,0.000035736255,0.00016911601,0.000027405082,0.000026753683,0.0000048040424,0.00007079914,0.9972242,0.00005595232,0.0005688651,0.0011524648,0.00011185337],"about_ca_topic_score_codex":0.0000013356027,"about_ca_topic_score_gemma":7.9469794e-7,"teacher_disagreement_score":0.31087932,"about_ca_system_score_codex":0.000021292737,"about_ca_system_score_gemma":0.000024535624,"threshold_uncertainty_score":0.3485845},"labels":[],"label_agreement":null},{"id":"W2981427367","doi":"10.1007/s10951-019-00627-5","title":"Evaluating periodic rescheduling policies using a rolling horizon framework in an industrial-scale multipurpose plant","year":2019,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Scale (ratio); Horizon; Computer science; Operations research; Time horizon; Operations management; Industrial engineering; Mathematical optimization; Business; Engineering; Mathematics; Geography; Cartography","score_opus":0.07007471513145623,"score_gpt":0.3256633989004481,"score_spread":0.25558868376899185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981427367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.961537,0.0013356437,0.035063412,0.000040793417,0.0016545977,0.00022513694,0.0000049690348,0.00009936257,0.000039083967],"genre_scores_gemma":[0.6002976,0.000071920804,0.39882275,0.000024688075,0.00071758055,0.0000018240006,0.0000031445966,0.000057675992,0.0000028556965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971533,0.00015180775,0.0012556901,0.00026160057,0.00063644315,0.00054115703],"domain_scores_gemma":[0.99850744,0.0002761762,0.0004308012,0.00029009668,0.00024865617,0.000246815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001954753,0.00032341553,0.00064993236,0.0007412649,0.00013411754,0.00026947403,0.00037464168,0.0003956217,0.000055115917],"category_scores_gemma":[0.00049222313,0.00032371833,0.00016751116,0.00074198714,0.000035054913,0.0008066178,0.000047816207,0.0015625338,0.000012374999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008261056,0.000046441935,0.018922685,0.000044324657,0.00003874133,0.000019780646,0.002357071,0.95197743,0.022082385,0.000023778515,5.388218e-7,0.004404187],"study_design_scores_gemma":[0.0015295945,0.00029039185,0.00038296657,0.0014395312,0.000049283473,0.00010056882,0.004276461,0.9864532,0.0049957223,0.000099978926,0.000012890217,0.00036945267],"about_ca_topic_score_codex":0.000024977679,"about_ca_topic_score_gemma":0.0000077455525,"teacher_disagreement_score":0.36375934,"about_ca_system_score_codex":0.00029268232,"about_ca_system_score_gemma":0.00019325834,"threshold_uncertainty_score":0.9999215},"labels":[],"label_agreement":null},{"id":"W2984529625","doi":"10.2139/ssrn.3400186","title":"Digital Operations: Framework and Future Directions","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Business","score_opus":0.002715022615324622,"score_gpt":0.1988013783692377,"score_spread":0.1960863557539131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984529625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43409207,0.05009852,0.48960075,0.0023311735,0.0045830607,0.00032514666,0.000012480815,0.00081158127,0.018145217],"genre_scores_gemma":[0.9429049,0.037186194,0.014976759,0.00008328733,0.0017321865,0.000006408789,0.000010772975,0.000058830432,0.0030406935],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.000007242273,0.00010680722,0.00007581518,0.0000808281,0.0005347452],"domain_scores_gemma":[0.999816,0.000017432612,0.000009966191,0.000075761985,0.0000316564,0.00004916245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013211988,0.00008049932,0.00007520375,0.00006285249,0.000102666665,0.00016369502,0.00005944739,0.00006873082,0.000046878606],"category_scores_gemma":[0.000015281152,0.00007366737,0.000030391275,0.00013645594,0.000008521353,0.00025260053,0.0000067549145,0.0009431538,0.00005978614],"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.000015694533,0.000060084236,0.004032375,0.000019896448,0.0004604858,0.0000024547528,0.0009048481,0.19639836,0.0000748419,0.25964525,0.00013912305,0.5382466],"study_design_scores_gemma":[0.0025855103,0.0006061732,0.0019106176,0.00015584155,0.000119592,0.0033333045,0.020140769,0.6430292,0.000118577154,0.18519701,0.1410771,0.0017263002],"about_ca_topic_score_codex":9.601121e-7,"about_ca_topic_score_gemma":0.00001107274,"teacher_disagreement_score":0.53652024,"about_ca_system_score_codex":0.00016355113,"about_ca_system_score_gemma":0.000119060336,"threshold_uncertainty_score":0.40975863},"labels":[],"label_agreement":null},{"id":"W2990065175","doi":"10.1016/j.apm.2019.11.047","title":"Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems","year":2019,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer programming; Scheduling (production processes); Variety (cybernetics); Computer science; Linear programming; Industrial engineering; Schedule; Operations research; Production schedule; Workflow; Distributed computing; Engineering; Mathematical optimization; Operations management; Algorithm","score_opus":0.01586209214391236,"score_gpt":0.20230271016397844,"score_spread":0.1864406180200661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990065175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0972605,0.000068834364,0.9006778,0.00002989936,0.00017168562,0.00092054735,0.000001897314,0.0005461761,0.00032267213],"genre_scores_gemma":[0.45836657,0.000022760285,0.5412016,0.000010991092,0.000053038308,0.00010773563,0.00003067535,0.000075619704,0.00013101094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981215,0.000024594456,0.0006036146,0.00046731677,0.00034750949,0.00043547293],"domain_scores_gemma":[0.99924994,0.000074762334,0.00010551981,0.00036315128,0.00007498957,0.000131652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032542142,0.0003113247,0.00042640956,0.00017795815,0.000085936066,0.00015822652,0.00019866508,0.00020729548,0.0000901298],"category_scores_gemma":[0.000030404888,0.00025980177,0.000041668063,0.0006861382,0.00004072309,0.00019490761,0.000031177282,0.00035483102,0.00013677993],"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.00012072355,0.00010779089,0.00006885905,0.0006309056,0.00004016801,0.0000024235178,0.0011264735,0.99760044,0.00006872896,0.00018442914,0.000005058914,0.000043987107],"study_design_scores_gemma":[0.0009877,0.000014882045,0.0000058021333,0.0010608013,0.000024458746,0.000005376186,0.000635855,0.99678326,0.0000872067,0.000040337694,0.000004311289,0.00035003354],"about_ca_topic_score_codex":0.000005103249,"about_ca_topic_score_gemma":8.091322e-7,"teacher_disagreement_score":0.3611061,"about_ca_system_score_codex":0.00011975712,"about_ca_system_score_gemma":0.000024156847,"threshold_uncertainty_score":0.9999854},"labels":[],"label_agreement":null},{"id":"W2991596532","doi":"10.1016/j.compchemeng.2019.106658","title":"Proactive and reactive scheduling of the steelmaking and continuous casting process through adaptive robust optimization","year":2019,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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 Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Computer science; Schedule; Unexpected events; Dynamic priority scheduling; Engineering; Mathematical optimization; Real-time computing; Reliability engineering; Operations management; Mathematics","score_opus":0.008739338066297156,"score_gpt":0.1886137921758688,"score_spread":0.17987445410957165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991596532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4085437,0.00021732277,0.5904519,0.0000115543535,0.00021510031,0.00021762573,0.0000021078588,0.0001454827,0.00019521051],"genre_scores_gemma":[0.7275848,0.0000071132395,0.27231383,0.000008665282,0.00004343369,0.000006886139,0.000002176901,0.00002989709,0.0000031784564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923956,0.000008562418,0.00020720046,0.00022538647,0.00012813283,0.00019117875],"domain_scores_gemma":[0.99955934,0.00012890052,0.000064934036,0.00012093101,0.00007939416,0.000046480232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066490975,0.00018279435,0.00023730712,0.000042386924,0.000034458233,0.000034550714,0.000105104366,0.00009179186,0.0000018425375],"category_scores_gemma":[0.000056933575,0.0001655604,0.000032351287,0.0002232231,0.000038717666,0.00021651674,0.00007417957,0.00025836524,3.1334284e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006458087,0.000006408395,0.00016306431,0.00011390971,0.000052796368,5.854979e-7,0.001173994,0.9925129,0.005130099,0.00014913877,5.4238075e-7,0.0006901493],"study_design_scores_gemma":[0.00034477407,0.000013503378,0.00007877135,0.00029809895,0.00002143362,0.00001961219,0.0003291593,0.96509993,0.033604715,0.000007616822,0.0000022938373,0.00018006493],"about_ca_topic_score_codex":0.0000029205385,"about_ca_topic_score_gemma":4.4892893e-8,"teacher_disagreement_score":0.3190411,"about_ca_system_score_codex":0.000047896367,"about_ca_system_score_gemma":0.000011937483,"threshold_uncertainty_score":0.6751357},"labels":[],"label_agreement":null},{"id":"W2994826758","doi":"10.1016/j.jmsy.2019.11.010","title":"Mathematical modeling and a hybridized bacterial foraging optimization algorithm for the flexible job-shop scheduling problem with sequencing flexibility","year":2019,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":79,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; Ontario Centres of Excellence","keywords":"Job shop scheduling; Tardiness; Simulated annealing; Mathematical optimization; Job shop; Scheduling (production processes); Integer programming; Computer science; Algorithm; Flow shop scheduling; Schedule; Mathematics","score_opus":0.01927759036749453,"score_gpt":0.23029027040822886,"score_spread":0.21101268004073434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2994826758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22864844,0.0003443871,0.7697375,0.00003485902,0.000492571,0.0005512485,0.0000039176616,0.00010122799,0.000085871434],"genre_scores_gemma":[0.45852965,0.00003794994,0.5408359,0.000007872381,0.00041879574,0.000023582397,0.0000033865435,0.00006442406,0.00007842078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835426,0.000047321704,0.00075076555,0.00019904367,0.00034225074,0.00030635434],"domain_scores_gemma":[0.99892414,0.00026987807,0.00026676676,0.00022569195,0.00020604915,0.00010745456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174799,0.00024299446,0.00046652486,0.000148358,0.000159984,0.0003528275,0.00019402563,0.000093209535,0.00002510099],"category_scores_gemma":[0.000038625592,0.0001615609,0.00009901157,0.00008823645,0.000023673774,0.0004385504,0.000029602077,0.00029767922,0.000003421019],"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.000058216574,0.0000072192474,0.000011613394,0.00040723477,0.00013346034,0.0000023896007,0.00028202016,0.9968807,0.000112406866,0.000023059858,0.00000265154,0.0020789972],"study_design_scores_gemma":[0.0013952076,0.00009313574,0.0000017735586,0.000620919,0.000090160385,0.0003186097,0.00090358657,0.99336255,0.0028973257,0.000079971214,0.00002737949,0.00020941306],"about_ca_topic_score_codex":0.0000051198654,"about_ca_topic_score_gemma":3.4119088e-7,"teacher_disagreement_score":0.22988123,"about_ca_system_score_codex":0.00018164472,"about_ca_system_score_gemma":0.00007169925,"threshold_uncertainty_score":0.65882623},"labels":[],"label_agreement":null},{"id":"W2996974428","doi":"10.1155/2019/3176074","title":"The Lagrangean Relaxation for the Flow Shop Scheduling Problem with Precedence Constraints, Release Dates and Delivery Times","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Ministerio de Economía y Competitividad; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Generalitat de Catalunya; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Scheduling (production processes); Truck; Automotive industry; Computer science; Relaxation (psychology); Mathematical optimization; Job shop scheduling; Integer programming; Flow shop scheduling; Product (mathematics); Operations research; Mathematics; Algorithm; Engineering; Schedule","score_opus":0.0055822907492389835,"score_gpt":0.2036588486147136,"score_spread":0.1980765578654746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996974428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57289034,0.0024166522,0.42327163,0.00042750585,0.00034899282,0.00052270957,0.000016071945,0.000052420408,0.000053693282],"genre_scores_gemma":[0.7667418,0.001236886,0.2318927,0.000014169841,0.000048661288,0.000009642302,0.0000149499165,0.000016454682,0.000024738718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994155,0.000010253983,0.00026035385,0.00007217114,0.00014176588,0.00009993066],"domain_scores_gemma":[0.9992005,0.00030281703,0.0001597312,0.00007294331,0.00022862133,0.000035339912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023085266,0.00008578739,0.00009766528,0.000032871238,0.00011969259,0.000047710866,0.00007530723,0.000032482883,0.0000063968105],"category_scores_gemma":[0.000027916454,0.000049415703,0.000034098826,0.0000958808,0.000045125078,0.00037533126,6.8685995e-7,0.00013917453,7.9982914e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012437165,0.0000048638162,0.00050652976,0.000040231393,0.000045765417,7.1815464e-7,0.0006451385,0.96162945,0.00056019303,0.00017821975,0.000005516691,0.036259007],"study_design_scores_gemma":[0.0027091855,0.0003342545,0.012137092,0.00046838453,0.00021164039,0.000033139324,0.0053664832,0.97426856,0.003011771,0.00050612964,0.000698429,0.00025495954],"about_ca_topic_score_codex":7.110637e-7,"about_ca_topic_score_gemma":0.00001935955,"teacher_disagreement_score":0.19385147,"about_ca_system_score_codex":0.000015558962,"about_ca_system_score_gemma":0.00002834721,"threshold_uncertainty_score":0.2015114},"labels":[],"label_agreement":null},{"id":"W2997174909","doi":"10.1016/j.ifacol.2019.11.632","title":"On the impact of the number of operators in a flow shop environment","year":2019,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Operator (biology); Task (project management); Scheduling (production processes); Computer science; Quality (philosophy); Sequence (biology); Flow (mathematics); Flow shop scheduling; Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Engineering","score_opus":0.006042849277933837,"score_gpt":0.22209569513907507,"score_spread":0.21605284586114124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997174909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981439,0.000045818746,0.00021154068,0.00013884253,0.00011606502,0.00015119594,0.0000296262,0.000016547941,0.0011464776],"genre_scores_gemma":[0.9659627,0.000033399876,0.033724047,0.00003978549,0.000024132629,0.0000048341994,0.000005319922,0.000019497294,0.00018625152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945664,0.000026837242,0.00016931818,0.00008782757,0.00014371438,0.00011566644],"domain_scores_gemma":[0.9995898,0.00007634077,0.000029017203,0.00027236505,0.000009828743,0.000022620232],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00011114003,0.00010423125,0.00013980204,0.000023955841,0.000013491088,0.0000053158874,0.00015644408,0.000050674043,0.001121831],"category_scores_gemma":[0.000027746464,0.000055402164,0.00009499192,0.00014312973,0.000026833475,0.000025936984,0.000020988233,0.00013884155,0.0000656828],"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.000007716959,0.000043832166,0.0116947265,0.00000805603,0.000029189096,2.8402908e-7,0.00045239067,0.98534685,0.0018190113,0.00005105102,0.0000038807516,0.00054303615],"study_design_scores_gemma":[0.00042480553,0.000032040167,0.012127912,0.000055168803,0.000006398562,0.0000016247699,0.00022418542,0.9840529,0.0029554006,0.00001523499,0.000009619304,0.00009473864],"about_ca_topic_score_codex":0.000030481502,"about_ca_topic_score_gemma":0.0000030177907,"teacher_disagreement_score":0.033512507,"about_ca_system_score_codex":0.00005314175,"about_ca_system_score_gemma":0.00001521991,"threshold_uncertainty_score":0.99979126},"labels":[],"label_agreement":null},{"id":"W2997691364","doi":"10.2316/j.2019.203-0127","title":"OPTIMIZATION OF DISTRIBUTION NETWORKS WITH INTEGRATION OF DISTRIBUTED GENERATORS USING COOPERATIVE GAME THEORY","year":2019,"lang":"en","type":"article","venue":"International Journal of Power and Energy Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Game theory; Computer science; Distribution (mathematics); Cooperative game theory; Mathematical economics; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.005032339326646893,"score_gpt":0.20478833891322104,"score_spread":0.19975599958657414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997691364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13288942,0.00051330676,0.86541253,0.0000054692528,0.0010292799,0.00002496948,0.00004117847,0.000008879832,0.00007493803],"genre_scores_gemma":[0.9960999,0.00012250374,0.003546693,0.000004432052,0.000097103424,8.4676617e-7,0.00010140942,0.000011878688,0.000015255389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991581,0.000053726675,0.0004287879,0.000062611136,0.00023134553,0.000065426866],"domain_scores_gemma":[0.9987749,0.00004606839,0.00027920294,0.000055704688,0.00080643495,0.000037679696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019823766,0.000094311705,0.00020313344,0.00009953322,0.000011501048,0.000033841705,0.00009063956,0.00006266857,0.000015234492],"category_scores_gemma":[0.00002202399,0.000072443785,0.00003901915,0.00013061005,0.000031512718,0.00019654345,0.000009183499,0.00007206259,9.961956e-8],"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.00008002026,0.00001800572,0.0005096515,0.00000781033,0.00018432771,0.0000017768402,0.00014838704,0.9959284,0.00057707913,0.0022255848,0.000013471138,0.00030549467],"study_design_scores_gemma":[0.0005032059,0.00009986901,0.00014834438,0.00022665429,0.000024038662,0.00006102484,0.0003907253,0.9961395,0.0022706124,0.000007966149,0.00005179864,0.00007622708],"about_ca_topic_score_codex":0.000018159735,"about_ca_topic_score_gemma":9.540803e-7,"teacher_disagreement_score":0.86321044,"about_ca_system_score_codex":0.00006423431,"about_ca_system_score_gemma":0.000029060227,"threshold_uncertainty_score":0.2954172},"labels":[],"label_agreement":null},{"id":"W2997791715","doi":"10.1016/j.ifacol.2019.11.585","title":"An Efficient Two-Stage Genetic Algorithm for Flexible Job-Shop Scheduling","year":2019,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematical optimization; Job shop scheduling; Population; Computer science; Genetic algorithm; Coding (social sciences); Benchmark (surveying); Scheduling (production processes); Greedy algorithm; Single-machine scheduling; Algorithm; Mathematics; Schedule","score_opus":0.01132974474597966,"score_gpt":0.259915158024321,"score_spread":0.24858541327834136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997791715","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31070822,0.00058216095,0.68529207,0.00006570983,0.0011472803,0.0005030184,0.00012026635,0.00097160885,0.0006096768],"genre_scores_gemma":[0.01772,0.000039202107,0.9797328,0.00015987593,0.0005629175,0.000045214347,0.00015772457,0.00012628411,0.0014559791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835056,0.000022995586,0.00036105525,0.00044839407,0.0002719118,0.0005450671],"domain_scores_gemma":[0.9990339,0.00007944546,0.000053944907,0.0004842388,0.00012290772,0.00022555256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021688976,0.00032085204,0.00032287935,0.00016364861,0.00011768775,0.00010646975,0.00029448562,0.00014780162,0.00034283957],"category_scores_gemma":[0.000025284931,0.0003279231,0.00013480139,0.00031155892,0.000029849845,0.00011418848,0.000026797194,0.00022615942,0.00024101618],"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.000008538172,0.000073356474,0.00014252352,0.000054128082,0.0000397653,0.0000034380128,0.00022561385,0.9707511,0.0030442479,0.000061930354,0.0000010372385,0.025594294],"study_design_scores_gemma":[0.0015578411,0.00013416073,0.000117404954,0.000040009596,0.000030449495,0.000007804756,0.00045053122,0.9937747,0.0031629798,0.000008106214,0.00028003327,0.0004359522],"about_ca_topic_score_codex":0.000013824518,"about_ca_topic_score_gemma":0.000004305007,"teacher_disagreement_score":0.29444075,"about_ca_system_score_codex":0.00008693151,"about_ca_system_score_gemma":0.000045465204,"threshold_uncertainty_score":0.99991727},"labels":[],"label_agreement":null},{"id":"W2997928186","doi":"10.1155/2020/7069291","title":"Production Scheduling considering Outsourcing Options and Carrier Costs","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Myongji University","keywords":"Outsourcing; Heuristics; Tardiness; Computer science; Scheduling (production processes); Profit (economics); Job shop scheduling; Operations research; Total cost; Holding cost; Mathematical optimization; Business; Economics; Microeconomics; Mathematics; Operating system; Schedule","score_opus":0.012615562035666194,"score_gpt":0.23007664113440987,"score_spread":0.21746107909874368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997928186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78238046,0.0008872128,0.21556096,0.00050478405,0.0004904625,0.00006999586,0.0000039341644,0.00008112568,0.000021054711],"genre_scores_gemma":[0.8058207,0.00030463893,0.19363321,0.000039482202,0.00017651777,0.0000013063807,0.0000052277974,0.000016832688,0.0000020732555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993686,0.000008676732,0.00032730383,0.00008290231,0.00012570659,0.00008683062],"domain_scores_gemma":[0.99960154,0.000019584539,0.00010155123,0.000036891062,0.00013300311,0.000107451946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008351608,0.00008461647,0.00013867966,0.000068392925,0.00005148072,0.000020588303,0.00003091941,0.000035988898,0.000006531817],"category_scores_gemma":[0.000066238434,0.00008859985,0.000037724043,0.00015473846,0.000015821199,0.0003945771,7.738165e-7,0.00017910112,7.1427365e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017035332,0.000003488395,0.0006487928,0.00003787784,0.00002249884,0.0000064465657,0.002496099,0.9797848,0.012470605,0.000038156602,0.000004047243,0.00447016],"study_design_scores_gemma":[0.005368469,0.00046717262,0.05408072,0.0010541922,0.0005031191,0.00022059972,0.024030684,0.82063574,0.09020205,0.00041294188,0.0017964087,0.0012278798],"about_ca_topic_score_codex":4.9386415e-7,"about_ca_topic_score_gemma":0.0000028168538,"teacher_disagreement_score":0.15914902,"about_ca_system_score_codex":0.00002905497,"about_ca_system_score_gemma":0.000015261612,"threshold_uncertainty_score":0.3612997},"labels":[],"label_agreement":null},{"id":"W3000464179","doi":"10.1007/s10951-019-00633-7","title":"Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments","year":2020,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multiprocessing; Computer science; Open shop; Scheduling (production processes); Job shop scheduling; Approximation algorithm; Flow shop scheduling; Multiprocessor scheduling; Algorithm; Mathematical optimization; Parallel computing; Flow (mathematics); Mathematics; Routing (electronic design automation)","score_opus":0.043729609832896726,"score_gpt":0.31903399613061034,"score_spread":0.2753043862977136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000464179","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3940495,0.0018814057,0.60165,0.0008661081,0.00031775804,0.00033009014,0.00001291737,0.000165283,0.0007269806],"genre_scores_gemma":[0.36491323,0.00011240486,0.6340333,0.00038540133,0.00040652332,0.000007879433,0.000011719017,0.000082790175,0.000046732355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975867,0.00008691953,0.0008921122,0.00036628186,0.00064901874,0.00041895633],"domain_scores_gemma":[0.9984399,0.00010698505,0.00036386916,0.00021512949,0.00029773513,0.00057637464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006859312,0.00040769347,0.0006454218,0.00022515794,0.00019143203,0.00056414853,0.00048317635,0.00012488857,0.00015233277],"category_scores_gemma":[0.00023372474,0.0003515494,0.00010725718,0.0005923172,0.00006576724,0.0011008237,0.00016302537,0.000881522,0.000019878507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021761908,0.00007558792,0.00097612257,0.00009786715,0.00020481768,0.00012330616,0.0024940602,0.98897696,0.0026023886,0.000087476816,0.000011318879,0.004132483],"study_design_scores_gemma":[0.004804912,0.00030855817,0.000024568119,0.0002300731,0.00007438418,0.0001580814,0.0033329907,0.98371637,0.0066971714,0.000025349667,0.00020525279,0.00042231713],"about_ca_topic_score_codex":0.000011832969,"about_ca_topic_score_gemma":0.0000026972875,"teacher_disagreement_score":0.032383353,"about_ca_system_score_codex":0.00011268835,"about_ca_system_score_gemma":0.00016436915,"threshold_uncertainty_score":0.99989367},"labels":[],"label_agreement":null},{"id":"W3010623153","doi":"10.1051/ro/2019116","title":"Scheduling job shop problems with operators with respect to the maximum lateness","year":2020,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Operator (biology); Scheduling (production processes); Mathematical optimization; Job shop scheduling; Computer science; Duration (music); Job shop; Mathematics; Flow shop scheduling; Schedule","score_opus":0.05790708007242472,"score_gpt":0.305543186624393,"score_spread":0.24763610655196827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010623153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53368974,0.000400753,0.4262007,0.0324862,0.00015623026,0.0022131088,0.000031241474,0.00082061416,0.004001434],"genre_scores_gemma":[0.90651006,0.000049412844,0.09167359,0.00040392188,0.00031945686,0.0003860083,0.00002497433,0.000102099715,0.00053045875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814814,0.00013380362,0.00021786125,0.00035816786,0.0006699156,0.0004720909],"domain_scores_gemma":[0.99867964,0.00007879055,0.0000059989407,0.00039856264,0.0004819462,0.0003550723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059119373,0.00018653789,0.0001710651,0.00017595457,0.00070011127,0.00058404484,0.00043293156,0.0000694516,0.00017289781],"category_scores_gemma":[0.0002148337,0.00011512425,0.000024681622,0.002068875,0.00009050127,0.00023431283,0.000078542056,0.0006231798,0.00027995816],"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.000031744046,0.000013889836,0.00022700783,0.000024354369,0.00004248008,0.00000873421,0.0022995323,0.99526066,0.0006338426,0.0004493544,0.00031946212,0.0006889633],"study_design_scores_gemma":[0.0005110216,0.00026753306,0.00015996837,0.00007335516,0.000009082803,0.000010840826,0.0016366851,0.9908664,0.002945154,0.0000044610933,0.0032634188,0.00025208527],"about_ca_topic_score_codex":0.00005511277,"about_ca_topic_score_gemma":0.00043035304,"teacher_disagreement_score":0.37282035,"about_ca_system_score_codex":0.00008165612,"about_ca_system_score_gemma":0.00023876748,"threshold_uncertainty_score":0.5631958},"labels":[],"label_agreement":null},{"id":"W3012491556","doi":"10.23919/fusion43075.2019.9011342","title":"A Machine Learning Task Selection Method for Radar Resource Management (Poster)","year":2019,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Schedule; Radar; Task (project management); Artificial intelligence; Real-time computing; Machine learning; Engineering; Operations management","score_opus":0.006635233163548508,"score_gpt":0.229452516611795,"score_spread":0.2228172834482465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012491556","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081988785,0.000078784025,0.96920764,0.000059576414,0.00015065636,0.0002558527,0.0000014690876,0.00056920626,0.028856894],"genre_scores_gemma":[0.018329656,0.000015112061,0.9645916,0.00011292501,0.00005807697,0.000025738957,0.00003816676,0.000042215917,0.016786467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951875,0.000019221829,0.00011190778,0.00013184754,0.000077394165,0.00014088796],"domain_scores_gemma":[0.99981207,0.000044391487,0.000015051903,0.00007905204,0.000018145067,0.000031306783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001931861,0.00008574323,0.00009037875,0.00008113441,0.000043487857,0.000030616393,0.00005454764,0.000040024213,0.00015837139],"category_scores_gemma":[0.000006818805,0.000082789906,0.00003859491,0.00014196336,0.0000018826532,0.000044409135,0.000013338967,0.000091006645,0.00006949101],"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.000014585387,0.000007730542,0.00020101768,0.00008453014,0.00006293686,3.362302e-7,0.00011954155,0.96287435,0.0005450296,0.0006222673,0.00048383887,0.03498381],"study_design_scores_gemma":[0.0004686468,0.000035505287,0.000040875482,0.000009052863,0.00001497172,0.000003233141,0.000098126795,0.939561,0.0012949088,0.00002452089,0.058339108,0.00011004529],"about_ca_topic_score_codex":0.0000062802505,"about_ca_topic_score_gemma":0.0000016982976,"teacher_disagreement_score":0.05785527,"about_ca_system_score_codex":0.000030893887,"about_ca_system_score_gemma":0.0000017497448,"threshold_uncertainty_score":0.33760744},"labels":[],"label_agreement":null},{"id":"W3013316588","doi":"10.5267/j.ijiec.2020.1.001","title":"A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tabu search; Mathematical optimization; Single-machine scheduling; Job shop scheduling; Scheduling (production processes); Computer science; Guided Local Search; Algorithm; Engineering; Mathematics; Schedule","score_opus":0.04924084801278942,"score_gpt":0.2716585936891527,"score_spread":0.22241774567636327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013316588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011267615,0.0002401922,0.98492414,0.0015044922,0.0015687016,0.00023286136,0.00008101628,0.000165315,0.000015660607],"genre_scores_gemma":[0.51816076,0.00002247613,0.48002627,0.0000517068,0.0016585059,0.000009700875,0.000021230879,0.00004703268,0.0000022994561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873394,0.0000151872855,0.0005600014,0.00012796547,0.0003520928,0.00021084165],"domain_scores_gemma":[0.99879056,0.00038733144,0.00014466813,0.00006867197,0.00049715966,0.000111620335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021287371,0.00017814139,0.0002216154,0.0003803376,0.00009642233,0.00013835526,0.0004613139,0.0001345349,0.000012479454],"category_scores_gemma":[0.00023939759,0.00015822619,0.00013159624,0.00033530244,0.000032227625,0.00020370333,0.00005144665,0.00061914796,0.0000019297831],"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.000014269979,0.000017470531,0.0000030306949,0.000004980584,0.00032980644,0.000009873574,0.00019328401,0.9097775,0.00052653614,0.00014080321,0.000030751995,0.08895165],"study_design_scores_gemma":[0.0012726783,0.000069793095,0.0000028183738,0.00010777227,0.000050320148,0.00008320799,0.00017940885,0.9889731,0.008529859,0.00005441635,0.0005262098,0.00015046317],"about_ca_topic_score_codex":0.0000039258275,"about_ca_topic_score_gemma":2.4395777e-7,"teacher_disagreement_score":0.50689316,"about_ca_system_score_codex":0.00017223948,"about_ca_system_score_gemma":0.000087372566,"threshold_uncertainty_score":0.6452277},"labels":[],"label_agreement":null},{"id":"W3013516278","doi":"10.5267/j.ijiec.2019.12.001","title":"A discrete Jaya algorithm for permutation flow-shop scheduling problem","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Job shop scheduling; Permutation (music); Mathematical optimization; Scheduling (production processes); Computer science; Discrete manufacturing; Algorithm; Mathematics; Economics; Computer network; Production (economics); Microeconomics; Physics","score_opus":0.027726077165255044,"score_gpt":0.2597911209544966,"score_spread":0.23206504378924153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013516278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035082279,0.00010349402,0.9916953,0.0017550514,0.0024568958,0.00018631504,0.00007191401,0.00018228826,0.000040556974],"genre_scores_gemma":[0.1906047,0.000019757343,0.8062127,0.00008317837,0.002918767,0.0000145434715,0.00008669429,0.000054193286,0.0000054232255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998661,0.000014238059,0.00065438676,0.0001250947,0.0003727067,0.00017258992],"domain_scores_gemma":[0.99878824,0.00019544573,0.0001601562,0.000051161802,0.0006266693,0.00017835137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018503606,0.00017454836,0.0002288616,0.00025348025,0.000044853303,0.00015318643,0.00030982884,0.000113841015,0.000021068134],"category_scores_gemma":[0.00033183352,0.00018562032,0.00016756965,0.0002719579,0.000013924142,0.00032948094,0.000022664197,0.0003623168,0.0000066451903],"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.000015078312,0.00001321986,0.000012394473,0.000009206911,0.00022047153,0.000008852575,0.00056591386,0.9509862,0.00019423166,0.0001250219,0.00024370471,0.047605705],"study_design_scores_gemma":[0.0016940496,0.00008336786,0.00000834707,0.000111767156,0.000042806136,0.000041502422,0.0001786653,0.9959653,0.00051101076,0.00007395401,0.0011076478,0.00018160502],"about_ca_topic_score_codex":0.0000010679058,"about_ca_topic_score_gemma":1.276956e-7,"teacher_disagreement_score":0.18709646,"about_ca_system_score_codex":0.00011815425,"about_ca_system_score_gemma":0.000094995965,"threshold_uncertainty_score":0.7569377},"labels":[],"label_agreement":null},{"id":"W3014027498","doi":"10.5267/j.ijiec.2020.1.004","title":"A vendor-buyer coordinated system featuring an unreliable machine, scrap, outsourcing, and multiple shipments","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scrap; Vendor; Outsourcing; Business; Industrial organization; Manufacturing engineering; Operations management; Insourcing; Computer science; Operations research; Engineering; Marketing; Mechanical engineering","score_opus":0.02401030255287726,"score_gpt":0.2322073217741267,"score_spread":0.20819701922124945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014027498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22157378,0.00036439757,0.772216,0.00061285996,0.0044251424,0.00016966897,0.00008273655,0.00045861703,0.00009679468],"genre_scores_gemma":[0.9763599,0.000010929852,0.0227089,0.000035131874,0.00080732943,0.0000018430184,0.0000323006,0.00003884778,0.0000047995463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894106,0.000022587185,0.00046552304,0.00012018149,0.00030226386,0.00014838522],"domain_scores_gemma":[0.9991563,0.00011376529,0.00012881697,0.000057245255,0.00031198593,0.00023189189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015784585,0.00016201353,0.00021554789,0.0002548286,0.000051073075,0.00016342702,0.00025222893,0.00009842541,0.000010324949],"category_scores_gemma":[0.00029784782,0.00017138547,0.000055870354,0.00025557977,0.000012211547,0.00031211684,0.00003412761,0.00042608954,0.0000034831291],"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.00002246947,0.000016324522,0.0010954762,0.000014170398,0.00017871195,0.000036271744,0.00034260948,0.99607486,0.00031309307,0.00007781151,0.00015659803,0.0016716359],"study_design_scores_gemma":[0.0017987774,0.00006258332,0.00033185782,0.0001908155,0.000029460625,0.000102331236,0.00018930597,0.99617326,0.00059260067,0.0000027146896,0.0003812959,0.00014502187],"about_ca_topic_score_codex":0.000013621714,"about_ca_topic_score_gemma":5.31638e-7,"teacher_disagreement_score":0.75478613,"about_ca_system_score_codex":0.0001238029,"about_ca_system_score_gemma":0.000042926793,"threshold_uncertainty_score":0.6988897},"labels":[],"label_agreement":null},{"id":"W3015682257","doi":"10.1002/nav.21901","title":"Efficient algorithms for flexible job shop scheduling with parallel machines","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Schedule; Upper and lower bounds; Mathematical optimization; Algorithm; Flow shop scheduling; Mathematics","score_opus":0.13850951942115866,"score_gpt":0.3646678265404282,"score_spread":0.2261583071192695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015682257","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051217657,0.00069102977,0.988597,0.00088524935,0.00025804152,0.0006098367,0.00007551636,0.0007176167,0.0030439761],"genre_scores_gemma":[0.35123813,0.00008142359,0.6470777,0.00011729844,0.0007358426,0.00013746753,0.00006744317,0.000118506534,0.00042620255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742883,0.000066363595,0.0003306583,0.00045274955,0.00088179717,0.000839575],"domain_scores_gemma":[0.9980311,0.0005839201,0.00003263959,0.0003026033,0.0006067713,0.00044298553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087028206,0.00026195886,0.00030499147,0.00018567636,0.0003113958,0.00020372766,0.00043657023,0.00016277055,0.00006096331],"category_scores_gemma":[0.0016552452,0.00022473786,0.00008018841,0.0008063423,0.0002038288,0.000045069537,0.00010239346,0.0007352559,0.00011634112],"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.00012755605,0.00003645477,0.00013058305,0.00018305452,0.000048936916,0.000021531092,0.00025491,0.991729,0.00022511258,0.002385925,0.0005605415,0.0042963442],"study_design_scores_gemma":[0.0010249811,0.00030628088,0.00004540499,0.000039609127,0.000018831277,0.0000051539755,0.00023427654,0.9959961,0.00067173166,0.00030375164,0.0010636846,0.0002901885],"about_ca_topic_score_codex":0.000021224045,"about_ca_topic_score_gemma":0.000005397231,"teacher_disagreement_score":0.34611636,"about_ca_system_score_codex":0.00011396774,"about_ca_system_score_gemma":0.00014652571,"threshold_uncertainty_score":0.9164544},"labels":[],"label_agreement":null},{"id":"W3021772469","doi":"10.1016/j.tcs.2020.03.013","title":"Makespan minimization on unrelated parallel machines with a few bags","year":2020,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Minification; Combinatorics; Approximation algorithm; Time complexity; Mathematics; Schedule; Polynomial-time approximation scheme; Scheduling (production processes); Computer science; Polynomial; Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.008816355427615812,"score_gpt":0.2082529349930051,"score_spread":0.1994365795653893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021772469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024672281,0.000012541391,0.970906,0.0011749415,0.00014726224,0.000087709355,0.00000132564,0.00047736,0.0025205594],"genre_scores_gemma":[0.73962605,0.0000031636303,0.25962836,0.0006465947,0.00007389828,0.0000022995903,0.0000029001994,0.000013128047,0.0000036066835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910367,0.000021947315,0.00012229319,0.00025310827,0.0002817231,0.00021725158],"domain_scores_gemma":[0.99951905,0.00005833165,0.000014773948,0.00015127411,0.000056880646,0.00019966181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117687225,0.00012454597,0.00011184081,0.00005885404,0.000107913555,0.00011269146,0.00029110615,0.00003563194,0.0000828032],"category_scores_gemma":[0.00003428176,0.00009274607,0.000018318216,0.00074430613,0.00045621986,0.00010097961,0.000039983763,0.0001397718,0.00007618079],"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.000023639843,0.000011359509,0.00003791665,0.000007098707,0.0000048319303,0.0000058309015,0.0003627573,0.857564,0.000033488544,0.13587232,0.00003616612,0.006040604],"study_design_scores_gemma":[0.00027516144,0.00016485034,0.00020403751,0.000021662041,0.000005199495,0.0000057274588,0.0000057603343,0.9980036,0.00037117873,0.00077409844,0.00002652948,0.00014217487],"about_ca_topic_score_codex":3.2040083e-7,"about_ca_topic_score_gemma":8.8045695e-8,"teacher_disagreement_score":0.7149538,"about_ca_system_score_codex":0.00001705099,"about_ca_system_score_gemma":0.000018866214,"threshold_uncertainty_score":0.3782075},"labels":[],"label_agreement":null},{"id":"W3036618906","doi":"10.1177/0954405420927578","title":"Designing a scheduling decision support system for the skin pass line: A case study of the steel finishing line","year":2020,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part B Journal of Engineering Manufacture","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Changeover; Tardiness; Mathematical optimization; Computer science; Scheduling (production processes); Production line; Computation; Job shop scheduling; Heuristic; Algorithm; Engineering; Mathematics; Schedule","score_opus":0.01993913403627062,"score_gpt":0.22949622315822618,"score_spread":0.20955708912195556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036618906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43754295,0.0002289303,0.5597914,0.00024733657,0.001482113,0.00061293534,0.0000147248,0.000072886054,0.0000067434153],"genre_scores_gemma":[0.94961846,0.000021996788,0.04993038,0.000020942725,0.000347411,0.000014345079,5.186186e-7,0.00004362787,0.0000023179077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977414,0.000012460971,0.0012054682,0.0001710309,0.00062536943,0.00024426318],"domain_scores_gemma":[0.9981757,0.0003719837,0.0006090054,0.00018291952,0.0005299043,0.0001304992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147599,0.00029348524,0.00057052495,0.00012651301,0.00013309023,0.000045079814,0.00077583955,0.00018327474,0.0000033234421],"category_scores_gemma":[0.0013430982,0.00017308151,0.00037263407,0.0005371966,0.000037351507,0.00023849758,0.00011408492,0.0007393815,2.0452809e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007093367,0.000050057617,0.0000094133375,0.00056253595,0.00023562361,0.000007135241,0.0011595888,0.9869159,0.010143802,0.00026315273,0.00005677411,0.00052507],"study_design_scores_gemma":[0.0013342077,0.00033121067,0.000013952748,0.00077701785,0.00031931707,0.00032809348,0.004096285,0.7835983,0.20888607,0.000009542019,0.00013901234,0.00016699782],"about_ca_topic_score_codex":0.000004060738,"about_ca_topic_score_gemma":8.2664144e-7,"teacher_disagreement_score":0.51207554,"about_ca_system_score_codex":0.00008585144,"about_ca_system_score_gemma":0.00006631724,"threshold_uncertainty_score":0.7058059},"labels":[],"label_agreement":null},{"id":"W3039856838","doi":"10.1016/j.cie.2020.106605","title":"An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time","year":2020,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":89,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Sequence (biology); Selection (genetic algorithm); Genetic algorithm; Mathematical optimization; Algorithm; Set (abstract data type); Benchmark (surveying); Scheduling (production processes); Computer science; Mathematics; Schedule; Artificial intelligence","score_opus":0.02890173795538531,"score_gpt":0.23991627743818647,"score_spread":0.21101453948280116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039856838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10228029,0.00027827013,0.8951513,0.00010072001,0.00032538592,0.0007274225,0.00010088456,0.0010224956,0.000013239052],"genre_scores_gemma":[0.18816245,0.00001318863,0.81066537,0.00006921305,0.0007007592,0.00007086964,0.00014078854,0.00015795397,0.000019421703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799436,0.000034506218,0.00047447786,0.0006179983,0.00029563162,0.0005830359],"domain_scores_gemma":[0.9988659,0.000103308135,0.00008184192,0.00031866232,0.00008043549,0.0005498296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024526072,0.0004831484,0.00047160796,0.00016860312,0.00013060568,0.00025651153,0.00034113775,0.00019314558,0.000016661164],"category_scores_gemma":[0.000040065483,0.0004989512,0.00007003141,0.000466784,0.000036554065,0.00020510062,0.000086785236,0.0005361824,0.000009938598],"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.000036621157,0.000026406859,0.00005489293,0.00007566983,0.00010323983,0.000033442455,0.00027599154,0.9697606,0.0017479933,0.00002357269,0.000007765396,0.02785383],"study_design_scores_gemma":[0.0032646602,0.0002718412,0.000012407862,0.00012959537,0.0000767117,0.000034215318,0.000041957614,0.9921791,0.003207799,0.0000010086275,0.00017815414,0.00060255366],"about_ca_topic_score_codex":0.000016300713,"about_ca_topic_score_gemma":6.852212e-7,"teacher_disagreement_score":0.08588215,"about_ca_system_score_codex":0.00009072264,"about_ca_system_score_gemma":0.000074399635,"threshold_uncertainty_score":0.9997462},"labels":[],"label_agreement":null},{"id":"W3041213598","doi":"10.1016/j.tcs.2019.12.009","title":"Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst France","keywords":"Job shop scheduling; Combinatorics; Approximation algorithm; Bounded function; Mathematics; Intersection (aeronautics); Discrete mathematics; Conjecture; Minification; Algorithm; Computer science; Schedule; Mathematical optimization","score_opus":0.004419485381486819,"score_gpt":0.20785143527257327,"score_spread":0.20343194989108646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041213598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54789233,0.0000045910674,0.45102623,0.000041034487,0.00024850285,0.000092925016,0.0000017377862,0.00012548127,0.00056718546],"genre_scores_gemma":[0.9188509,0.0000019966756,0.08097493,0.00009867978,0.000038421807,0.0000014525236,0.000005602995,0.000013681669,0.000014362154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991091,0.000027191587,0.000119455806,0.00027003043,0.00026667464,0.00020757558],"domain_scores_gemma":[0.99960464,0.000048806276,0.000021278218,0.00017723069,0.00004880688,0.000099260964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012258285,0.00013462607,0.000113830014,0.00010159356,0.00011907703,0.00017335732,0.00015867375,0.00005397111,0.00010572786],"category_scores_gemma":[0.0000118240405,0.00010060705,0.0000128526435,0.0003366778,0.00032118912,0.00015687998,0.00003904801,0.00014074307,0.000015751652],"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.000067386194,0.000016318685,0.0032251163,0.000019633464,0.000020520632,0.0000029144146,0.0004177573,0.86023927,0.00061503384,0.1278151,0.000018300974,0.007542652],"study_design_scores_gemma":[0.00043617655,0.00017360876,0.005497274,0.000026537193,0.0000064470823,0.000013772209,0.000009640711,0.9878339,0.0007873288,0.005063816,0.000005944298,0.00014555907],"about_ca_topic_score_codex":0.0000018020027,"about_ca_topic_score_gemma":8.452004e-7,"teacher_disagreement_score":0.37095857,"about_ca_system_score_codex":0.000044855562,"about_ca_system_score_gemma":0.000013121712,"threshold_uncertainty_score":0.41026366},"labels":[],"label_agreement":null},{"id":"W3042329448","doi":"10.1017/s0956796820000179","title":"Review of “Algorithms for Functional Programming” by John David Stone, Springer-Verlag, 2018","year":2020,"lang":"en","type":"article","venue":"Journal of Functional Programming","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Action (physics); Content (measure theory); Functional programming; Artificial intelligence; Programming language; Mathematics","score_opus":0.035885233436880284,"score_gpt":0.2572712874423624,"score_spread":0.2213860540054821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042329448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081891543,0.050614014,0.9434757,0.0016893675,0.0023631097,0.0006494381,0.000038218615,0.00020456708,0.00014666519],"genre_scores_gemma":[0.021013442,0.0099885175,0.9598983,0.0023697056,0.005569046,0.00018922087,0.0003469027,0.00026686056,0.00035802208],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976408,0.000034700588,0.0010852594,0.00022828388,0.00066981075,0.00034114506],"domain_scores_gemma":[0.99812835,0.00015543059,0.00049843185,0.00013516303,0.0007846545,0.00029796848],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007086961,0.000271938,0.00053086784,0.00013738216,0.000113587615,0.00006489959,0.00020840116,0.00012665351,0.00015699814],"category_scores_gemma":[0.00040892026,0.00025511018,0.00041660698,0.00051675143,0.00006982207,0.00034457963,0.000029685902,0.00042436205,0.00001154119],"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.0005262711,0.00059087813,0.0008833702,0.0113007575,0.0013863528,0.000017826605,0.0003045314,0.11157134,0.0020525022,0.00027367967,0.18646164,0.6846309],"study_design_scores_gemma":[0.002539725,0.0010850755,0.00024318197,0.0027041764,0.00041553157,0.00018864608,0.00021318508,0.072020456,0.0014086459,0.000039353967,0.91852045,0.00062155427],"about_ca_topic_score_codex":0.0000018451383,"about_ca_topic_score_gemma":3.0252824e-7,"teacher_disagreement_score":0.7320588,"about_ca_system_score_codex":0.00010550264,"about_ca_system_score_gemma":0.00013296807,"threshold_uncertainty_score":0.9999901},"labels":[],"label_agreement":null},{"id":"W3045260446","doi":"10.1109/iccicc46617.2019.9146101","title":"A Machine Learning Radar Scheduling Method Based on the EST Algorithm","year":2019,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Radar; Schedule; Algorithm; Scheduling (production processes); Reinforcement learning; Radar systems; Real-time computing; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.009714533402738335,"score_gpt":0.23069545548044257,"score_spread":0.22098092207770423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045260446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013718497,0.000103073326,0.9754333,0.00040584564,0.00035998377,0.00015584372,0.0000028548825,0.00069647614,0.021470763],"genre_scores_gemma":[0.051196937,0.0000148119525,0.94687086,0.00050794176,0.00008965506,0.000010825894,0.000017809267,0.000055777924,0.0012353524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915844,0.00007424551,0.00016047212,0.00017983124,0.00020822627,0.00021878025],"domain_scores_gemma":[0.9992553,0.00037262042,0.000023963508,0.00025410167,0.000034105524,0.000059937098],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049511687,0.00016243807,0.00014722877,0.00008666204,0.00009587816,0.00006802147,0.00015827703,0.00007081936,0.0013224309],"category_scores_gemma":[0.00007459778,0.000112477115,0.000068868285,0.00026748586,0.000009753646,0.000053649273,0.000016542363,0.00040669704,0.0005265209],"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.000002416775,0.000009009742,0.000091612346,0.000007594652,0.000015611411,0.0000011787383,0.00005264553,0.9765222,0.000097148964,0.00049281365,0.000019583267,0.02268815],"study_design_scores_gemma":[0.00034469305,0.000031361884,0.00001911096,0.000021813154,0.000007945622,0.0000023688199,0.0001408089,0.9952649,0.0017802651,0.000026696074,0.0021949292,0.00016513813],"about_ca_topic_score_codex":0.000021673177,"about_ca_topic_score_gemma":0.0000010717903,"teacher_disagreement_score":0.049825083,"about_ca_system_score_codex":0.00003214348,"about_ca_system_score_gemma":0.000016126916,"threshold_uncertainty_score":0.9995905},"labels":[],"label_agreement":null},{"id":"W3046501051","doi":"10.1109/rams48030.2020.9153652","title":"A Branch and Bound Algorithm for Single Machine Scheduling with Two Stages of Failure Process","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Branch and bound; Process (computing); Single-machine scheduling; Scheduling (production processes); Processor scheduling; Algorithm; Parallel computing; Mathematical optimization; Job shop scheduling; Mathematics; Embedded system; Schedule","score_opus":0.01201173463728382,"score_gpt":0.23228127797049802,"score_spread":0.2202695433332142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046501051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056050625,0.00041848846,0.9424518,0.00029039916,0.00003124075,0.00020150775,0.00002782955,0.0002563424,0.00027181444],"genre_scores_gemma":[0.5079636,0.0000071065087,0.4918422,0.000063928965,0.000052424406,0.000011276382,0.000012530361,0.000027152017,0.000019777102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945277,0.000004412245,0.00014906528,0.00015284425,0.00010110203,0.00013979737],"domain_scores_gemma":[0.999695,0.000035987323,0.000028138296,0.00006601491,0.000086698354,0.00008817467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047605146,0.00012330485,0.00017440137,0.000036004174,0.00004047004,0.000045959285,0.00006209266,0.000037206097,0.000026366164],"category_scores_gemma":[0.000021422713,0.0001027987,0.00002033192,0.0001837522,0.000030321893,0.000114389935,0.000009581967,0.0000757046,8.4774337e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004141424,0.000058950893,0.0013682997,0.00084532495,0.00017465695,0.0000033307329,0.0021187542,0.9281924,0.0060490854,0.00018066447,0.000041917454,0.060925245],"study_design_scores_gemma":[0.0011112855,0.00012670201,0.00001035834,0.000031086474,0.000021889577,0.0000061632204,0.00030239028,0.9705827,0.02753582,0.00003932143,0.00007897228,0.00015326285],"about_ca_topic_score_codex":0.0000046323244,"about_ca_topic_score_gemma":0.000007992216,"teacher_disagreement_score":0.45191297,"about_ca_system_score_codex":0.0000067598708,"about_ca_system_score_gemma":0.000014869717,"threshold_uncertainty_score":0.41920096},"labels":[],"label_agreement":null},{"id":"W3046693044","doi":"10.1109/rams48030.2020.9153721","title":"Real-Time Optimization of Maintenance and Production Scheduling for an Industry 4.0-Based Manufacturing System","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Industry 4.0; Manufacturing engineering; Cyber-physical system; Advanced manufacturing; Manufacturing execution system; Manufacturing; Scheduling (production processes); Integrated Computer-Aided Manufacturing; Process development execution system; Computer science; Lead time; Computer-integrated manufacturing; Engineering; Business; Operations management; Marketing","score_opus":0.016889400731782828,"score_gpt":0.21964445329760446,"score_spread":0.20275505256582163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046693044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15371485,0.000015083864,0.84463245,0.00020283999,0.00012670287,0.00027968036,0.0000066260955,0.00063107494,0.00039071188],"genre_scores_gemma":[0.4999747,0.000007397029,0.49982068,0.00001614493,0.000098788194,0.000013428805,0.000021187827,0.00002551537,0.000022145638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994119,0.000011889755,0.0002029941,0.00017953628,0.00007549957,0.000118203156],"domain_scores_gemma":[0.9996805,0.000019046796,0.00004552422,0.00010057606,0.00006817067,0.000086143584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011069204,0.00010138306,0.00014060817,0.00004854227,0.000042156433,0.000024080226,0.000051431867,0.000119005424,0.000011366268],"category_scores_gemma":[0.000043932163,0.000101281614,0.000020891364,0.00009622427,0.000014989044,0.00014894409,0.00000654906,0.00009266169,0.0000012213555],"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.000015794973,0.000005090235,0.000022264594,0.0002827477,0.000009994133,1.8144937e-7,0.000077096076,0.99700457,0.0019209504,0.000043640244,0.00002074724,0.0005969237],"study_design_scores_gemma":[0.0002984472,0.000040751627,0.000019494226,0.00006400215,0.000014054888,0.000001658728,0.00028846273,0.9328199,0.066340044,0.000001906247,0.000005627887,0.000105663275],"about_ca_topic_score_codex":0.0000047176873,"about_ca_topic_score_gemma":2.6629797e-7,"teacher_disagreement_score":0.34625986,"about_ca_system_score_codex":0.000027296936,"about_ca_system_score_gemma":0.000013739361,"threshold_uncertainty_score":0.41301444},"labels":[],"label_agreement":null},{"id":"W3047863327","doi":"10.1016/j.ejor.2020.07.063","title":"Machine learning for combinatorial optimization: A methodological tour d'horizon","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1336,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Machine learning; Combinatorial optimization; Point (geometry); Task (project management); Optimization problem; Mathematical optimization; Online machine learning; Active learning (machine learning); Mathematics; Algorithm","score_opus":0.02949669187414749,"score_gpt":0.24933834538315977,"score_spread":0.21984165350901227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047863327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009521885,0.00091795664,0.93793035,0.0005977904,0.0024539658,0.00039263986,0.00012653286,0.0007712165,0.04728765],"genre_scores_gemma":[0.19748616,0.0016745087,0.7704101,0.00022733983,0.00089760526,0.000076539225,0.0016194922,0.00017411221,0.0274341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981409,0.00023128856,0.00031394738,0.0005162815,0.00027968653,0.0005179323],"domain_scores_gemma":[0.99876493,0.0004934104,0.00007732036,0.00025350924,0.00024486895,0.0001659616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003067695,0.00033758348,0.00046939592,0.00014185149,0.0004899802,0.00007615983,0.00029174783,0.00017054514,0.00030515832],"category_scores_gemma":[0.00017438925,0.00035849138,0.00019617302,0.00039050166,0.00010290374,0.00016119688,0.00022995046,0.0003537058,0.00003595761],"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.00010982365,0.00011006105,0.0008349341,0.00007494839,0.00025149272,0.00014532292,0.00021885363,0.9587358,0.00025976027,0.037441798,0.0008348928,0.0009822937],"study_design_scores_gemma":[0.003336165,0.0003158462,0.0006477962,0.00005691878,0.0002469883,0.00012518193,0.0005948626,0.9379454,0.001470105,0.0008575814,0.053546276,0.0008568343],"about_ca_topic_score_codex":0.0000030069284,"about_ca_topic_score_gemma":0.0000051237153,"teacher_disagreement_score":0.18796428,"about_ca_system_score_codex":0.00013306574,"about_ca_system_score_gemma":0.0000750901,"threshold_uncertainty_score":0.9998867},"labels":[],"label_agreement":null},{"id":"W3049693416","doi":"","title":"Contributions au problème d'affectation des types d'avion","year":2004,"lang":"fr","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Humanities; Philosophy","score_opus":0.008677552933733127,"score_gpt":0.2287523807211779,"score_spread":0.22007482778744478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049693416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05466836,0.010097381,0.92264646,0.008339826,0.0009493091,0.0008779934,0.00018239865,0.0015620445,0.0006762291],"genre_scores_gemma":[0.48266876,0.0009538497,0.51378804,0.00028037478,0.0004198546,0.0003463112,0.00015543244,0.00012361819,0.0012637507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99735177,0.00014405706,0.00059914106,0.0004479837,0.00033919403,0.0011178498],"domain_scores_gemma":[0.9983374,0.00012139168,0.00016708559,0.0005442831,0.00034556075,0.00048428515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063848664,0.0004981433,0.00042623145,0.00043415467,0.00056297315,0.00027480721,0.0003180045,0.0006639819,0.000102732374],"category_scores_gemma":[0.00048799097,0.00059003173,0.0002301486,0.0010459977,0.00024305774,0.0006448552,0.0000790421,0.00066844065,0.00021129703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030759926,0.00029331917,0.0025843717,0.00017006231,0.00012658398,0.000044946777,0.0013086108,0.8654155,0.0025309008,0.09995501,0.0002471154,0.027292784],"study_design_scores_gemma":[0.00256346,0.00038174677,0.01967379,0.00093016995,0.00032029615,0.00034813277,0.00036414998,0.8926291,0.04964467,0.030040383,0.0018044927,0.0012996098],"about_ca_topic_score_codex":0.01828315,"about_ca_topic_score_gemma":0.005513666,"teacher_disagreement_score":0.4280004,"about_ca_system_score_codex":0.0039183735,"about_ca_system_score_gemma":0.0006450494,"threshold_uncertainty_score":0.9999054},"labels":[],"label_agreement":null},{"id":"W3080168217","doi":"10.29173/ijic215","title":"Planning semi-automated precast production using GA","year":2020,"lang":"en","type":"article","venue":"International Journal of Industrialized Construction","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Precast concrete; Tardiness; Production planning; Production line; Production (economics); Scheduling (production processes); Schedule; Computer science; Job shop scheduling; Industrial engineering; Real-time computing; Engineering; Operations research; Operations management; Civil engineering; Operating system","score_opus":0.05524105237403548,"score_gpt":0.2919254342536463,"score_spread":0.23668438187961083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080168217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8217542,0.00021710947,0.15819342,0.0011786472,0.017470647,0.00015653283,0.000013665558,0.00059768825,0.00041809177],"genre_scores_gemma":[0.94429886,0.000038619975,0.05156627,0.00006714068,0.003979465,0.0000013187577,0.000011832615,0.000028877903,0.0000076248516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987984,0.000046236113,0.00056511257,0.0001030305,0.00038177296,0.000105476975],"domain_scores_gemma":[0.9990427,0.000024847279,0.000307286,0.000049886137,0.00047527422,0.000100001314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017494739,0.00011887627,0.00018533159,0.00020987276,0.000040128045,0.00009714218,0.00017119478,0.00012631594,0.00007718085],"category_scores_gemma":[0.0003724184,0.00012108986,0.00007823593,0.00025566985,0.00003708827,0.00039596908,0.00001492109,0.00033156507,0.0000045152897],"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.00015701316,0.000008889983,0.0006930839,0.000005297657,0.00023366271,0.000021495624,0.00031362282,0.97952783,0.008969423,0.000027842565,0.0008683802,0.00917348],"study_design_scores_gemma":[0.0019192655,0.000047764996,0.000053944434,0.00018447037,0.00005954516,0.001090119,0.0006067684,0.9726207,0.021719724,0.00003962947,0.0014852417,0.00017278055],"about_ca_topic_score_codex":0.0000028253883,"about_ca_topic_score_gemma":7.458104e-8,"teacher_disagreement_score":0.12254465,"about_ca_system_score_codex":0.00014446408,"about_ca_system_score_gemma":0.00008511021,"threshold_uncertainty_score":0.49379012},"labels":[],"label_agreement":null},{"id":"W3086273627","doi":"","title":"Knowledge Management in Self-Organizing Systems","year":2004,"lang":"en","type":"article","venue":"Journal of Knowledge Management and Practice","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Knowledge management; Computer science","score_opus":0.016360625057774407,"score_gpt":0.26323082286062793,"score_spread":0.24687019780285352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086273627","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010088597,0.053903792,0.05837263,0.00048624282,0.004844872,0.0006666348,9.503016e-7,0.00031523473,0.871321],"genre_scores_gemma":[0.8051415,0.015143582,0.17743726,0.00006275339,0.00054800464,0.000013513873,0.0000018367905,0.000075099364,0.001576425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989351,0.00008353491,0.0004829951,0.00012622062,0.00016497372,0.00020718797],"domain_scores_gemma":[0.99934846,0.00014481087,0.00014578059,0.00012940838,0.00013378351,0.000097781194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010810024,0.00016358824,0.00022197244,0.0004665625,0.00006243909,0.00013667559,0.00016951257,0.000057305195,0.000006108133],"category_scores_gemma":[0.000048805345,0.00015760366,0.000041901127,0.00053044123,0.000012987785,0.0005501312,0.00007275667,0.0002548,0.000066064975],"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.00044591847,0.0038126896,0.0011274825,0.0076878085,0.005891411,0.0032987925,0.0338669,0.62983793,0.00009003485,0.14734495,0.009548595,0.15704748],"study_design_scores_gemma":[0.017313583,0.0004964236,0.003699145,0.00273029,0.002187306,0.0016599589,0.05461138,0.11045979,0.00024345709,0.000915433,0.80386174,0.0018214852],"about_ca_topic_score_codex":0.0000012053582,"about_ca_topic_score_gemma":0.0000024987532,"teacher_disagreement_score":0.8697446,"about_ca_system_score_codex":0.00019402933,"about_ca_system_score_gemma":0.000015052577,"threshold_uncertainty_score":0.64268905},"labels":[],"label_agreement":null},{"id":"W3086909567","doi":"10.1007/978-3-030-44530-0_19","title":"Production Typologies in Production Scheduling: Identification and Management","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in management and industrial engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Typology; Production (economics); Scheduling (production processes); Computer science; Production manager; Task (project management); Identification (biology); Factory (object-oriented programming); Engineering; Operations management; Systems engineering; Economics; Microeconomics","score_opus":0.025300198935220994,"score_gpt":0.21057419271527822,"score_spread":0.1852739937800572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086909567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022567479,0.027738715,0.7959621,0.014312779,0.03723021,0.018633446,0.000044124343,0.0071591767,0.076352],"genre_scores_gemma":[0.77943987,0.04397411,0.14862067,0.000120408615,0.004951632,0.00050237705,0.00048195722,0.000696132,0.021212824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987725,0.000008001908,0.0003895242,0.00047884366,0.00015921978,0.00019188308],"domain_scores_gemma":[0.99968076,0.000021622975,0.000058490616,0.00018261987,0.000014938231,0.0000415711],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020680671,0.00032216182,0.00027685091,0.0005820666,0.000032812557,0.000079542006,0.00008958689,0.00031854768,0.000008722175],"category_scores_gemma":[0.00008666933,0.00036660116,0.000027493166,0.00020312873,0.000027474789,0.00012912395,0.0000733905,0.00057790877,0.000005015757],"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.000015734759,0.0000053333288,0.000057307272,0.0005887213,0.00008801094,0.000015813024,0.00010560683,0.94096357,0.00004901501,0.002914568,0.00005279911,0.05514354],"study_design_scores_gemma":[0.0026113614,0.00010475465,0.001258393,0.0036938854,0.0004447426,0.000022362847,0.00015684123,0.96131575,0.0024083243,0.008466909,0.01697081,0.0025458594],"about_ca_topic_score_codex":0.0000021657088,"about_ca_topic_score_gemma":0.000005053454,"teacher_disagreement_score":0.7568724,"about_ca_system_score_codex":0.00011426853,"about_ca_system_score_gemma":0.0000035691376,"threshold_uncertainty_score":0.9998786},"labels":[],"label_agreement":null},{"id":"W3088468425","doi":"10.5539/mas.v14n10p6","title":"Energy Efficiency Improvement through Optimal Batch Sizing in Job Shop","year":2020,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of New South Wales","keywords":"Computer science; Production (economics); Sizing; Job shop; Sustainability; Tardiness; Personalization; Dilemma; Energy consumption; Environmental economics; Manufacturing engineering; Job shop scheduling; Flow shop scheduling; Economics","score_opus":0.0149677923292651,"score_gpt":0.21944142076925321,"score_spread":0.20447362843998812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088468425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05691903,0.00010152506,0.93244535,0.00016736775,0.00013893278,0.00009091404,0.0000013454668,0.00027034586,0.009865174],"genre_scores_gemma":[0.92613983,0.000020195477,0.0732945,0.0004269012,0.00005582925,0.000025421992,0.0000013858271,0.000019018531,0.000016911068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985827,0.000003710872,0.00022127718,0.00039596017,0.00038443095,0.00041187592],"domain_scores_gemma":[0.9996299,0.000018382205,0.000021986842,0.0001784404,0.000026531008,0.00012476167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018487703,0.00014526826,0.00013950879,0.00006965513,0.000116540185,0.0001008212,0.00042424898,0.000045263805,0.00002236895],"category_scores_gemma":[0.000016139687,0.00014833019,0.000022836723,0.00093451986,0.000112794725,0.00017908914,0.000096264295,0.00013953542,0.000020726344],"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.0000032540029,0.0000110654655,0.000016197155,0.000007864445,0.0000014805072,0.0000018560997,0.0019837022,0.85381377,0.12930776,0.0009838775,0.000009128033,0.013860068],"study_design_scores_gemma":[0.00024832104,0.000017799892,0.000022598033,0.000005239826,0.0000017980243,5.321303e-7,0.00023651206,0.9615849,0.037477586,0.0001516537,0.0000760396,0.00017696762],"about_ca_topic_score_codex":0.000012288163,"about_ca_topic_score_gemma":0.0000028058398,"teacher_disagreement_score":0.8692208,"about_ca_system_score_codex":0.00009300866,"about_ca_system_score_gemma":0.000057759084,"threshold_uncertainty_score":0.60487294},"labels":[],"label_agreement":null},{"id":"W3089652464","doi":"10.1007/978-3-030-58942-4_28","title":"CP and Hybrid Models for Two-Stage Batching and Scheduling","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Bin packing problem; Scheduling (production processes); Mathematical optimization; Constraint programming; Job shop scheduling; Heuristic; Algorithm; Bin; Artificial intelligence; Mathematics; Schedule","score_opus":0.018378803155528055,"score_gpt":0.23311934143731478,"score_spread":0.2147405382817867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089652464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036348667,0.0010786422,0.9970433,0.00016036927,0.00051148294,0.00021539471,0.000015107529,0.00016942139,0.0004427669],"genre_scores_gemma":[0.13266242,0.000085169835,0.86646134,0.00037564177,0.00031497938,0.0000051499073,0.000007956298,0.000048903417,0.000038419068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987928,0.000004313432,0.00021617988,0.00054208725,0.00019835394,0.00024625036],"domain_scores_gemma":[0.99937874,0.0002124213,0.00004518679,0.00018529608,0.00005379346,0.00012458337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022494278,0.00027115515,0.00028122455,0.00020304194,0.00012833904,0.00024230608,0.00024326089,0.00009534594,0.0000032308342],"category_scores_gemma":[0.000040660052,0.0002753326,0.00003535463,0.00009083452,0.00015321479,0.00020599563,0.00015001534,0.0003774635,0.0000011354055],"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.0000019516112,9.2576823e-7,0.0000021221135,0.00006564928,0.0000060025177,0.0000057309308,0.00023517391,0.8958954,0.000038213057,0.0015280964,7.345609e-7,0.10222],"study_design_scores_gemma":[0.00024764796,0.000024263592,9.2384266e-7,0.00015745856,0.000007842094,0.000015268215,4.3132917e-7,0.97435546,0.00051745865,0.0243036,0.000070713824,0.00029894942],"about_ca_topic_score_codex":0.0000029277965,"about_ca_topic_score_gemma":0.000004393935,"teacher_disagreement_score":0.13229893,"about_ca_system_score_codex":0.000046818965,"about_ca_system_score_gemma":0.000048701517,"threshold_uncertainty_score":0.9999699},"labels":[],"label_agreement":null},{"id":"W3090050045","doi":"10.1109/aparm49247.2020.9209399","title":"Joint optimization of maintenance and production scheduling for unrelated parallel-machine system","year":2020,"lang":"en","type":"article","venue":"2020 Asia-Pacific International Symposium on Advanced Reliability and Maintenance Modeling (APARM)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Preventive maintenance; Scheduling (production processes); Computer science; Simulated annealing; Mathematical optimization; Job shop scheduling; Reliability engineering; Optimal maintenance; Production (economics); Engineering; Mathematics; Algorithm; Schedule","score_opus":0.010853994397512565,"score_gpt":0.21337076673113156,"score_spread":0.202516772333619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090050045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018596496,0.0003525226,0.9701176,0.007349088,0.0012748226,0.00086129317,0.00009383886,0.00043270612,0.0009215906],"genre_scores_gemma":[0.7959534,0.0014419213,0.20200706,0.00007333062,0.00016163467,0.00009975202,0.00010352277,0.000057852423,0.00010152049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977718,0.000046446785,0.000815702,0.0007331062,0.0003041493,0.00032877186],"domain_scores_gemma":[0.99862945,0.00007521267,0.00020464325,0.00025090316,0.000657954,0.00018180924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045376417,0.00034704778,0.00046306534,0.00008391535,0.00015536253,0.000059089056,0.00017466563,0.00016715814,0.0000065520776],"category_scores_gemma":[0.00058637385,0.00033085383,0.00011432147,0.00024520274,0.00010401429,0.00030744277,0.000051990464,0.00034838569,0.0000027534252],"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.0004436577,0.000042497042,0.000023004037,0.00039947336,0.00006543966,0.0000017521947,0.00043868428,0.993343,0.0023876298,0.001852254,0.000056458844,0.0009461556],"study_design_scores_gemma":[0.0013741701,0.00014690091,0.0000046419077,0.00044052192,0.000037838032,0.000018829878,0.0009720364,0.9945995,0.0015181324,0.00028632427,0.00027384938,0.00032722505],"about_ca_topic_score_codex":0.00000705914,"about_ca_topic_score_gemma":8.5487886e-7,"teacher_disagreement_score":0.7773569,"about_ca_system_score_codex":0.0001816536,"about_ca_system_score_gemma":0.000030206525,"threshold_uncertainty_score":0.99991435},"labels":[],"label_agreement":null},{"id":"W3090987700","doi":"10.1007/978-3-030-58942-4_22","title":"Leveraging Constraint Scheduling: A Case Study to the Textile Industry","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","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":"Université Laval","funders":"","keywords":"Computer science; Heuristics; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Leverage (statistics); Constraint programming; Resource constraints; Textile industry; Industrial engineering; Operations research; Distributed computing; Artificial intelligence; Mathematics; Engineering; Stochastic programming","score_opus":0.027474374922740047,"score_gpt":0.25232194952697573,"score_spread":0.22484757460423568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3090987700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048024706,0.00012940225,0.9911742,0.0006245464,0.0015976704,0.0005148462,0.0000041258313,0.0002640442,0.00088868843],"genre_scores_gemma":[0.80411404,0.0000022916397,0.19425198,0.0009613626,0.00056698977,0.000009162964,0.0000016108659,0.00004521973,0.00004733697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826014,0.000017741539,0.0003280662,0.0006261504,0.000434038,0.00033383776],"domain_scores_gemma":[0.998958,0.00018627623,0.000051649084,0.00051410776,0.000095925665,0.00019406226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004230355,0.00035191805,0.0002990581,0.00028239025,0.00021331888,0.0003142501,0.0007203897,0.00020876378,0.00004492012],"category_scores_gemma":[0.00009572708,0.0002858237,0.00005508407,0.0004786032,0.00018394874,0.00007739502,0.00029958074,0.0016220487,0.00004442477],"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":[9.019291e-7,0.000009636438,0.000037071,0.000008976521,0.000013412496,0.0008039441,0.0040550567,0.91411257,0.0000022590805,0.000041832605,0.000008384631,0.08090597],"study_design_scores_gemma":[0.00016062857,0.00006932844,0.000007165896,0.000107924745,0.000013011169,0.0006431001,0.00005556123,0.99800056,0.00005522624,0.00033486492,0.00019267667,0.0003599388],"about_ca_topic_score_codex":0.000020425054,"about_ca_topic_score_gemma":0.00003063806,"teacher_disagreement_score":0.7993116,"about_ca_system_score_codex":0.00014800116,"about_ca_system_score_gemma":0.00017489176,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W3095452282","doi":"10.3166/jesa.45.45-60","title":"Contribution à la reconfiguration des systèmes de production","year":2011,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.023340179850088936,"score_gpt":0.23971013197626087,"score_spread":0.21636995212617194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095452282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28065604,0.026600685,0.6664801,0.00067216693,0.009159603,0.0006078845,0.00003976152,0.0012717033,0.014512055],"genre_scores_gemma":[0.7067386,0.0050449236,0.28103846,0.000036934143,0.0017520016,0.000028483659,0.000022332979,0.00016383817,0.005174417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964812,0.0009763002,0.001046742,0.00033280853,0.00039115056,0.00077181053],"domain_scores_gemma":[0.997833,0.00013617864,0.0005021618,0.00029440975,0.00084610103,0.00038811975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001976417,0.00043705193,0.00047978942,0.00035183094,0.0006786075,0.0005372859,0.0002693587,0.00037994332,0.0007588872],"category_scores_gemma":[0.0014380002,0.0004571159,0.00022134114,0.0006036992,0.00031734625,0.0012998658,0.00003204461,0.00074626476,0.0003803649],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007363229,0.0003291435,0.003303258,0.0012465979,0.0006846256,0.00036998518,0.016482877,0.093869366,0.0030569518,0.010547641,0.003510217,0.8665257],"study_design_scores_gemma":[0.001597968,0.00045891915,0.41922513,0.0051517882,0.0006804696,0.018738592,0.0014204673,0.49995586,0.016416736,0.03261322,0.0024709636,0.001269877],"about_ca_topic_score_codex":0.00015441513,"about_ca_topic_score_gemma":0.00003135064,"teacher_disagreement_score":0.86525583,"about_ca_system_score_codex":0.001303366,"about_ca_system_score_gemma":0.00025584374,"threshold_uncertainty_score":0.99978805},"labels":[],"label_agreement":null},{"id":"W3097072875","doi":"10.5267/j.jpm.2020.10.001","title":"Solving a flow shop scheduling problem with missing operations in an Industry 4.0 production environment","year":2020,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Tardiness; Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Permutation (music); Simulated annealing; Industrial engineering; Algorithm; Mathematics; Engineering; Routing (electronic design automation)","score_opus":0.02381794412213724,"score_gpt":0.23924523935885292,"score_spread":0.21542729523671567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097072875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2944146,0.00036659723,0.7004749,0.0026157934,0.00029577006,0.0008433075,0.0000012160668,0.00015547323,0.00083229446],"genre_scores_gemma":[0.28527436,0.00008273872,0.7142648,0.00006841391,0.0002344229,0.000013398885,0.0000027443068,0.000027687858,0.00003141408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990428,0.000034536788,0.00036679397,0.0001475772,0.0002492034,0.00015906741],"domain_scores_gemma":[0.99971485,0.000004584691,0.00006534097,0.00009766162,0.000038031798,0.0000795231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000278727,0.00012550568,0.00015056862,0.00021084341,0.00006092648,0.00011181607,0.00011587633,0.00005971223,0.000021306281],"category_scores_gemma":[0.0000138280075,0.00010930383,0.00002695393,0.00030888143,0.00001239037,0.0004516198,0.000023646771,0.00043023218,0.0000027426242],"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.000019131112,0.00004420207,0.00036455118,0.00008830697,0.000051952942,0.00004545407,0.0016680021,0.9868914,0.00029019668,0.0000130866365,0.000038234557,0.010485489],"study_design_scores_gemma":[0.0005297493,0.00014145684,0.00019586556,0.00020832123,0.000043055454,0.000027743748,0.0023203332,0.99570274,0.0004279426,0.0000065458617,0.00024557536,0.0001506765],"about_ca_topic_score_codex":0.0000015970567,"about_ca_topic_score_gemma":0.0000032398432,"teacher_disagreement_score":0.013789907,"about_ca_system_score_codex":0.00012563856,"about_ca_system_score_gemma":0.00003224006,"threshold_uncertainty_score":0.4457281},"labels":[],"label_agreement":null},{"id":"W3105121253","doi":"10.3390/su12229713","title":"A Framework for Capacity and Operations Planning in Services Organizations Employing Workers with Intellectual Disabilities","year":2020,"lang":"en","type":"article","venue":"Sustainability","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Workforce; Business; Flexibility (engineering); Work (physics); Process management; Profit (economics); Workforce planning; Workforce development; Knowledge management; Marketing; Operations management; Public relations; Economic growth; Engineering; Computer science; Economics; Management; Political science","score_opus":0.01760497686109244,"score_gpt":0.2560945917481628,"score_spread":0.23848961488707035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105121253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59869814,0.000051884825,0.40022376,0.0005429861,0.000022028295,0.00027458425,0.0000072264165,0.00016878512,0.000010589663],"genre_scores_gemma":[0.89631426,0.0000025513,0.103473246,0.00006379936,0.00004007185,0.00006488815,0.000013210892,0.000023110308,0.0000048465195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999349,0.00002624665,0.00016914449,0.00020150265,0.00006464551,0.00018946247],"domain_scores_gemma":[0.9990904,0.00047459675,0.000009420212,0.0001123467,0.00022897088,0.00008428337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001010603,0.00011795099,0.00014139064,0.000043086482,0.00013557247,0.00008556541,0.00007119739,0.000069654656,0.000019898009],"category_scores_gemma":[0.0025933105,0.00011211888,0.000013848707,0.0005573876,0.00008176267,0.00016427145,0.000023070803,0.00016677078,6.0617094e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020364163,0.000012836935,0.1486008,0.00038246356,0.000012183232,4.035203e-7,0.05537281,0.79448307,0.0000017899256,0.0009498181,0.0000045545266,0.0001589072],"study_design_scores_gemma":[0.00034185214,0.0000755762,0.007978381,0.00007132369,0.000015560157,0.0000013540423,0.09557801,0.89259225,0.0000992006,0.0029556518,0.000047136073,0.00024368103],"about_ca_topic_score_codex":0.000049842867,"about_ca_topic_score_gemma":0.000066556306,"teacher_disagreement_score":0.29761612,"about_ca_system_score_codex":0.0001536022,"about_ca_system_score_gemma":0.00006726835,"threshold_uncertainty_score":0.45720753},"labels":[],"label_agreement":null},{"id":"W3105354924","doi":"10.23919/irs48640.2020.9253795","title":"Dual-Side Scheduling for Radar Resource Management","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Radar; Computer science; Scheduling (production processes); Real-time computing; Dynamic priority scheduling; Fair-share scheduling; Job shop scheduling; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Schedule; Simulation; Mathematical optimization; Mathematics; Operating system; Telecommunications","score_opus":0.01717264818344635,"score_gpt":0.21983215950283022,"score_spread":0.20265951131938387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105354924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013927585,0.0001566143,0.9567373,0.0012665003,0.0001304587,0.0002023456,0.0000036962183,0.0009377858,0.03917256],"genre_scores_gemma":[0.03806859,0.000023206803,0.95976233,0.0011002443,0.00024401961,0.000025278452,0.000020030462,0.00004348093,0.00071282714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947333,0.0000045575575,0.00013838436,0.00013566225,0.00008966187,0.00015838408],"domain_scores_gemma":[0.9997552,0.000027793087,0.000009912911,0.000097173994,0.000015824762,0.000094093906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006636047,0.00009050138,0.000089822664,0.000032894626,0.00004652794,0.000035957488,0.00007302104,0.000035009052,0.000061961335],"category_scores_gemma":[0.000018264622,0.00009176537,0.000043395645,0.00014236216,0.000006726114,0.000042824468,0.000021565846,0.000059582042,0.00006477904],"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.000009749918,0.000005761463,0.000008304645,0.00010985892,0.000058140402,0.0000051586144,0.0002114577,0.9803954,0.0001422776,0.0033608973,0.0048406194,0.0108524],"study_design_scores_gemma":[0.0004819708,0.000015669733,0.000013905163,0.000010253091,0.000016323404,9.795087e-7,0.00047257083,0.9502551,0.0022695907,0.00006107222,0.046253856,0.00014871157],"about_ca_topic_score_codex":5.067789e-7,"about_ca_topic_score_gemma":2.2796632e-7,"teacher_disagreement_score":0.041413236,"about_ca_system_score_codex":0.000014065991,"about_ca_system_score_gemma":0.0000027006222,"threshold_uncertainty_score":0.3742083},"labels":[],"label_agreement":null},{"id":"W3115980200","doi":"10.1115/detc2000/cie-14668","title":"An Intelligent Manufacturing System for Predictive Scheduling and Reactive Scheduling","year":2000,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheduling (production processes); Negotiation; Dynamic priority scheduling; Distributed computing; Fair-share scheduling; Job shop scheduling; Two-level scheduling; Schedule; Engineering; Operations management","score_opus":0.010639073284993084,"score_gpt":0.22937755345942573,"score_spread":0.21873848017443265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115980200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4451098,0.00019263687,0.5506368,0.000013846273,0.0002110832,0.00029011592,0.000011141478,0.00093036186,0.0026041854],"genre_scores_gemma":[0.73962075,0.000056882738,0.25993946,0.000018183358,0.00017365148,0.000048663125,0.000017852086,0.00004503336,0.000079550206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990495,0.000017190798,0.00025105657,0.00028939106,0.000115056326,0.0002778106],"domain_scores_gemma":[0.999499,0.00007644473,0.000023826049,0.00018741444,0.000049429098,0.00016384102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018403209,0.0001991319,0.0001959181,0.000097027136,0.00014313082,0.00010390317,0.0001034718,0.000113739414,0.00007728182],"category_scores_gemma":[0.000012231635,0.00019499946,0.000046000714,0.00007626024,0.000024874746,0.00029612257,0.000008937704,0.00015144252,0.00002033184],"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.00003252006,0.000013496008,0.000031603082,0.00008439421,0.00005624483,0.000001481535,0.0005006869,0.9655609,0.00027641145,0.00019750594,0.000002232873,0.033242527],"study_design_scores_gemma":[0.00032414586,0.00006001715,0.000066217384,0.00008261888,0.000028483084,0.000014420495,0.002136246,0.93087494,0.06602804,0.000054025466,0.000108332,0.00022249851],"about_ca_topic_score_codex":0.000011385149,"about_ca_topic_score_gemma":0.0000021196836,"teacher_disagreement_score":0.2945109,"about_ca_system_score_codex":0.000099574165,"about_ca_system_score_gemma":0.000011513585,"threshold_uncertainty_score":0.79518473},"labels":[],"label_agreement":null},{"id":"W3116347600","doi":"10.1155/2020/1385049","title":"Nature-Inspired Metaheuristics for Two-Agent Scheduling with Due Date and Release Time","year":2020,"lang":"en","type":"article","venue":"Complexity","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metaheuristic; Solver; Computer science; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Computation; Cloud computing; Heuristic; Distributed computing; Algorithm; Artificial intelligence; Mathematics; Schedule","score_opus":0.03339619471410213,"score_gpt":0.2507187593996895,"score_spread":0.2173225646855874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116347600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11556656,0.0007011333,0.8808489,0.00083105796,0.00018186982,0.00034356414,0.000093756855,0.00053584244,0.0008973168],"genre_scores_gemma":[0.52104557,0.0000164068,0.4781826,0.00038133402,0.00019302183,0.000013188597,0.0000936987,0.000041010935,0.00003314951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.000014815676,0.0001493729,0.000205836,0.00010158047,0.00017466169],"domain_scores_gemma":[0.9995249,0.000054160726,0.000030081517,0.00014542865,0.0000685041,0.00017695867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007507865,0.00014713414,0.00020441679,0.000027350638,0.000095024145,0.000055872377,0.00010251729,0.000059491224,0.000052750343],"category_scores_gemma":[0.00010987812,0.00013697466,0.000031158568,0.00015119258,0.000050695355,0.00006034727,0.000031267475,0.000196827,0.000028229944],"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.00019885399,0.00004903069,0.00031619432,0.00029727948,0.00026734543,0.000048250222,0.0005563695,0.98514175,0.0013489008,0.005259287,0.0009235909,0.005593149],"study_design_scores_gemma":[0.00079205655,0.00004558815,0.00016526111,0.000016257567,0.000038659604,0.000008473756,0.000025802403,0.9950184,0.0012332927,0.00018178925,0.0022835203,0.00019085358],"about_ca_topic_score_codex":0.00000251878,"about_ca_topic_score_gemma":0.000001994267,"teacher_disagreement_score":0.405479,"about_ca_system_score_codex":0.000012475085,"about_ca_system_score_gemma":0.000014210494,"threshold_uncertainty_score":0.55856645},"labels":[],"label_agreement":null},{"id":"W3117209446","doi":"10.18280/jesa.530617","title":"A Two-Stage Optimization Algorithm for Multi-objective Job-Shop Scheduling Problem Considering Job Transport","year":2020,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Commission of Shanghai Municipality; University of Shanghai for Science and Technology; National Natural Science Foundation of China","keywords":"Tardiness; Job shop scheduling; Mathematical optimization; Sorting; Computer science; Genetic algorithm; Ant colony optimization algorithms; Task (project management); Scheduling (production processes); Algorithm; Mathematics; Engineering; Schedule","score_opus":0.031858942061305934,"score_gpt":0.26390416404338585,"score_spread":0.2320452219820799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117209446","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009975358,0.00093269214,0.98576653,0.00012165198,0.0005421602,0.00065318664,0.000067660956,0.001312444,0.00062831497],"genre_scores_gemma":[0.041455638,0.00022250747,0.9572059,0.0001536406,0.00050247385,0.00005516788,0.000023519668,0.00020680043,0.00017433653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975273,0.000108913904,0.000988013,0.0003865062,0.00039285782,0.000596388],"domain_scores_gemma":[0.9985675,0.00011980533,0.00026699615,0.00018062849,0.0004155529,0.00044950048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046191417,0.0004511926,0.0005787264,0.00023451958,0.00045688025,0.0003271081,0.00029605773,0.00014988842,0.000116523224],"category_scores_gemma":[0.0001885628,0.00045856126,0.00026174926,0.0005601571,0.00007581118,0.0006523546,0.000032801818,0.0005496134,0.000027503984],"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.000011982706,0.000022592027,0.00033343496,0.00025130453,0.00020682685,0.00006947464,0.00228789,0.95088327,0.00038929054,0.0000698064,0.000038022612,0.04543613],"study_design_scores_gemma":[0.0023356767,0.00011407016,0.0013437252,0.00030687687,0.00010697193,0.0002540492,0.0007968057,0.9935341,0.0005549406,0.000046850255,0.00009000168,0.00051594694],"about_ca_topic_score_codex":0.000008928777,"about_ca_topic_score_gemma":0.0000051828542,"teacher_disagreement_score":0.04492018,"about_ca_system_score_codex":0.00022669516,"about_ca_system_score_gemma":0.00013645735,"threshold_uncertainty_score":0.9997866},"labels":[],"label_agreement":null},{"id":"W3119252454","doi":"","title":"Planification de la production et Industrie 4.0 : Revue de la littérature","year":2019,"lang":"fr","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Political science; Humanities; Art","score_opus":0.00976202024791947,"score_gpt":0.23063428073637932,"score_spread":0.22087226048845984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119252454","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020559378,0.0061644125,0.9469839,0.016542692,0.0013288878,0.0014659163,0.00018073777,0.0020391403,0.0047349585],"genre_scores_gemma":[0.29622692,0.0072196634,0.68231624,0.00068472786,0.0018380387,0.0009551542,0.00063295744,0.00036855714,0.009757771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558383,0.0012387664,0.00082628714,0.0009752956,0.00038508326,0.0009907441],"domain_scores_gemma":[0.9967771,0.00051657786,0.00046846105,0.0015485352,0.00024154279,0.0004477548],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.003576228,0.00081575225,0.00067847705,0.00059697364,0.00022167756,0.00071947987,0.00076880626,0.0037178604,0.00006738146],"category_scores_gemma":[0.0013762872,0.0010138141,0.00028368057,0.00092817226,0.00018405913,0.0003436355,0.00028359675,0.0047038365,0.00006581329],"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.0000589906,0.00024921852,0.010238535,0.0004268943,0.00015670106,0.000050797225,0.0014718015,0.91104406,0.0036404866,0.055953745,0.005567335,0.0111414185],"study_design_scores_gemma":[0.0006382668,0.00007664156,0.038984396,0.0012672457,0.00023907417,0.00094616716,0.00038791142,0.9010108,0.016623976,0.004597895,0.033880644,0.0013469934],"about_ca_topic_score_codex":0.003886365,"about_ca_topic_score_gemma":0.0002814632,"teacher_disagreement_score":0.27566752,"about_ca_system_score_codex":0.0024837507,"about_ca_system_score_gemma":0.0011889318,"threshold_uncertainty_score":0.9992312},"labels":[],"label_agreement":null},{"id":"W3119253730","doi":"10.1007/s12351-020-00617-y","title":"Transfer lines with multi-machine stages and non-deterministic processing time: transient performance analysis and control","year":2021,"lang":"en","type":"article","venue":"Operational Research","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 Calgary","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transient (computer programming); Production line; Production control; Transfer function; Computational intelligence; Transfer line; Finite-state machine; Transient state; Production (economics); State (computer science); Control engineering; Control theory (sociology); Artificial intelligence; Control (management); Industrial engineering; Algorithm; Engineering","score_opus":0.019602477390361077,"score_gpt":0.29600619389925936,"score_spread":0.2764037165088983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119253730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6992967,0.0008256767,0.29918295,0.00034994038,0.000011078604,0.00013136634,0.000036560956,0.00003275532,0.00013293113],"genre_scores_gemma":[0.97575164,0.00022188616,0.02333638,0.000030786978,0.000024760267,0.000027558594,0.00005487106,0.000014524819,0.00053756475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992008,0.000039163362,0.0001225947,0.00018311675,0.0002940731,0.00016023767],"domain_scores_gemma":[0.9994275,0.00009100498,0.0000033539645,0.000071237766,0.00032375933,0.000083137114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028081425,0.00008698612,0.00013943964,0.00014241248,0.00021253353,0.00018166506,0.000038295882,0.000037056816,0.00008208769],"category_scores_gemma":[0.00003224598,0.0000707072,0.000014734722,0.000458137,0.00007311269,0.00016532162,0.000006272874,0.00016420521,0.0000035998303],"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.00006566533,0.00007208522,0.009688229,0.00021652266,0.00027844124,0.00002891398,0.00092348695,0.9608708,0.014176257,0.000015848744,0.000007193605,0.01365654],"study_design_scores_gemma":[0.0007311945,0.00004406774,0.015938297,0.000027412154,0.000047309302,0.000008849389,0.000049074893,0.9802831,0.0027383105,4.2699438e-7,0.000039790677,0.00009220635],"about_ca_topic_score_codex":0.000004804847,"about_ca_topic_score_gemma":0.000026202973,"teacher_disagreement_score":0.27645496,"about_ca_system_score_codex":0.000014317026,"about_ca_system_score_gemma":0.00008281852,"threshold_uncertainty_score":0.28833562},"labels":[],"label_agreement":null},{"id":"W3120436791","doi":"10.1109/iscmi51676.2020.9311554","title":"Discriminating and Clustering Ordered Permutations Using Neural Network and Potential Applications in Neural Network-Guided Metaheuristics","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Science and Engineering Research Council","keywords":"Adaptive resonance theory; Artificial neural network; Metaheuristic; Computer science; Cluster analysis; Binary number; Permutation (music); Homogeneity (statistics); Scheduling (production processes); Artificial intelligence; Genetic algorithm; Algorithm; Pattern recognition (psychology); Mathematical optimization; Machine learning; Mathematics","score_opus":0.03020038394640552,"score_gpt":0.25830133532318617,"score_spread":0.22810095137678066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120436791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22647007,0.00058438216,0.7717532,0.00029566517,0.00015818268,0.00026619897,0.000005304158,0.0002702635,0.00019673973],"genre_scores_gemma":[0.81848395,0.00003466363,0.18099174,0.00013425175,0.0002773851,0.000013943437,0.000024986373,0.00003179834,0.0000072901503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909,0.000031470256,0.00030659247,0.00021453135,0.00008772728,0.0002696813],"domain_scores_gemma":[0.9996498,0.000066789056,0.000036799986,0.00008349656,0.000035523317,0.0001275739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007077711,0.00016081473,0.00018808039,0.00004127216,0.00018608254,0.00012719897,0.000065864406,0.000056381945,0.000013185963],"category_scores_gemma":[0.000033219363,0.00016709481,0.000024569052,0.00036177033,0.000035321318,0.00013843247,0.00007423539,0.00017349987,5.981121e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020075902,0.0000034051584,0.0014405303,0.00003361282,0.000012195448,0.000003050339,0.00032608557,0.99615145,0.00004996451,0.0001294105,0.000032472948,0.0018158382],"study_design_scores_gemma":[0.00029295083,0.000008909086,0.001708513,0.000010971199,0.000045694153,0.000017860784,0.00039799354,0.9972432,0.00000552132,0.00006762431,0.000020706506,0.00018001047],"about_ca_topic_score_codex":0.000022021184,"about_ca_topic_score_gemma":0.000026613212,"teacher_disagreement_score":0.5920139,"about_ca_system_score_codex":0.000015742644,"about_ca_system_score_gemma":0.000007681836,"threshold_uncertainty_score":0.6813929},"labels":[],"label_agreement":null},{"id":"W3122555565","doi":"","title":"Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems","year":2008,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Absolute deviation; Mean flow; Mathematics; Equivalence (formal languages); Absolute (philosophy); Standard deviation; Least absolute deviations; Weighted arithmetic mean; Mean value; Statistics; Applied mathematics; Discrete mathematics; Thermodynamics; Physics","score_opus":0.01949067312454119,"score_gpt":0.19926247388460178,"score_spread":0.17977180076006058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122555565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35119346,0.0014596853,0.62561744,0.00014788663,0.00033877182,0.0007052304,0.000016760574,0.0013812995,0.019139443],"genre_scores_gemma":[0.78005177,0.00050558656,0.21763888,0.000026903803,0.000057083504,0.0000157796,0.000021282112,0.000038868144,0.0016438441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934846,0.000010586648,0.00022148817,0.00012812327,0.00014611786,0.00014525064],"domain_scores_gemma":[0.9996915,0.000022381211,0.000032865133,0.00012720273,0.000066762965,0.00005930506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012250079,0.000103524515,0.0001338657,0.000067384375,0.000046930454,0.000011342625,0.00006947867,0.00005614695,0.00012266304],"category_scores_gemma":[0.000012967781,0.00009677816,0.000024135015,0.00016306569,0.0000363591,0.0001371928,0.00001704117,0.00006350878,0.00004281376],"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.0000018063018,0.000020073961,0.0003306672,0.00013216147,0.000030746764,0.0000010393494,0.0023836931,0.99029225,0.0031416786,0.00008245047,0.00025029443,0.0033331413],"study_design_scores_gemma":[0.00023786674,0.00002586431,0.0005377019,0.000041821477,0.000008012943,0.0000134542,0.000018121062,0.99649704,0.0023059486,0.000076233126,0.00010797434,0.00012998524],"about_ca_topic_score_codex":0.000013771574,"about_ca_topic_score_gemma":0.000008420393,"teacher_disagreement_score":0.4288583,"about_ca_system_score_codex":0.000016842092,"about_ca_system_score_gemma":0.000009653629,"threshold_uncertainty_score":0.3946499},"labels":[],"label_agreement":null},{"id":"W3123394298","doi":"","title":"Stability of Real-Time Lot-Scheduling and Machine Replacement Policies with Quality Levels","year":2009,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Scheduling (production processes); Computer science; Stability (learning theory); Markov chain; Quality (philosophy); Mathematical optimization; Work in process; Industrial engineering; Real-time computing; Engineering; Operations management; Mathematics; Machine learning","score_opus":0.028517886811215722,"score_gpt":0.26842839924923634,"score_spread":0.2399105124380206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123394298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88549495,0.00008951294,0.10641481,0.00019269767,0.000023376519,0.00011976404,0.00001570147,0.0003069798,0.007342191],"genre_scores_gemma":[0.8113534,0.000034535395,0.18844177,0.00003914657,0.000015172148,0.0000015039723,0.000006236865,0.0000095936275,0.000098678865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927217,0.000025475696,0.00027113274,0.00014321382,0.00014465478,0.00014336647],"domain_scores_gemma":[0.9995562,0.000051118877,0.000039050577,0.0002255178,0.000060503666,0.00006763967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034271207,0.00011758165,0.00020169262,0.00004189879,0.00003262688,0.000018467286,0.000052280724,0.000041332227,0.00016879766],"category_scores_gemma":[0.000032598087,0.000094084986,0.000020256492,0.00013149461,0.000034926834,0.00007249171,0.000010848039,0.00006574696,0.0000026963746],"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.0005185981,0.0005208887,0.041813504,0.0006159114,0.00034356557,0.0000041935905,0.00882311,0.8180639,0.09384425,0.011309028,0.00013533063,0.02400768],"study_design_scores_gemma":[0.0016155326,0.00038925424,0.07140711,0.00006304828,0.000036463807,0.000008536479,0.0006692653,0.8256891,0.099270046,0.0002940649,0.00003226431,0.0005253395],"about_ca_topic_score_codex":0.00014697609,"about_ca_topic_score_gemma":0.000015424974,"teacher_disagreement_score":0.08202695,"about_ca_system_score_codex":0.000026737462,"about_ca_system_score_gemma":0.000012861554,"threshold_uncertainty_score":0.38366744},"labels":[],"label_agreement":null},{"id":"W3123698205","doi":"","title":"An Efficient Heuristic for Adaptive Production Scheduling and Control in One-of-a-Kind Production","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Computer science; Scheduling (production processes); Flow shop scheduling; Production control; Heuristic; Dynamic priority scheduling; Production planning; Mathematical optimization; Production (economics); Industrial engineering; Distributed computing; Operations research; Engineering; Artificial intelligence; Mathematics; Economics; Schedule","score_opus":0.016931282663085724,"score_gpt":0.22039843142285,"score_spread":0.2034671487597643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123698205","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52898264,0.00077294547,0.4696293,0.000031861597,0.000306168,0.00021819065,7.621731e-7,0.000036550166,0.000021606238],"genre_scores_gemma":[0.9712306,0.00031420577,0.028154809,0.0000035693372,0.00024271704,0.000014947669,0.0000015386285,0.000023609497,0.000014005509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988586,0.000034957993,0.0002479313,0.00015992153,0.000101098994,0.00059751864],"domain_scores_gemma":[0.9996565,0.0000145933745,0.00007699758,0.00008837187,0.0001196934,0.00004386475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009918746,0.000101189915,0.00014935456,0.00017121238,0.000068863555,0.000012550752,0.00006278135,0.000054699598,0.0000028390316],"category_scores_gemma":[0.00010803327,0.000103482016,0.0000273507,0.00015183736,0.000027155897,0.000119017706,0.0000029032287,0.00049541204,7.0013675e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025293147,0.00017367884,0.0007592258,0.000028727303,0.000102389036,4.3629157e-7,0.0015308998,0.9768236,0.0020079373,0.00403777,9.690729e-7,0.014281387],"study_design_scores_gemma":[0.0014023287,0.0007130322,0.0012016875,0.00008672875,0.0000746928,0.000118263284,0.003138356,0.9723026,0.0066547003,0.0140650375,0.0000025479337,0.00024001967],"about_ca_topic_score_codex":0.0000075560997,"about_ca_topic_score_gemma":0.00008142895,"teacher_disagreement_score":0.442248,"about_ca_system_score_codex":0.00021342872,"about_ca_system_score_gemma":0.00019555715,"threshold_uncertainty_score":0.4219874},"labels":[],"label_agreement":null},{"id":"W3124850851","doi":"10.1007/s10107-002-0328-8","title":"Easy and difficult objective functions for max cut","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Scheduling and Optimization Algorithms","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":"University of British Columbia","funders":"","keywords":"Orthant; Mathematics; Combinatorics; Maximum cut; Function (biology); Sign (mathematics); Matching (statistics); Key (lock); Boundary (topology); Basis (linear algebra); Discrete mathematics; Graph; Mathematical analysis; Computer science; Statistics; Geometry","score_opus":0.013496768250500078,"score_gpt":0.23187260126534254,"score_spread":0.21837583301484245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124850851","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065141143,0.00013603849,0.9873355,0.000023788758,0.0001283554,0.0003574157,0.0000025633594,0.00040655656,0.00509564],"genre_scores_gemma":[0.24695954,0.000004957028,0.75187325,0.000018794317,0.00005676493,0.00024962763,0.000008056129,0.000044448792,0.000784574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945235,0.000009904126,0.00014621668,0.00012077151,0.00007323346,0.00019754526],"domain_scores_gemma":[0.99963665,0.00013124649,0.000013591221,0.00008883876,0.000048709095,0.000080974605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012636605,0.00010415393,0.0001267968,0.00003581573,0.000095793075,0.000068716334,0.00003150747,0.00005829044,0.000036270194],"category_scores_gemma":[0.00029681087,0.00009169154,0.000037547303,0.00013488927,0.000031632324,0.00005056886,0.0000063205957,0.0000788471,0.000027502618],"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.000044036307,0.0011759141,0.0009857501,0.0035109858,0.00082470226,0.000016589247,0.008341586,0.08209219,0.0006334525,0.4151391,0.0016760975,0.48555958],"study_design_scores_gemma":[0.0012345612,0.00012536939,0.000060246384,0.00011532128,0.00012454775,0.00006894075,0.0021891396,0.9599948,0.0014787744,0.016060408,0.017935224,0.00061268127],"about_ca_topic_score_codex":2.598802e-7,"about_ca_topic_score_gemma":5.9922826e-7,"teacher_disagreement_score":0.8779026,"about_ca_system_score_codex":0.000020269981,"about_ca_system_score_gemma":0.000005806132,"threshold_uncertainty_score":0.37390724},"labels":[],"label_agreement":null},{"id":"W3125887347","doi":"10.2139/ssrn.1126466","title":"Computational Evaluation of Hierarchical Production Control Policies for Stochastic Manufacturing Systems","year":2008,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"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":"Heuristics; Kanban; Mathematical optimization; Holding cost; Time horizon; Boundary (topology); Economic shortage; Computer science; Control (management); Optimal control; Production (economics); Mathematics; Control theory (sociology); Economics; Artificial intelligence; Microeconomics","score_opus":0.016260209343070153,"score_gpt":0.2490960208390205,"score_spread":0.23283581149595034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125887347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27607462,0.000996298,0.72210443,0.000081453014,0.0004232493,0.00024413918,0.0000037499922,0.00004749715,0.000024558329],"genre_scores_gemma":[0.99724096,0.0000925316,0.00214046,0.000004675903,0.0004254991,0.000025546096,0.000010945252,0.00002034221,0.00003901439],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986551,0.000051877232,0.00027357455,0.000088378656,0.00037252664,0.0005585401],"domain_scores_gemma":[0.9995288,0.00006504991,0.00007871896,0.000059952472,0.00022929389,0.000038145386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012066225,0.00009049617,0.0001426432,0.00014053904,0.00014673662,0.000014706913,0.00007039959,0.000045953977,0.0000030191077],"category_scores_gemma":[0.00010444753,0.00008898383,0.00005863458,0.00006995378,0.00003116098,0.00009460702,0.0000027620265,0.0003935642,0.0000016512417],"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.000018693501,0.000013878603,0.000024573756,0.000011575356,0.00009976592,6.736452e-8,0.00014020558,0.99506426,0.000048231628,0.0024086316,0.000015626043,0.0021544974],"study_design_scores_gemma":[0.0010814834,0.000071180926,0.00027152768,0.000019156732,0.000060484588,0.00038896603,0.00024908298,0.9851591,0.00016762817,0.012433701,0.000006016433,0.000091687994],"about_ca_topic_score_codex":0.00000512385,"about_ca_topic_score_gemma":0.0000041948997,"teacher_disagreement_score":0.7211664,"about_ca_system_score_codex":0.00044333047,"about_ca_system_score_gemma":0.00050464156,"threshold_uncertainty_score":0.3628655},"labels":[],"label_agreement":null},{"id":"W3127712221","doi":"10.1155/2021/6627081","title":"Two‐Agent Single Machine Order Acceptance Scheduling Problem to Maximize Net Revenue","year":2021,"lang":"en","type":"article","venue":"Complexity","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Computer science; Particle swarm optimization; Metaheuristic; Benchmark (surveying); Job shop scheduling; Scheduling (production processes); Heuristic; Integer programming; Mathematics; Schedule","score_opus":0.04472565511332127,"score_gpt":0.26558554247750293,"score_spread":0.22085988736418166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127712221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07834107,0.0019455728,0.9078094,0.0011379821,0.0012776054,0.00032176342,0.000119713346,0.00079663,0.008250288],"genre_scores_gemma":[0.17773432,0.000024253475,0.8210187,0.00043708886,0.00020617859,0.000020790278,0.00007471219,0.000047949332,0.00043602468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989587,0.000040508152,0.00025132642,0.00027743593,0.00017020684,0.00030183388],"domain_scores_gemma":[0.9992556,0.000029114311,0.00002892946,0.00036606015,0.00016132613,0.0001589553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012851227,0.00017442711,0.00022046929,0.000050450904,0.00011076336,0.000099117344,0.00018497775,0.00005141058,0.00058158033],"category_scores_gemma":[0.00011158568,0.00020016229,0.00005310751,0.0005568003,0.000027951091,0.00008285708,0.0000958626,0.00019959208,0.00017837466],"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.00000943052,0.00008162762,0.0003131821,0.00006915762,0.000050036037,0.000027111611,0.00035447645,0.98414165,0.0027942546,0.0007951487,0.0011662008,0.010197714],"study_design_scores_gemma":[0.001124276,0.00003478613,0.0010561198,0.00014487434,0.000023380027,0.000044248274,0.00015971332,0.9682991,0.009687539,0.0024221244,0.016358513,0.00064535654],"about_ca_topic_score_codex":0.000020982585,"about_ca_topic_score_gemma":0.000120245844,"teacher_disagreement_score":0.099393256,"about_ca_system_score_codex":0.000091693466,"about_ca_system_score_gemma":0.00003215867,"threshold_uncertainty_score":0.8162381},"labels":[],"label_agreement":null},{"id":"W3135903662","doi":"10.71781/10388","title":"On two sequential problems : the load planning and sequencing problem and the non-normal recurrent neural network","year":2020,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research","keywords":"Computer science; Artificial neural network; Recurrent neural network; Artificial intelligence","score_opus":0.02633359606859538,"score_gpt":0.2760927646103412,"score_spread":0.24975916854174585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135903662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7672525,0.01488409,0.0070084236,0.0017926559,0.008380434,0.011017993,0.00009240806,0.00014941885,0.18942206],"genre_scores_gemma":[0.95067716,0.00044240485,0.042497512,0.0002661295,0.0016637965,0.00045302475,0.001108621,0.0002453554,0.0026460069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988337,0.0000692274,0.0003077267,0.0003122911,0.00022105541,0.00025597008],"domain_scores_gemma":[0.99946696,0.00012291675,0.000122013626,0.00016562747,0.00004683877,0.00007566504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045886228,0.00028078255,0.00028445158,0.000026686386,0.00030405287,0.0006065283,0.00031376292,0.000113715716,0.00006415572],"category_scores_gemma":[0.000028190387,0.00018011812,0.00004285176,0.00015989221,0.000047343266,0.0001268605,0.000077650584,0.0006358333,0.000014519912],"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.00014293162,0.0000036182757,0.000019468958,0.00007715558,0.00009012397,0.000008458294,0.012795773,0.9479567,0.000024817917,0.00006934722,0.00027607474,0.03853556],"study_design_scores_gemma":[0.001394161,0.00005673483,0.000041539628,0.00058822206,0.00011969086,0.000017839802,0.0011914616,0.99462116,0.00015223147,0.00014007777,0.0013541478,0.00032271422],"about_ca_topic_score_codex":0.000039259532,"about_ca_topic_score_gemma":0.0000892947,"teacher_disagreement_score":0.18677604,"about_ca_system_score_codex":0.000053773747,"about_ca_system_score_gemma":0.000088923014,"threshold_uncertainty_score":0.73450035},"labels":[],"label_agreement":null},{"id":"W3136819740","doi":"10.5555/1161734.3259856","title":"Session details: Manufacturing applications: manufacturing systems control","year":2004,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Session (web analytics); Computer science; Manufacturing engineering; Engineering; World Wide Web","score_opus":0.016982272564519788,"score_gpt":0.24419320077717563,"score_spread":0.22721092821265584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136819740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03792405,0.00013598491,0.9591579,0.00005340244,0.00043482994,0.00039077285,0.000008941627,0.0006803275,0.00121378],"genre_scores_gemma":[0.9930334,0.000014648279,0.006460874,0.000054198146,0.0001837236,0.00008917118,0.0000250652,0.00003374778,0.00010514348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899906,0.000021286332,0.0003344273,0.00023675554,0.00018582917,0.00022266855],"domain_scores_gemma":[0.9994206,0.0000726225,0.000062721985,0.00026886046,0.00007828069,0.0000969301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009470761,0.00019478396,0.00018155877,0.00012094217,0.00010623211,0.0001832084,0.00016958044,0.000105573265,0.00008729761],"category_scores_gemma":[0.000010444193,0.00019293313,0.000050832758,0.00006188293,0.000021925542,0.00028960485,0.000018140476,0.00016948466,0.00018433892],"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.000005154688,0.000010158544,0.000049513037,0.0000434831,0.000021314518,0.0000013767138,0.00013562808,0.9931121,0.00011668462,0.00022384721,0.0000035386784,0.0062772026],"study_design_scores_gemma":[0.00092451985,0.00001114423,0.00046493448,0.00012976895,0.000017305083,0.000004753721,0.00015068165,0.9850152,0.011464917,0.0002796167,0.0012839019,0.00025321863],"about_ca_topic_score_codex":0.000008211485,"about_ca_topic_score_gemma":0.0000025939164,"teacher_disagreement_score":0.95510936,"about_ca_system_score_codex":0.00011147138,"about_ca_system_score_gemma":0.000019640922,"threshold_uncertainty_score":0.7867585},"labels":[],"label_agreement":null},{"id":"W3136973407","doi":"10.1145/3258235","title":"Session details: Microarchitectures and scheduling","year":2010,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Session (web analytics); Computer science; Scheduling (production processes); Computer architecture; Parallel computing; World Wide Web; Engineering; Operations management","score_opus":0.0061259984395316295,"score_gpt":0.2169500138820714,"score_spread":0.21082401544253979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136973407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88277847,0.00017092505,0.112540945,0.00008283494,0.00039193744,0.000037977847,6.37553e-7,0.00045833623,0.0035379592],"genre_scores_gemma":[0.62618995,0.000014950034,0.37358892,0.00004314288,0.000065261396,9.259632e-7,0.0000015220062,0.000011597268,0.00008375441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997074,0.0000033942956,0.000069184454,0.0000788561,0.000043833876,0.00009735744],"domain_scores_gemma":[0.9998177,0.000023080085,0.000005403816,0.00008304663,0.000013111778,0.0000576172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000053483367,0.00006623252,0.00005387624,0.00004671016,0.000043558317,0.000040758576,0.0000416701,0.0000570418,0.00012578879],"category_scores_gemma":[0.000023332284,0.000054720815,0.000012549648,0.00005810167,0.000020158575,0.00004045324,0.000012704599,0.00017632055,0.000016761573],"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.0000061645947,0.000021249874,0.003698561,0.00007171788,0.000038255937,0.0000052299415,0.00069027045,0.50001454,0.32489815,0.0015335785,0.00024525466,0.16877702],"study_design_scores_gemma":[0.00019309187,0.000005096298,0.0006891204,0.000008528379,0.0000048125976,0.000021119236,0.00007530072,0.95010346,0.047745854,0.00018872402,0.0008195749,0.00014534096],"about_ca_topic_score_codex":0.000002961855,"about_ca_topic_score_gemma":0.000009470823,"teacher_disagreement_score":0.4500889,"about_ca_system_score_codex":0.0000020965006,"about_ca_system_score_gemma":0.0000037425032,"threshold_uncertainty_score":0.22314501},"labels":[],"label_agreement":null},{"id":"W3136975880","doi":"10.1007/s12351-021-00629-2","title":"Modeling and solution methods for hybrid flow shop scheduling problem with job rejection","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"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 Windsor","funders":"","keywords":"Tardiness; Mathematical optimization; Computer science; Heuristics; Job shop scheduling; Flow shop scheduling; Computational intelligence; Integer programming; Scheduling (production processes); Pareto principle; Schedule; Mathematics; Artificial intelligence","score_opus":0.07102026708183304,"score_gpt":0.3806921119306955,"score_spread":0.30967184484886245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136975880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01869653,0.00057973986,0.97920924,0.00051329687,0.00008426298,0.000229976,0.000006573626,0.00007979855,0.0006005552],"genre_scores_gemma":[0.071471214,0.000119045326,0.92748624,0.000018886312,0.00017144921,0.00013871357,0.00009619386,0.00002887352,0.0004693678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897856,0.00010804229,0.0001557072,0.00023991991,0.00027597867,0.0002417707],"domain_scores_gemma":[0.9987688,0.0001771538,0.0000057014845,0.000106740714,0.0008640069,0.000077592646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012868046,0.000086348555,0.00009838233,0.00011768661,0.00047682913,0.00029507125,0.000049304537,0.00005256491,0.000035127006],"category_scores_gemma":[0.000287246,0.00008272113,0.000020797572,0.00027530626,0.000034530032,0.00022377644,0.000027264081,0.00024150268,0.0000045145853],"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.00001790872,0.000009475981,0.000016049991,0.000041160485,0.000022501943,0.0000012096485,0.00009699119,0.9781462,0.0048431726,0.00121067,0.000034827543,0.0155598475],"study_design_scores_gemma":[0.00034343178,0.000035366378,0.000006089957,0.000043160337,0.0000054771217,0.000027945165,0.00012270796,0.99060404,0.007954032,0.00048208743,0.0002710592,0.00010458353],"about_ca_topic_score_codex":0.000010349048,"about_ca_topic_score_gemma":0.000017598031,"teacher_disagreement_score":0.052774683,"about_ca_system_score_codex":0.00008726267,"about_ca_system_score_gemma":0.00021025611,"threshold_uncertainty_score":0.36674324},"labels":[],"label_agreement":null},{"id":"W3140968848","doi":"","title":"Proceedings - IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2010","year":2010,"lang":"en","type":"article","venue":"conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":49,"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; Field (mathematics); Embedded system; Mathematics","score_opus":0.011662850395258438,"score_gpt":0.22694485841897752,"score_spread":0.21528200802371908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140968848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8436363,0.000047343412,0.08102954,0.000976107,0.007516533,0.00038393366,0.0000074784252,0.00218446,0.06421831],"genre_scores_gemma":[0.96464205,0.000015209906,0.034128968,0.0001404488,0.00030143713,0.000009359195,0.000006733258,0.000028324066,0.0007274885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992549,0.0000034001637,0.00015744739,0.00019860343,0.00012917095,0.00025651694],"domain_scores_gemma":[0.99954665,0.0000456396,0.00003130793,0.00015914661,0.00011472306,0.00010251091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010600085,0.00015784446,0.00013469659,0.00006454116,0.00009285772,0.00016023772,0.00022653087,0.00013502408,0.00015921878],"category_scores_gemma":[0.00004383571,0.00015293123,0.00003368199,0.00014089845,0.000025930218,0.00009389816,0.000021279897,0.0005047731,0.00014178814],"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.000101473845,0.0004213453,0.016398493,0.00076694746,0.00022710479,0.000045957615,0.0054995143,0.23231703,0.20156105,0.033550933,0.042261865,0.4668483],"study_design_scores_gemma":[0.00023467584,0.000043253902,0.00029122597,0.000043039818,0.000008462509,0.000008880376,0.0000277122,0.9795993,0.016421698,0.00009794349,0.00298251,0.0002412892],"about_ca_topic_score_codex":0.000020978548,"about_ca_topic_score_gemma":0.000007887753,"teacher_disagreement_score":0.74728227,"about_ca_system_score_codex":0.000010711953,"about_ca_system_score_gemma":0.000020345644,"threshold_uncertainty_score":0.6236355},"labels":[],"label_agreement":null},{"id":"W3141402246","doi":"10.1109/wsc.2005.1574409","title":"Lot-sizing Within Capacity-Constrained Manufacturing Systems Using Time-phased Planning","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference, 2005.","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Capacity planning; Queueing theory; Computer science; Order (exchange); Production (economics); Build to order; Due date; Material requirements planning; Mathematical optimization; Operations research; Engineering; Industrial engineering; Operations management; Business; Mathematics; Economics; Queue; Finance","score_opus":0.025174397294466397,"score_gpt":0.23265441899350234,"score_spread":0.20748002169903595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141402246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90464866,0.00007779852,0.086374395,0.000028488957,0.00064341305,0.00031887798,0.000013074448,0.0003802342,0.00751504],"genre_scores_gemma":[0.98719364,5.002313e-7,0.0121803535,0.000011762892,0.00022469771,0.000005322308,0.000004861882,0.000040312105,0.00033855916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868774,0.0000090947715,0.00053804857,0.0002113143,0.0002716941,0.00028213387],"domain_scores_gemma":[0.9993304,0.00005394914,0.00023916356,0.00010573213,0.00021450642,0.00005625384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025072636,0.00023371127,0.00026595008,0.00019019004,0.00013491612,0.00020061055,0.00025471323,0.00012223519,0.0000469153],"category_scores_gemma":[0.000035807567,0.00020262614,0.000084887695,0.0001546374,0.0000709749,0.00034942199,0.000029381275,0.00021268932,0.000008765065],"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.000009193454,0.000011743501,0.00071054744,0.00008618019,0.00003203445,2.0008822e-7,0.00042097174,0.9815281,0.016843252,0.00025615093,0.000031649168,0.00006999666],"study_design_scores_gemma":[0.00041693661,0.000007913428,0.00022065405,0.00040821717,0.00003435159,0.0000083079685,0.00030270612,0.94749755,0.05064774,0.00013803263,0.00009824866,0.00021933658],"about_ca_topic_score_codex":0.000024191355,"about_ca_topic_score_gemma":8.230121e-7,"teacher_disagreement_score":0.08254495,"about_ca_system_score_codex":0.00008978091,"about_ca_system_score_gemma":0.000023034701,"threshold_uncertainty_score":0.82628536},"labels":[],"label_agreement":null},{"id":"W3142556707","doi":"10.1109/wsc.2010.5678889","title":"Dynamic adjustment of replenishment parameters using optimum-seeking simulation","year":2010,"lang":"en","type":"article","venue":"Proceedings of the 2010 Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Reorder point; Discrete event simulation; Heuristic; Supply chain; Computer science; Simulation-based optimization; Event (particle physics); Point (geometry); Mathematical optimization; Continuous simulation; Service level; Dynamic simulation; Operations research; Simulation; Economic order quantity; Engineering; Mathematics","score_opus":0.024406091638618756,"score_gpt":0.26477959635971454,"score_spread":0.24037350472109578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142556707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85901034,0.000015772117,0.13910465,0.000039351948,0.0011470852,0.00026194894,0.0000063253897,0.000093165494,0.0003213632],"genre_scores_gemma":[0.921298,0.0000032980167,0.07858039,0.000013766224,0.000028680204,0.000004748903,0.0000024907306,0.000022760607,0.000045825906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998953,0.000004903656,0.00044722005,0.00018092414,0.00025853715,0.00015544727],"domain_scores_gemma":[0.9989599,0.00008405453,0.00025919575,0.00017043411,0.00048210818,0.000044320353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019154923,0.0001577263,0.0001938597,0.00011180044,0.00005184245,0.000041807398,0.00027302996,0.000107999345,0.00006147255],"category_scores_gemma":[0.00014590674,0.00013505372,0.000089707035,0.00019049727,0.00007495633,0.00026592464,0.0000636829,0.00022547672,0.0000020524553],"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.000012164606,0.000017626844,0.0010783923,0.00005755133,0.000025954012,1.9540822e-8,0.00050484616,0.9517646,0.04478742,0.000099580124,0.0000042731735,0.0016475581],"study_design_scores_gemma":[0.00025628004,0.000019868921,0.0018088487,0.00012028501,0.000036188358,0.0000010343933,0.000118055046,0.977778,0.019499134,0.00021577235,0.0000135940645,0.00013290344],"about_ca_topic_score_codex":0.000007908485,"about_ca_topic_score_gemma":0.000002053356,"teacher_disagreement_score":0.0622877,"about_ca_system_score_codex":0.00004258969,"about_ca_system_score_gemma":0.000018681141,"threshold_uncertainty_score":0.5507331},"labels":[],"label_agreement":null},{"id":"W3142678045","doi":"10.1109/wsc.2008.4736277","title":"Clarifying CONWIP versus push system behavior using simulation","year":2008,"lang":"en","type":"article","venue":"2008 Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Workload; Computer science; Throughput; Real-time computing; Control system; Simulation; Reliability engineering; Industrial engineering; Engineering; Operating system","score_opus":0.10276568970212195,"score_gpt":0.30053527491144455,"score_spread":0.19776958520932258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142678045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171684,0.00006435696,0.67941785,0.0000049575206,0.0013029379,0.00020330245,0.000008897747,0.0006435137,0.0011857701],"genre_scores_gemma":[0.981926,0.0000070272113,0.01767108,0.000015952326,0.00019177362,0.00001152602,0.000037907008,0.00004401546,0.00009472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988271,0.00004039612,0.0003888391,0.00024434563,0.0002508495,0.00024846],"domain_scores_gemma":[0.9991378,0.00015606452,0.0000776591,0.00024979524,0.0002774553,0.00010121876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083097184,0.00022043216,0.00021545765,0.00012401002,0.00019032089,0.00007387321,0.00013214894,0.00017521251,0.00016196918],"category_scores_gemma":[0.00005086596,0.00024148685,0.00007177953,0.00022326485,0.00004486399,0.00036085368,0.00002317787,0.00020453629,0.000110679175],"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.000023926454,0.000012343157,0.001499362,0.00002182825,0.000019460173,0.000011720076,0.00037052092,0.996902,0.00012130647,0.000054375105,0.000012192249,0.0009509888],"study_design_scores_gemma":[0.0008962526,0.000020412841,0.0012188285,0.00006223947,0.00003608829,0.000011471454,0.0001233084,0.99687374,0.00029922332,0.0000017614229,0.00019313834,0.00026355856],"about_ca_topic_score_codex":0.000008285324,"about_ca_topic_score_gemma":0.0000029807754,"teacher_disagreement_score":0.6647576,"about_ca_system_score_codex":0.00016960189,"about_ca_system_score_gemma":0.000043122654,"threshold_uncertainty_score":0.9847548},"labels":[],"label_agreement":null},{"id":"W3145135333","doi":"10.1109/wsc.2008.4736347","title":"A framework for simulating industrial construction processes","year":2008,"lang":"en","type":"article","venue":"2008 Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fabrication; Process (computing); Computer science; Manufacturing engineering; Product (mathematics); Raw material; Solid modeling; Process engineering; Engineering drawing; Systems engineering; Mechanical engineering; Engineering","score_opus":0.08203049379933161,"score_gpt":0.2904476750403483,"score_spread":0.20841718124101669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145135333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06129451,0.000038710863,0.93679535,0.000042755197,0.0006935481,0.0002407173,0.000013506732,0.00042986585,0.0004510581],"genre_scores_gemma":[0.8168363,0.000010644806,0.18262874,0.000035280456,0.0003589816,0.000021395459,0.00002584724,0.000022976152,0.000059851256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992214,0.000013334638,0.00027610402,0.00017803462,0.00013072859,0.00018042269],"domain_scores_gemma":[0.9990428,0.00038564234,0.00006038116,0.00012814507,0.00032187035,0.000061151586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000054517277,0.00014352563,0.00015150181,0.00008736614,0.00014099262,0.000049337727,0.00008999527,0.00016373512,0.00015215346],"category_scores_gemma":[0.0006045074,0.00015377408,0.000040812734,0.00023540019,0.000051420382,0.00021796451,0.000010284592,0.00015918663,0.000018842213],"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.000018257619,0.000008764839,0.0014503222,0.000025931722,0.000016533038,7.084258e-7,0.00057659997,0.9909457,0.000009630393,0.000441565,0.000065156826,0.006440845],"study_design_scores_gemma":[0.00053505856,0.000027139107,0.000094784475,0.000080196194,0.000008968095,0.000006460326,0.000094523064,0.9965366,0.0005908989,0.0010867594,0.00075318245,0.00018541767],"about_ca_topic_score_codex":0.000001408405,"about_ca_topic_score_gemma":0.0000011483536,"teacher_disagreement_score":0.7555418,"about_ca_system_score_codex":0.00003093773,"about_ca_system_score_gemma":0.00007186424,"threshold_uncertainty_score":0.62707245},"labels":[],"label_agreement":null},{"id":"W3146252962","doi":"","title":"NEW NONSTANDARD JOB SHOP SCHEDULING ALGORITHM","year":2008,"lang":"en","type":"article","venue":"机械工程学报(英文版)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Flow shop scheduling; Mathematical optimization; Computer science; Rate-monotonic scheduling; Scheduling (production processes); Dynamic priority scheduling; Job shop scheduling; Fair-share scheduling; Least slack time scheduling; Mathematics; Schedule","score_opus":0.013923426696545116,"score_gpt":0.22071838121243503,"score_spread":0.20679495451588992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146252962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022267608,0.0013892659,0.95915455,0.00014822808,0.0014805344,0.0001440935,0.000019910502,0.0013480677,0.014047773],"genre_scores_gemma":[0.05086882,0.00047688565,0.94468385,0.00015719875,0.0009310446,0.000012133328,0.00003076285,0.0001131807,0.0027261341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985964,0.000018493505,0.0003234432,0.0002789235,0.0003445222,0.00043824545],"domain_scores_gemma":[0.99919415,0.00004947673,0.000033612298,0.00034553726,0.000085787,0.0002914594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013078298,0.0002652878,0.00027235743,0.00015669834,0.00019727748,0.000060899296,0.00023365335,0.00016734524,0.0005441808],"category_scores_gemma":[0.000051407693,0.0002815909,0.000114418755,0.00043320344,0.000046886576,0.00020135724,0.000037976697,0.00032164674,0.00046098957],"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.000019355957,0.000046862468,0.0019554612,0.000042604406,0.00019964494,0.00020679198,0.0032816667,0.73099524,0.00043975408,0.00050744583,0.018948967,0.24335623],"study_design_scores_gemma":[0.0010860827,0.00003738611,0.0003988824,0.00006242621,0.00002770241,0.00014968544,0.00033693743,0.9833767,0.003086631,0.000059652542,0.010798007,0.00057991245],"about_ca_topic_score_codex":0.000036799585,"about_ca_topic_score_gemma":0.000009427808,"teacher_disagreement_score":0.25238147,"about_ca_system_score_codex":0.000091358976,"about_ca_system_score_gemma":0.00010792017,"threshold_uncertainty_score":0.99996364},"labels":[],"label_agreement":null},{"id":"W3146911139","doi":"10.1109/wsc.2006.322987","title":"Optimal Control of Make-To-Order Manufacturing Systems via Selected Order Acceptance","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Public Health Agency of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Build to order; Testbed; Order (exchange); Computer science; Control (management); Set (abstract data type); Control system; Manufacturing engineering; Operations research; Engineering; Production (economics); Business; Job shop scheduling; Computer network; Artificial intelligence; Economics","score_opus":0.003991012014197651,"score_gpt":0.19232875587081452,"score_spread":0.18833774385661686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3146911139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08309534,0.00020215778,0.9119526,0.000028699345,0.00035196674,0.00022136679,0.000007482528,0.00049653766,0.0036438045],"genre_scores_gemma":[0.82428044,0.000003617355,0.17474714,0.000029110835,0.00011888358,0.000021778935,0.000011424345,0.000037914742,0.0007496656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990838,0.000015302534,0.0003121837,0.00016037837,0.00016738672,0.00026091028],"domain_scores_gemma":[0.999484,0.0000371119,0.000035004552,0.00017873665,0.00020321619,0.00006195545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007052719,0.00016046723,0.00022821783,0.00010869387,0.000034516637,0.000041030016,0.00012288465,0.000087130466,0.00018596713],"category_scores_gemma":[0.000016917187,0.0001533595,0.000028275757,0.00040437788,0.000011816912,0.000060754934,0.000010660213,0.00009976547,0.000051337298],"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.00000772811,0.000014029829,0.00017444644,0.00003254547,0.00004003234,0.0000015506439,0.000022470005,0.99736315,0.0014465658,0.000057302615,0.0001835626,0.00065660523],"study_design_scores_gemma":[0.0006635745,0.000016625509,0.0012829492,0.00001747828,0.0000150146725,0.0000064972087,0.00003512033,0.97738975,0.019970741,0.0000027276635,0.0003941641,0.00020534101],"about_ca_topic_score_codex":0.00010034056,"about_ca_topic_score_gemma":0.000016221333,"teacher_disagreement_score":0.7411851,"about_ca_system_score_codex":0.00003601478,"about_ca_system_score_gemma":0.000013810304,"threshold_uncertainty_score":0.62538195},"labels":[],"label_agreement":null},{"id":"W3147272045","doi":"","title":"MOParamILS:une plateforme multi-objectif pour la configuration automatique d'algorithmes","year":2016,"lang":"fr","type":"preprint","venue":"LillOA (Université de Lille (University Of Lille))","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Humanities; Computer science; Philosophy","score_opus":0.009232873197904582,"score_gpt":0.1916536389070821,"score_spread":0.1824207657091775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147272045","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14850219,0.0011544713,0.7688628,0.008503146,0.0018603747,0.0010788981,0.0008184165,0.0013808559,0.06783887],"genre_scores_gemma":[0.31076926,0.0060422746,0.5561929,0.00013249287,0.00044424934,0.000004476458,0.00056948315,0.00031416657,0.12553069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996378,0.000389469,0.00054553803,0.0010846629,0.00059948926,0.0010028279],"domain_scores_gemma":[0.9965373,0.00047075612,0.0007621634,0.00094909815,0.00065532804,0.00062533317],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005321524,0.00095371477,0.0012418581,0.00085530506,0.00089804304,0.00008053749,0.0012431801,0.001869427,0.0019260724],"category_scores_gemma":[0.00009353383,0.0012362925,0.00075455284,0.0008167112,0.0005626284,0.00081019563,0.00094972854,0.0011165991,0.00066454726],"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.0013225129,0.0017029153,0.004900232,0.003534287,0.00695836,0.003170998,0.11183831,0.6463685,0.021371318,0.06467906,0.018250624,0.1159029],"study_design_scores_gemma":[0.007839579,0.00020325746,0.019174175,0.0015360827,0.00081558176,0.0002895163,0.02369226,0.9108582,0.0037321462,0.0009197152,0.028515808,0.0024236536],"about_ca_topic_score_codex":0.003392056,"about_ca_topic_score_gemma":0.000983074,"teacher_disagreement_score":0.26448974,"about_ca_system_score_codex":0.0021261445,"about_ca_system_score_gemma":0.0005715016,"threshold_uncertainty_score":0.99942636},"labels":[],"label_agreement":null},{"id":"W3150443833","doi":"","title":"An Effective and Efficient Heuristic for N-Wait Flow Shop Production to Minimize Total Completion Time","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Flow shop scheduling; Mathematical optimization; Computation; Computer science; Scheduling (production processes); Heuristic; Idle; Minification; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.0038222837417250994,"score_gpt":0.2099738247091343,"score_spread":0.2061515409674092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150443833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3383717,0.00018051662,0.6605258,0.00023625218,0.00031609053,0.000258864,0.0000055717082,0.00008959637,0.000015618898],"genre_scores_gemma":[0.97822773,0.00009185468,0.020706164,0.000013125608,0.0005844202,0.00003964161,0.0000070782803,0.000039745333,0.0002902586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987855,0.000037595586,0.00015527604,0.0001775146,0.00011846101,0.0007256802],"domain_scores_gemma":[0.9996122,0.000065122906,0.000029906314,0.00009320353,0.00009605895,0.00010352248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006214856,0.00012247579,0.00013472963,0.00010468079,0.00012496073,0.000039710005,0.000060274066,0.0000461696,0.000012435641],"category_scores_gemma":[0.00013139384,0.00009452281,0.000038416158,0.00009888231,0.000016811215,0.00008047498,0.000006611782,0.0002212907,0.000025302932],"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.0002145586,0.00007677349,0.00008197701,0.000020258447,0.00012865303,8.101769e-7,0.0003718853,0.8043889,0.016893892,0.00084236293,0.00012370085,0.17685622],"study_design_scores_gemma":[0.0013421174,0.0006355694,0.0010681051,0.00006220912,0.00005090061,0.00035054117,0.0001792144,0.9922726,0.0019622727,0.00170725,0.000076284065,0.00029291346],"about_ca_topic_score_codex":8.804203e-7,"about_ca_topic_score_gemma":0.0000037628038,"teacher_disagreement_score":0.63985604,"about_ca_system_score_codex":0.0004272005,"about_ca_system_score_gemma":0.00006888919,"threshold_uncertainty_score":0.38545284},"labels":[],"label_agreement":null},{"id":"W3153956244","doi":"10.5267/j.ijiec.2021.1.004","title":"A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Flow shop scheduling; Computer science; Mathematical optimization; Job shop scheduling; Scheduling (production processes); Sequence (biology); Heuristic; Due date; Blocking (statistics); Schedule; Mathematics","score_opus":0.044840478383690145,"score_gpt":0.2850856912536375,"score_spread":0.24024521286994732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153956244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011470909,0.00021981154,0.9859252,0.0004252664,0.0014971319,0.00023549552,0.00010927206,0.000040675448,0.000076220334],"genre_scores_gemma":[0.64152783,0.000014467975,0.3578916,0.0000119168135,0.00044266367,0.000016270818,0.00006587024,0.000022587308,0.000006773796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983625,0.000038996895,0.0005648997,0.00010165134,0.0008145835,0.00011738762],"domain_scores_gemma":[0.99575895,0.0007244836,0.00023271258,0.00007327111,0.0031574962,0.000053090545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005087847,0.00013535791,0.00019652594,0.00018333895,0.00005923323,0.00008823062,0.00021366862,0.00007325054,0.000034352157],"category_scores_gemma":[0.00041712442,0.00011334643,0.00009345279,0.00022956716,0.000041748608,0.00014416645,0.000020058378,0.00026365704,7.110249e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029062994,0.000029112367,0.00008206011,0.000008585831,0.00063769217,0.0000076129863,0.00025223862,0.98956364,0.00004609031,0.0010435474,0.00011460061,0.008185779],"study_design_scores_gemma":[0.0022105833,0.000045873177,0.00005408815,0.00018441115,0.00018055103,0.0002620665,0.00025689663,0.9955254,0.00036445967,0.00071270374,0.000086627406,0.00011633926],"about_ca_topic_score_codex":0.000002099501,"about_ca_topic_score_gemma":0.0000015497297,"teacher_disagreement_score":0.630057,"about_ca_system_score_codex":0.000178078,"about_ca_system_score_gemma":0.00048546988,"threshold_uncertainty_score":0.46221334},"labels":[],"label_agreement":null},{"id":"W3155015670","doi":"10.5267/j.ijiec.2021.3.002","title":"Two meta-heuristic algorithms for optimizing a multi-objective supply chain scheduling problem in an identical parallel machines environment","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Tardiness; Crossover; Computer science; Sorting; Particle swarm optimization; Genetic algorithm; Scheduling (production processes); Total cost; Multi-objective optimization; Algorithm; Job shop scheduling; Mathematics; Schedule; Artificial intelligence","score_opus":0.04832974622145165,"score_gpt":0.29695585828675786,"score_spread":0.24862611206530622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155015670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016247267,0.00042730029,0.9811266,0.00029155245,0.001576789,0.00019934484,0.000047888254,0.00007292488,0.0000103484845],"genre_scores_gemma":[0.22648813,0.000038823822,0.77263725,0.000020359412,0.00065949926,0.00003732224,0.00006516882,0.00004378603,0.000009676685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826354,0.000053890897,0.00087592023,0.00019802335,0.0003744768,0.00023412507],"domain_scores_gemma":[0.9988731,0.0003343932,0.00015917336,0.00009586978,0.00039367354,0.0001437558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044874282,0.00022728692,0.00039578223,0.00044982386,0.00004716402,0.0001772751,0.00027570888,0.000109879125,0.00003659835],"category_scores_gemma":[0.0003606137,0.00023846235,0.00022467547,0.00022028158,0.00001971057,0.0003500401,0.000039895083,0.0004872063,0.000002386207],"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.000022318553,0.00013152437,0.00014234739,0.000008306568,0.00074987963,0.000073275856,0.0003223931,0.99511987,0.00033342987,0.00048211057,0.000007949063,0.0026065933],"study_design_scores_gemma":[0.0031788575,0.00005313077,0.00012446096,0.0001046611,0.00018428614,0.00012781906,0.00016613604,0.99518615,0.0004146514,0.00019588367,0.000045546683,0.00021840553],"about_ca_topic_score_codex":0.000009601856,"about_ca_topic_score_gemma":0.000004497057,"teacher_disagreement_score":0.21024087,"about_ca_system_score_codex":0.00024828906,"about_ca_system_score_gemma":0.00011049347,"threshold_uncertainty_score":0.9724213},"labels":[],"label_agreement":null},{"id":"W3155323166","doi":"10.5267/j.ijiec.2021.3.001","title":"Customer order scheduling with job-based processing on a single-machine to minimize the total completion time","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mathematical optimization; Single-machine scheduling; Order processing; Job shop scheduling; Scheduling (production processes); Schedule; Industrial engineering; Operations research; Engineering; Mathematics; Marketing; Supply chain","score_opus":0.02112532165083318,"score_gpt":0.24267594473780443,"score_spread":0.22155062308697127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155323166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065408126,0.00007183684,0.9305363,0.002219799,0.0013485133,0.00009375956,0.000017615985,0.00011770439,0.00018631361],"genre_scores_gemma":[0.7664379,0.0000016103861,0.23236962,0.00018479247,0.00088201027,0.000005988242,0.00003355438,0.000046576217,0.000037988037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987242,0.000030256242,0.0004308805,0.00011921533,0.00053870794,0.00015674175],"domain_scores_gemma":[0.9984676,0.0002550132,0.00011281689,0.00009120606,0.0009647426,0.00010859973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001876379,0.00016983293,0.00019805969,0.0003165345,0.00007411782,0.00021277125,0.00021852326,0.00007209882,0.000056700144],"category_scores_gemma":[0.000363784,0.00013604772,0.00007372791,0.00059239595,0.000018098439,0.00013277601,0.00001955818,0.00043009993,0.000023238194],"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.000050400973,0.000056158355,0.000040750016,0.0000040463756,0.00012365301,0.00003447512,0.00011512089,0.9937973,0.0011664274,0.000049856877,0.00009626589,0.004465561],"study_design_scores_gemma":[0.0013495715,0.0000640605,0.0002467932,0.00036931256,0.000033985216,0.0001764379,0.00005104964,0.995542,0.0015724951,0.000003341866,0.00042496098,0.00016597837],"about_ca_topic_score_codex":0.0000020532777,"about_ca_topic_score_gemma":4.772818e-7,"teacher_disagreement_score":0.7010297,"about_ca_system_score_codex":0.00017415643,"about_ca_system_score_gemma":0.00017656539,"threshold_uncertainty_score":0.5547865},"labels":[],"label_agreement":null},{"id":"W3156695649","doi":"10.1111/poms.13439","title":"Planning Production and Equipment Qualification under High Process Flexibility","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada); University of British Columbia","funders":"Semiconductor Research Corporation","keywords":"Computer science; Flexibility (engineering); Schedule; Factory (object-oriented programming); Product (mathematics); Process (computing); Production (economics); Production schedule; Heuristic; Industrial engineering; Sequence (biology); Production planning; Mathematical optimization; Reliability engineering; Operations research; Scheduling (production processes); Artificial intelligence; Engineering","score_opus":0.029830608577644867,"score_gpt":0.2850685848001583,"score_spread":0.25523797622251343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156695649","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75702435,0.0016788743,0.227109,0.008695417,0.0022745011,0.00089674554,0.0000044893864,0.0007277565,0.001588894],"genre_scores_gemma":[0.96400833,0.00051415665,0.03336465,0.00007651117,0.00017959517,0.00011255292,0.000063663676,0.000015993292,0.0016645688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991617,0.00003198368,0.00019960997,0.000364082,0.00013274001,0.00010984161],"domain_scores_gemma":[0.9996056,0.00000402203,0.000016781363,0.00020240294,0.0001263242,0.00004488741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023144676,0.00010770766,0.000086272026,0.00008651105,0.0002504361,0.00013028113,0.000028692084,0.000032261018,0.00003157103],"category_scores_gemma":[0.000057767862,0.000113257796,0.00001038024,0.00026135327,0.000028671431,0.00026384776,0.000023580094,0.00007550588,0.0000063370817],"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.000004166655,0.00005453026,0.00016386445,0.00016310673,0.000044680655,7.60381e-7,0.000788056,0.9878937,0.00040733526,0.004136152,0.00019431654,0.006149324],"study_design_scores_gemma":[0.0010274244,0.00008081947,0.023487143,0.00042398938,0.00030491545,0.000104510735,0.02294464,0.8773548,0.06620144,0.0032828208,0.0034303423,0.0013571767],"about_ca_topic_score_codex":0.0000026708003,"about_ca_topic_score_gemma":0.000011652796,"teacher_disagreement_score":0.20698398,"about_ca_system_score_codex":0.000047548867,"about_ca_system_score_gemma":0.000010397685,"threshold_uncertainty_score":0.46185187},"labels":[],"label_agreement":null},{"id":"W3157433688","doi":"10.46298/dmtcs.8729","title":"Makespan Trade-offs for Visiting Triangle Edges","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.01200064964833383,"score_gpt":0.25756470903106093,"score_spread":0.2455640593827271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157433688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035089157,0.000055147455,0.9880272,0.0005062028,0.0005755419,0.0002594884,0.0000073170704,0.00034152926,0.006718643],"genre_scores_gemma":[0.43573108,0.0000027229728,0.56399584,0.000123221,0.00008811331,0.000019049836,0.0000029787193,0.000015410023,0.000021587244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987577,0.000016545502,0.0003243619,0.00027424068,0.0002422965,0.00038483262],"domain_scores_gemma":[0.9990453,0.0004272839,0.00003244933,0.00032178863,0.00006258467,0.0001105878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079674943,0.00016923295,0.0002482209,0.00016594747,0.0002592998,0.00029145868,0.0005345688,0.00005766145,0.000025380587],"category_scores_gemma":[0.00018982025,0.00014407773,0.000096772106,0.0006092688,0.0005614249,0.00011884069,0.00009244023,0.00011583501,0.000009482783],"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.000002228866,0.000022330245,0.0000031778627,0.00012021297,0.0000137748975,7.8130523e-7,0.00057236437,0.009859803,0.00024478577,0.9748295,0.00009477817,0.014236285],"study_design_scores_gemma":[0.00026032954,0.000027297485,0.000012955814,0.00011075804,0.000018874276,0.0000029794649,0.00011201965,0.9033693,0.004451147,0.09139927,0.00007628157,0.00015879463],"about_ca_topic_score_codex":1.0321014e-7,"about_ca_topic_score_gemma":7.186243e-8,"teacher_disagreement_score":0.8935095,"about_ca_system_score_codex":0.000035595815,"about_ca_system_score_gemma":0.00003703383,"threshold_uncertainty_score":0.5875319},"labels":[],"label_agreement":null},{"id":"W3159557419","doi":"10.18280/jesa.540209","title":"Developing a Multi-Stage Production Planning and Scheduling Model for a Small-Size Food and Beverage Company","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Production planning; Scheduling (production processes); Operations research; Profit maximization; Profit (economics); Capacity planning; Activity-based costing; Computer science; Integer programming; Product line; Linear programming; Maximization; Production (economics); Operations management; Business; Mathematical optimization; Marketing; Economics; Manufacturing engineering; Engineering; Microeconomics; Mathematics","score_opus":0.06528968929261637,"score_gpt":0.2812752195754127,"score_spread":0.21598553028279632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159557419","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40169102,0.0032421479,0.59439766,0.00006860968,0.00024114856,0.00011887993,0.000007480985,0.00021432564,0.000018726794],"genre_scores_gemma":[0.37320483,0.00026125647,0.6261263,0.000034163182,0.00010828769,0.000010664167,0.0000034997681,0.000049518847,0.00020149538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881905,0.000057207297,0.00043191662,0.00024555472,0.00014185392,0.00030443698],"domain_scores_gemma":[0.99929106,0.00012066974,0.00011803212,0.000115202616,0.00021117933,0.00014384343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035580865,0.00021800032,0.000296373,0.00011345995,0.00040881918,0.00037156802,0.00007785325,0.00008112172,0.000003902183],"category_scores_gemma":[0.0004850732,0.0002223432,0.000052925385,0.0001893727,0.000038364764,0.00027601537,0.000048024645,0.000258735,0.0000010588604],"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.0000076089295,0.000015654652,0.00074719975,0.0005120359,0.00013553447,0.000029440322,0.002549647,0.9727221,0.0015567885,0.0002063595,0.000018386485,0.021499252],"study_design_scores_gemma":[0.00078824186,0.000028462124,0.012244174,0.0005752257,0.0000342857,0.0008191465,0.0005426596,0.9832567,0.0010981554,0.00031443173,0.000026702235,0.0002718095],"about_ca_topic_score_codex":8.262994e-7,"about_ca_topic_score_gemma":0.0000060489815,"teacher_disagreement_score":0.03172864,"about_ca_system_score_codex":0.000106303356,"about_ca_system_score_gemma":0.00009210533,"threshold_uncertainty_score":0.9066892},"labels":[],"label_agreement":null},{"id":"W3160508408","doi":"10.1016/j.cie.2021.107387","title":"Minimizing total job completion time in MapReduce scheduling","year":2021,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"Shaanxi Provincial Science and Technology Department; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Flow shop scheduling; Computer science; Job shop scheduling; Scheduling (production processes); Upper and lower bounds; Approximation algorithm; Mathematical optimization; Execution time; Generalization; Algorithm; Parallel computing; Mathematics; Schedule","score_opus":0.02015169645104698,"score_gpt":0.20301847816804067,"score_spread":0.1828667817169937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160508408","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71047467,0.0004693487,0.2833355,0.00012857767,0.004088342,0.00016721415,0.000007717373,0.00096650224,0.00036214743],"genre_scores_gemma":[0.74147964,0.000024909179,0.25638697,0.000048065504,0.0016972641,0.000019573858,0.00010314091,0.0001255088,0.00011491367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987263,0.000027566392,0.000397044,0.00027472433,0.0001848905,0.00038948577],"domain_scores_gemma":[0.9994679,0.00012061735,0.000027801058,0.0002077223,0.000049890885,0.00012605332],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000177561,0.00023835945,0.00031696344,0.00022998473,0.000043729236,0.0001188444,0.00014400644,0.00021197773,0.00005878984],"category_scores_gemma":[0.00011088197,0.00031373702,0.000082249004,0.00063822785,0.000012102098,0.00017394498,0.00006675437,0.00050751865,0.000050034087],"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.00000344671,0.000012057053,0.00009670621,0.000017861254,0.000029149323,0.000042630003,0.00012390545,0.9897314,0.005664527,0.00004821276,0.0001302103,0.0040998994],"study_design_scores_gemma":[0.0009613785,0.00001059074,0.0003885965,0.00022329461,0.00000992941,0.00004738219,0.00004032657,0.99323064,0.004404859,0.0000025775091,0.00035649896,0.00032394574],"about_ca_topic_score_codex":0.0000049507726,"about_ca_topic_score_gemma":5.42667e-7,"teacher_disagreement_score":0.031005003,"about_ca_system_score_codex":0.00017301948,"about_ca_system_score_gemma":0.000047553767,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W3162151920","doi":"10.1007/s10878-021-00755-9","title":"A two-machine no-wait flow shop problem with two competing agents","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"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é du Québec à Chicoutimi","funders":"","keywords":"Job shop scheduling; Theory of computation; Computer science; Flow shop scheduling; Tabu search; Mathematical optimization; Scheduling (production processes); Branch and bound; Upper and lower bounds; Constraint (computer-aided design); Heuristic; Algorithm; Mathematics; Schedule","score_opus":0.007408698531007035,"score_gpt":0.22623472547130521,"score_spread":0.21882602694029818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162151920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005701545,0.00046625253,0.97934955,0.00019867631,0.0067368494,0.00018766498,0.000007068858,0.00018852045,0.007163864],"genre_scores_gemma":[0.111203834,0.00014104001,0.8874543,0.000055303226,0.0009480147,0.000003594753,0.00004977319,0.00007130971,0.00007288062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849147,0.00009025518,0.00059265585,0.00013729572,0.00047100135,0.00021731755],"domain_scores_gemma":[0.99826425,0.00007530997,0.0002631319,0.0001534383,0.0010938578,0.00015002229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035270673,0.00020103024,0.00034553322,0.00014525368,0.000103603765,0.00015773906,0.00015436187,0.0000734411,0.00021790537],"category_scores_gemma":[0.00013527538,0.00018303252,0.00009139319,0.0005120844,0.000020426927,0.00036863412,0.000027152548,0.00034466985,0.000010238479],"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.0000634562,0.000093179326,0.00026033644,0.00003105365,0.000108129614,0.000056548393,0.00017481927,0.9980989,0.00007776387,0.00037401382,0.00015665228,0.000505113],"study_design_scores_gemma":[0.0047864323,0.00012836445,0.000009732818,0.00017208987,0.00007447723,0.00013493838,0.000072570205,0.9931175,0.00076800195,0.00012879723,0.0003925481,0.00021452004],"about_ca_topic_score_codex":0.0000024119756,"about_ca_topic_score_gemma":8.803219e-7,"teacher_disagreement_score":0.10550229,"about_ca_system_score_codex":0.00011912771,"about_ca_system_score_gemma":0.00012821953,"threshold_uncertainty_score":0.746385},"labels":[],"label_agreement":null},{"id":"W3162711431","doi":"10.5267/j.dsl.2021.2.006","title":"An improved NEH heuristic to minimize makespan for flow shop scheduling problems","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Job shop scheduling; Heuristics; Flow shop scheduling; Mathematical optimization; Heuristic; Scheduling (production processes); Computer science; Mathematics; Computational complexity theory; Algorithm; Routing (electronic design automation)","score_opus":0.0182572285154163,"score_gpt":0.2752753612215371,"score_spread":0.25701813270612084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162711431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18579495,0.000036766905,0.8114432,0.0011239185,0.0011506204,0.00020758189,0.000009995525,0.00020241778,0.000030529165],"genre_scores_gemma":[0.13480742,0.00000477998,0.8628888,0.0020270827,0.00015490546,0.000048777347,0.000010892552,0.00003292326,0.000024398987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981577,0.000015295684,0.00033055097,0.00055705407,0.0004554766,0.00048391763],"domain_scores_gemma":[0.9986972,0.00020390109,0.000030736726,0.00051901274,0.00022365904,0.0003254577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800965,0.00017261914,0.00019236174,0.00026604993,0.00025116387,0.00046458872,0.0004950359,0.00005580713,0.000038947426],"category_scores_gemma":[0.00082095905,0.00017040745,0.00006683558,0.0012929145,0.00007730558,0.00036034264,0.00005212482,0.00012319726,0.000045711386],"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.000007793365,0.0000130378385,0.000060324954,0.000008335098,0.0000032525502,0.0000048755155,0.00022581626,0.8370789,0.1327671,0.000010208056,0.0002044777,0.029615847],"study_design_scores_gemma":[0.0004012916,0.000024477875,0.0002672342,0.000045001518,0.000006929164,0.000009787514,0.00014461963,0.9860848,0.012104078,0.000059924158,0.00060777017,0.0002440472],"about_ca_topic_score_codex":0.0000013136265,"about_ca_topic_score_gemma":0.0000025818,"teacher_disagreement_score":0.1490059,"about_ca_system_score_codex":0.00008423374,"about_ca_system_score_gemma":0.00007014339,"threshold_uncertainty_score":0.69490147},"labels":[],"label_agreement":null},{"id":"W3163438333","doi":"10.5267/j.dsl.2021.4.002","title":"A single machine multi-job integer batch scheduling problem with multi due date to minimize total actual flow time","year":2021,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flow shop scheduling; Computer science; Mathematical optimization; Job scheduler; Scheduling (production processes); Job shop scheduling; Maximum flow problem; Algorithm; Permutation (music); Single-machine scheduling; Mathematics; Schedule","score_opus":0.016938548062186334,"score_gpt":0.24658966578283925,"score_spread":0.22965111772065291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163438333","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35686362,0.00002883254,0.6415915,0.00080053665,0.00033102764,0.00012644027,0.000011851202,0.00019097919,0.000055200442],"genre_scores_gemma":[0.11886554,0.0000019903478,0.8794572,0.0014077068,0.000060082977,0.000015646268,0.000013417886,0.000043460892,0.00013495865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976171,0.000029536406,0.00037093117,0.00067333167,0.0007595972,0.0005494904],"domain_scores_gemma":[0.99872863,0.00018792477,0.00004440285,0.0004983484,0.00021122025,0.00032948813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005442657,0.00027287705,0.00028474035,0.00033068407,0.00022514806,0.00044029046,0.00046632777,0.000068843816,0.00018805021],"category_scores_gemma":[0.0004765778,0.0002293585,0.00006384928,0.0017660699,0.00014589052,0.00052722375,0.00017679436,0.0002716953,0.00040093553],"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.000022027973,0.00004674602,0.00011675617,0.0000047620942,0.0000113867445,0.00008180541,0.0007758199,0.8197208,0.16097838,0.0000010329878,0.00013700387,0.018103454],"study_design_scores_gemma":[0.0009198387,0.000026874892,0.00060219323,0.0001229466,0.000009734273,0.00010401045,0.0002056702,0.96942997,0.028064996,0.0000010835159,0.00016173758,0.00035092427],"about_ca_topic_score_codex":0.000007957393,"about_ca_topic_score_gemma":0.000008994458,"teacher_disagreement_score":0.23799808,"about_ca_system_score_codex":0.00010798059,"about_ca_system_score_gemma":0.0000767249,"threshold_uncertainty_score":0.9352968},"labels":[],"label_agreement":null},{"id":"W3163611706","doi":"10.1007/978-3-030-76307-7_11","title":"A Genetic Algorithm for Flexible Job Shop Scheduling Problem with Scarce Cross Trained Setup Operators","year":2021,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Guelph","funders":"","keywords":"Bottleneck; Computer science; Job shop scheduling; Call for bids; Automation; Operator (biology); Scheduling (production processes); Genetic algorithm; Industrial engineering; Algorithm; Mathematical optimization; Operations research; Machine learning; Engineering; Operating system; Mechanical engineering; Mathematics; Schedule","score_opus":0.024847350806016563,"score_gpt":0.273626956975027,"score_spread":0.2487796061690104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163611706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020738426,0.0006902438,0.9764099,0.00008589427,0.00017040636,0.000501338,0.000044492943,0.00020601682,0.021684326],"genre_scores_gemma":[0.0016488918,0.0010690577,0.9958742,0.00016872463,0.000049927006,0.00008666019,0.00014101733,0.000026136951,0.0009353304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869436,0.0000105392855,0.0005609586,0.00021608264,0.0002756138,0.00024245611],"domain_scores_gemma":[0.9982708,0.000099036275,0.00010400044,0.0008444179,0.0005746755,0.000107049804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004557035,0.00023811379,0.00024857593,0.000504578,0.00043818096,0.0007498286,0.0008600601,0.00013513389,0.000011586275],"category_scores_gemma":[0.00001541014,0.00023599683,0.00004145495,0.0004119283,0.0004654501,0.001832612,0.0002827924,0.0003201936,0.000007805643],"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.0000030247868,0.000010690573,0.000041099014,0.00012682306,0.000027484375,4.9454434e-7,0.0018387409,0.61648715,0.000003965208,0.014983424,0.000033241373,0.36644387],"study_design_scores_gemma":[0.00047236757,0.000033515178,0.000102634185,0.0002623228,0.000010041759,0.000024545034,0.00006480939,0.9917353,0.000033943856,0.00018418788,0.0067705126,0.00030585818],"about_ca_topic_score_codex":0.0000026453579,"about_ca_topic_score_gemma":0.0000031646953,"teacher_disagreement_score":0.37524813,"about_ca_system_score_codex":0.00011749705,"about_ca_system_score_gemma":0.00026324703,"threshold_uncertainty_score":0.9623672},"labels":[],"label_agreement":null},{"id":"W3166308382","doi":"10.1109/syscon48628.2021.9447134","title":"Investigation of Real-Time Task Scheduling on Robot Fleets with Reconfigurable Actuators","year":2021,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; McMaster University","funders":"","keywords":"Control reconfiguration; Computer science; Scheduling (production processes); Actuator; Robot; Schedule; Dynamic priority scheduling; Distributed computing; Modular design; Job shop scheduling; Mobile robot; Real-time computing; Mathematical optimization; Embedded system; Artificial intelligence","score_opus":0.013122996937245798,"score_gpt":0.2048777719942948,"score_spread":0.191754775057049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166308382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82967037,0.00007368225,0.09379571,0.00029691984,0.00030025555,0.00015880262,0.0000071018035,0.0008374637,0.07485969],"genre_scores_gemma":[0.613865,0.00007072199,0.38474107,0.0000734303,0.000049281487,0.000007077693,0.000055449516,0.000041829862,0.0010961583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934876,0.000019899657,0.00019090489,0.00015448821,0.00014635932,0.00013957519],"domain_scores_gemma":[0.999514,0.000060481263,0.000035973026,0.00019671109,0.00011201782,0.00008082342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094266856,0.00011611933,0.00015704845,0.00007360507,0.00003520397,0.000027142645,0.000055866807,0.000070381175,0.00034007392],"category_scores_gemma":[0.000040325525,0.00010431854,0.000027930706,0.0003192929,0.000021424998,0.00009817682,0.0000044672233,0.000096027616,0.00007373895],"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.000007727633,0.000008867458,0.0002236362,0.00003512599,0.000050687388,0.000004943218,0.000216208,0.95363235,0.04317882,0.00039248605,0.00012915899,0.0021200068],"study_design_scores_gemma":[0.0003410985,0.000044882807,0.00026592595,0.00011642444,0.000016927415,0.000006685995,0.00015748148,0.53935504,0.45939922,0.00008373284,0.000033536307,0.00017903115],"about_ca_topic_score_codex":0.00001304484,"about_ca_topic_score_gemma":0.0000043819764,"teacher_disagreement_score":0.4162204,"about_ca_system_score_codex":0.000031574928,"about_ca_system_score_gemma":0.000054630276,"threshold_uncertainty_score":0.42539868},"labels":[],"label_agreement":null},{"id":"W3168901912","doi":"","title":"On the Optimality of Batch Policy Optimization Algorithms","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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); University of Alberta","funders":"","keywords":"Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.027271148238776546,"score_gpt":0.2846968536771992,"score_spread":0.2574257054384227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168901912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02162069,0.0000962557,0.8241792,0.008996107,0.0010234077,0.00015357412,0.0000601575,0.0004045688,0.14346607],"genre_scores_gemma":[0.9698784,0.00017109845,0.02828215,0.0002876298,0.00015676154,0.00001090537,0.00014073547,0.000027726344,0.0010446248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901897,0.0000908125,0.00024006977,0.0001762872,0.0003410924,0.00013278596],"domain_scores_gemma":[0.9992293,0.00018821484,0.00007267924,0.00016880684,0.00029794007,0.000043025197],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020570244,0.00013821853,0.00013171653,0.00012158028,0.000078851364,0.000080519225,0.00022895166,0.00006077756,0.0017747938],"category_scores_gemma":[0.0005877666,0.000114988456,0.00006359883,0.00024468167,0.000036048237,0.000069775706,0.000038399514,0.00039795408,0.000038758186],"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.000010067573,0.000027346996,0.00015086369,0.0000051341826,0.000043528857,0.000003542176,0.00012159548,0.9407322,0.00019902871,0.055132784,0.000032544493,0.0035413643],"study_design_scores_gemma":[0.00022674094,0.000033841152,0.00014442451,0.000052573414,0.0000048198917,0.0000054410502,0.00011462203,0.9962153,0.0023161313,0.0005508318,0.0002236846,0.00011162213],"about_ca_topic_score_codex":0.00003508553,"about_ca_topic_score_gemma":0.000002915326,"teacher_disagreement_score":0.9482577,"about_ca_system_score_codex":0.000063391235,"about_ca_system_score_gemma":0.000063557185,"threshold_uncertainty_score":0.9991377},"labels":[],"label_agreement":null},{"id":"W3169766872","doi":"10.5267/j.ijiec.2021.5.004","title":"New models and algorithms to solve integrated problems of production planning and control taking into account worker skills in flexible manufacturing systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; European Commission","keywords":"Workstation; Production (economics); Production planning; Computer-integrated manufacturing; Control (management); Manufacturing execution system; Manufacturing engineering; Computer science; Process (computing); Cellular manufacturing; Flexible manufacturing system; Industrial engineering; Production control; Discrete manufacturing; Product (mathematics); Process development execution system; Engineering; Operations management; Scheduling (production processes); Artificial intelligence","score_opus":0.02416520006938427,"score_gpt":0.2587744399773354,"score_spread":0.23460923990795113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169766872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15486713,0.00080418616,0.84188825,0.00019271813,0.0020576862,0.00012717051,0.000005791777,0.000043553766,0.000013516706],"genre_scores_gemma":[0.88976175,0.000049698876,0.10964636,0.000009752451,0.00048467176,0.000004926426,0.000008528342,0.000023795272,0.000010507418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988312,0.0000167164,0.0006141672,0.00013393821,0.0002751159,0.00012883225],"domain_scores_gemma":[0.99917877,0.0001354697,0.0001729552,0.00005726373,0.0003494525,0.00010611889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028086678,0.00014119537,0.00027017973,0.00053740863,0.00002400845,0.00013396272,0.00011082153,0.000096113334,0.0000034937075],"category_scores_gemma":[0.00023899521,0.00014774014,0.000035667763,0.00026088045,0.000009838816,0.000333175,0.000028444212,0.00032944896,2.9524017e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013800392,0.000017010821,0.000257436,0.00001817037,0.00014124546,0.00001583753,0.0008391154,0.9833987,0.00069826155,0.000079556325,0.000037313777,0.014483551],"study_design_scores_gemma":[0.0012507911,0.000028532862,0.0005335243,0.0014615343,0.000022347065,0.00015304134,0.00032874075,0.9923768,0.0034793825,0.00010992839,0.00011113998,0.0001442456],"about_ca_topic_score_codex":0.00005985276,"about_ca_topic_score_gemma":0.000003290617,"teacher_disagreement_score":0.73489463,"about_ca_system_score_codex":0.00014017308,"about_ca_system_score_gemma":0.00010451624,"threshold_uncertainty_score":0.6024668},"labels":[],"label_agreement":null},{"id":"W3171104013","doi":"10.5267/j.ijiec.2021.5.002","title":"Minimization of total tardiness in no-wait flowshop production systems with preventive maintenance","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Tardiness; Computer science; Heuristics; Mathematical optimization; Job shop scheduling; Preventive maintenance; Scheduling (production processes); Metaheuristic; Production (economics); Constructive; Maximization; Operations research; Schedule; Algorithm; Reliability engineering; Mathematics; Engineering; Economics","score_opus":0.012505583434054958,"score_gpt":0.22199248858988077,"score_spread":0.20948690515582583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171104013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3030317,0.0002261851,0.6860559,0.00025942695,0.009989515,0.0001818568,0.00002373854,0.00006696536,0.00016467049],"genre_scores_gemma":[0.96509767,0.000031348893,0.03396854,0.0000038490844,0.0007590006,0.000006213074,0.00003415498,0.00002484075,0.00007438746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988498,0.000028599849,0.0005743755,0.00010193535,0.0003405265,0.000104743725],"domain_scores_gemma":[0.9982725,0.00008469484,0.00017595204,0.00007131185,0.0013509912,0.000044545086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017156005,0.000113067494,0.00021681334,0.0003305025,0.000013062666,0.000045643235,0.00011362675,0.00007405839,0.000012520802],"category_scores_gemma":[0.000443934,0.0001119348,0.000056809855,0.0004432319,0.000014814769,0.00032065698,0.000014345406,0.00024192315,0.0000015862803],"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.00003266069,0.000051569787,0.00027135876,0.000017703456,0.00016242158,0.000034934274,0.00015365638,0.99754596,0.0004041131,0.00011474339,0.00013150559,0.0010793963],"study_design_scores_gemma":[0.0012335989,0.000040078114,0.00067026104,0.0007684524,0.000024173338,0.00028516163,0.0001931589,0.99455374,0.0019609297,0.0000071926497,0.0001348055,0.00012846099],"about_ca_topic_score_codex":0.0000058464643,"about_ca_topic_score_gemma":0.0000010382155,"teacher_disagreement_score":0.6620659,"about_ca_system_score_codex":0.00015001821,"about_ca_system_score_gemma":0.00013593766,"threshold_uncertainty_score":0.45645687},"labels":[],"label_agreement":null},{"id":"W3177084066","doi":"","title":"Efficient Algorithms for Flexible Job Shop Scheduling with Parallel Machines","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Flow shop scheduling; Upper and lower bounds; Approximation algorithm; Mathematics","score_opus":0.025974242527357545,"score_gpt":0.24795558102595305,"score_spread":0.2219813384985955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3177084066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01056312,0.00025019277,0.98372215,0.0007574139,0.00018530096,0.00027291285,0.000009586787,0.0014558621,0.0027834587],"genre_scores_gemma":[0.074911684,0.000011754411,0.92389554,0.00040690912,0.0002748457,0.00005694969,0.000020980293,0.00006635002,0.00035497223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.0000063173593,0.00019373612,0.00023347982,0.00015583319,0.0002734848],"domain_scores_gemma":[0.9995529,0.000049867518,0.000019779982,0.00013025827,0.000071945804,0.00017524189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007579448,0.00018853175,0.00018869695,0.00005014819,0.000086700085,0.00006756338,0.00013609041,0.000062994164,0.00010588797],"category_scores_gemma":[0.000032703978,0.00015091685,0.000059519585,0.0002753107,0.000020519441,0.000040804025,0.000017945245,0.00011724362,0.0000484692],"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.000022836515,0.000010502246,0.000111142406,0.00004902211,0.00003771335,0.0000016166598,0.00021204182,0.9959491,0.000082313665,0.00049494026,0.00020286914,0.002825925],"study_design_scores_gemma":[0.00085218664,0.00007018646,0.00002783617,0.000015001608,0.000019273855,0.0000036716272,0.00017143115,0.99726206,0.00082987203,0.000016445008,0.00048579636,0.0002462563],"about_ca_topic_score_codex":0.0000036248152,"about_ca_topic_score_gemma":0.0000014208847,"teacher_disagreement_score":0.06434856,"about_ca_system_score_codex":0.000018929853,"about_ca_system_score_gemma":0.000019322611,"threshold_uncertainty_score":0.61542106},"labels":[],"label_agreement":null},{"id":"W3183449483","doi":"10.4230/lipics.icalp.2021.81","title":"Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Norm (philosophy); Job shop scheduling; Approximation algorithm; Random variable; Load balancing (electrical power); Mathematics; Monotone polygon; Mathematical optimization; Combinatorics; Discrete mathematics; Minification; Computer science; Statistics","score_opus":0.00950825918348574,"score_gpt":0.23621623706637002,"score_spread":0.22670797788288427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183449483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68257385,0.0015657317,0.13046095,0.0011809389,0.007949786,0.0020512787,0.001163659,0.002793846,0.17025995],"genre_scores_gemma":[0.7041718,0.0006933944,0.2711572,0.008573789,0.0012665304,0.00029660424,0.0021795563,0.0005437463,0.011117385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676734,0.000025090285,0.001225843,0.00032792884,0.0006968994,0.0009569193],"domain_scores_gemma":[0.99798256,0.00015491522,0.00021307389,0.00074093905,0.00053781644,0.00037071182],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038349294,0.00056188036,0.00058967737,0.00021497194,0.00032294833,0.00049341,0.0004722868,0.00037099366,0.0005312011],"category_scores_gemma":[0.00029134046,0.0005993131,0.00033631414,0.0005325165,0.000067293506,0.00088885,0.00016947222,0.0005432908,0.0010840727],"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.0012745605,0.0027209506,0.02611918,0.016108982,0.0074951933,0.0009992396,0.28557587,0.32259592,0.0056151976,0.011825502,0.14078245,0.17888698],"study_design_scores_gemma":[0.005268728,0.00018248177,0.00020044304,0.0006050944,0.0001580581,0.0005338807,0.01067687,0.7814067,0.024698986,0.0002915792,0.17436408,0.0016131164],"about_ca_topic_score_codex":0.000018313545,"about_ca_topic_score_gemma":0.000013757157,"teacher_disagreement_score":0.45881078,"about_ca_system_score_codex":0.00032053594,"about_ca_system_score_gemma":0.00023746684,"threshold_uncertainty_score":0.9996937},"labels":[],"label_agreement":null},{"id":"W3184586842","doi":"10.1016/j.disopt.2021.100658","title":"Preface: Optimization and Discrete Geometry","year":2021,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"","keywords":"Mathematics; Discrete geometry; Geometry; Mathematical optimization","score_opus":0.006629734632258789,"score_gpt":0.21738132398167087,"score_spread":0.21075158934941207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184586842","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024090123,0.001185968,0.99089366,0.0001880378,0.00041573154,0.00014978243,0.000029664146,0.0005415816,0.0041865394],"genre_scores_gemma":[0.102329515,0.002105024,0.89321876,0.00013531865,0.00016374596,0.000034426863,0.0010850842,0.00011709552,0.00081103365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988348,0.000045678833,0.00030236808,0.000332597,0.00021738869,0.0002671706],"domain_scores_gemma":[0.9993324,0.0000388769,0.000051321236,0.00027763975,0.00015744769,0.00014229452],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000110915156,0.00022836556,0.0002079614,0.00013802032,0.00014753833,0.00020548514,0.000087860695,0.00015585289,0.00046011235],"category_scores_gemma":[0.00010347946,0.00024525676,0.0000518701,0.000640193,0.000045229408,0.00043372123,0.000051701038,0.00015088097,0.000011977885],"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.0000039207694,0.000009010273,0.00023620708,0.000033305398,0.00003366153,0.0000047061026,0.00013778087,0.9983689,0.00005455269,0.00018915036,0.00010280839,0.00082598673],"study_design_scores_gemma":[0.00045641523,0.000014315943,0.00011550388,0.0000370825,0.000038735343,0.000018322835,0.00017874375,0.99735636,0.0012544174,0.000024953815,0.00019614463,0.0003090281],"about_ca_topic_score_codex":0.0000025208315,"about_ca_topic_score_gemma":0.0000015689366,"teacher_disagreement_score":0.099920504,"about_ca_system_score_codex":0.00004802299,"about_ca_system_score_gemma":0.000028987359,"threshold_uncertainty_score":0.99999994},"labels":[],"label_agreement":null},{"id":"W3184910063","doi":"10.53102/2014.33.03.781","title":"Etude de l’apprentissage d’une nouvelle technologie d’emballage des médicaments dans une pharmacie","year":2014,"lang":"fr","type":"article","venue":"Revue Française de Gestion Industrielle","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Learning curve; Computer science; Operating system","score_opus":0.024474233686326126,"score_gpt":0.23615893651257217,"score_spread":0.21168470282624605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184910063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22863616,0.0049096183,0.73450345,0.010819099,0.002168387,0.000544239,0.00009628268,0.0013711498,0.016951613],"genre_scores_gemma":[0.8668809,0.002432175,0.10731498,0.00012067744,0.0009299503,0.000114916875,0.00010301705,0.00017971813,0.021923643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972614,0.00019785557,0.00063568086,0.0005524326,0.00029259393,0.0010600594],"domain_scores_gemma":[0.998406,0.00022868156,0.00016922271,0.0005904584,0.00013134266,0.0004743035],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007502069,0.0005020229,0.0004598873,0.00026504823,0.00049164926,0.00013314324,0.0005479586,0.0013811607,0.0009288798],"category_scores_gemma":[0.0005909142,0.0006384195,0.00016992718,0.0015998629,0.00037323363,0.00024221523,0.00012791158,0.00149736,0.00044151203],"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.000026153706,0.00036972328,0.007602699,0.00036275384,0.0001587667,0.00011044137,0.0045360583,0.7677237,0.004771079,0.0011001728,0.015140942,0.19809753],"study_design_scores_gemma":[0.0022808036,0.00014916719,0.0013459336,0.0011164724,0.00029127477,0.00022611568,0.0020156773,0.81177914,0.025515713,0.0005027641,0.15386088,0.00091603526],"about_ca_topic_score_codex":0.0010810175,"about_ca_topic_score_gemma":0.000057077723,"teacher_disagreement_score":0.63824475,"about_ca_system_score_codex":0.0005787192,"about_ca_system_score_gemma":0.0002033202,"threshold_uncertainty_score":0.9999844},"labels":[],"label_agreement":null},{"id":"W3188522200","doi":"10.24963/ijcai.2021/595","title":"Combinatorial Optimization and Reasoning with Graph Neural Networks","year":2021,"lang":"en","type":"article","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":172,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Polytechnique Montréal","funders":"","keywords":"Computer science; Combinatorial optimization; Key (lock); Artificial intelligence; Artificial neural network; Graph; Theoretical computer science; Machine learning; Algorithm","score_opus":0.0070840195360070265,"score_gpt":0.18876206709111346,"score_spread":0.18167804755510644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188522200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21892512,0.0013227166,0.7303302,0.00045885044,0.0018493441,0.0003298868,0.000056734327,0.00080502743,0.04592207],"genre_scores_gemma":[0.9375754,0.0008369788,0.059019394,0.00012280625,0.00021699097,0.000010372721,0.00029976649,0.00007554943,0.0018427547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987349,0.00007314869,0.00018088524,0.0003928961,0.0002227354,0.00039541634],"domain_scores_gemma":[0.9993529,0.00008637049,0.000051863983,0.00022216205,0.0001377071,0.00014905311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000083116814,0.00027339085,0.00028088206,0.00014544357,0.0003489602,0.00008820658,0.00015292923,0.00009723471,0.000049552924],"category_scores_gemma":[0.000012429686,0.00027895367,0.00005652074,0.0004162508,0.00014539501,0.0002202898,0.00015184461,0.0002451768,0.0000051195084],"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.00004527944,0.00004029706,0.0044175144,0.000026211463,0.000147967,0.00021361788,0.00020649689,0.9789525,0.000021154052,0.015481885,0.00014794436,0.0002990929],"study_design_scores_gemma":[0.0014976133,0.00007119652,0.0041521005,0.000059713664,0.00012935832,0.00017340397,0.00044497184,0.99205226,0.000117388285,0.00008017182,0.00076647877,0.000455358],"about_ca_topic_score_codex":0.000004674273,"about_ca_topic_score_gemma":0.000010158108,"teacher_disagreement_score":0.7186503,"about_ca_system_score_codex":0.000060076665,"about_ca_system_score_gemma":0.00003451316,"threshold_uncertainty_score":0.99996626},"labels":[],"label_agreement":null},{"id":"W3191365954","doi":"10.17762/de.vi.3297","title":"GA-BASED IMPROVEMENT HEURISTIC FOR MINIMIZING MAKESPAN IN A GENERAL FLOW-SHOP SCHEDULING PROBLEM","year":2021,"lang":"en","type":"article","venue":"Design Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Job shop scheduling; Flow shop scheduling; Mathematical optimization; Heuristic; Constructive; Computer science; Scheduling (production processes); Permutation (music); Upper and lower bounds; Null-move heuristic; Algorithm; Mathematics; Process (computing); Routing (electronic design automation)","score_opus":0.01658982450290529,"score_gpt":0.21576696289924135,"score_spread":0.19917713839633605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191365954","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015290904,0.00040731006,0.9828553,0.000052340118,0.0004647638,0.00038287966,0.000009465964,0.00048996747,0.000047037192],"genre_scores_gemma":[0.13556594,0.000014994503,0.8637596,0.00004926924,0.0001695714,0.00024603616,0.00004681765,0.0001012342,0.000046536028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986425,0.000016591317,0.00039549847,0.00030175532,0.00015188495,0.0004917715],"domain_scores_gemma":[0.9994055,0.00015903238,0.000027072032,0.00021686677,0.00008185238,0.00010967337],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028264793,0.00026023298,0.00026999073,0.00020391136,0.000045912366,0.0000889853,0.00011851395,0.000111793175,0.000019656465],"category_scores_gemma":[0.00013704595,0.00031739235,0.000087052176,0.0004108383,0.0000064075853,0.00008578291,0.000017507737,0.00019997198,0.000005490177],"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.000008130349,0.000022867862,0.000026765814,0.00022954075,0.000027100468,0.000024749923,0.000119737386,0.974983,0.022098904,0.00007223329,0.0000213095,0.002365653],"study_design_scores_gemma":[0.0009961193,0.00002983279,0.000031935408,0.00015097752,0.000018384984,0.000005209097,0.000042589163,0.95336527,0.04487125,0.000021535,0.00011998609,0.0003469062],"about_ca_topic_score_codex":0.0000024306098,"about_ca_topic_score_gemma":0.0000029918212,"teacher_disagreement_score":0.120275036,"about_ca_system_score_codex":0.00012732415,"about_ca_system_score_gemma":0.00007123322,"threshold_uncertainty_score":0.9999278},"labels":[],"label_agreement":null},{"id":"W3192155567","doi":"10.1287/ijoo.2021.0056","title":"Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling","year":2021,"lang":"en","type":"article","venue":"INFORMS Journal on Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Regina","funders":"","keywords":"Job shop scheduling; GRASP; Mathematical optimization; Integer programming; Computer science; Scheduling (production processes); Greedy algorithm; Local optimum; Constraint programming; Mathematics","score_opus":0.0573044278968977,"score_gpt":0.30533611664792565,"score_spread":0.24803168875102793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192155567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015772107,0.0002305387,0.9937311,0.00069010153,0.0007014117,0.00017306027,0.000015519892,0.0003033631,0.0025776965],"genre_scores_gemma":[0.1017974,0.00015866908,0.8968913,0.00046939854,0.00030276203,0.000028945364,0.00021643497,0.00006133678,0.000073781615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985123,0.00003201926,0.0005072357,0.00018855336,0.0003686482,0.000391186],"domain_scores_gemma":[0.9987675,0.00021784072,0.00006547067,0.00017988421,0.0005617764,0.00020751722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322036,0.00021817579,0.00021899883,0.00028736558,0.00037097235,0.0004964799,0.00014433682,0.00019022147,0.00017078273],"category_scores_gemma":[0.00036831625,0.00020788866,0.00015358215,0.00041463037,0.000040052288,0.0006467593,0.000014911832,0.00039642412,0.000014047857],"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.00004542724,0.000049874758,0.00003267269,0.00007200646,0.000035694582,0.000007297658,0.000096218515,0.9919684,0.000045441968,0.003023839,0.00007649815,0.004546657],"study_design_scores_gemma":[0.0009801158,0.00011337428,0.000015974005,0.000120194425,0.000027922239,0.000056550907,0.00041568122,0.9927034,0.004825908,0.00038513576,0.00009160549,0.00026417943],"about_ca_topic_score_codex":3.5311376e-7,"about_ca_topic_score_gemma":2.8209018e-7,"teacher_disagreement_score":0.100220196,"about_ca_system_score_codex":0.0001980469,"about_ca_system_score_gemma":0.0001529091,"threshold_uncertainty_score":0.84774536},"labels":[],"label_agreement":null},{"id":"W3193693359","doi":"10.11159/cist21.109","title":"Reinforcement Learning for Production Planning with Demand Sensitive to Delivery Lead Time","year":2021,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reinforcement learning; Production (economics); Lead (geology); Reinforcement; Computer science; Production planning; On demand; Artificial intelligence; Engineering; Multimedia; Microeconomics; Economics; Geology","score_opus":0.006230267962367172,"score_gpt":0.1930623790670032,"score_spread":0.18683211110463602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193693359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.881787,0.00038024434,0.11577848,0.00017229623,0.0010284451,0.0004465671,6.87344e-7,0.00020650965,0.00019975379],"genre_scores_gemma":[0.992054,0.000009853163,0.0072386777,0.000018343038,0.000112911825,0.000015724696,2.983028e-7,0.000010874801,0.0005393249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992998,0.0000023702457,0.00012612608,0.00021240997,0.00017425731,0.00018503805],"domain_scores_gemma":[0.9995826,0.000045462788,0.000031859367,0.000043027074,0.0002292026,0.00006788177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021288624,0.00010318275,0.0001466354,0.0001367344,0.00014054947,0.00012168267,0.00007742557,0.000018515402,1.0149588e-7],"category_scores_gemma":[0.000045672918,0.000076637116,0.000014788491,0.0005978881,0.0000384736,0.00009760992,0.000034942328,0.00010803519,2.0047484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011178018,0.0000034396837,0.00011712854,0.00007538113,0.0000146875755,4.4892704e-7,0.00013391227,0.99183995,0.0061966493,0.0004475015,0.00009653532,0.00106318],"study_design_scores_gemma":[0.00012740016,0.000091610564,0.00022942809,0.00037167937,0.00000874699,0.00002922751,0.000025702531,0.9743462,0.024500147,7.211846e-7,0.00016026924,0.000108875276],"about_ca_topic_score_codex":9.169888e-7,"about_ca_topic_score_gemma":8.479452e-8,"teacher_disagreement_score":0.11026698,"about_ca_system_score_codex":0.000028694705,"about_ca_system_score_gemma":0.000014350581,"threshold_uncertainty_score":0.31251708},"labels":[],"label_agreement":null},{"id":"W3197350824","doi":"10.1016/j.susoc.2021.08.003","title":"Minimizing total absolute deviation of job completion times on a single machine with maintenance activities using a Lion Optimization Algorithm","year":2021,"lang":"en","type":"article","venue":"Sustainable Operations and Computers","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Metaheuristic; Computer science; Scheduling (production processes); Absolute deviation; Single-machine scheduling; Mathematical optimization; Algorithm; Job shop scheduling; Mathematics","score_opus":0.006875171576125061,"score_gpt":0.19519470455335,"score_spread":0.18831953297722495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197350824","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08599024,0.0001851304,0.91313785,0.000086722364,0.000097828735,0.00014500238,0.000009725431,0.00008591643,0.00026157303],"genre_scores_gemma":[0.40712124,0.000049831284,0.5923095,0.000040120365,0.00004444764,0.000010388765,0.0000889765,0.000025594401,0.00030989366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926054,0.000037497895,0.00019753416,0.00018144527,0.00013151241,0.00019144734],"domain_scores_gemma":[0.9995035,0.000035830017,0.00003699417,0.00012045161,0.0002579898,0.000045260753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007836266,0.00014156383,0.00017577923,0.00014649327,0.00021896228,0.00015862686,0.000037074005,0.000048838978,0.000017774168],"category_scores_gemma":[0.000014121346,0.00013962194,0.000027150953,0.0003531845,0.000036438036,0.0003204754,0.000025904432,0.00008106627,3.4477773e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009823267,0.000039662453,0.00001730124,0.000058309222,0.000033342996,0.00001039199,0.00037104412,0.99533343,0.0003086219,0.00087719026,0.000019717283,0.0029211387],"study_design_scores_gemma":[0.0004941029,0.000102223945,0.000098600816,0.00010965744,0.00002244584,0.000044352717,0.0017209147,0.99594724,0.0012547346,0.000011599016,0.000029575494,0.00016456304],"about_ca_topic_score_codex":0.000044677727,"about_ca_topic_score_gemma":0.000006772685,"teacher_disagreement_score":0.32113102,"about_ca_system_score_codex":0.00011825281,"about_ca_system_score_gemma":0.000059581842,"threshold_uncertainty_score":0.5693618},"labels":[],"label_agreement":null},{"id":"W3197789086","doi":"","title":"Trade-off Balancing Between Maximum and Total Completion Times for No-Wait Flow Shop Production","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Heuristics; Mathematical optimization; Heuristic; Benchmark (surveying); Minification; Computer science; Scheduling (production processes); Flow shop scheduling; Mathematics; Parameterized complexity; Job shop scheduling; Algorithm; Routing (electronic design automation)","score_opus":0.009466267643402136,"score_gpt":0.20845410317971333,"score_spread":0.1989878355363112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3197789086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13763435,0.002950103,0.8532108,0.004576373,0.00073312287,0.0003359835,0.000014956697,0.0003518093,0.00019247032],"genre_scores_gemma":[0.9725929,0.00095642364,0.023456477,0.00005887969,0.0026878617,0.000008781159,0.00004712504,0.000057478985,0.00013410853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987671,0.000019189394,0.00020790132,0.00015465336,0.00012844591,0.00072273513],"domain_scores_gemma":[0.9997413,0.000025905018,0.000041462496,0.000053271553,0.000042824882,0.00009524757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036563873,0.00012876705,0.00016806257,0.000049374583,0.00014373616,0.000058448248,0.000064775544,0.000062848965,0.000015599138],"category_scores_gemma":[0.00007379682,0.0001299403,0.000055632987,0.00011162626,0.000013919526,0.00015586539,0.00000796359,0.00063741364,0.000010446047],"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.00014343704,0.000040721578,0.0023576645,0.0002037635,0.0006831686,0.0000024692781,0.0016561747,0.6281769,0.0035906304,0.0018288515,0.0021423514,0.35917383],"study_design_scores_gemma":[0.00084143016,0.0002849906,0.00049530884,0.000027094386,0.00007191459,0.00016829692,0.0004800995,0.9924432,0.0005500631,0.0030467228,0.0013183528,0.00027252195],"about_ca_topic_score_codex":7.938458e-7,"about_ca_topic_score_gemma":0.0000025955878,"teacher_disagreement_score":0.8349585,"about_ca_system_score_codex":0.00018283926,"about_ca_system_score_gemma":0.000111234986,"threshold_uncertainty_score":0.5298812},"labels":[],"label_agreement":null},{"id":"W3199510825","doi":"10.18280/jesa.540408","title":"Comparing Mixed-Integer Programming and Constraint Programming Models for the Hybrid Flow Shop Scheduling Problem with Dedicated Machines","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer programming; Job shop scheduling; Constraint programming; Computer science; Mathematical optimization; Scheduling (production processes); Constraint (computer-aided design); Flow shop scheduling; Schedule; Mathematics; Stochastic programming","score_opus":0.021643287588349578,"score_gpt":0.2367517190628042,"score_spread":0.21510843147445463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199510825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055605836,0.004586002,0.9379011,0.00020016801,0.0003213448,0.0005261056,0.000008000526,0.00069549744,0.00015596436],"genre_scores_gemma":[0.46896762,0.00012362983,0.5305635,0.000019889376,0.00014470618,0.00005800325,0.000012204743,0.00007603449,0.000034454413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805033,0.00010013229,0.0006364401,0.0002942757,0.00035755202,0.0005612815],"domain_scores_gemma":[0.998658,0.00026198523,0.00018991543,0.00021567153,0.00044111456,0.00023332426],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067684293,0.0003499945,0.00043716212,0.00012886003,0.0007965311,0.00128907,0.0002286295,0.00006923392,0.000012727163],"category_scores_gemma":[0.00012168607,0.00024325331,0.00011928788,0.00035730295,0.00021474414,0.0003826224,0.00006461435,0.00052191137,0.0000027046153],"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.000010352387,0.000026035425,0.0004791087,0.0002550214,0.00025915875,0.000067057525,0.00061393855,0.66063315,0.000044901117,0.00020865002,0.000029301458,0.33737332],"study_design_scores_gemma":[0.00087799976,0.00006510677,0.0005569167,0.0008171738,0.00015998787,0.0037400953,0.00086775,0.99165016,0.00026497775,0.0003899094,0.00028090965,0.0003290078],"about_ca_topic_score_codex":0.000006904018,"about_ca_topic_score_gemma":0.000021060448,"teacher_disagreement_score":0.4133618,"about_ca_system_score_codex":0.00010386545,"about_ca_system_score_gemma":0.00014274345,"threshold_uncertainty_score":0.9997477},"labels":[],"label_agreement":null},{"id":"W3204734281","doi":"10.5267/j.jpm.2021.9.001","title":"An improved algorithm to minimize the total completion time in a two-machine no-wait flow-shop with uncertain setup times","year":2021,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Algorithm; Python (programming language); Range (aeronautics); Mathematical optimization; Mathematics; Engineering","score_opus":0.00814068058952495,"score_gpt":0.25099864646142434,"score_spread":0.2428579658718994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204734281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013949272,0.00038408552,0.97828037,0.0011473072,0.0007558219,0.00091287744,0.000032814423,0.00015083948,0.0043866006],"genre_scores_gemma":[0.013485529,0.000057278918,0.98403764,0.00024274517,0.00029252443,0.000030095684,0.00003868476,0.00004920081,0.0017662821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988402,0.00008829367,0.0003858693,0.00015627038,0.00030911522,0.00022021645],"domain_scores_gemma":[0.99941206,0.000036789563,0.00008801327,0.00022123948,0.00016866282,0.000073206545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047962225,0.0001699767,0.00024790497,0.00023039053,0.000054001554,0.00011928494,0.00019084844,0.000026958529,0.00015412485],"category_scores_gemma":[0.00001971675,0.00011850398,0.00006158484,0.00052935095,0.000013753343,0.00015260869,0.00004600067,0.00022088415,0.00002760193],"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.000089117486,0.00013415031,0.00004140173,0.000044178,0.000202098,0.00019364024,0.00065450347,0.97144955,0.00037640348,0.000013590299,0.0010704296,0.025730912],"study_design_scores_gemma":[0.001464538,0.00015198217,0.00044136526,0.00009411743,0.000055503617,0.00009048715,0.00063563266,0.9958159,0.00014941701,0.000008793685,0.0009252019,0.0001670789],"about_ca_topic_score_codex":0.000024215264,"about_ca_topic_score_gemma":0.000012345981,"teacher_disagreement_score":0.025563834,"about_ca_system_score_codex":0.00012946222,"about_ca_system_score_gemma":0.000044108438,"threshold_uncertainty_score":0.48324522},"labels":[],"label_agreement":null},{"id":"W3205414568","doi":"10.1080/00207543.2021.1983224","title":"Novel efficient formulation and matheuristic for large-sized unrelated parallel machine scheduling with release dates","year":2021,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Heuristics; Job shop scheduling; Computer science; Mathematical optimization; Integer programming; Scheduling (production processes); Schedule; Computation; Algorithm; Mathematics","score_opus":0.03904139824506915,"score_gpt":0.334984609583173,"score_spread":0.29594321133810386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205414568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22409104,0.00088996824,0.7715739,0.0022883934,0.00086252275,0.00017080782,0.000019925348,0.00004120797,0.00006221193],"genre_scores_gemma":[0.8010123,0.00021346273,0.19808099,0.000011402411,0.00037548653,0.000008303786,0.00004384268,0.000023397813,0.00023086579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876434,0.000037756632,0.00031019154,0.00014719914,0.0005767245,0.00016381692],"domain_scores_gemma":[0.9972731,0.00015033044,0.00008396698,0.00009119892,0.0023259677,0.00007544054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010139747,0.00008201967,0.00011866022,0.00029303925,0.000101970356,0.00010884356,0.00011495242,0.000045686626,0.00003266974],"category_scores_gemma":[0.0010867158,0.00006963474,0.00003623494,0.00024955045,0.00002349807,0.00014989165,0.000028341814,0.00030712658,0.0000027386443],"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.00030241246,0.00013494847,0.0001780141,0.0000365192,0.00017474777,0.000017722465,0.0002081653,0.9885035,0.006995254,0.0013908526,0.00008243869,0.0019753964],"study_design_scores_gemma":[0.0020398726,0.000064045096,0.0004134268,0.00013485808,0.000019487432,0.00039747416,0.00024433332,0.9886378,0.006947274,0.0003790677,0.0006305143,0.0000918528],"about_ca_topic_score_codex":0.0000024222204,"about_ca_topic_score_gemma":0.000003251981,"teacher_disagreement_score":0.5769212,"about_ca_system_score_codex":0.00008870076,"about_ca_system_score_gemma":0.00009475678,"threshold_uncertainty_score":0.28396225},"labels":[],"label_agreement":null},{"id":"W3205443176","doi":"10.1007/s10951-021-00711-9","title":"Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times","year":2021,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Genève; European Commission","keywords":"Tabu search; Metaheuristic; Lexicographical order; Mathematical optimization; Job shop scheduling; Computer science; Scheduling (production processes); Minification; Hierarchy; Guided Local Search; Single-machine scheduling; Mathematics; Schedule; Combinatorics","score_opus":0.012681719122895806,"score_gpt":0.2344862857258268,"score_spread":0.221804566602931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205443176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41675767,0.0022687672,0.5801575,0.00027241308,0.0001669111,0.00014283057,0.0000073387364,0.00004454648,0.00018200453],"genre_scores_gemma":[0.4597702,0.00040343552,0.5395949,0.000014701178,0.0001257784,0.0000042553083,0.000009813356,0.000029825645,0.00004711975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866366,0.000043613512,0.00057930115,0.00016088292,0.0003032341,0.00024928956],"domain_scores_gemma":[0.9986124,0.000105385974,0.00021915077,0.00011345571,0.00083089794,0.00011869235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004525,0.00017232356,0.0004114642,0.00023042466,0.00013052364,0.00008466895,0.00009304949,0.00009599348,0.000030858566],"category_scores_gemma":[0.000067258894,0.00014586379,0.00009900207,0.0003809811,0.000060206825,0.00025727355,0.000020973086,0.0003681185,9.647007e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021791128,0.00005478826,0.0044606696,0.00040102517,0.00021958903,0.000019809631,0.00057810615,0.98235625,0.009003445,0.0006205287,0.000020060506,0.0020478326],"study_design_scores_gemma":[0.002436133,0.00025073183,0.0008967587,0.00077208446,0.000097977725,0.00041672584,0.00104918,0.98467016,0.008841429,0.00018443908,0.00016560763,0.00021877709],"about_ca_topic_score_codex":0.0000059604395,"about_ca_topic_score_gemma":0.0000070057527,"teacher_disagreement_score":0.04301253,"about_ca_system_score_codex":0.00006231533,"about_ca_system_score_gemma":0.0001272743,"threshold_uncertainty_score":0.59481525},"labels":[],"label_agreement":null},{"id":"W3205671243","doi":"10.1016/j.jmsy.2021.09.018","title":"Real-time integrated production-scheduling and maintenance-planning in a flexible job shop with machine deterioration and condition-based maintenance","year":2021,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Government of Canada","keywords":"Job shop; Scheduling (production processes); Job shop scheduling; Computer science; Industrial engineering; Production planning; Production (economics); Benchmark (surveying); Process (computing); Engineering; Operations research; Reliability engineering; Mathematical optimization; Schedule; Flow shop scheduling; Operations management","score_opus":0.008529663143927913,"score_gpt":0.21918553033616045,"score_spread":0.21065586719223253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205671243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95840317,0.0007638055,0.039965905,0.00014041815,0.0004067216,0.00012519996,0.000005108306,0.000078309575,0.00011134256],"genre_scores_gemma":[0.9696156,0.00014901249,0.029858548,0.000014162996,0.00013002219,0.0000071753852,0.00001169359,0.00003335369,0.0001804345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888635,0.00006480929,0.0004898879,0.0001770576,0.00018608684,0.00019583055],"domain_scores_gemma":[0.9993448,0.00007021802,0.00019693721,0.00011247378,0.00018658745,0.00008895326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043505194,0.00017721728,0.00033695638,0.0002343815,0.000067900786,0.00015730684,0.00005532692,0.00007357373,0.00000899294],"category_scores_gemma":[0.000073532974,0.0001430099,0.0000269038,0.00016338819,0.000033546905,0.00026664534,0.00000925227,0.0002838504,0.0000011908563],"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.0000643008,0.0000127322355,0.0033247452,0.00022622594,0.00004709599,0.0001542346,0.00029523324,0.99000734,0.005376741,0.0000081265,0.00004062405,0.00044258498],"study_design_scores_gemma":[0.002162008,0.00013711223,0.010612285,0.00394588,0.0000524449,0.0018053654,0.0018339013,0.9315815,0.047299627,0.000028253806,0.00013759323,0.00040403774],"about_ca_topic_score_codex":0.000025089246,"about_ca_topic_score_gemma":0.0000122918145,"teacher_disagreement_score":0.058425866,"about_ca_system_score_codex":0.00011945101,"about_ca_system_score_gemma":0.00006834186,"threshold_uncertainty_score":0.5831774},"labels":[],"label_agreement":null},{"id":"W3206961072","doi":"10.5267/j.ijiec.2021.8.003","title":"An algorithm for a no-wait flowshop scheduling problem for minimizing total tardiness with a constraint on total completion time","year":2021,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Kuwait University","keywords":"Tardiness; Benchmark (surveying); Computer science; Algorithm; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Mathematics; Schedule","score_opus":0.019736753393790843,"score_gpt":0.25101466957287455,"score_spread":0.23127791617908372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206961072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03653789,0.000027618573,0.9602587,0.0003001862,0.002218598,0.00028903762,0.00019684715,0.00012966822,0.000041414845],"genre_scores_gemma":[0.126471,0.0000028397649,0.87067825,0.00003818353,0.002380104,0.00003917918,0.00029981122,0.00006569205,0.00002491615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00002015089,0.00058525667,0.00018700436,0.00037329437,0.00021830555],"domain_scores_gemma":[0.9975263,0.00038578457,0.00016000276,0.00009319487,0.0016628145,0.00017191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002714748,0.00021517773,0.00031286373,0.00030592494,0.00007886053,0.00020872169,0.00017883482,0.00012531679,0.000026869338],"category_scores_gemma":[0.00033362836,0.00021962314,0.00016241906,0.00020306624,0.000021823575,0.00026883645,0.000013118133,0.00029966954,0.0000041065096],"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.00007287656,0.00008996695,0.000004377682,0.000012841252,0.00036208364,0.0000196981,0.00010979871,0.9805581,0.0015028635,0.0002602464,0.00013265682,0.016874477],"study_design_scores_gemma":[0.003330666,0.0003199678,0.000015892068,0.0003588029,0.000058248766,0.00039442116,0.00009925147,0.9934783,0.0013553874,0.00002968915,0.0003141279,0.00024523845],"about_ca_topic_score_codex":0.0000013517813,"about_ca_topic_score_gemma":2.6962923e-7,"teacher_disagreement_score":0.08993311,"about_ca_system_score_codex":0.0001843654,"about_ca_system_score_gemma":0.00024702324,"threshold_uncertainty_score":0.89559716},"labels":[],"label_agreement":null},{"id":"W3208759299","doi":"10.1155/2021/5531063","title":"Enabling In-Depot Automated Routing and Recharging Scheduling for Automated Electric Bus Transit Systems","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Postdoctoral Program for Innovative Talents; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Scheduling (production processes); Computer science; Automation; Job shop scheduling; Solver; Routing (electronic design automation); Constraint programming; Mathematical optimization; Integer programming; Real-time computing; Engineering; Stochastic programming; Embedded system; Algorithm; Mathematics","score_opus":0.009291301511945885,"score_gpt":0.24231138917651093,"score_spread":0.23302008766456506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208759299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6827263,0.0025828031,0.31350556,0.000034984096,0.00052243506,0.00013587406,0.0000045974425,0.00047861142,0.0000088137585],"genre_scores_gemma":[0.8273855,0.0005310395,0.1719319,0.00000924838,0.00007256102,0.0000066508965,0.000025552974,0.000035024183,0.0000025474005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987217,0.00002437083,0.00072989386,0.00013646284,0.00016403513,0.00022353277],"domain_scores_gemma":[0.9992601,0.000115592375,0.00018940866,0.000058651895,0.0003052785,0.000070934475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031804646,0.00014066318,0.00030410945,0.0002740452,0.00006472592,0.00005644315,0.000049753955,0.00009591415,0.0000014559273],"category_scores_gemma":[0.00008178381,0.00015423346,0.000065695,0.0005950265,0.000005511953,0.0003979368,6.0871025e-7,0.00021804149,2.4448667e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028824268,0.000014515477,0.00017468196,0.00017819538,0.000038067035,0.00004360209,0.0010623287,0.94868845,0.046683263,0.000054139167,0.0000010303676,0.0030329032],"study_design_scores_gemma":[0.0016143963,0.000038065737,0.0030025102,0.00048706483,0.00005251746,0.00006134066,0.001557679,0.98110855,0.0118715465,0.000026966814,0.000016369897,0.00016300096],"about_ca_topic_score_codex":0.0000024805965,"about_ca_topic_score_gemma":0.000008131241,"teacher_disagreement_score":0.14465915,"about_ca_system_score_codex":0.00008086445,"about_ca_system_score_gemma":0.00006478658,"threshold_uncertainty_score":0.6289458},"labels":[],"label_agreement":null},{"id":"W3213715850","doi":"10.18280/jesa.540505","title":"A Novel Hybrid Algorithm of Max-Min Ant System with Quadratic Programming to Solve the Unit Commitment Problem","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Mathematical optimization; Particle swarm optimization; Computer science; Genetic algorithm; Quadratic programming; Algorithm; MATLAB; Swarm behaviour; Schedule; Metaheuristic; Parallel metaheuristic; Meta-optimization; Mathematics","score_opus":0.01696474311065474,"score_gpt":0.23075852076933076,"score_spread":0.21379377765867602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213715850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026545888,0.0010217378,0.97034454,0.0001670043,0.00038635876,0.0005177188,0.000028522685,0.00041273728,0.0005755002],"genre_scores_gemma":[0.16279265,0.000039839597,0.8366171,0.00004424818,0.00016252085,0.00005293668,0.000009542413,0.00009633576,0.00018481116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792206,0.000113050286,0.00076509576,0.0002047514,0.00057041115,0.0004246561],"domain_scores_gemma":[0.99858266,0.000119803924,0.00024619178,0.0003611014,0.0004635254,0.00022670851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057529076,0.00029215665,0.00045197888,0.0001554847,0.00029303442,0.0003555779,0.0003169095,0.000047234986,0.000024618079],"category_scores_gemma":[0.00005498058,0.00019795338,0.00011306539,0.0006852583,0.00006635616,0.00016209288,0.0000680601,0.00034137236,0.00002517634],"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.00001489812,0.00020384621,0.00018926276,0.0011093502,0.0006968364,0.00055564934,0.0035873966,0.5626636,0.0013645854,0.00082402217,0.00031227648,0.42847824],"study_design_scores_gemma":[0.001016859,0.0002916222,0.004024681,0.002457658,0.00016570969,0.008152095,0.0037181864,0.9757599,0.0032086773,0.000035628324,0.0007524913,0.0004164586],"about_ca_topic_score_codex":0.000022525377,"about_ca_topic_score_gemma":0.000018507628,"teacher_disagreement_score":0.42806178,"about_ca_system_score_codex":0.00023222769,"about_ca_system_score_gemma":0.00016291303,"threshold_uncertainty_score":0.8072305},"labels":[],"label_agreement":null},{"id":"W3215818410","doi":"10.1109/rams48097.2021.9605799","title":"Joint Optimization of the Production Scheduling, Maintenance Activities, and Inventory Level for a Degrading Flexible Job-Shop Manufacturing System","year":2021,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Job shop scheduling; Job shop; Time horizon; Markov chain; Industrial engineering; Reliability engineering; Flow shop scheduling; Mathematical optimization; Engineering; Schedule; Operations management; Machine learning","score_opus":0.03392420863145533,"score_gpt":0.2216062820192356,"score_spread":0.18768207338778026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215818410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1063653,0.0003460917,0.8908687,0.00013545413,0.0009863519,0.0002710293,0.000007982679,0.0002618233,0.0007572263],"genre_scores_gemma":[0.67212665,0.00006604115,0.32604825,0.000021072274,0.0001078934,0.000038240876,0.0000070065275,0.000033720655,0.0015511276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992937,0.00002192868,0.00022832621,0.0001836416,0.00011429321,0.00015815232],"domain_scores_gemma":[0.9995999,0.000026218475,0.00006183593,0.00019026475,0.00008491045,0.000036898684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017968134,0.000116470896,0.00015497462,0.000062700536,0.00011525373,0.00004115352,0.000058797246,0.00005443413,0.000009069274],"category_scores_gemma":[0.00010494194,0.0000962747,0.000055507207,0.00013656392,0.000027473985,0.00014943452,0.000030965748,0.00009076667,3.3375883e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038278145,0.00000689484,0.000106181,0.0004190135,0.000031678414,2.8958127e-7,0.0001751556,0.9958775,0.0018226736,0.00068179134,0.00007120381,0.0008037987],"study_design_scores_gemma":[0.00017238254,0.000004823572,0.00008999266,0.00025191405,0.000017924403,0.000020149602,0.0011282375,0.75118285,0.24698123,0.000015839963,0.000039162594,0.00009547012],"about_ca_topic_score_codex":0.0000062510185,"about_ca_topic_score_gemma":0.0000068481254,"teacher_disagreement_score":0.5657613,"about_ca_system_score_codex":0.00010876301,"about_ca_system_score_gemma":0.000039150385,"threshold_uncertainty_score":0.39259684},"labels":[],"label_agreement":null},{"id":"W3216891387","doi":"10.1109/etfa45728.2021.9613611","title":"Embedding Reinforcement Learning in Simulation","year":2021,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reinforcement learning; Embedding; Computer science; Field (mathematics); Visualization; Domain (mathematical analysis); Truck; Discrete event simulation; Artificial intelligence; Industrial engineering; Simulation; Engineering","score_opus":0.012930293854495001,"score_gpt":0.2581033303218984,"score_spread":0.2451730364674034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216891387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032978024,0.0000669161,0.9458719,0.000025407802,0.00013822215,0.000023041344,3.3991885e-8,0.00029302618,0.020603457],"genre_scores_gemma":[0.96290696,0.00001503856,0.035608143,0.000028255085,0.000023030148,0.0000017383425,0.000009354216,0.000007787767,0.0013996732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997212,0.000006375802,0.000093493276,0.000051241415,0.000052945205,0.00007472172],"domain_scores_gemma":[0.9998898,0.000026539781,0.0000049528467,0.00004235531,0.000019669631,0.000016673781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000047037465,0.00003622276,0.00004178338,0.00003795302,0.000015821764,0.000018981704,0.000014829919,0.000023803153,0.00034727354],"category_scores_gemma":[0.000041304575,0.000040228246,0.00001108169,0.00014038928,0.0000015225511,0.00005428306,0.000006783279,0.000068767295,0.000028787512],"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":[2.9212302e-7,0.0000014230263,0.00025688714,0.0000043950204,0.0000021829983,0.0000027390658,0.0001205083,0.99694365,0.00008127005,0.000072039365,0.000006276461,0.0025083118],"study_design_scores_gemma":[0.00012851878,0.0000019721117,0.000099022785,0.000009685927,8.808806e-7,5.2668656e-7,0.00016515817,0.99755794,0.0015582452,0.000008936413,0.0004171795,0.00005190695],"about_ca_topic_score_codex":0.0000015957437,"about_ca_topic_score_gemma":0.0000021622377,"teacher_disagreement_score":0.92992896,"about_ca_system_score_codex":0.000028284603,"about_ca_system_score_gemma":0.0000060695484,"threshold_uncertainty_score":0.38024017},"labels":[],"label_agreement":null},{"id":"W35753949","doi":"10.1111/ele.14058","title":"Modeling a fault tolerant multiagent system for the control of a mobile robot using MaSE methodology","year":2006,"lang":"en","type":"article","venue":"ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Center for Makroøkologi, Evolution og Klima; University of Manitoba","keywords":"Robot; Mobile robot; Fault tolerance; Control system; Reliability (semiconductor); Multi-agent system; Computer science; Control engineering; Embedded system; Distributed computing; Engineering; Artificial intelligence","score_opus":0.05892950777376385,"score_gpt":0.2947631496691855,"score_spread":0.23583364189542164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35753949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09794661,0.00003784367,0.90029943,0.00008282258,0.00063861196,0.00055834994,0.00001582237,0.00007191138,0.00034859343],"genre_scores_gemma":[0.7982799,0.000003667778,0.20145209,0.000039570074,0.000119231896,0.00008439547,0.0000011087715,0.000012268763,0.000007796564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985101,0.000007614345,0.00043308252,0.00029640767,0.0005168046,0.00023599654],"domain_scores_gemma":[0.9986962,0.00012747332,0.00019522372,0.00015498731,0.0007823265,0.00004378459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007948593,0.00016935838,0.00024295016,0.0001442591,0.00016752965,0.0001096044,0.0012410926,0.000053865053,0.0000046484774],"category_scores_gemma":[0.000033494583,0.0001147891,0.000094631556,0.00029499325,0.00019446651,0.00012507755,0.00013284867,0.0001357385,0.000001022373],"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.000037398906,0.00002551145,0.000011012413,0.000040211147,0.000029452196,8.296092e-8,0.00014916704,0.91512,0.03500648,0.04727926,0.0000074894842,0.0022939527],"study_design_scores_gemma":[0.00055822136,0.000026155554,0.00003346328,0.000103133905,0.000026627169,0.0000073920955,0.00024767636,0.9697166,0.028673615,0.0004821171,0.000008911859,0.00011609073],"about_ca_topic_score_codex":0.000031119063,"about_ca_topic_score_gemma":7.039057e-7,"teacher_disagreement_score":0.70033324,"about_ca_system_score_codex":0.000111668225,"about_ca_system_score_gemma":0.00007200931,"threshold_uncertainty_score":0.46809638},"labels":[],"label_agreement":null},{"id":"W4200572948","doi":"10.1287/ijoc.2021.1113","title":"Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem","year":2021,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Benders' decomposition; Benchmark (surveying); Computer science; Scheduling (production processes); Integer programming; Range (aeronautics); Set (abstract data type); Algorithm; Mathematics; Routing (electronic design automation); Engineering","score_opus":0.020941322861145688,"score_gpt":0.2660338223751495,"score_spread":0.2450924995140038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200572948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024791306,0.0005002279,0.97367096,0.000567812,0.00017287329,0.00013465463,0.0000030406593,0.00007789073,0.000081221246],"genre_scores_gemma":[0.53413004,0.00004193461,0.46549666,0.00022227247,0.00006147112,0.0000027294195,0.00002959541,0.0000109628845,0.00000431498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000007438565,0.0002891673,0.00008453996,0.00010238652,0.00015001897],"domain_scores_gemma":[0.99924856,0.0002658465,0.000085972744,0.00006340751,0.00027321765,0.00006296171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002904861,0.00011344045,0.0001043316,0.000084607884,0.00043597526,0.00025016748,0.00005154285,0.00005426881,0.000003240989],"category_scores_gemma":[0.00009660555,0.00008069417,0.000030842428,0.00022042364,0.00001845886,0.00016480479,0.000013197619,0.00025485817,6.078778e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010781867,0.000010213594,0.000119154145,0.000024381616,0.000031392483,6.553248e-7,0.00023499096,0.9658415,0.0001360578,0.0010251658,0.0000055364844,0.03256017],"study_design_scores_gemma":[0.00093908963,0.0000386922,0.00068369356,0.0001325842,0.000019216865,0.000098183766,0.00026616358,0.99703735,0.00023532832,0.00032578074,0.00011514038,0.00010878298],"about_ca_topic_score_codex":0.0000028464187,"about_ca_topic_score_gemma":0.000005712689,"teacher_disagreement_score":0.50933874,"about_ca_system_score_codex":0.00004941808,"about_ca_system_score_gemma":0.000049276627,"threshold_uncertainty_score":0.33532134},"labels":[],"label_agreement":null},{"id":"W4205129545","doi":"10.1007/978-3-030-91025-9_5","title":"Concurrent Open Shops","year":2021,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Open shop; Computer science; Scheduling (production processes); Open-shop scheduling; Notation; Flow shop scheduling; Job shop scheduling; Minification; Arithmetic; Mathematics; Mathematical optimization; Programming language; Operating system; Schedule","score_opus":0.08011172131916172,"score_gpt":0.41303055406417755,"score_spread":0.3329188327450158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205129545","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087108737,0.0002909258,0.0033500849,0.0076185856,0.0058162236,0.0035536983,0.00020057248,0.00020818788,0.97809064],"genre_scores_gemma":[0.08274473,0.019075727,0.05801857,0.00024088062,0.0006100659,0.002722495,0.0010698218,0.00020142022,0.8353163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9843333,0.00024470332,0.0016917546,0.0025081714,0.009366001,0.0018560736],"domain_scores_gemma":[0.993839,0.00016550494,0.00006663086,0.0016661751,0.0038020469,0.00046059288],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["sts","open_science"],"category_scores_codex":[0.013099938,0.0007105583,0.00057638873,0.010284332,0.002650467,0.009728644,0.011484911,0.00023801054,0.005202487],"category_scores_gemma":[0.00088299083,0.00078406854,0.00013843282,0.0055067106,0.006297891,0.008285988,0.008514505,0.0021360605,0.00058480044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028881614,0.00016166766,0.00003965609,0.000058027108,0.000106844374,0.0002477002,0.00038308703,0.37889722,0.00012314878,0.61249965,0.0013867794,0.0060673454],"study_design_scores_gemma":[0.0020510692,0.00018686958,0.0011945601,0.0018695139,0.000025817044,0.00007086091,0.007889129,0.62411344,0.00073550973,0.010031707,0.35003302,0.0017985252],"about_ca_topic_score_codex":0.00037617274,"about_ca_topic_score_gemma":0.0048464146,"teacher_disagreement_score":0.60246795,"about_ca_system_score_codex":0.0058111697,"about_ca_system_score_gemma":0.0009110143,"threshold_uncertainty_score":0.99950445},"labels":[],"label_agreement":null},{"id":"W4205362192","doi":"10.5267/j.ijiec.2021.10.003","title":"A branch and bound method in a permutation flow shop with blocking and setup times","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Flow shop scheduling; Permutation (music); Blocking (statistics); Computer science; Upper and lower bounds; Branch and bound; Scheduling (production processes); Job shop scheduling; Mathematical optimization; Exploit; Algorithm; Parallel computing; Mathematics; Routing (electronic design automation); Embedded system","score_opus":0.015070565385696202,"score_gpt":0.25338054438582075,"score_spread":0.23830997900012454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205362192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4214031,0.00027960681,0.5766742,0.00047527856,0.00094999385,0.00009470104,0.000019991814,0.000055443877,0.000047665795],"genre_scores_gemma":[0.89967513,0.000013561179,0.10003196,0.000020152178,0.00021091479,0.0000072713397,0.000012862485,0.000020150526,0.00000801629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992153,0.00003082374,0.0003005221,0.0000838089,0.0002768305,0.00009270905],"domain_scores_gemma":[0.9995347,0.00019535705,0.00007393615,0.000031933338,0.00011023389,0.00005378959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002900803,0.00009717723,0.00014069742,0.00046768034,0.000054116248,0.00009466021,0.00009898998,0.00003573855,0.000025280367],"category_scores_gemma":[0.000076048345,0.00010196499,0.00002303091,0.00023949676,0.000011993039,0.00016914438,0.000031532094,0.000376219,1.9677512e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002223046,0.000014037301,0.00049493357,0.000003656929,0.000087557244,0.000026337635,0.0007346707,0.98652345,0.000073398915,0.00013254395,0.000028221559,0.011858953],"study_design_scores_gemma":[0.0013937472,0.00006049421,0.0004701336,0.00006233088,0.000017163517,0.00044105074,0.00024767537,0.99685365,0.000053031847,0.00008193985,0.00021257575,0.00010619021],"about_ca_topic_score_codex":0.000007383172,"about_ca_topic_score_gemma":0.0000018286506,"teacher_disagreement_score":0.478272,"about_ca_system_score_codex":0.00011369985,"about_ca_system_score_gemma":0.000053348584,"threshold_uncertainty_score":0.41580117},"labels":[],"label_agreement":null},{"id":"W4206172178","doi":"10.5267/j.ijiec.2021.11.002","title":"Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Tardiness; Computer science; Scheduling (production processes); Mathematical optimization; Integer programming; Due date; Job shop scheduling; Algorithm; Mathematics; Schedule","score_opus":0.034967296148163504,"score_gpt":0.2614152749469364,"score_spread":0.22644797879877288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206172178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045162044,0.00013667738,0.9507052,0.0003705564,0.0031888415,0.00020916178,0.00012414016,0.000087376015,0.000016012867],"genre_scores_gemma":[0.67210656,0.000007089259,0.32677045,0.00002184437,0.000971702,0.000023775932,0.000027786824,0.0000511708,0.000019639356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987128,0.000020853267,0.0004749631,0.00010324367,0.00051640027,0.00017173625],"domain_scores_gemma":[0.99873704,0.00037898382,0.00019025564,0.00007857689,0.0005545143,0.00006065564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035629078,0.00015485815,0.00017852403,0.00025993964,0.0001985941,0.00014858998,0.00035616464,0.000034289962,0.00003864316],"category_scores_gemma":[0.00015478319,0.00013140336,0.00008549028,0.00026173456,0.000020154848,0.00016452017,0.000055070675,0.00046437507,6.7073375e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035623383,0.000023115728,0.000026456064,0.0000060303414,0.00036369872,0.00002450766,0.00016066668,0.9969152,0.00014949926,0.00019693947,0.0001102093,0.0019880314],"study_design_scores_gemma":[0.0011408306,0.000060352355,0.0000047650406,0.000069715825,0.0000805599,0.0008072902,0.00028331956,0.99662554,0.00022283691,0.000055650195,0.0004919507,0.00015719538],"about_ca_topic_score_codex":0.000006951711,"about_ca_topic_score_gemma":2.2913926e-7,"teacher_disagreement_score":0.6269445,"about_ca_system_score_codex":0.00026679665,"about_ca_system_score_gemma":0.00018997796,"threshold_uncertainty_score":0.53584737},"labels":[],"label_agreement":null},{"id":"W4206764064","doi":"10.5267/j.ijiec.2021.12.001","title":"An extensive and systematic literature review for hybrid flowshop scheduling problems","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Systematic review; Job shop scheduling; Operations research; Industrial engineering; Mathematical optimization; Schedule; Mathematics","score_opus":0.01997556386793187,"score_gpt":0.25983109668257126,"score_spread":0.2398555328146394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206764064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013887554,0.03185602,0.94667035,0.00090492464,0.0055587366,0.0007914596,0.00014264457,0.00017762167,0.000010673021],"genre_scores_gemma":[0.7476627,0.004971134,0.24325058,0.0006116321,0.0027452947,0.00025872324,0.00032606607,0.00014875093,0.000025118848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988269,0.000038889284,0.00058664184,0.000101770245,0.0003333841,0.00011238806],"domain_scores_gemma":[0.9988573,0.00020267455,0.00017198855,0.00008157528,0.000595035,0.00009140104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004994353,0.00012998113,0.0002757829,0.00033111405,0.000080660444,0.00012126955,0.0002617704,0.00003373641,0.0000108636705],"category_scores_gemma":[0.0003996285,0.0001326276,0.000092993076,0.00021999632,0.0000077643335,0.00024138433,0.00002628071,0.00038286293,4.2176848e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006353616,0.000020551768,0.0000030373083,0.0012901678,0.00015817206,0.00001971127,0.00016327309,0.99705905,0.00010066331,0.00016379615,0.0002364333,0.00077882153],"study_design_scores_gemma":[0.0007223132,0.00008899874,0.0000033764231,0.009393941,0.0000716209,0.00075179053,0.00007210492,0.9883713,0.000046702746,0.000051474402,0.0002904209,0.0001359698],"about_ca_topic_score_codex":4.798954e-7,"about_ca_topic_score_gemma":6.472874e-8,"teacher_disagreement_score":0.73377514,"about_ca_system_score_codex":0.00011471496,"about_ca_system_score_gemma":0.000048273043,"threshold_uncertainty_score":0.5408397},"labels":[],"label_agreement":null},{"id":"W4210677236","doi":"10.1007/s11750-021-00621-1","title":"A robust optimization approach for the unrelated parallel machine scheduling problem","year":2022,"lang":"en","type":"article","venue":"Top","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"HEC Montréal","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Job shop scheduling; Mathematical optimization; Robust optimization; Scheduling (production processes); Optimization problem; Algorithm; Schedule; Mathematics","score_opus":0.022118782462847,"score_gpt":0.21242867411420843,"score_spread":0.19030989165136142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210677236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013844547,0.00093017874,0.9958411,0.00022884704,0.00020588984,0.00043997128,0.000015204869,0.00041438275,0.0017859894],"genre_scores_gemma":[0.023867235,0.000043905307,0.9745748,0.00008175212,0.00007833092,0.00043853826,0.00021372463,0.00004764875,0.0006540785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936086,0.00002333179,0.00016564518,0.0001417383,0.00013109382,0.00017732636],"domain_scores_gemma":[0.99967754,0.000061140614,0.000030328009,0.00016441286,0.000033116205,0.00003343411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606779,0.00010530793,0.0000953437,0.000053026855,0.0003490075,0.000041621915,0.00017380367,0.000038306953,0.00018979481],"category_scores_gemma":[0.000020822072,0.0000883657,0.000049535538,0.00030268801,0.0000122548,0.00005287171,0.000039436727,0.00021109746,0.0000020913592],"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.000010916312,0.000020111813,0.000017740313,0.000016897848,0.000037319056,2.9583504e-7,0.00023231258,0.99806774,0.0000049029272,0.00040460762,0.00014961128,0.0010375426],"study_design_scores_gemma":[0.0005040264,0.00001928334,0.0000034273062,0.0000023509165,0.000025676734,0.000006911357,0.00024136859,0.9984831,0.000015485983,0.00003221025,0.00054471055,0.000121456236],"about_ca_topic_score_codex":0.0000073768147,"about_ca_topic_score_gemma":3.37023e-7,"teacher_disagreement_score":0.023728788,"about_ca_system_score_codex":0.000052211108,"about_ca_system_score_gemma":0.000014821029,"threshold_uncertainty_score":0.36034486},"labels":[],"label_agreement":null},{"id":"W4211052544","doi":"10.1287/inte.1100.0522","title":"Contributors","year":2010,"lang":"en","type":"article","venue":"INFORMS Journal on Applied Analytics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Business; Computer science","score_opus":0.006747082050140396,"score_gpt":0.2145491325432109,"score_spread":0.2078020504930705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211052544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3361902,0.000062753024,0.329866,0.00047468022,0.0073761623,0.00030634555,0.000026228196,0.0012822847,0.32441533],"genre_scores_gemma":[0.9788625,0.00005528011,0.019908048,0.00038740144,0.0005470925,0.000002067415,0.00000699249,0.000028339588,0.0002022608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999218,0.0000012184297,0.0002869777,0.000053577805,0.00022105395,0.00021919748],"domain_scores_gemma":[0.9995109,0.000034557375,0.000058462618,0.00013943262,0.000068666406,0.00018800388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020109775,0.00012520775,0.00014162713,0.00015716114,0.00009374001,0.00014748449,0.00015224959,0.00010918205,0.00020002111],"category_scores_gemma":[0.00003964119,0.000097797536,0.00006472139,0.00019070863,0.00002491448,0.000082904924,0.000008251657,0.0007990901,0.00025079557],"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.00001918368,0.000031076976,0.00019660198,0.000010178811,0.00012728457,0.000017201848,0.00015646836,0.93215007,0.000847513,0.0266146,0.002808417,0.037021402],"study_design_scores_gemma":[0.0017031542,0.000062695784,0.00040377307,0.000019031668,0.00004892376,0.000161693,0.00019729961,0.89815426,0.0068732826,0.0023378385,0.089473255,0.00056477427],"about_ca_topic_score_codex":1.7770022e-7,"about_ca_topic_score_gemma":9.415632e-7,"teacher_disagreement_score":0.6426723,"about_ca_system_score_codex":0.000033873916,"about_ca_system_score_gemma":0.000024941492,"threshold_uncertainty_score":0.39880678},"labels":[],"label_agreement":null},{"id":"W4212934617","doi":"10.1016/j.cor.2022.105738","title":"A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":35,"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; Transport Canada","funders":"Shanghai Jiao Tong University; National Natural Science Foundation of China","keywords":"Computer science; Preventive maintenance; Variable neighborhood search; Algorithm; Scheduling (production processes); Variable (mathematics); Mathematical optimization; Mathematics; Reliability engineering; Metaheuristic; Engineering","score_opus":0.031321115882438216,"score_gpt":0.3209983998812939,"score_spread":0.28967728399885573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212934617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015616358,0.0016280174,0.99261314,0.0015208727,0.00025403616,0.0015283324,0.0004672385,0.00023623301,0.00019049006],"genre_scores_gemma":[0.055244777,0.00019871783,0.94170094,0.00022119957,0.00013489868,0.0011268439,0.00064347906,0.00006677947,0.0006623681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976726,0.00035326843,0.00039992578,0.00044735128,0.0004279778,0.0006988739],"domain_scores_gemma":[0.99881876,0.0002717994,0.000020581561,0.00027442796,0.0003289435,0.0002855149],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015207643,0.00019578615,0.00028147333,0.00040358875,0.00210073,0.00030392315,0.00027056743,0.000046957586,0.00014524005],"category_scores_gemma":[0.00006260841,0.0002177099,0.000055326174,0.0007892472,0.000107601925,0.00021356245,0.00030296805,0.0007503305,0.000005140531],"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.0000073408078,0.00008204713,0.000025697,0.00006198818,0.000083286846,0.000004365409,0.00084089296,0.980453,0.00009911109,0.007472126,0.0007977683,0.010072373],"study_design_scores_gemma":[0.0012350373,0.00021554953,0.000027890692,0.0000487514,0.00000659105,0.00005515851,0.00042974512,0.9960171,0.00003678636,0.00062297925,0.0010909156,0.00021351538],"about_ca_topic_score_codex":0.000219976,"about_ca_topic_score_gemma":0.000037315196,"teacher_disagreement_score":0.053683143,"about_ca_system_score_codex":0.00031608393,"about_ca_system_score_gemma":0.0004303424,"threshold_uncertainty_score":0.9991984},"labels":[],"label_agreement":null},{"id":"W4212966073","doi":"10.5220/0010803100003116","title":"Discrete Mother Tree Optimization and Swarm Intelligence for Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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 Regina","funders":"","keywords":"Constraint satisfaction; Computer science; Constraint satisfaction problem; Swarm intelligence; Constraint satisfaction dual problem; Mathematical optimization; Tree (set theory); Constraint (computer-aided design); Constraint programming; Constraint logic programming; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Combinatorics; Stochastic programming","score_opus":0.05902317409062221,"score_gpt":0.2823177968179281,"score_spread":0.2232946227273059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212966073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19290322,0.000100435136,0.79054123,0.0036830269,0.0024217295,0.0014658796,0.00021583239,0.00021564166,0.008453009],"genre_scores_gemma":[0.98892474,0.00016427388,0.010538036,0.00008391742,0.000053955187,0.0000880375,0.0000063179286,0.000017701084,0.00012302893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.000006612983,0.00032102483,0.00021783907,0.00025070843,0.00013127975],"domain_scores_gemma":[0.99954927,0.00003551973,0.0001264977,0.000053073556,0.00018929438,0.000046358327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021042714,0.00013503424,0.00011944264,0.0000968551,0.000197042,0.000117494135,0.00022009797,0.00003577899,0.00018418502],"category_scores_gemma":[0.00006698481,0.000115414296,0.000041522,0.00012628548,0.0001163138,0.00013354432,0.000085545806,0.00015085815,0.0000010238108],"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.00005807281,0.000043429387,0.00058796146,0.000057492693,0.00005776543,1.2363188e-7,0.0012006777,0.74230677,0.001193576,0.1819954,0.000059915612,0.07243884],"study_design_scores_gemma":[0.000041172476,0.00008437076,0.00012372146,0.000051282394,0.0000123773225,0.0000050044714,0.0017773315,0.9760416,0.00925372,0.012353534,0.0001220993,0.00013377887],"about_ca_topic_score_codex":0.000015087921,"about_ca_topic_score_gemma":0.000004726891,"teacher_disagreement_score":0.7960215,"about_ca_system_score_codex":0.000045365163,"about_ca_system_score_gemma":0.000013113911,"threshold_uncertainty_score":0.47064584},"labels":[],"label_agreement":null},{"id":"W4213426406","doi":"10.1109/wsc52266.2021.9715441","title":"Multi-Agent System Model for Dynamic Scheduling in Flexibile Job Shops","year":2021,"lang":"en","type":"article","venue":"2021 Winter Simulation Conference (WSC)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Modular design; Schedule; Scheduling (production processes); Flexibility (engineering); Dynamic priority scheduling; Job shop scheduling; Distributed computing; Job shop; Industrial engineering; Real-time computing; Flow shop scheduling; Engineering; Operating system; Operations management","score_opus":0.04597044384997569,"score_gpt":0.2943200298854823,"score_spread":0.2483495860355066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213426406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055298623,0.00016694497,0.94300354,0.00006103541,0.0006531238,0.00026616346,0.000035616846,0.00022655076,0.00028837964],"genre_scores_gemma":[0.7880732,0.000012322417,0.2109609,0.00003377454,0.000055124325,0.00005191562,0.00010382328,0.000038830432,0.00067011564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870336,0.00003671784,0.00045532337,0.00036084227,0.00015980194,0.00028397626],"domain_scores_gemma":[0.9991377,0.00010657748,0.000048731454,0.00029385622,0.00032568973,0.00008747111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016904112,0.00020928524,0.00026749546,0.00014139319,0.0000625827,0.00013813103,0.0001380968,0.00014479563,0.00014326151],"category_scores_gemma":[0.00010417002,0.00023918749,0.00010147498,0.00024345386,0.000015373262,0.00020536229,0.000040860403,0.00017920928,0.000050118328],"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.000008569815,0.000023909257,0.00021039278,0.00010854955,0.000024824512,0.0000053501212,0.0007237776,0.99537086,0.00061985623,0.00017694954,0.0000056668678,0.0027212873],"study_design_scores_gemma":[0.0009236665,0.0000081108565,0.0002066051,0.00023432552,0.0000168684,0.0000021569465,0.0007696249,0.99706715,0.00043971778,0.00003407224,0.000037950835,0.00025977712],"about_ca_topic_score_codex":0.0000037047878,"about_ca_topic_score_gemma":0.000076730845,"teacher_disagreement_score":0.73277456,"about_ca_system_score_codex":0.00021276902,"about_ca_system_score_gemma":0.00009767613,"threshold_uncertainty_score":0.9753783},"labels":[],"label_agreement":null},{"id":"W4214530949","doi":"10.1007/978-0-387-74437-7_7","title":"Queuing Analysis","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Queueing theory; Computer network","score_opus":0.012669795847774215,"score_gpt":0.1969438003258985,"score_spread":0.18427400447812428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214530949","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000002669981,0.0007290923,0.10521649,0.000008179728,0.00016667426,0.000028653449,0.000005512131,0.0006160142,0.8932267],"genre_scores_gemma":[0.000563473,0.0016059442,0.058405284,0.000050206294,0.00016970755,0.0000018129535,0.00009608232,0.00007094557,0.93903655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994891,0.0000011442665,0.00016371963,0.00012943851,0.000120383025,0.00009617725],"domain_scores_gemma":[0.99968344,0.000015672731,0.000019949992,0.00019460802,0.00003352639,0.000052780673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000023153785,0.00016557891,0.00024195627,0.000299512,0.000027559003,0.000016906894,0.00007517325,0.0001905314,0.0024275226],"category_scores_gemma":[0.0000027534857,0.00016708182,0.00018474195,0.00007098721,0.000013141701,0.000023076813,0.000009624306,0.00016513001,0.0003497451],"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":[4.2879986e-7,0.0000013226368,0.000004945069,0.000011499523,0.0012310395,0.000016829015,0.000064045584,0.9844788,6.2440967e-7,0.0037387027,0.0056775277,0.004774273],"study_design_scores_gemma":[0.00007677578,0.0000040946657,0.000006807141,0.000018114573,0.00049496826,0.000006025424,0.0000044394446,0.8675407,0.000027300486,0.000111939946,0.1312682,0.00044058287],"about_ca_topic_score_codex":0.000003358719,"about_ca_topic_score_gemma":0.000007754071,"teacher_disagreement_score":0.12559068,"about_ca_system_score_codex":0.000034439498,"about_ca_system_score_gemma":0.000007497368,"threshold_uncertainty_score":0.9984844},"labels":[],"label_agreement":null},{"id":"W4214905240","doi":"10.1007/978-3-030-97099-4_5","title":"Improved Approximation Algorithms for Multiprocessor Scheduling with Testing","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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":"Computer science; Multiprocessor scheduling; Multiprocessing; Job shop scheduling; Competitive analysis; Scheduling (production processes); Upper and lower bounds; Parallel computing; Flow shop scheduling; sort; Algorithm; Partition (number theory); Online algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Schedule; Combinatorics; Operating system","score_opus":0.022041914195645218,"score_gpt":0.23508858272435498,"score_spread":0.21304666852870977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214905240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008050058,0.00025329468,0.99726963,0.00004914847,0.0008033642,0.000582417,0.000015430178,0.00041352375,0.00053267385],"genre_scores_gemma":[0.009031582,0.000008993724,0.990201,0.00011456573,0.00038012804,0.00007922018,0.00003701618,0.000090796275,0.000056704695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981778,0.000005741951,0.0003348815,0.00066620513,0.0004042883,0.0004110864],"domain_scores_gemma":[0.9988193,0.0003780124,0.00013105711,0.00033555328,0.00025110523,0.00008497288],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043418884,0.00037002045,0.00032064997,0.00042408664,0.0002777504,0.0001945862,0.0005286065,0.00016231544,0.000018985616],"category_scores_gemma":[0.00015058646,0.0003476999,0.00005056116,0.0004717386,0.00014780124,0.0002522608,0.00011151077,0.00056902773,0.0000019144134],"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.000004268342,0.000004942788,0.000004252342,0.000082442864,0.000007899457,0.0000023742316,0.00017055769,0.74832356,0.0000880891,0.000078850826,2.8511025e-7,0.2512325],"study_design_scores_gemma":[0.00042187015,0.00011603223,0.000002636672,0.00017769629,0.000013752782,0.000020359874,9.2675435e-7,0.99591976,0.0011522601,0.0016181086,0.00009449648,0.00046210244],"about_ca_topic_score_codex":0.000005387939,"about_ca_topic_score_gemma":0.0000069764546,"teacher_disagreement_score":0.2507704,"about_ca_system_score_codex":0.00024809653,"about_ca_system_score_gemma":0.00020213122,"threshold_uncertainty_score":0.9998975},"labels":[],"label_agreement":null},{"id":"W4221127026","doi":"10.5267/j.jpm.2022.1.001","title":"A size-reduction algorithm for the order scheduling problem with total tardiness minimization","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Tardiness; Scheduling (production processes); Computation; Computer science; Reduction (mathematics); Minification; Order (exchange); Algorithm; Mathematical optimization; Mathematics; Schedule; Job shop scheduling; Economics","score_opus":0.00994664725684886,"score_gpt":0.22911583152902104,"score_spread":0.2191691842721722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221127026","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020814503,0.0003207627,0.9952164,0.00037516278,0.0009087134,0.0007603767,0.0000055030987,0.00006722996,0.00026436723],"genre_scores_gemma":[0.020055411,0.000076069846,0.9782707,0.000036071666,0.0003607926,0.00024338221,0.000007747492,0.00004516269,0.00090468203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990535,0.000030235613,0.00030577037,0.00010205388,0.0003500998,0.0001583645],"domain_scores_gemma":[0.999468,0.000048061745,0.0001603306,0.0001079014,0.00019127196,0.00002439006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044501826,0.000117546246,0.0001382492,0.00016781136,0.00024383131,0.00007244307,0.000156465,0.000018450806,0.000038566897],"category_scores_gemma":[0.000012736546,0.0000827488,0.00006588774,0.00058341346,0.000013871708,0.00014934536,0.000040863964,0.00017764444,5.8351884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004186606,0.000042322863,0.00000437026,0.000049831062,0.00026643096,0.0000056812232,0.00041559877,0.94567376,0.000010869438,0.00005530459,0.0009814537,0.052452527],"study_design_scores_gemma":[0.0013098784,0.00021837627,0.000030549592,0.000029567836,0.00018284113,0.00018331282,0.004809148,0.98644215,0.00007562934,0.0000353224,0.006542601,0.00014065318],"about_ca_topic_score_codex":0.0000028090926,"about_ca_topic_score_gemma":3.3167044e-7,"teacher_disagreement_score":0.05231187,"about_ca_system_score_codex":0.00012909666,"about_ca_system_score_gemma":0.000041023788,"threshold_uncertainty_score":0.3374398},"labels":[],"label_agreement":null},{"id":"W4224296565","doi":"10.1007/s10479-022-04706-3","title":"A note on scheduling coupled tasks for minimum total completion time","year":2022,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Memorial University of Newfoundland","funders":"","keywords":"Zhàng; Computer science; Theory of computation; Scheduling (production processes); Mathematical optimization; Algorithm; Mathematics","score_opus":0.12244127384344361,"score_gpt":0.397452736203805,"score_spread":0.2750114623603614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224296565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86341274,0.00034425466,0.12714203,0.004615699,0.00039594603,0.0013626488,0.00040370328,0.00025266726,0.0020702954],"genre_scores_gemma":[0.96140975,0.000028671035,0.036558066,0.00009872556,0.00012360195,0.00036244845,0.00031128837,0.000036942558,0.0010705112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879515,0.000090622314,0.00022837459,0.00015633026,0.0004667389,0.00026275677],"domain_scores_gemma":[0.9990154,0.00023094741,0.000010271433,0.0002036752,0.00047585572,0.00006387228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010598437,0.000078977384,0.0001343596,0.00030844187,0.0005411356,0.00006019336,0.00015751508,0.00003701991,0.00052153657],"category_scores_gemma":[0.00027057435,0.0000882769,0.00006046885,0.0004644607,0.00004078624,0.000078858015,0.000050693186,0.00027415447,0.000060000537],"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.000034503726,0.00006904744,0.0000021217877,0.000015041795,0.0000194522,6.93745e-7,0.000265188,0.9880578,0.008619325,0.0007087256,0.0016032198,0.000604869],"study_design_scores_gemma":[0.00031817108,0.0002508985,0.000037235077,0.000011278875,0.000002272354,0.0000021975932,0.00015931595,0.9937703,0.0044520274,0.000035221674,0.0008713095,0.00008977781],"about_ca_topic_score_codex":0.000019512696,"about_ca_topic_score_gemma":0.0000031640755,"teacher_disagreement_score":0.09799699,"about_ca_system_score_codex":0.000039811985,"about_ca_system_score_gemma":0.00007183047,"threshold_uncertainty_score":0.571046},"labels":[],"label_agreement":null},{"id":"W4224924221","doi":"10.1007/s12063-021-00233-9","title":"Production scheduling optimization for parallel machines subject to physical distancing due to COVID-19 pandemic","year":2022,"lang":"en","type":"article","venue":"Operations Management Research","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Heuristics; Scheduling (production processes); Operations research; Mathematical optimization; Metaheuristic; Time horizon; Linear programming; Job shop scheduling; Schedule; Industrial engineering; Engineering; Algorithm; Mathematics","score_opus":0.06383921959644032,"score_gpt":0.3673449475933199,"score_spread":0.3035057279968796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224924221","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038235117,0.000035407997,0.95568454,0.0026739258,0.00033448642,0.002156516,0.000025290492,0.00034692776,0.00050779496],"genre_scores_gemma":[0.38684624,0.00002925374,0.60414076,0.00031319857,0.00037352365,0.0050880876,0.0003087017,0.00007184892,0.0028283498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831426,0.00013617918,0.0002182325,0.0004178354,0.0005271159,0.0003863652],"domain_scores_gemma":[0.9992129,0.00008561572,0.00001033295,0.00032163147,0.00016048097,0.00020904436],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013293334,0.00013535707,0.00014026572,0.00058664574,0.0013770462,0.00022424554,0.00026775087,0.00002224072,0.00013444317],"category_scores_gemma":[0.00036237657,0.00015025583,0.000044015145,0.001487738,0.000017030621,0.0001585884,0.00019631673,0.0002385235,0.000028526936],"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.000037221536,0.00006240571,0.00006320529,0.00007873628,0.000031643318,0.0000029645332,0.0010157474,0.9919175,0.00020614929,0.0019169323,0.0014228423,0.0032446585],"study_design_scores_gemma":[0.00030277486,0.00007926075,0.000032649048,0.000009522671,0.000011540522,0.000004131268,0.0012877946,0.9939247,0.000054071555,0.0000947101,0.0040187314,0.00018015852],"about_ca_topic_score_codex":0.000037369202,"about_ca_topic_score_gemma":0.00006378853,"teacher_disagreement_score":0.35154375,"about_ca_system_score_codex":0.0006506073,"about_ca_system_score_gemma":0.000055009827,"threshold_uncertainty_score":0.99992305},"labels":[],"label_agreement":null},{"id":"W4225606115","doi":"10.5267/j.jpm.2021.12.001","title":"Earliness/tardiness minimization in a no-wait flow shop with sequence-dependent setup times","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Sequence (biology); Mathematical optimization; Flow shop scheduling; Minification; Computer science; Scheduling (production processes); Job shop scheduling; Genetic algorithm; Retard; Due date; Function (biology); Productivity; Operations research; Algorithm; Mathematics; Economics; Schedule; Chemistry","score_opus":0.014799037976350866,"score_gpt":0.235635089205393,"score_spread":0.22083605122904212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225606115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18295233,0.001929864,0.76053816,0.0022500525,0.008354032,0.0039375233,0.00009437739,0.00086508866,0.039078593],"genre_scores_gemma":[0.54449207,0.0004443992,0.4478541,0.00022463193,0.0005245711,0.00018858911,0.000057833557,0.00014067975,0.00607314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987685,0.000055363762,0.0003874935,0.00012131671,0.00049154286,0.00017578875],"domain_scores_gemma":[0.99959195,0.000016482736,0.00012402721,0.00012752015,0.0001047594,0.00003526714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040041396,0.00013525273,0.0001995862,0.000492741,0.00006381237,0.000054999553,0.00020748576,0.00002357424,0.00022547801],"category_scores_gemma":[0.000011756955,0.00011705272,0.000047774844,0.00058564264,0.000010387413,0.00018310711,0.000065582506,0.00024071906,0.000007592771],"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.00007241315,0.00006340035,0.00038762175,0.00007702857,0.00010239264,0.00021844813,0.00039593704,0.99328107,0.000010506951,0.000027523338,0.0017194399,0.0036442406],"study_design_scores_gemma":[0.0015614909,0.00018082031,0.0002248528,0.000082685016,0.00006150363,0.00010221346,0.0016242175,0.98954314,0.00005456947,0.000022259133,0.006328369,0.00021385643],"about_ca_topic_score_codex":0.00000746208,"about_ca_topic_score_gemma":0.0000046624514,"teacher_disagreement_score":0.36153972,"about_ca_system_score_codex":0.00023261984,"about_ca_system_score_gemma":0.00004525486,"threshold_uncertainty_score":0.47732714},"labels":[],"label_agreement":null},{"id":"W4225807748","doi":"10.48550/arxiv.2111.07244","title":"A Simple Approximation Algorithm for Vector Scheduling and Applications to Stochastic Min-Norm Load Balancing","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Combinatorics; Approximation algorithm; Mathematics; Binary logarithm; Scheduling (production processes); Norm (philosophy); Upper and lower bounds; Monotone polygon; Sigma; Random variable; Discrete mathematics; Algorithm; Mathematical optimization; Computer science; Statistics; Physics; Schedule; Mathematical analysis","score_opus":0.0303294378637732,"score_gpt":0.19425158597246495,"score_spread":0.16392214810869174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225807748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032254603,0.00023153055,0.9658903,0.000017145694,0.0002578203,0.00082706194,0.00007888262,0.00035507607,0.000087610235],"genre_scores_gemma":[0.7419701,0.0000595915,0.25718993,0.000036884834,0.0002504767,0.00005104448,0.00025605047,0.000063228064,0.00012269971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988133,0.000017989614,0.00020506539,0.0006072037,0.000076272365,0.00028019046],"domain_scores_gemma":[0.99896437,0.00011178975,0.000073228446,0.0003879734,0.00026719167,0.00019546138],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014807895,0.0002727661,0.00029892518,0.00014867923,0.00015110028,0.0001282175,0.00021320855,0.00023285698,0.00001845045],"category_scores_gemma":[0.000057748257,0.00036963684,0.00010093922,0.00040530282,0.000026378144,0.000119069475,0.00019444685,0.00028077373,0.000011117083],"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.00000458119,0.000019517254,0.000016669163,0.00016808335,0.00007053866,0.0000036986037,0.00020734104,0.99248725,0.00005774438,0.00063398643,0.000011247321,0.006319333],"study_design_scores_gemma":[0.00039435577,0.000014350037,0.000054381937,0.00009324057,0.00010898582,0.0000025945237,0.0005028757,0.99754584,0.0001562704,0.00065985863,0.000083970284,0.0003832765],"about_ca_topic_score_codex":0.000024394367,"about_ca_topic_score_gemma":0.000022540424,"teacher_disagreement_score":0.7097155,"about_ca_system_score_codex":0.00031163983,"about_ca_system_score_gemma":0.000114903414,"threshold_uncertainty_score":0.99987555},"labels":[],"label_agreement":null},{"id":"W4226087358","doi":"10.5267/j.jpm.2022.1.002","title":"Solution methods for the integrated permutation flowshop and vehicle routing problem","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Job shop scheduling; Permutation (music); Vehicle routing problem; Mathematical optimization; Greedy algorithm; Computer science; Schedule; Production (economics); Iterated local search; Routing (electronic design automation); Focus (optics); Integrated production; Iterated function; Integer (computer science); Mathematics; Metaheuristic","score_opus":0.022835914594224623,"score_gpt":0.30762415065814597,"score_spread":0.28478823606392134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226087358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027125075,0.00057848264,0.99540037,0.0002999593,0.00036860383,0.00036141678,0.0000015210736,0.000037160808,0.00023997072],"genre_scores_gemma":[0.12534913,0.00013718299,0.87399584,0.000057472582,0.00007831117,0.00008069345,0.0000041037197,0.000018479126,0.00027881464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994483,0.00006920337,0.0002197658,0.000056954053,0.00011313316,0.00009264476],"domain_scores_gemma":[0.9997135,0.00007645503,0.00008577059,0.000052137028,0.000058549573,0.000013592939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013182107,0.00005823881,0.0000776876,0.00011899826,0.00019213298,0.0000474888,0.00008617442,0.000011355181,0.000010521397],"category_scores_gemma":[0.00002523846,0.000042799154,0.000040119266,0.00020976231,0.000007194647,0.000077800905,0.000036789872,0.00013716058,1.8964737e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029108236,0.000019091447,0.000019041094,0.000060360187,0.00015672037,0.000002022661,0.0014196532,0.7169138,0.0004364903,0.0005057553,0.00090113137,0.2795368],"study_design_scores_gemma":[0.0004167623,0.000072153234,0.0001058806,0.000012854465,0.00007070447,0.000015486536,0.0032130054,0.9882123,0.00012139427,0.0001028706,0.0076036057,0.00005302199],"about_ca_topic_score_codex":0.0000038629482,"about_ca_topic_score_gemma":5.819327e-7,"teacher_disagreement_score":0.2794838,"about_ca_system_score_codex":0.000099367106,"about_ca_system_score_gemma":0.0000126917985,"threshold_uncertainty_score":0.1745299},"labels":[],"label_agreement":null},{"id":"W4226523135","doi":"10.1142/s0217595922500129","title":"Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times","year":2022,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Computation; Integer programming; Mathematical optimization; Multiplicity (mathematics); Heuristic; Algorithm; Mathematics; Artificial intelligence; Schedule","score_opus":0.040207361377749454,"score_gpt":0.29309479929100035,"score_spread":0.2528874379132509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226523135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6938348,0.016088275,0.24186157,0.013146392,0.002009596,0.0027284503,0.0006596819,0.0005361991,0.029135052],"genre_scores_gemma":[0.80312705,0.00020844051,0.19267105,0.000027304015,0.0001441432,0.000029337469,0.000044335324,0.000044712804,0.0037036573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977502,0.00023893065,0.00037532276,0.0002131179,0.0011073302,0.00031507004],"domain_scores_gemma":[0.9988222,0.00032172445,0.000065021166,0.00016902605,0.00043766422,0.00018435137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015635936,0.00017853045,0.00024911555,0.0004179475,0.0006724479,0.00019589634,0.00024170548,0.000051693245,0.0015748108],"category_scores_gemma":[0.00017787643,0.0001430436,0.00004678214,0.00041490284,0.00009294512,0.0002587278,0.00007935818,0.0010864058,0.0000484596],"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.00022836137,0.00014507204,0.0023730698,0.000017993452,0.00010473853,0.000059258065,0.00030991738,0.9916401,0.00055934256,0.0010322909,0.0022725582,0.0012573032],"study_design_scores_gemma":[0.0018517479,0.00048645475,0.0012186982,0.000043828306,0.000012289664,0.00028485528,0.00074091693,0.9919158,0.000503659,0.000096618474,0.0026341698,0.00021096667],"about_ca_topic_score_codex":0.000030616342,"about_ca_topic_score_gemma":0.000005451766,"teacher_disagreement_score":0.10929224,"about_ca_system_score_codex":0.00013305238,"about_ca_system_score_gemma":0.00017426249,"threshold_uncertainty_score":0.9993379},"labels":[],"label_agreement":null},{"id":"W4229615600","doi":"10.1007/978-3-642-10326-1_8","title":"Machine Scheduling","year":2010,"lang":"en","type":"book-chapter","venue":"Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Audit; Computer science; Scheduling (production processes); Operations management; Business; Engineering; Accounting","score_opus":0.05163357037667106,"score_gpt":0.3245991249434952,"score_spread":0.27296555456682414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229615600","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000499655,0.0017881414,0.026280668,0.000282706,0.000677385,0.00035093175,0.00007668653,0.00041223716,0.97008127],"genre_scores_gemma":[0.0019919295,0.0013180622,0.20164686,0.000028028502,0.0007888581,0.00005420735,0.00040199843,0.00019669757,0.7935734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986537,0.00001826745,0.00025317262,0.00025884496,0.00051426596,0.0003017637],"domain_scores_gemma":[0.99885815,0.00007092003,0.000006565424,0.00048745208,0.00042939952,0.0001475321],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005037034,0.00020614063,0.000190024,0.00046964578,0.00041292387,0.00026048947,0.00028659854,0.00046735592,0.0041891164],"category_scores_gemma":[0.00009502581,0.0002116296,0.000066177454,0.00010464081,0.000115424795,0.000092860515,0.00006830149,0.0022636391,0.0021371136],"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.0000031412178,0.000015251071,0.0000013830934,0.000057630947,0.00009007579,0.000020273861,0.00017331023,0.86988586,0.0010032806,0.11578304,0.00068231224,0.012284438],"study_design_scores_gemma":[0.00014751797,0.000018443092,7.499913e-7,0.00006657029,0.000009202036,0.000009975214,0.000011964364,0.85566807,0.0005730293,0.0008340378,0.14236723,0.00029318116],"about_ca_topic_score_codex":0.000018330817,"about_ca_topic_score_gemma":0.00015457359,"teacher_disagreement_score":0.17650792,"about_ca_system_score_codex":0.00008247224,"about_ca_system_score_gemma":0.000118031356,"threshold_uncertainty_score":0.9986398},"labels":[],"label_agreement":null},{"id":"W4231157253","doi":"10.23952/jano.1.2019.3.03","title":"Variational principles in set optimization with domination structures and application to changing jobs","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Aix-Marseille Université","keywords":"Set (abstract data type); Mathematical optimization; Computer science; Mathematical economics; Mathematics; Programming language","score_opus":0.004617188997102028,"score_gpt":0.20274176481851575,"score_spread":0.1981245758214137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231157253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354597,0.00004592279,0.96363,0.000114929935,0.000075725715,0.00025750932,0.0000021944757,0.000031061278,0.00038293947],"genre_scores_gemma":[0.5619006,0.000053947846,0.43788165,0.000057350284,0.000055328102,0.000008682107,0.000019401828,0.000017646273,0.0000054055026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.000013561914,0.00033187584,0.00014282422,0.00020598099,0.00013265097],"domain_scores_gemma":[0.9995442,0.000052030122,0.00014267299,0.000066730434,0.000107142034,0.000087206536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021240403,0.0001275409,0.0002037772,0.00037037596,0.00004395454,0.000062892184,0.000055085384,0.000076799886,0.00002312117],"category_scores_gemma":[0.0000179019,0.0001106767,0.00001397356,0.0004502512,0.000012920904,0.00020916887,0.000016596794,0.00012356961,0.0000011442513],"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.00008919091,0.0000117148,0.0005413252,0.000023431896,0.000014519858,4.497336e-7,0.00056637084,0.99418586,0.00014556185,0.00168737,0.0000022103552,0.0027319859],"study_design_scores_gemma":[0.00082001643,0.00007068537,0.0021437719,0.000027070295,0.000015232975,0.000016410742,0.00021672879,0.996236,0.00017209353,0.00010087647,0.000043587304,0.0001375291],"about_ca_topic_score_codex":0.0000011669516,"about_ca_topic_score_gemma":2.848119e-7,"teacher_disagreement_score":0.5264409,"about_ca_system_score_codex":0.00005737189,"about_ca_system_score_gemma":0.000018632785,"threshold_uncertainty_score":0.4513265},"labels":[],"label_agreement":null},{"id":"W4231929282","doi":"10.32920/ryerson.14644443","title":"Selecting a Mix of Dispatching Rules for a Job Shop by Using Artificial Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial neural network; Job shop scheduling; Computer science; Job shop; Scheduling (production processes); Artificial intelligence; Operations research; Machine learning; Flow shop scheduling; Mathematical optimization; Engineering; Mathematics; Computer network","score_opus":0.02446414907907735,"score_gpt":0.2611571494728045,"score_spread":0.23669300039372715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231929282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30445737,0.0006230619,0.6934734,0.000016438507,0.0009567325,0.00017110124,0.000020575868,0.00021007446,0.000071249575],"genre_scores_gemma":[0.6406379,0.000025924868,0.3585689,0.000020773039,0.00042592094,0.000025466568,0.0001892943,0.00008150742,0.000024318002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.000029502206,0.00046856166,0.00030220798,0.00013487214,0.0002990293],"domain_scores_gemma":[0.9993709,0.00013568206,0.000099220204,0.00020304247,0.0001271381,0.000064045256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019133122,0.0002572025,0.00039540915,0.00008132251,0.000085343905,0.00016764573,0.0001501602,0.00028550322,0.000031103522],"category_scores_gemma":[0.000084687614,0.00028177944,0.000187616,0.00013714412,0.000015260483,0.00006224842,0.00012333161,0.0004610767,2.1668846e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050497983,0.000012498353,0.000116798925,0.00018160214,0.00007921926,8.71958e-7,0.00019731055,0.99206287,0.0006088248,0.00003014629,0.00004248806,0.0066623003],"study_design_scores_gemma":[0.0001021901,0.0000064467713,0.00000815827,0.00014723017,0.000058422185,0.0000034045643,0.00030395875,0.997435,0.0015897113,0.000060742954,0.0000034939014,0.00028126512],"about_ca_topic_score_codex":0.000098114,"about_ca_topic_score_gemma":0.000035940033,"teacher_disagreement_score":0.33618054,"about_ca_system_score_codex":0.00005886099,"about_ca_system_score_gemma":0.000037042377,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W4232014547","doi":"10.1007/978-3-662-53120-4_300548","title":"Production System","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science","score_opus":0.010689321025496112,"score_gpt":0.1820478046413809,"score_spread":0.1713584836158848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232014547","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022827737,0.00026277857,0.015459719,0.000013970245,0.0029116287,0.00012882022,0.0000029556468,0.0011759943,0.98004186],"genre_scores_gemma":[0.00052682933,0.00005772526,0.012044848,0.0000075314806,0.00044719677,0.0000021374656,0.000030235367,0.000072985604,0.9868105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957895,0.0000010361622,0.0001234051,0.00013070126,0.00009672133,0.00006915452],"domain_scores_gemma":[0.99970776,0.000004636246,0.000019001349,0.00020570343,0.00003819667,0.000024678655],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000036321308,0.00013252858,0.0001349391,0.000070117676,0.0000129564605,0.00001629032,0.000050147344,0.00016766651,0.0003143807],"category_scores_gemma":[0.0000021738388,0.00012663455,0.0000421819,0.000010460477,0.0000053780095,0.000027378492,0.000006630699,0.00013059432,0.0022797552],"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.000002274275,0.0000023169982,0.000001501488,0.0008896477,0.00016136687,0.000004882959,0.000047133588,0.6682553,0.000017263714,0.3011597,0.020049335,0.009409246],"study_design_scores_gemma":[0.00021501025,0.000023105506,0.000002460139,0.0007294688,0.00009754105,0.00005975462,0.000057511606,0.63214266,0.0004940729,0.00022659847,0.36495116,0.0010006899],"about_ca_topic_score_codex":5.0401997e-7,"about_ca_topic_score_gemma":4.7461086e-7,"teacher_disagreement_score":0.3449018,"about_ca_system_score_codex":0.00006944917,"about_ca_system_score_gemma":0.000013797263,"threshold_uncertainty_score":0.99849707},"labels":[],"label_agreement":null},{"id":"W4232377768","doi":"10.1007/978-3-319-15657-6_16","title":"Scheduling Algorithms","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.034570256708403746,"score_gpt":0.2393277149994581,"score_spread":0.20475745829105435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232377768","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.7055955e-7,0.0026400303,0.12065151,0.000026346252,0.0011183341,0.00009316573,0.000015567475,0.0013390413,0.8741152],"genre_scores_gemma":[0.00003757664,0.0002808981,0.2813138,0.000049453105,0.0006354612,0.0000046389337,0.00009406527,0.00017612771,0.717408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898696,0.000002450708,0.00028018566,0.00022909188,0.00029086185,0.00021047796],"domain_scores_gemma":[0.9993031,0.000020717522,0.000035770234,0.00030932506,0.00014444915,0.00018665662],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012378041,0.0003384381,0.00030722065,0.00015951083,0.00003235799,0.000053016014,0.00017573824,0.000422787,0.0020334204],"category_scores_gemma":[0.000013043433,0.00034214678,0.00010065331,0.00003035343,0.000029578638,0.00006432973,0.000033515913,0.00041152857,0.0017991817],"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.0000030044778,0.0000067503074,7.3977213e-7,0.00008185731,0.00025755004,0.000040328883,0.000093157985,0.8285031,0.0000041911026,0.08576777,0.024203183,0.061038423],"study_design_scores_gemma":[0.00025126504,0.000016181271,1.5057088e-7,0.00009016385,0.00004570566,0.000017030268,0.000015684978,0.6953443,0.000035010995,0.0058690305,0.29767284,0.00064261927],"about_ca_topic_score_codex":0.000001515168,"about_ca_topic_score_gemma":0.0000014401172,"teacher_disagreement_score":0.27346966,"about_ca_system_score_codex":0.00010455281,"about_ca_system_score_gemma":0.000044954842,"threshold_uncertainty_score":0.9999031},"labels":[],"label_agreement":null},{"id":"W4232588109","doi":"10.1109/icsea.2006.261327","title":"Adaptive Manufacturing: A Real-Time Simulation-Based Control System","year":2006,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Computer science; Manufacturing execution system; Enterprise resource planning; Production planning; Architecture; Computer-integrated manufacturing; Process development execution system; Production control; Real-time Control System; Control (management); Production (economics); Real-time computing; Industrial engineering; Distributed computing; Systems engineering; Engineering; Artificial intelligence","score_opus":0.006046110482989126,"score_gpt":0.19240289671116026,"score_spread":0.18635678622817115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232588109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009815621,0.00001909262,0.9403651,0.000017909895,0.000136421,0.00016747172,0.000010873534,0.0018633109,0.047604196],"genre_scores_gemma":[0.9610472,2.850976e-7,0.03813429,0.000018562532,0.0001167678,0.000011801058,0.000015889053,0.000027550326,0.0006276941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994313,0.000014892683,0.00017502112,0.00011154864,0.00011566733,0.0001515322],"domain_scores_gemma":[0.99959517,0.0001757521,0.000019612591,0.0001287843,0.000037554833,0.00004311633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000060044087,0.00011469667,0.00012848298,0.00006889393,0.000044336437,0.00003210375,0.000054705277,0.00006236277,0.00014702711],"category_scores_gemma":[0.0000051319994,0.00010774495,0.000044476856,0.0000645929,0.000009060443,0.000047491314,0.0000018128121,0.000049479117,0.00023269393],"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.000006671129,0.0000066861176,0.00003103679,0.000012441137,0.000011594707,0.000002830885,0.000005433863,0.99938333,0.000071090704,0.00022275785,0.00009190203,0.00015423016],"study_design_scores_gemma":[0.0006526769,0.000010119952,0.00023489284,0.000014653081,0.000012498661,4.6994242e-7,0.000022940858,0.99539423,0.0034460719,0.000009512083,0.00006753884,0.00013438583],"about_ca_topic_score_codex":0.00006596251,"about_ca_topic_score_gemma":0.000002588784,"teacher_disagreement_score":0.95123154,"about_ca_system_score_codex":0.000077919656,"about_ca_system_score_gemma":0.000010227024,"threshold_uncertainty_score":0.43937114},"labels":[],"label_agreement":null},{"id":"W4234053868","doi":"10.1109/wsc.1991.185624","title":"Batching annealing operations to optimize queueing times and furnace efficiency: a simulation model","year":2002,"lang":"en","type":"article","venue":"1991 Winter Simulation Conference Proceedings.","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simulated annealing; Computer science; Discrete event simulation; Subroutine; Queueing theory; GPSS; Simulation language; Stochastic simulation; Adaptive simulated annealing; User Friendly; Simulation modeling; Mathematical optimization; Simulation; Real-time computing; Programming language; Algorithm; Computer network","score_opus":0.03037608142778391,"score_gpt":0.2587913477400177,"score_spread":0.2284152663122338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234053868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15026422,0.00008957349,0.84592736,0.00027259038,0.0001464997,0.0002914036,0.0000057796346,0.00053858984,0.0024639638],"genre_scores_gemma":[0.8836101,0.000019441288,0.1157634,0.00016009198,0.000103550636,0.000021157304,0.00000853861,0.0000415087,0.00027214945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869734,0.00000821443,0.0003952595,0.00036204178,0.00023929717,0.00029782255],"domain_scores_gemma":[0.99925387,0.000069084505,0.00004349709,0.00010553552,0.00035208007,0.00017592942],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017405364,0.0002535782,0.00021793135,0.00024256959,0.00025208993,0.00047508717,0.0001479208,0.000115879826,0.00015070866],"category_scores_gemma":[0.000168806,0.0002696225,0.00004263574,0.00032869674,0.000026768344,0.0007674949,0.00005230017,0.00020653299,0.000038556664],"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.0000054136867,0.000012857537,0.00010216963,0.000025476562,0.000013271626,3.185181e-7,0.007958408,0.98798114,0.00028249514,0.00032079607,0.00004030061,0.0032573491],"study_design_scores_gemma":[0.00033634095,0.000027234692,0.000043985336,0.00011944788,0.000018656252,0.0000019536928,0.0004263038,0.998369,0.00017510026,0.00008251293,0.000075981174,0.00032351995],"about_ca_topic_score_codex":0.000006903926,"about_ca_topic_score_gemma":0.000003068516,"teacher_disagreement_score":0.7333459,"about_ca_system_score_codex":0.00006995871,"about_ca_system_score_gemma":0.000009452788,"threshold_uncertainty_score":0.9999756},"labels":[],"label_agreement":null},{"id":"W4235267911","doi":"10.13031/2013.15234","title":"BY-PRODUCTS UTILIZATION: AN INTEGRATED SOLUTION","year":2013,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Waste management; Biogas; Greenhouse gas; Environmental science; Agriculture; Stove; Electricity generation; Manure; Fertilizer; Business; Engineering","score_opus":0.024119038925785166,"score_gpt":0.22746632191075616,"score_spread":0.203347282984971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235267911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016993122,0.00019376198,0.97243154,0.0003002818,0.0004832047,0.00013356238,0.0000019374424,0.0013803706,0.008082199],"genre_scores_gemma":[0.7555316,0.000061967636,0.24074572,0.0001760014,0.00013546395,0.000028215405,0.00024546185,0.000038887567,0.0030366809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960786,0.000009331237,0.000094119874,0.000097303826,0.00008510075,0.000106303116],"domain_scores_gemma":[0.99964213,0.0000041882513,0.000007252808,0.00012708585,0.00016680085,0.00005253624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004959766,0.00006904451,0.000050266222,0.00003359012,0.000032888103,0.000053635686,0.000058063008,0.000045885983,0.0011188599],"category_scores_gemma":[0.000030748022,0.000061902734,0.000007868701,0.00021377325,0.000010262883,0.00026652866,0.000004517619,0.000050766143,0.00033404198],"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.00000316765,0.00012533703,0.00024986523,0.000046212775,0.000049948827,7.452655e-7,0.0005097526,0.38968614,0.017347524,0.0011886213,0.35847226,0.23232043],"study_design_scores_gemma":[0.00008681306,0.000010451948,0.000090140995,0.0000026375237,0.000002083764,0.0000011506309,0.00008875777,0.98333156,0.01034393,0.00002927925,0.0059182486,0.00009492688],"about_ca_topic_score_codex":0.00004404922,"about_ca_topic_score_gemma":0.0000033589038,"teacher_disagreement_score":0.73853844,"about_ca_system_score_codex":0.000027477961,"about_ca_system_score_gemma":0.000008346433,"threshold_uncertainty_score":0.99979424},"labels":[],"label_agreement":null},{"id":"W4236504455","doi":"10.1007/978-0-387-39940-9_3406","title":"Queuing Mechanism","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Mechanism (biology); Computer science; Queueing theory; Computer network; Philosophy; Epistemology","score_opus":0.011189588235705622,"score_gpt":0.20767973376161594,"score_spread":0.19649014552591032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236504455","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010021147,0.0050466056,0.033616807,0.000007457783,0.0031056583,0.0003693541,0.0007384939,0.0005224258,0.9565832],"genre_scores_gemma":[0.0011022122,0.017415803,0.05809139,0.00004189755,0.0031479532,0.00004455134,0.0030098462,0.00048506705,0.91666126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984081,0.000014034884,0.00065158744,0.00029980743,0.00039157795,0.00023492861],"domain_scores_gemma":[0.9988883,0.000058272017,0.00018057604,0.00064870255,0.00009350675,0.00013061716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022253313,0.0003960819,0.0005708419,0.00025407865,0.000036598976,0.000026756245,0.00026585624,0.00031598532,0.00018570645],"category_scores_gemma":[0.000027251355,0.00042020256,0.00011740592,0.000049497132,0.000022764674,0.00012910599,0.00003978065,0.000370808,0.000201474],"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.000025880241,0.000077147146,0.000006601626,0.0047306707,0.0009776818,0.0003642144,0.0009015895,0.17385277,0.0003012853,0.7160785,0.05467912,0.048004493],"study_design_scores_gemma":[0.0006903892,0.000087094406,0.000001496113,0.0033972512,0.00027011504,0.000069391535,0.00010588366,0.13816051,0.00023038719,0.0015441703,0.8537464,0.0016969078],"about_ca_topic_score_codex":0.000021996697,"about_ca_topic_score_gemma":0.0000041925755,"teacher_disagreement_score":0.79906726,"about_ca_system_score_codex":0.00006584741,"about_ca_system_score_gemma":0.000048423033,"threshold_uncertainty_score":0.999825},"labels":[],"label_agreement":null},{"id":"W4237045795","doi":"10.1109/wsc.2008.4736343","title":"Multi-Agent Resource Allocation (MARA) for modeling construction processes","year":2008,"lang":"en","type":"article","venue":"2008 Winter Simulation Conference","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Adaptability; Scheduling (production processes); Procurement; Schedule; Field (mathematics); Resource allocation; Sample (material); Resource (disambiguation); Operations research; Shared resource; Systems engineering; Distributed computing; Engineering; Operations management","score_opus":0.06067313235577595,"score_gpt":0.2693225300008231,"score_spread":0.20864939764504717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237045795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040044762,0.000093831986,0.9586265,0.000058460497,0.0002693231,0.00025605859,0.00000913458,0.0003953563,0.0002465729],"genre_scores_gemma":[0.82866335,0.00003538521,0.17085724,0.00004153101,0.00009899729,0.00003557009,0.000074375756,0.000024008516,0.00016956888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992212,0.000014052873,0.00027351052,0.00020146827,0.00012980492,0.00015996853],"domain_scores_gemma":[0.9992696,0.000069953596,0.000045567405,0.00014310035,0.00041388738,0.00005785885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006564972,0.0001400569,0.0001245718,0.0000982468,0.00013916065,0.000040504943,0.00009269982,0.00008489228,0.000042502637],"category_scores_gemma":[0.00012728736,0.00015288983,0.0000374253,0.0001577364,0.000033777364,0.00022073086,0.000009851991,0.00008098424,0.000020677777],"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.000012332494,0.000014176269,0.00016728305,0.000043418422,0.000013274622,3.5910014e-7,0.0006580492,0.9966124,0.00009566589,0.000029549507,0.000058823913,0.0022946638],"study_design_scores_gemma":[0.00053052156,0.000015699503,0.00006409327,0.00004260053,0.000009719853,0.0000072040357,0.0001368026,0.99750406,0.00075540284,0.00003336524,0.0007239604,0.00017658128],"about_ca_topic_score_codex":0.0000028834365,"about_ca_topic_score_gemma":0.000004549065,"teacher_disagreement_score":0.78861856,"about_ca_system_score_codex":0.00004590635,"about_ca_system_score_gemma":0.00005237008,"threshold_uncertainty_score":0.6234666},"labels":[],"label_agreement":null},{"id":"W4238492321","doi":"10.32920/ryerson.14661135","title":"Minimizing makespan of a flexible machine under tooling contraints","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Job shop scheduling; Machine tool; Machining; Flexible manufacturing system; Flexibility (engineering); Scheduling (production processes); Computer science; Process (computing); Set (abstract data type); Point (geometry); Sequence (biology); Job shop; Engineering drawing; Industrial engineering; Mathematical optimization; Engineering; Flow shop scheduling; Mechanical engineering; Embedded system; Mathematics","score_opus":0.022348062955286893,"score_gpt":0.24431461597965587,"score_spread":0.22196655302436896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238492321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028854072,0.0030044427,0.9486568,0.00007098972,0.0017253116,0.00017697467,0.000028810198,0.00068365654,0.016798936],"genre_scores_gemma":[0.63490874,0.00017562995,0.36334565,0.00009877223,0.00013206643,0.000020700774,0.00015069987,0.00007518836,0.0010925181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988764,0.000023161443,0.00041793834,0.00026818283,0.00018400559,0.00023034381],"domain_scores_gemma":[0.99928147,0.0000659284,0.000067025045,0.00038691418,0.00011734522,0.000081333324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014787207,0.00024578147,0.00042005547,0.00013995536,0.00002523074,0.0000845992,0.00018366873,0.00026656577,0.0009059336],"category_scores_gemma":[0.00003696411,0.0002603701,0.0001496177,0.0001433653,0.00002464609,0.00004189696,0.00015161218,0.0004177015,0.000008716738],"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.0000032438247,0.000020039015,0.000047561258,0.00018737433,0.00018323395,0.0000066564367,0.00038941906,0.99575436,0.00018661085,0.00039842943,0.00004543316,0.002777637],"study_design_scores_gemma":[0.0003651541,0.000006089936,0.00015767959,0.0002722679,0.000054320062,0.000007611389,0.0009384215,0.99098426,0.0066911243,0.00013610131,0.000044530745,0.00034246626],"about_ca_topic_score_codex":0.00006300312,"about_ca_topic_score_gemma":0.000018673993,"teacher_disagreement_score":0.60605466,"about_ca_system_score_codex":0.000053839987,"about_ca_system_score_gemma":0.00006230267,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W4239917916","doi":"10.1515/iupac.83.0451","title":"Scheduling Software","year":2016,"lang":"en","type":"dataset","venue":"IUPAC Standards Online","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Glossary; Computer science; Field (mathematics); Data science; Multidisciplinary approach; Context (archaeology); Process (computing); Software; Management science; Engineering; Sociology; Biology; Linguistics; Programming language","score_opus":0.010818163989833832,"score_gpt":0.33286020818296913,"score_spread":0.3220420441931353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239917916","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000141597375,0.0016419305,0.070481956,0.00007672613,0.002084682,0.00013756259,0.92475146,0.0007894391,0.000022108954],"genre_scores_gemma":[0.0000017859819,0.0014788628,0.027508575,0.000106008476,0.0013753568,0.000014096555,0.9692664,0.00010676898,0.00014214318],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99794966,0.000027769052,0.00045385695,0.00037044907,0.0007368672,0.0004613732],"domain_scores_gemma":[0.99859375,0.000090440066,0.000089413006,0.00069178693,0.00033126207,0.00020335978],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027761067,0.0004836677,0.00052035175,0.0002613419,0.00009605389,0.000091255366,0.00041298216,0.00050400564,0.002398157],"category_scores_gemma":[0.0005112084,0.00041182534,0.00015520296,0.00023411286,0.00006283853,0.00010137903,0.00007539103,0.0005794018,0.0000130539975],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000010472063,0.000027603674,0.0000018971704,0.00015881308,0.000098161945,0.000026162174,0.0000064663413,0.020571118,0.0000012621505,0.0000012714698,0.9728107,0.006286063],"study_design_scores_gemma":[0.00055426697,0.000032097338,0.0000016189083,0.00046041136,0.000069545065,0.0000120264385,0.000012818541,0.005145325,0.000020807169,0.000035115452,0.9930993,0.00055668893],"about_ca_topic_score_codex":0.000008840099,"about_ca_topic_score_gemma":0.00004120807,"teacher_disagreement_score":0.04451496,"about_ca_system_score_codex":0.0003390809,"about_ca_system_score_gemma":0.00024595213,"threshold_uncertainty_score":0.99983335},"labels":[],"label_agreement":null},{"id":"W4243234814","doi":"10.1007/978-3-319-15657-6_7","title":"Queuing Analysis","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Victoria","funders":"","keywords":"Computer science; Queueing theory; Computer network","score_opus":0.02478848280271091,"score_gpt":0.2267642865279826,"score_spread":0.2019758037252717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243234814","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.7800513e-7,0.0007877257,0.1230082,0.000009937116,0.00020763124,0.000027368973,0.0000070127694,0.00054995756,0.8754014],"genre_scores_gemma":[0.00037679044,0.000108547305,0.047479622,0.000025593841,0.00017125123,0.0000015313225,0.00010937717,0.000060869694,0.9516664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994903,0.0000013744001,0.00015154986,0.00011956048,0.00014728018,0.00008989362],"domain_scores_gemma":[0.9996205,0.0000113895385,0.000019776526,0.00019821031,0.00007040071,0.00007974541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000066572175,0.00015528234,0.00023656034,0.0002673462,0.000012939509,0.000027290793,0.00007941557,0.00018709365,0.0026481934],"category_scores_gemma":[0.000005083225,0.00015204921,0.00012677729,0.000066475506,0.000009075298,0.000025263922,0.000012367243,0.00015019946,0.0004393094],"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":[4.3140497e-7,8.66842e-7,0.0000022476825,0.000009594301,0.00089938624,0.000004793448,0.000032372052,0.9685196,3.5687836e-7,0.02041075,0.006192254,0.0039273393],"study_design_scores_gemma":[0.000075330594,0.000004250549,0.0000010399482,0.00001486401,0.00061480136,0.0000012673322,0.00000823147,0.8626074,0.0000075929174,0.0013635576,0.13496272,0.00033893736],"about_ca_topic_score_codex":0.0000035506876,"about_ca_topic_score_gemma":0.000012156761,"teacher_disagreement_score":0.12877047,"about_ca_system_score_codex":0.00005357401,"about_ca_system_score_gemma":0.000011718986,"threshold_uncertainty_score":0.99826354},"labels":[],"label_agreement":null},{"id":"W4244000150","doi":"10.32920/ryerson.14661009.v1","title":"Development of a dynamic scheduling system for flexible manufacturing systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Two-level scheduling; Fair-share scheduling; Job shop scheduling; Schedule; Real-time computing; Rate-monotonic scheduling; Distributed computing; Engineering; Operating system","score_opus":0.019516373392576152,"score_gpt":0.24319588041433818,"score_spread":0.22367950702176204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244000150","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09292127,0.0014659823,0.90017295,0.0000032813516,0.0028717471,0.0005207008,0.000018322311,0.0011197308,0.000906003],"genre_scores_gemma":[0.41987962,0.0000192779,0.57949007,0.000001356809,0.00005223206,0.00017024858,0.00014568445,0.000059855156,0.00018167279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839735,0.000014029958,0.0007507318,0.00034645302,0.00021795319,0.00027350677],"domain_scores_gemma":[0.99921095,0.000048291953,0.00013279526,0.0003795132,0.00014764475,0.00008079064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028646959,0.00030903393,0.00055353536,0.00019584046,0.0000675378,0.00014329301,0.0002374231,0.00032098824,0.000011696974],"category_scores_gemma":[0.000013624493,0.00032584224,0.00014232002,0.000075296426,0.000009192115,0.000045188055,0.00015980829,0.00025975975,0.000005274506],"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.0000027330636,0.000009309063,0.0000015933091,0.008007917,0.00021707351,0.000001462295,0.0004369754,0.98831505,0.0003820931,0.000071236595,0.0000035130126,0.002551023],"study_design_scores_gemma":[0.000229412,0.0000027524713,0.000008348352,0.0016688202,0.000039560506,0.000005655486,0.0030765694,0.9376638,0.056893006,0.0000022520373,0.00007805862,0.00033177904],"about_ca_topic_score_codex":0.000010128293,"about_ca_topic_score_gemma":0.000005808553,"teacher_disagreement_score":0.32695833,"about_ca_system_score_codex":0.00035650225,"about_ca_system_score_gemma":0.00017249459,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null},{"id":"W4244065357","doi":"10.1109/wsc.2000.899165","title":"A simulation test-bed to evaluate multi-agent control of manufacturing systems","year":2002,"lang":"en","type":"article","venue":"2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Architecture; Computer science; Discrete event simulation; Multi-agent system; Variety (cybernetics); Event (particle physics); Control (management); Distributed computing; Control system; Software; Computer-integrated manufacturing; Systems engineering; Engineering; Simulation; Artificial intelligence; Operating system","score_opus":0.035362121935976557,"score_gpt":0.26269279327081085,"score_spread":0.2273306713348343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244065357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35901558,0.000052604268,0.6360631,0.00009944562,0.0009414829,0.0013018146,0.000044703243,0.0007760473,0.0017052223],"genre_scores_gemma":[0.9688547,0.000015072879,0.029644629,0.00013394977,0.0002631668,0.000086405285,0.000016683682,0.000087038265,0.0008983392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745494,0.000025002932,0.00093569455,0.0005186925,0.00056194444,0.00050374167],"domain_scores_gemma":[0.9976901,0.0003187842,0.00025100922,0.00025903303,0.0012198959,0.00026118127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035068547,0.00045336504,0.0005225034,0.00041885852,0.00013045793,0.00027741387,0.00033931763,0.00022332808,0.00053704064],"category_scores_gemma":[0.00057022285,0.00046992526,0.00012778344,0.00033400557,0.000041143223,0.00055994635,0.000047869537,0.00018223908,0.0005876759],"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.00003303587,0.00008278654,0.0008737678,0.00015778601,0.000066135355,9.530746e-7,0.002348316,0.9896705,0.004145944,0.000013234244,0.00008221795,0.002525323],"study_design_scores_gemma":[0.0017417392,0.00012054421,0.00058219995,0.00028435394,0.000067500725,0.0000016598357,0.00025141056,0.9929012,0.0031899365,0.000009899085,0.00035668522,0.00049289066],"about_ca_topic_score_codex":0.000013316778,"about_ca_topic_score_gemma":0.000001322247,"teacher_disagreement_score":0.60983914,"about_ca_system_score_codex":0.0002688752,"about_ca_system_score_gemma":0.000028991632,"threshold_uncertainty_score":0.99977523},"labels":[],"label_agreement":null},{"id":"W4244231150","doi":"10.23952/jano.1.2019.2.04","title":"Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Preorder; Set (abstract data type); Mathematics; Computer science; Combinatorics; Discrete mathematics; Programming language","score_opus":0.006736461028911781,"score_gpt":0.22165897570362644,"score_spread":0.21492251467471465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244231150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12830634,0.000098872166,0.86991924,0.000023295976,0.00013532721,0.00015139423,0.0000064592728,0.000018040057,0.0013410544],"genre_scores_gemma":[0.61315495,0.00011970699,0.38666445,0.000010091653,0.000014702143,7.442739e-7,0.000017256898,0.000013210591,0.000004907346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.000021853886,0.0007920257,0.0000934406,0.000203106,0.000114466384],"domain_scores_gemma":[0.9992271,0.00013099366,0.00037403917,0.00007519151,0.00014566454,0.000047028567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022796146,0.000113086426,0.00031568916,0.00027375316,0.000020734486,0.000013274683,0.00007333442,0.00008841213,0.00007546145],"category_scores_gemma":[0.000045235673,0.000109864406,0.00004253696,0.00040860366,0.000025237978,0.00015034465,0.000019222483,0.0001453317,0.0000010761696],"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.00005671621,0.000043344524,0.002937085,0.0000513124,0.00003096705,3.4243743e-7,0.00061975315,0.9946607,0.00013781538,0.00007470365,0.000010851435,0.0013764304],"study_design_scores_gemma":[0.0010135588,0.00008493014,0.0010666142,0.000072435614,0.000023191024,0.0000025411236,0.00037493612,0.9968747,0.00034539192,0.000031090363,0.00001275383,0.000097891665],"about_ca_topic_score_codex":0.000001643791,"about_ca_topic_score_gemma":1.01326656e-7,"teacher_disagreement_score":0.4848486,"about_ca_system_score_codex":0.000027383805,"about_ca_system_score_gemma":0.000026078334,"threshold_uncertainty_score":0.44801405},"labels":[],"label_agreement":null},{"id":"W4244645511","doi":"10.32920/ryerson.14661135.v1","title":"Minimizing makespan of a flexible machine under tooling contraints","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Job shop scheduling; Machining; Machine tool; Flexibility (engineering); Flexible manufacturing system; Scheduling (production processes); Computer science; Process (computing); Set (abstract data type); Point (geometry); Job shop; Sequence (biology); Industrial engineering; Engineering drawing; Mathematical optimization; Engineering; Flow shop scheduling; Mechanical engineering; Mathematics; Embedded system","score_opus":0.022348062955286893,"score_gpt":0.24431461597965587,"score_spread":0.22196655302436896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244645511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028854072,0.0030044427,0.9486568,0.00007098972,0.0017253116,0.00017697467,0.000028810198,0.00068365654,0.016798936],"genre_scores_gemma":[0.63490874,0.00017562995,0.36334565,0.00009877223,0.00013206643,0.000020700774,0.00015069987,0.00007518836,0.0010925181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988764,0.000023161443,0.00041793834,0.00026818283,0.00018400559,0.00023034381],"domain_scores_gemma":[0.99928147,0.0000659284,0.000067025045,0.00038691418,0.00011734522,0.000081333324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014787207,0.00024578147,0.00042005547,0.00013995536,0.00002523074,0.0000845992,0.00018366873,0.00026656577,0.0009059336],"category_scores_gemma":[0.00003696411,0.0002603701,0.0001496177,0.0001433653,0.00002464609,0.00004189696,0.00015161218,0.0004177015,0.000008716738],"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.0000032438247,0.000020039015,0.000047561258,0.00018737433,0.00018323395,0.0000066564367,0.00038941906,0.99575436,0.00018661085,0.00039842943,0.00004543316,0.002777637],"study_design_scores_gemma":[0.0003651541,0.000006089936,0.00015767959,0.0002722679,0.000054320062,0.000007611389,0.0009384215,0.99098426,0.0066911243,0.00013610131,0.000044530745,0.00034246626],"about_ca_topic_score_codex":0.00006300312,"about_ca_topic_score_gemma":0.000018673993,"teacher_disagreement_score":0.60605466,"about_ca_system_score_codex":0.000053839987,"about_ca_system_score_gemma":0.00006230267,"threshold_uncertainty_score":0.99998486},"labels":[],"label_agreement":null},{"id":"W4247424111","doi":"10.1007/1-4020-0612-8_492","title":"KANBAN-BASED MANUFACTURING SYSTEMS","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Windsor","funders":"","keywords":"Kanban; Manufacturing engineering; Computer science; Artificial intelligence; Engineering","score_opus":0.010840754794940542,"score_gpt":0.18502522760659657,"score_spread":0.17418447281165603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247424111","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000067950314,0.0013675002,0.01974465,0.000010903248,0.00083985634,0.00014095436,0.000019576093,0.0013082159,0.97656155],"genre_scores_gemma":[0.0028222215,0.00041284226,0.01329014,0.00009705683,0.0005800939,0.000014595637,0.00015771341,0.00025579883,0.98236954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920624,0.0000027454269,0.00024859657,0.00018940486,0.00017932171,0.00017369582],"domain_scores_gemma":[0.9995593,0.000029764633,0.000027242417,0.00028089277,0.000017425995,0.000085418484],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000040424908,0.00029157475,0.0002574098,0.00015557428,0.000034606517,0.000071040304,0.00012623667,0.00031689493,0.0034885497],"category_scores_gemma":[0.0000010622343,0.00028850534,0.00009530359,0.000010119001,0.000014529169,0.000028858974,0.000005507093,0.00026237953,0.0011472886],"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.0000014718752,0.0000014532766,1.4872428e-7,0.00007839251,0.000043493543,0.00001189385,0.000005958099,0.99127465,5.6494963e-7,0.0039092926,0.001293123,0.0033795647],"study_design_scores_gemma":[0.00024164807,0.000010873458,9.14716e-7,0.0002557524,0.000042169126,0.000007884435,0.0000037002512,0.7282869,0.0005118638,0.00032053774,0.26969868,0.00061906455],"about_ca_topic_score_codex":0.000006943923,"about_ca_topic_score_gemma":0.0000014527387,"teacher_disagreement_score":0.26840556,"about_ca_system_score_codex":0.00006845232,"about_ca_system_score_gemma":0.000016583244,"threshold_uncertainty_score":0.9999567},"labels":[],"label_agreement":null},{"id":"W4248668074","doi":"10.1145/544772.544782","title":"A multi-agent queuing model for resource allocations in a non-cooperative game","year":2002,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Queueing theory; Game theory; Resource (disambiguation); Resource allocation; Distributed computing; Computer network; Resource management (computing); Operations research; Microeconomics; Engineering; Economics","score_opus":0.03517273215454456,"score_gpt":0.2499563582101822,"score_spread":0.21478362605563764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248668074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004540822,0.000096028016,0.9930388,0.0001789879,0.00003847729,0.00023329252,0.000004477132,0.00017991256,0.0016892051],"genre_scores_gemma":[0.54942936,0.000020713118,0.44655633,0.00012475248,0.000020473617,0.00012024617,0.000007838813,0.000022153863,0.003698121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952656,0.000005829544,0.00015090502,0.00011678176,0.000050024162,0.00014992562],"domain_scores_gemma":[0.99977154,0.000032112475,0.000008759734,0.00010578172,0.00003753863,0.000044267843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006285445,0.000085007174,0.00008812941,0.000081785416,0.000031934662,0.00002610563,0.000063476065,0.00004679636,0.000053236254],"category_scores_gemma":[0.000037488408,0.00008487212,0.000027292577,0.00015319236,0.000008016424,0.00006600379,0.000007855049,0.00007182741,0.000028354043],"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":[7.893336e-7,0.000028378714,0.000008545508,0.000007053893,0.0000065644076,3.0468968e-7,0.0029707395,0.99544364,0.00016109693,0.00004887396,0.00049007026,0.0008339137],"study_design_scores_gemma":[0.00053859036,0.0000063006414,0.000018648996,0.0000150420865,0.0000033327012,6.157985e-7,0.0002724069,0.9985365,0.0002791701,0.0000045094534,0.00021153319,0.00011334115],"about_ca_topic_score_codex":0.000009292192,"about_ca_topic_score_gemma":0.00007099617,"teacher_disagreement_score":0.54648244,"about_ca_system_score_codex":0.00005183472,"about_ca_system_score_gemma":0.0000044716835,"threshold_uncertainty_score":0.34609845},"labels":[],"label_agreement":null},{"id":"W4248953150","doi":"10.1109/wsc.1993.718331","title":"Simulation for Real-Time Decision Making in Manufacturing Systems","year":2005,"lang":"en","type":"article","venue":"Proceedings of 1993 Winter Simulation Conference - (WSC '93)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Salient; Computer science; Scheduling (production processes); Industrial engineering; Decision support system; Work (physics); Operations research; Management science; Engineering; Artificial intelligence; Operations management","score_opus":0.02192442257969689,"score_gpt":0.28034705910925467,"score_spread":0.25842263652955777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248953150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58540297,0.00005044275,0.4112997,0.000030510657,0.0002993075,0.0006734594,0.000011978873,0.00034734714,0.0018842742],"genre_scores_gemma":[0.9454673,0.000012228486,0.05408721,0.000012634882,0.00021842711,0.000038471153,0.000015927211,0.00004842986,0.000099384946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838054,0.000005326758,0.0007451133,0.00030617183,0.00027359626,0.00028927418],"domain_scores_gemma":[0.99879813,0.00043354338,0.00020163087,0.00010256698,0.00040070334,0.0000634386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032823154,0.00023855153,0.0003314836,0.00039517606,0.000057406054,0.00015478149,0.00019916627,0.00016649057,0.00007866707],"category_scores_gemma":[0.000203302,0.00025697553,0.00008039825,0.00018364907,0.000021391512,0.0007405441,0.000033812168,0.00013761655,0.0000228265],"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.00008421733,0.000022534932,0.0005859442,0.00013433691,0.000016683167,1.5282465e-7,0.0006555773,0.98100114,0.00078523165,0.00013694202,0.000027088192,0.016550135],"study_design_scores_gemma":[0.001047965,0.000036787937,0.0010574575,0.00056336686,0.000017164431,8.7469107e-7,0.00015748484,0.9939122,0.0024697545,0.0002169459,0.00026027687,0.0002596873],"about_ca_topic_score_codex":0.0000062449353,"about_ca_topic_score_gemma":0.000002352391,"teacher_disagreement_score":0.36006433,"about_ca_system_score_codex":0.00016614558,"about_ca_system_score_gemma":0.000015351943,"threshold_uncertainty_score":0.99998826},"labels":[],"label_agreement":null},{"id":"W4249176147","doi":"10.1109/wsc.2005.1574442","title":"Optimal Lot Sizing in a Two-Stage System with Auto-Correlated Arrivals","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference, 2005.","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Independence (probability theory); Computer science; Constant (computer programming); Product (mathematics); Mathematical optimization; Production (economics); Stage (stratigraphy); Industrial engineering; Mathematics; Statistics; Engineering","score_opus":0.010682363953308151,"score_gpt":0.22565063803878463,"score_spread":0.21496827408547647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249176147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8965369,0.00005486254,0.08652226,0.00007108912,0.00027309227,0.0004026244,0.000009137663,0.00047453865,0.015655499],"genre_scores_gemma":[0.9895232,0.000001209502,0.009669902,0.000010055049,0.00007124743,0.000013543165,0.0000045147985,0.000035629968,0.00067073945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988679,0.0000071045833,0.00043411247,0.00019961564,0.00023568583,0.00025553792],"domain_scores_gemma":[0.9994267,0.000040167328,0.00015172648,0.000101268815,0.00023845125,0.000041690182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019154513,0.00019515185,0.00024349988,0.00018572452,0.000051790063,0.00009936518,0.0002367613,0.00007334121,0.000047592075],"category_scores_gemma":[0.000022718234,0.00015083622,0.000054273583,0.0003475006,0.000044893262,0.0002689311,0.00003543177,0.0002023855,0.000010093408],"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.000027716756,0.000018076988,0.008356365,0.00008470956,0.000018608584,5.766588e-7,0.0003121204,0.98892254,0.00078880036,0.0013577522,0.000022079512,0.000090671936],"study_design_scores_gemma":[0.00087086495,0.000015836225,0.0023184079,0.0004438878,0.000018116125,0.000004107099,0.0004906096,0.9923548,0.0031878995,0.00001825893,0.00009346807,0.00018371186],"about_ca_topic_score_codex":0.00003838848,"about_ca_topic_score_gemma":0.000015331902,"teacher_disagreement_score":0.092986256,"about_ca_system_score_codex":0.00010546472,"about_ca_system_score_gemma":0.000025012705,"threshold_uncertainty_score":0.6150923},"labels":[],"label_agreement":null},{"id":"W4251187594","doi":"10.32920/ryerson.14644443.v1","title":"Selecting a Mix of Dispatching Rules for a Job Shop by Using Artificial Neural Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Artificial neural network; Job shop scheduling; Computer science; Job shop; Scheduling (production processes); Artificial intelligence; Operations research; Flow shop scheduling; Machine learning; Mathematical optimization; Engineering; Mathematics; Computer network","score_opus":0.02446414907907735,"score_gpt":0.2611571494728045,"score_spread":0.23669300039372715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251187594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30445737,0.0006230619,0.6934734,0.000016438507,0.0009567325,0.00017110124,0.000020575868,0.00021007446,0.000071249575],"genre_scores_gemma":[0.6406379,0.000025924868,0.3585689,0.000020773039,0.00042592094,0.000025466568,0.0001892943,0.00008150742,0.000024318002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987658,0.000029502206,0.00046856166,0.00030220798,0.00013487214,0.0002990293],"domain_scores_gemma":[0.9993709,0.00013568206,0.000099220204,0.00020304247,0.0001271381,0.000064045256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019133122,0.0002572025,0.00039540915,0.00008132251,0.000085343905,0.00016764573,0.0001501602,0.00028550322,0.000031103522],"category_scores_gemma":[0.000084687614,0.00028177944,0.000187616,0.00013714412,0.000015260483,0.00006224842,0.00012333161,0.0004610767,2.1668846e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050497983,0.000012498353,0.000116798925,0.00018160214,0.00007921926,8.71958e-7,0.00019731055,0.99206287,0.0006088248,0.00003014629,0.00004248806,0.0066623003],"study_design_scores_gemma":[0.0001021901,0.0000064467713,0.00000815827,0.00014723017,0.000058422185,0.0000034045643,0.00030395875,0.997435,0.0015897113,0.000060742954,0.0000034939014,0.00028126512],"about_ca_topic_score_codex":0.000098114,"about_ca_topic_score_gemma":0.000035940033,"teacher_disagreement_score":0.33618054,"about_ca_system_score_codex":0.00005886099,"about_ca_system_score_gemma":0.000037042377,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W4251606168","doi":"10.1145/2501626.2512470","title":"A constraint programming approach for integrated spatial and temporal scheduling for clustered architectures","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Parallel computing; Gang scheduling; Dynamic priority scheduling; Two-level scheduling; Compiler; Fair-share scheduling; Distributed computing; Schedule; Programming language; Mathematical optimization","score_opus":0.017733928886879073,"score_gpt":0.24130336395189364,"score_spread":0.22356943506501456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251606168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028427191,0.00011993291,0.9677755,0.000042464206,0.0006483047,0.0021621655,0.000033304525,0.00075111806,0.000039987768],"genre_scores_gemma":[0.5373479,9.365929e-7,0.46213874,0.000013102998,0.000100999234,0.00030749102,0.00003708612,0.000039000195,0.000014715225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986467,0.00004418682,0.0004518621,0.00034728047,0.00012814956,0.00038186702],"domain_scores_gemma":[0.99901223,0.00033409023,0.000078798716,0.00027555804,0.00017507185,0.00012423827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026640363,0.0002735789,0.00033065196,0.00019307213,0.00029048653,0.00029633386,0.00018445986,0.00015831161,0.0000035184153],"category_scores_gemma":[0.00007121113,0.00025762914,0.000113546754,0.00017652386,0.00006307487,0.000059841077,0.000004582055,0.00024644757,0.0000018264165],"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.000019362344,0.000038224436,0.00001634199,0.00030493055,0.00011128618,1.7949867e-7,0.00084363273,0.8641638,0.00010551303,0.000025846735,0.000009568303,0.13436128],"study_design_scores_gemma":[0.0011941553,0.00011937384,0.000006533968,0.00013066764,0.000042148095,0.00003046063,0.0025080084,0.99520946,0.00033373738,0.00004721218,0.00009301962,0.00028523567],"about_ca_topic_score_codex":0.00012338716,"about_ca_topic_score_gemma":0.0000055142186,"teacher_disagreement_score":0.5089207,"about_ca_system_score_codex":0.000057756395,"about_ca_system_score_gemma":0.000029772704,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W4251651875","doi":"10.1080/03155986.2021.1875161","title":"Statement of retraction","year":2021,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":true,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Statement (logic); Philosophy; Linguistics","score_opus":0.0474783179512459,"score_gpt":0.33257763873230184,"score_spread":0.28509932078105593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251651875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36553448,0.003440794,0.3718394,0.0014689422,0.004537029,0.0019026096,0.0004195865,0.0004922974,0.25036484],"genre_scores_gemma":[0.9928621,0.00039056188,0.0058304146,0.000032290834,0.000079350044,0.000043887467,0.00023335054,0.0000057737157,0.00052223814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892575,0.00002896848,0.0003992035,0.00004040454,0.0005002495,0.00010542151],"domain_scores_gemma":[0.998752,0.000072015384,0.000027484604,0.00008301699,0.0010154052,0.000050095252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007650441,0.0000471528,0.00007717676,0.0001577639,0.00009680599,0.00018832111,0.000036008354,0.000060798207,0.000063544074],"category_scores_gemma":[0.00013747675,0.000044744225,0.000013102791,0.0002625364,0.000023709506,0.0009280255,0.000017146947,0.00012783904,0.00004457654],"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.00001599659,0.000018011695,0.0005158622,0.00052229996,0.00006171706,0.0000014611824,0.002192919,0.8963849,0.0006672722,0.07868609,0.0074461563,0.013487341],"study_design_scores_gemma":[0.0003699899,0.000027631439,0.0010529783,0.000057182984,0.0000019096917,0.000020099013,0.0032483109,0.86410075,0.0038472787,0.000024284771,0.12715763,0.000091974085],"about_ca_topic_score_codex":0.000024939813,"about_ca_topic_score_gemma":0.000002036357,"teacher_disagreement_score":0.6273277,"about_ca_system_score_codex":0.000047419,"about_ca_system_score_gemma":0.00010168433,"threshold_uncertainty_score":0.18246166},"labels":[],"label_agreement":null},{"id":"W4252209735","doi":"10.1007/978-0-387-74437-7_12","title":"Scheduling Algorithms","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":175,"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 Victoria","funders":"","keywords":"Computer science; Algorithm","score_opus":0.019283307418068597,"score_gpt":0.21196572282594137,"score_spread":0.19268241540787276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252209735","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025966895,0.0024169825,0.1031806,0.000021977377,0.0009277258,0.000098302386,0.000012460168,0.001498827,0.8918405],"genre_scores_gemma":[0.000055328528,0.0036753851,0.32240894,0.000092063616,0.00061855005,0.0000053699746,0.000080304475,0.00019916656,0.6728649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989881,0.0000020574614,0.0003004928,0.00024692956,0.00023830496,0.00022410094],"domain_scores_gemma":[0.99943256,0.0000283993,0.000036314963,0.00030634383,0.000071044735,0.00012533591],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000044932345,0.00035935323,0.00031391793,0.00017672895,0.00006705229,0.00003339903,0.00016788697,0.00043085546,0.0018471341],"category_scores_gemma":[0.0000072828648,0.0003729603,0.00014424583,0.000031657342,0.000042502346,0.000059313057,0.000026790232,0.00045010334,0.0014759626],"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.0000036694273,0.000012358896,0.0000019711133,0.00012110985,0.0004319762,0.00016070763,0.00022707101,0.8610425,0.000009023696,0.01981835,0.028278204,0.08989305],"study_design_scores_gemma":[0.000255989,0.000015666012,9.3691375e-7,0.00010970833,0.000037207537,0.00007561599,0.000008670196,0.69444007,0.00012309203,0.00050963694,0.30359328,0.00083013374],"about_ca_topic_score_codex":0.0000014390281,"about_ca_topic_score_gemma":9.3163203e-7,"teacher_disagreement_score":0.27531508,"about_ca_system_score_codex":0.000067134875,"about_ca_system_score_gemma":0.00002906896,"threshold_uncertainty_score":0.9998722},"labels":[],"label_agreement":null},{"id":"W4252821966","doi":"10.2139/ssrn.3350140","title":"Convergence of a Robust Price Driven Co-ordination Algorithm for Large-Scale, Worse-Case Scenario, Linear Quadratic Optimization Problems","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta","funders":"","keywords":"Convergence (economics); Quadratic equation; Scale (ratio); Ordination; Mathematical optimization; Algorithm; Mathematics; Quadratic model; Computer science; Economics; Statistics","score_opus":0.0077628508651192505,"score_gpt":0.22476517024229317,"score_spread":0.21700231937717393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252821966","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010852467,0.0006299972,0.9872071,0.000050899627,0.00043450715,0.00054231734,0.000017850598,0.00011695348,0.00014791146],"genre_scores_gemma":[0.31615138,0.0030225131,0.67879635,0.000037902504,0.00041236353,0.00006149932,0.00014428889,0.0001520052,0.0012216718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978936,0.000048041144,0.0005035376,0.00020608542,0.00024884092,0.0010999216],"domain_scores_gemma":[0.9991254,0.00006673631,0.00021435824,0.00017223907,0.00032758084,0.00009367997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095647,0.00020143694,0.0002727164,0.00020489862,0.00013931874,0.000044625784,0.00017749377,0.00014237149,0.00010263959],"category_scores_gemma":[0.00004659126,0.00020349292,0.00011806807,0.00038014655,0.000017786831,0.0003251473,0.000012983831,0.00069968647,0.00001870465],"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.0000101054575,0.000059561233,0.00021861919,0.00006203737,0.000102525606,0.0000022036859,0.00033208475,0.99535584,0.00007592778,0.0006421615,0.000018177205,0.003120774],"study_design_scores_gemma":[0.0013916383,0.00021459303,0.0000067461756,0.00006164061,0.00004638847,0.00034629772,0.0011080907,0.99582535,0.0002658666,0.00039244915,0.00011237293,0.00022854573],"about_ca_topic_score_codex":0.000006948108,"about_ca_topic_score_gemma":0.000033495035,"teacher_disagreement_score":0.30841073,"about_ca_system_score_codex":0.00040396853,"about_ca_system_score_gemma":0.0004205438,"threshold_uncertainty_score":0.82982004},"labels":[],"label_agreement":null},{"id":"W4254841980","doi":"10.32920/ryerson.14661009","title":"Development of a dynamic scheduling system for flexible manufacturing systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Two-level scheduling; Fair-share scheduling; Schedule; Job shop scheduling; Real-time computing; Rate-monotonic scheduling; Distributed computing; Flexible manufacturing system; Engineering; Operating system","score_opus":0.019516373392576152,"score_gpt":0.24319588041433818,"score_spread":0.22367950702176204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254841980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09292127,0.0014659823,0.90017295,0.0000032813516,0.0028717471,0.0005207008,0.000018322311,0.0011197308,0.000906003],"genre_scores_gemma":[0.41987962,0.0000192779,0.57949007,0.000001356809,0.00005223206,0.00017024858,0.00014568445,0.000059855156,0.00018167279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839735,0.000014029958,0.0007507318,0.00034645302,0.00021795319,0.00027350677],"domain_scores_gemma":[0.99921095,0.000048291953,0.00013279526,0.0003795132,0.00014764475,0.00008079064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028646959,0.00030903393,0.00055353536,0.00019584046,0.0000675378,0.00014329301,0.0002374231,0.00032098824,0.000011696974],"category_scores_gemma":[0.000013624493,0.00032584224,0.00014232002,0.000075296426,0.000009192115,0.000045188055,0.00015980829,0.00025975975,0.000005274506],"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.0000027330636,0.000009309063,0.0000015933091,0.008007917,0.00021707351,0.000001462295,0.0004369754,0.98831505,0.0003820931,0.000071236595,0.0000035130126,0.002551023],"study_design_scores_gemma":[0.000229412,0.0000027524713,0.000008348352,0.0016688202,0.000039560506,0.000005655486,0.0030765694,0.9376638,0.056893006,0.0000022520373,0.00007805862,0.00033177904],"about_ca_topic_score_codex":0.000010128293,"about_ca_topic_score_gemma":0.000005808553,"teacher_disagreement_score":0.32695833,"about_ca_system_score_codex":0.00035650225,"about_ca_system_score_gemma":0.00017249459,"threshold_uncertainty_score":0.99991935},"labels":[],"label_agreement":null},{"id":"W4280561258","doi":"10.1142/s0219622022500171","title":"A Hybrid Data-Driven Approach for Forecasting the Characteristics of Production Disruptions and Interruptions","year":2022,"lang":"en","type":"article","venue":"International Journal of Information Technology & Decision Making","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Downtime; Production (economics); Automotive industry; Computer science; Range (aeronautics); Scheduling (production processes); Reliability engineering; Industrial engineering; Operations research; Engineering; Operations management; Economics","score_opus":0.029256593937874567,"score_gpt":0.28661738671634546,"score_spread":0.2573607927784709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280561258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10403803,0.00007048118,0.89401656,0.0004110301,0.0010744401,0.00014651484,0.00014196287,0.000047336183,0.000053658037],"genre_scores_gemma":[0.750921,0.000040392544,0.24882407,0.000031847027,0.00007962753,0.000018950706,0.00007458726,0.000006972653,0.0000025510142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879074,0.000014455492,0.0007236598,0.00006958417,0.00031736778,0.000084179555],"domain_scores_gemma":[0.998615,0.00013772624,0.0005235406,0.00018889019,0.0005190256,0.000015791395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059915154,0.00007814303,0.00013625542,0.00070260465,0.00017637819,0.000060304566,0.0006570624,0.00003447656,0.000014050733],"category_scores_gemma":[0.00081012695,0.000065329325,0.000046037207,0.00021534762,0.00005882463,0.00067156553,0.00025729186,0.00027413637,4.9461136e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006938667,0.000031816093,0.00033720603,0.000016767239,0.00012783812,0.0000012423064,0.00049846905,0.5332247,0.000056806497,0.001543994,0.00055781414,0.46353397],"study_design_scores_gemma":[0.00029501633,0.000046354802,0.00020621151,0.000056633864,0.00002788059,0.0007598495,0.0014709206,0.9937184,0.00008390928,0.001429729,0.0018384482,0.000066671135],"about_ca_topic_score_codex":2.7776528e-7,"about_ca_topic_score_gemma":1.9796965e-7,"teacher_disagreement_score":0.64688295,"about_ca_system_score_codex":0.00007677105,"about_ca_system_score_gemma":0.000029739613,"threshold_uncertainty_score":0.26640525},"labels":[],"label_agreement":null},{"id":"W4280593020","doi":"10.1016/j.ejor.2022.05.033","title":"Order assignment and scheduling under processing and distribution time uncertainty","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National University's Basic Research Foundation of China","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Operations research; Mathematics","score_opus":0.037768672133135485,"score_gpt":0.30144621903278024,"score_spread":0.26367754689964473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280593020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65335315,0.0037185317,0.3371354,0.0026935297,0.0002246028,0.00020331127,0.00003684785,0.000054325905,0.002580316],"genre_scores_gemma":[0.9839556,0.000071881695,0.015523606,0.00004362757,0.00014407656,0.0000021326798,0.000025740825,0.000019216855,0.00021411205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986481,0.0003504833,0.0002197642,0.000087697816,0.00055708416,0.00013686871],"domain_scores_gemma":[0.99940956,0.00008032807,0.00003058712,0.000042663516,0.00034239417,0.00009448557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026477138,0.000061317594,0.00007777194,0.0001003543,0.00045369728,0.00017291683,0.00008835532,0.000008848069,0.00021583951],"category_scores_gemma":[0.00014287664,0.00005626963,0.0000126801515,0.00022955703,0.00005332274,0.00014896036,0.00007941826,0.0004385293,0.000006378115],"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.000018128152,0.00001722751,0.000052903968,0.000008668436,0.000015995327,0.000019032093,0.00020067742,0.9903583,0.0011466346,0.00023436671,0.00042686597,0.0075012227],"study_design_scores_gemma":[0.0005414515,0.00014566154,0.001306412,0.000030427853,0.0000053389736,0.00016176382,0.0006619993,0.9941226,0.00009623221,0.000067327295,0.0027695997,0.00009118748],"about_ca_topic_score_codex":5.751081e-7,"about_ca_topic_score_gemma":9.448744e-8,"teacher_disagreement_score":0.33060247,"about_ca_system_score_codex":0.00011395151,"about_ca_system_score_gemma":0.00009523569,"threshold_uncertainty_score":0.34895188},"labels":[],"label_agreement":null},{"id":"W4280645929","doi":"10.1007/s10878-022-00865-y","title":"Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"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 Sciences and Engineering Research Council of Canada","keywords":"Multiprocessor scheduling; Theory of computation; Computer science; Competitive analysis; Multiprocessing; Job shop scheduling; Upper and lower bounds; Scheduling (production processes); Algorithm; Approximation algorithm; Online algorithm; Parallel computing; Flow shop scheduling; Partition (number theory); Mathematical optimization; Mathematics; Combinatorics; Schedule","score_opus":0.014826289961299985,"score_gpt":0.2346524241045523,"score_spread":0.21982613414325233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280645929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006207561,0.00007651883,0.9902265,0.000044987057,0.0027483695,0.0004397716,0.000011491293,0.00010862398,0.00013619254],"genre_scores_gemma":[0.20512845,0.0000065790528,0.79421216,0.000017283413,0.00046430682,0.00007026598,0.000030190926,0.000060035,0.00001072817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986461,0.00003990495,0.00056300854,0.00014630034,0.00038734722,0.0002173594],"domain_scores_gemma":[0.99820477,0.00019294243,0.0004683516,0.00011189664,0.0009302725,0.000091788046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033804,0.00018557583,0.0002947475,0.0002540823,0.00030502613,0.00008988001,0.00021325007,0.000068993424,0.000017408785],"category_scores_gemma":[0.00029808734,0.00017962328,0.00007712557,0.00063684053,0.000019883466,0.0004532959,0.000029218121,0.0003312604,3.0460748e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017956091,0.00008065857,0.00003475177,0.000047247057,0.000068985864,0.000002065839,0.0003797635,0.996914,0.00040708223,0.00009008878,0.000020609843,0.0017751681],"study_design_scores_gemma":[0.004034427,0.0007195728,0.000007714396,0.000043252225,0.000069864014,0.000040106694,0.00048930146,0.9921182,0.001960333,0.00026150217,0.000033632725,0.00022210451],"about_ca_topic_score_codex":0.0000017873707,"about_ca_topic_score_gemma":5.8674104e-8,"teacher_disagreement_score":0.19892089,"about_ca_system_score_codex":0.00022220347,"about_ca_system_score_gemma":0.00015032294,"threshold_uncertainty_score":0.7324825},"labels":[],"label_agreement":null},{"id":"W4281476672","doi":"10.32920/19780162","title":"Energy-aware flexible job shop scheduling problem and preventive maintenance under the limited resource constraints","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Preventive maintenance; Unavailability; Tardiness; Scheduling (production processes); Crew; Optimal maintenance; Energy consumption; Computer science; Operations research; Reliability engineering; Job shop scheduling; Production (economics); Mathematical optimization; Operations management; Engineering; Schedule; Mathematics","score_opus":0.016443760443568396,"score_gpt":0.23310221603063466,"score_spread":0.21665845558706626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281476672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035125664,0.001747539,0.9378146,0.0011582845,0.00065829785,0.00059444923,0.00008489258,0.0014334238,0.05299598],"genre_scores_gemma":[0.67048794,0.0015546437,0.29443282,0.0014824336,0.00047492346,0.000801833,0.000546312,0.00038649645,0.029832603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982056,0.00012134495,0.00041577732,0.0005460778,0.000307351,0.00040383544],"domain_scores_gemma":[0.9989833,0.00017641022,0.00010456693,0.00052051945,0.00009728089,0.00011789304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041065528,0.0004002379,0.00034071616,0.00014905879,0.0002575022,0.00022957409,0.00042080955,0.00025519275,0.00071382127],"category_scores_gemma":[0.00001788089,0.00032710008,0.00012204793,0.00028467854,0.00020181197,0.00006666812,0.00066773646,0.0010293886,0.000005957923],"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.000008696331,0.00001784453,0.000060591523,0.00011841794,0.00019912813,0.0000050483422,0.00035528088,0.9877884,0.00001415528,0.005198761,0.0010010963,0.0052325847],"study_design_scores_gemma":[0.00041375702,0.00002191845,0.000071555565,0.00027206016,0.000069621114,0.00002409456,0.003901795,0.98882055,0.00021236054,0.0029307574,0.0027102095,0.00055131083],"about_ca_topic_score_codex":0.000028451723,"about_ca_topic_score_gemma":0.000012879178,"teacher_disagreement_score":0.6669754,"about_ca_system_score_codex":0.00014682137,"about_ca_system_score_gemma":0.000093754585,"threshold_uncertainty_score":0.9999181},"labels":[],"label_agreement":null},{"id":"W4281479731","doi":"10.32920/19780162.v1","title":"Energy-aware flexible job shop scheduling problem and preventive maintenance under the limited resource constraints","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Preventive maintenance; Unavailability; Tardiness; Crew; Scheduling (production processes); Optimal maintenance; Energy consumption; Computer science; Operations research; Reliability engineering; Job shop scheduling; Production (economics); Mathematical optimization; Operations management; Engineering; Schedule; Mathematics","score_opus":0.016443760443568396,"score_gpt":0.23310221603063466,"score_spread":0.21665845558706626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281479731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035125664,0.001747539,0.9378146,0.0011582845,0.00065829785,0.00059444923,0.00008489258,0.0014334238,0.05299598],"genre_scores_gemma":[0.67048794,0.0015546437,0.29443282,0.0014824336,0.00047492346,0.000801833,0.000546312,0.00038649645,0.029832603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982056,0.00012134495,0.00041577732,0.0005460778,0.000307351,0.00040383544],"domain_scores_gemma":[0.9989833,0.00017641022,0.00010456693,0.00052051945,0.00009728089,0.00011789304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041065528,0.0004002379,0.00034071616,0.00014905879,0.0002575022,0.00022957409,0.00042080955,0.00025519275,0.00071382127],"category_scores_gemma":[0.00001788089,0.00032710008,0.00012204793,0.00028467854,0.00020181197,0.00006666812,0.00066773646,0.0010293886,0.000005957923],"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.000008696331,0.00001784453,0.000060591523,0.00011841794,0.00019912813,0.0000050483422,0.00035528088,0.9877884,0.00001415528,0.005198761,0.0010010963,0.0052325847],"study_design_scores_gemma":[0.00041375702,0.00002191845,0.000071555565,0.00027206016,0.000069621114,0.00002409456,0.003901795,0.98882055,0.00021236054,0.0029307574,0.0027102095,0.00055131083],"about_ca_topic_score_codex":0.000028451723,"about_ca_topic_score_gemma":0.000012879178,"teacher_disagreement_score":0.6669754,"about_ca_system_score_codex":0.00014682137,"about_ca_system_score_gemma":0.000093754585,"threshold_uncertainty_score":0.9999181},"labels":[],"label_agreement":null},{"id":"W4281486503","doi":"10.32920/19874092","title":"Sequencing and Scheduling Optimization in Low-Volume Low-Variety Production Systems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Suite; Time horizon; Mathematical optimization; Integer programming; Modular design; Mathematical model; Linear programming; Distributed computing; Job shop scheduling; Optimization problem; Industrial engineering; Operations research; Engineering; Algorithm; Mathematics; Schedule","score_opus":0.013574011599388675,"score_gpt":0.21786657247774582,"score_spread":0.20429256087835715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281486503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108437344,0.0019238984,0.87960976,0.000110036875,0.005966019,0.0009636179,0.000017496635,0.0013660461,0.0016057871],"genre_scores_gemma":[0.60664904,0.0012352932,0.38949847,0.000034485678,0.00058677164,0.00036173538,0.00045093303,0.00018163798,0.0010016228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981741,0.00008197937,0.00056866504,0.0005935798,0.0002870405,0.00029468015],"domain_scores_gemma":[0.9992872,0.000025431948,0.00010603324,0.0003991866,0.00009611977,0.00008606557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058037904,0.00033076093,0.00037621128,0.0003532135,0.00011850818,0.0002373928,0.00016892061,0.00031261268,0.00018270598],"category_scores_gemma":[0.00011459725,0.00039157452,0.000053786098,0.0003968477,0.000027252803,0.00019312049,0.00024604317,0.00095009495,0.0000060307907],"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.0000036853285,0.000012778097,0.0003983039,0.00083109736,0.000030062303,0.0000050091135,0.00051018316,0.99790275,0.00003205725,0.000052779185,0.000025090127,0.00019617967],"study_design_scores_gemma":[0.00018574046,0.000007190858,0.00005524584,0.0003882041,0.000019092633,0.000013113386,0.0010314571,0.9977464,0.000095975636,0.000019587304,0.00002276845,0.00041519126],"about_ca_topic_score_codex":0.00017672482,"about_ca_topic_score_gemma":0.0000094612415,"teacher_disagreement_score":0.4982117,"about_ca_system_score_codex":0.00066052773,"about_ca_system_score_gemma":0.00011611435,"threshold_uncertainty_score":0.9998536},"labels":[],"label_agreement":null},{"id":"W4281490250","doi":"10.32920/19874092.v1","title":"Sequencing and Scheduling Optimization in Low-Volume Low-Variety Production Systems","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Suite; Time horizon; Mathematical optimization; Integer programming; Modular design; Mathematical model; Linear programming; Job shop scheduling; Distributed computing; Optimization problem; Industrial engineering; Operations research; Engineering; Algorithm; Mathematics; Schedule","score_opus":0.013574011599388675,"score_gpt":0.21786657247774582,"score_spread":0.20429256087835715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281490250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108437344,0.0019238984,0.87960976,0.000110036875,0.005966019,0.0009636179,0.000017496635,0.0013660461,0.0016057871],"genre_scores_gemma":[0.60664904,0.0012352932,0.38949847,0.000034485678,0.00058677164,0.00036173538,0.00045093303,0.00018163798,0.0010016228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981741,0.00008197937,0.00056866504,0.0005935798,0.0002870405,0.00029468015],"domain_scores_gemma":[0.9992872,0.000025431948,0.00010603324,0.0003991866,0.00009611977,0.00008606557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058037904,0.00033076093,0.00037621128,0.0003532135,0.00011850818,0.0002373928,0.00016892061,0.00031261268,0.00018270598],"category_scores_gemma":[0.00011459725,0.00039157452,0.000053786098,0.0003968477,0.000027252803,0.00019312049,0.00024604317,0.00095009495,0.0000060307907],"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.0000036853285,0.000012778097,0.0003983039,0.00083109736,0.000030062303,0.0000050091135,0.00051018316,0.99790275,0.00003205725,0.000052779185,0.000025090127,0.00019617967],"study_design_scores_gemma":[0.00018574046,0.000007190858,0.00005524584,0.0003882041,0.000019092633,0.000013113386,0.0010314571,0.9977464,0.000095975636,0.000019587304,0.00002276845,0.00041519126],"about_ca_topic_score_codex":0.00017672482,"about_ca_topic_score_gemma":0.0000094612415,"teacher_disagreement_score":0.4982117,"about_ca_system_score_codex":0.00066052773,"about_ca_system_score_gemma":0.00011611435,"threshold_uncertainty_score":0.9998536},"labels":[],"label_agreement":null},{"id":"W4282832939","doi":"10.1109/asmc54647.2022.9792523","title":"Artificial Intelligence for Real Time Cluster Tool Scheduling : EO: Equipment Optimization","year":2022,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Alchemy (Canada)","funders":"","keywords":"Semiconductor device fabrication; Scheduling (production processes); Computer science; Throughput; Automation; Software deployment; Process (computing); Distributed computing; Real-time computing; Embedded system; Reliability engineering; Wafer; Engineering; Software engineering; Operating system","score_opus":0.020589335152499052,"score_gpt":0.24813139251678742,"score_spread":0.22754205736428837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282832939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034947544,0.000021550946,0.99279684,0.00019636091,0.0005686793,0.00032898047,0.000014379579,0.0005493044,0.0020291656],"genre_scores_gemma":[0.056905106,0.000019336358,0.94155884,0.0001487538,0.00020203217,0.00022968565,0.00014969868,0.000053921816,0.00073262694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990699,0.000020991834,0.00031531716,0.0001845764,0.00018335298,0.00022585878],"domain_scores_gemma":[0.999651,0.00007705764,0.00002899439,0.00014643329,0.00005015751,0.00004632085],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031294808,0.00012011307,0.00011611032,0.00009714653,0.0002167223,0.00006349497,0.00013678087,0.000041183892,0.0017878733],"category_scores_gemma":[0.000034574154,0.00013348063,0.000057478923,0.00022010673,0.000011089168,0.00009802555,0.00006366918,0.000107340755,0.00004700198],"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.00001842962,0.000022220936,0.0000031201187,0.000010138,0.000015982796,4.580692e-7,0.00016131981,0.98864675,0.0001681486,0.0010536262,0.0001949655,0.009704871],"study_design_scores_gemma":[0.00007447098,0.00004043352,8.840706e-7,0.0000035857247,0.000011380046,0.0000026268133,0.00021754521,0.9969861,0.0019347832,0.000294611,0.00024879072,0.0001848121],"about_ca_topic_score_codex":0.000003521466,"about_ca_topic_score_gemma":6.3740976e-7,"teacher_disagreement_score":0.05341035,"about_ca_system_score_codex":0.00012576756,"about_ca_system_score_gemma":0.000023879795,"threshold_uncertainty_score":0.99912465},"labels":[],"label_agreement":null},{"id":"W4285032669","doi":"10.1007/978-3-031-04520-2_1","title":"Introduction to QUBO","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Quadratic unconstrained binary optimization; Notation; Computer science; Theoretical computer science; Mathematics; Arithmetic","score_opus":0.008922618095965307,"score_gpt":0.1953231414721672,"score_spread":0.1864005233762019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285032669","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010579328,0.000120528646,0.031999566,0.00074435986,0.0021996927,0.00009256562,0.000009197044,0.00071128435,0.96412176],"genre_scores_gemma":[0.000012401533,0.00009463695,0.042652894,0.00014731105,0.0019503467,0.000011207679,0.000091719456,0.000076102275,0.9549634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952346,0.0000015022208,0.00011764009,0.0001528541,0.00012398123,0.000080571874],"domain_scores_gemma":[0.99971867,0.000006428555,0.0000104079945,0.00019073211,0.00002113792,0.000052612268],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000043397547,0.00012429843,0.00011064021,0.0001281667,0.000032428947,0.00001693842,0.00007219817,0.00007575714,0.036871724],"category_scores_gemma":[0.0000060140014,0.00013825206,0.00004009553,0.000028037679,0.000004044578,0.00002565812,0.00002558754,0.0001977564,0.000993377],"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.0000018803864,0.0000017678196,1.0324199e-7,0.000014085581,0.00004046091,0.0000025065754,0.00005294105,0.71499604,0.000006339303,0.09067706,0.18144238,0.01276445],"study_design_scores_gemma":[0.00003344059,0.000012520492,2.6207812e-7,0.000003283245,0.000009397326,0.000004073091,0.0000062834088,0.015214474,0.000030448939,0.000257721,0.9842529,0.00017518667],"about_ca_topic_score_codex":0.0000019482732,"about_ca_topic_score_gemma":0.0000018326276,"teacher_disagreement_score":0.80281055,"about_ca_system_score_codex":0.00008396791,"about_ca_system_score_gemma":0.000006935659,"threshold_uncertainty_score":0.99978447},"labels":[],"label_agreement":null},{"id":"W4285099332","doi":"10.18280/jesa.550310","title":"Dispatching Rules for Minimizing Deviation from JIT Schedule Using the Earliness -Tardiness Scheduling Problem with Due Windows Approach","year":2022,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Heuristics; Schedule; Computer science; Scheduling (production processes); Mathematical optimization; Retard; Job shop scheduling; Mathematics","score_opus":0.02180727023040361,"score_gpt":0.23496611821832109,"score_spread":0.21315884798791748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285099332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39625528,0.0010105901,0.60143733,0.00006122039,0.0004084346,0.00039689516,0.000043273893,0.0002972281,0.00008972157],"genre_scores_gemma":[0.4524938,0.000017074693,0.5467102,0.00003395771,0.00045010785,0.000094482486,0.000053336225,0.00012030253,0.000026742204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975607,0.00027548138,0.0007099312,0.00032787502,0.0006211543,0.00050487136],"domain_scores_gemma":[0.99868363,0.0002573189,0.00038990044,0.00029438874,0.00023663185,0.0001381257],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009896018,0.0003656109,0.0004573656,0.00022170249,0.001860962,0.0006375856,0.0005017386,0.00007372751,0.00004722586],"category_scores_gemma":[0.00010806041,0.00027680545,0.00016396324,0.00054818543,0.00006238131,0.00055236847,0.00011733795,0.00067837676,0.0000027118808],"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.000032500346,0.000042208674,0.00086500746,0.00013978241,0.00022190767,0.000015447351,0.001718247,0.97880554,0.00051144283,0.00012656166,0.000022488246,0.017498892],"study_design_scores_gemma":[0.0010316046,0.00005254611,0.0048744804,0.00025356008,0.00015952335,0.00061207,0.0025456208,0.9892978,0.0002042383,0.00046232098,0.00010521913,0.0004010065],"about_ca_topic_score_codex":0.00004049584,"about_ca_topic_score_gemma":0.0000059670674,"teacher_disagreement_score":0.0562385,"about_ca_system_score_codex":0.00036944723,"about_ca_system_score_gemma":0.00013546848,"threshold_uncertainty_score":0.9999684},"labels":[],"label_agreement":null},{"id":"W4285151935","doi":"10.5267/j.jpm.2022.5.002","title":"A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Mathematical optimization; GRASP; Flow shop scheduling; Computer science; Sequence (biology); Genetic algorithm; Metaheuristic; Blocking (statistics); Algorithm; Integer programming; Scheduling (production processes); Mathematics; Routing (electronic design automation)","score_opus":0.013193968955826195,"score_gpt":0.2313020202296604,"score_spread":0.2181080512738342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285151935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061430116,0.0028902348,0.98900366,0.00029146386,0.00039037733,0.000951595,0.00004004744,0.00008874504,0.00020084625],"genre_scores_gemma":[0.066324644,0.00046255617,0.9323311,0.000099726276,0.0001924349,0.00016292864,0.000009123065,0.00006259485,0.0003548983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986867,0.000042823893,0.0003864602,0.00017133419,0.00045763756,0.00025508506],"domain_scores_gemma":[0.99947464,0.000063682084,0.00016834284,0.00016066051,0.000080357735,0.00005231536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065909553,0.00018592525,0.00021032747,0.00024299097,0.0003754912,0.0001727297,0.0002698657,0.000011846577,0.000040810435],"category_scores_gemma":[0.0000069642715,0.00013218881,0.000073270676,0.00017606493,0.000029724271,0.00010325341,0.00012128399,0.00030309206,7.525788e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025729736,0.00002870434,0.000024645582,0.00008334902,0.00036089707,0.00012282263,0.00023851208,0.86146796,0.000008294965,0.000017049462,0.0003061402,0.1373159],"study_design_scores_gemma":[0.0011191597,0.0002445727,0.00001231519,0.000058416306,0.0002192991,0.0007836458,0.00075301965,0.9927574,0.00015892988,0.00010361401,0.0036079395,0.00018170416],"about_ca_topic_score_codex":0.0000069966513,"about_ca_topic_score_gemma":0.0000010151622,"teacher_disagreement_score":0.1371342,"about_ca_system_score_codex":0.00013494308,"about_ca_system_score_gemma":0.0000494968,"threshold_uncertainty_score":0.53905034},"labels":[],"label_agreement":null},{"id":"W4285247682","doi":"10.5267/j.jpm.2022.3.003","title":"A survey of scheduling problems with uncertain interval/bounded processing/setup times","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bounded function; Scheduling (production processes); Computer science; Upper and lower bounds; Job shop scheduling; Mathematical optimization; Interval (graph theory); Random variable; Mathematics; Statistics; Schedule","score_opus":0.027935214651590552,"score_gpt":0.26081166058818583,"score_spread":0.2328764459365953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285247682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28414002,0.011334943,0.6865571,0.00049292954,0.0020183576,0.0026223364,0.0000604017,0.0005330455,0.012240882],"genre_scores_gemma":[0.8203131,0.00012101828,0.1788339,0.00003891096,0.000045686156,0.000038527152,0.000013806618,0.00005094538,0.00054408604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864674,0.000091272545,0.00049649953,0.00011006386,0.00048048925,0.00017493442],"domain_scores_gemma":[0.9993126,0.000027302718,0.00030432816,0.00012649065,0.00019261241,0.000036670157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590181,0.00013527766,0.00025953923,0.00039223945,0.0000868655,0.000057904537,0.00027650027,0.000020071355,0.00007224514],"category_scores_gemma":[0.000021191765,0.00011178965,0.000056136036,0.00073786575,0.000025193203,0.00014269513,0.00007983667,0.0002590148,0.0000010848659],"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.0000826576,0.000113804505,0.0008993872,0.00041987805,0.00028990651,0.000030404446,0.0009265452,0.9886327,0.000016804475,0.000056585734,0.0005418771,0.007989491],"study_design_scores_gemma":[0.0020286771,0.0007992614,0.0017982166,0.00044716577,0.0001520943,0.00008600497,0.0031906401,0.9885035,0.00020104434,0.000112871305,0.0023340497,0.00034646157],"about_ca_topic_score_codex":0.00003680878,"about_ca_topic_score_gemma":0.0000114284285,"teacher_disagreement_score":0.5361731,"about_ca_system_score_codex":0.00013949764,"about_ca_system_score_gemma":0.000085431326,"threshold_uncertainty_score":0.455865},"labels":[],"label_agreement":null},{"id":"W4285252923","doi":"10.5267/j.jpm.2022.4.002","title":"A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Successor cardinal; Flow shop scheduling; Computer science; Job shop scheduling; Job shop; Mathematical optimization; Scheduling (production processes); Operations research; Industrial engineering; Schedule; Mathematics; Engineering","score_opus":0.005536354206269567,"score_gpt":0.20026662142706603,"score_spread":0.19473026722079645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285252923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17635348,0.0022541888,0.79532254,0.00096266554,0.00085204275,0.0027347964,0.000093116134,0.0006976638,0.020729482],"genre_scores_gemma":[0.18084018,0.00020157923,0.81800354,0.000045131364,0.00006975669,0.00004918543,0.000027264196,0.000041518924,0.00072184333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899,0.00003790469,0.00034295456,0.000121713136,0.00035043436,0.00015701764],"domain_scores_gemma":[0.99963725,0.000020924668,0.00013340995,0.00008308409,0.00007304424,0.000052320043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038178355,0.00013250414,0.00017776908,0.0002681893,0.00011349425,0.00005622871,0.00012075391,0.000022595263,0.00016888937],"category_scores_gemma":[0.0000028907484,0.00011498176,0.000039195693,0.00037442805,0.000023177156,0.00017295318,0.000014711353,0.00022691378,0.0000020987022],"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.00011728507,0.00007016114,0.00023686945,0.00020589396,0.0003560796,0.00012004256,0.001131044,0.9787059,0.00015005308,0.00021222472,0.00056972046,0.018124761],"study_design_scores_gemma":[0.0018962041,0.00037719036,0.00032991607,0.0001614818,0.0001930508,0.00018134448,0.0015431691,0.99267596,0.00016594458,0.00009344125,0.0021211943,0.00026112676],"about_ca_topic_score_codex":0.0000027068315,"about_ca_topic_score_gemma":0.000001629622,"teacher_disagreement_score":0.02268098,"about_ca_system_score_codex":0.00007386949,"about_ca_system_score_gemma":0.000041092466,"threshold_uncertainty_score":0.468882},"labels":[],"label_agreement":null},{"id":"W4285395502","doi":"10.3390/a15070246","title":"A Two-Stage Multi-Objective Genetic Algorithm for a Flexible Job Shop Scheduling Problem with Lot Streaming","year":2022,"lang":"en","type":"article","venue":"Algorithms","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Genetic algorithm; Flow shop scheduling; Scheduling (production processes); Algorithm; Mathematics; Schedule","score_opus":0.01700707728161659,"score_gpt":0.25110872562482583,"score_spread":0.23410164834320923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285395502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00637186,0.00083953136,0.9886174,0.00003271495,0.0007306163,0.0011949376,0.00026316041,0.0013805551,0.0005692167],"genre_scores_gemma":[0.010893306,0.00003478788,0.9847935,0.00008955058,0.00031071831,0.0013654146,0.00012216163,0.00023855148,0.0021520115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997478,0.00006610483,0.00047681056,0.0006704646,0.00049844454,0.0008101698],"domain_scores_gemma":[0.9989022,0.00014569082,0.00011476818,0.00042641902,0.0001920824,0.00021882239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035443337,0.00047526212,0.00044932176,0.00033410822,0.00065832556,0.00014604315,0.0003950542,0.000090492984,0.0001539792],"category_scores_gemma":[0.000022163138,0.0004945451,0.00014827342,0.0008657598,0.00006861722,0.00022168046,0.00013756535,0.00053498265,0.000018261853],"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.0000206504,0.000101561134,0.00014927333,0.00005276549,0.00019679841,0.000044877495,0.00090137473,0.91088074,0.00013082832,0.000072497096,0.00003464323,0.08741398],"study_design_scores_gemma":[0.0033512695,0.00032817948,0.00007512044,0.000040226038,0.00008101929,0.000105472405,0.0034765785,0.98973835,0.001206891,0.00005732447,0.0008408059,0.00069874787],"about_ca_topic_score_codex":0.000104334926,"about_ca_topic_score_gemma":0.000020340733,"teacher_disagreement_score":0.08671523,"about_ca_system_score_codex":0.00033046992,"about_ca_system_score_gemma":0.0001403548,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W4286513993","doi":"10.1016/j.cie.2022.108487","title":"Mathematical model and simulated annealing algorithm for setup operator constrained flexible job shop scheduling problem","year":2022,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":63,"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 Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Job shop scheduling; Call for bids; Automation; Scheduling (production processes); Computer science; Operator (biology); Industrial engineering; Simulated annealing; Process (computing); Mathematical optimization; Algorithm; Procurement; Engineering; Mechanical engineering; Schedule; Mathematics; Operating system","score_opus":0.02863278429937791,"score_gpt":0.23221619971903615,"score_spread":0.20358341541965824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286513993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032447018,0.00017820888,0.964733,0.00006359894,0.0007674062,0.00060881535,0.000079944155,0.0010748686,0.000047111524],"genre_scores_gemma":[0.13059741,0.000007531035,0.868491,0.000051621246,0.00046751072,0.00010896275,0.00008922534,0.00013262346,0.00005414529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847525,0.0000197351,0.00047612088,0.0003342329,0.00022426902,0.00047041464],"domain_scores_gemma":[0.9993124,0.00020025007,0.000042552463,0.00018047645,0.000060159018,0.00020414399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039643238,0.00031362445,0.00038836984,0.0002239294,0.0002613665,0.00015674489,0.00021932523,0.00016284964,0.000024491113],"category_scores_gemma":[0.000054484623,0.00037476927,0.00008783839,0.0003739232,0.000026973416,0.00015672183,0.00013196043,0.0005528975,0.0000016716452],"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.00000773079,0.0000135355085,0.000003888333,0.000049551785,0.000084644504,0.0000046695527,0.00025971976,0.9859218,0.00037478344,0.00048006236,0.00009029887,0.012709298],"study_design_scores_gemma":[0.001912456,0.000058309044,4.3496274e-7,0.0000744268,0.000036110596,0.000029217857,0.00013068208,0.99666154,0.0003920584,0.000073598596,0.00021376844,0.00041738147],"about_ca_topic_score_codex":0.0000017838445,"about_ca_topic_score_gemma":4.642873e-8,"teacher_disagreement_score":0.098150395,"about_ca_system_score_codex":0.00014060983,"about_ca_system_score_gemma":0.00006945007,"threshold_uncertainty_score":0.9998704},"labels":[],"label_agreement":null},{"id":"W4287599297","doi":"","title":"Toward application of real-time video streams in production planning and control : a conceptual framework","year":2020,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; STREAMS; Production (economics); Control (management); Production planning; Conceptual framework; Real-time computing; Process management; Artificial intelligence; Business; Computer network","score_opus":0.012171388677147985,"score_gpt":0.2325428858057997,"score_spread":0.22037149712865173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287599297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10122179,0.0018666728,0.89323765,0.0010491109,0.00017783477,0.0011598194,0.0000831839,0.0010935849,0.00011037656],"genre_scores_gemma":[0.7678604,0.00043093937,0.23062405,0.00009634887,0.00020518432,0.0005907232,0.00009739465,0.00008254594,0.000012385303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803513,0.00008950972,0.0006763715,0.00056983385,0.00026357465,0.00036560086],"domain_scores_gemma":[0.9987666,0.00013994519,0.00025686744,0.0005517374,0.000100164645,0.00018469493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037117404,0.00040171886,0.0006601424,0.0003624101,0.000044898108,0.00007386119,0.00029133545,0.0007063491,0.000008702506],"category_scores_gemma":[0.00032558973,0.00047076982,0.00009661786,0.00039663634,0.00010513844,0.00011778492,0.00015517308,0.0010025277,0.000004068249],"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.00008663377,0.000058282345,0.008880564,0.0002972,0.00009147137,0.000012075012,0.0021054267,0.97014314,0.006786384,0.0014534005,0.00014394792,0.009941466],"study_design_scores_gemma":[0.00039811988,0.000047799967,0.005115412,0.00037906598,0.000054125092,0.000012427614,0.00028353074,0.9849153,0.0061579766,0.0021861836,0.000032440494,0.00041758476],"about_ca_topic_score_codex":0.0015227669,"about_ca_topic_score_gemma":0.000047755424,"teacher_disagreement_score":0.6666386,"about_ca_system_score_codex":0.00027216322,"about_ca_system_score_gemma":0.000109241686,"threshold_uncertainty_score":0.9997744},"labels":[],"label_agreement":null},{"id":"W4289522155","doi":"10.3390/app12157784","title":"Discriminating and Clustering Ordered Permutations Using Artificial Neural Networks: A Potential Application in ANN-Guided Genetic Algorithms","year":2022,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Permutation (music); Artificial neural network; Computer science; Cluster analysis; Binary number; Metaheuristic; Algorithm; Travelling salesman problem; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.0271602963520645,"score_gpt":0.26382324727453826,"score_spread":0.23666295092247377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289522155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087253,0.00010000232,0.5905676,0.000038230202,0.00017659557,0.00017167986,0.0000025890768,0.00009022558,0.00012781096],"genre_scores_gemma":[0.91476357,0.0000046722334,0.084999524,0.00003512512,0.00008187609,0.00008972648,0.000009399,0.000014417595,0.0000016885132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989743,0.000027458902,0.00025770316,0.00026974492,0.00021896418,0.00025182203],"domain_scores_gemma":[0.9997789,0.00003176299,0.000046670655,0.0000832902,0.000014534458,0.000044815315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023852263,0.000109602006,0.000109769535,0.00016947303,0.000607762,0.00011952895,0.0001518412,0.000027357113,0.000013278631],"category_scores_gemma":[0.000008609508,0.00012271055,0.000017031265,0.0007379532,0.00009483636,0.00009524079,0.00009019201,0.00014328794,5.644874e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015809048,0.000009817443,0.000119996286,0.0000052134124,0.000002226112,0.0000016601385,0.00049062376,0.9808252,0.0015043104,0.00019739888,0.0000013485375,0.01684063],"study_design_scores_gemma":[0.00013921708,0.0000119266715,0.00071531575,0.0000026119149,0.000008035014,0.000024335492,0.0025413819,0.99596524,0.000055290235,0.00038544042,0.000002340472,0.00014885626],"about_ca_topic_score_codex":0.0000584779,"about_ca_topic_score_gemma":0.00003307171,"teacher_disagreement_score":0.50603825,"about_ca_system_score_codex":0.0000525676,"about_ca_system_score_gemma":0.00001871897,"threshold_uncertainty_score":0.5003991},"labels":[],"label_agreement":null},{"id":"W4289743362","doi":"","title":"The treatment of merchandises in the toflit18 datascape","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.01834329810217319,"score_gpt":0.2371473240064052,"score_spread":0.218804025904232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289743362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.520809,0.03261692,0.328109,0.015185919,0.002573163,0.0028606218,0.0007470458,0.00093955273,0.09615882],"genre_scores_gemma":[0.88763446,0.023933962,0.08419982,0.0000537463,0.00011980203,0.0003180564,0.0013153463,0.0000913502,0.0023334348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973637,0.0015598662,0.00036780105,0.00026130857,0.00024315187,0.0002042149],"domain_scores_gemma":[0.9963264,0.0013722805,0.00013481046,0.0016799263,0.00044102233,0.00004559148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002335821,0.00020167354,0.00021099186,0.00008411599,0.00018541359,0.00018904655,0.0009566854,0.00013000293,0.000043272692],"category_scores_gemma":[0.0003139579,0.00013456847,0.00010967251,0.00025846052,0.0001892612,0.00004216365,0.00016230496,0.00020812238,0.000016051521],"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.00008894013,0.0042532147,0.006452382,0.00081632263,0.0011541123,0.000020461002,0.24142917,0.07482838,0.0008431868,0.067155525,0.010827885,0.5921304],"study_design_scores_gemma":[0.0013884937,0.0000031631625,0.0052239248,0.0015328682,0.00015008925,0.000010641104,0.0015158801,0.8478019,0.04744642,0.003808899,0.09032132,0.00079639547],"about_ca_topic_score_codex":0.00030737062,"about_ca_topic_score_gemma":0.0010930853,"teacher_disagreement_score":0.77297354,"about_ca_system_score_codex":0.00007291163,"about_ca_system_score_gemma":0.0000636286,"threshold_uncertainty_score":0.54875433},"labels":[],"label_agreement":null},{"id":"W4290766589","doi":"10.55900/gwngnxdw","title":"Towards a System View on Intelligent Drying","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 22nd International Drying Symposium on Drying Technology - IDS '22","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.009020143467925932,"score_gpt":0.22296781394555545,"score_spread":0.21394767047762953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290766589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801824,0.0004896647,0.0020517933,0.009050604,0.009223358,0.0011936257,0.00009299025,0.0042478456,0.093467765],"genre_scores_gemma":[0.9941559,0.00010939314,0.004496851,0.00023732528,0.0001736016,0.0002967104,0.000010124897,0.00010545972,0.00041462184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973826,0.000019084686,0.00071735826,0.0005306889,0.0009039656,0.0004463339],"domain_scores_gemma":[0.9989094,0.00007197709,0.00032592544,0.0003310038,0.000290916,0.00007077163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000624255,0.00039011033,0.00040917355,0.0009894731,0.0005173886,0.00010936197,0.0019201918,0.00020858202,0.00014759655],"category_scores_gemma":[0.00020337684,0.00035863253,0.00022791508,0.0010342352,0.00011809527,0.00016239015,0.00067362795,0.0010586054,0.000034520024],"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.0002627971,0.0005480227,0.0032544949,0.0009261676,0.0011331213,0.00001644168,0.0022674936,0.49441794,0.11768116,0.35348505,0.002923619,0.02308371],"study_design_scores_gemma":[0.0015757902,0.00062497356,0.00011262215,0.0018062469,0.00016109149,0.00025429926,0.0046761264,0.50330895,0.46579015,0.0035005265,0.016891066,0.0012981542],"about_ca_topic_score_codex":0.000011128224,"about_ca_topic_score_gemma":2.8101746e-7,"teacher_disagreement_score":0.34998453,"about_ca_system_score_codex":0.0009795206,"about_ca_system_score_gemma":0.00004329848,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W4292066565","doi":"10.1093/imaman/dpac010","title":"Planning and scheduling of a parallel-machine production system subject to disruptions and physical distancing","year":2022,"lang":"en","type":"article","venue":"IMA Journal of Management Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scheduling (production processes); Profit (economics); Production (economics); Schedule; Operations research; Production planning; Downtime; Mathematical optimization; Industrial engineering; Engineering; Mathematics; Economics; Microeconomics; Operating system","score_opus":0.011378701149456306,"score_gpt":0.24257377262602442,"score_spread":0.23119507147656812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292066565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5788817,0.0004916111,0.42002064,0.00007087508,0.0001581767,0.00013109273,0.0000029487742,0.000034669436,0.00020832807],"genre_scores_gemma":[0.7892133,0.000021299631,0.21067442,0.0000033209496,0.000044249075,0.000006163929,7.677906e-7,0.000013873264,0.000022598138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931395,0.000018291767,0.00029664615,0.0000682105,0.0002145209,0.00008840846],"domain_scores_gemma":[0.999672,0.000036667603,0.00012764333,0.000082442144,0.00003391018,0.00004731783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037449028,0.00008145334,0.00018910732,0.00016635182,0.000094405645,0.00002820392,0.00006754963,0.00000828178,0.0000022488953],"category_scores_gemma":[0.000026015341,0.00007640744,0.000030202253,0.00017123696,0.000011517674,0.00007856315,0.000061772924,0.00011725694,3.2116438e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011634604,0.000048140508,0.0001487052,0.00079667347,0.000097590884,0.000013395292,0.0035800186,0.9923045,0.00020397888,0.0018267911,0.000019073266,0.0009494854],"study_design_scores_gemma":[0.0003666826,0.0000804567,0.0002206866,0.00038488102,0.00012883873,0.00015749234,0.011076223,0.98691845,0.00017018282,0.00033724433,0.000041692867,0.00011715782],"about_ca_topic_score_codex":3.696903e-7,"about_ca_topic_score_gemma":1.3147915e-7,"teacher_disagreement_score":0.21033165,"about_ca_system_score_codex":0.00004945017,"about_ca_system_score_gemma":0.0000036415336,"threshold_uncertainty_score":0.3115805},"labels":[],"label_agreement":null},{"id":"W4292815494","doi":"","title":"Parallélisation co-évolutive de l'Optimisation par Colonie de Fourmis pour la résolution d'un problème d'ordonnancement industriel","year":2002,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.02012460956114553,"score_gpt":0.22495564357905276,"score_spread":0.20483103401790723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292815494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07519486,0.0012316921,0.88407266,0.01588464,0.00037566724,0.0009948239,0.00014941659,0.0005873184,0.021508895],"genre_scores_gemma":[0.4272222,0.00288522,0.5561518,0.000102662154,0.0001330702,0.00034319863,0.00087416545,0.00012817311,0.012159528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98972416,0.0065671685,0.0010835403,0.0010091722,0.0006528831,0.000963073],"domain_scores_gemma":[0.99378353,0.0015780817,0.0008470349,0.0014203944,0.0019232443,0.00044772204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007065836,0.00072043424,0.0005986876,0.00031343807,0.0007042438,0.0005640378,0.0009466561,0.0011994994,0.00072709913],"category_scores_gemma":[0.0020654516,0.0009326564,0.00029860306,0.0006555046,0.00033116466,0.0003428605,0.0003594206,0.0015205502,0.00016996425],"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.00006560225,0.0020597517,0.010318931,0.00057096063,0.00065927237,0.000035191963,0.044740412,0.70127857,0.004847399,0.07747648,0.0042482675,0.15369916],"study_design_scores_gemma":[0.0015693356,0.000002093217,0.011412753,0.001891243,0.00018376528,0.00005458892,0.00031657735,0.92267376,0.04630724,0.0028483479,0.01182629,0.00091402174],"about_ca_topic_score_codex":0.001568367,"about_ca_topic_score_gemma":0.000288828,"teacher_disagreement_score":0.35202736,"about_ca_system_score_codex":0.0019757005,"about_ca_system_score_gemma":0.00077782205,"threshold_uncertainty_score":0.9993124},"labels":[],"label_agreement":null},{"id":"W4293074843","doi":"10.11159/cdsr22.128","title":"Scaled Consensus Of Hybrid Multi-Agent Systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the International Conference of Control, Dynamic systems, and Robotics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Computer science; Distributed computing; Artificial intelligence","score_opus":0.01849711112236221,"score_gpt":0.22432760894450499,"score_spread":0.20583049782214277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293074843","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8779576,0.00414754,0.101837955,0.00080358493,0.009076785,0.0015773253,0.00085456955,0.00019490493,0.0035497642],"genre_scores_gemma":[0.99702525,0.00007406264,0.00249604,0.000007142492,0.000028554261,0.000022758364,0.000005608803,0.000016991358,0.00032359187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869037,0.000015784812,0.0006043322,0.0001305887,0.00044148476,0.00011742693],"domain_scores_gemma":[0.99867046,0.00007716312,0.0004057752,0.00008345458,0.0007243452,0.000038803857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034841587,0.00013088102,0.00035776664,0.00011728264,0.000062829014,0.000038100858,0.00040979864,0.000031226584,0.000008571968],"category_scores_gemma":[0.00009463275,0.000110282526,0.00007165725,0.00008680437,0.000097700744,0.000045405264,0.000090997244,0.00013609159,3.3068915e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003482484,0.00004318665,0.002289017,0.0003508238,0.00022336771,5.17196e-7,0.00013694768,0.9801047,0.0057181455,0.010966563,0.00007113356,0.00006081156],"study_design_scores_gemma":[0.0010112581,0.00003672947,0.00026570464,0.00018581518,0.000055338052,0.000054415596,0.0013064545,0.9966336,0.00026327165,0.00004889366,0.000036049045,0.0001024736],"about_ca_topic_score_codex":0.000049881528,"about_ca_topic_score_gemma":0.0000013336611,"teacher_disagreement_score":0.119067684,"about_ca_system_score_codex":0.00006903628,"about_ca_system_score_gemma":0.000043342316,"threshold_uncertainty_score":0.4497191},"labels":[],"label_agreement":null},{"id":"W4293252855","doi":"10.5267/j.ijiec.2022.7.002","title":"More effective heuristics for a two-machine no-wait flowshop to minimize maximum lateness","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Heuristics; Dominance (genetics); Mathematical optimization; Scheduling (production processes); Computer science; Constructive; Relation (database); Job shop scheduling; Mathematics; Data mining","score_opus":0.01606371459052399,"score_gpt":0.26446453053549107,"score_spread":0.24840081594496707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020398002,0.00006751456,0.9683316,0.00063567417,0.009831211,0.00031041613,0.0002585843,0.00012155432,0.00004548274],"genre_scores_gemma":[0.67611605,0.000005450957,0.32044125,0.0002106012,0.0027885644,0.00013765387,0.00014171479,0.00009926116,0.00005945347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874794,0.000025512842,0.0005050216,0.000120070355,0.0004308499,0.00017061183],"domain_scores_gemma":[0.99858147,0.00044740425,0.0001128887,0.00008147613,0.00061706896,0.00015966335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030656712,0.00016278676,0.00023325536,0.0004894099,0.000090654146,0.00007695211,0.00038197348,0.00004898398,0.0000649034],"category_scores_gemma":[0.0007492359,0.00018268461,0.0001418002,0.00030687853,0.000009189593,0.000100719255,0.00006720048,0.000419433,0.000005531977],"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.00009597362,0.000045938617,0.00003629418,0.0000057950283,0.0002563283,0.00002306324,0.00023011751,0.99048656,0.0002105518,0.00011440443,0.0009351807,0.007559772],"study_design_scores_gemma":[0.0024044015,0.00011972519,0.00006611688,0.000050003306,0.000039290888,0.00009984935,0.00006764001,0.9906872,0.00025832033,0.00005463487,0.0059660953,0.00018671206],"about_ca_topic_score_codex":0.000006200097,"about_ca_topic_score_gemma":3.2406558e-7,"teacher_disagreement_score":0.655718,"about_ca_system_score_codex":0.00030881495,"about_ca_system_score_gemma":0.00008453109,"threshold_uncertainty_score":0.74496627},"labels":[],"label_agreement":null},{"id":"W4293252962","doi":"10.5267/j.ijiec.2022.8.003","title":"Bi-objective optimization of identical parallel machine scheduling with flexible maintenance and job release times","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Tardiness; Crossover; Mathematical optimization; Job shop scheduling; Computer science; Scheduling (production processes); Taguchi methods; Minification; Algorithm; Mathematics; Artificial intelligence; Schedule; Machine learning","score_opus":0.01299240473623745,"score_gpt":0.23498771834511153,"score_spread":0.2219953136088741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293252962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038446896,0.00021936787,0.95973575,0.0002781968,0.0010183795,0.000090326896,0.000032994583,0.00007212622,0.00010594488],"genre_scores_gemma":[0.79194325,0.000038367572,0.20771639,0.000014764386,0.00020767366,0.000006248302,0.000019824753,0.000027487167,0.00002600777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988393,0.000027842158,0.00049624586,0.000096059164,0.00042359674,0.00011694833],"domain_scores_gemma":[0.9991595,0.00015112967,0.00018493048,0.00005967254,0.0003646544,0.0000800754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023985958,0.00012430894,0.00019810257,0.0004248195,0.00006305798,0.000050930215,0.00019922596,0.000044005763,0.0000657936],"category_scores_gemma":[0.00019005421,0.00012399368,0.000056760226,0.00031730052,0.00002998192,0.00020052356,0.000049436552,0.00041676234,5.687111e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007916925,0.000032439228,0.0003777614,0.0000057005423,0.00021339835,0.000019197178,0.00015937582,0.99734914,0.00004783433,0.00086603814,0.00005386872,0.0007960656],"study_design_scores_gemma":[0.0015785317,0.00011604898,0.00016385688,0.00009364627,0.000036155987,0.000234688,0.00017232925,0.99718475,0.00015449892,0.00006883999,0.00007494789,0.00012168657],"about_ca_topic_score_codex":0.000009942271,"about_ca_topic_score_gemma":3.4664401e-7,"teacher_disagreement_score":0.75349635,"about_ca_system_score_codex":0.00013010947,"about_ca_system_score_gemma":0.00008491996,"threshold_uncertainty_score":0.50563157},"labels":[],"label_agreement":null},{"id":"W4299533920","doi":"","title":"Étude comparative d'approches pareto pour un problème d'ordonnancement multiobjective avec réglages et retard","year":2013,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Pareto principle; Pareto optimal; Pareto analysis; Multi-objective optimization; Mathematical optimization; Mathematics","score_opus":0.0203847809551211,"score_gpt":0.2368058515058464,"score_spread":0.2164210705507253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299533920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11477301,0.0030586142,0.8378931,0.015689265,0.0007274868,0.0018354213,0.00016958528,0.00079846027,0.025055008],"genre_scores_gemma":[0.46960226,0.001654106,0.5209063,0.00010772413,0.00006143648,0.00048803628,0.0007519586,0.00010996872,0.0063181766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99039,0.0055154637,0.001172346,0.0013889122,0.0007239278,0.00080937316],"domain_scores_gemma":[0.99121386,0.0016862757,0.0007954569,0.0020798526,0.0038132789,0.00041127257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004212135,0.000965998,0.0010045902,0.00027753616,0.00052788964,0.0007635871,0.0014050921,0.00062679034,0.0007097522],"category_scores_gemma":[0.0010188887,0.0010787116,0.0003888801,0.00064895145,0.0004186838,0.00039299982,0.0010343769,0.0014933253,0.00050943514],"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.00006297843,0.0030637574,0.0049283453,0.0011398852,0.0019736981,0.000022989556,0.2948548,0.35528603,0.0045970953,0.2805152,0.0019600722,0.051595174],"study_design_scores_gemma":[0.0017415781,0.0000023151376,0.022138996,0.004174634,0.0002052689,0.000021091872,0.002251829,0.87777513,0.08125272,0.0049403803,0.0038846766,0.0016114037],"about_ca_topic_score_codex":0.0015899445,"about_ca_topic_score_gemma":0.0013700105,"teacher_disagreement_score":0.5224891,"about_ca_system_score_codex":0.0005563909,"about_ca_system_score_gemma":0.0003930611,"threshold_uncertainty_score":0.9991663},"labels":[],"label_agreement":null},{"id":"W4300045471","doi":"","title":"Optimisation par colonies de fourmis parallèles sur architecture à mémoire partagée","year":2003,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.012277781687057319,"score_gpt":0.2100777566131425,"score_spread":0.1977999749260852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300045471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111288846,0.005047143,0.82896316,0.02697408,0.0009747068,0.00076368987,0.00013797368,0.0008016272,0.02504879],"genre_scores_gemma":[0.18922192,0.0029348559,0.7847609,0.00019367464,0.000095221294,0.00013927328,0.00080410123,0.00016948544,0.0216806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99154675,0.005220589,0.00089388364,0.00095917325,0.00053423626,0.00084539206],"domain_scores_gemma":[0.99356836,0.0018257976,0.0005006866,0.0018990966,0.0017566725,0.00044938264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004514695,0.00073453557,0.00067162374,0.00024126387,0.0006169619,0.0006607098,0.0010904004,0.0008161501,0.00060353335],"category_scores_gemma":[0.0023017128,0.0008778385,0.0003820884,0.0005696995,0.00036961405,0.00019337368,0.00039151855,0.0013129557,0.00014655806],"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.000023758123,0.00060994376,0.003636781,0.00060349546,0.00039342282,0.000025746152,0.020278929,0.8680242,0.0015021964,0.059825264,0.0022862304,0.042790055],"study_design_scores_gemma":[0.0017152154,0.0000018300169,0.006070328,0.0040747193,0.0003213677,0.00013775748,0.0004423745,0.81825864,0.09106252,0.0074296813,0.068492234,0.0019933335],"about_ca_topic_score_codex":0.0010939497,"about_ca_topic_score_gemma":0.0010455393,"teacher_disagreement_score":0.08956032,"about_ca_system_score_codex":0.0005241393,"about_ca_system_score_gemma":0.00057702983,"threshold_uncertainty_score":0.99936724},"labels":[],"label_agreement":null},{"id":"W4302378732","doi":"10.1007/978-0-387-09421-2","title":"Level Crossing Methods in Stochastic Models","year":2008,"lang":"en","type":"book","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":69,"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 Windsor","funders":"","keywords":"Markov chain; Queue; Computer science; Queueing theory; Service (business); Operations research; Real-time computing; Mathematics; Computer network; Business; Machine learning; Marketing","score_opus":0.13993411426660607,"score_gpt":0.45607593819469805,"score_spread":0.316141823928092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302378732","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024617822,0.00041268708,0.15216005,0.005073976,0.0060631703,0.0050297044,0.0002489824,0.00037767633,0.82817197],"genre_scores_gemma":[0.0681185,0.007954803,0.4023429,0.00014617149,0.00050733786,0.003043189,0.00057445845,0.00020803628,0.5171046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98401374,0.0004945928,0.0019413866,0.002375837,0.008929238,0.0022452136],"domain_scores_gemma":[0.99513924,0.0003107927,0.00007106743,0.0014480843,0.002641155,0.0003896364],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.017463064,0.00072727905,0.00059975276,0.018731734,0.0030793636,0.005933336,0.0077052587,0.00028157223,0.0006500212],"category_scores_gemma":[0.0013145452,0.00081142096,0.00013388,0.009909658,0.0092973085,0.009458433,0.0037476623,0.0025440461,0.00022287446],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005386911,0.00018572336,0.000025431109,0.00005522274,0.000057914556,0.00017831096,0.0013882509,0.7572653,0.00013760301,0.23611982,0.0008427243,0.0036897736],"study_design_scores_gemma":[0.0009784448,0.00006805669,0.0009118412,0.00081624556,0.000007073925,0.000041087234,0.0032398063,0.9681929,0.00016965943,0.010951821,0.013809408,0.00081367715],"about_ca_topic_score_codex":0.00058804976,"about_ca_topic_score_gemma":0.0046515884,"teacher_disagreement_score":0.31106737,"about_ca_system_score_codex":0.010140563,"about_ca_system_score_gemma":0.0016719576,"threshold_uncertainty_score":0.9997571},"labels":[],"label_agreement":null},{"id":"W4307865591","doi":"10.5267/j.jpm.2022.8.002","title":"An ordered precedence constrained flow shop scheduling problem with machine specific preventive maintenance","year":2022,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Preventive maintenance; Tardiness; Flow shop scheduling; Interrupt; Computer science; Scheduling (production processes); Job shop scheduling; Schedule; Operations research; Reliability engineering; Mathematical optimization; Engineering; Mathematics","score_opus":0.010330230904789586,"score_gpt":0.23118104262982594,"score_spread":0.22085081172503634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307865591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015111165,0.0007462034,0.9759868,0.00018742005,0.00061964674,0.0009873225,0.000024731798,0.00020334609,0.0061333617],"genre_scores_gemma":[0.2932732,0.00023492551,0.7058266,0.000033471097,0.00008897012,0.00005187463,0.000011629072,0.00004194141,0.00043744032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985655,0.00009397001,0.00043112846,0.0001821144,0.0004701452,0.00025713578],"domain_scores_gemma":[0.9993819,0.000019957797,0.00020593744,0.00019676534,0.00012483062,0.000070614944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006854465,0.00017957808,0.00022774201,0.00030362693,0.00015344154,0.000087345135,0.00034452198,0.000021645108,0.00018696343],"category_scores_gemma":[0.0000067382175,0.00015246708,0.00006518681,0.00052886875,0.00003208638,0.000248167,0.00006080468,0.00038014364,0.0000025253073],"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.00012512643,0.00013226904,0.00009277874,0.00008755865,0.00021313723,0.00013486216,0.00069297303,0.9837026,0.00008320186,0.00027659157,0.00041448444,0.0140444385],"study_design_scores_gemma":[0.002107736,0.00071846903,0.00010951415,0.00018861907,0.00008290178,0.00027060552,0.004695464,0.98679745,0.00018448927,0.00014231565,0.0043749968,0.0003274641],"about_ca_topic_score_codex":0.0000022012398,"about_ca_topic_score_gemma":0.000002915061,"teacher_disagreement_score":0.27816203,"about_ca_system_score_codex":0.0001860533,"about_ca_system_score_gemma":0.000049919978,"threshold_uncertainty_score":0.62174267},"labels":[],"label_agreement":null},{"id":"W4309073957","doi":"10.1080/00207543.2022.2139002","title":"Dynamic allocation of human resources: case study in the metal 4.0 manufacturing industry","year":2022,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"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é Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flexibility (engineering); Machining; Computer science; Production (economics); Task (project management); Constraint (computer-aided design); Mathematical optimization; Industrial engineering; Operator (biology); Dynamic programming; Engineering; Algorithm; Mechanical engineering; Systems engineering; Mathematics","score_opus":0.0711418770861863,"score_gpt":0.38977699584103065,"score_spread":0.31863511875484435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309073957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9979407,0.00008500366,0.00017005362,0.00079565216,0.0007194944,0.00016024288,0.0000021615435,0.000010153876,0.00011650587],"genre_scores_gemma":[0.99917465,0.000010074464,0.0004740323,0.000006645598,0.00019290575,0.000018320696,0.0000026607863,0.000010850539,0.000109847606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.9978006,0.0003781742,0.00041019978,0.00009670955,0.0012102183,0.00010413378],"domain_scores_gemma":[0.9992724,0.00007508733,0.000105779305,0.0001338926,0.00038963676,0.000023199287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003702286,0.00005637969,0.0000905617,0.0007598717,0.00013373,0.000041881667,0.0004438892,0.000030026082,0.00010871854],"category_scores_gemma":[0.00013973104,0.000047521502,0.00003839862,0.00034590397,0.000037409343,0.00014526189,0.000067529865,0.0012033617,9.1993235e-7],"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.000042331907,0.00044781904,0.0018250596,0.000011062172,0.00014971834,0.0008301427,0.0109172985,0.97943455,0.0017977944,0.000029126857,0.0001922975,0.004322816],"study_design_scores_gemma":[0.005228818,0.0023521204,0.033858545,0.00018412153,0.00010568477,0.035094693,0.7352726,0.15552008,0.027499935,0.0012909939,0.0029463023,0.00064614584],"about_ca_topic_score_codex":0.000104149934,"about_ca_topic_score_gemma":0.000044276727,"teacher_disagreement_score":0.82391447,"about_ca_system_score_codex":0.00023224133,"about_ca_system_score_gemma":0.00003601278,"threshold_uncertainty_score":0.5228075},"labels":[],"label_agreement":null},{"id":"W4309084408","doi":"10.5267/j.dsl.2022.10.007","title":"Two-objective optimization of preventive maintenance orders scheduling as a multi-skilled resource-constrained flow shop problem","year":2022,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Preventive maintenance; Scheduling (production processes); Computer science; Operations research; Mathematical optimization; Human resources; Heuristic; Set (abstract data type); Flow shop scheduling; Order (exchange); Job shop scheduling; Genetic algorithm; Industrial engineering; Engineering; Schedule; Mathematics; Reliability engineering; Artificial intelligence","score_opus":0.009801969945461151,"score_gpt":0.2529968650283486,"score_spread":0.24319489508288747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309084408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11203246,0.000032963428,0.885987,0.00037024476,0.0004026335,0.0004158892,0.000014868935,0.0001869746,0.0005570047],"genre_scores_gemma":[0.32763013,0.000005127807,0.6718377,0.0003829977,0.000020346642,0.000055930308,0.000009535675,0.00002613415,0.000032140822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975444,0.00008161469,0.00048363922,0.0005106329,0.0009504337,0.00042925883],"domain_scores_gemma":[0.9989717,0.00023185519,0.00015140287,0.00033664177,0.00018337116,0.00012501008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001369708,0.00020286992,0.0002524816,0.000603872,0.00046402626,0.00009049981,0.00060987705,0.000037194495,0.00021024514],"category_scores_gemma":[0.0006029576,0.00020553028,0.000099536875,0.0024187597,0.0003518665,0.0003608871,0.00018079404,0.0003154627,0.000010719474],"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.000038171365,0.000034769215,0.00007028011,0.0000052974187,0.000015047726,0.000007241771,0.0014830292,0.98866594,0.0039638216,0.000064354004,0.00008653854,0.005565533],"study_design_scores_gemma":[0.0013400239,0.00004285951,0.000048872058,0.00005959596,0.000010851527,0.000021900201,0.0024561756,0.9940182,0.0016343142,0.00005958076,0.00007188073,0.00023576745],"about_ca_topic_score_codex":0.0000116323035,"about_ca_topic_score_gemma":0.000001569925,"teacher_disagreement_score":0.21559767,"about_ca_system_score_codex":0.00026310858,"about_ca_system_score_gemma":0.00011421546,"threshold_uncertainty_score":0.83812815},"labels":[],"label_agreement":null},{"id":"W4309716977","doi":"10.5267/j.ijiec.2022.9.003","title":"A matheuristic based solution approach for the general lot sizing and scheduling problem with sequence dependent changeovers and back ordering","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Sizing; Simulated annealing; Scheduling (production processes); Integer programming; Sequence (biology); Variable neighborhood search; Computer science; Mathematics; Metaheuristic","score_opus":0.040796967387068325,"score_gpt":0.2478680294642839,"score_spread":0.2070710620772156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309716977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032614015,0.0002530632,0.9659929,0.0003272861,0.0005502855,0.00018563638,0.00002446418,0.00003962946,0.000012692758],"genre_scores_gemma":[0.6537202,0.000017105423,0.34587187,0.000024630595,0.00029573013,0.000027315687,0.000014860566,0.000022408598,0.000005857564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925005,0.000015448071,0.00025122555,0.00009472667,0.00026827076,0.000120292665],"domain_scores_gemma":[0.99943465,0.00021687274,0.00010317397,0.000042971777,0.00015036545,0.000051951283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029776184,0.000107611784,0.00011336934,0.00018274195,0.00014349227,0.00011236312,0.00014968352,0.000031003776,0.0000070858564],"category_scores_gemma":[0.00006407436,0.00009349937,0.000031225554,0.00013786767,0.000019988473,0.000116792,0.00003660429,0.00029151974,1.3086527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029857605,0.000012920007,0.00006066925,0.000012753338,0.00011535831,0.0000034998588,0.00018872572,0.99610144,0.00020917752,0.00016329224,0.000011457105,0.0030908624],"study_design_scores_gemma":[0.0012118166,0.00007074007,0.00002617959,0.000046862475,0.000036021578,0.00019088383,0.00020303584,0.99785703,0.00006964563,0.000013646689,0.0001695124,0.000104635335],"about_ca_topic_score_codex":0.000009128302,"about_ca_topic_score_gemma":5.409061e-7,"teacher_disagreement_score":0.6211062,"about_ca_system_score_codex":0.00012965458,"about_ca_system_score_gemma":0.0000604961,"threshold_uncertainty_score":0.38127938},"labels":[],"label_agreement":null},{"id":"W4309717115","doi":"10.5267/j.ijiec.2022.10.004","title":"Unrelated parallel machine scheduling with machine processing cost","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Computer science; Single-machine scheduling; Scheduling (production processes); Multi-objective optimization; Pareto principle; Schedule; Mathematics","score_opus":0.019536357505162943,"score_gpt":0.24572606074858788,"score_spread":0.22618970324342494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309717115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021427827,0.0006054659,0.974185,0.0005726168,0.0026132623,0.00014766068,0.000051354462,0.00023366149,0.00016318],"genre_scores_gemma":[0.9085714,0.000016622955,0.09075021,0.000038467366,0.00045514436,0.000013814915,0.000077130215,0.00005147387,0.000025742154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985827,0.000027668302,0.0005253676,0.000105235486,0.0005893755,0.00016963504],"domain_scores_gemma":[0.99920595,0.000102989834,0.00018950566,0.00006931818,0.00032465742,0.00010756173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027428273,0.00016821898,0.00020113737,0.0004970885,0.0001276368,0.000110427216,0.00037036053,0.00005453652,0.00010587423],"category_scores_gemma":[0.00008773439,0.00016642151,0.000074606665,0.00046537508,0.000016464404,0.00022805583,0.0000488442,0.00086051354,0.000002711371],"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.000053277618,0.000044634802,0.00024179257,0.0000038525463,0.00021317338,0.000066859684,0.00017287867,0.9907123,0.000050408675,0.000120344805,0.000072531606,0.008247953],"study_design_scores_gemma":[0.002052615,0.00007991051,0.000053410557,0.00008402621,0.000034961253,0.0005029666,0.000102432714,0.99511456,0.000065608496,0.000023501843,0.0017057558,0.00018022221],"about_ca_topic_score_codex":0.000007642364,"about_ca_topic_score_gemma":8.938614e-7,"teacher_disagreement_score":0.88714355,"about_ca_system_score_codex":0.00026964725,"about_ca_system_score_gemma":0.0001284796,"threshold_uncertainty_score":0.6786472},"labels":[],"label_agreement":null},{"id":"W4310898117","doi":"10.18280/jesa.550512","title":"Reference Architecture for CIM the Bi-Level Architecture for Efficient Manufacturing BLAEM","year":2022,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Architecture; Computer-integrated manufacturing; Manufacturing engineering; Computer science; Cover (algebra); Layer (electronics); Engineering; Mechanical engineering","score_opus":0.027117557381436494,"score_gpt":0.24595445187496706,"score_spread":0.21883689449353055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310898117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09745219,0.0010844402,0.89736474,0.00060008507,0.001345055,0.00085993705,0.00029193022,0.00054579356,0.0004558303],"genre_scores_gemma":[0.6895135,0.00005911758,0.3075384,0.00034436083,0.00078776863,0.00041459705,0.000053288255,0.00023080541,0.0010581564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811685,0.0001454687,0.00051574886,0.00024771533,0.00043990518,0.0005343062],"domain_scores_gemma":[0.9988269,0.0004254293,0.00019340373,0.00030849877,0.000100279234,0.00014544027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007017686,0.0003015176,0.00030439586,0.00023068037,0.0012994664,0.0002570178,0.0006070924,0.00006503052,0.000106515574],"category_scores_gemma":[0.00014522734,0.00021957843,0.00023308018,0.00023204376,0.000057681646,0.000049143986,0.000104116516,0.0007541503,0.000007511174],"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.000024498224,0.000018773373,0.0000039903416,0.000120045544,0.00008555891,0.0000075315343,0.0011249627,0.8224306,0.00021301825,0.00013750423,0.0012329601,0.17460053],"study_design_scores_gemma":[0.0011883538,0.00023845956,0.004094893,0.00012855635,0.00009640594,0.0013276374,0.00055889454,0.95830363,0.0018737344,0.0031411427,0.028556732,0.0004915773],"about_ca_topic_score_codex":0.000003546998,"about_ca_topic_score_gemma":0.0000059820395,"teacher_disagreement_score":0.59206134,"about_ca_system_score_codex":0.0002190168,"about_ca_system_score_gemma":0.00006369878,"threshold_uncertainty_score":0.99945754},"labels":[],"label_agreement":null},{"id":"W4312368300","doi":"10.26034/lu.akwi.2020.3271","title":"Optimization of Work-Center Cycle Time Target Setting in a Semiconductor Wafer Fab","year":2020,"lang":"en","type":"article","venue":"Anwendungen und Konzepte der Wirtschaftsinformatik","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Infineon Technologies","keywords":"Normalization (sociology); Wafer; Square root; Position (finance); Center (category theory); Computer science; Square (algebra); Semiconductor; Real-time computing; Engineering; Mathematics; Electrical engineering; Chemistry; Crystallography; Geometry","score_opus":0.008516130574321566,"score_gpt":0.20565828404664374,"score_spread":0.19714215347232217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312368300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31111246,0.0060244044,0.56984645,0.0033367705,0.0024212142,0.0029012775,0.00042443126,0.0037301376,0.100202866],"genre_scores_gemma":[0.74008346,0.0001348396,0.25740278,0.0013735552,0.0002291884,0.000030000516,0.00048319905,0.0001312991,0.00013168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983632,0.000033188036,0.000741774,0.00019780331,0.00026957868,0.0003944329],"domain_scores_gemma":[0.99930817,0.0000597526,0.00013621754,0.00023379299,0.00008780774,0.00017425376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017084807,0.00028343356,0.00035781314,0.00018932087,0.00005275335,0.000067033565,0.00025033404,0.00017197884,0.00060531206],"category_scores_gemma":[0.00007411298,0.0002981736,0.00009478161,0.00067485526,0.000039579572,0.00079233514,0.000067924426,0.00028649435,0.0002076841],"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.000021043865,0.000024873249,0.0009426203,0.00010178883,0.00009086775,0.000003600592,0.004267497,0.99138814,0.00017633544,0.000020149395,0.0013873561,0.0015757038],"study_design_scores_gemma":[0.0009382527,0.00002646552,0.00011178121,0.00008868395,0.000029390962,0.0000037690036,0.00028413392,0.994164,0.0021959436,0.000011052096,0.0018015152,0.0003450507],"about_ca_topic_score_codex":0.0000046769887,"about_ca_topic_score_gemma":8.232051e-7,"teacher_disagreement_score":0.428971,"about_ca_system_score_codex":0.00005526505,"about_ca_system_score_gemma":0.000035535762,"threshold_uncertainty_score":0.999947},"labels":[],"label_agreement":null},{"id":"W4312371765","doi":"10.1016/j.ifacol.2022.10.100","title":"A Didactic Review On Genetic Algorithms For Industrial Planning And Scheduling Problems*","year":2022,"lang":"en","type":"review","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Variety (cybernetics); Adaptation (eye); Genetic algorithm; Heuristic; Distributed computing; Mathematical optimization; Artificial intelligence; Machine learning; Algorithm; Mathematics","score_opus":0.12789116227896427,"score_gpt":0.335204367061299,"score_spread":0.20731320478233475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312371765","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027218864,0.990596,0.005377876,0.00006748087,0.0010531446,0.0021146075,0.00024514343,0.00040208347,0.00014093643],"genre_scores_gemma":[5.974373e-8,0.68202835,0.315695,0.00012180919,0.00071872026,0.0006187842,0.00053988205,0.00017009249,0.000107307475],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99745595,0.00011175636,0.0009006484,0.0006609179,0.00035596546,0.0005147283],"domain_scores_gemma":[0.99849844,0.00058171264,0.00027245944,0.00040456178,0.000039254388,0.000203559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046935363,0.0007327881,0.0017736818,0.00027982495,0.00022791293,0.00009383313,0.00032571677,0.00039777096,0.00021526482],"category_scores_gemma":[0.00039819579,0.0006704489,0.00039346176,0.00054856035,0.000035029363,0.00007426423,0.00007672499,0.0011432923,0.000019506344],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037233199,0.000030330066,6.0384576e-7,0.029696565,0.00022106136,0.000014954856,0.000062240666,0.024311911,1.280659e-7,0.0000045309516,0.000020857955,0.9456331],"study_design_scores_gemma":[0.0007298542,0.0001805035,2.0762772e-7,0.046082623,0.0011873606,0.00010766516,0.000039013892,0.097679995,3.3514064e-7,0.000004726024,0.853105,0.0008826983],"about_ca_topic_score_codex":0.0000028593058,"about_ca_topic_score_gemma":5.158536e-7,"teacher_disagreement_score":0.94475037,"about_ca_system_score_codex":0.00020352638,"about_ca_system_score_gemma":0.00015374437,"threshold_uncertainty_score":0.99957466},"labels":[],"label_agreement":null},{"id":"W4312406784","doi":"10.1016/j.ifacol.2022.09.619","title":"Tacit knowledge in production sequencing: a Seq2Seq-LSTM approach","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Profitability index; Computer science; Scheduling (production processes); Tacit knowledge; Architecture; Production (economics); Context (archaeology); Unexpected events; Artificial intelligence; Recurrent neural network; Industrial engineering; Machine learning; Knowledge management; Artificial neural network; Operations management; Engineering; Business; Reliability engineering","score_opus":0.02185117253767119,"score_gpt":0.2270302300088882,"score_spread":0.205179057471217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312406784","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93267214,0.0038415059,0.027849805,0.0010169387,0.004223605,0.0010936543,0.00010342028,0.0024273316,0.02677157],"genre_scores_gemma":[0.31713337,0.000063095424,0.67799556,0.00010987922,0.0006098557,0.00022098876,0.0002671786,0.00010057821,0.003499534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883884,0.000060970106,0.0002613196,0.00032731346,0.00021112854,0.00030040767],"domain_scores_gemma":[0.99958485,0.0000208304,0.00003258989,0.00024614285,0.00004222264,0.00007333806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031829652,0.00018735396,0.00020035479,0.00023072878,0.00013987072,0.000028745062,0.00018051645,0.00006303488,0.00019143816],"category_scores_gemma":[0.000051073122,0.00020826122,0.00005806956,0.0008313597,0.00002444072,0.0001323076,0.00005702315,0.0004530716,0.000034228106],"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.000009982693,0.00010617032,0.00016852426,0.00005519879,0.00002113231,0.000008662744,0.0027614974,0.99113876,0.0020928339,0.0000633665,0.00003183432,0.003542019],"study_design_scores_gemma":[0.00045764056,0.000034274548,0.00013654178,0.000012933757,0.000011992046,0.000059175447,0.0029466008,0.99386454,0.00068877894,0.000018169749,0.0014794791,0.00028989554],"about_ca_topic_score_codex":0.000019504407,"about_ca_topic_score_gemma":0.000018623668,"teacher_disagreement_score":0.6501457,"about_ca_system_score_codex":0.00044149818,"about_ca_system_score_gemma":0.0000670608,"threshold_uncertainty_score":0.8492646},"labels":[],"label_agreement":null},{"id":"W4312468391","doi":"10.1016/j.ifacol.2022.09.557","title":"Robust Job Shop Scheduling with Condition-Based Maintenance and Random Breakdowns","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Unavailability; Job shop scheduling; Computer science; Mathematical optimization; Schedule; Simulated annealing; Job shop; Robustness (evolution); Scheduling (production processes); Minification; Reliability engineering; Flow shop scheduling; Mathematics; Engineering","score_opus":0.009729867517413317,"score_gpt":0.19773956486986127,"score_spread":0.18800969735244796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312468391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48812065,0.0013787549,0.50271595,0.0024643957,0.00073544646,0.0006032876,0.00040470003,0.0013654005,0.002211418],"genre_scores_gemma":[0.2906231,0.00004115192,0.707906,0.0005159244,0.00013745378,0.000082492974,0.00022379497,0.00006856205,0.00040149933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989215,0.000037185822,0.00020851033,0.00027530923,0.00025844388,0.00029903106],"domain_scores_gemma":[0.9994581,0.00012074173,0.000043952805,0.00019395076,0.000060470913,0.0001228187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018914668,0.00021449901,0.00024141872,0.00011361554,0.0002946424,0.00005531256,0.0001296395,0.000050004666,0.00052674976],"category_scores_gemma":[0.000038445065,0.00019885406,0.000049978607,0.00031799258,0.00006788293,0.00009323743,0.000028078583,0.00033672663,0.000010082559],"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.00008058287,0.000027075837,0.0006478812,0.000029515744,0.000043098866,0.000026873091,0.00016772945,0.9977285,0.00029480454,0.000058537098,0.000010761487,0.0008846316],"study_design_scores_gemma":[0.0037702257,0.000066373126,0.0002821399,0.000040582687,0.000036942718,0.000056372734,0.00079232565,0.9942038,0.00019129286,0.000007301251,0.00024682653,0.00030583917],"about_ca_topic_score_codex":0.000016412412,"about_ca_topic_score_gemma":0.000030184377,"teacher_disagreement_score":0.20519009,"about_ca_system_score_codex":0.0000806633,"about_ca_system_score_gemma":0.000050114166,"threshold_uncertainty_score":0.8109033},"labels":[],"label_agreement":null},{"id":"W4312694068","doi":"10.1016/j.ifacol.2022.10.099","title":"A Two-Level Optimization Approach For Engineer-To-Order Project Scheduling*","year":2022,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Outsourcing; Robustness (evolution); Job shop scheduling; Computer science; Scheduling (production processes); Mathematical optimization; Iterated function; Industrial engineering; Operations research; Engineering; Mathematics; Schedule","score_opus":0.027764558834408308,"score_gpt":0.2589683455112406,"score_spread":0.23120378667683228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312694068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00205716,0.00022218916,0.99388415,0.0002948702,0.00054571324,0.0009306252,0.00033517668,0.00078577764,0.00094432064],"genre_scores_gemma":[0.0009743737,0.000015996944,0.99571776,0.0003654942,0.00037936226,0.000766233,0.0009781312,0.00013246926,0.00067018304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849254,0.000032574466,0.00032517553,0.00039847652,0.00031973846,0.0004314803],"domain_scores_gemma":[0.9993294,0.00006710176,0.000044480825,0.0002913786,0.00014000702,0.00012767252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029316905,0.00028366447,0.00027349484,0.0002937176,0.00026501305,0.000060774888,0.0002869393,0.000074521246,0.00015697643],"category_scores_gemma":[0.0001447789,0.00031172996,0.00010659447,0.0009767803,0.000016032642,0.000103282044,0.000073329786,0.00029556538,0.0000069728194],"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.000030433628,0.00009074739,0.000011874132,0.000047333724,0.00005789025,0.0000013805077,0.000560653,0.9968207,0.00029936407,0.00010675575,0.00000400838,0.0019688853],"study_design_scores_gemma":[0.0012442815,0.00009557671,0.0000046246487,0.000007505002,0.000035584966,0.0000149608895,0.00085652585,0.9970163,0.00016441145,0.0000033925205,0.00015637951,0.00040045832],"about_ca_topic_score_codex":0.000012780989,"about_ca_topic_score_gemma":0.0000018854907,"teacher_disagreement_score":0.0018335892,"about_ca_system_score_codex":0.00015004579,"about_ca_system_score_gemma":0.000080837926,"threshold_uncertainty_score":0.9999335},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W4312905895","doi":"10.1016/j.ifacol.2022.09.386","title":"The Role of Environmental Factors in the Flexible Job-Shop Scheduling Problem: A Literature Review","year":2022,"lang":"en","type":"review","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"","keywords":"Job shop scheduling; Intersection (aeronautics); Computer science; Energy consumption; Scheduling (production processes); Operations research; Management science; Industrial engineering; Engineering; Operations management; Transport engineering","score_opus":0.017534537024123612,"score_gpt":0.25956091168166007,"score_spread":0.24202637465753646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312905895","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011492809,0.9975201,0.000035711877,0.00007004295,0.0002234021,0.0009903741,0.00027569107,0.00010318071,0.0007700107],"genre_scores_gemma":[0.0000024301369,0.95922637,0.039201684,0.00006686373,0.00014008228,0.00021439137,0.00086319936,0.00009432997,0.0001906648],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977236,0.00025402452,0.00083890033,0.00033702748,0.00047139853,0.00037509928],"domain_scores_gemma":[0.99867266,0.00042955845,0.0002275284,0.0005960691,0.000012178229,0.00006198669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067801157,0.0005216534,0.0010419992,0.00013742964,0.0001928981,0.000081963655,0.0008457345,0.0002188559,0.00025180337],"category_scores_gemma":[0.00008400128,0.00029840952,0.00048532462,0.0008928247,0.00005881176,0.00008826365,0.000099346544,0.001298942,0.000013575429],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000267356,0.000082464925,0.000013160011,0.01801067,0.00020136943,0.000014701659,0.0010955224,0.0050128964,0.000004284199,0.00008257258,0.0000088323095,0.97547084],"study_design_scores_gemma":[0.00014004392,0.00003275492,0.000002063343,0.02086628,0.0003370537,0.00005236008,0.00079244253,0.005777236,0.0000026897737,0.000014429262,0.9715438,0.00043887008],"about_ca_topic_score_codex":0.0000033114986,"about_ca_topic_score_gemma":0.00000449636,"teacher_disagreement_score":0.975032,"about_ca_system_score_codex":0.00015246453,"about_ca_system_score_gemma":0.000067076755,"threshold_uncertainty_score":0.9999468},"labels":[],"label_agreement":null},{"id":"W4313136697","doi":"10.23952/jnva.6.2022.6.09","title":"A first bibliography on set and vector optimization problems with respect to variable domination structures","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Bibliography; Set (abstract data type); Variable (mathematics); Vector (molecular biology); Mathematics; Computer science; Library science; Biology; Mathematical analysis; Genetics; Programming language; Recombinant DNA","score_opus":0.008191843562548252,"score_gpt":0.21900567102327542,"score_spread":0.21081382746072716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313136697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039465293,0.0002109397,0.9590142,0.0008016975,0.00012271093,0.00012024029,0.00011791445,0.00003169062,0.00011534408],"genre_scores_gemma":[0.38497356,0.0002407952,0.614288,0.00014812352,0.00020216934,0.0000108926915,0.000091647205,0.000020285333,0.00002457198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918294,0.000037297657,0.00024760576,0.00010928957,0.00034184536,0.000081031074],"domain_scores_gemma":[0.99946606,0.00009805378,0.000115920826,0.000061021838,0.00017952084,0.000079410296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032206404,0.000093993454,0.0001855803,0.0030839744,0.0001845997,0.0000847536,0.000060904393,0.000025950996,0.00016567737],"category_scores_gemma":[0.00002983928,0.00007703016,0.00005371765,0.0048908475,0.000009070964,0.000115839546,0.000016540289,0.0001384072,2.0522354e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007131047,0.000025011866,0.0013927456,0.000009726583,0.0005425864,0.0000017205731,0.00020326252,0.99723166,0.000013441743,0.0003183405,0.0001261271,0.00006404143],"study_design_scores_gemma":[0.00048298453,0.00023115869,0.0092803715,0.0000089925625,0.0003551853,0.000022788103,0.000073637864,0.9888516,0.000009429367,0.00015070019,0.0004323939,0.00010073821],"about_ca_topic_score_codex":0.000012220748,"about_ca_topic_score_gemma":0.0000064313467,"teacher_disagreement_score":0.34550825,"about_ca_system_score_codex":0.0000281422,"about_ca_system_score_gemma":0.00002053938,"threshold_uncertainty_score":0.3141199},"labels":[],"label_agreement":null},{"id":"W4313420447","doi":"10.1016/j.cor.2022.106134","title":"Dynamic shop-floor scheduling using real-time information: A case study from the thermoplastic industry","year":2022,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Tardiness; Computer science; Scheduling (production processes); Batch production; Mathematical optimization; Production planning; Dynamic priority scheduling; Job shop scheduling; Real-time computing; Distributed computing; Production (economics); Schedule; Operations management; Engineering; Mathematics","score_opus":0.04411955783424278,"score_gpt":0.3278602881560679,"score_spread":0.2837407303218251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313420447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8943536,0.00006687621,0.10404884,0.00017555215,0.0004222873,0.00057346333,0.000046182737,0.00021342996,0.000099717996],"genre_scores_gemma":[0.94640785,0.000007297915,0.053112045,0.000048049504,0.00011389676,0.00013610469,0.00009112488,0.000030830844,0.000052767507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981745,0.00040816117,0.00033249322,0.00019286224,0.00057568576,0.00031628332],"domain_scores_gemma":[0.9988985,0.00033256976,0.00001566751,0.0004433482,0.00022042141,0.00008947759],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008654342,0.00014354641,0.0001397377,0.00025882787,0.0019672294,0.00054332375,0.0004265502,0.00007318977,0.00040250525],"category_scores_gemma":[0.000081701786,0.00012932264,0.00003769281,0.0010904653,0.00006035367,0.0003872676,0.00034097568,0.0012378424,0.000086664004],"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.000004588978,0.00005195017,0.00010383308,0.0000031514337,0.00005731779,0.00010988476,0.0052488297,0.99210274,0.00012684257,0.000011887656,0.00011066656,0.0020683126],"study_design_scores_gemma":[0.00042138845,0.000056044635,0.00012347492,0.000011880078,0.000013760157,0.00021598661,0.018924514,0.9800354,0.000009632553,0.0000040465393,0.00004356949,0.0001402748],"about_ca_topic_score_codex":0.0008869244,"about_ca_topic_score_gemma":0.000066257846,"teacher_disagreement_score":0.052054234,"about_ca_system_score_codex":0.00031834404,"about_ca_system_score_gemma":0.00019589037,"threshold_uncertainty_score":0.9993321},"labels":[],"label_agreement":null},{"id":"W4313422163","doi":"10.24867/ijiem-2022-4-316","title":"Optimized Buffer Allocation and Repair Strategies for Series Production Lines","year":2022,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering and Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Moncton","funders":"","keywords":"Throughput; Production (economics); Production line; Computer science; Process (computing); Heuristic; Reliability engineering; Quality (philosophy); Operations research; Mathematical optimization; Engineering","score_opus":0.019999124245498077,"score_gpt":0.231162325133809,"score_spread":0.21116320088831092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313422163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2557346,0.0021516979,0.7121984,0.0053972476,0.022394286,0.0010554686,0.000040437935,0.0006336355,0.00039422687],"genre_scores_gemma":[0.7575848,0.0021201205,0.23686539,0.000068925285,0.0025218003,0.00015407361,0.000040214243,0.0000618349,0.00058282464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.000008607248,0.00023532246,0.000075117845,0.00017485124,0.000075599164],"domain_scores_gemma":[0.99975437,0.000020360156,0.000058422393,0.00003951522,0.00009694764,0.000030396006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030324556,0.00007827224,0.00009683538,0.0001911333,0.000050960578,0.000065452004,0.00007658512,0.000024487963,0.000007383099],"category_scores_gemma":[0.000040500625,0.0000802854,0.000036068777,0.00006384144,0.000008761937,0.00025443925,0.000039376602,0.00011573781,7.7807805e-8],"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.00008555438,0.0000120108925,0.0000072714133,0.000024280458,0.00022749694,0.0000049066257,0.00012422593,0.98927677,0.000120626755,0.002384275,0.0008236034,0.006908996],"study_design_scores_gemma":[0.0032422615,0.0002498969,0.00009364879,0.00012367494,0.00012227907,0.000229299,0.0026009649,0.9432707,0.00071382854,0.00031369718,0.048747007,0.00029275496],"about_ca_topic_score_codex":0.0000015773395,"about_ca_topic_score_gemma":1.8213818e-7,"teacher_disagreement_score":0.50185025,"about_ca_system_score_codex":0.000054378936,"about_ca_system_score_gemma":0.000011777464,"threshold_uncertainty_score":0.32739434},"labels":[],"label_agreement":null},{"id":"W4313485721","doi":"","title":"Investigating Functions in BFO from the Viewpoint of Extrinsic Dispositions","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science","score_opus":0.015280581988927415,"score_gpt":0.2148051008789484,"score_spread":0.19952451889002099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313485721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40674916,0.0056756902,0.5438288,0.011677878,0.0011622863,0.0008510902,0.00069231016,0.00072700984,0.028635792],"genre_scores_gemma":[0.83385444,0.00064832636,0.16199343,0.00013827378,0.00004638565,0.00027191677,0.0018833323,0.000081427694,0.0010824706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685067,0.0018102077,0.0005349283,0.00033995658,0.00027802022,0.00018621984],"domain_scores_gemma":[0.9966266,0.0014506334,0.00020962059,0.0012425462,0.0003928033,0.0000777763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019205101,0.00020693215,0.0002602009,0.00014375904,0.00024748928,0.00011656845,0.0007117843,0.00013211074,0.0003997485],"category_scores_gemma":[0.00079315103,0.00020739618,0.00013794465,0.0005759419,0.00013137948,0.000067461784,0.0006260389,0.0008825447,0.000011880353],"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.000005504437,0.00059472857,0.01546408,0.0002926744,0.00027433087,0.0000042406946,0.038780656,0.8653892,0.0022743458,0.03384124,0.0016971015,0.04138186],"study_design_scores_gemma":[0.00058106985,3.320112e-7,0.02617341,0.002054698,0.000087658314,0.0000030472372,0.001412989,0.9552754,0.005929445,0.004790589,0.0031479376,0.000543431],"about_ca_topic_score_codex":0.0014417255,"about_ca_topic_score_gemma":0.0013375832,"teacher_disagreement_score":0.42710528,"about_ca_system_score_codex":0.00013044286,"about_ca_system_score_gemma":0.00012107735,"threshold_uncertainty_score":0.8457371},"labels":[],"label_agreement":null},{"id":"W4313680365","doi":"10.2139/ssrn.4319327","title":"Deep Reinforcement Learning for Machine Scheduling: Methodology, the State-of-The-Art, and Future Directions","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"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 Victoria","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Scheduling (production processes); Machine learning; Operations research; Engineering; Operations management","score_opus":0.015889453529184652,"score_gpt":0.2622895898932567,"score_spread":0.24640013636407204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313680365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01174004,0.0070869974,0.97817796,0.0016689344,0.0008457207,0.00018143574,7.5039355e-7,0.00014769676,0.0001504892],"genre_scores_gemma":[0.78982294,0.11359319,0.08379232,0.0002191745,0.0020519155,0.00012737076,0.000046510086,0.00022378475,0.010122788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988486,0.00008366354,0.00020455252,0.00008061324,0.00010697743,0.00067559094],"domain_scores_gemma":[0.99956053,0.00018366631,0.00007108743,0.00009469451,0.00005576271,0.000034252862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015775819,0.00009805211,0.000116812604,0.00008306516,0.00035913876,0.000028702318,0.00013447496,0.00004351814,0.000006481468],"category_scores_gemma":[0.00013374319,0.00006330171,0.00008122787,0.00031787637,0.00003264124,0.000051092215,0.00002476088,0.0010228804,0.0000031403779],"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.000009712877,0.0000023271996,0.0000816626,0.0000086344735,0.00012237589,1.1449696e-7,0.00038599092,0.9479824,0.000065638196,0.0027928185,0.000026716043,0.04852165],"study_design_scores_gemma":[0.00037932876,0.000071392176,0.00010336047,0.000008776421,0.000043114407,0.00007536947,0.0014040578,0.97608095,0.00020078964,0.01398615,0.0075555,0.00009120515],"about_ca_topic_score_codex":0.000005379534,"about_ca_topic_score_gemma":0.00009702734,"teacher_disagreement_score":0.89438564,"about_ca_system_score_codex":0.000121951954,"about_ca_system_score_gemma":0.00011920052,"threshold_uncertainty_score":0.44439632},"labels":[],"label_agreement":null},{"id":"W4317725390","doi":"10.5267/j.jpm.2022.12.001","title":"Bounded dynamic programming approach to minimize makespan in the blocking flowshop problem with sequence dependent setup times","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Job shop scheduling; Bounded function; Mathematical optimization; Computer science; Minification; Dynamic programming; Sequence (biology); Scheduling (production processes); Limit (mathematics); Blocking (statistics); Flow shop scheduling; Linear programming; Algorithm; Mathematics; Schedule","score_opus":0.021729000666331207,"score_gpt":0.2639030284277405,"score_spread":0.24217402776140928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317725390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17979077,0.00042844334,0.7839873,0.0019424305,0.0009288599,0.0060906513,0.000009917628,0.0009665912,0.025855038],"genre_scores_gemma":[0.2967234,0.00009096917,0.7021563,0.00009166705,0.00007041309,0.00016727319,0.0000091793845,0.000050405288,0.0006404115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851936,0.000059604932,0.0003963371,0.00016969767,0.0005251495,0.00032986753],"domain_scores_gemma":[0.9995696,0.00003326999,0.000099103956,0.00019547564,0.000056338275,0.000046240875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010531115,0.00017016147,0.00019706525,0.00056704023,0.00007208286,0.00021123882,0.00037573837,0.000037357615,0.0000033123397],"category_scores_gemma":[0.000013589465,0.00011455318,0.000053043514,0.001250958,0.000016190153,0.00012956583,0.00005087654,0.0002538959,0.0000095834175],"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.000037018206,0.00009027383,0.00017612914,0.0002569972,0.00017166782,0.00021763625,0.0048028687,0.97151077,0.000022302384,0.00015598362,0.0003839013,0.022174425],"study_design_scores_gemma":[0.0015467174,0.00020154749,0.0010077349,0.0004664364,0.00013250245,0.00024540036,0.017344669,0.9755953,0.00005284233,0.00012032362,0.0028721413,0.00041439474],"about_ca_topic_score_codex":0.00000759861,"about_ca_topic_score_gemma":0.000012775125,"teacher_disagreement_score":0.11693263,"about_ca_system_score_codex":0.00015756725,"about_ca_system_score_gemma":0.000033499924,"threshold_uncertainty_score":0.4671343},"labels":[],"label_agreement":null},{"id":"W4317794923","doi":"10.1109/mdat.2022.3221921","title":"Interview With Janet Olson","year":2023,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Tribute; Management; Semiconductor industry; Electronic design automation; Robotics; Automation; Engineering; Automotive industry; Manufacturing engineering; Engineering management; Sociology; Telecommunications; Computer science; Electrical engineering; Artificial intelligence; Art history; Robot; Art; Mechanical engineering","score_opus":0.030468002558203647,"score_gpt":0.22091434266957935,"score_spread":0.1904463401113757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317794923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032328304,0.0008401731,0.96070707,0.00041111725,0.00058614236,0.0002913634,0.00000943224,0.002422378,0.0024039957],"genre_scores_gemma":[0.9208264,0.0007528945,0.076781325,0.00026788915,0.00015485888,0.000040198625,0.000019278055,0.00006691751,0.0010902665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972105,0.000009584151,0.000055741722,0.000070875634,0.000045970086,0.00009677611],"domain_scores_gemma":[0.99976176,0.000115315095,0.000005964347,0.00006437552,0.000011485498,0.000041126208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093354494,0.00006306002,0.00006305345,0.00004338849,0.000024053115,0.000029695146,0.000035001805,0.000025333033,0.000019572088],"category_scores_gemma":[0.000013290534,0.000051546576,0.000007937969,0.00018711746,0.000011729032,0.00003384355,0.0000029839134,0.000048685,0.00011900657],"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.00001119812,0.000043207674,0.0012746375,0.0002465481,0.00008508644,0.00012836937,0.00091052917,0.85782003,0.002050911,0.00016411685,0.03011898,0.1071464],"study_design_scores_gemma":[0.0002703475,0.000071630944,0.00072010333,0.00006632419,0.000010005002,0.000018016739,0.000039719434,0.9940733,0.0021732992,0.000038669463,0.0023796635,0.00013894387],"about_ca_topic_score_codex":9.645989e-7,"about_ca_topic_score_gemma":6.1275523e-7,"teacher_disagreement_score":0.88849807,"about_ca_system_score_codex":0.000004649956,"about_ca_system_score_gemma":0.0000039610986,"threshold_uncertainty_score":0.21020083},"labels":[],"label_agreement":null},{"id":"W4317815167","doi":"10.1109/wsc57314.2022.10015488","title":"MULTI-AGENT SYSTEM MODEL FOR DYNAMIC SCHEDULING IN FLEXIBILE JOB SHOP SUBJECT TO RANDOM MACHINE BREAKDOWN","year":2022,"lang":"en","type":"article","venue":"2022 Winter Simulation Conference (WSC)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Scheduling (production processes); Job shop scheduling; Dynamic priority scheduling; Subject (documents); Mathematical optimization; Embedded system; Mathematics; World Wide Web; Operating system","score_opus":0.031082138890467095,"score_gpt":0.2823470810957424,"score_spread":0.25126494220527534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317815167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09953575,0.00011057872,0.8979275,0.00008743883,0.0007466438,0.00088147476,0.00016741604,0.0004102889,0.00013290926],"genre_scores_gemma":[0.9351824,0.000003864996,0.06332817,0.00009043868,0.000040972962,0.00043360726,0.0001877138,0.000065074244,0.0006677433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983312,0.00008234626,0.0005403283,0.00041724113,0.00028442228,0.0003444664],"domain_scores_gemma":[0.9992145,0.00016117598,0.00006546319,0.00031359197,0.0001294947,0.00011580865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048334117,0.00025517395,0.0003421191,0.00036955345,0.00018428417,0.00009572818,0.00028919356,0.00007070032,0.00027002828],"category_scores_gemma":[0.00007927663,0.00028956038,0.00012067114,0.00038909592,0.0000118045455,0.00015233624,0.000116958465,0.00029415416,0.000024363862],"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.00013536526,0.000033928467,0.00028329942,0.00006634839,0.000028471792,0.0000026391026,0.0015213754,0.99541557,0.00046702765,0.00007178033,0.00001494065,0.0019592592],"study_design_scores_gemma":[0.0028348896,0.00004337086,0.00013378287,0.00005768635,0.000019221201,0.0000031728641,0.0007471917,0.9956767,0.000064776585,0.000018504421,0.00007792801,0.00032275732],"about_ca_topic_score_codex":0.000025342826,"about_ca_topic_score_gemma":0.0001228111,"teacher_disagreement_score":0.8356467,"about_ca_system_score_codex":0.00048552296,"about_ca_system_score_gemma":0.000067299785,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W4318712584","doi":"10.2139/ssrn.4331125","title":"The Multi-Factory Two-Stage Assembly Scheduling Problem","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Factory (object-oriented programming); Scheduling (production processes); Operations management; Stage (stratigraphy); Business; Operations research; Computer science; Manufacturing engineering; Engineering; Biology","score_opus":0.014217008851795441,"score_gpt":0.25447762734323714,"score_spread":0.2402606184914417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318712584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23429006,0.008085687,0.75042117,0.00090322323,0.0020313666,0.00032791536,0.000005282229,0.00206031,0.001874992],"genre_scores_gemma":[0.9548896,0.012636188,0.023399439,0.00005032311,0.0007139888,0.000024972767,0.000012078065,0.00015080896,0.008122581],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973838,0.00005002744,0.00027758535,0.00013321724,0.00024400796,0.0019113914],"domain_scores_gemma":[0.9995142,0.00009647775,0.000060462164,0.00016848542,0.00006785617,0.000092509996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017025069,0.00016395106,0.00012318789,0.00012341446,0.00048701154,0.00017366564,0.0003063891,0.00006787364,0.000010638161],"category_scores_gemma":[0.000069573434,0.00012529531,0.00009619879,0.00042913595,0.000026808604,0.00015657132,0.000026949165,0.0017446638,0.0002036264],"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.000006056891,0.000010911847,0.00027707795,0.000008122802,0.00015568189,0.0000055413498,0.00018062886,0.9697995,0.0005588581,0.0098561235,0.00006121527,0.019080246],"study_design_scores_gemma":[0.0008685733,0.000040223782,0.00011589077,0.000022733719,0.00001795133,0.00007656302,0.002239735,0.98957247,0.00036998422,0.004066773,0.0023534757,0.00025564063],"about_ca_topic_score_codex":0.000007761825,"about_ca_topic_score_gemma":0.00016113727,"teacher_disagreement_score":0.7270217,"about_ca_system_score_codex":0.00043536536,"about_ca_system_score_gemma":0.00045298217,"threshold_uncertainty_score":0.7579793},"labels":[],"label_agreement":null},{"id":"W4319318918","doi":"10.1007/978-3-031-22371-6_9","title":"Neural Networks Based Throughput Estimation of Short Production Lines Without Intermediate Buffers","year":2023,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université de Sherbrooke","funders":"","keywords":"Throughput; Artificial neural network; Workstation; Computer science; Production (economics); Production line; Range (aeronautics); Function (biology); Artificial intelligence; Machine learning; Line (geometry); Data mining; Engineering; Mathematics; Telecommunications","score_opus":0.04039412312704101,"score_gpt":0.24518160829206773,"score_spread":0.2047874851650267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319318918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026617963,0.005647643,0.8517602,0.00020437526,0.03367272,0.0035756056,0.0003436085,0.008415015,0.093719035],"genre_scores_gemma":[0.830843,0.0031181294,0.007143363,0.000053206528,0.0024867356,0.00019247118,0.0036894218,0.00078210427,0.15169159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978863,0.000036796486,0.0009798241,0.00045545443,0.00037159515,0.00027001693],"domain_scores_gemma":[0.9989478,0.000097141856,0.00022145941,0.00052107155,0.00009996227,0.000112558235],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013692994,0.00049865694,0.00064172345,0.0003911122,0.00004565091,0.00010921919,0.00033320693,0.00052591524,0.00008258551],"category_scores_gemma":[0.000034443903,0.0004699418,0.00014537554,0.00015134456,0.0000729194,0.0004100274,0.000059116257,0.00056634186,0.00008728979],"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.000020042704,0.000007752562,0.00009766789,0.0005740618,0.00010268122,0.0000058444834,0.00006325932,0.9881086,0.0000040582318,0.0010588098,0.0010003346,0.008956928],"study_design_scores_gemma":[0.000055744134,0.000050590294,0.00002363224,0.0016200992,0.00006089529,0.0000064316737,0.00003379258,0.99603945,0.00051077857,0.00014803263,0.0010292615,0.00042128217],"about_ca_topic_score_codex":0.000007576087,"about_ca_topic_score_gemma":0.0000017463792,"teacher_disagreement_score":0.84461683,"about_ca_system_score_codex":0.00005295221,"about_ca_system_score_gemma":0.00004993537,"threshold_uncertainty_score":0.99977523},"labels":[],"label_agreement":null},{"id":"W4321381430","doi":"10.1016/j.engappai.2023.105977","title":"Solving energy-efficient fuzzy hybrid flow-shop scheduling problem at a variable machine speed using an extended NSGA-II","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":84,"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":"National Natural Science Foundation of China","keywords":"Computer science; Fuzzy logic; Energy consumption; Scheduling (production processes); Sorting; Genetic algorithm; Population; Mathematical optimization; Algorithm; Artificial intelligence; Machine learning","score_opus":0.023065330455246648,"score_gpt":0.25388355898984116,"score_spread":0.23081822853459452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321381430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05384544,0.0002392176,0.94371533,0.000021691434,0.00028033965,0.00029058705,0.000045800592,0.0013616969,0.00019990256],"genre_scores_gemma":[0.5263634,0.000038321505,0.4730309,0.0000065989516,0.00018881394,0.000088310706,0.00011780836,0.00009459578,0.00007127168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980074,0.000019013443,0.0007196375,0.0004374828,0.00031068802,0.0005057604],"domain_scores_gemma":[0.9988407,0.00011520938,0.000094745235,0.0005820827,0.00017991835,0.00018733238],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004570483,0.00030598845,0.00030046588,0.00048200352,0.0003891268,0.000088541776,0.00040772135,0.00010612914,0.000057653826],"category_scores_gemma":[0.000074031865,0.0003646027,0.00008705692,0.0016878733,0.00005949108,0.00013949434,0.00014925607,0.00022308007,0.00005096674],"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.000005388369,0.00008579066,0.0000026457801,0.000067737295,0.00003346789,0.0000017402782,0.00029413658,0.9457303,0.038606927,0.006354377,0.000007298792,0.008810138],"study_design_scores_gemma":[0.000035275556,0.000021903681,0.0000022620047,0.00006485107,0.000026632799,0.000010430968,0.00011958807,0.9151607,0.083159596,0.00083556055,0.00022866072,0.00033453468],"about_ca_topic_score_codex":0.00005190478,"about_ca_topic_score_gemma":0.0000058017395,"teacher_disagreement_score":0.47251794,"about_ca_system_score_codex":0.00015798271,"about_ca_system_score_gemma":0.000050441722,"threshold_uncertainty_score":0.9998806},"labels":[],"label_agreement":null},{"id":"W4323342256","doi":"10.5267/j.ijiec.2023.2.002","title":"Composite heuristics and water wave optimality algorithms for tri-criteria multiple job classes and customer order scheduling on a single machine","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Tardiness; Heuristics; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Algorithm; Upper and lower bounds; Mathematics","score_opus":0.05144919766367224,"score_gpt":0.2880264720771587,"score_spread":0.23657727441348647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31956673,0.00010884955,0.6758733,0.00071155257,0.0031984935,0.00018190368,0.00013026361,0.00020405136,0.0000248984],"genre_scores_gemma":[0.8070125,0.00005216485,0.19192693,0.000033670003,0.0008099399,0.000007935921,0.00009420186,0.000045001878,0.000017660172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891305,0.000019593397,0.00048832584,0.0001339907,0.00025292215,0.000192098],"domain_scores_gemma":[0.9988412,0.00048329897,0.0000757908,0.00005964824,0.00042206686,0.00011798284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002901795,0.0001774134,0.00023703474,0.00047948243,0.000073907555,0.00018767417,0.0001172173,0.00010918848,0.000008051071],"category_scores_gemma":[0.00038158704,0.00016008997,0.00006213125,0.00019778885,0.000027710996,0.00016346424,0.00004105615,0.000295909,0.0000036139206],"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.000049482638,0.000030299656,0.00016127754,0.000015724545,0.00019288326,0.00001897861,0.00021077333,0.99195755,0.0015618884,0.00007350567,0.00014154943,0.0055860695],"study_design_scores_gemma":[0.0020689873,0.00008647378,0.00030217803,0.00012487268,0.00003599909,0.00008536622,0.00005067422,0.9946011,0.0017457195,0.000047652222,0.0006759035,0.00017508825],"about_ca_topic_score_codex":0.0000046825858,"about_ca_topic_score_gemma":5.998048e-7,"teacher_disagreement_score":0.48744577,"about_ca_system_score_codex":0.000076613636,"about_ca_system_score_gemma":0.000021797596,"threshold_uncertainty_score":0.6528279},"labels":[],"label_agreement":null},{"id":"W4323342275","doi":"10.5267/j.ijiec.2023.2.004","title":"Heuristics and metaheuristics to minimize makespan for flowshop with peak power consumption constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Fundo para o Desenvolvimento das Ciências e da Tecnologia; National Natural Science Foundation of China","keywords":"Metaheuristic; Job shop scheduling; Mathematical optimization; Heuristics; Computer science; Simulated annealing; Iterated local search; Benchmark (surveying); Local search (optimization); Algorithm; Mathematics; Schedule","score_opus":0.03397247829670139,"score_gpt":0.27034646385531585,"score_spread":0.23637398555861447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077163756,0.000031382715,0.9193023,0.00045958423,0.0025936048,0.00015502624,0.00011188092,0.00015150136,0.00003098247],"genre_scores_gemma":[0.76517284,0.000030985506,0.23403491,0.0000424529,0.0005891051,0.000011532877,0.000046994333,0.000044818116,0.000026388765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909145,0.000009816328,0.000391997,0.000095761636,0.0002668644,0.00014410072],"domain_scores_gemma":[0.99884087,0.0004148277,0.000080166865,0.00005681471,0.00046923844,0.00013808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022181237,0.00013063247,0.00018282385,0.00047475204,0.000036596994,0.00010357263,0.00014543213,0.000072250055,0.00001533641],"category_scores_gemma":[0.00053438434,0.0001285946,0.000049255876,0.0002242348,0.000029336434,0.00008630695,0.000018076671,0.00018648636,0.000007784421],"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.000037231082,0.0000114385,0.00014897241,0.000007952238,0.0002187036,0.000021127935,0.00017695445,0.99457985,0.00013989114,0.0004721933,0.00088857056,0.0032971355],"study_design_scores_gemma":[0.0020299638,0.00010892641,0.0013284977,0.00017885074,0.00006797008,0.00016289645,0.0001351967,0.9936857,0.00019382156,0.000051846855,0.0018456206,0.00021068192],"about_ca_topic_score_codex":5.429994e-7,"about_ca_topic_score_gemma":3.2718654e-7,"teacher_disagreement_score":0.6880091,"about_ca_system_score_codex":0.000061197265,"about_ca_system_score_gemma":0.000051487026,"threshold_uncertainty_score":0.5243936},"labels":[],"label_agreement":null},{"id":"W4323342282","doi":"10.5267/j.ijiec.2022.12.001","title":"Bio-inspired multi-objective algorithms applied on production scheduling problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Ministério da Ciência, Tecnologia e Ensino Superior","keywords":"Job shop scheduling; Mathematical optimization; Tardiness; Computer science; Multi-objective optimization; Scheduling (production processes); Particle swarm optimization; Pareto principle; Flow shop scheduling; Sorting; Algorithm; Schedule; Mathematics","score_opus":0.03865056961408586,"score_gpt":0.2654699293631502,"score_spread":0.22681935974906436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323342282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16160011,0.000076689365,0.816253,0.001100182,0.01904499,0.00042556346,0.000034764023,0.0012601056,0.0002046196],"genre_scores_gemma":[0.91448194,0.000057848134,0.08238347,0.000033733984,0.0028320712,0.000023832226,0.0000652552,0.00007849446,0.00004337564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853325,0.000016779184,0.0005839731,0.00016130076,0.00049835956,0.00020632133],"domain_scores_gemma":[0.99905336,0.0001400618,0.00016100812,0.00009654073,0.00044363915,0.00010538348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538181,0.000193497,0.00021427016,0.0009903202,0.00006601923,0.00010793186,0.00028723324,0.00013369897,0.000010051416],"category_scores_gemma":[0.00039115216,0.00020130632,0.000108307075,0.0007842652,0.000020620064,0.00019541726,0.000026262036,0.00051724847,0.000052226147],"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.000014580543,0.000045251127,0.000033799373,0.000005966494,0.00023528378,0.000013453504,0.00033134065,0.9856938,0.0010072826,0.00016248965,0.00027409795,0.012182637],"study_design_scores_gemma":[0.0013524867,0.000052149615,0.00031186632,0.00020352534,0.000021966724,0.00003981952,0.00013206928,0.99412596,0.0030731338,0.000047092395,0.00043585568,0.000204048],"about_ca_topic_score_codex":0.0000031479435,"about_ca_topic_score_gemma":4.796188e-7,"teacher_disagreement_score":0.7528818,"about_ca_system_score_codex":0.00022520065,"about_ca_system_score_gemma":0.00007164172,"threshold_uncertainty_score":0.82090336},"labels":[],"label_agreement":null},{"id":"W4353070770","doi":"10.1287/ijoc.2023.1287","title":"Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Windsor","funders":"","keywords":"Integer programming; Computer science; Mathematical optimization; Constraint programming; Scheduling (production processes); Job shop scheduling; Flow shop scheduling; Schedule; Mathematics; Stochastic programming","score_opus":0.03150559591981477,"score_gpt":0.26215820929267636,"score_spread":0.23065261337286158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4353070770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06957255,0.00022896443,0.92455614,0.00064967555,0.0019402652,0.0008013586,0.0000073824585,0.0016956141,0.0005480249],"genre_scores_gemma":[0.36746982,0.000075874224,0.6308202,0.00014128197,0.0011649183,0.000016244905,0.00003889008,0.000099005454,0.00017376743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785244,0.000013855537,0.0008818372,0.00023441372,0.00031034305,0.0007070861],"domain_scores_gemma":[0.9988043,0.0003089007,0.00022245126,0.00014495454,0.0001802349,0.00033920532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001299841,0.00029417966,0.00032252265,0.0003889075,0.00041500208,0.0007024606,0.00019472823,0.0001440863,0.0000029541145],"category_scores_gemma":[0.0005015377,0.00025488494,0.00013498332,0.00048939534,0.00005030842,0.0003023512,0.00006022093,0.0006408284,0.000023424724],"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.000025667869,0.000007802195,0.00009970344,0.000077089004,0.000054894714,0.000009905413,0.0010348076,0.58779484,0.0000082057495,0.00019255749,0.00021882402,0.4104757],"study_design_scores_gemma":[0.0018097713,0.00020731021,0.0000551572,0.00076989585,0.000020452853,0.00019578615,0.0013549497,0.9810142,0.00015331512,0.00013574676,0.013926123,0.00035727525],"about_ca_topic_score_codex":0.0000029783814,"about_ca_topic_score_gemma":0.0000022619304,"teacher_disagreement_score":0.41011843,"about_ca_system_score_codex":0.00009601251,"about_ca_system_score_gemma":0.00009954073,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W4361185157","doi":"","title":"PORTRAIT CONCEPTUEL DE LA GESTION DE L'ÉNERGIE DANS LES SYSTÈMES DE PRODUCTION","year":2020,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.01451441304678728,"score_gpt":0.22377118942585458,"score_spread":0.2092567763790673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361185157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06980342,0.0020187062,0.880051,0.023928422,0.00054085295,0.00038971004,0.000056771532,0.00087976817,0.022331329],"genre_scores_gemma":[0.5284321,0.001843371,0.46324,0.00005686122,0.00015272098,0.0000949938,0.00037506403,0.000100564255,0.0057043484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911321,0.0064844666,0.0006466337,0.0007839826,0.00036824646,0.0005845921],"domain_scores_gemma":[0.9957874,0.0012496107,0.00037943065,0.0011155937,0.0010700669,0.0003979181],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0061630504,0.00046641385,0.0004229679,0.00015292587,0.00044272863,0.00045777112,0.0008186753,0.0007393299,0.00015959432],"category_scores_gemma":[0.004483218,0.00059232645,0.00023847456,0.00049108174,0.00041376954,0.00017042742,0.00033170037,0.0013187364,0.00004746452],"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.000022377233,0.0005185943,0.009671726,0.0008965048,0.0002878654,0.0000332307,0.05709336,0.6611046,0.02869374,0.18348776,0.0016038407,0.05658637],"study_design_scores_gemma":[0.0005393401,8.381856e-7,0.027209062,0.0030149738,0.00020570548,0.0001432108,0.0011236661,0.8550267,0.09896326,0.004667825,0.008337361,0.00076805154],"about_ca_topic_score_codex":0.003152359,"about_ca_topic_score_gemma":0.00057929754,"teacher_disagreement_score":0.45862865,"about_ca_system_score_codex":0.0010684164,"about_ca_system_score_gemma":0.00085574674,"threshold_uncertainty_score":0.9996528},"labels":[],"label_agreement":null},{"id":"W4361836128","doi":"10.2139/ssrn.4406241","title":"A Machine Learning-Based Decision Support Tool for Dynamic Scheduling Problem Under Industry 4.0 Environment","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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; Scheduling (production processes); Artificial intelligence; Decision support system; Machine learning; Operations research; Engineering; Operations management","score_opus":0.01191046660314071,"score_gpt":0.24576940982030057,"score_spread":0.23385894321715986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361836128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015456573,0.0018725184,0.980361,0.00040124689,0.0007955267,0.0005172672,0.000033456425,0.00053982943,0.000022574646],"genre_scores_gemma":[0.63840884,0.011489385,0.34319007,0.00012241115,0.0008283843,0.00033839332,0.0009660716,0.00076233526,0.003894087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99619496,0.00006058451,0.00071160804,0.00047659918,0.00047550187,0.0020807418],"domain_scores_gemma":[0.99904794,0.00016397086,0.00024688678,0.0003228347,0.00007376533,0.00014461056],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020721725,0.00049026037,0.00044446837,0.0003812747,0.00025810377,0.0001895327,0.0004489287,0.0009124627,0.00009147827],"category_scores_gemma":[0.000099297555,0.0005038058,0.00032561854,0.0001583969,0.000030289046,0.000080974794,0.0001345563,0.010187385,0.00007499257],"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.000038621758,0.00003401395,0.00018527948,0.00007172001,0.00027111077,0.0000038960293,0.000033267675,0.9851689,0.000019784597,0.00028527682,0.000016067537,0.013872089],"study_design_scores_gemma":[0.0011815103,0.00017401106,0.00004834979,0.00019074469,0.00011860412,0.000060306895,0.00017232542,0.9551057,0.000033732988,0.042013567,0.00037004938,0.00053107046],"about_ca_topic_score_codex":0.000008347015,"about_ca_topic_score_gemma":0.00004653496,"teacher_disagreement_score":0.6371709,"about_ca_system_score_codex":0.0024873333,"about_ca_system_score_gemma":0.0017015268,"threshold_uncertainty_score":0.9997414},"labels":[],"label_agreement":null},{"id":"W4362596021","doi":"10.1007/s11590-023-02000-0","title":"On the complexity of proportionate open shop and job shop problems","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Open shop; Job shop scheduling; Computational intelligence; Job shop; Mathematical proof; Mathematics; Computer science; Time complexity; Mathematical optimization; Combinatorics; Discrete mathematics; Flow shop scheduling; Artificial intelligence","score_opus":0.046146299963866724,"score_gpt":0.24560146784742318,"score_spread":0.19945516788355644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362596021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1083145,0.000053470838,0.8447929,0.03394816,0.0007085706,0.0017796624,0.00005357875,0.0010451163,0.009304029],"genre_scores_gemma":[0.7508185,0.00032913723,0.24362025,0.0032807586,0.00013583568,0.0002101082,0.00042277,0.00016226235,0.0010203728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000030639887,0.00020286518,0.00013672943,0.00015086331,0.00012871994],"domain_scores_gemma":[0.99964374,0.000059718797,0.000048337955,0.00016784763,0.00004522677,0.000035128953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002358987,0.0001001393,0.00011280096,0.00009135183,0.00009339397,0.000082966246,0.00018144831,0.00003527613,0.00016204498],"category_scores_gemma":[0.000049837843,0.0000785788,0.000021101114,0.0004308314,0.00011812552,0.00012335385,0.000054245782,0.000086407235,0.000020870166],"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.0000033810993,0.000006031462,0.00012236692,0.000019954748,0.000017883933,6.452113e-7,0.00016896168,0.99308056,0.00014975462,0.0031357426,0.0031365817,0.00015816613],"study_design_scores_gemma":[0.00022092595,0.000010871588,0.0003039807,0.00002929818,0.0000064308842,0.0000012384133,0.000058725702,0.9987406,0.00022542618,0.00021396764,0.00009011574,0.00009841781],"about_ca_topic_score_codex":0.000005471421,"about_ca_topic_score_gemma":0.000001414395,"teacher_disagreement_score":0.64250404,"about_ca_system_score_codex":0.0000176175,"about_ca_system_score_gemma":0.000007947452,"threshold_uncertainty_score":0.32043505},"labels":[],"label_agreement":null},{"id":"W4366528567","doi":"10.1080/23302674.2023.2200888","title":"Joint parallel-machine scheduling and maintenance planning optimisation with deterioration, unexpected breakdowns, and condition-based maintenance","year":2023,"lang":"en","type":"article","venue":"International Journal of Systems Science Operations & Logistics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reliability engineering; Mathematical optimization; Maintenance actions; Optimal maintenance; Scheduling (production processes); Reliability (semiconductor); Integer programming; Energy consumption; Production (economics); Preventive maintenance; Markov chain; Engineering; Algorithm; Mathematics; Machine learning","score_opus":0.021379490445571303,"score_gpt":0.26625632283042794,"score_spread":0.24487683238485664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366528567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13179114,0.00024682967,0.8660732,0.0005852621,0.0009066561,0.00015038873,0.000048720674,0.000098592805,0.000099199875],"genre_scores_gemma":[0.9115329,0.00012251551,0.0880459,0.00005064844,0.0001335396,0.000012184107,0.000033933007,0.000016063965,0.0000523108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849284,0.000030293731,0.00054443785,0.00018557257,0.0005476238,0.00019923558],"domain_scores_gemma":[0.99812925,0.00009045377,0.00016977105,0.000107894055,0.0013755285,0.00012710049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069216546,0.00014968537,0.00019388297,0.0005159596,0.00026322174,0.00058310357,0.00021872332,0.000049581922,0.0000050603235],"category_scores_gemma":[0.00043303857,0.0001216649,0.000021479267,0.00052271335,0.0003229311,0.0005826909,0.000026556252,0.00017309877,0.0000036926212],"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.00001431611,0.000009651139,0.00085431535,0.000014423262,0.000027887543,0.000035251163,0.00030370822,0.9940366,0.0029142515,0.0015429857,0.00005676403,0.00018980876],"study_design_scores_gemma":[0.00070493907,0.00007208224,0.0027618853,0.00033462793,0.000015502446,0.00029061773,0.00091919623,0.9943991,0.00023732221,0.000060908176,0.00005052812,0.00015331783],"about_ca_topic_score_codex":0.000031371357,"about_ca_topic_score_gemma":0.000014166303,"teacher_disagreement_score":0.77974176,"about_ca_system_score_codex":0.00015319164,"about_ca_system_score_gemma":0.00020305219,"threshold_uncertainty_score":0.5622881},"labels":[],"label_agreement":null},{"id":"W4367333494","doi":"10.2139/ssrn.4432289","title":"Minimizing the Sum of Earliness and Tardiness in the Multi-Factory Two-Stage Assembly Scheduling Problem","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"","keywords":"Tardiness; Scheduling (production processes); Factory (object-oriented programming); Computer science; Mathematical optimization; Stage (stratigraphy); Operations research; Operations management; Job shop scheduling; Schedule; Engineering; Mathematics; Operating system","score_opus":0.02783085294076971,"score_gpt":0.2724832253064839,"score_spread":0.2446523723657142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367333494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6369568,0.011720173,0.3482222,0.00083134545,0.0012662642,0.0006481595,0.000027101247,0.00021560435,0.000112332935],"genre_scores_gemma":[0.97905654,0.0067385864,0.013440171,0.000025257688,0.00039286283,0.000042847812,0.000016443908,0.00010817979,0.00017913968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972272,0.00019810833,0.0006203701,0.00026531817,0.00044206236,0.0012469726],"domain_scores_gemma":[0.99896497,0.0002479751,0.00024024311,0.00033458683,0.0001643759,0.000047833106],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0046601105,0.00032485754,0.0003956831,0.00025207922,0.00016040799,0.00017677118,0.00067887106,0.00021224334,0.000003203176],"category_scores_gemma":[0.00016398072,0.00021719429,0.00014415735,0.00034048766,0.00006452199,0.00010497354,0.00016521406,0.004831035,0.000002473224],"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.000010457461,0.000024758048,0.0012085761,0.00014496013,0.00018495193,0.0000060875877,0.0013089053,0.9940294,0.00010400417,0.00097365334,0.0000052772098,0.0019989756],"study_design_scores_gemma":[0.0013725151,0.000037258204,0.0013748466,0.000505824,0.00010804477,0.00011454446,0.01100393,0.98011947,0.00018856241,0.0046174014,0.0000725585,0.00048507308],"about_ca_topic_score_codex":0.00015900384,"about_ca_topic_score_gemma":0.0008656847,"teacher_disagreement_score":0.3420997,"about_ca_system_score_codex":0.00037622568,"about_ca_system_score_gemma":0.0009398461,"threshold_uncertainty_score":0.99746484},"labels":[],"label_agreement":null},{"id":"W4377966757","doi":"10.46254/na07.20220060","title":"Modelling Congestion for Aggregate Production Planning in Open Queuing Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Computer science; Aggregate (composite); Aggregate planning; Network congestion; Computer network; Production (economics); Production planning; Microeconomics; Economics","score_opus":0.048802261005918224,"score_gpt":0.2804371262610792,"score_spread":0.23163486525516097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377966757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047101676,0.00011166466,0.95039964,0.00010922892,0.0007356085,0.00033630026,6.287485e-7,0.0006337638,0.00057150365],"genre_scores_gemma":[0.83537585,0.00016381027,0.16293728,0.000024515939,0.00029869008,0.00016434139,0.00009035411,0.000053157797,0.00089198863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994879,0.0000082681545,0.00014592824,0.00014167001,0.000044667424,0.00017159927],"domain_scores_gemma":[0.999813,0.000038924456,0.000016117041,0.00007886629,0.000028019087,0.000025050602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264734,0.00007045064,0.000087898334,0.00011468707,0.000051370305,0.00007716719,0.00008396867,0.00005493692,0.000004611685],"category_scores_gemma":[0.000032077645,0.00007523922,0.000014110709,0.0003614885,0.0000044361077,0.0001988215,0.000019873849,0.0000819655,0.000007675682],"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.0000062405466,0.0000021772223,0.00011653856,0.0000128367565,0.0000048674606,8.0943835e-7,0.00015163296,0.9958604,0.000015064022,0.00012189246,0.0002963991,0.0034111172],"study_design_scores_gemma":[0.000215956,0.0000056739314,0.000034697692,0.00009286759,0.0000028589236,9.963078e-7,0.00016943044,0.99883777,0.00026779014,0.0001519356,0.00011823471,0.000101802594],"about_ca_topic_score_codex":0.000022412838,"about_ca_topic_score_gemma":0.0000057101424,"teacher_disagreement_score":0.78827417,"about_ca_system_score_codex":0.00003160152,"about_ca_system_score_gemma":0.000005779754,"threshold_uncertainty_score":0.30681664},"labels":[],"label_agreement":null},{"id":"W4379649769","doi":"10.1007/s12063-023-00381-0","title":"An efficiency-based aggregate production planning model for multi-line manufacturing systems","year":2023,"lang":"en","type":"article","venue":"Operations Management Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"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, Okanagan Campus; University of British Columbia","funders":"","keywords":"Production line; Downtime; Production (economics); Computer science; Aggregate planning; Production planning; Time horizon; Data envelopment analysis; Operations research; Factory (object-oriented programming); Mathematical optimization; Industrial engineering; Reliability engineering; Economics; Business; Mathematics; Engineering; Microeconomics","score_opus":0.14782408095622476,"score_gpt":0.39159785169970407,"score_spread":0.2437737707434793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379649769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058412638,0.00006157824,0.93891555,0.00015388975,0.0003392143,0.0011172625,0.000011929436,0.00074784196,0.00024011864],"genre_scores_gemma":[0.8029208,0.000063356114,0.18938024,0.000009805046,0.000162254,0.0010754786,0.00034548447,0.00006105674,0.0059814807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987291,0.00004833926,0.00019936288,0.00029774953,0.00034168112,0.00038378287],"domain_scores_gemma":[0.99940795,0.000027347005,0.000009418198,0.00033350955,0.00014898785,0.00007280133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011622766,0.000110219364,0.00009171534,0.00064527517,0.00055454037,0.00031270884,0.0002020344,0.000045278328,0.0000053576273],"category_scores_gemma":[0.000037595433,0.00011131024,0.000026103688,0.0005842158,0.000025739497,0.00020481592,0.000029709061,0.00014941012,0.00005835247],"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.000005167745,0.00003993173,0.0000052941236,0.00016219531,0.000017157918,0.0000028628458,0.00018571415,0.9967828,0.00035854467,0.00033728543,0.00042282967,0.0016802418],"study_design_scores_gemma":[0.00034572193,0.000027973405,0.000021027015,0.00006378546,0.0000071143513,3.369601e-7,0.000524138,0.9949737,0.0037495317,0.0000077790155,0.00015219206,0.00012666934],"about_ca_topic_score_codex":0.000008730239,"about_ca_topic_score_gemma":0.0000063767757,"teacher_disagreement_score":0.74953526,"about_ca_system_score_codex":0.00009038323,"about_ca_system_score_gemma":0.000021214177,"threshold_uncertainty_score":0.45391},"labels":[],"label_agreement":null},{"id":"W4380758876","doi":"10.1016/j.cie.2023.109387","title":"Ambiguity of the definition of permutation flow shops in the presence of missing operations","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Ambiguity; Context (archaeology); Flow shop scheduling; Random permutation; Flow (mathematics); Computer science; Mathematics; Job shop scheduling; Mathematical optimization; Combinatorics; Routing (electronic design automation)","score_opus":0.04711845145651906,"score_gpt":0.233279731578761,"score_spread":0.18616128012224195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380758876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7286894,0.000051336745,0.26933417,0.00016018732,0.0012852678,0.00025971737,0.000018913912,0.00011275276,0.00008825809],"genre_scores_gemma":[0.9839575,0.000007407457,0.015919518,0.0000041623884,0.00007852561,0.000006686061,0.00001446873,0.0000106178195,0.0000010971521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993417,0.000035472396,0.0002956371,0.000068276786,0.00016096963,0.000097927186],"domain_scores_gemma":[0.9995641,0.00018952096,0.00003356288,0.00015479566,0.000043442116,0.000014579117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028554464,0.00007402824,0.00012911028,0.00012088402,0.000026769048,0.000014085698,0.00018970914,0.0000702573,0.0000023866412],"category_scores_gemma":[0.0002102468,0.000059180442,0.000047977966,0.00080451375,0.000023671528,0.00007236984,0.000026111264,0.00016529902,4.832425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016371031,0.000007306835,0.00008859793,0.00002974984,0.000009247921,4.423621e-7,0.0009684478,0.9931676,0.0017159277,0.00022294627,0.000034766963,0.0037533387],"study_design_scores_gemma":[0.00027085593,0.000009542255,0.0019960983,0.00016177277,0.000008421642,0.0000016394133,0.00012867028,0.992481,0.004857131,0.000024453177,0.000007779185,0.000052641404],"about_ca_topic_score_codex":0.000020929161,"about_ca_topic_score_gemma":0.0000023523833,"teacher_disagreement_score":0.25526813,"about_ca_system_score_codex":0.000020371865,"about_ca_system_score_gemma":0.000025430589,"threshold_uncertainty_score":0.24133083},"labels":[],"label_agreement":null},{"id":"W4380894174","doi":"10.1016/j.cor.2023.106313","title":"A three-phase matheuristic algorithm for the multi-day task assignment problem","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Tabu search; Mathematical optimization; Algorithm; Heuristic; Computer science; Local optimum; Task (project management); Function (biology); Local search (optimization); Mathematics","score_opus":0.08590262884396564,"score_gpt":0.37478291984366346,"score_spread":0.2888802909996978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380894174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019437168,0.00020755244,0.99655086,0.00088491756,0.0004929181,0.0011116182,0.00006071119,0.00045599733,0.000041034364],"genre_scores_gemma":[0.01692991,0.00016831298,0.9795336,0.000057914847,0.00043472083,0.001558047,0.00021741888,0.00008464641,0.0010154244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0000714623,0.0002297686,0.00024210416,0.00036466648,0.00044065135],"domain_scores_gemma":[0.99866563,0.00061605015,0.0000070222063,0.00034883645,0.00025710216,0.00010533692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012613152,0.0001285988,0.00011990383,0.00024494846,0.0007400225,0.00036726543,0.00038015202,0.00006006424,0.000029915436],"category_scores_gemma":[0.00008862211,0.0000997377,0.00005828302,0.0008631168,0.00008177334,0.000090892674,0.00009764911,0.0002806935,0.00026047125],"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.000001281961,0.000052934593,0.0000015119222,0.00001375003,0.000044427896,0.000003855689,0.0004836732,0.81098276,0.0001054916,0.00026648265,0.009760212,0.17828363],"study_design_scores_gemma":[0.00081229734,0.00006344163,0.000022079053,0.000023264603,0.000008068532,0.0000025284744,0.00014630334,0.99346834,0.00014936093,0.000074639094,0.0051090093,0.00012063746],"about_ca_topic_score_codex":0.000020690297,"about_ca_topic_score_gemma":0.00002626212,"teacher_disagreement_score":0.18248563,"about_ca_system_score_codex":0.0000965277,"about_ca_system_score_gemma":0.00007050758,"threshold_uncertainty_score":0.569173},"labels":[],"label_agreement":null},{"id":"W4381800203","doi":"10.5267/j.ijiec.2023.5.003","title":"An efficient production planning approach based demand driven MRP under resource constraints","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Operability; Production planning; Production (economics); Material requirements planning; Demand forecasting; Computer science; Capacity planning; Economic shortage; Operations research; Mathematical optimization; Engineering; Economics; Mathematics; Microeconomics","score_opus":0.03563932523880774,"score_gpt":0.26957165839742603,"score_spread":0.23393233315861828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381800203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1738814,0.000024501773,0.82259464,0.00028318007,0.002692206,0.00009001489,0.000011616627,0.00032759874,0.00009481655],"genre_scores_gemma":[0.9461377,0.000002528189,0.052555762,0.000024865209,0.001153006,0.000004404468,0.00008196872,0.000033498196,0.0000062442105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880415,0.000030322772,0.00044878956,0.00012310965,0.0004331366,0.00016048066],"domain_scores_gemma":[0.9992161,0.00012065021,0.00010904196,0.00008781549,0.0003503936,0.00011600411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038361226,0.00013394856,0.00015322368,0.00066987914,0.000056819532,0.00010959644,0.00025709957,0.00010058436,0.000011640136],"category_scores_gemma":[0.0002338966,0.0001419327,0.00007328115,0.00045353072,0.000030796982,0.00013370362,0.0000134050315,0.00035552253,0.0000065184713],"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.000010803514,0.000038479313,0.000086531385,0.0000045453467,0.00010653947,0.000015070154,0.00021131641,0.9970175,0.00029744988,0.000111221074,0.0005397053,0.0015608508],"study_design_scores_gemma":[0.000762862,0.000030047106,0.00036680675,0.000121991165,0.000019335184,0.00006568283,0.00030968557,0.99758935,0.0004128852,0.000009987847,0.00017658694,0.00013475277],"about_ca_topic_score_codex":7.579736e-7,"about_ca_topic_score_gemma":4.0668983e-8,"teacher_disagreement_score":0.7722563,"about_ca_system_score_codex":0.00012824938,"about_ca_system_score_gemma":0.0000790303,"threshold_uncertainty_score":0.57878476},"labels":[],"label_agreement":null},{"id":"W4381802817","doi":"10.5267/j.ijiec.2023.4.001","title":"Joint optimization of production and maintenance scheduling for unrelated parallel machine using hybrid discrete spider monkey optimization algorithm","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Computer science; Algorithm; Scheduling (production processes); Inertia; Genetic algorithm; Mathematics","score_opus":0.0323767358199523,"score_gpt":0.2624948780241332,"score_spread":0.2301181422041809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381802817","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012908469,0.00012564195,0.98317933,0.00032343945,0.0030040466,0.00023240448,0.00007037894,0.00015070244,0.000005568741],"genre_scores_gemma":[0.21164188,0.00018691101,0.7873026,0.0000072003677,0.00063500705,0.000008195644,0.00014948248,0.000055269113,0.000013431005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985155,0.00002232925,0.00081555126,0.0001498248,0.00032047002,0.00017634791],"domain_scores_gemma":[0.998597,0.00012593642,0.0003210736,0.00007919377,0.00079184736,0.000084918436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040739487,0.00017849651,0.00027480864,0.00069478556,0.00006371841,0.00007226041,0.00014803313,0.000099667515,0.000008350639],"category_scores_gemma":[0.0007756104,0.00018808442,0.00010438695,0.00045571403,0.000029731798,0.00037498135,0.000030590138,0.00025408244,5.5734927e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024409137,0.000020703521,0.000029724786,0.00001773483,0.00021673125,0.0000053282365,0.0000962295,0.9967788,0.00021545206,0.00006359206,0.00007248487,0.002458832],"study_design_scores_gemma":[0.0011896737,0.000053524982,0.000021893691,0.0003554238,0.000059260878,0.0000968321,0.000068632835,0.997213,0.0006898208,0.00006139684,0.000022795832,0.00016771321],"about_ca_topic_score_codex":0.000007333155,"about_ca_topic_score_gemma":2.2926909e-7,"teacher_disagreement_score":0.1987334,"about_ca_system_score_codex":0.00012936449,"about_ca_system_score_gemma":0.000064015614,"threshold_uncertainty_score":0.766986},"labels":[],"label_agreement":null},{"id":"W4382243915","doi":"10.1007/978-3-031-36024-4_40","title":"Semi-supervised Learning Approach to Efficient Cut Selection in the Branch-and-Cut Framework","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Queen's University","funders":"","keywords":"Computer science; Heuristics; Artificial intelligence; Machine learning; Selection (genetic algorithm); Integer programming; Metric (unit); Generalizability theory; Mathematical optimization; Supervised learning; Scheduling (production processes); Algorithm; Artificial neural network; Mathematics","score_opus":0.014409711138479048,"score_gpt":0.2259970170748741,"score_spread":0.21158730593639505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382243915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015735199,0.00012752277,0.9953896,0.00014310321,0.0006465636,0.00030328493,0.0000010666328,0.0002767829,0.001538547],"genre_scores_gemma":[0.5130145,0.000073759424,0.48492917,0.0008530722,0.0007154624,0.00003874224,0.000010285532,0.000105099025,0.0002599091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837226,0.00002873703,0.0002456064,0.0005485101,0.00045146042,0.00035341334],"domain_scores_gemma":[0.99925315,0.0003694924,0.00003405041,0.000221049,0.00005240187,0.00006986654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006699227,0.00027177506,0.00024443254,0.00052710675,0.0001566389,0.00023238809,0.00050135085,0.0002617629,0.000004983274],"category_scores_gemma":[0.00014021741,0.00022498117,0.000042986605,0.0009911703,0.00010064437,0.000050769275,0.00011875447,0.0011773392,0.000023829583],"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.0000016285749,0.0000056556764,0.000039905535,0.000027067697,0.0000036021813,0.0000021851843,0.0027859039,0.9554208,0.000012778834,0.00039755323,0.0000032211376,0.04129973],"study_design_scores_gemma":[0.00008804568,0.000028057018,0.00012507993,0.00022651849,0.000004471135,0.000014969571,0.0000025433562,0.9972074,0.00008576182,0.001875163,0.0000796631,0.00026230232],"about_ca_topic_score_codex":0.000008378878,"about_ca_topic_score_gemma":0.000015152913,"teacher_disagreement_score":0.511441,"about_ca_system_score_codex":0.000115591036,"about_ca_system_score_gemma":0.000045091638,"threshold_uncertainty_score":0.91744655},"labels":[],"label_agreement":null},{"id":"W4382541166","doi":"10.18280/mmep.100322","title":"SCOR Racetrack to Improve Supply Chain Performance","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Supply chain; Computer science; Business; Marketing","score_opus":0.01591759871505453,"score_gpt":0.19970983344779744,"score_spread":0.18379223473274292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382541166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24118803,0.00008020168,0.75657475,0.00008975431,0.00021364629,0.00019343899,0.000004155252,0.0014101957,0.0002458241],"genre_scores_gemma":[0.7959001,0.00019846624,0.20311,0.000019751193,0.00010734564,0.00011080668,0.000008745592,0.00009249047,0.00045227216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896735,0.0000037073553,0.00026487687,0.00020766175,0.00015806178,0.0003983437],"domain_scores_gemma":[0.99951607,0.00007347845,0.000011453841,0.0001805215,0.000026184374,0.0001922857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028090418,0.00019840524,0.00021523015,0.00018256271,0.00005896613,0.00007974405,0.00010390212,0.00008944381,0.000014782248],"category_scores_gemma":[0.000031807656,0.00019196124,0.000034468736,0.0004008817,0.000011473519,0.00008907948,0.000033519154,0.00019040774,0.0002594851],"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.0000010703612,0.0000068624176,0.000008026154,0.0005696464,0.000013451801,9.017438e-7,0.0005431011,0.9962815,0.0004874254,0.0005061328,0.000046807323,0.0015350496],"study_design_scores_gemma":[0.00014566671,0.00002563973,0.00001383636,0.00023412783,0.000008174563,0.0000055596515,0.000022750452,0.99795985,0.00081396935,0.00032660825,0.00019392962,0.00024986526],"about_ca_topic_score_codex":0.0000010583301,"about_ca_topic_score_gemma":6.565337e-8,"teacher_disagreement_score":0.5547121,"about_ca_system_score_codex":0.000021639058,"about_ca_system_score_gemma":0.000004610249,"threshold_uncertainty_score":0.7827952},"labels":[],"label_agreement":null},{"id":"W4382776149","doi":"10.1080/0951192x.2023.2228254","title":"Α Behavior Trees-based architecture towards operation planning in hybrid manufacturing","year":2023,"lang":"en","type":"article","venue":"International Journal of Computer Integrated Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Canadian Institute for Advanced Research","keywords":"Architecture; Computer science; Engineering; Systems engineering; Manufacturing engineering; Distributed computing; Process management; Geography","score_opus":0.015107215600138923,"score_gpt":0.2607902484653669,"score_spread":0.245683032865228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382776149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68265307,0.00004274842,0.31401354,0.0001861957,0.002664398,0.000088463246,0.0000120346185,0.00022948965,0.00011004549],"genre_scores_gemma":[0.95713216,0.00002375645,0.041980024,0.00011513052,0.0005894847,0.000009341767,0.00007950214,0.000045810048,0.000024769408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832267,0.000045876717,0.0006697713,0.0001753456,0.0005169274,0.00026940316],"domain_scores_gemma":[0.99942285,0.00008383444,0.00014223906,0.000121992445,0.00012984348,0.00009921754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002982538,0.00025025275,0.0002739568,0.0012625221,0.00004134278,0.00022778244,0.00053125556,0.00008495673,0.000069254944],"category_scores_gemma":[0.000017926473,0.0002258186,0.00014363155,0.0001353731,0.000021287568,0.00028634616,0.00004705267,0.00063456595,0.000022356402],"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.000046721798,0.0000257042,0.00018244985,0.000009785025,0.000067569905,0.00080524676,0.00027645737,0.9065188,0.00020695747,0.0000022320085,0.00022876516,0.09162932],"study_design_scores_gemma":[0.0012618124,0.00006461754,0.012723851,0.00042777127,0.000017187298,0.00029348565,0.00010536355,0.8039622,0.17966169,0.000075909775,0.0011187154,0.00028740146],"about_ca_topic_score_codex":0.000019090447,"about_ca_topic_score_gemma":0.000008229936,"teacher_disagreement_score":0.2744791,"about_ca_system_score_codex":0.00024991212,"about_ca_system_score_gemma":0.00006368201,"threshold_uncertainty_score":0.92086154},"labels":[],"label_agreement":null},{"id":"W4384161751","doi":"10.1287/ijoc.2021.0138","title":"Overload-Checking and Edge-Finding for Robust Cumulative Scheduling","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Schedule; Mathematical optimization; Algorithm; Mathematics","score_opus":0.04248921437303536,"score_gpt":0.2846047074638869,"score_spread":0.24211549309085154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384161751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42264074,0.000112575246,0.5741428,0.00007456404,0.0013801582,0.00013102731,0.0000026936034,0.0005142413,0.00100117],"genre_scores_gemma":[0.7494568,0.00008051923,0.24924794,0.00014007927,0.0009304739,0.0000028871707,0.000010115851,0.00006212115,0.000069025555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.000008177551,0.00041691435,0.00012338691,0.00020126555,0.0003941853],"domain_scores_gemma":[0.999226,0.0003390176,0.00012139785,0.00007970773,0.00010043738,0.00013347024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069148996,0.00017610667,0.00020135852,0.00035476807,0.000466778,0.00029998855,0.000114484305,0.00008762117,0.0000062276054],"category_scores_gemma":[0.00024060902,0.0001606677,0.000081289,0.00039189626,0.000018563913,0.00029568293,0.0000426311,0.0004128856,0.00002104074],"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.0000068799295,0.0000025398986,0.00030868585,0.00003167555,0.000038969833,0.0000058936203,0.0008662248,0.94580793,0.000032879387,0.00024048254,0.00007224431,0.052585617],"study_design_scores_gemma":[0.0006674006,0.00004460576,0.00054822,0.00028228076,0.000009388427,0.00005696753,0.0006261099,0.99667364,0.0002863987,0.00020529582,0.00038920133,0.00021050162],"about_ca_topic_score_codex":6.600938e-7,"about_ca_topic_score_gemma":2.195774e-7,"teacher_disagreement_score":0.32681608,"about_ca_system_score_codex":0.000086317785,"about_ca_system_score_gemma":0.000023021066,"threshold_uncertainty_score":0.65518385},"labels":[],"label_agreement":null},{"id":"W4385309960","doi":"10.1142/9789811234378_0048","title":"SHIFT REGISTER CODERS — THE GOLOMB ALGORITHM","year":2023,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Golomb coding; Register (sociolinguistics); Computer science; Shift register; Algorithm; Arithmetic; Speech recognition; Mathematics; Telecommunications; Artificial intelligence; Linguistics; Philosophy","score_opus":0.027202910194462457,"score_gpt":0.22011432372891906,"score_spread":0.19291141353445662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385309960","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022447546,0.00027027112,0.008530653,0.00020469747,0.008605772,0.0003371244,0.00009773429,0.0012840647,0.9806674],"genre_scores_gemma":[0.000101750105,0.000004811491,0.0062734783,0.00013195197,0.00039361103,0.000029295237,0.00011325648,0.00019710147,0.99275476],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979667,0.000016899225,0.00042721964,0.0005633241,0.00059879024,0.00042706158],"domain_scores_gemma":[0.99853283,0.00012306767,0.00010129001,0.0010191413,0.00008403869,0.00013965362],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061487214,0.00041319348,0.00032881764,0.0004648035,0.0004269526,0.00053981476,0.0006143773,0.00020784914,0.00036432195],"category_scores_gemma":[0.000008379726,0.00033605425,0.00022952726,0.00012605099,0.0005119847,0.000040357063,0.00010861685,0.0006890411,0.0020631072],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000008942395,0.0000120505565,0.000002041827,0.00019983204,0.0005545684,0.00015498172,0.0038682178,0.029756902,0.000023090754,0.16556212,0.6911937,0.10866353],"study_design_scores_gemma":[0.000156881,0.0000055771884,0.0000019750275,0.00017327708,0.00006367422,0.0000047801836,0.000030384528,0.068812676,0.00006266249,0.006261524,0.92393583,0.00049077795],"about_ca_topic_score_codex":0.0000022860524,"about_ca_topic_score_gemma":0.00043641872,"teacher_disagreement_score":0.23274209,"about_ca_system_score_codex":0.00008510659,"about_ca_system_score_gemma":0.000064088235,"threshold_uncertainty_score":0.99990916},"labels":[],"label_agreement":null},{"id":"W4385688029","doi":"10.1016/j.engappai.2023.106853","title":"Learn-to-supervise: Causal reinforcement learning for high-level control in industrial processes","year":2023,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"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; Natural Resources Canada","funders":"","keywords":"Reinforcement learning; Computer science; Supervisor; Interpretability; Process (computing); Machine learning; Artificial intelligence; Markov decision process; Supervisory control; Performance indicator; Control (management); Markov process","score_opus":0.04855972969326748,"score_gpt":0.27406734521716397,"score_spread":0.22550761552389648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385688029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01129586,0.000035355642,0.9871772,0.00011177003,0.0001768211,0.0007040152,0.000016487214,0.00045832634,0.000024148045],"genre_scores_gemma":[0.9702427,0.00002624136,0.028357394,0.000009389648,0.00018531785,0.0010155578,0.000055309076,0.000042518222,0.00006562346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888784,0.000006545085,0.00046858116,0.00019310304,0.00014759663,0.00029633468],"domain_scores_gemma":[0.9993131,0.00026369878,0.00003564515,0.00016968184,0.0001366259,0.00008121803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029681108,0.00014219776,0.0001956342,0.0003918558,0.0000554131,0.000030854884,0.00020342614,0.00009483296,0.000017745255],"category_scores_gemma":[0.00043752912,0.0001704232,0.000031183623,0.0015128782,0.000016524691,0.000068789304,0.000021080767,0.00018716732,0.000071766575],"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.000010480427,0.000012922392,0.00002691972,0.00008184447,0.000013894255,3.2732393e-7,0.00024226733,0.97316307,0.0014301343,0.002140596,0.000034060264,0.02284351],"study_design_scores_gemma":[0.000084409025,0.000042497435,0.00003463929,0.000049022077,0.000008428611,3.6934026e-7,0.00020624918,0.9715012,0.02697,0.00020487065,0.00072173314,0.00017659919],"about_ca_topic_score_codex":0.000027511129,"about_ca_topic_score_gemma":0.000010403641,"teacher_disagreement_score":0.95894676,"about_ca_system_score_codex":0.000053380274,"about_ca_system_score_gemma":0.00004334791,"threshold_uncertainty_score":0.6949656},"labels":[],"label_agreement":null},{"id":"W4385768749","doi":"10.1080/00207543.2023.2230489","title":"Integrated job-shop scheduling in an FMS with heterogeneous transporters: MILP formulation, constraint programming, and branch-and-bound","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; HEC Montréal","funders":"","keywords":"Integer programming; Job shop scheduling; Scheduling (production processes); Mathematical optimization; Computer science; Homogeneous; Constraint programming; Branch and bound; Linear programming; Upper and lower bounds; Bounding overwatch; Distributed computing; Mathematics; Schedule; Artificial intelligence; Stochastic programming","score_opus":0.05718571718002383,"score_gpt":0.34495788130926214,"score_spread":0.2877721641292383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385768749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9916461,0.00018209312,0.006631763,0.0008755213,0.00041770752,0.00015668539,0.0000029412565,0.00006795984,0.000019202049],"genre_scores_gemma":[0.98618495,0.0002729263,0.0131770335,0.00000804954,0.0002676609,0.000010067618,0.000018988829,0.00002251292,0.000037777525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986214,0.000045703684,0.00036946332,0.00017524337,0.00058396574,0.00020419381],"domain_scores_gemma":[0.99876577,0.00003969423,0.000057765817,0.00007923177,0.00095151167,0.00010605083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011219985,0.00010195627,0.00013832438,0.00085491705,0.00006603897,0.00018611264,0.0001435565,0.000059379236,0.000016159633],"category_scores_gemma":[0.000092009686,0.00008781365,0.000023215523,0.00051600696,0.00011852324,0.0004300691,0.000013233943,0.0004191645,0.0000024721164],"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.00036060484,0.00010389014,0.048667405,0.00007826474,0.00024397645,0.00019644311,0.0041576764,0.8266597,0.006391518,0.00032740706,0.000025503623,0.11278764],"study_design_scores_gemma":[0.0036809037,0.0008165703,0.032205444,0.0008788309,0.000034298286,0.0022887294,0.0067670178,0.93430096,0.015892705,0.0012973564,0.0012733635,0.00056384964],"about_ca_topic_score_codex":0.000015933974,"about_ca_topic_score_gemma":0.00006784582,"teacher_disagreement_score":0.11222379,"about_ca_system_score_codex":0.0000932338,"about_ca_system_score_gemma":0.00007001828,"threshold_uncertainty_score":0.35809368},"labels":[],"label_agreement":null},{"id":"W4385834253","doi":"10.23919/cisti58278.2023.10211659","title":"Optimization of the Task Allocation Process in VEC with the GWO Bioinspired Algorithm","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Task (project management); Computer science; Process (computing); Optimization algorithm; Algorithm; Mathematical optimization; Engineering; Mathematics; Systems engineering","score_opus":0.007126763248366782,"score_gpt":0.21000281754571193,"score_spread":0.20287605429734515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385834253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057049632,0.000057395024,0.9381491,0.0016627593,0.0003048329,0.0004876465,0.00000713015,0.00061259913,0.0016689132],"genre_scores_gemma":[0.94771355,0.00005080272,0.05161722,0.00008583289,0.00004509273,0.00006648162,0.000034850724,0.000038282695,0.00034785795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994979,0.000017503386,0.0001331392,0.000087733446,0.00015488915,0.0001088415],"domain_scores_gemma":[0.9996954,0.000028495146,0.000029436822,0.00016552483,0.00006609656,0.000015020327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013250511,0.00007532605,0.00007048876,0.00007177382,0.00004425149,0.00001792408,0.00014768164,0.00003985512,0.0000151262475],"category_scores_gemma":[0.00001848437,0.000040849318,0.000016743741,0.0012443553,0.000032278218,0.00007319916,0.000012284373,0.000073155454,0.000006820956],"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.0000014716725,0.000006546935,0.00018647485,0.000013100726,0.0000068640825,2.0530503e-7,0.00053790805,0.9966684,0.000030476234,0.000025439085,0.00008835046,0.0024347596],"study_design_scores_gemma":[0.00021568793,0.000008555118,0.001101861,0.00002186242,0.0000059393406,9.25293e-7,0.0005380279,0.99609953,0.00190236,0.000011318634,0.000030249626,0.00006365712],"about_ca_topic_score_codex":0.000011212649,"about_ca_topic_score_gemma":0.000017217475,"teacher_disagreement_score":0.8906639,"about_ca_system_score_codex":0.000018494666,"about_ca_system_score_gemma":0.000024798195,"threshold_uncertainty_score":0.16657868},"labels":[],"label_agreement":null},{"id":"W4385971511","doi":"10.11606/d.18.2021.tde-17082023-144657","title":"The no-wait flow shop scheduling problem with sequence-dependent setup times: a comprehensive review and an application of the ALNS algorithm","year":2021,"lang":"en","type":"review","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Universidade de São Paulo; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Flow shop scheduling; Computer science; Sequence (biology); Scheduling (production processes); Job shop scheduling; Mathematical optimization; Operations research; Algorithm; Mathematics; Schedule","score_opus":0.02621626670403507,"score_gpt":0.2892889841210672,"score_spread":0.2630727174170321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385971511","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.344187e-7,0.92676646,0.07076199,0.000060310573,0.0001123987,0.0016440754,0.00005981326,0.00015696217,0.00043785386],"genre_scores_gemma":[2.423731e-7,0.7908688,0.2082382,0.00006654022,0.00008343698,0.000292771,0.00014932107,0.00007461329,0.00022605078],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980559,0.00018302367,0.0007018886,0.00044218087,0.0003487863,0.00026822393],"domain_scores_gemma":[0.9981866,0.0001803968,0.0002699427,0.0008403128,0.00041880144,0.000103963146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031271274,0.00046833724,0.0011858192,0.000049700724,0.00019643485,0.000112772745,0.0004660452,0.00019940946,0.00004225831],"category_scores_gemma":[0.000028712524,0.00024359829,0.00018748896,0.0005773144,0.00011225858,0.000106440835,0.000107375316,0.0005124933,0.000019735378],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5863126e-7,0.000016103722,3.713362e-7,0.017838664,0.00028006686,0.0000016152725,0.000039011364,0.016703717,4.6703866e-7,0.00010804747,0.00010189265,0.9649096],"study_design_scores_gemma":[0.00016479506,0.00003603514,1.5294046e-7,0.02265856,0.0013564238,0.0001503117,0.0001111723,0.5164471,0.0000047093245,0.000013581474,0.45854196,0.000515158],"about_ca_topic_score_codex":0.000013220294,"about_ca_topic_score_gemma":0.000009396424,"teacher_disagreement_score":0.96439445,"about_ca_system_score_codex":0.00008156537,"about_ca_system_score_gemma":0.00019803504,"threshold_uncertainty_score":0.993365},"labels":[],"label_agreement":null},{"id":"W4386024722","doi":"10.1016/j.cor.2023.106387","title":"Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","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":"HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Mitacs; Canada Foundation for Innovation; Ministère de l'Économie, de la Science et de l'Innovation - Québec; Compute Canada","keywords":"Computer science; Metaheuristic; Job shop scheduling; Heuristics; Scheduling (production processes); Mathematical optimization; Minification; Idle; Sequence (biology); Upper and lower bounds; Computation; Algorithm; Mathematics","score_opus":0.06852410505165776,"score_gpt":0.38000464989123867,"score_spread":0.3114805448395809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386024722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.618733,0.00001307644,0.3790794,0.00033773296,0.00007864121,0.0005267763,0.00001624032,0.0012032976,0.000011872582],"genre_scores_gemma":[0.73074913,0.00001912325,0.268468,0.00006590696,0.00009400596,0.0001439312,0.00030283758,0.000049138976,0.00010789868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981988,0.00018142279,0.0002392263,0.0004387267,0.00046951222,0.0004723185],"domain_scores_gemma":[0.9989208,0.00007497082,0.000008581302,0.00039195543,0.0002255532,0.00037812872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050817896,0.00017566507,0.00015615414,0.0004083593,0.00043844045,0.0005571896,0.0002801275,0.00008903939,0.000018588597],"category_scores_gemma":[0.000052184438,0.00016145727,0.00001904771,0.0008817888,0.000061531144,0.00038339064,0.00008165777,0.00035081734,0.00014406726],"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.000018690373,0.00006556728,0.00053578685,0.000020958174,0.000027277736,0.000012681338,0.0014632378,0.9936047,0.0017301962,0.00031168855,0.000060033028,0.0021491759],"study_design_scores_gemma":[0.0005533181,0.00014884507,0.0067858305,0.000043319353,0.000005613638,0.000008107456,0.00036341714,0.99160033,0.00026798306,0.000010894817,0.0000141784085,0.00019813754],"about_ca_topic_score_codex":0.00015785405,"about_ca_topic_score_gemma":0.00026795638,"teacher_disagreement_score":0.112016186,"about_ca_system_score_codex":0.00011756772,"about_ca_system_score_gemma":0.00007066449,"threshold_uncertainty_score":0.65840364},"labels":[],"label_agreement":null},{"id":"W4386283241","doi":"10.32920/24058716","title":"Integrated Production, Quality and Inspection Optimization Models for Production Systems with Delayed Failure","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Downtime; Job shop scheduling; Production (economics); Scheduling (production processes); Computer science; Reliability engineering; Quality (philosophy); Operations research; Operations management; Engineering; Economics; Microeconomics","score_opus":0.04508193366669688,"score_gpt":0.26159479139839087,"score_spread":0.216512857731694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386283241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006659748,0.00017587026,0.98323315,0.00058784994,0.0032790483,0.0017704673,0.0000504036,0.0041686916,0.00007474925],"genre_scores_gemma":[0.2154093,0.0006209601,0.776594,0.000012843116,0.0011562633,0.0015998149,0.0022988997,0.00028915436,0.0020187933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833214,0.00005649961,0.00050195615,0.00067989476,0.00022211275,0.0002073778],"domain_scores_gemma":[0.9985991,0.00002704162,0.00014297453,0.00038659072,0.00077277474,0.000071516486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000493068,0.00034214396,0.00035676674,0.0002891415,0.00015841293,0.00019709545,0.00008844634,0.00034884963,0.000002738125],"category_scores_gemma":[0.00013929608,0.00030184464,0.00004439163,0.00042030922,0.000052380718,0.00028593477,0.00003915747,0.00037176136,0.000002294413],"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.000046432913,0.000017159125,0.000021573407,0.00059535156,0.00015992232,1.8391263e-7,0.0003484108,0.9968737,0.000024532326,0.00021685222,0.0015083761,0.00018755649],"study_design_scores_gemma":[0.00023726225,0.00003492214,0.000017636405,0.0002046893,0.00007730001,0.000011409014,0.0011656081,0.99723923,0.00029004292,0.00029545405,0.00003649109,0.00038992902],"about_ca_topic_score_codex":0.00022541599,"about_ca_topic_score_gemma":0.00015925178,"teacher_disagreement_score":0.20874955,"about_ca_system_score_codex":0.00019160222,"about_ca_system_score_gemma":0.00006879695,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W4386304012","doi":"10.32920/24058728","title":"Real-Time Optimization of Production Scheduling: Strategies, Models, and Algorithms","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Production (economics); Mathematical optimization; Job shop scheduling; Job shop; Optimization algorithm; Operations research; Algorithm; Industrial engineering; Flow shop scheduling; Engineering; Mathematics; Schedule; Economics","score_opus":0.03457887576853821,"score_gpt":0.2548764552386413,"score_spread":0.22029757947010306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386304012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005851435,0.00030119342,0.9863725,0.00012050804,0.0013266506,0.00043448474,0.000033022385,0.0021566392,0.003403566],"genre_scores_gemma":[0.014590502,0.005861884,0.97740036,0.0000030686751,0.00029771775,0.000053612537,0.0004780431,0.00014958545,0.0011652383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853224,0.000032541353,0.0005003818,0.00046381046,0.00025596825,0.0002150882],"domain_scores_gemma":[0.99910724,0.000034628974,0.00012064136,0.00042946122,0.00022173645,0.000086302905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030891807,0.00031084652,0.00040887287,0.000286455,0.000047138354,0.000114363735,0.00015803525,0.00039003012,0.000045843142],"category_scores_gemma":[0.000045361285,0.00033220582,0.000065843866,0.00027714204,0.00005353653,0.0002395496,0.00015163489,0.0003410687,0.0000120040295],"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.0000038281482,0.000014783388,0.000003499597,0.00032285805,0.000077405995,9.867974e-7,0.00021294586,0.9980249,0.00014123999,0.0003041954,0.00014533533,0.00074805017],"study_design_scores_gemma":[0.00013981316,0.000013665323,0.0000118993075,0.00015496912,0.000047984773,0.000003142464,0.00026698716,0.9964151,0.0006006015,0.0020278008,0.0000031439695,0.0003149258],"about_ca_topic_score_codex":0.00010887063,"about_ca_topic_score_gemma":0.0000036105728,"teacher_disagreement_score":0.008972151,"about_ca_system_score_codex":0.000056862642,"about_ca_system_score_gemma":0.00010584944,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W4386304299","doi":"10.32920/24058728.v1","title":"Real-Time Optimization of Production Scheduling: Strategies, Models, and Algorithms","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Scheduling (production processes); Computer science; Production (economics); Mathematical optimization; Job shop scheduling; Job shop; Optimization algorithm; Operations research; Algorithm; Industrial engineering; Flow shop scheduling; Engineering; Mathematics; Schedule; Economics","score_opus":0.03457887576853821,"score_gpt":0.2548764552386413,"score_spread":0.22029757947010306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386304299","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005851435,0.00030119342,0.9863725,0.00012050804,0.0013266506,0.00043448474,0.000033022385,0.0021566392,0.003403566],"genre_scores_gemma":[0.014590502,0.005861884,0.97740036,0.0000030686751,0.00029771775,0.000053612537,0.0004780431,0.00014958545,0.0011652383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853224,0.000032541353,0.0005003818,0.00046381046,0.00025596825,0.0002150882],"domain_scores_gemma":[0.99910724,0.000034628974,0.00012064136,0.00042946122,0.00022173645,0.000086302905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030891807,0.00031084652,0.00040887287,0.000286455,0.000047138354,0.000114363735,0.00015803525,0.00039003012,0.000045843142],"category_scores_gemma":[0.000045361285,0.00033220582,0.000065843866,0.00027714204,0.00005353653,0.0002395496,0.00015163489,0.0003410687,0.0000120040295],"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.0000038281482,0.000014783388,0.000003499597,0.00032285805,0.000077405995,9.867974e-7,0.00021294586,0.9980249,0.00014123999,0.0003041954,0.00014533533,0.00074805017],"study_design_scores_gemma":[0.00013981316,0.000013665323,0.0000118993075,0.00015496912,0.000047984773,0.000003142464,0.00026698716,0.9964151,0.0006006015,0.0020278008,0.0000031439695,0.0003149258],"about_ca_topic_score_codex":0.00010887063,"about_ca_topic_score_gemma":0.0000036105728,"teacher_disagreement_score":0.008972151,"about_ca_system_score_codex":0.000056862642,"about_ca_system_score_gemma":0.00010584944,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W4386304409","doi":"10.32920/24058716.v1","title":"Integrated Production, Quality and Inspection Optimization Models for Production Systems with Delayed Failure","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Downtime; Job shop scheduling; Production (economics); Scheduling (production processes); Computer science; Reliability engineering; Quality (philosophy); Operations research; Operations management; Engineering; Economics; Microeconomics","score_opus":0.04508193366669688,"score_gpt":0.26159479139839087,"score_spread":0.216512857731694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386304409","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006659748,0.00017587026,0.98323315,0.00058784994,0.0032790483,0.0017704673,0.0000504036,0.0041686916,0.00007474925],"genre_scores_gemma":[0.2154093,0.0006209601,0.776594,0.000012843116,0.0011562633,0.0015998149,0.0022988997,0.00028915436,0.0020187933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833214,0.00005649961,0.00050195615,0.00067989476,0.00022211275,0.0002073778],"domain_scores_gemma":[0.9985991,0.00002704162,0.00014297453,0.00038659072,0.00077277474,0.000071516486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000493068,0.00034214396,0.00035676674,0.0002891415,0.00015841293,0.00019709545,0.00008844634,0.00034884963,0.000002738125],"category_scores_gemma":[0.00013929608,0.00030184464,0.00004439163,0.00042030922,0.000052380718,0.00028593477,0.00003915747,0.00037176136,0.000002294413],"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.000046432913,0.000017159125,0.000021573407,0.00059535156,0.00015992232,1.8391263e-7,0.0003484108,0.9968737,0.000024532326,0.00021685222,0.0015083761,0.00018755649],"study_design_scores_gemma":[0.00023726225,0.00003492214,0.000017636405,0.0002046893,0.00007730001,0.000011409014,0.0011656081,0.99723923,0.00029004292,0.00029545405,0.00003649109,0.00038992902],"about_ca_topic_score_codex":0.00022541599,"about_ca_topic_score_gemma":0.00015925178,"teacher_disagreement_score":0.20874955,"about_ca_system_score_codex":0.00019160222,"about_ca_system_score_gemma":0.00006879695,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W4386410419","doi":"10.32657/10356/169909","title":"An approximation approach to simultaneous scheduling and routing in smart factories","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cybernet Systems Corporation (Canada)","funders":"","keywords":"Testbed; Automation; Scheduling (production processes); Job shop; Bridge (graph theory); Vehicle routing problem; Engineering; Job shop scheduling; Manufacturing engineering; Computer science; Routing (electronic design automation); Industrial engineering; Operations research; Operations management; Embedded system; Flow shop scheduling; Computer network","score_opus":0.01367152982237635,"score_gpt":0.2502514744120011,"score_spread":0.23657994458962472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386410419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7992497,0.00011932287,0.18728806,0.0000084287685,0.001246139,0.00065183715,0.000011709781,0.0020346728,0.009390137],"genre_scores_gemma":[0.7981045,0.000037960817,0.19904213,0.000012815711,0.00011248224,0.00006246113,0.001428964,0.00012434616,0.0010743141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988946,0.000019287892,0.00032940827,0.00033071454,0.00017999668,0.00024602737],"domain_scores_gemma":[0.99953395,0.00009063761,0.00003696792,0.00016574268,0.000066370856,0.00010630811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014768219,0.00025772804,0.00026800312,0.00032630312,0.00006514408,0.00016608946,0.00011028633,0.00028362268,0.000007669779],"category_scores_gemma":[0.0001875107,0.0002790714,0.000025004423,0.00041970136,0.000005714422,0.00013746935,0.000008866098,0.00028281304,0.000024097246],"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.0000076588285,0.000016712913,0.0001510657,0.00020001428,0.0000145593685,0.0000018888129,0.0059298454,0.98525065,0.00018577451,0.00021398898,0.0000036425406,0.008024224],"study_design_scores_gemma":[0.00013311427,0.000012199916,0.00053960993,0.00008698112,0.000010405061,0.0000010727184,0.009918529,0.9884968,0.00043774347,0.000028262575,0.0000070947344,0.00032822468],"about_ca_topic_score_codex":0.00006976493,"about_ca_topic_score_gemma":0.000146898,"teacher_disagreement_score":0.0117540695,"about_ca_system_score_codex":0.00006410535,"about_ca_system_score_gemma":0.000020715743,"threshold_uncertainty_score":0.99996614},"labels":[],"label_agreement":null},{"id":"W4386773691","doi":"10.5267/j.ijiec.2023.6.003","title":"A dynamic scheduling method with Conv-Dueling and generalized representation based on reinforcement learning","year":2023,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Rate-monotonic scheduling; Reinforcement learning; Fair-share scheduling; Mathematical optimization; Artificial intelligence; Schedule; Mathematics","score_opus":0.026771620490980648,"score_gpt":0.295867984628311,"score_spread":0.26909636413733035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386773691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081740625,0.000023413533,0.91647696,0.00036442128,0.0010477615,0.00008214998,0.000002467976,0.00021271888,0.00004946079],"genre_scores_gemma":[0.7708068,0.000031765616,0.22878914,0.000029674133,0.00023753117,0.000005985715,0.000046574893,0.00003372838,0.000018799756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988969,0.000033201835,0.00041716997,0.00010859638,0.0004089898,0.00013513895],"domain_scores_gemma":[0.9990824,0.00035443273,0.00013584776,0.000058264115,0.00028610489,0.00008297659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036280826,0.00013449666,0.00017286347,0.0006893592,0.000056785426,0.00011769453,0.00012762618,0.00006988248,0.000012188421],"category_scores_gemma":[0.0003039192,0.0001301823,0.000055124463,0.00042257385,0.000011548268,0.00015013802,0.00001569657,0.00038439428,0.000004048018],"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.000040860778,0.0000068087907,0.000121166486,0.000005153445,0.00013340935,0.00002564089,0.00014678363,0.99402523,0.00027577722,0.0001142686,0.00002013264,0.005084768],"study_design_scores_gemma":[0.0018734755,0.000084831685,0.0001243996,0.00022067469,0.000026108075,0.000039523344,0.0001187046,0.9968775,0.0003874967,0.000016615244,0.00010108649,0.00012961816],"about_ca_topic_score_codex":0.0000042231804,"about_ca_topic_score_gemma":3.3048047e-7,"teacher_disagreement_score":0.6890662,"about_ca_system_score_codex":0.000109967266,"about_ca_system_score_gemma":0.0000543014,"threshold_uncertainty_score":0.530868},"labels":[],"label_agreement":null},{"id":"W4386886278","doi":"10.1016/j.ejor.2023.09.020","title":"Learning and forgetting interactions within a collaborative human-centric manufacturing network","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Forgetting; Computer science; Outsourcing; Scheduling (production processes); Operations research; Latency (audio); Learning effect; Job shop scheduling; Distributed computing; Mathematical optimization; Industrial engineering","score_opus":0.04692789415053551,"score_gpt":0.3463791153955399,"score_spread":0.2994512212450044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386886278","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97325367,0.0005578027,0.010454361,0.0006745314,0.00070591504,0.00017040806,0.0000034861075,0.0001607824,0.014019017],"genre_scores_gemma":[0.9817357,0.00018761866,0.016045684,0.000014672608,0.0007630976,0.0000019085198,0.000010415329,0.000037693768,0.0012032174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998481,0.0004553616,0.00034394977,0.000090795475,0.00040798468,0.00022091759],"domain_scores_gemma":[0.9990588,0.00029779738,0.00005766052,0.000045296834,0.00043137654,0.000109093286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031658674,0.000077185025,0.00010307707,0.00035019845,0.0005311049,0.00024403117,0.000108011256,0.0000134752945,0.00006541652],"category_scores_gemma":[0.00041433732,0.00007111959,0.000026027412,0.00061310705,0.000038773283,0.00024156357,0.000057827638,0.0007382351,0.00005889729],"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.000009936219,0.0000061940445,0.00041376392,0.000010792539,0.000043402277,0.000093288734,0.001274718,0.99232996,0.0008437053,0.00023543151,0.001986211,0.0027525793],"study_design_scores_gemma":[0.0014837967,0.00042070448,0.010517811,0.0004231242,0.000017783324,0.000233309,0.006623122,0.9524211,0.0042384127,0.00021041548,0.023057317,0.00035305705],"about_ca_topic_score_codex":4.92377e-7,"about_ca_topic_score_gemma":0.0000011665888,"teacher_disagreement_score":0.03990883,"about_ca_system_score_codex":0.0000545122,"about_ca_system_score_gemma":0.000048278762,"threshold_uncertainty_score":0.40848833},"labels":[],"label_agreement":null},{"id":"W4387224047","doi":"10.2139/ssrn.4588419","title":"A Progressive Hedging-Based Matheuristic for the Stochastic Production Routing Problem with Adaptive Routing","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"HEC Montréal","funders":"","keywords":"Production (economics); Routing (electronic design automation); Computer science; Mathematical optimization; Economics; Mathematics; Microeconomics; Computer network","score_opus":0.016739728798494103,"score_gpt":0.2399897422962807,"score_spread":0.2232500134977866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387224047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026562815,0.0019713002,0.99153924,0.00070498814,0.0010011976,0.0014484192,0.000011522534,0.00065113796,0.000015933143],"genre_scores_gemma":[0.9614473,0.00012124435,0.035712723,0.000013104426,0.0015010173,0.0005985491,0.00003718676,0.00026071386,0.0003081859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967158,0.000062208885,0.00046947345,0.00043756247,0.0003786784,0.0019362886],"domain_scores_gemma":[0.99856865,0.0002700434,0.00041691156,0.00031026657,0.0003601996,0.00007392452],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0019444766,0.0004289406,0.0003516204,0.00018693983,0.00054951565,0.00024936692,0.00039914844,0.00018114643,0.0000024998947],"category_scores_gemma":[0.00030683225,0.00030725214,0.00016753866,0.00030309308,0.000064510125,0.000079016514,0.00006837188,0.003756931,0.0000073510946],"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.00007649834,0.000019747955,0.000014969019,0.00008112162,0.00048739032,0.00000348058,0.0004336729,0.9921855,0.0000033953045,0.0016809711,0.00001603535,0.0049972255],"study_design_scores_gemma":[0.0005431169,0.0002030164,0.00001565794,0.0008520291,0.00031002297,0.00020888733,0.0019382227,0.9802603,0.000034293098,0.015240607,0.000003853219,0.00038999162],"about_ca_topic_score_codex":0.000012610996,"about_ca_topic_score_gemma":0.000065170425,"teacher_disagreement_score":0.958791,"about_ca_system_score_codex":0.0012178451,"about_ca_system_score_gemma":0.001975572,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W4387260747","doi":"10.23952/jnva.7.2023.5.01","title":"Editorial: A special issue on vector and set optimization in applications","year":2023,"lang":"en","type":"editorial","venue":"Journal of Nonlinear and Variational Analysis","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Computer science; Vector (molecular biology); Vector optimization; Algorithm; Optimization problem; Programming language; Biology; Multi-swarm optimization; Recombinant DNA; Genetics","score_opus":0.0069100599434717075,"score_gpt":0.2564650616573943,"score_spread":0.2495550017139226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260747","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014695671,0.00013320855,0.050339796,0.00015789176,0.94868994,0.000098288714,0.0004217994,0.000039452138,0.0001049387],"genre_scores_gemma":[0.000009636758,0.0014277757,0.030182617,0.0000073670017,0.96754336,0.000008845395,0.00068414595,0.000034445406,0.00010180446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998392,0.000044645265,0.00061152066,0.00018171343,0.0006432182,0.00012690456],"domain_scores_gemma":[0.9983104,0.00079540815,0.00025734355,0.00009976397,0.00043610964,0.00010101346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051818375,0.00019248383,0.0004945906,0.0009905704,0.000058941812,0.00011154803,0.00011170644,0.00041324648,0.0000833694],"category_scores_gemma":[0.00048498774,0.00018322527,0.00013356454,0.0010747041,0.000018975974,0.00010867536,0.00001938337,0.0005656649,0.000008573015],"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.00001914271,0.000021663589,0.00001640346,0.00002106205,0.00041741016,0.0000016300663,0.00006540488,0.62770534,3.5560183e-7,0.000010240116,0.3714494,0.00027191686],"study_design_scores_gemma":[0.0004320881,0.00003744599,0.000088833876,0.000031361127,0.0005471925,6.5299383e-7,0.000024799197,0.59917295,5.55004e-7,0.000037415546,0.39947906,0.0001476061],"about_ca_topic_score_codex":0.000012826769,"about_ca_topic_score_gemma":0.000020211904,"teacher_disagreement_score":0.028532382,"about_ca_system_score_codex":0.000092168375,"about_ca_system_score_gemma":0.00010754318,"threshold_uncertainty_score":0.747171},"labels":[],"label_agreement":null},{"id":"W4387427604","doi":"10.48550/arxiv.2310.03195","title":"Deep reinforcement learning for machine scheduling: Methodology, the state-of-the-art, and future directions","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Reinforcement learning; Machine learning; Scheduling (production processes); Job shop scheduling; Heuristics; Interpretability; Scalability; Mathematical optimization; Schedule","score_opus":0.07368779149999558,"score_gpt":0.2219055828409262,"score_spread":0.14821779134093063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013989486,0.00058872876,0.9827715,0.00021842854,0.0015101508,0.00038807973,0.000008332988,0.0003105265,0.00021473713],"genre_scores_gemma":[0.8994606,0.010645941,0.0781463,0.00007570845,0.00049625203,0.000021320066,0.00014450582,0.00016321865,0.010846117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991809,0.00011254076,0.00017839677,0.0002894991,0.00004810307,0.00019056478],"domain_scores_gemma":[0.999062,0.0003319711,0.00011825604,0.00034063103,0.000093115756,0.000054009506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038802685,0.00019164606,0.00022116514,0.00010281822,0.00024033585,0.000028129594,0.00029430032,0.0001560136,0.000014131358],"category_scores_gemma":[0.000110335975,0.00015729904,0.0001495244,0.00033502397,0.00008682603,0.000042903845,0.0002847317,0.0005965758,0.0000054124625],"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.000013525217,0.000004262611,0.0002528677,0.00009151059,0.00015320574,0.00000146425,0.0003614657,0.9967311,0.0000059404924,0.0010883003,0.00003379337,0.0012625379],"study_design_scores_gemma":[0.00025856995,0.00001589159,0.00020356328,0.000033740227,0.00012845051,0.0000014227453,0.00031044835,0.99378544,0.00010248959,0.0022287485,0.002766982,0.00016424198],"about_ca_topic_score_codex":0.000033696986,"about_ca_topic_score_gemma":0.000064087195,"teacher_disagreement_score":0.90462524,"about_ca_system_score_codex":0.000060748014,"about_ca_system_score_gemma":0.000029975929,"threshold_uncertainty_score":0.6414469},"labels":[],"label_agreement":null},{"id":"W4387625863","doi":"10.46254/bd05.20220035","title":"Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization","year":2022,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Scheduling (production processes); Humanity; Computer science; Job shop scheduling; Operations research; Service (business); Field (mathematics); Industrial engineering; Knowledge management; Distributed computing; Operations management; Engineering; Computer network; Business; Mathematics; Marketing; Political science","score_opus":0.02513778469328242,"score_gpt":0.24614814604170165,"score_spread":0.22101036134841923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387625863","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015301286,0.00020569909,0.98295945,0.00012931891,0.00030970032,0.00054799893,0.00004318015,0.00037030008,0.00013308536],"genre_scores_gemma":[0.006974978,0.000019697656,0.9919491,0.00024499296,0.00008659303,0.000076745026,0.00019439647,0.00006634835,0.0003871579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990342,0.000037280424,0.00025940264,0.00025561458,0.00016141946,0.0002520821],"domain_scores_gemma":[0.9994986,0.00009890253,0.00004570075,0.00015249944,0.00011687669,0.0000874337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026925205,0.0001876808,0.00021342385,0.00011406914,0.00031756458,0.0000708233,0.00010779727,0.00005710529,0.0003939699],"category_scores_gemma":[0.000045099605,0.00020262916,0.000049869668,0.00026164958,0.0000135864,0.00013342226,0.000065032465,0.00012096888,0.000009686615],"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.000045232424,0.000029704888,0.0000065471304,0.000048394155,0.000042497573,8.841747e-7,0.00025702702,0.99794984,0.0012898988,0.0000074521868,0.000042760366,0.00027974052],"study_design_scores_gemma":[0.0029850535,0.000026717458,8.1931853e-7,0.000016055092,0.00004134496,0.00000942655,0.00040575315,0.9956828,0.0004255966,0.0000038767216,0.00014403282,0.0002585514],"about_ca_topic_score_codex":0.000046209596,"about_ca_topic_score_gemma":0.0000062669865,"teacher_disagreement_score":0.008989659,"about_ca_system_score_codex":0.00014202106,"about_ca_system_score_gemma":0.00003113082,"threshold_uncertainty_score":0.82629776},"labels":[],"label_agreement":null},{"id":"W4387643581","doi":"10.1016/j.cie.2023.109686","title":"A decision support system for sequencing production in the manufacturing industry","year":2023,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","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":"Polytechnique Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Production (economics); Context (archaeology); Decision support system; Computer science; Operations research; Population; Point (geometry); Planner; Range (aeronautics); Machine learning; Engineering; Industrial engineering; Artificial intelligence; Economics; Mathematics","score_opus":0.0379652458981427,"score_gpt":0.23419369986149738,"score_spread":0.19622845396335467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387643581","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7796494,0.000024027691,0.20794697,0.00009665419,0.00966604,0.00073474046,0.000007826854,0.0018152521,0.000059127025],"genre_scores_gemma":[0.97936636,0.000004581855,0.018876527,0.000014077503,0.0015185849,0.00010814821,0.000034995857,0.000057791538,0.000018907433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988528,0.00001665693,0.00034088304,0.00022743424,0.00019918729,0.00036306554],"domain_scores_gemma":[0.99943525,0.00022649101,0.000031154716,0.00022754204,0.000021689357,0.00005786575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006926004,0.00018789194,0.00019032626,0.00035627242,0.000076037206,0.00009789202,0.0002516159,0.0002934116,0.0000021962278],"category_scores_gemma":[0.0001136885,0.00017225496,0.000064484484,0.0006339039,0.000007817134,0.00014965655,0.00003168727,0.00059397245,0.000013902516],"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.0000056681515,0.0000023155503,0.000026159554,0.000052951113,0.000014143984,0.000013112655,0.00035133347,0.97809434,0.00015695355,0.00003232615,0.00070088624,0.020549826],"study_design_scores_gemma":[0.0006759487,0.000026153415,0.00010464058,0.00029265383,0.000011364681,0.000035670113,0.0006510125,0.9906666,0.0062858495,0.0000061273595,0.001026914,0.00021706278],"about_ca_topic_score_codex":0.000004552661,"about_ca_topic_score_gemma":7.2745064e-7,"teacher_disagreement_score":0.19971703,"about_ca_system_score_codex":0.00027677845,"about_ca_system_score_gemma":0.000032303513,"threshold_uncertainty_score":0.7024353},"labels":[],"label_agreement":null},{"id":"W4387914124","doi":"10.1109/codit58514.2023.10284382","title":"Integration of Machine Scheduling and Personnel Allocation for an Industrial-Scale Analytical Services Facility","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Scheduling (production processes); Dual (grammatical number); Job shop scheduling; Mathematical optimization; Scale (ratio); Industrial engineering; Operations research; Distributed computing; Engineering; Mathematics","score_opus":0.04379048755482978,"score_gpt":0.2732032100733885,"score_spread":0.2294127225185587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387914124","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7301193,0.0000228452,0.26915312,0.00007241963,0.00008797733,0.00012756113,0.000033902536,0.0002654358,0.00011748936],"genre_scores_gemma":[0.9506456,0.00001870746,0.04891195,0.000012711046,0.00004520994,0.000012196528,0.00028451887,0.000008764324,0.00006033424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953663,0.000011700624,0.00016701318,0.00011792314,0.0000749676,0.00009173801],"domain_scores_gemma":[0.999728,0.00004643668,0.000017952492,0.000090331174,0.00006535516,0.00005187727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024432622,0.000072798626,0.00010755018,0.00009274602,0.00004153925,0.000027075901,0.00004652267,0.00008411454,0.000016704234],"category_scores_gemma":[0.00003445868,0.00006679135,0.000022545999,0.00023130073,0.000015174205,0.0001420353,0.000008451711,0.00006293901,0.000003839002],"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.00004262722,0.000047558766,0.0036927422,0.00024924125,0.000059729595,1.7104382e-7,0.004246154,0.9220748,0.009280176,0.00067565637,0.000047681868,0.059583478],"study_design_scores_gemma":[0.00029329382,0.00003149283,0.00058141927,0.000012576435,0.000014291691,3.7043836e-7,0.0025891443,0.9932745,0.0030714844,0.00004359284,0.000016922759,0.00007090743],"about_ca_topic_score_codex":0.00005694813,"about_ca_topic_score_gemma":0.00007982883,"teacher_disagreement_score":0.22052635,"about_ca_system_score_codex":0.000012034949,"about_ca_system_score_gemma":0.0000066949838,"threshold_uncertainty_score":0.2723672},"labels":[],"label_agreement":null},{"id":"W4387914496","doi":"10.1109/codit58514.2023.10284480","title":"Application of Reinforcement Learning with Recurrent Neural Networks for Optimal Scheduling of Flow-Shop Systems Under Uncertainty","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Reinforcement learning; Computer science; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Artificial neural network; Time horizon; Artificial intelligence; Schedule; Novelty; Mathematical optimization; Machine learning; Industrial engineering; Engineering; Mathematics","score_opus":0.015451091222460482,"score_gpt":0.24261221162502353,"score_spread":0.22716112040256303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387914496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03198524,0.00009165051,0.9669227,0.000017376235,0.00021056255,0.00035852258,0.0000019069693,0.0002951053,0.00011694073],"genre_scores_gemma":[0.9533844,0.00003449377,0.0461574,0.0000037582615,0.00007093138,0.00009896011,0.00013536884,0.000029197416,0.00008546874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991909,0.000012182013,0.00032633523,0.00013136292,0.00015183301,0.00018734449],"domain_scores_gemma":[0.9995012,0.00008954757,0.00008485737,0.0001350607,0.0001454587,0.000043867625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021644577,0.00011445833,0.00018921809,0.00009776104,0.000044487166,0.000015632015,0.00008224341,0.00006204847,0.000006066968],"category_scores_gemma":[0.000016931674,0.000098959266,0.00004469665,0.00038165037,0.000019432302,0.000052997628,0.000016442724,0.00010373493,0.0000016117999],"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.000028566292,0.0000052515643,0.000100837424,0.00013993435,0.00004418646,8.023124e-8,0.000088360444,0.99629295,0.00006498386,0.00050793804,0.000014982243,0.00271192],"study_design_scores_gemma":[0.00047402186,0.000083945684,0.000021040996,0.00005783177,0.00002127706,7.9935046e-7,0.0008263762,0.99821615,0.00015154843,0.0000019176343,0.000031673408,0.00011340202],"about_ca_topic_score_codex":0.000015291855,"about_ca_topic_score_gemma":0.0000017109207,"teacher_disagreement_score":0.9213992,"about_ca_system_score_codex":0.000034795215,"about_ca_system_score_gemma":0.000011609071,"threshold_uncertainty_score":0.40354416},"labels":[],"label_agreement":null},{"id":"W4388191775","doi":"10.18280/mmep.100533","title":"Genetic Algorithm-Driven Optimization of Scheduling and Preventive Measures in Parallel Machines","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Scheduling (production processes); Genetic algorithm; Mathematical optimization; Mathematics; Machine learning","score_opus":0.018171815244710527,"score_gpt":0.21147987776861188,"score_spread":0.19330806252390134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388191775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05239011,0.0006702102,0.94635975,0.000015666468,0.000051139676,0.00016120274,0.000003122249,0.0003104895,0.000038305454],"genre_scores_gemma":[0.2151515,0.0007951672,0.7839352,0.0000014905518,0.000020869627,0.000033993038,0.000005519048,0.0000409162,0.000015364436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991143,0.000011827501,0.00034729167,0.00017322609,0.00013357431,0.00021980758],"domain_scores_gemma":[0.9996821,0.00009034723,0.000026733234,0.00009857678,0.000030075522,0.00007210915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020952674,0.00016623775,0.00025737192,0.00022115491,0.000027908403,0.000033565193,0.000061313185,0.00009155256,0.000003920824],"category_scores_gemma":[0.000033976914,0.00016446091,0.000027770213,0.0003063651,0.000024480305,0.000073680356,0.000027985518,0.00013914598,0.0000025294753],"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.0000011094529,0.000011839928,0.000052497253,0.00047234874,0.000022056647,0.0000015172274,0.00069988956,0.99626887,0.000047866095,0.00022953136,6.8231833e-7,0.0021918046],"study_design_scores_gemma":[0.0002624021,0.0000141109285,0.000049767183,0.00034240357,0.000014895143,0.000006001468,0.00003787725,0.9974235,0.000034807752,0.0016427949,0.0000021252702,0.00016927224],"about_ca_topic_score_codex":0.0000046512682,"about_ca_topic_score_gemma":2.901412e-7,"teacher_disagreement_score":0.1627614,"about_ca_system_score_codex":0.000012185645,"about_ca_system_score_gemma":0.0000047602007,"threshold_uncertainty_score":0.67065215},"labels":[],"label_agreement":null},{"id":"W4388537981","doi":"10.18280/jesa.560501","title":"Application of Ant Colony Optimization for Job Shop Scheduling in the Pharmaceutical Industry","year":2023,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; ANT; Job shop scheduling; Job shop; Scheduling (production processes); Operations research; Industrial engineering; Computer science; Manufacturing engineering; Business; Operations management; Engineering; Flow shop scheduling; Artificial intelligence; Operating system; Schedule","score_opus":0.03125198021880168,"score_gpt":0.30001712210006753,"score_spread":0.2687651418812659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388537981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30639884,0.00037381853,0.6915261,0.00026314214,0.00036632622,0.00041691173,0.00001245824,0.00033143532,0.0003109647],"genre_scores_gemma":[0.86408716,0.00027274716,0.1351532,0.00005849129,0.000249998,0.00006721796,0.000015761701,0.00005411318,0.000041283532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998711,0.00010694511,0.0005372079,0.00011836635,0.00026487323,0.00026158988],"domain_scores_gemma":[0.9992762,0.0002516007,0.0001249442,0.00014379338,0.00013337568,0.00007004667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009892696,0.00013543414,0.00020254403,0.00026071828,0.00013772963,0.00009946658,0.00025533914,0.00015012232,0.000021977014],"category_scores_gemma":[0.0002397298,0.00010991545,0.00007297332,0.00090807705,0.00004750437,0.00017030223,0.000019939222,0.000430101,0.000012900781],"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.0000069281873,0.000018214083,0.00116097,0.00011703243,0.000026131907,0.000006255155,0.00062333513,0.9643599,0.00031137216,0.00023320339,0.00019338199,0.032943327],"study_design_scores_gemma":[0.0005083651,0.000031681793,0.017261973,0.000109879205,0.000027183636,0.000086375054,0.00046800132,0.9808582,0.00021392581,0.00020214087,0.00011856621,0.00011370894],"about_ca_topic_score_codex":0.0000024104415,"about_ca_topic_score_gemma":0.0000013562511,"teacher_disagreement_score":0.55768836,"about_ca_system_score_codex":0.000089844005,"about_ca_system_score_gemma":0.00004048666,"threshold_uncertainty_score":0.4482222},"labels":[],"label_agreement":null},{"id":"W4388902212","doi":"10.1007/s40436-023-00461-1","title":"Energy-efficient buffer and service rate allocation in manufacturing systems using hybrid machine learning and evolutionary algorithms","year":2023,"lang":"en","type":"article","venue":"Advances in Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Energy consumption; Sorting; Computer science; Efficient energy use; Boosting (machine learning); Genetic algorithm; Throughput; Evolutionary algorithm; Multi-objective optimization; Simulated annealing; Algorithm; Engineering; Artificial intelligence; Mathematics","score_opus":0.009209924249311162,"score_gpt":0.23141070937698563,"score_spread":0.22220078512767447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388902212","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576333,0.009236549,0.031787146,0.00004702747,0.0005709598,0.00017338782,0.000009529578,0.00042487745,0.0001171785],"genre_scores_gemma":[0.9905723,0.0032779302,0.005859218,0.000026306563,0.00008195483,0.000029404731,0.000055418135,0.000052844985,0.00004462498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998656,0.0000756541,0.00035327178,0.00036321612,0.00016667617,0.0003852031],"domain_scores_gemma":[0.99957854,0.00014744059,0.000059385333,0.00012016639,0.00001872046,0.000075770346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003408137,0.00024406379,0.00024294082,0.0004591458,0.00013131542,0.00007304385,0.00009015324,0.00006975016,0.000005496897],"category_scores_gemma":[0.000017256567,0.00026655215,0.000018058934,0.00025147633,0.00002704683,0.0003609807,0.00009027866,0.00028563067,0.0000045871766],"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.0000068267095,0.00000673545,0.0009667816,0.00018821383,0.000008183813,0.000027041153,0.00018482606,0.98585105,0.0001578592,0.000015085465,7.7242805e-7,0.012586653],"study_design_scores_gemma":[0.00045740392,0.000009388484,0.0035603598,0.00021864846,0.000006987469,0.000033471893,0.00033973504,0.9872225,0.007112466,0.00012058377,0.0006268972,0.00029159468],"about_ca_topic_score_codex":0.00022362088,"about_ca_topic_score_gemma":0.00006196376,"teacher_disagreement_score":0.032938953,"about_ca_system_score_codex":0.00015102097,"about_ca_system_score_gemma":0.000008696818,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W4389328512","doi":"10.1016/j.cor.2023.106508","title":"A simulation optimization framework to solve Stochastic Flexible Job-Shop Scheduling Problems—Case: Semiconductor manufacturing","year":2023,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Photolithography; Bottleneck; Computer science; Semiconductor device fabrication; Job shop scheduling; Workstation; Scheduling (production processes); Wafer fabrication; Schedule; Context (archaeology); Industrial engineering; Manufacturing engineering; Mathematical optimization; Engineering; Embedded system","score_opus":0.08283912030368493,"score_gpt":0.36332348444336626,"score_spread":0.28048436413968136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389328512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08227085,0.00007431849,0.9145122,0.00035145076,0.00068918953,0.00078325585,0.000012345813,0.0012412122,0.00006517213],"genre_scores_gemma":[0.47858956,0.000018106055,0.5204873,0.00004631271,0.0003535412,0.00015661177,0.00010440785,0.0000773601,0.00016682221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787915,0.00008475674,0.0004041926,0.00045546365,0.0005303133,0.0006461393],"domain_scores_gemma":[0.9981926,0.00063455035,0.000013910616,0.00045171694,0.0004378516,0.00026936305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000758748,0.00022626868,0.00020825032,0.0010837466,0.0007951758,0.00065005687,0.0003001311,0.00018194255,0.000119399614],"category_scores_gemma":[0.00044984822,0.00025269933,0.00005683402,0.0020251567,0.000046861896,0.00040801283,0.00018023659,0.0006306086,0.00046354055],"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.000004212922,0.000015911526,0.000003562554,0.000046960715,0.000033230255,0.00002457057,0.0015661812,0.99549735,0.00022170649,0.00020981385,0.00017375052,0.0022027781],"study_design_scores_gemma":[0.00022334722,0.000041472333,0.000009837457,0.00018329463,0.0000072855773,0.00002150699,0.00045648974,0.9979125,0.0007390667,0.00007660059,0.00005723515,0.00027131525],"about_ca_topic_score_codex":0.00002085853,"about_ca_topic_score_gemma":0.00001158899,"teacher_disagreement_score":0.3963187,"about_ca_system_score_codex":0.00022887622,"about_ca_system_score_gemma":0.00008306422,"threshold_uncertainty_score":0.99999255},"labels":[],"label_agreement":null},{"id":"W4389584871","doi":"10.17118/11143/21053","title":"Digital manufacturing – infrastructure as software framework for datacollection","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software; Data collection; Software engineering; Database; Operating system","score_opus":0.009225370864784381,"score_gpt":0.2383018459029039,"score_spread":0.2290764750381195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389584871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012649729,0.000012241157,0.981888,0.00004604532,0.00082876824,0.00012921654,0.000040087747,0.0023714518,0.0020344614],"genre_scores_gemma":[0.08998178,0.00004279507,0.8984452,0.00014401747,0.00059685146,0.00007741088,0.00057462,0.00010998718,0.010027334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955046,0.0000015035163,0.00009386135,0.00011467632,0.0000781308,0.00016133804],"domain_scores_gemma":[0.9997137,0.00009413257,0.000009441286,0.000118949385,0.000016528786,0.000047229427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002803803,0.000089353984,0.00007097239,0.000095290656,0.00007925409,0.00013008235,0.000075255026,0.00009543712,0.00014345252],"category_scores_gemma":[0.00012661262,0.00008610561,0.000034676257,0.0002167352,0.0000060775915,0.00017962734,0.000018840785,0.000096558266,0.00015386868],"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.0000046959694,0.0000023257276,0.00010764092,0.00003739462,0.000029692192,0.000001366064,0.00008855224,0.93250525,0.000008342211,0.00035306785,0.011178783,0.055682894],"study_design_scores_gemma":[0.00047049322,0.0000417068,0.0012093661,0.00004571752,0.000016146929,0.000012379127,0.00046396191,0.92501813,0.011759578,0.02632982,0.03415959,0.00047313405],"about_ca_topic_score_codex":6.095017e-7,"about_ca_topic_score_gemma":3.7835898e-7,"teacher_disagreement_score":0.08344279,"about_ca_system_score_codex":0.000026026162,"about_ca_system_score_gemma":0.000007802301,"threshold_uncertainty_score":0.3511285},"labels":[],"label_agreement":null},{"id":"W4389830598","doi":"10.5267/j.jpm.2023.11.001","title":"Evaluating procedures in the NEH heuristic for the PFSP - SIST","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Heuristics; Benchmark (surveying); Heuristic; Sequence (biology); Computation; Constraint (computer-aided design); Mathematical optimization; Computer science; Mathematics; Algorithm","score_opus":0.06777915404398799,"score_gpt":0.35990432375219694,"score_spread":0.29212516970820895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389830598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18819314,0.008932142,0.7404384,0.019503977,0.009650959,0.012178351,0.000027102124,0.0010177457,0.020058155],"genre_scores_gemma":[0.91503656,0.0011327999,0.08078246,0.0004536756,0.00080852857,0.00030725473,0.000004241321,0.000058355086,0.0014161201],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999253,0.000032321965,0.0002633116,0.00005379552,0.00026031325,0.00013728022],"domain_scores_gemma":[0.9995525,0.0002147258,0.000071441515,0.000101697166,0.00004944009,0.000010190101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015644145,0.00006850391,0.00008364254,0.0001689181,0.00007718501,0.00007814878,0.00024722834,0.000015481475,0.000005076991],"category_scores_gemma":[0.00019257602,0.000037450576,0.000057543977,0.00047189888,0.000009424202,0.000059739126,0.00001977886,0.00011621334,0.0000053626163],"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.000014170356,0.000016808497,0.0000368181,0.00023024058,0.00008352763,0.0000142862455,0.0015708713,0.97057533,0.0000057022435,0.0002884441,0.010760006,0.01640382],"study_design_scores_gemma":[0.00054630253,0.00007617261,0.0015332927,0.00008846404,0.00007009184,0.000011612954,0.0049108677,0.9873321,0.00001155878,0.00034283707,0.005006804,0.000069898284],"about_ca_topic_score_codex":0.0000020695454,"about_ca_topic_score_gemma":0.0000045061593,"teacher_disagreement_score":0.7268434,"about_ca_system_score_codex":0.00003425987,"about_ca_system_score_gemma":0.000020555794,"threshold_uncertainty_score":0.15271902},"labels":[],"label_agreement":null},{"id":"W4389832522","doi":"10.5267/j.jpm.2023.9.001","title":"A two-stage iterated greedy algorithm and a multi-objective constructive heuristic for the mixed no-idle flowshop scheduling problem to minimize makespan subject to total completion time","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Job shop scheduling; Mathematical optimization; Initialization; Computer science; Scheduling (production processes); Idle; Greedy algorithm; Flow shop scheduling; Constructive; Algorithm; Mathematics; Schedule; Process (computing)","score_opus":0.02007630204829185,"score_gpt":0.2706051062433185,"score_spread":0.25052880419502666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389832522","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03784855,0.00009035186,0.95803326,0.00021750227,0.000891751,0.0023750756,0.00009054706,0.00020392878,0.00024901464],"genre_scores_gemma":[0.018531037,0.000036705038,0.9795727,0.00009445215,0.00027044842,0.00020339648,0.000020628391,0.00006816021,0.0012024555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850345,0.00007191505,0.0005073352,0.00025683298,0.00030802004,0.00035242678],"domain_scores_gemma":[0.9989619,0.00021957273,0.00013898687,0.00016292304,0.00039440885,0.00012219732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079412374,0.00024714743,0.0003488471,0.00060954056,0.0001797835,0.00018760735,0.0001792987,0.00004762613,0.000015983604],"category_scores_gemma":[0.00014418778,0.00019891032,0.00010444706,0.00091782963,0.00003095246,0.00012940048,0.00010186645,0.00019580702,0.00005124728],"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.0003148687,0.0000758665,0.00004330836,0.00022652466,0.0008292271,0.00006945854,0.0034287837,0.9665599,0.00076074054,0.000068472524,0.0011721213,0.026450712],"study_design_scores_gemma":[0.0023509697,0.00025533827,0.0009597425,0.00018358005,0.0001342219,0.00004640104,0.0029276242,0.9921722,0.00022429196,0.000014248359,0.00047739394,0.00025400406],"about_ca_topic_score_codex":0.00001692845,"about_ca_topic_score_gemma":0.0000048533434,"teacher_disagreement_score":0.026196707,"about_ca_system_score_codex":0.0001539068,"about_ca_system_score_gemma":0.000035545272,"threshold_uncertainty_score":0.8111327},"labels":[],"label_agreement":null},{"id":"W4389832523","doi":"10.5267/j.jpm.2023.11.002","title":"Scheduling parallel extrusion lines","year":2023,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Université Laval; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Metaheuristic; Job shop scheduling; Computer science; Mathematical optimization; Simulated annealing; Nurse scheduling problem; Scheduling (production processes); Algorithm; Flow shop scheduling; Mathematics","score_opus":0.02529197579827337,"score_gpt":0.2720124708890158,"score_spread":0.24672049509074245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389832523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17543897,0.0019880047,0.7981186,0.00090329396,0.0056428127,0.0006459793,0.0000029956848,0.0012932676,0.015966112],"genre_scores_gemma":[0.13350862,0.004985529,0.8575052,0.00014197206,0.00089815084,0.000016278122,0.000008081472,0.00007320246,0.0028629445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921536,0.000014138032,0.00031107693,0.000065974426,0.00023863756,0.00015478878],"domain_scores_gemma":[0.9997113,0.000018805804,0.000073684954,0.00009777662,0.00006113058,0.000037300953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037143403,0.00009016298,0.0001274458,0.00044650916,0.000042724205,0.00004622605,0.000143795,0.000027653976,0.000022874186],"category_scores_gemma":[0.000020275313,0.00007667858,0.00007326018,0.0005388849,0.0000071020436,0.00011649153,0.000039852977,0.00012249133,0.000063066684],"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.0000102048825,0.000015249704,0.00007898218,0.00009677479,0.00009762489,0.00009084783,0.0002226347,0.9736463,0.000072721334,0.00016373699,0.004833101,0.020671856],"study_design_scores_gemma":[0.0007844003,0.000054066124,0.00062673737,0.00016002316,0.000052038915,0.000024097833,0.0010326286,0.9784747,0.00020102118,0.00022957743,0.018187355,0.00017339509],"about_ca_topic_score_codex":7.6835465e-7,"about_ca_topic_score_gemma":3.0692007e-7,"teacher_disagreement_score":0.05938665,"about_ca_system_score_codex":0.000034965222,"about_ca_system_score_gemma":0.000009725791,"threshold_uncertainty_score":0.31268618},"labels":[],"label_agreement":null},{"id":"W4389983549","doi":"10.48550/arxiv.2312.10717","title":"Pseudo-random Instance Generators in C++ for Deterministic and Stochastic Multi-commodity Network Design Problems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institut de Valorisation des Données; Université de Montréal","keywords":"Computer science; Heuristic; Stylized fact; Comparability; Mathematical optimization; Range (aeronautics); Stochastic optimization; Matching (statistics); Commodity; Mathematics; Artificial intelligence; Engineering; Economics","score_opus":0.11374442565370298,"score_gpt":0.201455507633723,"score_spread":0.08771108198002002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389983549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053133912,0.00017336707,0.9446333,0.000006256172,0.00080345955,0.0007947338,0.00004835732,0.00039733827,0.00000927107],"genre_scores_gemma":[0.92483836,0.00033574455,0.07440481,0.000012852149,0.00012508979,0.000023260844,0.00004771087,0.00007853805,0.0001336066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987501,0.000068512396,0.00023890776,0.0005434011,0.000043661366,0.0003553994],"domain_scores_gemma":[0.9991102,0.00031035117,0.000082525454,0.00031640122,0.00006223306,0.00011829111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031674723,0.00030149278,0.00038162587,0.00015416343,0.00010346819,0.00005875769,0.0002624097,0.00028522618,0.0000031673435],"category_scores_gemma":[0.000082761006,0.00037713905,0.00007771969,0.000362098,0.00006196003,0.00007328657,0.00014709031,0.00038702026,0.000007688217],"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.000040530536,0.000018970753,0.0002449119,0.00016722975,0.000046202214,0.000026900898,0.00012930273,0.99888283,0.0000028198328,0.00021217436,0.000063694715,0.00016446087],"study_design_scores_gemma":[0.0017261882,0.000021851807,0.00016878509,0.00020921086,0.000063392195,0.0000012478833,0.000035345864,0.9937615,0.0000071142663,0.0036130438,0.0000066441,0.00038572482],"about_ca_topic_score_codex":0.00001557034,"about_ca_topic_score_gemma":0.0001161096,"teacher_disagreement_score":0.87170446,"about_ca_system_score_codex":0.00014002451,"about_ca_system_score_gemma":0.000059985814,"threshold_uncertainty_score":0.99986804},"labels":[],"label_agreement":null},{"id":"W4390055272","doi":"10.1080/00207543.2023.2294114","title":"Robust job shop scheduling with machine unavailability due to random breakdowns and condition-based maintenance","year":2023,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Unavailability; Job shop scheduling; Mathematical optimization; Computer science; Simulated annealing; Robustness (evolution); Scheduling (production processes); Preventive maintenance; Schedule; Reliability engineering; Mathematics; Engineering","score_opus":0.04564035187183845,"score_gpt":0.32579108720119476,"score_spread":0.2801507353293563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390055272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903177,0.00018050324,0.1897886,0.016819352,0.00193394,0.00035325397,0.00003125777,0.00018709603,0.00038825953],"genre_scores_gemma":[0.9616874,0.00010906842,0.037003808,0.000050659342,0.00066686666,0.000018757082,0.000019167093,0.000029542034,0.00041477094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982206,0.00010028616,0.00034302284,0.00020015522,0.00091281655,0.00022307757],"domain_scores_gemma":[0.9974548,0.00022069238,0.00006039259,0.00013889899,0.0019768607,0.0001483076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022570074,0.000104194216,0.00016507859,0.000778191,0.00010605473,0.00012956379,0.00023923618,0.000044835782,0.00012007594],"category_scores_gemma":[0.0011417551,0.00008596243,0.0000402121,0.0007485644,0.0001033808,0.00021852044,0.000034634755,0.00045565842,0.000043118915],"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.00033308458,0.000029678085,0.0019569094,0.000026012676,0.000086874745,0.000067295754,0.00015893966,0.9912055,0.001034113,0.00007424335,0.0015166964,0.0035106102],"study_design_scores_gemma":[0.0033930284,0.00024023697,0.0116219865,0.00043348188,0.000018572504,0.0005966445,0.00067119504,0.97205204,0.008516008,0.00040357423,0.0017744572,0.00027878798],"about_ca_topic_score_codex":0.000014233563,"about_ca_topic_score_gemma":0.000019582083,"teacher_disagreement_score":0.17136963,"about_ca_system_score_codex":0.00016475325,"about_ca_system_score_gemma":0.00010767045,"threshold_uncertainty_score":0.3505446},"labels":[],"label_agreement":null},{"id":"W4390142484","doi":"10.1007/s00453-023-01198-w","title":"Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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":"Preemption; Competitive analysis; Scheduling (production processes); Theory of computation; Multiprocessor scheduling; Algorithm; Multiprocessing; Online algorithm; Job shop scheduling; Computer science; Combinatorics; Approximation algorithm; Mathematics; Discrete mathematics; Parallel computing; Flow shop scheduling; Mathematical optimization; Upper and lower bounds; Schedule; Operating system","score_opus":0.029698739279698103,"score_gpt":0.24751595211269234,"score_spread":0.21781721283299424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390142484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03936511,0.000040397957,0.9564825,0.00065891474,0.0003591951,0.00092087477,0.000061719715,0.0017663803,0.00034490685],"genre_scores_gemma":[0.026569687,0.0000031847865,0.9714753,0.00011553753,0.00055776216,0.0005142456,0.00017517587,0.000121967445,0.000467119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984678,0.000025752086,0.00033752085,0.00035415747,0.0003212236,0.0004935604],"domain_scores_gemma":[0.9987522,0.0004958948,0.00006169151,0.00027925553,0.00027666028,0.00013430047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042001315,0.00026867233,0.00025817778,0.00019250563,0.00034328143,0.00014871474,0.00024261844,0.00009998721,0.000017302295],"category_scores_gemma":[0.00031295675,0.00020996355,0.00006355103,0.0013065195,0.000044325912,0.00016530005,0.00004454208,0.00018083314,0.00032533385],"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.00002159583,0.000015587635,0.000034437322,0.00005922358,0.000057015688,0.0000023567827,0.00047561096,0.95711315,0.0019204875,0.000033040338,0.00036569865,0.039901793],"study_design_scores_gemma":[0.0007402888,0.00006423189,0.0009944361,0.000070904636,0.000035134846,0.000021284137,0.0003000611,0.9949645,0.002254286,0.00006237089,0.0001636146,0.0003289168],"about_ca_topic_score_codex":0.000008935883,"about_ca_topic_score_gemma":6.254764e-7,"teacher_disagreement_score":0.039572876,"about_ca_system_score_codex":0.00006617173,"about_ca_system_score_gemma":0.000034466644,"threshold_uncertainty_score":0.8562065},"labels":[],"label_agreement":null},{"id":"W4390455927","doi":"10.2139/ssrn.4680294","title":"Trade-Off Balancing in One-Stage Production with Variation in Processing Times","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Variation (astronomy); Stage (stratigraphy); Production (economics); Computer science; Economics; Microeconomics; Geology; Physics","score_opus":0.011757454280495383,"score_gpt":0.2263722173845491,"score_spread":0.21461476310405372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390455927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49032447,0.009190115,0.4933426,0.0024008402,0.0021218022,0.0010190934,0.0000068614536,0.0011145027,0.00047973226],"genre_scores_gemma":[0.9851535,0.0045532533,0.009055563,0.000009094084,0.00053342816,0.000039172734,0.000029500497,0.00011893453,0.0005075809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772614,0.000061358296,0.00044250622,0.00031386386,0.00028841858,0.0011677041],"domain_scores_gemma":[0.99959415,0.00001834879,0.00015318197,0.00015124174,0.00004155057,0.000041513722],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015615912,0.00023948595,0.00028591958,0.00055384304,0.000064632906,0.000121300356,0.0001715048,0.00021706648,0.000006497438],"category_scores_gemma":[0.000068421905,0.00024436004,0.000041657175,0.00052655686,0.000012375129,0.00021372721,0.000027676366,0.003967351,0.0000059326776],"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.000018791854,0.0000283395,0.0007715114,0.00011305214,0.000049195565,0.0000058652276,0.0010506752,0.9864232,0.00007927128,0.00022417425,0.0000031165089,0.011232797],"study_design_scores_gemma":[0.0007761222,0.00006194633,0.006513353,0.0011325292,0.000039642655,0.00008591084,0.0013387612,0.97872394,0.00016134148,0.010640362,0.000020846674,0.000505255],"about_ca_topic_score_codex":0.00004851009,"about_ca_topic_score_gemma":0.0013146452,"teacher_disagreement_score":0.49482903,"about_ca_system_score_codex":0.0018816385,"about_ca_system_score_gemma":0.0013133185,"threshold_uncertainty_score":0.99833053},"labels":[],"label_agreement":null},{"id":"W4390825574","doi":"10.1016/j.jii.2024.100574","title":"The multi-factory two-stage assembly scheduling problem","year":2024,"lang":"en","type":"article","venue":"Journal of Industrial Information Integration","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Université Laval","keywords":"Scheduling (production processes); Factory (object-oriented programming); Job shop scheduling; Computer science; Schedule; Industrial engineering; Integer programming; Flow shop scheduling; Operations research; Distributed computing; Engineering; Operations management; Algorithm; Operating system","score_opus":0.037395202055217555,"score_gpt":0.27588842854401174,"score_spread":0.23849322648879417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390825574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01941876,0.00041446407,0.9722211,0.00047534594,0.0053191604,0.0001988507,0.000009953648,0.00021624991,0.001726131],"genre_scores_gemma":[0.8996934,0.00036144909,0.09743911,0.000101464146,0.0019458084,0.000017911434,0.000054352025,0.000038825798,0.0003476441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986521,0.000038856993,0.000841986,0.00003901402,0.00029570208,0.00013232345],"domain_scores_gemma":[0.9991817,0.00014797853,0.00020066519,0.00008158167,0.00032263724,0.00006545315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009604458,0.00012072757,0.0001204146,0.00026367558,0.00013203266,0.0007365332,0.00014547688,0.00013461024,0.000028618848],"category_scores_gemma":[0.00031256996,0.00007877033,0.00009895842,0.00033307352,0.000020733876,0.0023248082,0.000008402394,0.0007022696,0.000051613923],"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.000023556826,0.000006842793,0.000020285757,0.000016996995,0.00007393344,0.0000016633143,0.001186431,0.8267879,0.00031061107,0.0022438758,0.002231185,0.16709673],"study_design_scores_gemma":[0.0005846292,0.00004553252,0.000006871872,0.00020666858,0.000019125364,0.00002160695,0.0014612145,0.97293,0.003889185,0.00004216915,0.020690842,0.000102156155],"about_ca_topic_score_codex":0.000006306913,"about_ca_topic_score_gemma":0.000005148212,"teacher_disagreement_score":0.88027465,"about_ca_system_score_codex":0.00018700445,"about_ca_system_score_gemma":0.00015111337,"threshold_uncertainty_score":0.71024066},"labels":[],"label_agreement":null},{"id":"W4391211013","doi":"10.3390/systems12020037","title":"Unrelated Parallel Machine Scheduling Problem Considering Job Splitting, Inventories, Shortage, and Resource: A Meta-Heuristic Approach","year":2024,"lang":"en","type":"article","venue":"Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Metaheuristic; Job shop scheduling; Mathematical optimization; Computer science; Economic shortage; Firefly algorithm; Meta heuristic; Scheduling (production processes); Integer programming; Operations research; Industrial engineering; Algorithm; Mathematics; Engineering; Particle swarm optimization","score_opus":0.026967310281303974,"score_gpt":0.23197977784534424,"score_spread":0.20501246756404026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391211013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013220085,0.31337354,0.63415444,0.00016078104,0.0023886864,0.0015665775,0.00007211376,0.005794314,0.029269462],"genre_scores_gemma":[0.87084514,0.0002858127,0.12555622,0.000018376177,0.00023738593,0.00020045532,0.000085656415,0.00016477302,0.0026061842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998458,0.00007697435,0.00051157695,0.0003876887,0.00023537065,0.00033035758],"domain_scores_gemma":[0.9994016,0.0001151823,0.000041873765,0.0002440448,0.000041038224,0.00015621862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006323892,0.00029485716,0.0004426415,0.00017753258,0.00011565316,0.00040415264,0.0001084496,0.00016144721,0.000018380926],"category_scores_gemma":[0.00006703765,0.0002588297,0.000091160895,0.00040321375,0.000044923603,0.000119819095,0.000044052966,0.00041236312,0.000018835617],"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.000003895256,0.0000097162165,0.00025832668,0.0016406218,0.0011988641,0.000046102494,0.0012468598,0.99160063,0.00006217884,0.0032519544,0.00038014777,0.00030067962],"study_design_scores_gemma":[0.0002018995,0.000012658347,0.000010679085,0.00022086177,0.0003720135,0.00012627633,0.00037960353,0.990134,0.000012816481,0.000106874606,0.008134385,0.00028793336],"about_ca_topic_score_codex":0.00007440456,"about_ca_topic_score_gemma":0.000003172351,"teacher_disagreement_score":0.85762507,"about_ca_system_score_codex":0.00006067321,"about_ca_system_score_gemma":0.00002847461,"threshold_uncertainty_score":0.9999864},"labels":[],"label_agreement":null},{"id":"W4391361127","doi":"10.18280/mmep.110110","title":"Normalization of Regular Scheduling Criteria with Dynamic Constraint","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Normalization (sociology); Computer science; Scheduling (production processes); Mathematical optimization; Dynamic priority scheduling; Algorithm; Mathematics; Schedule","score_opus":0.011196151596570161,"score_gpt":0.20769990852035972,"score_spread":0.19650375692378955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391361127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041415494,0.0013529885,0.95615304,0.000024243122,0.00009900483,0.00010389285,0.0000040118384,0.000625237,0.00022207719],"genre_scores_gemma":[0.624212,0.00009635096,0.37559915,0.0000014621496,0.000015219723,0.0000116667725,0.0000063065563,0.00004050991,0.000017341448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992492,0.000004793522,0.00027782712,0.00015557291,0.00012885264,0.00018376099],"domain_scores_gemma":[0.99970275,0.00006012947,0.0000134518305,0.000116364135,0.000035542205,0.00007173124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017564544,0.0001638285,0.0002018884,0.00012839674,0.000024576699,0.00008495272,0.000053050997,0.00007800011,0.00001810097],"category_scores_gemma":[0.000010492785,0.00014011233,0.000030569743,0.00020005771,0.000036792997,0.00010865466,0.000010491846,0.00014253258,0.0000047144094],"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.0000012476617,0.0000074857726,9.94213e-7,0.0020951729,0.000042779215,0.000002726118,0.0005085461,0.9878823,0.00076618214,0.008080735,0.000001201465,0.0006105921],"study_design_scores_gemma":[0.00010241182,0.000023403956,7.520289e-7,0.0012219028,0.000031879157,0.000040376486,0.000039075123,0.99594057,0.00057122787,0.0018242658,0.000029167733,0.00017497558],"about_ca_topic_score_codex":8.7122964e-7,"about_ca_topic_score_gemma":9.262394e-8,"teacher_disagreement_score":0.5827965,"about_ca_system_score_codex":0.000018707358,"about_ca_system_score_gemma":0.000008083989,"threshold_uncertainty_score":0.57136154},"labels":[],"label_agreement":null},{"id":"W4391491627","doi":"10.2139/ssrn.4680295","title":"On Implementing Autonomous Supply Chains: A Multi-Agent System Approach","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"St. John’s Health Sciences Centre","funders":"","keywords":"Supply chain; Business; Process management; Computer science; Industrial organization; Marketing","score_opus":0.011850555740900952,"score_gpt":0.2376844733473598,"score_spread":0.22583391760645882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391491627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028083038,0.020880774,0.9394218,0.00015044995,0.0045800563,0.000736507,0.00006474696,0.002010022,0.0040726378],"genre_scores_gemma":[0.9681785,0.0020771567,0.026439294,0.000027780037,0.0012146084,0.00010841148,0.00010607168,0.00025313874,0.0015950508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957554,0.00007565572,0.0006652442,0.00046645693,0.00038026553,0.0026570042],"domain_scores_gemma":[0.9992369,0.000028090983,0.00015120234,0.00036173587,0.00007552182,0.00014656609],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0018256237,0.0005002948,0.00044498575,0.00042007715,0.00020069572,0.0003734149,0.0004739455,0.00031303524,0.000017097635],"category_scores_gemma":[0.000023963354,0.00047749953,0.00032869904,0.0001882358,0.00001577928,0.000039800736,0.00026422538,0.006995719,0.000109749984],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075475123,0.000054147884,0.000015768925,0.0005853811,0.00093544385,0.00002094441,0.0006001242,0.9329302,0.000013732643,0.052994836,0.00012116695,0.011720714],"study_design_scores_gemma":[0.00051898207,0.000059362184,0.000005945221,0.00041460205,0.00014175876,0.0004288455,0.0024345468,0.9912378,0.0000410037,0.0040611196,0.00016617506,0.000489822],"about_ca_topic_score_codex":0.000026821572,"about_ca_topic_score_gemma":0.000035305035,"teacher_disagreement_score":0.9400954,"about_ca_system_score_codex":0.004245734,"about_ca_system_score_gemma":0.0013051783,"threshold_uncertainty_score":0.99976766},"labels":[],"label_agreement":null},{"id":"W4391513755","doi":"10.25046/aj090111","title":"Smart Agent-Based Direct Load Control of Air Conditioner Populations in Demand Side Management","year":2024,"lang":"en","type":"article","venue":"Advances in Science Technology and Engineering Systems Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Demand side; Air conditioning; Control (management); Computer science; Automotive engineering; Environmental science; Engineering; Economics; Environmental economics; Artificial intelligence; Mechanical engineering","score_opus":0.006991667084202533,"score_gpt":0.24657024709455186,"score_spread":0.23957858001034932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391513755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09879188,0.03055199,0.8675582,0.00009294366,0.0019517697,0.00016478877,0.000004972815,0.0003283856,0.00055509876],"genre_scores_gemma":[0.9877748,0.0003922827,0.0117693655,0.0000037752143,0.000017597622,0.00002088806,4.8189656e-7,0.000008944304,0.00001190038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919415,0.000007944838,0.00030055118,0.0001339401,0.00015989212,0.00020353278],"domain_scores_gemma":[0.9997736,0.000037672296,0.000026508043,0.00008949235,0.000035394944,0.00003729195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005754233,0.00009253358,0.00015916802,0.001622885,0.000052277046,0.000035783232,0.00012884804,0.00006224729,0.0000016537792],"category_scores_gemma":[0.000051570918,0.000087075605,0.000017057184,0.001628769,0.00012092477,0.00034935758,0.0000103602615,0.00021679273,0.0000012730378],"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.0000011379847,0.000005024364,0.0024802925,0.00011961717,0.0000063456127,0.00003422858,0.000035259327,0.9901524,0.00041428593,0.005189341,0.0000018178704,0.0015602403],"study_design_scores_gemma":[0.00033083302,0.000014940007,0.0016066426,0.00059867965,0.0000074344334,0.00007447721,0.00012621176,0.99584466,0.00032727548,0.00028675,0.00067736063,0.000104739294],"about_ca_topic_score_codex":0.0000016472274,"about_ca_topic_score_gemma":0.0000038716375,"teacher_disagreement_score":0.8889829,"about_ca_system_score_codex":0.00012808037,"about_ca_system_score_gemma":0.000024691908,"threshold_uncertainty_score":0.35508403},"labels":[],"label_agreement":null},{"id":"W4391537602","doi":"10.54254/3006-1210/direct/0106","title":"Artificial Intelligence in the Industrial Engineering","year":2024,"lang":"en","type":"article","venue":"Advances in Operation Research and Production Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Engineering; Artificial intelligence; Computer science; Manufacturing engineering","score_opus":0.06586865187220066,"score_gpt":0.35066942403966733,"score_spread":0.2848007721674667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391537602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13612387,0.07071132,0.7183922,0.02861731,0.016231544,0.0068090796,0.000010292765,0.0013689465,0.021735428],"genre_scores_gemma":[0.97866917,0.011560307,0.008792017,0.000015953328,0.0005391016,0.00021991381,0.000011266053,0.000013587566,0.00017866465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993028,0.00004239662,0.00015349554,0.000165159,0.00019415436,0.00014197358],"domain_scores_gemma":[0.99982506,0.000050276984,0.0000026693767,0.00008952949,0.000017543363,0.000014898565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011309513,0.000053743533,0.00004127142,0.00032327938,0.000049394865,0.00017615686,0.00007285174,0.000024118073,0.000018755378],"category_scores_gemma":[0.000049758823,0.000043478285,0.000005745225,0.00075572485,0.000025678259,0.00033926405,0.000016120453,0.00027615158,0.000014855407],"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.0000038878206,0.000008820118,0.000016073469,0.000050367784,0.0000026221742,0.0000061887044,0.00033388403,0.7233093,0.00001653774,0.017902356,0.000068331814,0.25828162],"study_design_scores_gemma":[0.00003326566,0.000033200788,0.00005067712,0.00009661544,0.0000014022086,0.0000033939618,0.0015452702,0.9733665,0.000884029,0.003575768,0.020321647,0.00008825598],"about_ca_topic_score_codex":0.0000031457564,"about_ca_topic_score_gemma":0.000022899196,"teacher_disagreement_score":0.84254533,"about_ca_system_score_codex":0.000044184402,"about_ca_system_score_gemma":0.0000053052086,"threshold_uncertainty_score":0.1772993},"labels":[],"label_agreement":null},{"id":"W4391649921","doi":"10.1016/j.ress.2024.109990","title":"Assessing network reliability in a hybrid flow shop with rush order insertion","year":2024,"lang":"en","type":"article","venue":"Reliability Engineering & System Safety","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science and Technology Council","keywords":"Workstation; Reliability (semiconductor); Computer science; Flow network; Reliability engineering; Capacity planning; Metric (unit); Operations research; Engineering; Mathematical optimization; Operations management; Mathematics","score_opus":0.005251171707096948,"score_gpt":0.20286288257709287,"score_spread":0.19761171086999593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391649921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17279889,0.001208777,0.8184282,0.00014626772,0.0022631781,0.00060196733,0.000018811032,0.0040178727,0.000516001],"genre_scores_gemma":[0.87624,0.00004156104,0.12312003,0.0000071981513,0.00031839078,0.000085691696,0.000046150548,0.00012193755,0.000019027653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997372,0.00009218215,0.00091331644,0.0006357446,0.00037637245,0.00061043503],"domain_scores_gemma":[0.9986595,0.00033316965,0.000038099897,0.00066894206,0.00013812167,0.00016216036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016946207,0.00042651908,0.0005142675,0.00019146489,0.000094461524,0.00037220542,0.00019591667,0.00018751023,0.000024192117],"category_scores_gemma":[0.0002058462,0.00039194906,0.00010934064,0.0014193837,0.000040056224,0.0005842307,0.0000318376,0.0006443871,0.000037181948],"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.000019996873,0.00002021593,0.0015813602,0.0017861127,0.000033396846,0.000032718035,0.00018405016,0.9944042,0.000037743295,0.00014389807,0.00003755578,0.0017187292],"study_design_scores_gemma":[0.00031460167,0.000024584742,0.0037797836,0.0016750171,0.00003088991,0.00005051657,0.00011350064,0.9924281,0.00008573949,0.000015119824,0.0010308063,0.0004512977],"about_ca_topic_score_codex":0.000043202115,"about_ca_topic_score_gemma":0.000009866006,"teacher_disagreement_score":0.70344114,"about_ca_system_score_codex":0.0011101468,"about_ca_system_score_gemma":0.00013719822,"threshold_uncertainty_score":0.99985325},"labels":[],"label_agreement":null},{"id":"W4391880577","doi":"10.1080/00207543.2024.2312209","title":"Bi-objective carbon-efficient distributed flow-shop scheduling with multistep electricity pricing","year":2024,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Electricity; Mathematical optimization; Electricity pricing; Scheduling (production processes); Computer science; Pareto principle; Electricity generation; Integer programming; Electricity price; Flow shop scheduling; Job shop scheduling; Operations research; Electricity market; Engineering; Mathematics; Power (physics); Schedule","score_opus":0.027402017709286523,"score_gpt":0.32509415190318597,"score_spread":0.29769213419389945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391880577","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6052069,0.0018534857,0.38481867,0.0018314535,0.005206826,0.0002485466,0.000015277486,0.00023452824,0.00058431015],"genre_scores_gemma":[0.9713548,0.0001580041,0.026798213,0.000004616431,0.0015135548,0.000008605995,0.000011114681,0.000034165016,0.000116962525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977674,0.00008866435,0.00037603668,0.0002213867,0.0012843331,0.00026221757],"domain_scores_gemma":[0.9973893,0.000150677,0.000057126344,0.00011551087,0.0021907727,0.00009659404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881418,0.00012406212,0.00014445369,0.00094716117,0.000085195265,0.00024053929,0.00027344102,0.000061305174,0.000029426443],"category_scores_gemma":[0.00061862986,0.00010152559,0.00006316295,0.0011089062,0.00006673095,0.00018254913,0.00003432537,0.00091117003,0.000012105298],"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.00007928618,0.000056176155,0.00016039416,0.000030981504,0.0002651609,0.00009998145,0.0005011857,0.986287,0.0031174456,0.00008521935,0.00014571307,0.009171474],"study_design_scores_gemma":[0.00027435366,0.000083760446,0.0002288291,0.0002889136,0.000014855931,0.00036073674,0.00042719743,0.97722334,0.020488987,0.00005497674,0.00043912025,0.00011495948],"about_ca_topic_score_codex":0.00001741256,"about_ca_topic_score_gemma":0.000003954667,"teacher_disagreement_score":0.36614785,"about_ca_system_score_codex":0.00064723875,"about_ca_system_score_gemma":0.00020330444,"threshold_uncertainty_score":0.41400933},"labels":[],"label_agreement":null},{"id":"W4391889802","doi":"10.5267/j.jpm.2024.2.002","title":"Solving blocking flowshop scheduling problem with makespan criterion using q-learning-based iterated greedy algorithms","year":2024,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Blocking (statistics); Greedy algorithm; Mathematical optimization; Computer science; Iterated function; Scheduling (production processes); Algorithm; Mathematics; Schedule","score_opus":0.017210502177712465,"score_gpt":0.2597019179466145,"score_spread":0.24249141576890204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391889802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045322582,0.0015971694,0.9504815,0.00010056301,0.00089513365,0.00037719597,0.000001760873,0.00049535534,0.0007287433],"genre_scores_gemma":[0.3226567,0.000099489276,0.6765308,0.000040248255,0.00037025497,0.000010733184,0.0000069554126,0.00010971788,0.00017509832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823594,0.00006437681,0.00059465674,0.00024281812,0.0004966458,0.000365533],"domain_scores_gemma":[0.99938184,0.000042315558,0.0001422721,0.00014594321,0.00020394239,0.00008368813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071704993,0.00028350705,0.0002931506,0.00096585974,0.00014488833,0.0005984282,0.00019125552,0.00007724882,0.000035853205],"category_scores_gemma":[0.000016595925,0.00023642079,0.00012015425,0.000988705,0.000023739261,0.00039896937,0.000038159335,0.00056405005,0.0000062775707],"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.000030064552,0.000031057567,0.00007619949,0.0006812961,0.00032192012,0.00047485184,0.00061697647,0.9837252,0.0004898065,0.000023791863,0.00005734122,0.013471517],"study_design_scores_gemma":[0.00065598165,0.0001760351,0.0000213703,0.0022765612,0.00020785898,0.00015819664,0.00064323505,0.99301934,0.0006059342,0.000011569672,0.001925431,0.00029846415],"about_ca_topic_score_codex":0.000007418207,"about_ca_topic_score_gemma":0.0000018532387,"teacher_disagreement_score":0.27733412,"about_ca_system_score_codex":0.00025329637,"about_ca_system_score_gemma":0.0000866444,"threshold_uncertainty_score":0.964096},"labels":[],"label_agreement":null},{"id":"W4391909277","doi":"10.5267/j.jpm.2024.2.001","title":"No idle flow shop scheduling models with separated set-up times and concept of job weightage to optimize rental cost of machines","year":2024,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Idle; Renting; Computer science; Flow shop scheduling; Set (abstract data type); Industrial engineering; Scheduling (production processes); Job shop; Operations research; Operations management; Mathematics; Engineering; Job shop scheduling; Schedule; Operating system; Civil engineering","score_opus":0.015715654331992405,"score_gpt":0.2629530622500021,"score_spread":0.2472374079180097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391909277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06673469,0.0042237435,0.91710556,0.00012646736,0.001277094,0.0009275465,0.00006168976,0.00015597347,0.0093872165],"genre_scores_gemma":[0.38155714,0.00062268454,0.6158654,0.000028026485,0.00013907216,0.000013099053,0.000011068534,0.000056066146,0.0017074299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989424,0.000025158672,0.00045839822,0.00013257725,0.00029306152,0.00014842761],"domain_scores_gemma":[0.9995463,0.000032141215,0.00009753631,0.00011330825,0.0001430374,0.00006771106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002624392,0.00016343188,0.00030805753,0.00037865152,0.00002619631,0.00006297679,0.00013251086,0.000041229414,0.00005765557],"category_scores_gemma":[0.000009092469,0.00012472454,0.00006458456,0.00038474397,0.000032156582,0.00023157522,0.0000495494,0.00015497892,0.0000034373238],"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.00009574474,0.00001823773,0.000024918249,0.00032412345,0.00040677693,0.000036523852,0.0011765859,0.99315786,0.000106388325,0.00020508774,0.001242254,0.0032054663],"study_design_scores_gemma":[0.0007639343,0.00018825736,0.000011587498,0.00060978334,0.00013163965,0.000029356046,0.0005441181,0.9960281,0.0010697496,0.00002375547,0.00046103884,0.00013863381],"about_ca_topic_score_codex":0.0000078071325,"about_ca_topic_score_gemma":0.0000012814087,"teacher_disagreement_score":0.31482244,"about_ca_system_score_codex":0.000047108755,"about_ca_system_score_gemma":0.00003119419,"threshold_uncertainty_score":0.5086119},"labels":[],"label_agreement":null},{"id":"W4391924232","doi":"10.1007/s10479-024-05860-6","title":"A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Theory of computation; Scheme (mathematics); Flow (mathematics); Polynomial-time approximation scheme; Mathematics; Time complexity; Stage (stratigraphy); Computer science; Discrete mathematics; Algorithm; Geometry; Mathematical analysis","score_opus":0.2199977720889789,"score_gpt":0.4612305012646664,"score_spread":0.24123272917568753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391924232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4220379,0.00082447706,0.57152337,0.0010538972,0.00023676059,0.0011898709,0.0003691845,0.00033347716,0.0024310874],"genre_scores_gemma":[0.15515953,0.00014509758,0.84185064,0.000024529607,0.00015180024,0.0001811837,0.00029584678,0.000054004155,0.0021373737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987982,0.00007259965,0.00038179907,0.00018678262,0.00031315934,0.0002474388],"domain_scores_gemma":[0.9990084,0.00014221991,0.000008343769,0.00023703197,0.00050835917,0.00009562328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009658328,0.00009594661,0.00016319132,0.00026227187,0.000098537545,0.00014150505,0.00016902403,0.00010010568,0.00027685723],"category_scores_gemma":[0.0002539574,0.00009573946,0.00008292501,0.00045867357,0.000081798535,0.00044179967,0.000028153509,0.00020455927,0.00008940902],"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.00007849202,0.00050729036,0.000095292155,0.0009771921,0.00027537876,0.0000047072026,0.0024153832,0.94105154,0.02963228,0.009913185,0.009738693,0.0053105387],"study_design_scores_gemma":[0.00021511588,0.00004740925,0.000048673417,0.000059369002,0.00000447313,0.0000018391066,0.00015134217,0.9856833,0.013209404,0.00006368259,0.00042315197,0.000092245784],"about_ca_topic_score_codex":0.000032764667,"about_ca_topic_score_gemma":0.000009307897,"teacher_disagreement_score":0.27032727,"about_ca_system_score_codex":0.000014474305,"about_ca_system_score_gemma":0.000108669825,"threshold_uncertainty_score":0.39041418},"labels":[],"label_agreement":null},{"id":"W4392255352","doi":"10.46254/au02.20230094","title":"Mixed-Integer Linear Programming Model for the Dual-Resource Flexible Job-Shop Scheduling Problem","year":2023,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"Mitacs","keywords":"Integer programming; Computer science; Linear programming; Dual (grammatical number); Job shop scheduling; Scheduling (production processes); Mathematical optimization; Mathematics; Algorithm; Operating system; Schedule","score_opus":0.04092438739363285,"score_gpt":0.26419609813765993,"score_spread":0.22327171074402707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392255352","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018763535,0.00017643151,0.99167675,0.0006403023,0.0002636966,0.0005501471,0.0000068355475,0.0031662674,0.0016432],"genre_scores_gemma":[0.04954433,0.000056599554,0.93636316,0.00016653155,0.00042029677,0.0004709375,0.00005834818,0.00015713173,0.012762684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987803,0.000010944648,0.0002885274,0.00024116079,0.00020284126,0.00047621454],"domain_scores_gemma":[0.99928373,0.00021282461,0.000028202508,0.00028641702,0.0000968682,0.00009195179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048053372,0.00020141991,0.00016522464,0.00012626169,0.00024649742,0.00012675358,0.00020272486,0.00011239941,0.000023158085],"category_scores_gemma":[0.00008200466,0.00014884687,0.000120284465,0.00060473214,0.000030191399,0.0001036694,0.00005636366,0.00021427342,0.00012561615],"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.0000053311223,0.000008178882,0.000017448112,0.000058194426,0.000047666745,7.471667e-7,0.0003701361,0.9874962,0.00004708024,0.0012903975,0.0017730604,0.008885571],"study_design_scores_gemma":[0.000321228,0.000013190116,0.0000027439764,0.00003230528,0.00002636625,0.0000028706336,0.00065458793,0.9907991,0.0008146907,0.00015730747,0.0069595026,0.00021609057],"about_ca_topic_score_codex":0.0000049182654,"about_ca_topic_score_gemma":0.000006320936,"teacher_disagreement_score":0.05531363,"about_ca_system_score_codex":0.000031886375,"about_ca_system_score_gemma":0.000028253507,"threshold_uncertainty_score":0.6069799},"labels":[],"label_agreement":null},{"id":"W4392757263","doi":"10.1080/03155986.2023.2287996","title":"Real-time production scheduling using a deep reinforcement learning-based multi-agent approach","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Reinforcement learning; Computer science; Scheduling (production processes); Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.055838574136626316,"score_gpt":0.3193120139407084,"score_spread":0.2634734398040821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392757263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02793847,0.0005245258,0.96455646,0.00007387868,0.0007397383,0.0010475529,0.0000072613134,0.00059266016,0.0045194784],"genre_scores_gemma":[0.936871,0.00017331261,0.060844507,0.000020526497,0.00034537076,0.0002458938,0.00050730386,0.00003530251,0.00095680106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980891,0.00006890218,0.00057834986,0.00015875854,0.0008011893,0.0003037],"domain_scores_gemma":[0.9990204,0.00008323717,0.000035475703,0.00013942432,0.0005958691,0.00012557828],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017232188,0.00015984499,0.00014928677,0.00064231374,0.0004457415,0.0011970163,0.00009382305,0.00012534791,0.000037463567],"category_scores_gemma":[0.00020318128,0.00014607733,0.000039866984,0.0005986971,0.00005464811,0.001605502,0.000033847562,0.00038267774,0.00020797057],"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.000008450891,0.0000063950915,0.000026276924,0.0004395248,0.00003141318,5.912116e-7,0.0011086435,0.9957938,0.000346038,0.0011689774,0.00010181847,0.0009680231],"study_design_scores_gemma":[0.0002553128,0.000029982211,0.000025420082,0.00015365715,0.0000058884557,0.000019331874,0.0009874096,0.9937839,0.00026928767,0.0000014002782,0.004301083,0.00016733145],"about_ca_topic_score_codex":0.000086064974,"about_ca_topic_score_gemma":7.5402886e-7,"teacher_disagreement_score":0.9089325,"about_ca_system_score_codex":0.00027974654,"about_ca_system_score_gemma":0.00020804159,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W4392975354","doi":"10.1016/j.procs.2024.01.003","title":"An Optimization Model for Smart and Sustainable Distributed Permutation Flow Shop Scheduling","year":2024,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Flow shop scheduling; Scheduling (production processes); Distributed computing; Permutation (music); Job shop scheduling; Mathematical optimization; Embedded system; Routing (electronic design automation)","score_opus":0.009929444823300281,"score_gpt":0.2397870947899102,"score_spread":0.22985764996660993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392975354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064323116,0.00019220833,0.99209607,0.00008021125,0.00034216317,0.00021024983,0.000009835223,0.0006219278,0.000015050121],"genre_scores_gemma":[0.32390603,0.000014467246,0.6758701,0.0000202954,0.00009021513,0.000029209177,0.000041781077,0.000014396985,0.000013500883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909514,0.0000041920316,0.00013292259,0.0003144988,0.00015568905,0.0002975769],"domain_scores_gemma":[0.999504,0.00003213655,0.000011275507,0.00010240708,0.00023820382,0.00011196958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038447807,0.00010698055,0.00007883644,0.00016930148,0.0002256433,0.00064298656,0.00014925403,0.00004090459,0.0000016589082],"category_scores_gemma":[0.000043243585,0.00010813365,0.00001652318,0.00061550556,0.000064672306,0.0010578919,0.000033316508,0.0000687739,0.0000012096631],"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.0000015159925,0.000005864936,0.000014988624,0.00012902472,0.0000028134345,8.8874214e-7,0.0007273827,0.9912971,0.00005210093,0.0010209463,0.000015410618,0.0067319633],"study_design_scores_gemma":[0.000108901084,0.000024864172,0.000010613008,0.000026943933,0.000007903204,0.000006437643,0.00006874364,0.9989587,0.00019273387,0.0004410054,0.000009408427,0.00014375492],"about_ca_topic_score_codex":7.1581724e-7,"about_ca_topic_score_gemma":2.8795688e-7,"teacher_disagreement_score":0.3174737,"about_ca_system_score_codex":0.00006932867,"about_ca_system_score_gemma":0.0001236893,"threshold_uncertainty_score":0.62003344},"labels":[],"label_agreement":null},{"id":"W4392977188","doi":"10.1016/j.cie.2024.110086","title":"Imperialist competitive algorithm for unrelated parallel machine scheduling with sequence-and-machine-dependent setups and compatibility and workload constraints","year":2024,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"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":"Workload; Computer science; Compatibility (geochemistry); Scheduling (production processes); Parallel computing; Algorithm; Mathematical optimization; Engineering; Mathematics; Operating system","score_opus":0.025400343423571302,"score_gpt":0.2321018545153736,"score_spread":0.2067015110918023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392977188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052879952,0.003500333,0.94038796,0.00010591358,0.0014150505,0.0006015203,0.00021589133,0.00086245954,0.000030935942],"genre_scores_gemma":[0.77753234,0.00021657131,0.22164528,0.000020377223,0.00035593918,0.00003599719,0.000104435516,0.00008039177,0.000008666572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986568,0.000027856859,0.00036498767,0.00045421658,0.00015231413,0.00034379153],"domain_scores_gemma":[0.99920547,0.0003454949,0.0000346674,0.00013995642,0.00004936512,0.00022506739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031292098,0.0003730618,0.00041237692,0.00016958128,0.00011706845,0.00031301787,0.00009698497,0.00021364953,0.000009201568],"category_scores_gemma":[0.000041148276,0.00035630967,0.000042510488,0.00023215543,0.00014951198,0.00019125146,0.00006601399,0.0005480445,0.0000010451736],"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.000035095472,0.000014033891,0.00018382365,0.00017330704,0.00035602652,0.0000406613,0.00049166876,0.85508794,0.00021886946,0.00087963353,0.000010117816,0.14250882],"study_design_scores_gemma":[0.0019515876,0.00009040638,0.00005751014,0.00058804266,0.00007460563,0.000114117,0.000094116585,0.996227,0.00019152176,0.000022599448,0.000177792,0.00041069638],"about_ca_topic_score_codex":0.000033086122,"about_ca_topic_score_gemma":0.0000040722384,"teacher_disagreement_score":0.7246524,"about_ca_system_score_codex":0.000089830995,"about_ca_system_score_gemma":0.000043181302,"threshold_uncertainty_score":0.9998889},"labels":[],"label_agreement":null},{"id":"W4393051924","doi":"10.3917/riges.484.0073","title":"Surexcitation artificielle pour l’IA ?","year":2024,"lang":"fr","type":"article","venue":"Gestion","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.016493015770045333,"score_gpt":0.248952521465268,"score_spread":0.23245950569522267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393051924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01185571,0.029463684,0.90151477,0.03890652,0.012598219,0.00012876744,0.000021866004,0.000970485,0.0045399894],"genre_scores_gemma":[0.6001014,0.0014247918,0.27538848,0.0000906467,0.0024054067,0.000028686583,0.00020649158,0.00013044772,0.12022362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992739,0.00004343771,0.00018203977,0.00018182478,0.00012734118,0.00019147612],"domain_scores_gemma":[0.9996382,0.00011866927,0.0000131410125,0.00010881594,0.00005715323,0.00006401083],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025406378,0.000121296,0.00008102459,0.000117974785,0.000057339388,0.00017259918,0.000042845066,0.00018474823,0.00084213563],"category_scores_gemma":[0.0000839316,0.0001432932,0.00005402513,0.0003502371,0.000021035823,0.00019076465,0.0000072499156,0.000245138,0.003611317],"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.0000018947442,0.000017604476,0.000030723248,0.00019594278,0.000026501393,0.000016213486,0.00063356553,0.8142379,0.0007736244,0.018933317,0.010033571,0.15509915],"study_design_scores_gemma":[0.000076086035,0.000016211985,0.0006887383,0.00034883927,0.000043808028,0.000021237209,0.0001225591,0.9666738,0.0009542953,0.001557657,0.029342676,0.00015408258],"about_ca_topic_score_codex":0.000048612925,"about_ca_topic_score_gemma":0.0000059611234,"teacher_disagreement_score":0.6261263,"about_ca_system_score_codex":0.00012645022,"about_ca_system_score_gemma":0.00004564469,"threshold_uncertainty_score":0.9971645},"labels":[],"label_agreement":null},{"id":"W4393100869","doi":"10.5267/j.dsl.2024.2.005","title":"Adopting new ARIMA double layering technique in make-to-stock production policy","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals","keywords":"Layering; Stock (firearms); Production (economics); Autoregressive integrated moving average; Computer science; Operations research; Business; Industrial engineering; Econometrics; Economics; Engineering; Mathematics; Microeconomics; Statistics; Time series; Mechanical engineering","score_opus":0.022304571745749006,"score_gpt":0.30082189328452474,"score_spread":0.27851732153877573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393100869","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23112215,0.000057430032,0.7626678,0.0038419634,0.0012014938,0.0002609785,4.908914e-7,0.0005530523,0.0002946652],"genre_scores_gemma":[0.43604323,0.000011206118,0.5627251,0.000651524,0.00041142115,0.000035961886,8.059994e-7,0.00003132109,0.00008938245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985843,0.000005746779,0.00024593627,0.0004006051,0.0004247824,0.00033863308],"domain_scores_gemma":[0.99952215,0.000042634576,0.000013102813,0.00025861256,0.000026874533,0.00013663188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353411,0.00012224718,0.00010390165,0.00127338,0.00008783034,0.00033434868,0.00030589747,0.000043079108,0.000011111714],"category_scores_gemma":[0.00021517533,0.000119062075,0.000030138688,0.0039517074,0.000043065786,0.00039902818,0.00006628161,0.00021476806,0.00009434442],"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.000004692889,0.0000028417014,0.000057331352,0.000009024442,0.0000011797173,0.000010686367,0.00041399358,0.7650777,0.089946344,0.0001043919,0.00070769567,0.14366408],"study_design_scores_gemma":[0.00052981474,0.00003908283,0.0023917982,0.0010951645,0.000006964046,0.0001443941,0.00020136137,0.79771984,0.17189677,0.00034209227,0.024752194,0.0008805572],"about_ca_topic_score_codex":0.000049508875,"about_ca_topic_score_gemma":0.0000066876255,"teacher_disagreement_score":0.20492108,"about_ca_system_score_codex":0.00028302305,"about_ca_system_score_gemma":0.00009306513,"threshold_uncertainty_score":0.48552105},"labels":[],"label_agreement":null},{"id":"W4393121363","doi":"10.5267/j.ijiec.2024.1.001","title":"Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Flow shop scheduling; Mathematical optimization; Job shop scheduling; Sequence (biology); Scheduling (production processes); Computer science; Flow (mathematics); Mathematics; Biology; Schedule; Genetics","score_opus":0.021283955774783626,"score_gpt":0.23967310276866516,"score_spread":0.21838914699388154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042048942,0.00031666528,0.95547193,0.00033292617,0.0015883824,0.0000894074,0.000024179895,0.0000915114,0.00003603934],"genre_scores_gemma":[0.76130533,0.000040620464,0.2382565,0.000005819214,0.00034560874,0.0000024517774,0.000009008919,0.000026451331,0.000008199644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989915,0.000014882799,0.00043291095,0.000091430935,0.00037203924,0.000097220625],"domain_scores_gemma":[0.99939936,0.000093817755,0.00006702955,0.000060357008,0.000326544,0.00005290049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019809681,0.00012309557,0.0001420085,0.00027427048,0.000041217263,0.00018725624,0.00020099487,0.000055361863,0.0000135835335],"category_scores_gemma":[0.0000758016,0.000094598785,0.000060406757,0.0002262874,0.000025968713,0.00027652213,0.000028072032,0.00034991387,6.2829133e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007912475,0.000008303124,0.000019585295,0.000017035756,0.00020880674,0.000011395771,0.00019350115,0.99614865,0.00009754408,0.0002360302,0.000015122339,0.0030360934],"study_design_scores_gemma":[0.00040282556,0.000025063839,0.0000014375835,0.0006532467,0.00004456219,0.00024018805,0.000058890786,0.9978994,0.00049481017,0.000058429745,0.000023736226,0.00009740807],"about_ca_topic_score_codex":0.0000045858555,"about_ca_topic_score_gemma":4.911535e-7,"teacher_disagreement_score":0.7192564,"about_ca_system_score_codex":0.0000949676,"about_ca_system_score_gemma":0.00014249218,"threshold_uncertainty_score":0.38576263},"labels":[],"label_agreement":null},{"id":"W4393121416","doi":"10.5267/j.ijiec.2023.12.006","title":"Production control problem for multi-product multi-resource make-to-stock systems","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stock (firearms); Computer science; Product (mathematics); Production (economics); Manufacturing engineering; Engineering; Business; Mathematics; Economics; Microeconomics; Mechanical engineering","score_opus":0.042823808629635675,"score_gpt":0.28272757652592145,"score_spread":0.23990376789628579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00404938,0.00059425615,0.9803621,0.00082527153,0.013246201,0.00051427487,0.000068408015,0.0003274126,0.0000126748155],"genre_scores_gemma":[0.66336197,0.000013646471,0.3303209,0.000030661326,0.0058198688,0.00008234334,0.000043222353,0.00010206068,0.00022534771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998645,0.000020049267,0.0006453353,0.0001764526,0.00032851505,0.00018464687],"domain_scores_gemma":[0.9989685,0.00015647241,0.000086024505,0.0000870867,0.0005749766,0.00012696571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042046682,0.000180064,0.00022157072,0.0006516369,0.00004432445,0.00027727545,0.00026577225,0.00008968685,0.000004138842],"category_scores_gemma":[0.00044509085,0.00018068023,0.0001325939,0.00032886802,0.0000108529575,0.00018795364,0.0000144408,0.00035821035,0.000010135942],"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.000021026475,0.00003554081,0.000018152297,0.000036046626,0.00036693615,0.000010276235,0.00020954195,0.98604584,0.0006452185,0.00021343115,0.001676466,0.010721516],"study_design_scores_gemma":[0.0012580447,0.000049399117,0.00003152508,0.00045670016,0.000052681065,0.00013852444,0.000049214013,0.9847508,0.00034996323,0.000004669875,0.012682374,0.00017609258],"about_ca_topic_score_codex":0.0000043135587,"about_ca_topic_score_gemma":6.941885e-7,"teacher_disagreement_score":0.6593126,"about_ca_system_score_codex":0.00024164625,"about_ca_system_score_gemma":0.000089892004,"threshold_uncertainty_score":0.7367926},"labels":[],"label_agreement":null},{"id":"W4393121421","doi":"10.5267/j.ijiec.2023.12.007","title":"An improved iterated greedy algorithm for distributed mixed no-wait permutation flowshop problems with makespan criterion","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Liaocheng University; National Natural Science Foundation of China; Natural Science Foundation of Shandong Province; Strong","keywords":"Greedy algorithm; Permutation (music); Iterated function; Job shop scheduling; Mathematical optimization; Algorithm; Mathematics; Computer science; Routing (electronic design automation)","score_opus":0.016826671395315913,"score_gpt":0.252478147932832,"score_spread":0.2356514765375161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020504538,0.0001185883,0.9724118,0.00021105233,0.005801045,0.00025911647,0.00031551518,0.00036787716,0.0000104423],"genre_scores_gemma":[0.68031895,0.00002068381,0.31525987,0.000022433096,0.0029827598,0.000048696154,0.0012002918,0.000117245974,0.0000290467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863756,0.000022616372,0.0006172748,0.00018113694,0.00033954557,0.00020187658],"domain_scores_gemma":[0.9983435,0.00017359511,0.00010313515,0.00009102561,0.0011456168,0.00014311358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026253026,0.00022647831,0.00022456053,0.0005245422,0.000055080272,0.00052062,0.00026357174,0.00014141097,0.000024767216],"category_scores_gemma":[0.000115648596,0.00021124186,0.00011049343,0.0004007528,0.000019088959,0.00063102756,0.000010705218,0.00038159572,0.0000056324366],"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.00003030585,0.00004188681,0.000007689787,0.000023173465,0.00033673018,0.000024112622,0.00022244384,0.9562583,0.0015995797,0.00006213792,0.00024480635,0.04114881],"study_design_scores_gemma":[0.0014221374,0.00029131878,0.000045719284,0.0003961669,0.00006746091,0.00016936418,0.000064395186,0.99499804,0.0005914634,0.000031032054,0.0016854118,0.00023751693],"about_ca_topic_score_codex":0.0000057998686,"about_ca_topic_score_gemma":0.000001780141,"teacher_disagreement_score":0.6598144,"about_ca_system_score_codex":0.00022638982,"about_ca_system_score_gemma":0.00013059827,"threshold_uncertainty_score":0.8614193},"labels":[],"label_agreement":null},{"id":"W4393121446","doi":"10.5267/j.ijiec.2024.2.002","title":"A case study of whale optimization algorithm for scheduling in C2M model","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Whale; Scheduling (production processes); Optimization algorithm; Computer science; Mathematical optimization; Job shop scheduling; Algorithm; Business; Mathematics; Fishery; Computer network; Biology","score_opus":0.040808429035197935,"score_gpt":0.29046878346220917,"score_spread":0.24966035442701123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15776183,0.00013714454,0.8395993,0.000037570037,0.002190401,0.00017180639,0.000022902494,0.00007059471,0.000008435289],"genre_scores_gemma":[0.64248407,0.000011165171,0.35709536,0.0000025126278,0.00035845282,0.000009913324,0.000008651662,0.000026450673,0.0000034069046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988171,0.000013240385,0.00070081506,0.00009986232,0.00025822897,0.000110783316],"domain_scores_gemma":[0.99918187,0.00023753221,0.0000852771,0.00005622628,0.00038518,0.000053926095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002994135,0.0001231486,0.00019994822,0.0008430099,0.000019843903,0.0000964913,0.00016536331,0.00008687949,0.000005634848],"category_scores_gemma":[0.00013273594,0.0001329896,0.00008644156,0.0003758938,0.000008273279,0.0002925083,0.000016178996,0.00028753091,3.9652716e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063220277,0.00008950335,0.000011313676,0.000011771062,0.00018334007,0.000263774,0.0009848312,0.97991234,0.000024190505,0.00006300006,0.000020210218,0.018429419],"study_design_scores_gemma":[0.001423812,0.000085834145,0.0000010418227,0.00021564351,0.00003752567,0.00064103276,0.00077907747,0.9965733,0.00010152062,0.000021887166,0.000010313387,0.00010897179],"about_ca_topic_score_codex":0.000012534971,"about_ca_topic_score_gemma":0.0000022459374,"teacher_disagreement_score":0.48472226,"about_ca_system_score_codex":0.00014046572,"about_ca_system_score_gemma":0.0001008423,"threshold_uncertainty_score":0.5423159},"labels":[],"label_agreement":null},{"id":"W4393121469","doi":"10.5267/j.ijiec.2023.12.011","title":"A multi-objective fuzzy flexible job shop scheduling problem considering the maximization of processing quality","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maximization; Job shop scheduling; Flow shop scheduling; Computer science; Mathematical optimization; Fuzzy logic; Scheduling (production processes); Job shop; Quality (philosophy); Operations research; Engineering; Mathematics; Artificial intelligence; Embedded system","score_opus":0.04966639635301317,"score_gpt":0.30729064664747735,"score_spread":0.2576242502944642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393121469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033767164,0.001002018,0.9616064,0.00040587678,0.0026395558,0.00014613218,0.000017664594,0.00023711218,0.00017810502],"genre_scores_gemma":[0.7938946,0.000038066974,0.20530431,0.000011463903,0.0006770092,0.000006577832,0.000009375149,0.00003797322,0.000020632398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984171,0.00003754394,0.00084335293,0.00011926786,0.00043536164,0.00014739993],"domain_scores_gemma":[0.9986509,0.00035016355,0.00018089297,0.00007730714,0.0006771785,0.000063549975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058276,0.00016182127,0.00022320868,0.0004705275,0.000058748727,0.00023398061,0.00028607153,0.00010683198,0.000012367165],"category_scores_gemma":[0.00039419148,0.00013899636,0.00013350666,0.00052761403,0.000038650393,0.00039517303,0.000034035318,0.0005341616,0.000002835081],"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.000010972071,0.00002009651,0.00013053027,0.000043661104,0.00025848168,0.000009198919,0.0009062938,0.9859204,0.0010227953,0.0008204202,0.000039834602,0.010817283],"study_design_scores_gemma":[0.0006051649,0.00002137889,0.00015269805,0.00071103865,0.000042259504,0.00009113959,0.00033429512,0.9959666,0.0016183698,0.00017512766,0.00014293849,0.00013897552],"about_ca_topic_score_codex":0.000009975339,"about_ca_topic_score_gemma":0.0000013841787,"teacher_disagreement_score":0.7601274,"about_ca_system_score_codex":0.00017332828,"about_ca_system_score_gemma":0.00021582047,"threshold_uncertainty_score":0.5668107},"labels":[],"label_agreement":null},{"id":"W4393307376","doi":"10.1287/ijoc.2023.0128","title":"Computing Bipath Multicommodity Flows with Constraint Programming–Based Branch-and-Price-and-Cut","year":2024,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Branch and cut; Mathematical optimization; Branch and price; Constraint programming; Branch and bound; Constraint (computer-aided design); Computer science; Integer programming; Mathematics; Operations research; Stochastic programming","score_opus":0.012279779361066251,"score_gpt":0.23844038332845285,"score_spread":0.2261606039673866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393307376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4464526,0.00033718138,0.55145746,0.00011381996,0.00056631916,0.00012400694,0.0000022579095,0.00053552486,0.0004108592],"genre_scores_gemma":[0.8489315,0.000018303885,0.1505808,0.0001388461,0.00028580628,9.2313564e-7,0.0000037853208,0.00003588218,0.0000041429357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000018778514,0.00043870593,0.00017598158,0.00026812544,0.00037912303],"domain_scores_gemma":[0.99922043,0.00028128747,0.00007855672,0.00010543769,0.000088518515,0.00022574008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005719377,0.0002514012,0.00025303752,0.00024492998,0.0002945756,0.0007990379,0.00011175698,0.00008574867,0.000009450685],"category_scores_gemma":[0.000056910616,0.000186352,0.00006304307,0.00026676687,0.000069478934,0.00021422704,0.000037700782,0.0008018482,0.00001005563],"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.000009136761,0.0000116312995,0.00059140107,0.000116530944,0.00006124169,0.00005112625,0.00067674334,0.64020145,0.00001289737,0.00016521935,0.000012810572,0.35808983],"study_design_scores_gemma":[0.00068387826,0.000118522454,0.0005372592,0.0008047105,0.00002083859,0.00057879504,0.00013576754,0.9956892,0.0001322623,0.000023685401,0.0010046635,0.00027037904],"about_ca_topic_score_codex":0.0000032353537,"about_ca_topic_score_gemma":0.0000016810895,"teacher_disagreement_score":0.40247893,"about_ca_system_score_codex":0.000079075966,"about_ca_system_score_gemma":0.00006582877,"threshold_uncertainty_score":0.77051413},"labels":[],"label_agreement":null},{"id":"W4393790549","doi":"10.5281/zenodo.5651624","title":"WageIndicator Collective Agreements Database Dataset with Full Texts and Selected Clauses","year":2021,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canarie","funders":"European Commission","keywords":"Computer science; Database; Information retrieval","score_opus":0.018800319607964605,"score_gpt":0.22840370675665725,"score_spread":0.20960338714869264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393790549","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015874673,0.00031882487,0.0023624632,0.000041201944,0.000103134334,0.0003949081,0.9954537,0.00056402956,0.0006029705],"genre_scores_gemma":[0.00008796305,0.00072245457,0.0022155615,0.00006891125,0.00012432724,1.8664555e-7,0.99565077,0.0010081936,0.00012166298],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981091,0.00021408065,0.00026884975,0.0005755615,0.00044515057,0.00038725528],"domain_scores_gemma":[0.9984212,0.000034950368,0.00010180553,0.0007193079,0.0004637948,0.00025895127],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000250855,0.0003117236,0.0002776489,0.0003683397,0.001151753,0.0008817033,0.000709614,0.00015116877,0.007948465],"category_scores_gemma":[0.0004106109,0.00031871823,0.000020538957,0.0011225763,0.00013314828,0.00021541337,0.000760822,0.0005741495,0.0017605593],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000044309632,0.000077054065,2.95149e-7,0.00020751354,0.00019767354,0.000076258504,0.00008775132,0.00047392066,0.00009143687,0.00000288046,0.9970835,0.0016574127],"study_design_scores_gemma":[0.0006923388,0.00016294376,0.00002395588,0.00012292337,0.00008869308,0.00018306407,0.00010697937,0.001813292,0.00011460923,0.0000015206136,0.99631673,0.00037296768],"about_ca_topic_score_codex":0.000014913871,"about_ca_topic_score_gemma":0.0000043213563,"teacher_disagreement_score":0.006187906,"about_ca_system_score_codex":0.00018753816,"about_ca_system_score_gemma":0.00002000826,"threshold_uncertainty_score":0.9999265},"labels":[],"label_agreement":null},{"id":"W4393994304","doi":"10.1007/s10479-024-05940-7","title":"A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Flow shop scheduling; Computer science; Scheduling (production processes); Distributed computing; Permutation (music); Mathematical optimization; Job shop scheduling; Parallel computing; Mathematics; Embedded system","score_opus":0.1292306165847016,"score_gpt":0.3796719194277512,"score_spread":0.25044130284304955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393994304","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008547986,0.0011611993,0.99257517,0.0039874325,0.0000675203,0.000894084,0.00011025805,0.00020675757,0.00014278566],"genre_scores_gemma":[0.41920632,0.00030669407,0.5777353,0.000043369466,0.000116672156,0.000695303,0.0007569915,0.00006685528,0.0010724787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998614,0.0000630366,0.0003159593,0.00021886146,0.00038278307,0.00040532643],"domain_scores_gemma":[0.99751896,0.0003356636,0.000009649996,0.00024291678,0.0018225246,0.00007025955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014492316,0.00012271578,0.00012231155,0.0003411908,0.0005739023,0.0005141468,0.00021022325,0.000096532756,0.000050837352],"category_scores_gemma":[0.0004540303,0.000100202335,0.00007954745,0.0011521284,0.00007826938,0.00038843587,0.000029119796,0.00027762094,0.0000072708367],"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.000013492745,0.000031158354,0.0000015988497,0.00024886715,0.000044456636,0.0000012107888,0.00054568006,0.9934199,0.00006288715,0.0038529546,0.0010464027,0.00073142047],"study_design_scores_gemma":[0.00018376639,0.00003748277,0.0000013030535,0.00008492079,0.000013782596,8.478425e-7,0.0008041032,0.9976472,0.000795089,0.00014927874,0.0001705414,0.0001116345],"about_ca_topic_score_codex":0.00003229306,"about_ca_topic_score_gemma":0.00001739708,"teacher_disagreement_score":0.41835153,"about_ca_system_score_codex":0.00006871864,"about_ca_system_score_gemma":0.00038543364,"threshold_uncertainty_score":0.49579298},"labels":[],"label_agreement":null},{"id":"W4394015686","doi":"10.1016/j.asoc.2024.111570","title":"Profit maximization through integrated order acceptance and scheduling: A metaheuristic approach","year":2024,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval","funders":"National Natural Science Foundation of China","keywords":"Profit maximization; Metaheuristic; Computer science; Mathematical optimization; Maximization; Profit (economics); Scheduling (production processes); Order (exchange); Microeconomics; Economics; Artificial intelligence; Mathematics","score_opus":0.014122492795128833,"score_gpt":0.23202832921384334,"score_spread":0.2179058364187145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394015686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013802506,0.0019816484,0.9770466,0.000038625218,0.00035278694,0.00023856819,0.0000025165314,0.0017784993,0.0047582514],"genre_scores_gemma":[0.5047637,0.000027766468,0.49493188,0.00003977523,0.00010954463,0.000013190908,0.000038660106,0.0000471786,0.000028311566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989571,0.000015238981,0.00027328674,0.00035324463,0.0001444561,0.00025670303],"domain_scores_gemma":[0.9996014,0.00010702434,0.00002760014,0.000149626,0.000059994636,0.000054304466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019194659,0.0002196112,0.00020846783,0.00008923987,0.0001225038,0.0002614083,0.0001137487,0.00010816242,0.000018000923],"category_scores_gemma":[0.00005068461,0.00021221761,0.000028657965,0.0007916851,0.00004184003,0.00011411444,0.000046366727,0.00031446354,0.00002856461],"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.0000031848829,0.000006261771,0.000052535004,0.00022199318,0.00009417808,0.0000026795344,0.0011775084,0.9551909,0.00013137603,0.007875942,0.000054988806,0.035188474],"study_design_scores_gemma":[0.00018274313,0.000004780718,0.000033611526,0.000058066955,0.000037291913,0.000012425723,0.00035652833,0.9979219,0.00026457486,0.0005144776,0.00037116354,0.00024246376],"about_ca_topic_score_codex":0.000002555018,"about_ca_topic_score_gemma":2.72114e-7,"teacher_disagreement_score":0.4909612,"about_ca_system_score_codex":0.00004104784,"about_ca_system_score_gemma":0.000029254952,"threshold_uncertainty_score":0.8653983},"labels":[],"label_agreement":null},{"id":"W4394807473","doi":"10.1007/s13762-024-05595-8","title":"An energy-efficient unrelated parallel machine scheduling problem with learning effect of operators and deterioration of jobs","year":2024,"lang":"en","type":"article","venue":"International Journal of Environmental Science and Technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":13,"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é du Québec à Montréal; Université Laval; Université de Sherbrooke","funders":"","keywords":"Job shop scheduling; Mathematical optimization; Computer science; Metaheuristic; Tardiness; Scheduling (production processes); Particle swarm optimization; Efficient energy use; Energy consumption; Artificial intelligence; Machine learning; Engineering; Mathematics; Schedule","score_opus":0.001844664659443737,"score_gpt":0.20101942150773278,"score_spread":0.19917475684828903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394807473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98114955,0.0010308654,0.017599005,0.000060277656,0.000086222404,0.0000277595,0.0000019944491,0.000021500648,0.000022790686],"genre_scores_gemma":[0.9877207,0.00024314389,0.012013016,0.0000023124878,0.000009972643,0.0000011154224,0.0000012368644,0.0000060597754,0.0000024001895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940205,0.000010824757,0.00018775793,0.00008918336,0.00024403533,0.00006616513],"domain_scores_gemma":[0.9998146,0.000019469406,0.000063286774,0.00003388691,0.000035567078,0.000033159537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002783084,0.000064328735,0.00009850002,0.00035810578,0.000031404987,0.0000288329,0.0001245726,0.0000428769,0.000008098437],"category_scores_gemma":[0.00001571612,0.000046849997,0.000010565673,0.00020768704,0.00028015336,0.00017977525,0.000027890861,0.00012318356,2.0678706e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032981236,0.00002921713,0.01274244,0.000015628579,0.000060853217,0.000018968614,0.0001825682,0.573079,0.35063875,0.00053589395,2.0680336e-7,0.06266349],"study_design_scores_gemma":[0.00039517193,0.0007389194,0.0017062406,0.0001296425,0.000018785922,0.00027165815,0.00013780675,0.9100492,0.08640531,0.000056727735,0.000019947469,0.00007060958],"about_ca_topic_score_codex":0.0000029047987,"about_ca_topic_score_gemma":6.2900745e-7,"teacher_disagreement_score":0.33697018,"about_ca_system_score_codex":0.000044214026,"about_ca_system_score_gemma":0.000016855387,"threshold_uncertainty_score":0.19104874},"labels":[],"label_agreement":null},{"id":"W4395665871","doi":"10.18280/mmep.110415","title":"Solving Tri-criteria: Total Completion Time, Total Earliness, and Maximum Tardiness Using Exact and Heuristic Methods on Single-Machine Scheduling Problems","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Computer science; Single-machine scheduling; Due date; Scheduling (production processes); Mathematical optimization; Heuristic; Job shop scheduling; Mathematics; Schedule","score_opus":0.03320743579751229,"score_gpt":0.25921833877004613,"score_spread":0.22601090297253384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395665871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12998386,0.004359328,0.86414874,0.000043584387,0.00030027234,0.00026109756,0.000015319658,0.0007975906,0.0000902072],"genre_scores_gemma":[0.48816594,0.00014127487,0.5113441,0.0000046162654,0.0001447342,0.000024117517,0.000016146629,0.00012453944,0.000034534467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982471,0.00003826528,0.0005413063,0.00047953796,0.00025037045,0.00044342387],"domain_scores_gemma":[0.9991417,0.00037916185,0.00003531151,0.00017711429,0.000060556224,0.00020618486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007923162,0.00044729759,0.0005472446,0.00026669886,0.00014565076,0.00051542255,0.000067303656,0.00018673556,0.000022233717],"category_scores_gemma":[0.00011053531,0.0004195894,0.000063497304,0.0002700932,0.000058569396,0.00024110069,0.00006760051,0.00044461363,0.000005924309],"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.0000055380483,0.000030500712,0.000001662544,0.0026054247,0.00007057011,0.0000070218753,0.00050017226,0.98670304,0.006917685,0.0005043556,0.0000022624258,0.0026517664],"study_design_scores_gemma":[0.0003024097,0.00006395291,0.0000034134976,0.0018913633,0.00009081631,0.0002508605,0.00002083346,0.99480087,0.00028311176,0.0017789482,0.00003558798,0.0004778198],"about_ca_topic_score_codex":0.0000086712735,"about_ca_topic_score_gemma":9.524573e-8,"teacher_disagreement_score":0.35818207,"about_ca_system_score_codex":0.00006855604,"about_ca_system_score_gemma":0.000012271164,"threshold_uncertainty_score":0.9998256},"labels":[],"label_agreement":null},{"id":"W4395960912","doi":"10.18280/jesa.570222","title":"An Integrated Inventory-Routing and Working Capital Requirement Model for a Two-Echelon Supply Chain","year":2024,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Supply chain; Business; Routing (electronic design automation); Industrial organization; Operations research; Computer science; Operations management; Economics; Engineering; Computer network; Marketing","score_opus":0.026490245207120552,"score_gpt":0.2669336287031335,"score_spread":0.2404433834960129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395960912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2605325,0.0032104969,0.73399234,0.000064076616,0.00079952035,0.00021970256,0.000014730303,0.00099298,0.0001736689],"genre_scores_gemma":[0.84373885,0.00013608555,0.15546665,0.000029964587,0.00030315926,0.000020186417,0.000015349084,0.00009981323,0.00018996652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985545,0.000076273616,0.00051833777,0.00023320504,0.00023700287,0.00038068191],"domain_scores_gemma":[0.99940956,0.000065619766,0.00007528261,0.00014026338,0.00009651345,0.00021276197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690298,0.0002509045,0.00025214112,0.00026913898,0.00024299594,0.0008237762,0.00016387865,0.00008142482,0.000020582642],"category_scores_gemma":[0.00007839858,0.00022576343,0.000091305585,0.00026582382,0.000042820287,0.0004265504,0.000025387522,0.00034030163,0.000008091008],"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.000008943047,0.000020773385,0.00023183612,0.0002444456,0.00014238158,0.000054215405,0.007232914,0.72442824,0.0017104367,0.0012959039,0.00024288354,0.264387],"study_design_scores_gemma":[0.00040360144,0.000073157935,0.0005138002,0.00096538913,0.000051594652,0.00029017119,0.0005682834,0.995585,0.00016805781,0.001044375,0.0000750946,0.00026147952],"about_ca_topic_score_codex":0.000009301975,"about_ca_topic_score_gemma":0.000013685598,"teacher_disagreement_score":0.58320636,"about_ca_system_score_codex":0.00029152652,"about_ca_system_score_gemma":0.00007753795,"threshold_uncertainty_score":0.92063653},"labels":[],"label_agreement":null},{"id":"W4396515071","doi":"10.1287/mnsc.2019.01586","title":"Production Chain Organization in the Digital Age: Information Technology Use and Vertical Integration in U.S. Manufacturing","year":2024,"lang":"en","type":"article","venue":"Management Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada; National Science Foundation","keywords":"Production (economics); Vertical integration; Industrial organization; Business; Chain (unit); Information technology; Operations management; Manufacturing engineering; Process management; Marketing; Computer science; Economics; Engineering; Microeconomics","score_opus":0.00655360322189233,"score_gpt":0.19838639561367968,"score_spread":0.19183279239178735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396515071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8948626,0.000021357388,0.102919176,0.00080855767,0.00030215573,0.00023479754,3.2433388e-7,0.00023560562,0.0006154146],"genre_scores_gemma":[0.9975036,0.000034372253,0.0023963088,0.000022803268,0.000008756954,0.000009839319,0.000007563423,0.0000032644946,0.000013522147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956733,0.000004128977,0.00010631331,0.00010018466,0.0001275381,0.000094499446],"domain_scores_gemma":[0.9998858,0.000008600652,0.0000041982075,0.00007973767,0.000012800095,0.000008855987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023997418,0.000046805297,0.000029318548,0.0005379433,0.000039387145,0.00059506565,0.0000904945,0.000020531024,0.0000013881664],"category_scores_gemma":[0.00011819661,0.000036804297,0.0000025918243,0.0016732637,0.00005730036,0.0014312902,0.000030040073,0.000082322964,0.000010026422],"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.0000029648183,0.000028705528,0.0051230122,0.00016415467,0.000005759296,0.000027164317,0.0049833744,0.41674015,0.0004300653,0.03925834,0.000094210394,0.5331421],"study_design_scores_gemma":[0.00010391628,0.000009859104,0.06716803,0.000102813705,0.0000038692942,0.0000091831935,0.0017194675,0.925552,0.0042071086,0.0005935532,0.00041365583,0.00011652505],"about_ca_topic_score_codex":0.0000018555902,"about_ca_topic_score_gemma":0.000003841783,"teacher_disagreement_score":0.53302556,"about_ca_system_score_codex":0.00006374124,"about_ca_system_score_gemma":0.0000034939626,"threshold_uncertainty_score":0.5738232},"labels":[],"label_agreement":null},{"id":"W4396653565","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Computer science; Mathematics; Mathematical optimization","score_opus":0.058051134955551566,"score_gpt":0.1942523233735875,"score_spread":0.13620118841803594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396653565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3336341,0.0007758852,0.6641312,0.000015816087,0.0005655055,0.00024750433,0.000018151912,0.000333538,0.00027826458],"genre_scores_gemma":[0.95612323,0.00046533116,0.043022048,0.0000063953084,0.00008769889,0.000003835574,0.00006135971,0.00004337987,0.00018672844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991888,0.000010130882,0.00017291748,0.00039843455,0.000042222226,0.00018752184],"domain_scores_gemma":[0.9995668,0.000072346804,0.0000388923,0.00018778905,0.0000702039,0.00006395082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001921926,0.0001950083,0.00020933592,0.00050553563,0.000036782847,0.000084623396,0.00014005475,0.00022067984,0.0000052164455],"category_scores_gemma":[0.00006206929,0.00024350104,0.00006579801,0.00069065235,0.000020188088,0.00008843496,0.0002156023,0.00039804488,0.000005503605],"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.000009165393,0.000010160319,0.00034196346,0.0005524241,0.00004352042,0.0000122888705,0.00012161091,0.98721653,0.000012331901,0.010592044,0.000013326499,0.0010746062],"study_design_scores_gemma":[0.00040008192,0.0000077171,0.00002132607,0.00015859371,0.00005683002,0.000001020776,0.00013827125,0.9933413,0.00026393073,0.005117884,0.00025139807,0.00024159596],"about_ca_topic_score_codex":0.000011823978,"about_ca_topic_score_gemma":0.000009517646,"teacher_disagreement_score":0.6224891,"about_ca_system_score_codex":0.00015861365,"about_ca_system_score_gemma":0.000028825874,"threshold_uncertainty_score":0.99296844},"labels":[],"label_agreement":null},{"id":"W4396739004","doi":"10.1007/s10479-024-06000-w","title":"Correction: A scenario-based robust optimization model for the sustainable distributed permutation flow-shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Flow shop scheduling; Permutation (music); Scheduling (production processes); Job shop scheduling; Distributed computing; Mathematical optimization; Operations research; Parallel computing; Mathematics; Embedded system; Routing (electronic design automation)","score_opus":0.11025586097731636,"score_gpt":0.37081598836369317,"score_spread":0.2605601273863768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396739004","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004591772,0.0009853516,0.99373984,0.0031745697,0.00024277768,0.00085456826,0.0000708563,0.00024289648,0.00022994415],"genre_scores_gemma":[0.47823673,0.00042614603,0.5153744,0.00005766763,0.00024064136,0.0010199117,0.0009865192,0.00009158508,0.0035664067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986226,0.00006616068,0.00032231864,0.00022795776,0.00037954812,0.00038139286],"domain_scores_gemma":[0.9972654,0.0004128027,0.0000110858455,0.00023407668,0.002007659,0.00006897064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013323462,0.00012622542,0.00012406685,0.00034802206,0.0006811442,0.0005257084,0.00018579174,0.00010250242,0.00006306814],"category_scores_gemma":[0.0005390048,0.00010533155,0.0000823434,0.0013057218,0.00007893446,0.00040688482,0.00002610595,0.00031912662,0.000007753163],"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.000016622114,0.000032963064,0.0000021019873,0.00017817813,0.000044319077,0.0000011176534,0.0005451719,0.9927761,0.00003645151,0.0014603755,0.0038464211,0.0010601656],"study_design_scores_gemma":[0.00017439404,0.000045544937,0.0000019540385,0.00010266913,0.000015055945,0.0000017158526,0.0009963962,0.99742836,0.00078766944,0.00007667861,0.00025390912,0.000115681454],"about_ca_topic_score_codex":0.000040992403,"about_ca_topic_score_gemma":0.000025745701,"teacher_disagreement_score":0.47836545,"about_ca_system_score_codex":0.000084853,"about_ca_system_score_gemma":0.0004088038,"threshold_uncertainty_score":0.52388793},"labels":[],"label_agreement":null},{"id":"W4396743035","doi":"10.1016/j.cor.2024.106687","title":"Simultaneous scheduling of jobs and transporters in a hybrid flow shop with collision-free transporter routing: A novel parallel heuristic","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"","keywords":"Scheduling (production processes); Computer science; Collision; Routing (electronic design automation); Vehicle routing problem; Heuristic; Mathematical optimization; Transporter; Parallel computing; Computer network; Chemistry; Mathematics; Gene; Artificial intelligence; Biochemistry","score_opus":0.024675487494487683,"score_gpt":0.28219094958867036,"score_spread":0.2575154620941827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396743035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30272186,0.00045319265,0.69602174,0.00022068815,0.00011332569,0.00027895608,0.000040779905,0.00011301393,0.000036458197],"genre_scores_gemma":[0.741741,0.00008717003,0.2579752,0.000010943643,0.00004676464,0.000028692413,0.000042857628,0.000034834102,0.00003255175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985392,0.00003892707,0.00037032313,0.00033180826,0.00038774955,0.00033198926],"domain_scores_gemma":[0.9990685,0.000359388,0.0000063356756,0.00027822854,0.00016688045,0.00012065703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043101332,0.0001665692,0.00023112145,0.00045334132,0.00014213598,0.00025801142,0.00023566974,0.0000623038,0.000015476862],"category_scores_gemma":[0.0000587102,0.00015242716,0.00003897676,0.0007277479,0.00015372703,0.00016771839,0.000023135923,0.00044877437,0.0000037587508],"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.00002498927,0.000046780697,0.000106628584,0.00012964387,0.000044307508,0.00014064765,0.0021615087,0.9942223,0.0002632006,0.00019789985,0.000026280404,0.002635834],"study_design_scores_gemma":[0.000788171,0.000077854726,0.00009057349,0.00042406502,0.000012706649,0.000035059496,0.00033094175,0.99779856,0.00021880055,0.0000104955225,0.00004333826,0.00016943624],"about_ca_topic_score_codex":0.00005725646,"about_ca_topic_score_gemma":0.00014312028,"teacher_disagreement_score":0.43901914,"about_ca_system_score_codex":0.00006667203,"about_ca_system_score_gemma":0.00014705464,"threshold_uncertainty_score":0.62157995},"labels":[],"label_agreement":null},{"id":"W4398395282","doi":"10.7910/dvn/mcw60q","title":"PROSPERED Dataset: Minimum wage policy","year":2018,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Canadian Institutes of Health Research","keywords":"Minimum wage; Wage; Economics; Labour economics","score_opus":0.012321604645565618,"score_gpt":0.24189517489824025,"score_spread":0.22957357025267464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398395282","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003489021,0.0000033671201,0.00043280967,0.0000051079546,0.001420385,0.00026368373,0.9973494,0.0003288401,0.00019292618],"genre_scores_gemma":[0.0000015012195,0.00048164654,0.008058145,0.00030339067,0.0017658953,0.000033655888,0.9890741,0.00007933949,0.00020234442],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99821806,0.000035079633,0.00040866065,0.000495889,0.00034169693,0.0005005959],"domain_scores_gemma":[0.99767846,0.000038662012,0.00009191328,0.001885753,0.00006164787,0.00024357502],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017535703,0.00048016146,0.00040414368,0.00036211047,0.0001102153,0.00018627095,0.0009135857,0.0004256821,0.016252013],"category_scores_gemma":[0.00022148466,0.0004994442,0.00008077574,0.00035971918,0.00011422423,0.0002773923,0.00028394553,0.00042750294,0.14062415],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000009786342,0.00003230021,3.7188929e-7,0.0001284578,0.00009632284,0.000045388148,0.000015340669,0.000711188,0.000007866303,0.0000068798686,0.9988067,0.00013940134],"study_design_scores_gemma":[0.00045723421,0.000027374877,0.000002606708,0.00007334205,0.00008856136,0.000018585033,0.000014706698,0.009934301,0.00004228085,0.000004560703,0.9887934,0.00054308295],"about_ca_topic_score_codex":0.00018905543,"about_ca_topic_score_gemma":0.000055870914,"teacher_disagreement_score":0.12437214,"about_ca_system_score_codex":0.00013082346,"about_ca_system_score_gemma":0.00013039773,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W4399007214","doi":"10.1016/j.cor.2024.106708","title":"Non-identical parallel machines batch processing problem to minimize the makespan: Models and algorithms","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Engineering and Physical Sciences Research Council; Loughborough University; University of Nottingham; University of Bath","keywords":"Job shop scheduling; Metaheuristic; Computer science; Mathematical optimization; Scheduling (production processes); Algorithm; Variable neighborhood search; Time complexity; Computational complexity theory; Flow shop scheduling; Batch processing; Mathematics; Routing (electronic design automation)","score_opus":0.048829012299315654,"score_gpt":0.34283733235463654,"score_spread":0.2940083200553209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399007214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042450787,0.001325602,0.9881686,0.0046396875,0.00029035276,0.00048982736,0.0000059365243,0.00027510364,0.0005598158],"genre_scores_gemma":[0.17821507,0.00017884931,0.8196754,0.00012755864,0.00038204083,0.0002578673,0.000022224303,0.000060123795,0.0010808992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859005,0.00007136818,0.0002529988,0.00032593927,0.0003973946,0.00036222622],"domain_scores_gemma":[0.9992522,0.00016008723,0.000003112977,0.00022509795,0.00019981335,0.00015970375],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007083552,0.00014828717,0.00014029304,0.00025945643,0.00045919,0.0015376089,0.00028132633,0.00006792935,0.00001953364],"category_scores_gemma":[0.00002763884,0.00011038541,0.000033884273,0.0007994375,0.000093319264,0.00029482396,0.00014828674,0.0004364031,0.00007143868],"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.000002784103,0.000013133879,0.000009146568,0.000075502765,0.000022976092,0.000009390214,0.0020739052,0.946049,0.00005678189,0.0007393604,0.0020185655,0.048929494],"study_design_scores_gemma":[0.00013454139,0.000020333444,0.000069316775,0.00012965861,0.0000067978526,0.00002186094,0.00018880266,0.9984471,0.000040092622,0.00025466364,0.00054918684,0.00013763482],"about_ca_topic_score_codex":0.000037644077,"about_ca_topic_score_gemma":0.000015769341,"teacher_disagreement_score":0.17396998,"about_ca_system_score_codex":0.000056335997,"about_ca_system_score_gemma":0.00009009214,"threshold_uncertainty_score":0.9994989},"labels":[],"label_agreement":null},{"id":"W4399043596","doi":"10.22260/isarc2024/0125","title":"Exploring the Potential of Reinforcement Learning in Pipe Spool Scheduling in Industrial Projects","year":2024,"lang":"en","type":"article","venue":"Proceedings of the ... ISARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Scheduling (production processes); Reinforcement; Industrial engineering; Artificial intelligence; Engineering; Operations management; Structural engineering","score_opus":0.04661913984480425,"score_gpt":0.22987987647401195,"score_spread":0.1832607366292077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399043596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9966142,0.00020308974,0.00057224784,0.00023745497,0.00068803574,0.00029882343,5.370656e-7,0.00011180994,0.001273781],"genre_scores_gemma":[0.9976414,0.00009776332,0.0019320984,0.000006194863,0.0001665849,0.000042819276,7.2752766e-7,0.00002795799,0.00008445171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896204,0.000007464138,0.00039594073,0.0001441525,0.00027255787,0.0002178407],"domain_scores_gemma":[0.9997508,0.000044561522,0.000060521987,0.00006727231,0.00005514558,0.000021708036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006019017,0.00012565815,0.00016905177,0.00023877302,0.00003891282,0.000059100486,0.0002734739,0.00006243366,0.000009467558],"category_scores_gemma":[0.00022436203,0.000088343084,0.000068425456,0.0008702387,0.000041033712,0.00030583923,0.000096067,0.0005693859,0.0000023809093],"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.000023558163,0.000011639713,0.0020510925,0.00023633926,0.000025229132,9.813637e-7,0.0037196316,0.9775285,0.010349679,0.0004135102,0.000017982895,0.005621849],"study_design_scores_gemma":[0.00044349043,0.000029548466,0.0007228708,0.0009577767,0.000018794948,0.0000040001087,0.0034804964,0.9521385,0.041898865,0.00008393715,0.00009203919,0.00012969149],"about_ca_topic_score_codex":0.00004408248,"about_ca_topic_score_gemma":0.0000020406483,"teacher_disagreement_score":0.031549186,"about_ca_system_score_codex":0.00007536973,"about_ca_system_score_gemma":0.00003872517,"threshold_uncertainty_score":0.36025265},"labels":[],"label_agreement":null},{"id":"W4399114203","doi":"10.1016/j.disopt.2024.100845","title":"Two-machine job shop problem with a single server and sequence-independent non-anticipatory set-up times","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Single-machine scheduling; Computer science; Sequence (biology); Mathematical optimization; Simulated annealing; Schedule; Set (abstract data type); Job shop; Scheduling (production processes); Due date; Flow shop scheduling; Algorithm; Mathematics","score_opus":0.01598366804719975,"score_gpt":0.25198201115861185,"score_spread":0.2359983431114121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399114203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026860869,0.0013623703,0.9628311,0.00020905225,0.00051559956,0.00046538972,0.000048565125,0.0011117627,0.0065953406],"genre_scores_gemma":[0.787469,0.00015389151,0.21074566,0.000040302846,0.00008244149,0.000046573106,0.00024422642,0.000112396294,0.0011054932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989216,0.000026403663,0.00023523871,0.00032448914,0.0002410108,0.00025128116],"domain_scores_gemma":[0.99957603,0.000027539916,0.000029447618,0.0001850705,0.00006843344,0.00011347849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015373384,0.00024267579,0.00018357912,0.00015576415,0.00009177329,0.00028751572,0.00009011376,0.00009092339,0.00016938226],"category_scores_gemma":[0.000008890063,0.00020638392,0.000037331865,0.00037039863,0.00004736402,0.0004456386,0.000031924315,0.00018172397,0.000021625532],"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.000010697892,0.0000059977874,0.00033424536,0.00013798154,0.00007082563,0.000015888401,0.00092106726,0.99738044,0.00013839197,0.00029668372,0.00007094716,0.00061681244],"study_design_scores_gemma":[0.00044041075,0.000058598675,0.000026948945,0.00020569022,0.00007154993,0.000030074707,0.00022895055,0.9979599,0.0005742055,0.000031285774,0.00007265555,0.00029971503],"about_ca_topic_score_codex":0.000025109624,"about_ca_topic_score_gemma":0.000019841907,"teacher_disagreement_score":0.76060814,"about_ca_system_score_codex":0.00007522924,"about_ca_system_score_gemma":0.00003851844,"threshold_uncertainty_score":0.8416092},"labels":[],"label_agreement":null},{"id":"W4399385237","doi":"10.1080/16258312.2024.2332167","title":"Variable neighbourhood search for parallel machine scheduling with a single loading server: a truck-scheduling perspective","year":2024,"lang":"en","type":"article","venue":"Supply Chain Forum an International Journal","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Metaheuristic; Truck; Solver; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Integer programming; Variable neighborhood search; Distributed computing; Artificial intelligence; Algorithm; Mathematics; Engineering; Computer network","score_opus":0.013154612536714525,"score_gpt":0.2607738000780744,"score_spread":0.24761918754135986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399385237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027445536,0.0014915279,0.9644343,0.0019219961,0.002192572,0.0002663543,0.00011792228,0.0004795947,0.0016501934],"genre_scores_gemma":[0.62677836,0.00007513914,0.37151557,0.00012202297,0.0010983656,0.000029743598,0.00008525496,0.0001059308,0.0001896219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800754,0.0000424477,0.0004102443,0.0003734537,0.00059381983,0.00057248375],"domain_scores_gemma":[0.9987947,0.00013652683,0.000058445865,0.0001623503,0.00058273284,0.0002652446],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057043415,0.00030411445,0.00024581671,0.0005264423,0.00027463722,0.001159925,0.00049105304,0.0001254262,0.0003884396],"category_scores_gemma":[0.00006614674,0.00027623356,0.00015882992,0.00033651807,0.00004266765,0.0010295276,0.000048789545,0.0006770855,0.000017497276],"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.00015881014,0.00008345783,0.00084063655,0.000044183365,0.0005953485,0.00008377615,0.0018726452,0.94318736,0.00064910675,0.04982792,0.00004286845,0.0026139035],"study_design_scores_gemma":[0.0013880294,0.00026451406,0.000046063462,0.00038593245,0.000045763158,0.00079618057,0.0035424833,0.9869057,0.001070744,0.0046908385,0.00048921903,0.0003745166],"about_ca_topic_score_codex":0.000056532466,"about_ca_topic_score_gemma":0.000029706449,"teacher_disagreement_score":0.5993328,"about_ca_system_score_codex":0.0006187165,"about_ca_system_score_gemma":0.00019543471,"threshold_uncertainty_score":0.999969},"labels":[],"label_agreement":null},{"id":"W4399580936","doi":"10.1007/s10479-024-06097-z","title":"Solving the two-machine open shop problem with a single server with respect to the makespan","year":2024,"lang":"en","type":"article","venue":"Annals of Operations Research","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":"Cégep de Chicoutimi; Université du Québec à Chicoutimi","funders":"Philippine Council for Agriculture, Aquatic and Natural Resources Research and Development","keywords":"Job shop scheduling; Integer programming; Open shop; Computer science; Completeness (order theory); Mathematical optimization; Integer (computer science); Mathematics; Flow shop scheduling; Computer network; Operating system; Routing (electronic design automation)","score_opus":0.13739894770600808,"score_gpt":0.4001093785665289,"score_spread":0.2627104308605208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399580936","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38236514,0.009138811,0.2059953,0.27818006,0.00041982424,0.009638808,0.00019775888,0.0010113475,0.113052934],"genre_scores_gemma":[0.9636079,0.00006966732,0.031431966,0.00018898556,0.00011427901,0.00021358521,0.000016183094,0.00005434617,0.004303102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987429,0.00013788206,0.00016828203,0.00019844325,0.00046595972,0.00028653082],"domain_scores_gemma":[0.9988326,0.00018378993,0.000005290903,0.00043799955,0.00046952543,0.000070825496],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015724289,0.00010411893,0.00010722089,0.00016550784,0.00038466338,0.0010881369,0.0005887984,0.00002463807,0.00014233337],"category_scores_gemma":[0.00008183457,0.000050416875,0.000022492644,0.0014037769,0.00007030231,0.000273764,0.00014119038,0.00036074378,0.00006807933],"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.000028097133,0.000027954868,0.000023480852,0.000025892814,0.000077363846,0.0000070342485,0.002063843,0.9890239,0.00033836756,0.0027169317,0.0033851503,0.0022819652],"study_design_scores_gemma":[0.00019084009,0.00033183707,0.000066254004,0.00027809964,0.000008966891,0.000019618905,0.0009720396,0.98034304,0.0052187266,0.00005154189,0.012381837,0.00013721362],"about_ca_topic_score_codex":0.00036851616,"about_ca_topic_score_gemma":0.0042038057,"teacher_disagreement_score":0.58124274,"about_ca_system_score_codex":0.000023759421,"about_ca_system_score_gemma":0.00014235152,"threshold_uncertainty_score":0.9999488},"labels":[],"label_agreement":null},{"id":"W4399634015","doi":"10.5267/j.dsl.2024.3.006","title":"A metaheuristic algorithm based on Ant Colony Based approach for the assigning tasks problem to a workforce with different skills","year":2024,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Metaheuristic; Workforce; Ant colony optimization algorithms; Computer science; Mathematical optimization; Algorithm; Artificial intelligence; Machine learning; Mathematics; Economics","score_opus":0.014932888472100947,"score_gpt":0.25997853035660096,"score_spread":0.2450456418845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399634015","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004137197,0.00004971435,0.99284434,0.0013887791,0.00044115973,0.00075032155,0.000017069384,0.00028026424,0.00009112852],"genre_scores_gemma":[0.22876003,0.0000013288658,0.76792216,0.0028540352,0.0000756532,0.0003131012,0.000007528266,0.000038734066,0.000027443577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792176,0.000022834605,0.0002416488,0.00052329345,0.0008631439,0.00042732107],"domain_scores_gemma":[0.99801326,0.0013269429,0.000027574608,0.00039719994,0.00006889929,0.00016613862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009459955,0.00022603651,0.00019051414,0.00041164522,0.00030445927,0.00063056167,0.00049977563,0.000039976483,0.000008897831],"category_scores_gemma":[0.00018245971,0.00012822269,0.00007767874,0.0016447845,0.00013019041,0.00012191412,0.000025729216,0.00020168032,0.000012264371],"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.00001680347,0.000023514158,0.0000112109865,0.000012898709,0.000008189389,0.0000072449616,0.00011545326,0.92973,0.00047909815,0.00002540208,0.0010649211,0.06850527],"study_design_scores_gemma":[0.00033834294,0.000099384466,0.00012293598,0.00020920034,0.000028038949,0.000003992798,0.000035459296,0.996735,0.0011792141,0.000011690939,0.0010268636,0.00020988921],"about_ca_topic_score_codex":0.0000015161996,"about_ca_topic_score_gemma":3.4855418e-7,"teacher_disagreement_score":0.22492222,"about_ca_system_score_codex":0.00014891039,"about_ca_system_score_gemma":0.00006337411,"threshold_uncertainty_score":0.6080521},"labels":[],"label_agreement":null},{"id":"W4399681246","doi":"10.5267/j.ijiec.2024.3.001","title":"A novel hybrid algorithm of genetic algorithm, variable neighborhood search and constraint programming for distributed flexible job shop scheduling problem","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Algorithm; Variable neighborhood search; Computer science; Job shop scheduling; Hybrid algorithm (constraint satisfaction); Constraint programming; Mathematical optimization; Scheduling (production processes); Variable (mathematics); Constraint logic programming; Metaheuristic; Mathematics; Stochastic programming; Schedule","score_opus":0.02386977824688337,"score_gpt":0.26570334906113396,"score_spread":0.2418335708142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399681246","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003086109,0.00063036475,0.9931717,0.00018129438,0.0020851665,0.0002697838,0.00038873125,0.00017352046,0.000013333006],"genre_scores_gemma":[0.12299558,0.000036961963,0.87594414,0.0000049096943,0.000870833,0.00001689035,0.00007759265,0.000046968682,0.0000061172423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998397,0.0000128226075,0.000793059,0.00016750168,0.00039026004,0.00023934597],"domain_scores_gemma":[0.9986457,0.00035562814,0.00009090742,0.00007009541,0.00069652585,0.00014114704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004043739,0.00019735114,0.00028500974,0.0005232946,0.00004426414,0.00026082137,0.000241033,0.00010959634,0.00001090523],"category_scores_gemma":[0.00016351727,0.00020712687,0.00012131557,0.00039228096,0.000044529348,0.0002369775,0.000039463474,0.0004385185,7.5697767e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068108366,0.00003470614,0.000016488126,0.00004981774,0.00043433558,0.000013426683,0.00012277471,0.83011353,0.00041803624,0.0008020658,0.000025211504,0.16796277],"study_design_scores_gemma":[0.0012889104,0.00009856992,0.000020188454,0.0006148718,0.00007602239,0.00041753944,0.00012418948,0.9957065,0.0009078912,0.00017938849,0.0003816057,0.00018430041],"about_ca_topic_score_codex":0.000009919423,"about_ca_topic_score_gemma":1.209844e-7,"teacher_disagreement_score":0.16777846,"about_ca_system_score_codex":0.00014690288,"about_ca_system_score_gemma":0.00025678068,"threshold_uncertainty_score":0.8446389},"labels":[],"label_agreement":null},{"id":"W4399828450","doi":"10.32920/26052688.v1","title":"Solving Binary Integer Programing Problems With Balas' Additive Algorithm Using Graphics Processing Units","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Graphics; Integer (computer science); Binary number; Computer science; Integer programming; Algorithm; Mathematics; Computer graphics (images); Arithmetic; Programming language","score_opus":0.02114256239108155,"score_gpt":0.24072891755897774,"score_spread":0.21958635516789618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009847259,0.0058819973,0.96916485,0.00008539846,0.0019543807,0.0015002476,0.00013966874,0.005977938,0.005448232],"genre_scores_gemma":[0.112098075,0.0003207165,0.88489735,0.00007244471,0.000687239,0.0003138153,0.0005479933,0.0005683247,0.00049405114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973654,0.00004418014,0.00059720373,0.00081301475,0.00051652186,0.0006636869],"domain_scores_gemma":[0.9985709,0.000060662936,0.00014360934,0.0003960741,0.0006315324,0.0001971765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032846566,0.0007780246,0.0005581094,0.0006975729,0.00020398367,0.00080523465,0.00033793505,0.00056768395,0.00004943613],"category_scores_gemma":[0.000038523394,0.0006747499,0.000115643474,0.0016450181,0.00013869324,0.00022001503,0.00052340014,0.0022189291,0.000016986549],"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.0000038328694,0.00003682449,0.00001760435,0.0017823254,0.0003064797,0.00007681101,0.001708291,0.9159931,0.000027796632,0.000105064464,0.000112291404,0.079829566],"study_design_scores_gemma":[0.00019977448,0.00004700589,0.000005718244,0.0051149842,0.00021444577,0.00006754795,0.001007583,0.99140656,0.0002661573,0.0003768772,0.0003630409,0.00093031925],"about_ca_topic_score_codex":0.00006793578,"about_ca_topic_score_gemma":0.000017304805,"teacher_disagreement_score":0.102250814,"about_ca_system_score_codex":0.00024830512,"about_ca_system_score_gemma":0.0004497764,"threshold_uncertainty_score":0.99957037},"labels":[],"label_agreement":null},{"id":"W4399828452","doi":"10.32920/26052688","title":"Solving Binary Integer Programing Problems With Balas' Additive Algorithm Using Graphics Processing Units","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Integer (computer science); Graphics; Binary number; Integer programming; Computer science; Algorithm; Arithmetic; Computer graphics (images); Mathematics; Programming language","score_opus":0.02114256239108155,"score_gpt":0.24072891755897774,"score_spread":0.21958635516789618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009847259,0.0058819973,0.96916485,0.00008539846,0.0019543807,0.0015002476,0.00013966874,0.005977938,0.005448232],"genre_scores_gemma":[0.112098075,0.0003207165,0.88489735,0.00007244471,0.000687239,0.0003138153,0.0005479933,0.0005683247,0.00049405114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973654,0.00004418014,0.00059720373,0.00081301475,0.00051652186,0.0006636869],"domain_scores_gemma":[0.9985709,0.000060662936,0.00014360934,0.0003960741,0.0006315324,0.0001971765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032846566,0.0007780246,0.0005581094,0.0006975729,0.00020398367,0.00080523465,0.00033793505,0.00056768395,0.00004943613],"category_scores_gemma":[0.000038523394,0.0006747499,0.000115643474,0.0016450181,0.00013869324,0.00022001503,0.00052340014,0.0022189291,0.000016986549],"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.0000038328694,0.00003682449,0.00001760435,0.0017823254,0.0003064797,0.00007681101,0.001708291,0.9159931,0.000027796632,0.000105064464,0.000112291404,0.079829566],"study_design_scores_gemma":[0.00019977448,0.00004700589,0.000005718244,0.0051149842,0.00021444577,0.00006754795,0.001007583,0.99140656,0.0002661573,0.0003768772,0.0003630409,0.00093031925],"about_ca_topic_score_codex":0.00006793578,"about_ca_topic_score_gemma":0.000017304805,"teacher_disagreement_score":0.102250814,"about_ca_system_score_codex":0.00024830512,"about_ca_system_score_gemma":0.0004497764,"threshold_uncertainty_score":0.99957037},"labels":[],"label_agreement":null},{"id":"W4399845062","doi":"10.1515/9782763714691","title":"Les tensions de l’errance","year":2002,"lang":"fr","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.038853063534925375,"score_gpt":0.24241514549223672,"score_spread":0.20356208195731135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399845062","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005036554,0.0034686083,0.33821172,0.0005165841,0.0011749517,0.000116460076,0.000022796225,0.00056100753,0.65587753],"genre_scores_gemma":[0.00035376108,0.0012241346,0.4137309,0.00013466195,0.0005008348,0.0000085885595,0.00003158974,0.00008416475,0.5839314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871755,0.0000315921,0.00033159176,0.00029432192,0.00018372972,0.00044123738],"domain_scores_gemma":[0.99912375,0.00015122975,0.000052317548,0.00035267783,0.000110038534,0.00020999597],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010448475,0.0003695873,0.00034204937,0.0001265285,0.00017525018,0.00005634648,0.00020945855,0.0006239189,0.009760354],"category_scores_gemma":[0.000085403866,0.00039357133,0.00016825562,0.00013854502,0.00008890823,0.00006109237,0.000034173547,0.00064066815,0.0020526997],"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.000001275061,0.000035434474,0.00009985531,0.00015069256,0.00010553922,0.00004071954,0.00023147753,0.89629084,0.000021937649,0.014974253,0.05084073,0.037207223],"study_design_scores_gemma":[0.00022345886,0.000016436252,0.00015657798,0.0003192374,0.0000735099,0.000051742943,0.000033979093,0.8344607,0.000080318874,0.0003525065,0.16374306,0.0004885072],"about_ca_topic_score_codex":0.00015228683,"about_ca_topic_score_gemma":0.000023278722,"teacher_disagreement_score":0.112902336,"about_ca_system_score_codex":0.00035379556,"about_ca_system_score_gemma":0.00008175586,"threshold_uncertainty_score":0.99985164},"labels":[],"label_agreement":null},{"id":"W4400032106","doi":"10.1016/b978-0-443-28824-1.50573-1","title":"Disjunctive Programming meets QUBO","year":2024,"lang":"en","type":"book-chapter","venue":"Computer-aided chemical engineering/Computer aided chemical engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"","keywords":"Computer science; Programming language","score_opus":0.006646702397889918,"score_gpt":0.18222784991802685,"score_spread":0.17558114752013693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400032106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012790349,0.004122744,0.96382743,0.00017525067,0.0096338885,0.0012056167,0.0001509731,0.014724367,0.0048806844],"genre_scores_gemma":[0.016783798,0.00024058785,0.956753,0.00019390573,0.015373848,0.00033364748,0.0013863419,0.0029455035,0.005989367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929268,0.000009099967,0.0019476569,0.0021112114,0.0010996499,0.0019055849],"domain_scores_gemma":[0.99650645,0.00046795217,0.00019324003,0.0013739408,0.00026038563,0.0011980245],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0002544647,0.0027609093,0.002231824,0.00088248897,0.00007569463,0.000578131,0.0014723333,0.0019723552,0.00013942893],"category_scores_gemma":[0.000061959734,0.0031320977,0.001194092,0.00053955376,0.00013858578,0.00035760333,0.000975352,0.0037530628,0.00044530138],"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.000018458766,0.00007015105,3.3002183e-7,0.0024321342,0.0014623207,0.00035444414,0.00031462597,0.94682014,0.013725572,0.011087681,0.0021874614,0.021526676],"study_design_scores_gemma":[0.0008546107,0.000074830095,5.5496173e-7,0.0021767882,0.00032653802,0.00024763652,0.0000021149588,0.931281,0.021658985,0.00034391606,0.039964646,0.003068436],"about_ca_topic_score_codex":0.000003113312,"about_ca_topic_score_gemma":1.5605708e-7,"teacher_disagreement_score":0.037777185,"about_ca_system_score_codex":0.0010994455,"about_ca_system_score_gemma":0.00007314594,"threshold_uncertainty_score":0.9993233},"labels":[],"label_agreement":null},{"id":"W4400643288","doi":"10.1016/j.asoc.2024.112002","title":"An incremental learning approach to dynamic parallel machine scheduling with sequence-dependent setups and machine eligibility restrictions","year":2024,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"National Research Foundation of Korea","keywords":"Computer science; Sequence (biology); Scheduling (production processes); Artificial intelligence; Machine learning; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.014332379089952304,"score_gpt":0.2587272297834334,"score_spread":0.24439485069348107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400643288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28277543,0.0003824938,0.7140886,0.00002465667,0.00009724259,0.00024400582,0.000008111735,0.0013658274,0.0010135794],"genre_scores_gemma":[0.70030385,0.000017349437,0.29942423,0.00002914401,0.000051869676,0.000015773465,0.00009097159,0.000054181368,0.000012640299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985388,0.000034539775,0.00029905862,0.00054008124,0.00024312038,0.00034440498],"domain_scores_gemma":[0.9994468,0.00008501358,0.000030112324,0.00021886088,0.000027299644,0.00019187792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000425553,0.0002658738,0.00022161027,0.00018583599,0.00033063482,0.00025691325,0.00014991932,0.000085137144,0.0000057692178],"category_scores_gemma":[0.000014884935,0.00025564453,0.000027675418,0.0004843651,0.000037073725,0.00011667272,0.00007685522,0.00059565814,0.000014596822],"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.000011696217,0.000028090366,0.0007087564,0.00008576005,0.00005133984,0.0000051746274,0.0008222359,0.9847415,0.0012878854,0.00041484015,0.0000016785176,0.011841007],"study_design_scores_gemma":[0.0002927394,0.000044474476,0.0003031487,0.000051587056,0.000029437077,0.000046466892,0.0005094316,0.99820447,0.00011096319,0.00007093607,0.000026054433,0.00031028845],"about_ca_topic_score_codex":0.000074794225,"about_ca_topic_score_gemma":0.000016467064,"teacher_disagreement_score":0.4175284,"about_ca_system_score_codex":0.00014486944,"about_ca_system_score_gemma":0.000030023559,"threshold_uncertainty_score":0.99998957},"labels":[],"label_agreement":null},{"id":"W4401286240","doi":"10.23952/asvao.6.2024.3.02","title":"An algorithmic approach to the robust downgrading makespan scheduling problem","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Computer science; Mathematical optimization; Scheduling (production processes); Mathematics; Embedded system","score_opus":0.01264310031870167,"score_gpt":0.22696040438882603,"score_spread":0.21431730407012436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017743474,0.00049877685,0.99429125,0.0001089512,0.00012288782,0.00039078415,0.000016928505,0.0007459681,0.0020501295],"genre_scores_gemma":[0.3060144,0.0001296332,0.6929403,0.00009195364,0.00020902093,0.000109579596,0.00039788758,0.000060506736,0.000046709847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984139,0.00004601166,0.0003824657,0.00054167095,0.00028949956,0.00032641256],"domain_scores_gemma":[0.99931145,0.000038998758,0.000038033177,0.00036670762,0.000064605,0.00018018154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055542454,0.00028708676,0.00031457085,0.0005906762,0.00030488198,0.000729885,0.00022279289,0.00013552801,0.00003896672],"category_scores_gemma":[0.0000092265755,0.00022683202,0.00010779727,0.0029961749,0.00003253321,0.00020863856,0.00003142946,0.00024711606,0.000016666],"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.0000036876852,0.000017905266,0.000017222294,0.000041416,0.0004259138,6.7125836e-7,0.0010950386,0.988219,0.000071147486,0.0021042437,0.000047291775,0.007956437],"study_design_scores_gemma":[0.00013871395,0.000013115865,0.000028841141,0.000016877575,0.0006671915,0.0000034109903,0.0006985443,0.99784255,0.00010650721,0.000044727432,0.00012708294,0.00031240704],"about_ca_topic_score_codex":0.000019096291,"about_ca_topic_score_gemma":0.000007355144,"teacher_disagreement_score":0.30424005,"about_ca_system_score_codex":0.000064026746,"about_ca_system_score_gemma":0.000020131145,"threshold_uncertainty_score":0.9249942},"labels":[],"label_agreement":null},{"id":"W4401408812","doi":"10.1145/3673038.3673149","title":"Online Non-preemptive Multi-Resource Scheduling for Weighted Completion Time on Multiple Machines","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"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); Processor scheduling; Preemption; Distributed computing; Resource (disambiguation); Computer network; Operating system; Mathematical optimization; Mathematics","score_opus":0.0179270609553273,"score_gpt":0.2568340662792119,"score_spread":0.2389070053238846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401408812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06348152,0.000259857,0.9326448,0.00020269425,0.0004727299,0.00037855795,0.00015697819,0.0017105142,0.000692363],"genre_scores_gemma":[0.20692477,0.0000151761715,0.78887767,0.00019894751,0.00045829223,0.000053215175,0.00076192257,0.000114812006,0.0025952077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916375,0.000012846311,0.00021946007,0.00025738194,0.0001252928,0.00022128157],"domain_scores_gemma":[0.99935615,0.00034484992,0.000014737843,0.00015243626,0.0000544591,0.000077336794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107834225,0.0002029679,0.00018005478,0.0001723647,0.00008259,0.00008573386,0.000108903456,0.00009798888,0.00014805747],"category_scores_gemma":[0.00007167351,0.0001784481,0.0000982154,0.00021823726,0.000017523296,0.000083345345,0.000017719538,0.0001753874,0.0002530486],"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.00002480968,0.00010189445,0.00006290414,0.000108063825,0.0000995213,0.0000033202014,0.00025670824,0.9869557,0.0023668562,0.00012310503,0.0015617785,0.008335346],"study_design_scores_gemma":[0.0006756008,0.000046232217,0.00019500859,0.00011842985,0.000020341764,0.0000017718646,0.000046947105,0.994509,0.0022283187,0.000024456514,0.0019021357,0.00023176536],"about_ca_topic_score_codex":0.000009960932,"about_ca_topic_score_gemma":0.000008896364,"teacher_disagreement_score":0.14376712,"about_ca_system_score_codex":0.000055383352,"about_ca_system_score_gemma":0.000010082874,"threshold_uncertainty_score":0.7276902},"labels":[],"label_agreement":null},{"id":"W4401459041","doi":"10.1080/03155986.2024.2376446","title":"A multi-agent learning framework for mixed-integer linear programming","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Integer programming; Computer science; Linear programming; Branch and price; Integer (computer science); Mathematical optimization; Mathematics; Algorithm; Programming language","score_opus":0.05547316307434643,"score_gpt":0.358079676329731,"score_spread":0.30260651325538457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401459041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018168323,0.0009435333,0.99449044,0.00013085161,0.0008711358,0.00073955004,0.00003131373,0.00035715627,0.00061919005],"genre_scores_gemma":[0.67978466,0.0002444672,0.31599095,0.00006433179,0.00071323663,0.0012584113,0.00047313052,0.000047137662,0.0014236674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987169,0.00003121582,0.0004217168,0.00010217637,0.00045624175,0.00027173734],"domain_scores_gemma":[0.99888366,0.0003674115,0.00001841139,0.000084608495,0.00053963345,0.000106277024],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013449423,0.00011343056,0.0001158497,0.00035866545,0.00032587678,0.0012462955,0.000084996325,0.00013796322,0.000018440958],"category_scores_gemma":[0.0005024932,0.000098244185,0.00004227395,0.00035594925,0.000036106612,0.0010725018,0.000028844102,0.00042345616,0.00017972966],"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.000010733728,0.000007038539,0.000068834444,0.0008016962,0.000059557642,9.22871e-7,0.0029778252,0.904171,0.000015008922,0.060660202,0.0011744787,0.030052682],"study_design_scores_gemma":[0.00013755499,0.000031891035,0.000018887116,0.00016656096,0.0000022642123,0.000008017673,0.0014487649,0.750803,0.00003932258,0.00001751936,0.24723509,0.00009114225],"about_ca_topic_score_codex":0.000019052482,"about_ca_topic_score_gemma":0.000001509595,"teacher_disagreement_score":0.67849946,"about_ca_system_score_codex":0.000087569526,"about_ca_system_score_gemma":0.00009593187,"threshold_uncertainty_score":0.9997905},"labels":[],"label_agreement":null},{"id":"W4401632632","doi":"10.1007/s10878-024-01203-0","title":"The prize-collecting single machine scheduling with bounds and penalties","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Job shop scheduling; Theory of computation; Scheduling (production processes); Single-machine scheduling; Computer science; Mathematical optimization; Upper and lower bounds; Due date; Schedule; Time complexity; Polynomial-time approximation scheme; Mathematics; Algorithm","score_opus":0.007748863312687487,"score_gpt":0.21411124802457632,"score_spread":0.20636238471188884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401632632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022628086,0.011465458,0.9549404,0.0005815507,0.008722746,0.00016631818,0.0000016250668,0.0002524597,0.0012413651],"genre_scores_gemma":[0.71871865,0.0010354347,0.27922478,0.0000147383325,0.0008293933,0.000003564067,0.0000033415977,0.00006563699,0.000104451436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999157,0.00003475485,0.00033881568,0.00007802744,0.0002531372,0.00013822976],"domain_scores_gemma":[0.9993373,0.00022518799,0.00009392702,0.000070033966,0.0002094544,0.00006406458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554691,0.00012103865,0.00015337592,0.00013881933,0.00023402859,0.0005991283,0.0000914039,0.000059809037,0.000008783563],"category_scores_gemma":[0.00013662303,0.000080348465,0.00004003747,0.00038643938,0.000042640506,0.00034366027,0.000013431829,0.0002715624,7.156029e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042683332,0.000012237678,0.000036252517,0.000033114364,0.00007993102,0.000007898267,0.00031853205,0.9964574,0.00006414352,0.0012425474,0.000058269394,0.0016469988],"study_design_scores_gemma":[0.00062309,0.00018351164,0.000006298268,0.00016189147,0.0000513753,0.00011573992,0.00015768586,0.9967698,0.00050005154,0.00051083905,0.0008089401,0.000110802386],"about_ca_topic_score_codex":0.0000013584058,"about_ca_topic_score_gemma":5.1804176e-7,"teacher_disagreement_score":0.6960906,"about_ca_system_score_codex":0.000084284744,"about_ca_system_score_gemma":0.000066813765,"threshold_uncertainty_score":0.5777408},"labels":[],"label_agreement":null},{"id":"W4401740375","doi":"10.1016/j.cie.2024.110507","title":"A machine learning-based simulation metamodeling method for dynamic scheduling in smart manufacturing systems","year":2024,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Toronto","funders":"","keywords":"Metamodeling; Smart manufacturing; Computer science; Scheduling (production processes); Dynamic priority scheduling; Industrial engineering; Artificial intelligence; Engineering; Manufacturing engineering; Software engineering; Operations management","score_opus":0.025648125626338097,"score_gpt":0.26119884687338746,"score_spread":0.23555072124704937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401740375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011682871,0.001816595,0.98041594,0.000033254542,0.0040209834,0.00044994307,0.000011314332,0.0015611934,0.000007906279],"genre_scores_gemma":[0.76145023,0.000010711098,0.23788303,0.000007302004,0.00037625202,0.000060775103,0.00008052971,0.00011707457,0.000014078779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849296,0.000041319978,0.0005164381,0.00035995885,0.00017890998,0.00041042187],"domain_scores_gemma":[0.998955,0.00072255236,0.000033878852,0.00015501375,0.00003243512,0.000101083315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067768776,0.00031840077,0.0003698153,0.0006585465,0.00006239145,0.0002848738,0.00016079479,0.00025324174,0.000004139589],"category_scores_gemma":[0.000110452056,0.00036046302,0.00013702665,0.00041110473,0.0000059255094,0.00020052606,0.00002556186,0.000711764,0.0000048488796],"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.000010140769,0.0000057038615,0.000009129642,0.00023177509,0.00007027689,0.00000830108,0.00008119695,0.9852338,0.0001573503,0.000040603984,0.0000022544964,0.01414946],"study_design_scores_gemma":[0.00087790535,0.000026201678,0.0000032940459,0.0005997863,0.00004138531,0.0000042450292,0.000019666373,0.996166,0.0005836084,0.0000053763915,0.001305839,0.0003666799],"about_ca_topic_score_codex":0.000026847152,"about_ca_topic_score_gemma":0.0000016980555,"teacher_disagreement_score":0.74976736,"about_ca_system_score_codex":0.00029938004,"about_ca_system_score_gemma":0.000040235052,"threshold_uncertainty_score":0.9998847},"labels":[],"label_agreement":null},{"id":"W4402012106","doi":"10.1080/00207543.2024.2396512","title":"Integrated two-stage multi-factory assembly scheduling with maintenance considerations","year":2024,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université Laval","funders":"","keywords":"Scheduling (production processes); Factory (object-oriented programming); Manufacturing engineering; Computer science; Engineering; Operations management; Systems engineering; Operations research; Industrial engineering","score_opus":0.08860574333310431,"score_gpt":0.380794252858137,"score_spread":0.2921885095250327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402012106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29440844,0.0022753836,0.67889416,0.0076455935,0.014459552,0.00034518845,0.000034149885,0.00047332657,0.0014642142],"genre_scores_gemma":[0.86794186,0.00023090611,0.12893584,0.000023167313,0.0009512191,0.000008837068,0.000008368902,0.000037562717,0.0018622486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982445,0.000098962686,0.00039067928,0.00018644487,0.00086961006,0.00020979287],"domain_scores_gemma":[0.99723434,0.00017021954,0.000052615997,0.0001233018,0.0023237565,0.00009577354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013360181,0.00011690811,0.00012782322,0.00082275766,0.0000911507,0.00039665715,0.00021281926,0.00005029512,0.00022737989],"category_scores_gemma":[0.0007733231,0.000091890004,0.00005956207,0.00045661346,0.00010544341,0.0005639135,0.000023211966,0.00092289504,0.000054009604],"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.00005518262,0.00007017136,0.0002077399,0.00003913825,0.00038812394,0.00031464905,0.00056854,0.9748991,0.013093334,0.0019714788,0.003124553,0.0052679796],"study_design_scores_gemma":[0.0009425415,0.00011563728,0.00022565198,0.00079488236,0.000020437461,0.0011107064,0.0016944028,0.94855535,0.033022374,0.00035918233,0.012905668,0.00025313967],"about_ca_topic_score_codex":0.000015008848,"about_ca_topic_score_gemma":0.00002346247,"teacher_disagreement_score":0.57353336,"about_ca_system_score_codex":0.00032114034,"about_ca_system_score_gemma":0.00028444728,"threshold_uncertainty_score":0.4009571},"labels":[],"label_agreement":null},{"id":"W4402067153","doi":"10.1002/aic.18584","title":"A reinforcement learning approach with masked agents for chemical process flowsheet design","year":2024,"lang":"en","type":"article","venue":"AIChE Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Process (computing); Reinforcement; Process engineering; Computer science; Biochemical engineering; Engineering; Materials science; Artificial intelligence; Composite material; Programming language","score_opus":0.02193525708122232,"score_gpt":0.24939571990665363,"score_spread":0.2274604628254313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402067153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053230366,0.0002720682,0.9926091,0.00004324207,0.00019749926,0.00016056828,4.8203106e-7,0.00025167453,0.0011423506],"genre_scores_gemma":[0.6037311,0.00005130156,0.3949427,0.00004117666,0.00040994454,0.000057685196,0.00001639677,0.00006688544,0.00068279577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992757,0.000013240659,0.00018256268,0.00011247933,0.00019334162,0.00022271049],"domain_scores_gemma":[0.9997148,0.000037106314,0.000022337637,0.000059310067,0.000064918204,0.0001015484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029440093,0.00012411084,0.000113113354,0.00008129427,0.00008259094,0.00018783766,0.0001059493,0.00006208209,0.00005167827],"category_scores_gemma":[0.00003576372,0.00009628475,0.000047257374,0.00018143136,0.000011523754,0.0001392244,0.0000066115767,0.00036890898,0.00000846737],"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.00002529377,0.000007938615,0.000008744689,0.00010842066,0.00010102411,0.000007705274,0.00086548104,0.99556357,0.00024348541,0.000023654786,0.0009093721,0.0021353245],"study_design_scores_gemma":[0.0004394521,0.000063989624,0.0000019993565,0.00009682179,0.000043749365,0.00015658076,0.0002271723,0.9949711,0.0027491297,0.000044829372,0.0010632611,0.00014189108],"about_ca_topic_score_codex":1.7891742e-7,"about_ca_topic_score_gemma":1.8879833e-8,"teacher_disagreement_score":0.5984081,"about_ca_system_score_codex":0.000064781445,"about_ca_system_score_gemma":0.00005240037,"threshold_uncertainty_score":0.39263782},"labels":[],"label_agreement":null},{"id":"W4402328582","doi":"10.1007/978-3-031-71645-4_4","title":"Dynamic Dispatching of DDMRP Replenishment Orders","year":2024,"lang":"en","type":"book-chapter","venue":"IFIP advances in information and communication technology","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Operations research; Engineering","score_opus":0.00325520634757944,"score_gpt":0.22265417890661782,"score_spread":0.21939897255903837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402328582","genre_codex":"other","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00073685497,0.14283043,0.06342038,0.001733864,0.00095035543,0.00091361563,0.00010363724,0.0022985898,0.7870123],"genre_scores_gemma":[0.31439993,0.46308696,0.20338799,0.00024374259,0.00002123505,0.0002778263,0.0012422113,0.00017195687,0.017168134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991409,0.000004307014,0.0005722991,0.00008765252,0.000100217374,0.00009462438],"domain_scores_gemma":[0.9992409,0.000040876108,0.00015419043,0.0004833189,0.00006267105,0.00001806791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000117369425,0.000160143,0.00021860491,0.00069678854,0.000036780853,0.00002470077,0.0002648339,0.00028943864,0.000030479849],"category_scores_gemma":[0.000022518623,0.00017363239,0.000029790115,0.0001358668,0.00013647758,0.00042887518,0.00010929497,0.0004676231,0.000027005155],"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.000004925114,0.0000048433917,0.000014587269,0.00038149973,0.000029105322,3.7244294e-7,0.000505542,0.03957204,0.0000018896571,0.57270765,0.000029648952,0.38674787],"study_design_scores_gemma":[0.00042212283,0.000044153167,0.0000061141127,0.0010860284,0.000030276118,0.00002234194,0.0009964766,0.35351467,0.0000920344,0.21755718,0.42576668,0.0004619353],"about_ca_topic_score_codex":0.0000025638294,"about_ca_topic_score_gemma":0.000030781695,"teacher_disagreement_score":0.7698441,"about_ca_system_score_codex":0.00008055472,"about_ca_system_score_gemma":0.000014519554,"threshold_uncertainty_score":0.70805234},"labels":[],"label_agreement":null},{"id":"W4402634197","doi":"10.2139/ssrn.4961941","title":"Data-Driven Discrete Global Optimization Using an Information Mining Strategy for Costly Black-Box Problems","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Victoria","funders":"","keywords":"Black box; Computer science; Data mining; Data science; Mathematical optimization; Industrial engineering; Engineering; Mathematics; Artificial intelligence","score_opus":0.033822018140308434,"score_gpt":0.29371216411652873,"score_spread":0.2598901459762203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402634197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009379311,0.0014602145,0.9860481,0.00007513401,0.0012249042,0.00054949644,0.0006035321,0.00039334156,0.00026596055],"genre_scores_gemma":[0.47383717,0.0063270866,0.50617754,0.00006351609,0.0025665886,0.00006852523,0.010559304,0.0002944171,0.000105843115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970876,0.000053551106,0.0007430592,0.0003442495,0.00033656356,0.0014349611],"domain_scores_gemma":[0.99885577,0.000021456337,0.00027200146,0.00046821448,0.00023970277,0.000142866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001110445,0.0004000046,0.00034035943,0.00021139733,0.00017644632,0.0009285947,0.0006910881,0.00036960485,0.000011497247],"category_scores_gemma":[0.000054855154,0.00040983662,0.00012108461,0.00025668845,0.00003445593,0.0010642342,0.0002610238,0.0020754826,0.000008820594],"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.0000141565115,0.000011334302,0.000011579415,0.00019653849,0.00030421917,7.154417e-7,0.00022142992,0.9913713,0.000002584492,0.0014590543,0.00004410079,0.00636299],"study_design_scores_gemma":[0.00044584696,0.00010537139,0.0000020853918,0.0002490262,0.00024665517,0.00011746779,0.0012014058,0.9824555,0.0000050771905,0.014639766,0.000099004355,0.0004327771],"about_ca_topic_score_codex":0.000025786027,"about_ca_topic_score_gemma":0.00015153091,"teacher_disagreement_score":0.47987056,"about_ca_system_score_codex":0.0017979648,"about_ca_system_score_gemma":0.0022360552,"threshold_uncertainty_score":0.9998354},"labels":[],"label_agreement":null},{"id":"W4402637589","doi":"10.1016/j.ijpe.2024.109413","title":"Scheduling of memory chips for final testing on parallel machines considering power constraints and deteriorating effects","year":2024,"lang":"en","type":"article","venue":"International Journal of Production Economics","topic":"Scheduling and Optimization Algorithms","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":"Université du Québec à Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Parallel computing; Reliability engineering; Mathematical optimization; Mathematics","score_opus":0.026196736400066107,"score_gpt":0.2573413131422374,"score_spread":0.2311445767421713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402637589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9183486,0.00046707026,0.07575869,0.0003205619,0.004820374,0.00009636441,0.000007946926,0.000045245568,0.00013514006],"genre_scores_gemma":[0.7939693,0.00005529402,0.20540978,0.000021032512,0.000513504,0.000002768741,0.0000016584713,0.000017911088,0.000008798001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931234,0.000011087174,0.00041472848,0.00011410528,0.00006865044,0.00007907501],"domain_scores_gemma":[0.9993292,0.0002536276,0.00014260698,0.0000459277,0.00019277487,0.000035863057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033920383,0.00009761723,0.00015118609,0.00021329724,0.000030423673,0.00008536948,0.00007647529,0.000037107973,0.000006720767],"category_scores_gemma":[0.0005819331,0.00009833507,0.00005505663,0.00004066839,0.000046783218,0.00023427734,0.000011839931,0.00014543676,0.0000010852144],"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.00003149441,0.000011507462,0.0002477022,0.0000982938,0.00016855521,0.000005869545,0.00024093925,0.92877954,0.0040830234,0.00043714387,0.0000134804395,0.065882474],"study_design_scores_gemma":[0.00059501297,0.00012382623,0.0003652018,0.00057527365,0.000027328244,0.00058421923,0.000178425,0.9813942,0.0147828385,0.0011425335,0.00007446706,0.00015670896],"about_ca_topic_score_codex":5.955441e-7,"about_ca_topic_score_gemma":6.906905e-7,"teacher_disagreement_score":0.12965108,"about_ca_system_score_codex":0.000058716403,"about_ca_system_score_gemma":0.000040617506,"threshold_uncertainty_score":0.40099877},"labels":[],"label_agreement":null},{"id":"W4402830080","doi":"10.1016/j.cor.2024.106848","title":"A machine-learning-based column generation heuristic for electric bus scheduling","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Column generation; Computer science; Scheduling (production processes); Heuristic; Mathematical optimization; Operations research; Artificial intelligence; Mathematics","score_opus":0.05122663785335645,"score_gpt":0.33064974440206985,"score_spread":0.2794231065487134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402830080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010447705,0.0023766311,0.98460484,0.00043194726,0.00078877574,0.0005227427,0.000013890078,0.0006960015,0.000117473646],"genre_scores_gemma":[0.77810293,0.00012319665,0.2198927,0.000049283586,0.0006663418,0.0002983151,0.0003591045,0.00007420187,0.00043389975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861574,0.00012512878,0.00024474566,0.00031462472,0.00031377363,0.00038599526],"domain_scores_gemma":[0.9989834,0.00034503895,0.0000048003485,0.0001874642,0.00036766264,0.00011165064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007060001,0.00013976364,0.00013148131,0.00059723173,0.0005635219,0.000903581,0.00018750671,0.00009223089,0.000046882757],"category_scores_gemma":[0.00023677455,0.00015021369,0.000067337525,0.0011852563,0.000031799125,0.00014577285,0.000024303372,0.00051632384,0.000103929735],"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.000003203651,0.000019043917,0.0000049935147,0.000074794516,0.000029073326,0.0000051836532,0.00018384887,0.9878517,0.0016562005,0.0007934551,0.0011765632,0.00820194],"study_design_scores_gemma":[0.00026579047,0.00010046041,0.0000051031984,0.000048878537,0.00000980811,0.0000050008975,0.00002270428,0.99492586,0.0017314388,0.000021782447,0.0027000683,0.00016310441],"about_ca_topic_score_codex":0.00002568746,"about_ca_topic_score_gemma":0.000030007983,"teacher_disagreement_score":0.76765525,"about_ca_system_score_codex":0.00018820133,"about_ca_system_score_gemma":0.00021181702,"threshold_uncertainty_score":0.8713252},"labels":[],"label_agreement":null},{"id":"W4402847032","doi":"10.5267/j.ijiec.2024.8.001","title":"Robotic assembly systems planning and scheduling problems: A revie","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidad Tecnológica de Pereira; Universidad de Antioquia","keywords":"Scheduling (production processes); Computer science; Systems engineering; Production planning; Engineering; Manufacturing engineering; Industrial engineering; Operations management; Production (economics)","score_opus":0.03640276141711752,"score_gpt":0.2738045249650229,"score_spread":0.23740176354790538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022539819,0.010322234,0.95717794,0.00028194097,0.009209488,0.000100335186,0.0000062474714,0.000267239,0.000094769886],"genre_scores_gemma":[0.9616032,0.00016358138,0.036416166,0.000009862667,0.0017345224,0.0000051847496,0.000009656266,0.00004119423,0.000016622698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895626,0.000015371968,0.0005192821,0.000094686395,0.00028967325,0.00012473969],"domain_scores_gemma":[0.9993449,0.00022807566,0.0000671287,0.000046364323,0.00022028889,0.00009326476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030095986,0.00013264836,0.00018926301,0.00048752408,0.00002866855,0.00041052047,0.00016361756,0.00008969818,0.000004883667],"category_scores_gemma":[0.00018939291,0.00013072403,0.000065554275,0.0002483431,0.000011343647,0.00030951598,0.000019713223,0.0004300461,0.000005102546],"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.0000020409566,0.000006116525,0.00004236066,0.00004706966,0.00024156262,0.000055043278,0.00019466548,0.9949238,0.00014125303,0.0007459124,0.00016249454,0.0034376902],"study_design_scores_gemma":[0.00030721116,0.000024579515,0.000024175544,0.0018872985,0.00003819643,0.00039294237,0.000068789624,0.9956908,0.000039552408,0.00002842815,0.0013747958,0.00012317904],"about_ca_topic_score_codex":0.0000025685283,"about_ca_topic_score_gemma":6.8648845e-8,"teacher_disagreement_score":0.9390634,"about_ca_system_score_codex":0.00011476065,"about_ca_system_score_gemma":0.000066718596,"threshold_uncertainty_score":0.5330771},"labels":[],"label_agreement":null},{"id":"W4402847160","doi":"10.5267/j.ijiec.2024.7.004","title":"Energy-efficient scheduling for a flexible job shop problem considering rework processes and new job arrival","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rework; Job shop; Job shop scheduling; Scheduling (production processes); Flow shop scheduling; Industrial engineering; Computer science; Operations research; Mathematical optimization; Engineering; Operations management; Mathematics; Schedule; Embedded system","score_opus":0.03790020328638515,"score_gpt":0.2729651741331217,"score_spread":0.23506497084673655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402847160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017463429,0.0018688178,0.97567147,0.00066828344,0.0037967218,0.00010561552,0.00001636566,0.00032458434,0.00008469825],"genre_scores_gemma":[0.6261095,0.00010545654,0.37053493,0.000028956518,0.0030395647,0.0000137193,0.000013743994,0.000070360635,0.00008379108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998823,0.000008271476,0.0005466919,0.00014446452,0.00029771173,0.00017985146],"domain_scores_gemma":[0.9988895,0.0004472532,0.00007274402,0.000052840605,0.00038269887,0.00015494862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021751762,0.00017468534,0.00020048683,0.00051224604,0.000052606436,0.00038005662,0.00018558581,0.00011180419,0.000011305906],"category_scores_gemma":[0.0003327595,0.00017902114,0.00008874793,0.0003625391,0.00001794977,0.00021480251,0.000028461056,0.00032027788,0.0000015488168],"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.000014388636,0.0000090178655,0.00002820699,0.000049773324,0.000254893,0.000015738531,0.0002796351,0.98523235,0.00017893524,0.002705691,0.0004988159,0.010732548],"study_design_scores_gemma":[0.0007602071,0.00004039372,0.000006833427,0.00093223463,0.000046932237,0.00019663473,0.00007445791,0.99362123,0.0008561303,0.0005032274,0.0027806824,0.0001810557],"about_ca_topic_score_codex":0.000005398812,"about_ca_topic_score_gemma":0.0000010451145,"teacher_disagreement_score":0.60864604,"about_ca_system_score_codex":0.00012499742,"about_ca_system_score_gemma":0.00032284993,"threshold_uncertainty_score":0.730027},"labels":[],"label_agreement":null},{"id":"W4402869929","doi":"10.5267/j.jpm.2024.6.002","title":"NSGA-II simheuristic to solve a multi-objective flexible flow shop problem under stochastic machine breakdowns","year":2024,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Computer science; Flow (mathematics); Mathematics","score_opus":0.01748178421884069,"score_gpt":0.2734323859230365,"score_spread":0.2559506017041958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402869929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005549341,0.0010139113,0.99435174,0.00030634992,0.0011298403,0.0005676669,0.000015110694,0.00030187957,0.0017585743],"genre_scores_gemma":[0.17150003,0.0001647713,0.82382065,0.00019781323,0.0004801568,0.00007648053,0.000011596245,0.00013174283,0.0036167267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985739,0.000023224444,0.0004903081,0.00021761631,0.00038110794,0.0003138215],"domain_scores_gemma":[0.9994667,0.000057054487,0.00006320909,0.00016989144,0.0001203514,0.00012277837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044305742,0.0002424298,0.0002707348,0.0007807743,0.00009309126,0.000173726,0.00022600642,0.000055856555,0.000069687536],"category_scores_gemma":[0.000029221721,0.00020390983,0.00014050383,0.0007370166,0.000015496596,0.00018088952,0.00010548539,0.0003436299,0.00006608881],"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.000029115183,0.0000907728,0.000002187667,0.00022262071,0.00041685085,0.00008054962,0.0014099112,0.9836378,0.000027851931,0.0005472618,0.0034107198,0.010124325],"study_design_scores_gemma":[0.000708795,0.00025643452,0.000073904244,0.00046717294,0.00022137105,0.0000789664,0.00063042564,0.9946804,0.000071009534,0.0002980028,0.0022383204,0.0002751733],"about_ca_topic_score_codex":0.000009647209,"about_ca_topic_score_gemma":0.000009699317,"teacher_disagreement_score":0.1709451,"about_ca_system_score_codex":0.00028763086,"about_ca_system_score_gemma":0.000056057383,"threshold_uncertainty_score":0.8315202},"labels":[],"label_agreement":null},{"id":"W4402875466","doi":"10.1007/978-3-031-70428-4_48","title":"Throughput Assessment of Manufacturing Cells Subject to Random Disturbances","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in mechanical engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Throughput; Subject (documents); Computer science; Telecommunications; World Wide Web","score_opus":0.007749274745974017,"score_gpt":0.22760974720208776,"score_spread":0.21986047245611376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402875466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028738994,0.0018574762,0.98577017,0.000057432684,0.0026160632,0.00043290088,0.000045059896,0.00059577526,0.0083377175],"genre_scores_gemma":[0.6642713,0.00076663983,0.33056653,0.00009792303,0.0010208254,0.00008648591,0.00007146535,0.00061492936,0.0025038964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981805,0.0000067319143,0.0006177707,0.00046076544,0.0003646971,0.00036954312],"domain_scores_gemma":[0.9990626,0.00036837975,0.00005013121,0.00036716418,0.000028884793,0.00012285706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021769194,0.00055906863,0.0007917167,0.00037062593,0.000018834347,0.000054636526,0.0002944741,0.00049850746,0.00013749223],"category_scores_gemma":[0.00005412988,0.00054081145,0.00023198106,0.00012615882,0.000013032796,0.00004744155,0.0000941614,0.0010939032,0.000026975082],"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.0000065669433,0.0000059518234,2.5344528e-7,0.0004987262,0.00010805442,0.000029244598,0.0000624853,0.99089485,0.0015822479,0.0037427044,0.000010050493,0.003058885],"study_design_scores_gemma":[0.00047571544,0.000059100053,0.000003289667,0.0014550694,0.00009475035,0.000007574223,0.000002087448,0.87431514,0.11532801,0.004474072,0.0030022336,0.0007829504],"about_ca_topic_score_codex":0.000005734154,"about_ca_topic_score_gemma":0.000013322513,"teacher_disagreement_score":0.66398394,"about_ca_system_score_codex":0.00023276282,"about_ca_system_score_gemma":0.000024387306,"threshold_uncertainty_score":0.99970436},"labels":[],"label_agreement":null},{"id":"W4402980097","doi":"10.1109/otcon60325.2024.10687805","title":"Algorithmic Intelligence Instantaneously for Complex Real-Time Supply Chain Optimization","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Supply chain; Computer science; Real-time computing; Distributed computing; Industrial engineering; Engineering; Business","score_opus":0.015918266612361683,"score_gpt":0.24734457134788274,"score_spread":0.23142630473552106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402980097","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018288735,0.0001756998,0.9891473,0.00016541257,0.0004955553,0.00032377918,0.000051009014,0.0020403755,0.007417965],"genre_scores_gemma":[0.023317495,0.0005205924,0.9730952,0.000058402777,0.00023597655,0.00006479412,0.00029310142,0.00009189681,0.0023225877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991437,0.000010854258,0.00026112387,0.00022423994,0.00012129964,0.00023878786],"domain_scores_gemma":[0.99957,0.00012626103,0.000011656468,0.00015149488,0.00006364593,0.00007690778],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013967638,0.00016584441,0.00014852121,0.00015607047,0.00006137045,0.0001474368,0.00013080356,0.0000861885,0.0010139182],"category_scores_gemma":[0.000022114133,0.0001627415,0.00006459977,0.00034316306,0.000024368423,0.00012657912,0.000014472543,0.000084706364,0.00017269967],"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.000003887415,0.000007258076,8.8103536e-7,0.00006568196,0.00002798333,0.0000076340075,0.00016440084,0.9753539,0.00048104906,0.0015886169,0.0016879279,0.02061079],"study_design_scores_gemma":[0.00007785484,0.000035382312,0.0000015971295,0.00003998319,0.0000143067455,0.000028337325,0.00008097306,0.99666727,0.0010579417,0.0001681114,0.0016141724,0.00021405808],"about_ca_topic_score_codex":0.000012014328,"about_ca_topic_score_gemma":0.0000027120705,"teacher_disagreement_score":0.023134608,"about_ca_system_score_codex":0.00007984332,"about_ca_system_score_gemma":0.000025811622,"threshold_uncertainty_score":0.99989927},"labels":[],"label_agreement":null},{"id":"W4402982276","doi":"10.1080/03155986.2024.2406729","title":"Preface: special issue on artificial intelligence for operations research","year":2024,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Artificial intelligence; Management science; Engineering","score_opus":0.11969774870602257,"score_gpt":0.40311128355040937,"score_spread":0.2834135348443868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402982276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02066108,0.0021820827,0.71875846,0.007031793,0.014115732,0.010724846,0.001475743,0.0014972632,0.22355297],"genre_scores_gemma":[0.9503299,0.00065629405,0.017723849,0.00021526487,0.019511342,0.002950513,0.0012238534,0.00008652889,0.007302454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978661,0.00007160524,0.00057053583,0.0001507781,0.0009854343,0.0003555413],"domain_scores_gemma":[0.9979745,0.00055830675,0.0000073849947,0.00015633329,0.0011760597,0.0001274216],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030616177,0.000121039244,0.000121586636,0.000832383,0.0006840908,0.0025228378,0.00015736445,0.00013980886,0.0001964917],"category_scores_gemma":[0.0005113421,0.000106720174,0.00003372528,0.00071522745,0.0001031014,0.0014032896,0.000037232436,0.0004767307,0.0011530428],"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.000020240324,0.000007675757,0.000001015235,0.00019751726,0.000019160572,5.3070374e-7,0.001882653,0.6447377,0.000018270066,0.293238,0.016555412,0.04332181],"study_design_scores_gemma":[0.00004902973,0.00008178523,0.000006246659,0.000085173866,0.0000012140372,0.0000047818494,0.0016519387,0.7116528,0.0003696402,0.00023468159,0.28577194,0.00009073107],"about_ca_topic_score_codex":0.00004402859,"about_ca_topic_score_gemma":0.000016003767,"teacher_disagreement_score":0.92966884,"about_ca_system_score_codex":0.00016397891,"about_ca_system_score_gemma":0.00023041274,"threshold_uncertainty_score":0.99962467},"labels":[],"label_agreement":null},{"id":"W4403280277","doi":"10.1016/j.ifacol.2024.09.084","title":"Towards a Framework for AI Applications in Intralogistics","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Data science","score_opus":0.01582025830690563,"score_gpt":0.29299355209370936,"score_spread":0.2771732937868037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403280277","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001086739,0.0013117075,0.994544,0.0011723767,0.00047015652,0.00026081884,0.00012757567,0.0006188416,0.00040775194],"genre_scores_gemma":[0.022111462,0.00014598818,0.97664094,0.00019818,0.00043798605,0.00016481237,0.00014628918,0.000043519867,0.00011084096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936926,0.0000050684907,0.00017849622,0.00017097591,0.00007899916,0.00019718717],"domain_scores_gemma":[0.99962586,0.00013717478,0.000007638691,0.00014084831,0.00003064174,0.00005786436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008099276,0.0001236983,0.00012834881,0.00010263609,0.000031299285,0.00006644409,0.000105602594,0.00013195723,0.00005491639],"category_scores_gemma":[0.00008811321,0.00011817822,0.000054667682,0.00037290738,0.000022497423,0.00005282185,0.000009661694,0.00024427412,0.000032823842],"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.000012586325,0.00011536715,0.0002313639,0.0006624938,0.00012047256,0.000016189639,0.0020483576,0.72639376,0.00033959735,0.12551491,0.00009673947,0.14444816],"study_design_scores_gemma":[0.00012525354,0.00001438216,0.00007892882,0.00007409347,0.000018429093,0.0000023441135,0.00016445949,0.9887963,0.00019906225,0.005925427,0.004432024,0.00016933016],"about_ca_topic_score_codex":0.0000063854773,"about_ca_topic_score_gemma":0.000012966278,"teacher_disagreement_score":0.2624025,"about_ca_system_score_codex":0.000061750776,"about_ca_system_score_gemma":0.000032955995,"threshold_uncertainty_score":0.48191682},"labels":[],"label_agreement":null},{"id":"W4403305145","doi":"10.1017/9781009302180.026","title":"Network Flows and Linear Programming","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science","score_opus":0.014132244366200933,"score_gpt":0.1824960956685683,"score_spread":0.16836385130236736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305145","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026229558,0.0017127881,0.0074232877,0.0000066045177,0.00067173666,0.00022927595,0.00005502993,0.0009285581,0.9889465],"genre_scores_gemma":[0.00007581511,0.00026385594,0.014509313,0.000015729174,0.0004708483,7.360331e-7,0.00004569651,0.00009394871,0.9845241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99924797,0.0000051916595,0.00012304832,0.0002839735,0.00011747237,0.0002223575],"domain_scores_gemma":[0.9995533,0.000026091857,0.000029354862,0.00021510384,0.00004711308,0.00012902368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00005299408,0.00027778486,0.00024237981,0.00009910894,0.00008875637,0.00006363269,0.00014367011,0.00029833813,0.0000026788462],"category_scores_gemma":[0.0000020633186,0.0003369477,0.00008423493,0.000010717429,0.00006101201,0.000039343046,0.00012724122,0.00045330965,0.00002092929],"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.000027704715,0.0000040579675,9.90802e-7,0.0007098488,0.0005286151,0.00062735705,0.00017104641,0.055978924,0.000004525173,0.9010089,0.023420209,0.017517809],"study_design_scores_gemma":[0.0001536359,0.0000137318975,3.7218e-7,0.0002414025,0.00016919473,0.0000140045295,0.000011718628,0.14739808,0.0000101662345,0.00001025568,0.8516377,0.00033968614],"about_ca_topic_score_codex":0.000008602198,"about_ca_topic_score_gemma":9.766021e-7,"teacher_disagreement_score":0.90099865,"about_ca_system_score_codex":0.00006832076,"about_ca_system_score_gemma":0.000018007699,"threshold_uncertainty_score":0.99990827},"labels":[],"label_agreement":null},{"id":"W4403315844","doi":"10.1080/21681015.2024.2411973","title":"Minimizing the sum of earliness and tardiness in the multi-factory two-stage assembly scheduling problem","year":2024,"lang":"en","type":"article","venue":"Journal of Industrial and Production Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Scheduling (production processes); Factory (object-oriented programming); Computer science; Mathematical optimization; Operations management; Stage (stratigraphy); Due date; Operations research; Job shop scheduling; Mathematics; Engineering; Schedule; Operating system; Programming language","score_opus":0.0378802134326053,"score_gpt":0.2512976840516949,"score_spread":0.21341747061908958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403315844","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95726264,0.0049770195,0.034046803,0.00089100306,0.002568769,0.000179738,0.0000038835974,0.00005245115,0.00001771755],"genre_scores_gemma":[0.98741955,0.00033168143,0.011041799,0.0000048047523,0.0011599171,0.0000040598024,7.917431e-7,0.000020327501,0.000017066865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999168,0.00003594148,0.0003950743,0.000095607706,0.00018736525,0.0001180568],"domain_scores_gemma":[0.99961686,0.00012470642,0.000065306725,0.00007587922,0.00008494164,0.00003229965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013788521,0.00011658889,0.00017500792,0.00019629109,0.000040447805,0.000091316746,0.0000906345,0.000072416384,0.000002351759],"category_scores_gemma":[0.00023901102,0.00007211228,0.00004018815,0.00037271527,0.000023916957,0.00025350178,0.000013649269,0.00056413433,1.3931457e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010748073,0.000009081368,0.00029491322,0.00011319713,0.00004554857,0.000006160267,0.0010493943,0.987664,0.0028268383,0.00005319082,0.000025657719,0.007901267],"study_design_scores_gemma":[0.0009400916,0.000048251466,0.000555653,0.00085202843,0.00006683666,0.00023670781,0.0018172428,0.98635346,0.0069475267,0.000013068482,0.0019640015,0.00020514161],"about_ca_topic_score_codex":0.000008984266,"about_ca_topic_score_gemma":0.0000018995242,"teacher_disagreement_score":0.030156938,"about_ca_system_score_codex":0.000026873695,"about_ca_system_score_gemma":0.000037268423,"threshold_uncertainty_score":0.29406536},"labels":[],"label_agreement":null},{"id":"W4403318073","doi":"10.1145/3672539.3686763","title":"ChainBuddy: An AI-assisted Agent System for Helping Users Set up LLM Pipelines","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Computer science; Set (abstract data type); Pipeline transport; Human–computer interaction; Engineering; Programming language","score_opus":0.03231939994994936,"score_gpt":0.2772012039319405,"score_spread":0.2448818039819911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403318073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111006545,0.0006316882,0.97874516,0.00024955135,0.0044086077,0.00026837335,0.000042222877,0.003744683,0.00080905523],"genre_scores_gemma":[0.9253845,0.00003055032,0.07025665,0.00017297533,0.0006863298,0.00009785254,0.00017736481,0.00011216316,0.0030815727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992333,0.000012650182,0.00022389501,0.00020513883,0.000109531866,0.00021546887],"domain_scores_gemma":[0.99961275,0.000046905843,0.000010518544,0.00016886066,0.000059847738,0.000101109974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017330452,0.00014782726,0.0001444895,0.00012522023,0.000064824926,0.00018916854,0.0000964959,0.000083531566,0.000042423828],"category_scores_gemma":[0.000016087926,0.00013336982,0.00007346235,0.0002177955,0.000007748927,0.00014697533,0.000010923243,0.00008202084,0.000048187256],"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.00001041576,0.000015004452,0.000025480194,0.0013730961,0.00017589775,0.000016462305,0.0013651259,0.9681413,0.00091117405,0.002722866,0.008740081,0.016503073],"study_design_scores_gemma":[0.00019243358,0.000021131287,0.00001032243,0.00014422809,0.000029402372,0.000012507167,0.0013705071,0.99114686,0.002026129,0.000007638368,0.004853449,0.00018539572],"about_ca_topic_score_codex":0.000013554608,"about_ca_topic_score_gemma":0.000012510229,"teacher_disagreement_score":0.9142839,"about_ca_system_score_codex":0.00008748588,"about_ca_system_score_gemma":0.00002095536,"threshold_uncertainty_score":0.54386634},"labels":[],"label_agreement":null},{"id":"W4403442576","doi":"10.1016/j.mfglet.2024.09.010","title":"Trade-offs between optimal and robust scheduling in one-stage production","year":2024,"lang":"en","type":"article","venue":"Manufacturing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Scheduling (production processes); Production (economics); Stage (stratigraphy); Computer science; Operations management; Operations research; Business; Economics; Engineering; Microeconomics; Geology","score_opus":0.023482417959572014,"score_gpt":0.21894949641261305,"score_spread":0.19546707845304104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403442576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93784076,0.0003198697,0.058342237,0.0021070212,0.00056610204,0.00011939737,0.0000040697705,0.00063416274,0.00006636467],"genre_scores_gemma":[0.945247,0.000041578114,0.054055084,0.00008928401,0.00043642378,0.000011476504,0.000015763497,0.000052297608,0.000051078485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991144,0.000013621129,0.0001993047,0.0002894898,0.00012859477,0.00025459361],"domain_scores_gemma":[0.9997609,0.000038288512,0.000012469651,0.00012724497,0.0000023241687,0.000058752288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017075117,0.00016281156,0.00014801187,0.00024908147,0.000048655613,0.00015020208,0.000073162395,0.00007073214,0.000018390887],"category_scores_gemma":[0.000011614895,0.00017963945,0.000032475582,0.00012545532,0.000028055707,0.00022786189,0.000020000623,0.00035114904,0.000014579499],"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.0000016586476,0.0000034430195,0.00034159035,0.00017660353,0.00002869641,0.000019385307,0.00048308625,0.9904821,0.0014286762,0.0000048174456,0.00004597869,0.0069839726],"study_design_scores_gemma":[0.0003563037,0.000015814076,0.015837658,0.00040885154,0.000043935637,0.000017118431,0.00022297479,0.84805804,0.13326295,0.000012857509,0.0011548476,0.00060865027],"about_ca_topic_score_codex":0.00001002651,"about_ca_topic_score_gemma":0.0000020503762,"teacher_disagreement_score":0.14242405,"about_ca_system_score_codex":0.000081383885,"about_ca_system_score_gemma":0.000005174331,"threshold_uncertainty_score":0.7325484},"labels":[],"label_agreement":null},{"id":"W4403905374","doi":"10.59934/jaiea.v4i1.555","title":"Optimizing the Preparation of Work Plans Using Linear Regression","year":2024,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence and Engineering Applications (JAIEA)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Linear regression; Work (physics); Computer science; Statistics; Mathematics; Engineering; Mechanical engineering","score_opus":0.03725403613093547,"score_gpt":0.30408154990130176,"score_spread":0.2668275137703663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403905374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039664183,0.002639323,0.9570548,0.000107370775,0.00033129397,0.00009591794,0.0000035041578,0.00007314811,0.000030447036],"genre_scores_gemma":[0.83955777,0.0005445008,0.15944499,0.000005771189,0.00040110477,0.000009147951,0.0000024791352,0.000024955796,0.000009298427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992138,0.000008698099,0.00045263275,0.0000837566,0.00013550629,0.00010560253],"domain_scores_gemma":[0.9995543,0.00012141452,0.000066515095,0.00012032011,0.00008918846,0.000048313916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002798593,0.00010190482,0.00013474008,0.0001748605,0.000065113825,0.00006896259,0.00011914982,0.000063394575,0.0000082818615],"category_scores_gemma":[0.00002717518,0.00007608123,0.000062417465,0.0004983988,0.000031670836,0.00014411939,0.0000128798465,0.000217916,0.0000041173225],"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.000006451685,0.000008764931,0.0000051471684,0.000050177394,0.00003227723,0.0000011098819,0.00066877203,0.9749383,0.00510359,0.0010036846,0.000025131845,0.018156601],"study_design_scores_gemma":[0.000009907507,0.000020706524,0.000007412734,0.00023515304,0.000037982838,0.000027862718,0.00025915724,0.9751424,0.022940228,0.00018105298,0.0010585628,0.00007952553],"about_ca_topic_score_codex":0.000001781796,"about_ca_topic_score_gemma":4.775935e-7,"teacher_disagreement_score":0.79989356,"about_ca_system_score_codex":0.00002971392,"about_ca_system_score_gemma":0.00002335336,"threshold_uncertainty_score":0.31025028},"labels":[],"label_agreement":null},{"id":"W4404530596","doi":"10.1007/978-3-031-70415-4","title":"Advances in Practical Applications of Agents, Multi-Agent Systems, and Digital Twins: The PAAMS Collection","year":2024,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"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":"Russian Academy of Sciences; Région Normandie; Université Polytechnique Hauts-de-France; Agencia Estatal de Investigación; Université de Caen Normandie; Eidgenössische Technische Hochschule Zürich; Tokyo University of Agriculture and Technology; RMIT University; Universidad de Castilla-La Mancha; Syddansk Universitet; Université Laval; Universidad Nacional del Centro de la Provincia de Buenos Aires; Libera Università di Bolzano; Universidade de Lisboa; Universität Bremen; Malmö Högskola; Universidad de Caldas; Università di Bologna; Universidad Carlos III de Madrid; Université de Sherbrooke; Purdue University; Centre National de la Recherche Scientifique; Shizuoka University; Universidad Complutense de Madrid; Vrije Universiteit Amsterdam; Georgia Institute of Technology; Universidad de Sevilla; Tokyo University of Agriculture","keywords":"Computer science; Multi-agent system; Artificial intelligence","score_opus":0.015617587192555208,"score_gpt":0.2718861418266573,"score_spread":0.25626855463410214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404530596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028012359,0.005738502,0.9924501,0.00007137145,0.00084635493,0.00039781057,0.000010104825,0.00007206708,0.00038562992],"genre_scores_gemma":[0.34393585,0.004958042,0.6476,0.00024244357,0.0011897837,0.00040796638,0.00007495563,0.00014382707,0.0014471242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901253,0.000014191355,0.00026324968,0.0003068454,0.00024956884,0.00015363898],"domain_scores_gemma":[0.99937046,0.00027683735,0.00005216185,0.00020859893,0.000055132645,0.000036835703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023054318,0.00014990578,0.0001768769,0.0002656131,0.00005496429,0.0002284051,0.00021133324,0.00010889171,0.0000013911637],"category_scores_gemma":[0.000060853425,0.000113792164,0.00002374986,0.0007318298,0.00019692598,0.00020501793,0.000085361986,0.00035536598,0.0000050527005],"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":[9.1766344e-7,0.000014305942,0.00004223177,0.00015285135,0.00000496412,0.0000036972056,0.00038180657,0.92307705,0.000001519933,0.00008297569,0.00004736077,0.07619033],"study_design_scores_gemma":[0.00008795263,0.000015138067,0.000033567554,0.00023722019,0.0000063351104,0.000022402666,0.000003532777,0.9959202,0.00002490195,0.00054213364,0.0029862511,0.00012035575],"about_ca_topic_score_codex":0.000003835004,"about_ca_topic_score_gemma":0.000020282914,"teacher_disagreement_score":0.34485012,"about_ca_system_score_codex":0.00017515317,"about_ca_system_score_gemma":0.00014992396,"threshold_uncertainty_score":0.46403098},"labels":[],"label_agreement":null},{"id":"W4404777792","doi":"10.1108/sasbe-05-2024-0191","title":"Production system state analysis and improvement using VSM, simulation, and fuzzy logic","year":2024,"lang":"en","type":"article","venue":"Smart and Sustainable Built Environment","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fuzzy logic; Computer science; State (computer science); Industrial engineering; Artificial intelligence; Engineering; Algorithm","score_opus":0.008115307032466186,"score_gpt":0.21528479028772643,"score_spread":0.20716948325526024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404777792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8025928,0.004242702,0.19242735,0.00006776857,0.00012592472,0.00028565427,0.000003853908,0.00017434076,0.000079583486],"genre_scores_gemma":[0.9933012,0.000475908,0.005325782,0.000008590141,0.000049267106,0.000016165217,0.0000102289005,0.00002003877,0.0007928079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919903,0.000015777423,0.00017357411,0.00027412787,0.00011120665,0.00022628956],"domain_scores_gemma":[0.9997607,0.000016465141,0.000017376182,0.0001202238,0.000011320141,0.00007394857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025192014,0.00013746275,0.00014685967,0.00018849329,0.00014668079,0.00013939149,0.000020981344,0.00004268833,0.000008385981],"category_scores_gemma":[0.0000056459085,0.00012879213,0.000023431217,0.00020115286,0.000038714414,0.00014781285,0.00005072421,0.00006832179,0.0000012175309],"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.0000036813863,0.0000062242902,0.0015314845,0.00045454278,0.00016803086,0.000013147183,0.00034878592,0.9924062,0.00020016578,0.00020003268,0.0000047227077,0.0046630064],"study_design_scores_gemma":[0.000109882516,0.000028415236,0.0015974096,0.000017891754,0.00023359322,0.0000048955735,0.001659874,0.9948587,0.00022148107,0.00023461106,0.000875042,0.00015822906],"about_ca_topic_score_codex":0.00005914824,"about_ca_topic_score_gemma":0.0000020916216,"teacher_disagreement_score":0.1907084,"about_ca_system_score_codex":0.00016585132,"about_ca_system_score_gemma":0.000008462782,"threshold_uncertainty_score":0.5251991},"labels":[],"label_agreement":null},{"id":"W4404863321","doi":"10.1177/10591478241305863","title":"Multi-Agent Deep Reinforcement Learning for Multi-Echelon Inventory Management","year":2024,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"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; National Natural Science Foundation of China; National Science Foundation","keywords":"Reinforcement learning; Computer science; Inventory management; Operations management; Reinforcement; Operations research; Business; Artificial intelligence; Psychology; Economics; Mathematics; Social psychology","score_opus":0.027667656503764064,"score_gpt":0.26510665080087187,"score_spread":0.2374389942971078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404863321","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007517029,0.0018104583,0.9926431,0.00035702134,0.0018131215,0.0010628423,7.078535e-7,0.00073598116,0.00082501915],"genre_scores_gemma":[0.22383146,0.006266463,0.72158396,0.00013869202,0.00033300195,0.0014097589,0.00016642023,0.000088739485,0.046181504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999061,0.000017516939,0.00025385755,0.0003458011,0.0001308876,0.00019092626],"domain_scores_gemma":[0.99971217,0.0000044195917,0.000011270821,0.00016398354,0.00004622446,0.00006194845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668707,0.00016345365,0.00009616483,0.0002684009,0.00027597696,0.00022796437,0.000065750886,0.000037517322,0.000047726455],"category_scores_gemma":[0.000014770892,0.00016669791,0.000045949735,0.0002358106,0.00002037883,0.00020559001,0.00004646369,0.00011017273,0.000056898614],"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.0000030053984,0.000034837827,0.000012624177,0.00049891544,0.00016831132,0.000002624167,0.0005619128,0.96378225,0.00005067791,0.0025866148,0.0006108852,0.031687327],"study_design_scores_gemma":[0.00032475463,0.000020530762,0.00008928619,0.00008083156,0.00008289734,0.0000024911767,0.0008170636,0.9636283,0.00026721566,0.0000079247875,0.03448579,0.00019290426],"about_ca_topic_score_codex":0.0000025099407,"about_ca_topic_score_gemma":0.000012675285,"teacher_disagreement_score":0.2710592,"about_ca_system_score_codex":0.00011872075,"about_ca_system_score_gemma":0.000004078575,"threshold_uncertainty_score":0.67977434},"labels":[],"label_agreement":null},{"id":"W4404875186","doi":"10.1016/j.rcim.2024.102917","title":"A self-imitation learning approach for scheduling evaporation and encapsulation stages of OLED display manufacturing systems","year":2024,"lang":"en","type":"article","venue":"Robotics and Computer-Integrated Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Toronto","funders":"","keywords":"Encapsulation (networking); OLED; Materials science; Computer science; Nanotechnology","score_opus":0.010701836675575496,"score_gpt":0.21405031097635552,"score_spread":0.20334847430078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404875186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20424896,0.00079667754,0.79376787,0.000010295832,0.00037304685,0.00030152133,0.000006435279,0.00045766588,0.000037516988],"genre_scores_gemma":[0.7260766,0.00020238345,0.27340582,0.0000023184543,0.00011477414,0.000017836795,0.00012201919,0.000038145667,0.000020072946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894816,0.000035088204,0.00036896678,0.00030231453,0.00014079796,0.00020469207],"domain_scores_gemma":[0.9995652,0.00013608714,0.00007148021,0.0000949001,0.0000609328,0.0000714245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024745573,0.00023665834,0.0002609753,0.00023620532,0.00013297515,0.00037431766,0.000060138093,0.00012987683,8.375045e-7],"category_scores_gemma":[0.000009089821,0.00022185863,0.00004759414,0.00009229314,0.000018909139,0.0002546329,0.000025331878,0.00023394472,5.500156e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059447852,0.0000110951005,0.000041933312,0.0012938759,0.000102358455,0.0000014038145,0.00053969515,0.9863152,0.00024070239,0.0009060505,0.000003328592,0.0105384495],"study_design_scores_gemma":[0.00030088084,0.000058799058,0.00019689067,0.00026611495,0.00007206484,0.0000132438,0.00027654687,0.98881567,0.009646528,0.000058145753,0.000065094566,0.0002299988],"about_ca_topic_score_codex":0.000012023103,"about_ca_topic_score_gemma":9.261431e-7,"teacher_disagreement_score":0.52182764,"about_ca_system_score_codex":0.000056738303,"about_ca_system_score_gemma":0.00001621583,"threshold_uncertainty_score":0.9047132},"labels":[],"label_agreement":null},{"id":"W4405121936","doi":"10.5267/j.ijiec.2024.11.003","title":"You are entitled to access the full text of this documentA novel hybrid algorithm of cooperative variable neighborhood search and constraint programming for flexible job shop scheduling problem with sequence dependent setup time","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; Liaocheng University; National Natural Science Foundation of China","keywords":"Variable neighborhood search; Job shop scheduling; Mathematical optimization; Scheduling (production processes); Algorithm; Constraint (computer-aided design); Sequence (biology); Heuristic; Computer science; Hybrid algorithm (constraint satisfaction); Variable (mathematics); Constraint programming; Mathematics; Constraint logic programming; Metaheuristic; Schedule; Stochastic programming","score_opus":0.03172744612313183,"score_gpt":0.2925761604895104,"score_spread":0.2608487143663786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405121936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018109972,0.0001413699,0.97999907,0.00041716138,0.0005932408,0.00040021972,0.00024231257,0.000060023067,0.000036656504],"genre_scores_gemma":[0.53587127,0.00001575503,0.46360886,0.000011915288,0.00034564646,0.000026755413,0.000037113958,0.000038236798,0.000044451972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987829,0.000015274065,0.0005190143,0.00013451363,0.0003872307,0.00016110144],"domain_scores_gemma":[0.9986772,0.0003038081,0.00010802228,0.00006842548,0.00075407914,0.00008848402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045318416,0.00014707095,0.0002285419,0.00033401352,0.000046339563,0.00028061867,0.00030616453,0.00005374386,0.000042647298],"category_scores_gemma":[0.00012879541,0.00011723558,0.00005633296,0.00035779047,0.000042785483,0.0003119848,0.00005596676,0.0003097722,0.000001061258],"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.000031902473,0.000030465186,0.000022879043,0.000043028784,0.0004941045,0.0000068147583,0.00035407185,0.9864486,0.0022139675,0.0008695019,0.000042554966,0.009442099],"study_design_scores_gemma":[0.0009133003,0.00015004896,0.0000049663217,0.00088005204,0.0000630793,0.00017092002,0.00021124225,0.99081206,0.0065074987,0.00003195958,0.0001321267,0.00012272499],"about_ca_topic_score_codex":0.000015794905,"about_ca_topic_score_gemma":9.759249e-7,"teacher_disagreement_score":0.5177613,"about_ca_system_score_codex":0.0001282585,"about_ca_system_score_gemma":0.0002457865,"threshold_uncertainty_score":0.4780728},"labels":[],"label_agreement":null},{"id":"W4405122622","doi":"10.5267/j.ijiec.2024.11.002","title":"A robust single-machine scheduling problem with scenario-dependent processing times and release dates","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Graduate Education; National Science and Technology Council; Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Single-machine scheduling; Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Real-time computing; Mathematics; Embedded system","score_opus":0.022839601723407994,"score_gpt":0.23229694352889066,"score_spread":0.20945734180548267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03944542,0.0026195948,0.9551003,0.0007380783,0.001468749,0.00011132581,0.00002031498,0.0003490397,0.00014719566],"genre_scores_gemma":[0.8153051,0.000049215923,0.18386653,0.000011859496,0.00067773,0.0000033292433,0.000018882893,0.00004523908,0.000022070391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893093,0.000011799495,0.0004275223,0.00013039986,0.0003574579,0.00014185991],"domain_scores_gemma":[0.9993426,0.00012865457,0.000078101286,0.00004892741,0.00029013303,0.00011159135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019739504,0.00016793191,0.0001700835,0.00046997098,0.000045769706,0.0004644066,0.00017014978,0.00008032192,0.000015466372],"category_scores_gemma":[0.000090425594,0.00014733322,0.000045165565,0.0002726929,0.000023853363,0.00045027304,0.000025557581,0.00047869803,0.0000029593123],"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.000016730048,0.000024805706,0.00006325465,0.000031485866,0.00021090674,0.00008564239,0.00023241602,0.97611225,0.00026967062,0.00019503883,0.00004632745,0.022711456],"study_design_scores_gemma":[0.00066065945,0.00006681992,0.000015437423,0.0010442454,0.00005254289,0.00052604044,0.00007271912,0.99658954,0.00039243518,0.000046366957,0.00036823627,0.00016497076],"about_ca_topic_score_codex":0.000005214891,"about_ca_topic_score_gemma":0.0000012475662,"teacher_disagreement_score":0.7758597,"about_ca_system_score_codex":0.00012764116,"about_ca_system_score_gemma":0.00011247299,"threshold_uncertainty_score":0.6008075},"labels":[],"label_agreement":null},{"id":"W4405122657","doi":"10.5267/j.ijiec.2024.10.005","title":"Integrating sequence-dependent setup times and blocking in hybrid flow shop scheduling to minimize total tardiness","year":2024,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tardiness; Blocking (statistics); Flow shop scheduling; Scheduling (production processes); Sequence (biology); Computer science; Job shop scheduling; Due date; Mathematical optimization; Real-time computing; Mathematics; Embedded system; Computer network","score_opus":0.02256627850798987,"score_gpt":0.26486653923336806,"score_spread":0.2423002607253782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405122657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2769198,0.00036732914,0.71645075,0.0005935705,0.005319497,0.00009608965,0.00003310786,0.00016459225,0.000055216024],"genre_scores_gemma":[0.83545953,0.000017540573,0.16343178,0.000016339996,0.0010069236,0.0000054407456,0.00001348607,0.000034501,0.000014433302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986986,0.00001869078,0.0006083241,0.000148939,0.00035158955,0.00017389264],"domain_scores_gemma":[0.99927664,0.0002851882,0.000051887313,0.000054966717,0.0002087318,0.00012258148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003427867,0.00017644951,0.0002224308,0.0008370666,0.000034614575,0.00042234064,0.0001977978,0.00007715974,0.00002619255],"category_scores_gemma":[0.00039760745,0.00018184826,0.000074075535,0.0003462295,0.000014972505,0.00031491125,0.000045938694,0.00055664155,0.0000057992693],"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.000009314809,0.000009921021,0.000094662806,0.000011177334,0.0001305588,0.00014737397,0.00047863083,0.97988904,0.00042563115,0.00020052411,0.000058525886,0.018544652],"study_design_scores_gemma":[0.00051614374,0.000021896594,0.000039650775,0.0008490136,0.000018799814,0.00044805265,0.00019170903,0.99701315,0.0005475375,0.00006507923,0.00011504228,0.00017393763],"about_ca_topic_score_codex":0.000010137602,"about_ca_topic_score_gemma":0.0000012731655,"teacher_disagreement_score":0.55853975,"about_ca_system_score_codex":0.00023563698,"about_ca_system_score_gemma":0.00011612206,"threshold_uncertainty_score":0.7415557},"labels":[],"label_agreement":null},{"id":"W4405444225","doi":"10.1080/17477778.2024.2429568","title":"Solving the combined flexible job shop scheduling and vehicle routing problem with stochastic features","year":2024,"lang":"en","type":"article","venue":"Journal of Simulation","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Université Gustave Eiffel; Universidad de La Sabana","keywords":"Computer science; Vehicle routing problem; Mathematical optimization; Scheduling (production processes); Production (economics); Operations research; Routing (electronic design automation); Job shop scheduling; Job shop; Reliability (semiconductor); Flow shop scheduling; Mathematics","score_opus":0.010609486755299633,"score_gpt":0.24124511863246645,"score_spread":0.23063563187716682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405444225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31990564,0.001569553,0.67766714,0.00026081954,0.00027162003,0.00008506716,4.7521132e-7,0.00011401352,0.00012564397],"genre_scores_gemma":[0.9744693,0.000013748734,0.025158279,0.000016151176,0.00026801127,8.996775e-7,9.022326e-7,0.000022838494,0.000049839404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942714,0.000015319238,0.00021312403,0.00006549002,0.00017303326,0.00010586389],"domain_scores_gemma":[0.99955887,0.0002008882,0.000053086886,0.000052050716,0.00009517544,0.000039931823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003124616,0.00008496788,0.00010177337,0.000096343625,0.00010163403,0.00021483567,0.00005272969,0.000040744697,0.0000060900256],"category_scores_gemma":[0.00004935017,0.000054762128,0.000028026732,0.00020355338,0.000016854396,0.00026799782,0.000009386845,0.00026666152,0.0000013703864],"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.00001263941,0.0000030620163,0.0001297992,0.000030039808,0.000042721986,0.000003622704,0.0007301855,0.9944119,0.0004086461,0.00021911736,0.000010061107,0.0039982335],"study_design_scores_gemma":[0.0002915671,0.000053106818,0.0005044454,0.00028652017,0.000041950843,0.00003254437,0.00023012618,0.9982179,0.0001475524,0.0001124432,0.0000097806715,0.00007205968],"about_ca_topic_score_codex":0.0000010812211,"about_ca_topic_score_gemma":9.678812e-7,"teacher_disagreement_score":0.65456367,"about_ca_system_score_codex":0.00003637428,"about_ca_system_score_gemma":0.00002331789,"threshold_uncertainty_score":0.22331348},"labels":[],"label_agreement":null},{"id":"W4405511808","doi":"10.1504/ijads.2025.10068509","title":"Minimising makespan and total tardiness in no-wait open-shop scheduling problems using metaheuristic algorithms: a narrative review","year":2024,"lang":"en","type":"review","venue":"International Journal of Applied Decision Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tardiness; Job shop scheduling; Metaheuristic; Computer science; Scheduling (production processes); Mathematical optimization; Narrative; Operations research; Algorithm; Mathematics","score_opus":0.08560608207754947,"score_gpt":0.4020833054340306,"score_spread":0.3164772233564811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405511808","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009256418,0.96979994,0.025970448,0.000047274527,0.0027806058,0.0004906647,0.000018299954,0.000026924725,0.0007732985],"genre_scores_gemma":[0.000057120225,0.781899,0.2176048,0.00003980412,0.00032514895,0.0000140529455,0.0000055053843,0.00003770846,0.000016871767],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960415,0.00005614413,0.0019120655,0.00048106728,0.0012492075,0.00026006633],"domain_scores_gemma":[0.99800074,0.00052858033,0.0006794977,0.00015213591,0.000496257,0.00014279164],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002712607,0.00044290908,0.0015841171,0.0011697036,0.00009607535,0.0010379507,0.0013940838,0.00016356024,0.00005674558],"category_scores_gemma":[0.00044229976,0.00031818042,0.00026066473,0.0012594305,0.00014588772,0.00050575176,0.0003547884,0.00067792874,0.000028010749],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015149344,0.000039659066,5.766043e-7,0.0034062453,0.00034631306,0.00012864644,0.00043570626,0.10016421,0.0000038136006,0.00017585981,0.00025312766,0.8950307],"study_design_scores_gemma":[0.0010765468,0.00011121754,0.0000011130365,0.29038906,0.0012191874,0.002923932,0.0010122627,0.5516648,0.0000059288705,0.0022299115,0.14806283,0.0013031948],"about_ca_topic_score_codex":0.000003745821,"about_ca_topic_score_gemma":0.00000167049,"teacher_disagreement_score":0.8937275,"about_ca_system_score_codex":0.00024838914,"about_ca_system_score_gemma":0.00044977912,"threshold_uncertainty_score":0.99999905},"labels":[],"label_agreement":null},{"id":"W4405602693","doi":"10.1109/icpea63589.2024.10785187","title":"A Distributed Optimization Algorithm Considering Inequality Constraints and its Application in Economic Dispatch Problem","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Economic dispatch; Mathematical optimization; Computer science; Inequality; Optimization algorithm; Algorithm; Mathematics; Electric power system","score_opus":0.010882169536315055,"score_gpt":0.23509966319699124,"score_spread":0.2242174936606762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405602693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011449304,0.00038252564,0.9863861,0.00012931957,0.00013660963,0.00026761406,0.00007699957,0.00060225604,0.00056924444],"genre_scores_gemma":[0.77294445,0.00018922871,0.22647342,0.000016967328,0.000044811204,0.00008090329,0.00020028935,0.000029048428,0.000020895379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929106,0.000016097538,0.0002709535,0.00021962637,0.000051444338,0.00015080467],"domain_scores_gemma":[0.9997674,0.00005786587,0.0000147101,0.00008180368,0.000017943223,0.000060249444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017694551,0.00012129031,0.00012883951,0.00009888001,0.00002517093,0.00009374404,0.0000414144,0.00007852013,0.000073816904],"category_scores_gemma":[0.00001169852,0.00012786748,0.000017217397,0.00016942092,0.000024804354,0.00018981138,0.00001861219,0.00011176517,0.00002955124],"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":[6.9637383e-7,0.000005821234,0.0002695196,0.00007521178,0.000013714653,0.000002440032,0.000103418126,0.9720861,0.000035718727,0.0014228722,0.000021581845,0.02596295],"study_design_scores_gemma":[0.00019819483,0.000004527643,0.000109276516,0.00004270925,0.000006292382,0.0000106911475,0.000065851,0.9987461,0.00038415592,0.00019494371,0.0000855752,0.00015170177],"about_ca_topic_score_codex":0.000020990323,"about_ca_topic_score_gemma":0.00002260513,"teacher_disagreement_score":0.7614951,"about_ca_system_score_codex":0.000105219966,"about_ca_system_score_gemma":0.000026057562,"threshold_uncertainty_score":0.5214284},"labels":[],"label_agreement":null},{"id":"W4405867544","doi":"10.1007/978-981-99-5491-9_17","title":"Production Planning and Scheduling for Parallel Machines with Sequence-Dependent Setup Times","year":2024,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Scheduling (production processes); Parallel computing; Sequence (biology); Production planning; Distributed computing; Production (economics); Mathematical optimization; Mathematics; Chemistry; Economics","score_opus":0.059675492076126276,"score_gpt":0.38388517189988414,"score_spread":0.32420967982375787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405867544","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008398281,0.0012793287,0.026386863,0.023337744,0.008024015,0.010284003,0.00044861928,0.00080307544,0.9210381],"genre_scores_gemma":[0.13622876,0.008966208,0.23589231,0.000091752656,0.00074586034,0.0036503912,0.0006074876,0.00022086616,0.6135964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99055296,0.000076970384,0.0010027167,0.0019693014,0.0051888726,0.0012091484],"domain_scores_gemma":[0.9969041,0.00012526255,0.00004765234,0.0007846788,0.0018891746,0.00024917175],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.007909023,0.0005534436,0.00036718565,0.008364731,0.0020035098,0.004403526,0.002883623,0.00015744187,0.00039075408],"category_scores_gemma":[0.00045929957,0.0005333605,0.000069618785,0.0025593156,0.004277162,0.0049054762,0.0016950888,0.0013043013,0.00010369931],"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.0000840007,0.0000455526,0.000055557248,0.00012981857,0.00009965106,0.00008332289,0.000490313,0.5947423,0.00015178052,0.40226725,0.00020800339,0.0016424247],"study_design_scores_gemma":[0.000783794,0.00017748665,0.00030195687,0.001597614,0.00002578218,0.00007208242,0.004147989,0.95176,0.00027067433,0.018291343,0.021738885,0.00083237345],"about_ca_topic_score_codex":0.00012950005,"about_ca_topic_score_gemma":0.0012496988,"teacher_disagreement_score":0.3839759,"about_ca_system_score_codex":0.002518622,"about_ca_system_score_gemma":0.0003583187,"threshold_uncertainty_score":0.9997118},"labels":[],"label_agreement":null},{"id":"W4406141308","doi":"10.1016/j.cie.2025.110856","title":"Deep reinforcement learning for machine scheduling: Methodology, the state-of-the-art, and future directions","year":2025,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Victoria","funders":"","keywords":"Reinforcement learning; Scheduling (production processes); Computer science; Artificial intelligence; Reinforcement; Industrial engineering; Machine learning; Operations research; Engineering; Operations management; Structural engineering","score_opus":0.026711526285969955,"score_gpt":0.24955066450682878,"score_spread":0.22283913822085882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406141308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032703846,0.0012168781,0.9903502,0.0004605114,0.0041236295,0.00030915934,0.0000011654977,0.00020937633,0.000058724243],"genre_scores_gemma":[0.32656163,0.0010027614,0.6677976,0.00026687587,0.0028985597,0.00024697388,0.000060443293,0.0001636858,0.0010014566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993052,0.00003803965,0.00026344147,0.00012963788,0.000075134594,0.0001885304],"domain_scores_gemma":[0.9992924,0.00042313413,0.00004358237,0.0001600838,0.00004244068,0.00003838472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003403998,0.00014923148,0.00018989969,0.00011407703,0.00014811811,0.000041315117,0.00017239845,0.00010136487,0.000003043811],"category_scores_gemma":[0.0001730246,0.000114340335,0.00007871125,0.00037455713,0.000029050658,0.000047261405,0.000068780246,0.00042331134,3.8895436e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069922157,0.0000024831138,0.000029709328,0.000026849275,0.000091982525,1.1989914e-7,0.00021695656,0.9440761,0.000073803916,0.00033712096,0.00008655231,0.0550513],"study_design_scores_gemma":[0.0005605528,0.000017647924,0.000050163137,0.000054176155,0.000038321403,0.000002359409,0.000051268926,0.966137,0.0009994959,0.000021676295,0.031964265,0.00010309331],"about_ca_topic_score_codex":0.0000062072586,"about_ca_topic_score_gemma":0.0000018347523,"teacher_disagreement_score":0.32329124,"about_ca_system_score_codex":0.000043964785,"about_ca_system_score_gemma":0.000021506112,"threshold_uncertainty_score":0.46626636},"labels":[],"label_agreement":null},{"id":"W4406266212","doi":"10.1109/sips62058.2024.00043","title":"Efficient Assignment with Time Constraints for Heterogeneous DSP Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Digital signal processing; Computer hardware","score_opus":0.00785478694766088,"score_gpt":0.20557007321784213,"score_spread":0.19771528627018126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406266212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058883005,0.00058472063,0.9879123,0.00002832282,0.00057612045,0.00028756986,0.000021594955,0.0009226788,0.003778416],"genre_scores_gemma":[0.96023667,0.0000033398999,0.038168754,0.000017522443,0.000092538656,0.00007449984,0.00001443114,0.000040761668,0.0013514833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995323,0.00000451008,0.00010528596,0.00012066357,0.00009641761,0.00014086762],"domain_scores_gemma":[0.9997944,0.000045127283,0.0000050353146,0.000080528516,0.000021187465,0.000053705615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007064505,0.00009023171,0.00008556442,0.000043779848,0.000024122975,0.00009725662,0.000039359915,0.00003473369,0.00013630351],"category_scores_gemma":[0.0000029152093,0.000067010944,0.000027551825,0.00007159459,0.000019079407,0.000009875478,0.000004005444,0.000036847727,0.00015331058],"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.0000017890231,0.0000060490706,8.5139374e-7,0.000066091,0.00005392381,0.0000073070837,0.000049759128,0.9974786,0.00013801474,0.0002997243,0.00036167356,0.0015362024],"study_design_scores_gemma":[0.00014255432,0.00003563029,4.4201911e-7,0.000060841965,0.000014697965,0.00003963632,0.000039074643,0.9974873,0.0011106571,0.0000020187317,0.00096128194,0.00010586753],"about_ca_topic_score_codex":7.2575153e-7,"about_ca_topic_score_gemma":1.1214634e-7,"teacher_disagreement_score":0.9543484,"about_ca_system_score_codex":0.000047683276,"about_ca_system_score_gemma":0.00001406862,"threshold_uncertainty_score":0.2732627},"labels":[],"label_agreement":null},{"id":"W4406478835","doi":"10.1016/s0246-0335(19)30174-7","title":"10.1016/s0246-0335(19)30174-7","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy","score_opus":0.0056268010706772,"score_gpt":0.16991986075096058,"score_spread":0.16429305968028338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406478835","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006358123,0.00012950822,0.00021451601,0.00008657275,0.0000048551155,0.00008435857,0.000009095456,0.0007487307,0.9986588],"genre_scores_gemma":[0.00004458129,9.671521e-7,0.008817567,0.000028626926,0.0001568009,0.0000135028395,0.00001905092,0.00004130343,0.9908776],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937665,0.000010988305,0.00013702383,0.00013625293,0.00012149324,0.00021760071],"domain_scores_gemma":[0.99956304,0.000026391433,0.000007309298,0.00021112595,0.000024361028,0.00016779594],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007623508,0.00012210855,0.00011525406,0.00007065188,0.000048381582,0.000044789187,0.00013991816,0.00006373821,0.9948494],"category_scores_gemma":[0.000024793058,0.00013008059,0.000040456,0.00022128654,0.00001123908,0.00006510224,0.000011182949,0.0001007711,0.99235696],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000007900297,0.000011030029,4.160832e-8,0.0000062180425,0.000015441094,0.0000031661548,0.000026354313,0.33484375,0.000008408697,3.080898e-7,0.4144671,0.2506103],"study_design_scores_gemma":[0.00014166269,0.000019310091,0.0000031969191,0.000008653193,0.000006848476,0.0000046080922,9.609828e-7,0.1560785,0.00008278191,0.0000023727334,0.8435031,0.00014795834],"about_ca_topic_score_codex":0.0000048204224,"about_ca_topic_score_gemma":4.894822e-8,"teacher_disagreement_score":0.42903605,"about_ca_system_score_codex":0.000034333134,"about_ca_system_score_gemma":0.000010129645,"threshold_uncertainty_score":0.53045326},"labels":[],"label_agreement":null},{"id":"W4406723220","doi":"10.1061/jccee5.cpeng-6042","title":"Automating Pipe Spool Fabrication Shop Scheduling for Modularized Industrial Construction Projects Using Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"Journal of Computing in Civil Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheduling (production processes); Engineering; Construction management; Computer science; Reinforcement learning; Fabrication; Construction engineering; Manufacturing engineering; Systems engineering; Civil engineering; Artificial intelligence; Operations management","score_opus":0.020450165250644043,"score_gpt":0.25097092412209593,"score_spread":0.23052075887145188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406723220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31766984,0.00011069466,0.68055844,0.000011145327,0.0012577634,0.0001780721,1.8721673e-7,0.0001417918,0.000072050076],"genre_scores_gemma":[0.6971774,0.00000758922,0.30247092,0.00000599646,0.0003032673,0.0000028418458,0.0000022904694,0.000025607947,0.0000041034145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983958,0.000029842538,0.00093149557,0.00013672307,0.00021018539,0.00029593293],"domain_scores_gemma":[0.99908596,0.00025060528,0.00028233905,0.00009544208,0.00023581675,0.00004981836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094705314,0.00019440382,0.00036194164,0.0007714422,0.000100063175,0.000099725126,0.00014456929,0.0001527825,0.000002708701],"category_scores_gemma":[0.0008892981,0.00022300833,0.00010780803,0.0007037903,0.000011886296,0.0002247765,0.000031637093,0.00060799747,2.5619028e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014053736,0.000008783242,0.0014824402,0.00015659058,0.000064296626,0.0000019516576,0.0002587261,0.9872505,0.0043912926,0.00011187384,0.0000025636,0.0062569305],"study_design_scores_gemma":[0.0015626543,0.000031375792,0.00018078844,0.0012471161,0.000038409977,0.000025960084,0.000260038,0.99349225,0.0029241832,0.000013920539,0.000038626637,0.0001846935],"about_ca_topic_score_codex":0.0000029788625,"about_ca_topic_score_gemma":6.4282324e-7,"teacher_disagreement_score":0.37950754,"about_ca_system_score_codex":0.00037434793,"about_ca_system_score_gemma":0.000116719275,"threshold_uncertainty_score":0.9094016},"labels":[],"label_agreement":null},{"id":"W4406853580","doi":"10.2139/ssrn.5044674","title":"AI in Operations Management: Literature Review and Future Research","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Process management; Knowledge management; Management science; Business; Engineering","score_opus":0.005962724652220548,"score_gpt":0.288052700921767,"score_spread":0.28208997626954646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406853580","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007833473,0.9596289,0.015077539,0.017624917,0.00031772652,0.00028207633,0.0000014697795,0.00007315969,0.006210888],"genre_scores_gemma":[0.0094418125,0.9844753,0.0024393152,0.0006887059,0.0001683183,0.00001536023,0.0000065170693,0.0000122776555,0.002752382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989197,0.000057241898,0.00015006735,0.000093135954,0.00010106717,0.00067874836],"domain_scores_gemma":[0.99978656,0.000009948698,0.000005185299,0.000093556664,0.00007574623,0.00002900102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010945873,0.00007194082,0.000098835466,0.0002845809,0.00011795103,0.00010582435,0.00011028212,0.000053651387,0.000011073413],"category_scores_gemma":[0.000012315405,0.00006470947,0.000020121714,0.0008742416,0.000011584476,0.00012592833,0.000018218016,0.0019123661,0.00000469391],"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.0000108620925,0.00005479517,0.000147361,0.0013747097,0.00032396684,0.000032907523,0.00043455226,0.019438563,0.000022903107,0.7460321,0.005246857,0.2268804],"study_design_scores_gemma":[0.0070199342,0.00034143453,0.0027088511,0.018017668,0.0005058249,0.0016629758,0.0089132255,0.25288197,0.00009662647,0.2985984,0.4074572,0.0017958754],"about_ca_topic_score_codex":0.0000011217943,"about_ca_topic_score_gemma":0.00007367965,"teacher_disagreement_score":0.4474337,"about_ca_system_score_codex":0.0002358074,"about_ca_system_score_gemma":0.00013309934,"threshold_uncertainty_score":0.83083856},"labels":[],"label_agreement":null},{"id":"W4407534962","doi":"10.2139/ssrn.5135309","title":"Uneven Loads: Understanding the Decline and Variability in U.S. Manufacturing Capacity Utilization over the Past 40 Years","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Ontario Tech University","funders":"","keywords":"Natural resource economics; Economics; Economic geography; Environmental science","score_opus":0.02386544604250341,"score_gpt":0.24621227908609902,"score_spread":0.22234683304359562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407534962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22695199,0.0020241472,0.76812816,0.0010890162,0.00092573185,0.0003443715,0.000012391911,0.000105162624,0.0004190582],"genre_scores_gemma":[0.9938154,0.00519324,0.00057850353,0.000074513046,0.00023403412,0.000009590955,0.000009455876,0.000023254377,0.000061965504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814314,0.00022041415,0.00036591195,0.00022307989,0.00022338581,0.00082409504],"domain_scores_gemma":[0.99933267,0.00021764582,0.00010552595,0.0002778636,0.000027611484,0.000038659695],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003292988,0.00021717044,0.00021273165,0.00013463627,0.00018086523,0.00017850286,0.0003455265,0.00020806496,0.000014321754],"category_scores_gemma":[0.000099485675,0.00015534843,0.00007954472,0.0001697117,0.0000787278,0.000075739044,0.00018618035,0.0036724596,8.9998e-7],"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.000024355419,0.000023518254,0.0026872864,0.0000849463,0.00023929455,0.0000017501045,0.0010472357,0.9694313,0.000002736872,0.017206332,0.000031311953,0.009219976],"study_design_scores_gemma":[0.00063765986,0.00001705248,0.012358641,0.00019654115,0.00010375432,0.00005428143,0.0017641718,0.43477637,0.00004294208,0.54951334,0.00018930968,0.00034591317],"about_ca_topic_score_codex":0.00008473925,"about_ca_topic_score_gemma":0.0008584717,"teacher_disagreement_score":0.76754963,"about_ca_system_score_codex":0.00175524,"about_ca_system_score_gemma":0.0004208832,"threshold_uncertainty_score":0.9986261},"labels":[],"label_agreement":null},{"id":"W4408024134","doi":"10.1080/00207543.2025.2470997","title":"Incorporating learning and fatigue effects in flowshop scheduling: a case study","year":2025,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Universidad de La Sabana; Campus France","keywords":"Scheduling (production processes); Job shop scheduling; Modular design; Learning effect; Computer science; Industrial engineering; Operator (biology); Process (computing); Artificial intelligence; Operations research; Operations management; Engineering; Schedule","score_opus":0.04999205800608054,"score_gpt":0.39952610281381334,"score_spread":0.3495340448077328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408024134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9812098,0.00043949016,0.015577855,0.000567693,0.0017741878,0.00018052636,1.3321103e-7,0.000029658007,0.00022065533],"genre_scores_gemma":[0.9839342,0.00005729182,0.015519425,0.0000053660524,0.0003022157,0.000009826438,6.159555e-7,0.000010139438,0.0001608763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.00021255873,0.00036175756,0.00013591784,0.00046090633,0.000121286386],"domain_scores_gemma":[0.998771,0.00021160465,0.000057873425,0.00006274045,0.000852313,0.00004444458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022452283,0.000072780334,0.0001235685,0.0011389962,0.00008324672,0.00011716023,0.00013137571,0.00004102541,0.000006420513],"category_scores_gemma":[0.0019234882,0.000071034716,0.000022216962,0.00056468416,0.00003962543,0.00021193226,0.00005502493,0.00076880545,0.0000014474329],"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.000060462913,0.00020723358,0.056613974,0.00006566418,0.00018141151,0.0021029406,0.0021275787,0.88852495,0.0014472656,0.00019442035,0.00007444111,0.048399627],"study_design_scores_gemma":[0.0034529509,0.00043001524,0.005125813,0.0008891636,0.00002764098,0.0037313257,0.030804852,0.94835526,0.0052060764,0.0013460289,0.00034747546,0.00028340713],"about_ca_topic_score_codex":0.000035858924,"about_ca_topic_score_gemma":0.00003173381,"teacher_disagreement_score":0.05983027,"about_ca_system_score_codex":0.00014373177,"about_ca_system_score_gemma":0.00007354962,"threshold_uncertainty_score":0.334012},"labels":[],"label_agreement":null},{"id":"W4408097242","doi":"10.1007/978-981-96-2212-2_17","title":"Cloud Manufacturing Resource Allocation Considering Task Occupancy","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Concordia University","funders":"","keywords":"Occupancy; Task (project management); Cloud computing; Computer science; Resource (disambiguation); Cloud manufacturing; Engineering; Operating system; Computer network; Architectural engineering; Systems engineering","score_opus":0.006030502796290325,"score_gpt":0.19635671927468468,"score_spread":0.19032621647839434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408097242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012353908,0.007266641,0.96074,0.00014847599,0.0011054364,0.00043906167,0.000014631547,0.0016795703,0.028482676],"genre_scores_gemma":[0.64273,0.004146673,0.31458378,0.001520329,0.0066257585,0.00030944298,0.00082430366,0.0022019637,0.027057773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979147,0.000011554896,0.00062035077,0.0005284884,0.00030550896,0.000619415],"domain_scores_gemma":[0.9987709,0.00055641885,0.00006790898,0.00043468058,0.000040326846,0.00012979434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014176339,0.0006805078,0.0006411635,0.00080951414,0.00005820552,0.00007927624,0.00028832513,0.00084540015,0.00006375377],"category_scores_gemma":[0.00029964108,0.00078853325,0.00016875676,0.00025035758,0.000021150878,0.00006824972,0.00005721973,0.0018149164,0.000025968468],"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.0000094381785,0.0000054937013,0.0000028764487,0.00018900317,0.00008603017,0.00003455382,0.000054628556,0.9621766,0.00015072501,0.0019728902,0.000113931324,0.03520382],"study_design_scores_gemma":[0.000400547,0.000032961347,0.000006958222,0.0006978711,0.00007070252,0.000028396385,7.086428e-7,0.9466834,0.010067486,0.0013400873,0.03967022,0.0010006526],"about_ca_topic_score_codex":0.000006303715,"about_ca_topic_score_gemma":0.000009786832,"teacher_disagreement_score":0.6461562,"about_ca_system_score_codex":0.00052059063,"about_ca_system_score_gemma":0.000059837268,"threshold_uncertainty_score":0.9994566},"labels":[],"label_agreement":null},{"id":"W4408146683","doi":"10.1109/icips64173.2024.10899980","title":"A Robust scheduling method of AC / DC Distribution Network Based on Diamond-shaped Cutting Convex Hull Set","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convex hull; Hull; Diamond; Regular polygon; Scheduling (production processes); Computer science; Mathematical optimization; Materials science; Mathematics; Composite material; Geometry","score_opus":0.024648991813298816,"score_gpt":0.2624092170438883,"score_spread":0.23776022523058948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408146683","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025802949,0.000332385,0.99372935,0.0001362024,0.0007484089,0.00012771801,0.00004905883,0.0009242447,0.001372343],"genre_scores_gemma":[0.40468717,0.000020412066,0.5945046,0.00008161789,0.0002696972,0.000015784231,0.00026855493,0.000049162296,0.00010304281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988708,0.000056828976,0.00033631065,0.0002458715,0.00020165516,0.00028855898],"domain_scores_gemma":[0.99922544,0.00039364604,0.00003345579,0.00019748694,0.000064407985,0.000085549764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055700744,0.00018843666,0.00023473433,0.00008277722,0.0000644595,0.00008251285,0.000107343425,0.00013445213,0.00025277157],"category_scores_gemma":[0.00011515367,0.00017856821,0.00010589047,0.0006040697,0.000018378772,0.000093592695,0.000019475483,0.00026729278,0.000040258827],"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.0000065166623,0.000009421577,0.00008668134,0.000115045485,0.000038656992,0.000004221655,0.00005978247,0.99491036,0.00020594388,0.00088863575,0.00037945784,0.0032952772],"study_design_scores_gemma":[0.00022315979,0.000026782724,0.000043107124,0.0002422199,0.000036874386,0.0000023874973,0.00008528049,0.99536026,0.0032776112,0.000060108934,0.00044957813,0.00019261353],"about_ca_topic_score_codex":0.000009426121,"about_ca_topic_score_gemma":0.0000013763757,"teacher_disagreement_score":0.40210685,"about_ca_system_score_codex":0.00006654738,"about_ca_system_score_gemma":0.000034474546,"threshold_uncertainty_score":0.72818005},"labels":[],"label_agreement":null},{"id":"W4408348918","doi":"10.1007/s10479-025-06541-8","title":"Two-stage hybrid flow shop scheduling with sequence-dependent setup times in semiconductor manufacturing: A customized variable neighborhood search","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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é du Québec à Montréal","funders":"","keywords":"Theory of computation; Scheduling (production processes); Flow shop scheduling; Variable neighborhood search; Computer science; Stage (stratigraphy); Variable (mathematics); Job shop scheduling; Sequence (biology); Mathematical optimization; Industrial engineering; Mathematics; Algorithm; Engineering; Embedded system; Metaheuristic; Chemistry","score_opus":0.08975714486119546,"score_gpt":0.37725509621016456,"score_spread":0.2874979513489691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408348918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9109712,0.0007817498,0.06956337,0.0014160264,0.00020880857,0.0011996834,0.00017915129,0.00027819726,0.015401823],"genre_scores_gemma":[0.91801417,0.00023718967,0.07784234,0.00006116631,0.00005306832,0.00012222854,0.00009056197,0.000042567335,0.0035367352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977171,0.00023817027,0.00045201363,0.00037257915,0.0006075949,0.0006125469],"domain_scores_gemma":[0.9985151,0.00023930405,0.000014183784,0.0004782356,0.0006221339,0.00013102422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016407184,0.00020141297,0.00032872998,0.00095546426,0.0002787716,0.00031387853,0.00039415347,0.00009107106,0.00057992066],"category_scores_gemma":[0.00021445155,0.00018688412,0.00004749197,0.0010174557,0.00014059647,0.0004093646,0.00011003119,0.0007733537,0.000043158783],"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.00006404539,0.00008017332,0.00014929728,0.000098107026,0.00009114652,0.00001854796,0.00031240584,0.99134535,0.005171514,0.0016490136,0.00012876549,0.00089165807],"study_design_scores_gemma":[0.0011249962,0.000039429076,0.000020113479,0.00017272959,0.0000054065563,0.0000042930546,0.0007405897,0.8349131,0.1626317,0.000088157256,0.000099155826,0.0001603477],"about_ca_topic_score_codex":0.0003753284,"about_ca_topic_score_gemma":0.000101739315,"teacher_disagreement_score":0.15746018,"about_ca_system_score_codex":0.00010339426,"about_ca_system_score_gemma":0.00062683166,"threshold_uncertainty_score":0.76209134},"labels":[],"label_agreement":null},{"id":"W4408378018","doi":"10.5267/j.ijiec.2025.2.003","title":"A hybrid artificial bee colony algorithm with an iterated local search mechanism for distributed no-wait flowshop problems with preventive maintenance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Mechanism (biology); Iterated function; Iterated local search; Preventive maintenance; Computer science; Mathematical optimization; Local search (optimization); Algorithm; Artificial intelligence; Engineering; Mathematics; Reliability engineering","score_opus":0.015708254781799012,"score_gpt":0.24903422165151262,"score_spread":0.2333259668697136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022120794,0.000014635872,0.9754355,0.0003461754,0.0013162858,0.00036254612,0.0002563412,0.00013009213,0.000017613038],"genre_scores_gemma":[0.7021091,0.000007906539,0.29647803,0.000047333302,0.00086832605,0.00005784863,0.0003151503,0.000058101927,0.000058213966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986267,0.000027880313,0.00053992623,0.00017671495,0.0003872563,0.00024152447],"domain_scores_gemma":[0.9973664,0.00017414587,0.00012229529,0.000080918166,0.0021377986,0.00011843602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025392207,0.00020947018,0.0002638231,0.00040783448,0.00007596825,0.00019377629,0.00030975064,0.000093986746,0.000010942669],"category_scores_gemma":[0.00012528565,0.00018526003,0.0000748415,0.00035895465,0.000039642473,0.00029903575,0.000020528696,0.0004289522,0.0000020700525],"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.00020078037,0.00009219836,0.000006686496,0.000013198539,0.0005260156,0.000033168348,0.00008807694,0.98853713,0.0001846663,0.0016456514,0.00022300039,0.008449401],"study_design_scores_gemma":[0.0024194126,0.00043102272,0.000016593127,0.00051330344,0.00006471983,0.00009894825,0.00009490058,0.99325705,0.0023117831,0.00032427878,0.00027054938,0.0001974692],"about_ca_topic_score_codex":0.000009968187,"about_ca_topic_score_gemma":0.0000044611315,"teacher_disagreement_score":0.6799883,"about_ca_system_score_codex":0.00027836926,"about_ca_system_score_gemma":0.00026466252,"threshold_uncertainty_score":0.7554684},"labels":[],"label_agreement":null},{"id":"W4408378481","doi":"10.5267/j.ijiec.2025.1.003","title":"Scheduling of jobs and autonomous mobile robots: Towards the realization of line-less assembly systems","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Realization (probability); Scheduling (production processes); Mobile robot; Robot; Assembly line; Computer science; Engineering; Operations management; Artificial intelligence; Mechanical engineering; Mathematics","score_opus":0.028060529121773536,"score_gpt":0.2700780228710844,"score_spread":0.24201749374931086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1474781,0.0007815421,0.84831506,0.00010019777,0.003061694,0.00011887169,0.000017609736,0.000040077346,0.000086836364],"genre_scores_gemma":[0.9874007,0.00010823198,0.012130436,0.000006804958,0.00031155106,0.000005707911,0.000010130797,0.000014524535,0.000011920068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882543,0.000026724243,0.0007334344,0.00006749684,0.0002641968,0.000082704995],"domain_scores_gemma":[0.9987084,0.00024091432,0.00024520967,0.000079030455,0.00068924826,0.00003716187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034139262,0.000106795844,0.00023125786,0.0003997096,0.000027798304,0.000060833176,0.00025641333,0.00009859143,0.000002084628],"category_scores_gemma":[0.00027442467,0.00009336097,0.000069917405,0.0003337228,0.000028528964,0.00013195648,0.000031351512,0.00023510093,1.8318924e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009461934,0.000020326088,0.00015196121,0.000026954647,0.00024144903,0.0000016414527,0.00017536826,0.98892,0.00034674202,0.0035803935,0.000039189636,0.00648651],"study_design_scores_gemma":[0.00067077705,0.000039018578,0.00022996156,0.00044842594,0.00004817905,0.000024192657,0.0003259701,0.9965329,0.0014303619,0.000050888608,0.00012815362,0.000071156624],"about_ca_topic_score_codex":0.000031690222,"about_ca_topic_score_gemma":7.234934e-7,"teacher_disagreement_score":0.8399226,"about_ca_system_score_codex":0.00008107032,"about_ca_system_score_gemma":0.00013287939,"threshold_uncertainty_score":0.38071498},"labels":[],"label_agreement":null},{"id":"W4408378905","doi":"10.5267/j.ijiec.2025.1.007","title":"Flexible job-shop scheduling problem with the number of workers dependent processing times","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Flow shop scheduling; Scheduling (production processes); Job shop; Mathematical optimization; Computer science; Operations research; Operations management; Industrial engineering; Mathematics; Engineering; Schedule","score_opus":0.01498482121729295,"score_gpt":0.26505270492140814,"score_spread":0.2500678837041152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408378905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057406902,0.00020355567,0.9387256,0.0010188719,0.0012059881,0.00010631893,0.0000050193553,0.00009799217,0.0012297631],"genre_scores_gemma":[0.8831836,0.000010514623,0.1163223,0.000020298008,0.0003189083,0.0000052230303,0.0000042293145,0.000020818592,0.00011410111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895805,0.00001536193,0.0004640849,0.0000763085,0.0003642164,0.00012200326],"domain_scores_gemma":[0.99898136,0.00016668843,0.00016224378,0.00006889966,0.0005773966,0.000043388412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024591995,0.00012703618,0.00017394978,0.00027408966,0.000050191058,0.00011062946,0.0003402006,0.000075266915,0.000021897993],"category_scores_gemma":[0.0000815081,0.00009753366,0.00006837926,0.00044349697,0.000029713561,0.00019103214,0.000026773425,0.00038913198,0.0000020836092],"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.000024738674,0.000018860086,0.0012579752,0.000013437036,0.00029288037,0.0000047035655,0.00014989695,0.98934877,0.00007128571,0.00060252816,0.00020005136,0.008014893],"study_design_scores_gemma":[0.0013590289,0.000022228918,0.0002739309,0.00091447023,0.000077216944,0.00008518652,0.00042856162,0.9944497,0.0017455068,0.00012667445,0.00037053926,0.00014695582],"about_ca_topic_score_codex":0.0000051601173,"about_ca_topic_score_gemma":7.1526733e-7,"teacher_disagreement_score":0.8257767,"about_ca_system_score_codex":0.00010269558,"about_ca_system_score_gemma":0.00019813293,"threshold_uncertainty_score":0.3977307},"labels":[],"label_agreement":null},{"id":"W4408773534","doi":"10.1080/17509653.2025.2475774","title":"Hybrid MTS/MTO production scheduling with cloud orders: a mathematical model based on an empirical study","year":2025,"lang":"en","type":"article","venue":"International Journal of Management Science and Engineering Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Scheduling (production processes); Empirical research; Production (economics); Mathematical optimization; Operations research; Mathematics; Operating system; Microeconomics; Statistics; Economics","score_opus":0.01129578715728355,"score_gpt":0.2677722983794789,"score_spread":0.25647651122219534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408773534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22402531,0.000013613045,0.7725292,0.00050976523,0.0007025454,0.00024290249,4.840225e-7,0.00009364788,0.0018825305],"genre_scores_gemma":[0.85328054,0.000026479454,0.14635938,0.00014284118,0.00007342718,0.000015845842,9.13004e-7,0.0000138003425,0.000086782864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983144,0.000009641364,0.00031602426,0.00023713369,0.00093445537,0.00018838854],"domain_scores_gemma":[0.9994376,0.00001696972,0.00005411731,0.00018996024,0.0002179174,0.000083448635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096544303,0.00015768773,0.0001434053,0.0010022497,0.00007601965,0.00023109796,0.00045060745,0.00001529236,0.0000055251626],"category_scores_gemma":[0.000039015238,0.00013353166,0.000027601624,0.00043323275,0.000047968424,0.00037998657,0.00007269586,0.00014718492,0.0000022641163],"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.00004121511,0.00021953935,0.00015302576,0.000065072454,0.00015816384,0.000054580123,0.000098687444,0.9917613,0.000015239811,0.0015966408,0.00011208445,0.005724413],"study_design_scores_gemma":[0.0007289763,0.00011446369,0.0008168977,0.00025212203,0.00006665021,0.00000833665,0.0005160242,0.99688876,0.00011885392,0.00022023702,0.00013311402,0.00013558456],"about_ca_topic_score_codex":3.646421e-7,"about_ca_topic_score_gemma":2.0916727e-7,"teacher_disagreement_score":0.62925524,"about_ca_system_score_codex":0.0001784382,"about_ca_system_score_gemma":0.000020662203,"threshold_uncertainty_score":0.54452634},"labels":[],"label_agreement":null},{"id":"W4408810302","doi":"10.1021/acs.iecr.4c04900","title":"Recurrent Reinforcement Learning Strategy with a Parameterized Agent for Online Scheduling of a State Task Network Under Uncertainty","year":2025,"lang":"en","type":"article","venue":"Industrial & Engineering Chemistry Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Reinforcement learning; Parameterized complexity; Computer science; Scheduling (production processes); Task (project management); Reinforcement; Artificial intelligence; Error-driven learning; State (computer science); Machine learning; Mathematical optimization; Algorithm; Psychology; Mathematics; Engineering","score_opus":0.07084368239796389,"score_gpt":0.32861617074033367,"score_spread":0.25777248834236977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408810302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81198704,0.0007017825,0.18469146,0.00012732542,0.00054186775,0.0011221456,0.000049087925,0.00051513035,0.00026417672],"genre_scores_gemma":[0.98851436,0.00012890017,0.009773868,0.0000059637,0.00041573736,0.00019889233,0.00024237239,0.000071145405,0.00064873457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979964,0.000037508067,0.0005252532,0.00031238678,0.00042720503,0.00070125615],"domain_scores_gemma":[0.9987856,0.0004270833,0.00006342347,0.0002810369,0.0003125441,0.00013027723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084108097,0.00026134364,0.0003747965,0.00013942628,0.000109756,0.00008853333,0.0002657992,0.00022289419,0.000027591972],"category_scores_gemma":[0.00038886906,0.0002580755,0.00008601106,0.00094857515,0.00006227557,0.00005798606,0.000068696674,0.0011121165,9.790153e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024085147,0.000031735293,0.000018081777,0.00031652325,0.00021345355,0.0000024865503,0.000044174667,0.9664263,0.028407255,0.000022097884,0.00010774869,0.004169278],"study_design_scores_gemma":[0.002143912,0.00013835372,0.0000062229988,0.0007048627,0.000027233964,0.0000015918708,0.00014639147,0.9597549,0.03525103,0.000024566987,0.0015647459,0.0002362263],"about_ca_topic_score_codex":0.000020425665,"about_ca_topic_score_gemma":0.0000017252744,"teacher_disagreement_score":0.17652737,"about_ca_system_score_codex":0.00028861585,"about_ca_system_score_gemma":0.0002688866,"threshold_uncertainty_score":0.9999871},"labels":[],"label_agreement":null},{"id":"W4408874478","doi":"10.1051/ro/2025032","title":"The impact of missing operations on the flow shop: permutation <i>vs</i>. non permutation modes","year":2025,"lang":"en","type":"article","venue":"RAIRO. Operations research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Random permutation; Flow (mathematics); Flow shop scheduling; Computer science; Mathematics; Combinatorics; Physics; Computer network","score_opus":0.03710465537130377,"score_gpt":0.3733692880708745,"score_spread":0.33626463269957074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408874478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45463037,0.0006121331,0.51838785,0.010090349,0.00037570525,0.0017529423,0.00008320779,0.0002555401,0.013811878],"genre_scores_gemma":[0.99001086,0.00015150644,0.007873253,0.00003994017,0.00008640661,0.00020426583,0.0000929618,0.000028010872,0.0015128081],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840707,0.00028492903,0.00035285272,0.0002012354,0.00044267156,0.00031126104],"domain_scores_gemma":[0.99811333,0.00067103916,0.000010827542,0.0004446197,0.0007002141,0.000059953916],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011468887,0.00015222475,0.00014146227,0.00030094484,0.0017440672,0.000550001,0.0003096761,0.000091924005,0.00010441385],"category_scores_gemma":[0.00075463473,0.00009433866,0.00010251082,0.0011059039,0.00016087478,0.00023480611,0.000036538215,0.0004538078,0.0000433373],"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.000015888616,0.000031290565,0.00002392182,0.000011066868,0.00005359854,5.1636493e-7,0.001031355,0.98119074,0.0065099853,0.003055069,0.0015368256,0.006539766],"study_design_scores_gemma":[0.0002329294,0.000061521154,0.0006712661,0.000060488943,0.000008835285,0.0000017172061,0.001114486,0.9875025,0.010052973,0.0001390036,0.000063092855,0.00009116751],"about_ca_topic_score_codex":0.00016496019,"about_ca_topic_score_gemma":0.00012270368,"teacher_disagreement_score":0.5353805,"about_ca_system_score_codex":0.00024008748,"about_ca_system_score_gemma":0.00033818762,"threshold_uncertainty_score":0.9995555},"labels":[],"label_agreement":null},{"id":"W4409059273","doi":"10.1109/spicscon64195.2024.10941280","title":"Optimizing Round Robin Scheduling with DBSCAN Clustering and Machine Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Cluster analysis; DBSCAN; Scheduling (production processes); Machine learning; Artificial intelligence; Fuzzy clustering; Canopy clustering algorithm; Mathematical optimization; Mathematics","score_opus":0.011758642134135033,"score_gpt":0.2127354921387204,"score_spread":0.20097685000458537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409059273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0362336,0.0042457916,0.9526574,0.000094143754,0.00025610725,0.00007504212,0.0000011879254,0.0018565969,0.0045801345],"genre_scores_gemma":[0.59958017,0.00019776003,0.39936823,0.000021302065,0.00008504719,0.000006507821,0.000008823526,0.000063824315,0.0006683085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993134,0.000011732474,0.00014345007,0.00020923422,0.00010385946,0.00021833337],"domain_scores_gemma":[0.9997485,0.000051429786,0.000008982187,0.00008640375,0.000017981294,0.00008669733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013667179,0.00016455303,0.00013116663,0.00013527383,0.000097388925,0.00034652685,0.000054792767,0.000055314897,0.00008151195],"category_scores_gemma":[0.0000104188675,0.00013924461,0.000022350929,0.00023910112,0.000020731555,0.00022901349,0.000031807147,0.00030465628,0.000016141352],"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.0000031666577,0.0000020058935,0.00010296385,0.000087288565,0.000042162927,0.00001545899,0.0004422124,0.99103904,0.00032204346,0.0001589547,0.0000043646614,0.0077803293],"study_design_scores_gemma":[0.00018303195,0.000027796415,0.000011072926,0.00015893515,0.000018593648,0.00006167604,0.00028443531,0.99765885,0.0007557176,0.000007332651,0.0006213145,0.0002112364],"about_ca_topic_score_codex":0.000024648956,"about_ca_topic_score_gemma":0.00002479963,"teacher_disagreement_score":0.5633466,"about_ca_system_score_codex":0.00004058671,"about_ca_system_score_gemma":0.000011575438,"threshold_uncertainty_score":0.56782305},"labels":[],"label_agreement":null},{"id":"W4409082705","doi":"10.18280/mmep.120331","title":"Discrete Fuzzy Multi-Objective Unrelated Parallel Machine Scheduling Problems: A Framework of Modified Artificial Fish Swarm Algorithm","year":2025,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Swarm behaviour; Computer science; Fish <Actinopterygii>; Fuzzy logic; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Fishery; Biology","score_opus":0.01920696262217123,"score_gpt":0.23394539241662612,"score_spread":0.2147384297944549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409082705","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007160513,0.0010255931,0.9899164,0.00007926089,0.0002476258,0.0004459632,0.000023971279,0.00075693725,0.00034373172],"genre_scores_gemma":[0.31709775,0.00019181386,0.6824062,0.000012539335,0.000038111695,0.00008710985,0.00001894114,0.00006981739,0.000077690864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980874,0.000023424866,0.00079846097,0.0003837931,0.00022957545,0.00047733609],"domain_scores_gemma":[0.99910146,0.00026829602,0.00007343937,0.00030283906,0.00010222348,0.00015173538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003787028,0.00041117382,0.00059927686,0.0002857559,0.0001068523,0.000096333606,0.00018831012,0.00034448318,0.0000073530837],"category_scores_gemma":[0.00012479111,0.00039728964,0.00012145921,0.0005538193,0.00006595795,0.00012399131,0.000062956045,0.0006677323,0.000005739418],"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.000007181543,0.00007967978,0.000004312483,0.0010803174,0.00017602832,0.0000016241441,0.0010421256,0.9860494,0.00011120684,0.010446153,0.000001923536,0.0010000153],"study_design_scores_gemma":[0.00046142464,0.00002908701,0.0000030933531,0.0014518396,0.00008140952,0.00000481712,0.000071358794,0.96531695,0.00047661844,0.0317194,0.000009511252,0.00037447244],"about_ca_topic_score_codex":0.00001494084,"about_ca_topic_score_gemma":9.0529653e-7,"teacher_disagreement_score":0.30993724,"about_ca_system_score_codex":0.0000523451,"about_ca_system_score_gemma":0.000021465132,"threshold_uncertainty_score":0.9998479},"labels":[],"label_agreement":null},{"id":"W4409257733","doi":"10.1109/tits.2025.3556331","title":"Optimal Control for Platooning Under Batch Dispatching Opportunities","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Optimal control; Control (management); Computer science; Automotive engineering; Engineering; Aeronautics; Control engineering; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.030978576918750802,"score_gpt":0.2564112724146372,"score_spread":0.22543269549588638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409257733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013038518,0.000249142,0.981364,0.00008962005,0.003466692,0.0006512526,0.00026965424,0.0006067326,0.00026437925],"genre_scores_gemma":[0.9925274,0.00014481285,0.0054745497,0.00010307915,0.000056260757,0.00046552246,0.000067920846,0.000053165077,0.0011072897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863255,0.000029448378,0.00062022946,0.00024828294,0.00019930732,0.000270161],"domain_scores_gemma":[0.9992669,0.00025880896,0.000053345222,0.0001832358,0.00014532545,0.00009235239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019895336,0.0002519842,0.00029346868,0.00032398233,0.00023273211,0.00010488108,0.00012529569,0.00015201009,0.00004412897],"category_scores_gemma":[0.0000020196549,0.0002700285,0.00018123181,0.00023368828,0.000031069427,0.00017414876,7.373289e-8,0.00020886355,0.00001212152],"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.000053162763,0.000040469928,0.000014540629,0.00017766088,0.0002211044,0.0000015418556,0.0005577906,0.9938648,0.00013002669,0.0016541473,0.000078467005,0.0032062915],"study_design_scores_gemma":[0.0008556414,0.000047992253,0.00003434673,0.00029129616,0.00015434301,0.0000019240026,0.0042416654,0.9837885,0.0089295395,0.00003583888,0.0013106497,0.00030827615],"about_ca_topic_score_codex":0.00003840341,"about_ca_topic_score_gemma":0.00003601485,"teacher_disagreement_score":0.9794889,"about_ca_system_score_codex":0.00010537044,"about_ca_system_score_gemma":0.000051335577,"threshold_uncertainty_score":0.9999752},"labels":[],"label_agreement":null},{"id":"W4409306370","doi":"10.1007/978-3-031-63665-3_3","title":"LCTVSs and Weak Topologies","year":2025,"lang":"en","type":"book-chapter","venue":"CMS/CAIMS books in mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Network topology; Computer science; Topology (electrical circuits); Mathematics; Computer network; Combinatorics","score_opus":0.016738567298484563,"score_gpt":0.2289757445547444,"score_spread":0.21223717725625985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409306370","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034033645,0.0023081393,0.014811175,0.000054382628,0.0005178685,0.00024865972,0.000021008522,0.00045895128,0.9815458],"genre_scores_gemma":[0.00016967405,0.0018512069,0.22012922,0.000059613107,0.000117057345,0.000025569889,0.000021967333,0.00011346316,0.77751225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895746,0.00000503094,0.00044801753,0.00022374334,0.00015408547,0.00021167107],"domain_scores_gemma":[0.99925315,0.00020208959,0.00007012007,0.00038200725,0.00004031244,0.000052345633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001488168,0.00035217733,0.00048825273,0.00025535413,0.00004184717,0.000067314475,0.00020183413,0.00041778068,0.00011854222],"category_scores_gemma":[0.00007458395,0.00035707673,0.00006996425,0.00003225194,0.00010556197,0.000041644937,0.000095035095,0.00043942785,0.000044351065],"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.000004266702,0.000027684346,0.000014133498,0.002540961,0.00020703142,0.000042962867,0.0015511492,0.0123745,0.000010674219,0.95492417,0.009323207,0.018979285],"study_design_scores_gemma":[0.0007775359,0.00004699438,0.0000072063112,0.0033355649,0.00018030663,0.000039976625,0.000600537,0.34768656,0.00023051664,0.562594,0.0830023,0.0014985014],"about_ca_topic_score_codex":0.0000011997448,"about_ca_topic_score_gemma":0.0000071080885,"teacher_disagreement_score":0.39233014,"about_ca_system_score_codex":0.000074039686,"about_ca_system_score_gemma":0.000030277733,"threshold_uncertainty_score":0.9998881},"labels":[],"label_agreement":null},{"id":"W4409362756","doi":"10.1609/aaai.v39i25.34844","title":"Privacy-and-Utility-Aware Publishing of Schedules","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Bundesministerium für Bildung und Forschung","keywords":"Computer science; Publishing; Data publishing; Internet privacy; Computer security; Political science; Law","score_opus":0.04644402706094024,"score_gpt":0.27292492077061753,"score_spread":0.22648089370967728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409362756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380861,0.00035481065,0.113728,0.004486583,0.0012218156,0.00063403096,0.000026528263,0.00040514735,0.041056957],"genre_scores_gemma":[0.99263656,0.000082196166,0.0070711765,0.000051872306,0.000024724306,0.000009420828,7.4998496e-7,0.000010450423,0.000112834714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989802,0.000006601272,0.00043023433,0.00019954429,0.00020989391,0.00017349518],"domain_scores_gemma":[0.99913466,0.0000783488,0.00011292539,0.00015466398,0.00047613098,0.000043291864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283213,0.00014316381,0.00021566189,0.0001482301,0.0000791621,0.00017484129,0.00058910955,0.00010280848,0.000047714133],"category_scores_gemma":[0.00073027605,0.00011691015,0.000060670023,0.0005328296,0.00019143877,0.00030378977,0.00014550217,0.00026906503,0.000004481615],"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.00005025913,0.00008470783,0.0022921208,0.00042366088,0.00005812444,1.0147093e-7,0.0010335349,0.00288053,0.008371436,0.864432,0.0001789672,0.12019457],"study_design_scores_gemma":[0.000027612772,0.000022369797,0.00042348108,0.00042593668,0.000018856768,4.7176863e-7,0.0011456759,0.5065613,0.44788024,0.043326885,0.000049708364,0.000117467476],"about_ca_topic_score_codex":0.000015274216,"about_ca_topic_score_gemma":0.0000027699125,"teacher_disagreement_score":0.8211051,"about_ca_system_score_codex":0.000018650286,"about_ca_system_score_gemma":0.000042703068,"threshold_uncertainty_score":0.47674575},"labels":[],"label_agreement":null},{"id":"W4409449443","doi":"10.1016/j.tcs.2025.115258","title":"Approximation algorithms for maximum weighted throughput on unrelated machines","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Throughput; Algorithm; Computer science; Approximation algorithm; Mathematics","score_opus":0.009445664617846294,"score_gpt":0.2547615915623328,"score_spread":0.2453159269444865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409449443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003818227,0.000030624393,0.9885358,0.00041447562,0.0012135784,0.0002307874,0.00000438328,0.0005059783,0.0052461517],"genre_scores_gemma":[0.39358655,0.0000053072804,0.6059592,0.0002861401,0.000094457086,0.000019784064,0.000009547483,0.000012694615,0.00002633752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990034,0.000023780174,0.00019371005,0.00028934955,0.00021017331,0.00027956325],"domain_scores_gemma":[0.99933326,0.00021330609,0.000016853897,0.00024653933,0.00011841447,0.00007165125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005190001,0.00013909306,0.00013724461,0.00018184952,0.00021728067,0.00013272838,0.00036871323,0.000066122084,0.000025655881],"category_scores_gemma":[0.00006124448,0.00011537469,0.00004288047,0.0008347482,0.00047434983,0.00012413747,0.000056204717,0.00012912673,0.000023845838],"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.000011376518,0.0000285787,0.000004437516,0.000021601467,0.000010262108,6.019238e-7,0.00009680856,0.08587499,0.000077853394,0.79956853,0.000097448086,0.114207484],"study_design_scores_gemma":[0.00029819703,0.00004596048,0.00004635567,0.000038578644,0.000007309146,0.0000014137106,0.000003397037,0.8816616,0.003387478,0.114330806,0.000060462226,0.00011844337],"about_ca_topic_score_codex":4.5873114e-7,"about_ca_topic_score_gemma":5.7275543e-8,"teacher_disagreement_score":0.7957866,"about_ca_system_score_codex":0.000054258937,"about_ca_system_score_gemma":0.000027297152,"threshold_uncertainty_score":0.47048435},"labels":[],"label_agreement":null},{"id":"W4409718435","doi":"10.1139/cjce-2024-0298","title":"Advancing multi-objective optimization in resource management using the NSGA-III algorithm","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Civil Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Algorithm; Computer science; Multi-objective optimization; Optimization algorithm; Mathematics","score_opus":0.0055828110352116505,"score_gpt":0.20354567785081573,"score_spread":0.19796286681560407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409718435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008286269,0.0014574068,0.9955712,0.00006936777,0.0007657157,0.000115117306,0.0000023955645,0.000036833757,0.0011533416],"genre_scores_gemma":[0.44178638,0.00012602261,0.55756,0.00013385226,0.00018293955,0.000007912022,0.0000036966694,0.00006932782,0.00012982116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990857,0.000021113956,0.00036909975,0.00009452204,0.000107733096,0.0003218253],"domain_scores_gemma":[0.99952257,0.000052259755,0.000052166186,0.00013387208,0.0000783996,0.00016072633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922303,0.00014778246,0.00018405796,0.0007946936,0.00008244731,0.00006891515,0.00020741335,0.0000653046,0.000024173765],"category_scores_gemma":[0.000061140854,0.00014241043,0.0000590102,0.0007583601,0.00001710606,0.00015695575,0.000011801008,0.00032515914,4.846906e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012034866,0.0000029457283,0.000057409805,0.00002583669,0.00005371967,0.00004693673,0.00034306763,0.9968593,0.000011360248,0.000049406146,0.000098492776,0.0024503085],"study_design_scores_gemma":[0.0005188408,0.0000057646707,0.00019809937,0.00034268582,0.000027922642,0.000027749033,0.00079035887,0.99660003,0.000084816864,0.000008063583,0.0012655669,0.00013008618],"about_ca_topic_score_codex":0.00016362644,"about_ca_topic_score_gemma":0.0052151005,"teacher_disagreement_score":0.44095775,"about_ca_system_score_codex":0.0005198672,"about_ca_system_score_gemma":0.00013234117,"threshold_uncertainty_score":0.5807329},"labels":[],"label_agreement":null},{"id":"W4410049377","doi":"10.1145/3680256.3721304","title":"AIPerfLLM: 3rd International Workshop on Performance Optimization in the LLM world","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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","score_opus":0.010660472858040528,"score_gpt":0.23910643130961576,"score_spread":0.22844595845157523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410049377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010191701,0.00009492351,0.49407807,0.0037087621,0.0017111767,0.00018789805,0.0000014007286,0.0003585602,0.4896675],"genre_scores_gemma":[0.9296881,0.00021885941,0.05885821,0.0016704057,0.00012207066,0.000042146236,0.00003123892,0.0000155208,0.009353456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953806,0.000012541198,0.00013907121,0.00009363137,0.000115980736,0.00010070794],"domain_scores_gemma":[0.99974716,0.000074037176,0.000009328886,0.00013229472,0.000025249261,0.000011934858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013372132,0.00007796555,0.00005696312,0.00023076321,0.000036622267,0.00006138113,0.00019576408,0.000034688266,0.00023022416],"category_scores_gemma":[0.000027682645,0.000058808902,0.000019243997,0.0005476627,0.000010313689,0.000090019166,0.000012045618,0.00015196885,0.000029853054],"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.0000049778805,0.000020676525,0.00046435272,0.000004183458,0.000007063426,4.5644e-7,0.0000964195,0.9886706,9.883285e-7,0.0015453037,0.001335217,0.007849749],"study_design_scores_gemma":[0.00020663663,0.0000038715334,0.0008704103,0.000049690127,0.000002332017,4.160349e-7,0.00012223214,0.99608594,0.00009336055,0.00001487688,0.002485862,0.0000643488],"about_ca_topic_score_codex":0.0000018704906,"about_ca_topic_score_gemma":0.000012261562,"teacher_disagreement_score":0.9194964,"about_ca_system_score_codex":0.00004887689,"about_ca_system_score_gemma":0.000008530005,"threshold_uncertainty_score":0.2520793},"labels":[],"label_agreement":null},{"id":"W4410077660","doi":"10.1007/978-981-96-4445-2_18","title":"Semi-online Multiprocessor Scheduling with Known Largest Job Processing Time","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta","funders":"","keywords":"Computer science; Multiprocessing; Multiprocessor scheduling; Parallel computing; Scheduling (production processes); Rate-monotonic scheduling; Fair-share scheduling; Operating system; Mathematical optimization; Schedule","score_opus":0.008099450646318984,"score_gpt":0.22349032818865575,"score_spread":0.21539087754233677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410077660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030707923,0.0015285962,0.9943388,0.00014204509,0.0004934754,0.00022439387,0.000015572108,0.0005329452,0.0024171087],"genre_scores_gemma":[0.015985271,0.00006640523,0.98134685,0.00037433152,0.0005585652,0.0000081439675,0.000040554125,0.000086009764,0.0015338704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783725,0.000007321299,0.00037009103,0.00075502315,0.00049647415,0.00053385046],"domain_scores_gemma":[0.99892336,0.0001492774,0.0000979671,0.00041144007,0.0002981932,0.00011978239],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002789455,0.0004927877,0.00045043477,0.0006085671,0.00020848808,0.00029044127,0.00072218815,0.00031784317,0.00003267232],"category_scores_gemma":[0.00007450369,0.00043194924,0.000053853946,0.00067530735,0.00026242476,0.00024984463,0.00017169933,0.0008649551,0.000024514391],"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.000003889209,0.000009965665,0.000040483552,0.0001421126,0.000010097758,0.000015123068,0.0001320906,0.79334176,0.00003701685,0.00001915589,0.0000033221215,0.20624499],"study_design_scores_gemma":[0.0003160892,0.00003289189,0.000022284083,0.0016819651,0.00001914363,0.000022163145,3.8345138e-7,0.996091,0.00062812754,0.00040659515,0.00025297632,0.000526371],"about_ca_topic_score_codex":0.0000032456658,"about_ca_topic_score_gemma":0.000024869063,"teacher_disagreement_score":0.20571862,"about_ca_system_score_codex":0.00017733546,"about_ca_system_score_gemma":0.00037968985,"threshold_uncertainty_score":0.99981326},"labels":[],"label_agreement":null},{"id":"W4410455374","doi":"10.1007/978-3-031-92935-9_21","title":"Perpetual Scheduling with Explorable Uncertainty","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.011677459072668078,"score_gpt":0.21595272031829424,"score_spread":0.20427526124562617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410455374","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000111160494,0.00053462805,0.9904573,0.000099935314,0.0010492424,0.00015366006,0.0000048331854,0.00033698542,0.0072522885],"genre_scores_gemma":[0.029663049,0.000095323936,0.96856195,0.00036782734,0.00037991573,0.0000102655495,0.000016341737,0.000055543165,0.0008497977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983814,0.000006578316,0.00024675406,0.00056658784,0.0004155396,0.00038314887],"domain_scores_gemma":[0.99909604,0.00016752735,0.000045965186,0.000451993,0.0001460182,0.000092448994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023604585,0.00035492695,0.00032546156,0.00048463812,0.00013380949,0.00019515633,0.0005776646,0.00020866093,0.00004795559],"category_scores_gemma":[0.00003949809,0.00031031572,0.000049551716,0.000419973,0.00025463218,0.00016310498,0.000117200965,0.00064860313,0.000019755938],"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.0000031740085,0.000003246424,0.0000071082914,0.000033945613,0.000010287395,0.000013785972,0.00020024773,0.8909514,0.0000054794355,0.00048943266,0.0000060796738,0.10827584],"study_design_scores_gemma":[0.00018818436,0.00003888562,0.0000022779236,0.00055873784,0.000010072419,0.000011532194,9.435788e-7,0.99546874,0.0003496839,0.0025961543,0.00039139393,0.00038338962],"about_ca_topic_score_codex":0.0000073704437,"about_ca_topic_score_gemma":0.000029154326,"teacher_disagreement_score":0.107892446,"about_ca_system_score_codex":0.00021323233,"about_ca_system_score_gemma":0.00026823985,"threshold_uncertainty_score":0.9999349},"labels":[],"label_agreement":null},{"id":"W4410560313","doi":"10.18280/isi.300401","title":"Inventory Management System Using Reinforcement Learning: A Case Study","year":2025,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Russian Science Foundation","keywords":"Reinforcement learning; Reinforcement; Inventory management; Computer science; Artificial intelligence; Psychology; Operations management; Engineering; Social psychology","score_opus":0.014947510219697528,"score_gpt":0.23711792228771328,"score_spread":0.22217041206801574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410560313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37622488,0.000090427646,0.59497774,0.00000166457,0.00076208205,0.00066196796,9.0322624e-7,0.0009363749,0.026343992],"genre_scores_gemma":[0.9916836,0.0000068519307,0.007999089,0.000027210197,0.000025789432,0.00008198917,0.000016519725,0.0000136161,0.00014535614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988982,0.000041490905,0.0005659292,0.00009123651,0.00018600376,0.00021713832],"domain_scores_gemma":[0.9995309,0.000013740012,0.00009181783,0.00020059984,0.00011425969,0.000048691018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384634,0.00017013482,0.00016660408,0.00046678545,0.0002961171,0.00019959072,0.00010289195,0.000065902976,0.000009716307],"category_scores_gemma":[0.000022289745,0.00018340627,0.00004466559,0.00053560757,0.000024481295,0.0008041984,0.000055304838,0.00013458588,0.000033856235],"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.000005966355,0.000012404094,0.00090397446,0.0008438496,0.00013831834,0.000081550446,0.0050517735,0.9809444,0.0000021680758,0.000706187,0.00004535468,0.011264085],"study_design_scores_gemma":[0.000568203,0.00003203919,0.00006430363,0.00023236084,0.000063589105,0.00015601874,0.051091947,0.94700426,0.000049991373,0.000013052067,0.0005584385,0.00016582581],"about_ca_topic_score_codex":0.00008699372,"about_ca_topic_score_gemma":0.000003757324,"teacher_disagreement_score":0.6154587,"about_ca_system_score_codex":0.0006993847,"about_ca_system_score_gemma":0.00002377055,"threshold_uncertainty_score":0.74790907},"labels":[],"label_agreement":null},{"id":"W4410711632","doi":"10.1016/j.ejor.2025.05.047","title":"A new class of lower bounds for scheduling a batch processing machine to minimize makespan","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"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 Ottawa","funders":"","keywords":"Job shop scheduling; Computer science; Scheduling (production processes); Class (philosophy); Mathematical optimization; Flow shop scheduling; Parallel computing; Mathematics; Artificial intelligence; Embedded system; Routing (electronic design automation)","score_opus":0.043461280396937405,"score_gpt":0.3455401924123342,"score_spread":0.30207891201539677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410711632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01995024,0.00096084515,0.96942765,0.0027450377,0.00038156955,0.00019405286,0.000009223931,0.000022537935,0.006308836],"genre_scores_gemma":[0.43801525,0.000028648386,0.5590953,0.00011590709,0.00035946674,0.0000031350187,0.000005147265,0.00003447778,0.0023426155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843335,0.00015136474,0.0005422903,0.00012246903,0.0005223437,0.00022819151],"domain_scores_gemma":[0.9982051,0.00021233529,0.000050780283,0.00011441475,0.001251018,0.00016630725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002481738,0.00010219201,0.00018983352,0.0004974886,0.00014630803,0.00019523798,0.00031689004,0.000026800431,0.00008699204],"category_scores_gemma":[0.0009359394,0.00009254308,0.00007874634,0.0006150989,0.00003167315,0.00015636542,0.000047165122,0.00035281142,0.000012011355],"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.00045044348,0.000070701346,0.0001342171,0.00013956445,0.00010486375,0.000028418024,0.00061593205,0.9325445,0.008680298,0.0010629534,0.0074777016,0.048690382],"study_design_scores_gemma":[0.0028128498,0.00051905506,0.0011713598,0.00088887534,0.000028089216,0.000041712818,0.00042962318,0.9601859,0.005760815,0.00017551056,0.027744591,0.00024162751],"about_ca_topic_score_codex":0.0000018479006,"about_ca_topic_score_gemma":0.0000013719012,"teacher_disagreement_score":0.418065,"about_ca_system_score_codex":0.000078857774,"about_ca_system_score_gemma":0.0004944618,"threshold_uncertainty_score":0.37737972},"labels":[],"label_agreement":null},{"id":"W4410888925","doi":"10.5267/j.ijiec.2025.3.004","title":"Performance investigation of metaheuristics for the just-in-time single-machine under different time windows and setup restriction","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Metaheuristic; Computer science; Mathematical optimization; Mathematics; Algorithm","score_opus":0.02595319939458575,"score_gpt":0.24402573787954762,"score_spread":0.2180725384849619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410888925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50589967,0.00021621512,0.49113798,0.0006759811,0.0017911473,0.00018285634,0.000028115503,0.000038772985,0.000029240191],"genre_scores_gemma":[0.990244,0.00007262472,0.009353824,0.000021217065,0.00023803079,0.0000055582095,0.000024045932,0.000013258267,0.000027456763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916166,0.000016099028,0.00048118134,0.00006145981,0.00020066975,0.00007892398],"domain_scores_gemma":[0.9989238,0.00059583946,0.0001543075,0.000051888575,0.00024218485,0.00003199257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022399068,0.000099485675,0.0001628526,0.0003932647,0.00003174168,0.000049346785,0.00017017665,0.000070313035,0.0000046778187],"category_scores_gemma":[0.00027132465,0.0000836991,0.000050431667,0.00023219528,0.000023441138,0.00011226985,0.000019336143,0.00020940408,5.1394085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022905479,0.000017196431,0.00081187015,0.000010549289,0.0001523675,4.688878e-7,0.000058089077,0.99565995,0.0009123497,0.00017882456,0.00011517274,0.0020602706],"study_design_scores_gemma":[0.0010526002,0.000044389082,0.0042924574,0.00018216732,0.000062780695,0.000008297478,0.000018153149,0.99277616,0.0013319814,0.000094550574,0.000070972426,0.00006552103],"about_ca_topic_score_codex":0.0000029192563,"about_ca_topic_score_gemma":4.6678235e-7,"teacher_disagreement_score":0.4843443,"about_ca_system_score_codex":0.000108794404,"about_ca_system_score_gemma":0.00004077917,"threshold_uncertainty_score":0.34131503},"labels":[],"label_agreement":null},{"id":"W4410889165","doi":"10.5267/j.ijiec.2025.3.006","title":"A metaheuristic algorithm co-driven by Q-learning and a learning mechanism for the distributed blocking flowshop scheduling problem with preventive maintenance and sequence-dependent setup times","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Blocking (statistics); Q-learning; Metaheuristic; Scheduling (production processes); Computer science; Preventive maintenance; Sequence (biology); Job shop scheduling; Mathematical optimization; Mechanism (biology); Algorithm; Artificial intelligence; Engineering; Mathematics; Computer network; Reinforcement learning; Reliability engineering","score_opus":0.01123967558057845,"score_gpt":0.2516554425985393,"score_spread":0.24041576701796083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011413173,0.00029023073,0.98700565,0.00043317757,0.00046279727,0.00023367963,0.00005800976,0.00008806599,0.0000152007615],"genre_scores_gemma":[0.7545427,0.00016349686,0.24480985,0.000020474869,0.00023732736,0.00003488464,0.000060713755,0.000035536734,0.00009503319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990111,0.000039487546,0.00039656274,0.00014168711,0.0002455013,0.0001656631],"domain_scores_gemma":[0.9985441,0.0007189665,0.00016498425,0.00004018657,0.0004680318,0.000063726024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003638779,0.00016840736,0.00021280641,0.00020927767,0.00017870383,0.00021594774,0.00016421749,0.00008030639,0.000004376074],"category_scores_gemma":[0.00042830757,0.00013770502,0.000051887717,0.00016959687,0.00003469367,0.0001533095,0.00003306536,0.00065115135,2.990015e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002101785,0.000011473543,0.00007729577,0.000013304006,0.00060244714,0.0000072237895,0.00018838674,0.9881569,0.00028650532,0.0006129459,0.000048249483,0.009974214],"study_design_scores_gemma":[0.001448547,0.00007509471,0.000017890334,0.00041435275,0.00012628408,0.0000951157,0.00040246395,0.9962739,0.00040730782,0.00017153984,0.00043067263,0.00013685731],"about_ca_topic_score_codex":0.0000062927807,"about_ca_topic_score_gemma":6.1563924e-7,"teacher_disagreement_score":0.7431295,"about_ca_system_score_codex":0.00011337001,"about_ca_system_score_gemma":0.00007360024,"threshold_uncertainty_score":0.5615448},"labels":[],"label_agreement":null},{"id":"W4410889336","doi":"10.5267/j.ijiec.2025.4.004","title":"An adaptive local search for large-scale parallel machine scheduling in textile production with release dates and sequence-dependent setup time","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Sequence (biology); Scale (ratio); Computer science; Production (economics); Job shop scheduling; Time sequence; Textile; Mathematical optimization; Engineering; Algorithm; Mathematics; Materials science; Embedded system; Economics; Composite material; Chemistry; Physics","score_opus":0.02045996562868604,"score_gpt":0.2728342139177948,"score_spread":0.25237424828910876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410889336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628068,0.00009574393,0.8523645,0.00035532512,0.00061439193,0.00016711061,0.00004514982,0.000059866405,0.000017253711],"genre_scores_gemma":[0.8834751,0.000018943912,0.11611421,0.000012836656,0.00027178778,0.000010269649,0.00005364101,0.000019866498,0.000023348777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911183,0.000022821001,0.00036244246,0.00013555694,0.00022185149,0.00014549796],"domain_scores_gemma":[0.9993321,0.000119948214,0.00006111518,0.00006501875,0.00034798885,0.000073873394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032561115,0.00012382907,0.00016868685,0.00047791927,0.00004381475,0.0000803067,0.00016246823,0.00008034849,0.0000071369404],"category_scores_gemma":[0.000078380544,0.00012091665,0.000031539155,0.0002378937,0.000020628318,0.00030781917,0.000017385571,0.00034978165,0.0000010020434],"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.00013676105,0.000055789664,0.00026665945,0.000008060344,0.00010972832,0.000009179259,0.00020907368,0.9939441,0.0002673172,0.00026285986,0.000021605267,0.0047088712],"study_design_scores_gemma":[0.0017107207,0.00010966058,0.00012935865,0.00024207056,0.000021518003,0.000047494494,0.00029378754,0.9964558,0.00077471987,0.000060481183,0.000042257027,0.000112149246],"about_ca_topic_score_codex":0.000012210894,"about_ca_topic_score_gemma":0.000008697335,"teacher_disagreement_score":0.7371944,"about_ca_system_score_codex":0.00016470197,"about_ca_system_score_gemma":0.000112996575,"threshold_uncertainty_score":0.49308378},"labels":[],"label_agreement":null},{"id":"W4410890309","doi":"10.5267/j.ijiec.2025.4.008","title":"Multi-objective artificial bee colony algorithm for energy-efficient scheduling of unrelated parallel batch processing machines with flexible preventive maintenance","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Artificial bee colony algorithm; Preventive maintenance; Scheduling (production processes); Computer science; Mathematical optimization; Algorithm; Engineering; Reliability engineering; Artificial intelligence; Mathematics","score_opus":0.01704109568812054,"score_gpt":0.2678278917345583,"score_spread":0.2507867960464377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410890309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010056421,0.00020278314,0.98769385,0.00018438837,0.001509888,0.00018578168,0.000045113225,0.000091487505,0.000030291112],"genre_scores_gemma":[0.38003114,0.000011195003,0.6195443,0.000013382931,0.00028148503,0.000020359392,0.000022398768,0.000028081271,0.00004760529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986855,0.00002169074,0.0006900164,0.00013925653,0.00028624292,0.00017732341],"domain_scores_gemma":[0.9981058,0.00024386976,0.00027546418,0.000053741023,0.0012613427,0.000059773414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002549034,0.00018307281,0.0002913506,0.0005519877,0.00006630707,0.00007378333,0.00025490252,0.00012320657,0.000004231447],"category_scores_gemma":[0.00022198842,0.00017344514,0.00011841375,0.00050937844,0.000038146234,0.0001415413,0.000024147435,0.00030485148,3.3205995e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008304895,0.0001068684,0.00003200438,0.000014638699,0.00044529504,0.0000050440512,0.00020028435,0.9624062,0.000418099,0.00069942436,0.000042770094,0.035546333],"study_design_scores_gemma":[0.0021962477,0.00007899823,0.000084462816,0.00073146593,0.00007517631,0.000020946529,0.0001531066,0.9935849,0.0026977959,0.00015090051,0.00007404489,0.00015196562],"about_ca_topic_score_codex":0.000011847968,"about_ca_topic_score_gemma":0.0000021826886,"teacher_disagreement_score":0.3699747,"about_ca_system_score_codex":0.00019156116,"about_ca_system_score_gemma":0.00028649028,"threshold_uncertainty_score":0.70728874},"labels":[],"label_agreement":null},{"id":"W4410899693","doi":"10.5267/j.dsl.2025.5.001","title":"Multi-period supply chain optimization with contango and backwardation effects using an improved hybrid genetic algorithm","year":2025,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Genetic algorithm; Mathematical optimization; Period (music); Supply chain; Computer science; Algorithm; Mathematics; Business","score_opus":0.007766404146318961,"score_gpt":0.2434272556922142,"score_spread":0.23566085154589525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410899693","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33168653,0.00005331335,0.66756284,0.00008564438,0.00030053427,0.00019894658,0.000003078746,0.000104603285,0.000004505092],"genre_scores_gemma":[0.17960006,0.000015501942,0.8198033,0.00051145285,0.000027373884,0.00001195548,0.000008364488,0.00001726605,0.0000047383055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879086,0.000027438906,0.00021596135,0.00040506775,0.00029101613,0.00026963028],"domain_scores_gemma":[0.9993943,0.000071024326,0.000041446376,0.00027195658,0.0001014669,0.00011979993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033277916,0.00016791985,0.00015884926,0.00040827287,0.0002577356,0.00033133366,0.00021410371,0.00003917537,0.000007540848],"category_scores_gemma":[0.00009149244,0.0001500425,0.000018624609,0.0008481867,0.00018204509,0.00053964026,0.000038654372,0.00010024969,0.0000020754885],"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.000006789648,0.000012392582,0.00024843874,0.000008135323,0.0000055077267,0.000007670454,0.00012274939,0.90789074,0.022953913,0.0000013749099,0.000010174473,0.06873211],"study_design_scores_gemma":[0.0008664064,0.00003361586,0.0026469189,0.00006881417,0.000014197187,0.000024941033,0.00006834277,0.9890845,0.0069957846,0.000003937819,0.000010662721,0.00018187058],"about_ca_topic_score_codex":0.000012049068,"about_ca_topic_score_gemma":0.0000021404244,"teacher_disagreement_score":0.15224046,"about_ca_system_score_codex":0.00010491598,"about_ca_system_score_gemma":0.000045276716,"threshold_uncertainty_score":0.61185557},"labels":[],"label_agreement":null},{"id":"W4411086836","doi":"10.1109/rtas65571.2025.00039","title":"Scheduling Job Streams on Uniprocessors with Cold Start Delays","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Institute for Computing, Information and Cognitive Systems","keywords":"STREAMS; Computer science; Scheduling (production processes); Job shop scheduling; Real-time computing; Mathematical optimization; Embedded system; Mathematics; Operating system","score_opus":0.0073638259960166165,"score_gpt":0.21237056240980984,"score_spread":0.20500673641379322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411086836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34262073,0.00019748996,0.5376402,0.00030149898,0.00035756108,0.00018113125,0.0000051688066,0.0014266139,0.1172696],"genre_scores_gemma":[0.84833986,0.00003612134,0.14766593,0.00036601035,0.000039417624,0.000017647688,0.0000079480515,0.000031413885,0.003495633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941665,0.0000061476876,0.00012806537,0.00014970235,0.000118966535,0.00018047923],"domain_scores_gemma":[0.9996619,0.00004116014,0.000010996096,0.00016981504,0.00006024629,0.000055864104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006070797,0.00013225518,0.000114657065,0.00012233816,0.00006556126,0.000051815554,0.00009979454,0.00006297636,0.00007985922],"category_scores_gemma":[0.000015776028,0.0001092363,0.000020595193,0.00042258168,0.000017341585,0.00006853316,0.0000098432565,0.00014399714,0.00004422822],"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.000009996005,0.000014151421,0.0006749353,0.000027659447,0.00004232767,0.0000026079915,0.00004446666,0.99166125,0.000067068904,0.0054822727,0.00024230649,0.0017309785],"study_design_scores_gemma":[0.000570743,0.0000504873,0.00009871224,0.000113940085,0.000019704643,9.211405e-7,0.0003487432,0.9817605,0.015771016,0.00005716629,0.0010052903,0.00020276842],"about_ca_topic_score_codex":0.000010528514,"about_ca_topic_score_gemma":0.000022112608,"teacher_disagreement_score":0.5057191,"about_ca_system_score_codex":0.000043861146,"about_ca_system_score_gemma":0.000034165096,"threshold_uncertainty_score":0.44545272},"labels":[],"label_agreement":null},{"id":"W4411265403","doi":"10.1139/cjfas-2024-0248","title":"Indirect estimation of contact selectivity for gill nets using hierarchical models","year":2025,"lang":"en","type":"article","venue":"Canadian Journal of Fisheries and Aquatic Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Estimation; Statistics; Biology; Biological system; Ecology; Environmental science; Mathematics; Economics","score_opus":0.02689670549738369,"score_gpt":0.24671364800427528,"score_spread":0.2198169425068916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411265403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5849726,0.00045731917,0.41337886,0.000355858,0.0002768564,0.000058234,0.000003879771,0.0000049453643,0.00049141],"genre_scores_gemma":[0.9096307,0.000012068597,0.09029676,0.000035772347,0.000012974162,6.495335e-7,3.3781507e-7,0.000002542956,0.000008208997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995731,0.0000136555145,0.00018073284,0.000050642124,0.00006896629,0.00011288351],"domain_scores_gemma":[0.99966294,0.00012331559,0.000053299595,0.000027366677,0.000038346825,0.00009471711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030961254,0.000049947324,0.00013581014,0.00018554191,0.00013477894,0.000072569106,0.000074570125,0.00002920485,0.0000049378064],"category_scores_gemma":[0.00017443893,0.00004342837,0.000025852092,0.000256712,0.00011206446,0.00023742249,0.0000020621494,0.000057565845,2.2790104e-8],"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.000006169723,0.000004185424,0.003080332,0.00004916927,0.00003611772,0.0000014961711,0.0008965243,0.9542197,0.00012315612,0.001022823,0.00023105172,0.040329304],"study_design_scores_gemma":[0.00012626659,0.00005556096,0.000638857,0.0000776183,0.000013658512,0.0000076268725,0.00015268872,0.99360293,0.0004766228,0.0047489465,0.00005490857,0.00004428868],"about_ca_topic_score_codex":0.000415845,"about_ca_topic_score_gemma":0.00082924106,"teacher_disagreement_score":0.32465807,"about_ca_system_score_codex":0.000032611188,"about_ca_system_score_gemma":0.00046939214,"threshold_uncertainty_score":0.17709576},"labels":[],"label_agreement":null},{"id":"W4411342729","doi":"10.1016/j.procir.2025.02.198","title":"An Energy-Aware Flexible Job-Shop Scheduling Problem with Sequencing Flexibility and Sequence-Dependent Setup Times","year":2025,"lang":"en","type":"article","venue":"Procedia CIRP","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University","funders":"National Research Council Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Job shop scheduling; Job shop; Flexibility (engineering); Scheduling (production processes); Sequence (biology); Computer science; Industrial engineering; Flow shop scheduling; Engineering; Operations management; Management; Genetics; Economics; Biology; Schedule; Operating system","score_opus":0.016297108515241934,"score_gpt":0.25126716773767216,"score_spread":0.23497005922243022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411342729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24928553,0.0021328486,0.7292112,0.0003015002,0.00049926573,0.0006485525,0.000043099186,0.0037182574,0.014159741],"genre_scores_gemma":[0.8775367,0.000111138324,0.12140179,0.0001309218,0.00009962743,0.00008977406,0.000036369758,0.000051393297,0.00054226443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985602,0.00002743542,0.0003001078,0.0004926982,0.00023343287,0.00038611234],"domain_scores_gemma":[0.99922603,0.00004793952,0.00004619925,0.000336615,0.0001743207,0.00016891876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002620987,0.00028391188,0.00026441758,0.000181762,0.0001876524,0.000186834,0.00020484201,0.00015317777,0.00003967346],"category_scores_gemma":[0.00002873645,0.00026488106,0.00003068897,0.00046394547,0.000074104195,0.00041925872,0.00004247526,0.00025692265,0.0000068331883],"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.00004750282,0.0000484964,0.009641088,0.0008248223,0.00014186544,0.00001786932,0.0012692936,0.96252835,0.0035883419,0.0028924241,0.00008078844,0.01891916],"study_design_scores_gemma":[0.00051998784,0.00005996644,0.00010657705,0.00023639087,0.000047701473,0.000025962148,0.0007014029,0.98001564,0.016037043,0.0017615912,0.00008952561,0.00039820612],"about_ca_topic_score_codex":0.00005190024,"about_ca_topic_score_gemma":0.00004564579,"teacher_disagreement_score":0.6282512,"about_ca_system_score_codex":0.00018769897,"about_ca_system_score_gemma":0.00025054291,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W4411447390","doi":"10.1109/radar52380.2025.11031518","title":"Scheduling Optimization with Virtual Task for Radar Resource Management","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Resource management (computing); Processor scheduling; Distributed computing; Real-time computing; Resource (disambiguation); Operations management; Computer network; Engineering","score_opus":0.005012215401040393,"score_gpt":0.2055273715433169,"score_spread":0.20051515614227652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411447390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043296005,0.00006093071,0.9694468,0.00014804355,0.00014390888,0.00025657876,0.0000025619936,0.0005358834,0.028972356],"genre_scores_gemma":[0.017582145,0.000025661431,0.97776204,0.00021281466,0.000039762715,0.00005588134,0.00004566363,0.000027551087,0.004248504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946666,0.000005986781,0.00013833112,0.00015031788,0.00008573227,0.00015298995],"domain_scores_gemma":[0.9997323,0.00003411668,0.000012952888,0.00014864768,0.000038906164,0.000033068754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008844959,0.00010781889,0.00009498759,0.000132151,0.00008091618,0.0000528251,0.00008967646,0.000046189954,0.000030213174],"category_scores_gemma":[0.000008428817,0.0000971652,0.000025947977,0.00029068158,0.000013081928,0.00006503453,0.000015398611,0.000053834898,0.000004621816],"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.000017140484,0.000009025337,0.00000892215,0.00003829791,0.00006522218,6.4053904e-7,0.000029566765,0.9859699,0.0000071096747,0.006552924,0.0006174684,0.006683791],"study_design_scores_gemma":[0.00075948087,0.000029878032,0.0000073117358,0.000048076872,0.00003359811,5.952884e-7,0.00044050653,0.99384123,0.00045326285,0.000028192106,0.0042307773,0.0001270877],"about_ca_topic_score_codex":8.2344246e-7,"about_ca_topic_score_gemma":8.039059e-7,"teacher_disagreement_score":0.024723852,"about_ca_system_score_codex":0.000037321563,"about_ca_system_score_gemma":0.000008427177,"threshold_uncertainty_score":0.39622816},"labels":[],"label_agreement":null},{"id":"W4411447494","doi":"10.1109/radar52380.2025.11031721","title":"Minimum Cost First Algorithms for Multi-Function Phased Array Radar Scheduling","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Phased array; Computer science; Radar; Scheduling (production processes); Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.02862691806887531,"score_gpt":0.27666834721291916,"score_spread":0.24804142914404387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411447494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005276371,0.0003393667,0.9925626,0.00022355712,0.0020669315,0.0004883762,0.000016865544,0.00085521466,0.0029194623],"genre_scores_gemma":[0.031362947,0.00004524722,0.9654112,0.00025631336,0.000218682,0.00016890207,0.00007593819,0.00004703562,0.002413761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909675,0.000008596124,0.00027784135,0.00024008969,0.00009870777,0.0002779978],"domain_scores_gemma":[0.999477,0.000113512906,0.000025257688,0.0002003172,0.00010761831,0.0000762581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015522816,0.00018903585,0.00018800425,0.00017143972,0.00018166105,0.000075959295,0.000120992896,0.00013153446,0.000095853095],"category_scores_gemma":[0.00008881802,0.00019174535,0.0000971728,0.0003359589,0.00002185752,0.00012089964,0.000005441999,0.00012399361,0.000034241788],"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.00012282468,0.00028896375,0.00024490358,0.00041189647,0.00046177223,0.0000015107357,0.00034877396,0.90837395,0.019959867,0.001621428,0.00445534,0.06370878],"study_design_scores_gemma":[0.0022765058,0.000025458212,0.000039700408,0.000050426523,0.000046092886,7.696594e-7,0.00023096074,0.9420619,0.03196186,0.000045789697,0.023027055,0.00023350469],"about_ca_topic_score_codex":0.000008474222,"about_ca_topic_score_gemma":0.000015848585,"teacher_disagreement_score":0.06347527,"about_ca_system_score_codex":0.000077659635,"about_ca_system_score_gemma":0.000030874344,"threshold_uncertainty_score":0.78191483},"labels":[],"label_agreement":null},{"id":"W4411447639","doi":"10.1109/radar52380.2025.11031903","title":"A Starting-Point-Congestion Method for Over-Loaded Radar Task Scheduling","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Radar; Real-time computing; Task (project management); Distributed computing; Telecommunications; Mathematical optimization; Engineering; Mathematics","score_opus":0.010677025969369012,"score_gpt":0.2734942635533965,"score_spread":0.2628172375840275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411447639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038356252,0.00024106285,0.99061376,0.0005450927,0.0006344186,0.00024609253,0.000007133348,0.00080652616,0.003070307],"genre_scores_gemma":[0.025114756,0.0000122816255,0.97320825,0.0004939461,0.000091975126,0.00005186836,0.000022114731,0.000027770993,0.0009770434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922144,0.000021360442,0.00025732288,0.00019061918,0.00008463314,0.0002246221],"domain_scores_gemma":[0.99947923,0.00020130062,0.000025871379,0.00016840837,0.00007210388,0.00005305523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034528464,0.00013734517,0.0001674239,0.00014441118,0.00008548429,0.000064030355,0.000094375646,0.000102198086,0.00007604596],"category_scores_gemma":[0.00022567132,0.00013978577,0.00007395697,0.000282535,0.000009950581,0.000111309135,0.000016857783,0.0001192454,0.000011668901],"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.000026130114,0.000023272161,0.000052651092,0.00013596842,0.00010886877,7.846418e-7,0.00017140324,0.9394328,0.014411172,0.00792069,0.0026191277,0.035097122],"study_design_scores_gemma":[0.000701991,0.000014037966,0.000034819946,0.000045347788,0.000032586348,3.837144e-7,0.00014436198,0.9616294,0.03375472,0.0023715806,0.0011130732,0.00015768161],"about_ca_topic_score_codex":0.000014222267,"about_ca_topic_score_gemma":0.0000050284107,"teacher_disagreement_score":0.03493944,"about_ca_system_score_codex":0.000058790472,"about_ca_system_score_gemma":0.000029026263,"threshold_uncertainty_score":0.5700298},"labels":[],"label_agreement":null},{"id":"W4411618025","doi":"10.51847/ig1foaju1f","title":"10.51847/ig1FOaJU1F","year":2000,"lang":"en","type":"review","venue":"Time to knit","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Algorithm; Distributed computing; Parallel computing","score_opus":0.015612546716277884,"score_gpt":0.22331344308163711,"score_spread":0.20770089636535924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411618025","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.0252619e-9,0.54423326,0.000020598542,0.0000018535637,0.000010979992,0.0001522889,0.00002358161,0.0004378805,0.45511958],"genre_scores_gemma":[1.2070533e-10,0.39849916,0.0023184887,0.0000042042525,0.00018879646,0.00003810478,0.000101929436,0.000087649925,0.5987617],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99898654,0.000028535635,0.00034460353,0.00023046356,0.00014217259,0.00026765862],"domain_scores_gemma":[0.99936837,0.00005279732,0.000031394386,0.00036517752,0.00002208346,0.00016018018],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008211154,0.00034919716,0.000796986,0.00021186352,0.000034877037,0.00006004265,0.00028446902,0.00024811958,0.9613772],"category_scores_gemma":[0.00001942223,0.00033400176,0.00021550093,0.0004163627,0.00001015371,0.00003688636,0.000025134135,0.00024284885,0.98457265],"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":[5.651322e-7,0.0000052429323,6.147477e-11,0.0008213721,0.0000479377,0.0000037954628,0.0000021406238,0.007116619,2.063396e-9,1.5152688e-7,0.009528277,0.9824739],"study_design_scores_gemma":[0.000044881817,0.000013080213,2.7171052e-9,0.001504591,0.00014748336,0.000014453628,8.30706e-8,0.0043929033,4.247489e-8,1.11227486e-7,0.9935079,0.00037443035],"about_ca_topic_score_codex":8.736589e-7,"about_ca_topic_score_gemma":7.782451e-9,"teacher_disagreement_score":0.98397964,"about_ca_system_score_codex":0.000073385214,"about_ca_system_score_gemma":0.00004006804,"threshold_uncertainty_score":0.9999112},"labels":[],"label_agreement":null},{"id":"W4411656828","doi":"10.51847/jj6dn3dxlh","title":"10.51847/Jj6Dn3DxlH","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Computer science; Job scheduler; Batch processing; Parallel computing; Industrial engineering; Distributed computing; Mathematical optimization; Engineering; Programming language; Mathematics","score_opus":0.004801487791515721,"score_gpt":0.16653877776193768,"score_spread":0.16173728997042197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411656828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040144112,0.000057055004,0.00015154573,0.000054993583,0.0000065367467,0.000056533645,0.000004631802,0.00061171013,0.99865556],"genre_scores_gemma":[0.00019104635,6.998011e-7,0.008036687,0.000031823234,0.00010086129,0.000007523792,0.000010164242,0.000027399852,0.9915938],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958533,0.0000061505116,0.000092866125,0.00008837679,0.00007886447,0.0001484372],"domain_scores_gemma":[0.99973255,0.000013087155,0.000003890434,0.00014278856,0.000015821122,0.0000918546],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000043222968,0.00008144883,0.000078699326,0.000044658453,0.000028248482,0.000026667967,0.00008965875,0.000040053117,0.98549634],"category_scores_gemma":[0.000008652285,0.00008674401,0.000025007268,0.00016301447,0.000006323057,0.000044548728,0.0000059513145,0.00005575289,0.9742967],"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.0000038634494,0.0000055090322,4.877118e-8,0.0000019834204,0.0000076135243,0.0000014815341,0.000011264485,0.3424041,0.00001091349,6.3313865e-7,0.00808165,0.6494709],"study_design_scores_gemma":[0.00009206524,0.000014036326,0.000006603507,0.000005453123,0.000004019267,0.000002664747,3.9478218e-7,0.17866664,0.000045780034,5.702379e-7,0.8210594,0.00010237455],"about_ca_topic_score_codex":0.0000016828424,"about_ca_topic_score_gemma":1.4132537e-8,"teacher_disagreement_score":0.81297773,"about_ca_system_score_codex":0.00001721842,"about_ca_system_score_gemma":0.00000432197,"threshold_uncertainty_score":0.3537318},"labels":[],"label_agreement":null},{"id":"W4411712131","doi":"10.2139/ssrn.5327301","title":"Integrated Flexible Production Scheduling and Vehicle Routing with Mlor Constraints: A Hybrid Metaheuristic Approach","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Guelph","funders":"","keywords":"Metaheuristic; Vehicle routing problem; Scheduling (production processes); Computer science; Mathematical optimization; Production (economics); Routing (electronic design automation); Computer network; Mathematics; Algorithm; Economics","score_opus":0.010135462601072204,"score_gpt":0.21920302702548222,"score_spread":0.20906756442441002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411712131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06998615,0.0056220195,0.92175126,0.00016962177,0.00068432145,0.0003455519,0.000014265188,0.0005010417,0.0009257504],"genre_scores_gemma":[0.88443387,0.0030400793,0.111293,0.000018756115,0.0003840828,0.000033485194,0.0000671945,0.00006727192,0.0006622529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974312,0.00009059306,0.00045102887,0.0004513816,0.00024591558,0.0013298899],"domain_scores_gemma":[0.99921,0.00003845506,0.00017017587,0.00024259044,0.00023568636,0.00010306605],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0013471842,0.00039791322,0.00046032478,0.0003116052,0.00022871245,0.000249434,0.0002311021,0.00017100481,0.0000066743687],"category_scores_gemma":[0.00018656437,0.00035256357,0.000084137304,0.00031406802,0.000106531596,0.00013554106,0.000078728524,0.0049957926,0.0000024596009],"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.00005533912,0.000041206004,0.0001803153,0.00018891456,0.0008337242,0.00000427246,0.0001914505,0.9469879,0.000049194336,0.0030965111,0.0000091382135,0.048361983],"study_design_scores_gemma":[0.0006828442,0.00008716673,0.000019633539,0.0005469565,0.00031262598,0.0009766887,0.0020267623,0.98861307,0.0005164463,0.005681266,0.000029676961,0.00050687505],"about_ca_topic_score_codex":0.000022515596,"about_ca_topic_score_gemma":0.000016013175,"teacher_disagreement_score":0.8144477,"about_ca_system_score_codex":0.0007832626,"about_ca_system_score_gemma":0.0018005748,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W4412217418","doi":"","title":"Information/Throughput Tradeoff Mitigation in Automated Sorting","year":2024,"lang":"en","type":"article","venue":"VBN Forskningsportal (Aalborg Universitet)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Throughput; Sorting; Computer science; Operating system; Algorithm","score_opus":0.003995661165030395,"score_gpt":0.1944137197135127,"score_spread":0.19041805854848232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412217418","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9267839,0.00048623027,0.030626582,0.0002035067,0.001341192,0.00032600478,0.000035956356,0.008079202,0.032117415],"genre_scores_gemma":[0.99076873,0.000037646274,0.008504859,0.000051525643,0.00006131026,0.0000032396858,0.00027019766,0.00003229214,0.0002702172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905753,0.000009173364,0.0003373384,0.00013315715,0.00018956752,0.00027322996],"domain_scores_gemma":[0.9996823,0.000035015753,0.000042429005,0.00011560728,0.000042329226,0.00008229897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012735155,0.00017306671,0.00015017073,0.0005060325,0.00007236093,0.0001224281,0.000121696496,0.00013279571,0.00015828693],"category_scores_gemma":[0.000018781557,0.00019896691,0.00007008042,0.0010090193,0.000030831565,0.0014829253,0.000018656645,0.00023426578,0.00020555663],"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.000015755064,0.000029759904,0.0044164644,0.00038560719,0.00014112578,0.00021475609,0.019008769,0.9460812,0.00031433936,0.011089208,0.0065359105,0.01176707],"study_design_scores_gemma":[0.00033377818,0.000014788155,0.0013532006,0.00015711886,0.000020417581,0.000015067499,0.002813993,0.9877145,0.0005412653,0.000084098785,0.0066897804,0.00026198034],"about_ca_topic_score_codex":0.000052167936,"about_ca_topic_score_gemma":0.000014599571,"teacher_disagreement_score":0.063984804,"about_ca_system_score_codex":0.0001665726,"about_ca_system_score_gemma":0.00005135967,"threshold_uncertainty_score":0.8113635},"labels":[],"label_agreement":null},{"id":"W4412403959","doi":"10.1109/access.2025.3588822","title":"Optimal Scheduling of Electrolytic Hydrogen-Based Steelmaking Facility Participating in Capacity Auction Market","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Independent Electricity System Operator","keywords":"Steelmaking; Computer science; Hydrogen; Scheduling (production processes); Materials science; Chemistry; Metallurgy; Operations management; Engineering","score_opus":0.025785374180495917,"score_gpt":0.2819361661204021,"score_spread":0.2561507919399062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412403959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72262025,0.000067132685,0.27620956,0.000017256432,0.00024195458,0.00010775422,0.0000065498903,0.00014271123,0.0005868086],"genre_scores_gemma":[0.9856726,0.0000049445634,0.014153058,0.000029435607,0.000026061365,0.00007570391,0.000004209353,0.000011540247,0.000022452508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988999,0.00005859376,0.00041245634,0.00020050036,0.00014521605,0.00028333731],"domain_scores_gemma":[0.9995121,0.00011842263,0.00006197963,0.0002018841,0.00006698611,0.000038672206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041421474,0.000142148,0.00022793612,0.00023972143,0.0000538949,0.00005146156,0.00020087612,0.00009888072,0.00006420357],"category_scores_gemma":[0.00013622372,0.00016282123,0.000055645814,0.00069944107,0.00003277534,0.00021627611,0.000016755916,0.00023202783,0.000002148656],"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.000017864764,0.000029358735,0.013329728,0.00014518954,0.000022710203,0.0000011167147,0.00007040077,0.9830552,0.0018072684,0.000015299673,0.00000910229,0.0014968007],"study_design_scores_gemma":[0.0003970174,0.000008289922,0.002883019,0.000095202195,0.000015885978,3.892596e-7,0.000026163993,0.8626536,0.13376851,0.000022867498,0.000012958145,0.00011610033],"about_ca_topic_score_codex":0.000060564438,"about_ca_topic_score_gemma":0.000035083147,"teacher_disagreement_score":0.2630523,"about_ca_system_score_codex":0.00012341734,"about_ca_system_score_gemma":0.000052214244,"threshold_uncertainty_score":0.66396576},"labels":[],"label_agreement":null},{"id":"W4412450897","doi":"10.1016/j.rcim.2025.103091","title":"Sustainable scheduling for job shops with joint maintenance, machine speed scaling, and uncertain processing times","year":2025,"lang":"en","type":"article","venue":"Robotics and Computer-Integrated Manufacturing","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":"Université Laval; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Computer science; Scheduling (production processes); Joint (building); Scaling; Operations management; Industrial engineering; Engineering; Mathematics; Civil engineering","score_opus":0.007786568539783634,"score_gpt":0.20968973987044393,"score_spread":0.2019031713306603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412450897","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056783587,0.00088644377,0.9407641,0.00020937459,0.00015771663,0.00034247144,0.000005030459,0.00037403294,0.00047718702],"genre_scores_gemma":[0.5357395,0.00012684411,0.4629782,0.00010844656,0.00007789774,0.000011961582,0.000024178747,0.00004910862,0.00088384823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.000014881948,0.0002969211,0.00035382702,0.00010150083,0.0004577267],"domain_scores_gemma":[0.99948174,0.000058231184,0.000054414457,0.00014714447,0.00014906537,0.000109410794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018910975,0.00031797445,0.00035250816,0.00023657999,0.0002903646,0.00040377388,0.000105829866,0.00010895106,0.0000040857376],"category_scores_gemma":[0.0000147001165,0.00025898073,0.000040637322,0.00019633578,0.00005870759,0.00014653613,0.000066785746,0.00026396796,4.7556188e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028966368,0.000013957918,0.00011736393,0.0005593341,0.00008117855,0.000014467501,0.00014696179,0.96632767,0.00002964035,0.0017376085,0.00006659883,0.030876257],"study_design_scores_gemma":[0.0009390955,0.000055049517,0.00033447618,0.00058748876,0.000057183734,0.000022136026,0.0005227095,0.9931379,0.0031733783,0.00056252466,0.00028960287,0.0003184425],"about_ca_topic_score_codex":0.00005136781,"about_ca_topic_score_gemma":0.000009774028,"teacher_disagreement_score":0.47895592,"about_ca_system_score_codex":0.000079038524,"about_ca_system_score_gemma":0.000053714535,"threshold_uncertainty_score":0.99998623},"labels":[],"label_agreement":null},{"id":"W4412452562","doi":"10.1016/j.cie.2025.111349","title":"Performance evaluation of an unreliable two-machine system with slowdown policy","year":2025,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université de Moncton","funders":"","keywords":"Slowdown; Economic slowdown; Computer science; Reliability engineering; Economics; Engineering; Macroeconomics; Economic growth","score_opus":0.016680209073258716,"score_gpt":0.23506535468324058,"score_spread":0.21838514560998187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412452562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5799301,0.00018692164,0.41458175,0.000027442487,0.0023645975,0.0004069731,0.000008069123,0.00085150765,0.0016426245],"genre_scores_gemma":[0.9780779,0.000004225412,0.02147771,0.000006855477,0.00034380626,0.000019845203,0.000025068257,0.000029094532,0.000015524922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.00002489011,0.00028204313,0.00016081957,0.00027258953,0.00021132833],"domain_scores_gemma":[0.99945956,0.00004552381,0.000039137813,0.00025079236,0.00013379489,0.0000711615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004311415,0.00017776224,0.00023142027,0.00037107817,0.000044245844,0.00003855137,0.00018066999,0.00010146124,0.000004317467],"category_scores_gemma":[0.000040129657,0.00017591797,0.000030620904,0.00079416693,0.000013310499,0.00017625923,0.000024211497,0.00021502789,0.0000021248045],"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.000011153269,0.000009421156,0.000094814444,0.000063342624,0.00005838831,6.248589e-7,0.000050232426,0.9676392,0.0001335485,0.00032145713,0.000021693826,0.031596098],"study_design_scores_gemma":[0.0019310769,0.000049769693,0.0001434063,0.0004619568,0.000051731455,0.000005052408,0.000028820528,0.9943692,0.0027001833,6.4595463e-7,0.00009688633,0.0001612677],"about_ca_topic_score_codex":0.0000559919,"about_ca_topic_score_gemma":0.0000012667304,"teacher_disagreement_score":0.39814776,"about_ca_system_score_codex":0.00025843378,"about_ca_system_score_gemma":0.0001355013,"threshold_uncertainty_score":0.7173727},"labels":[],"label_agreement":null},{"id":"W4412548904","doi":"10.1016/j.cor.2025.107204","title":"Augmentation search for integer programming over a polyhedron","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"HEC Montréal","keywords":"Polyhedron; Integer programming; Computer science; Integer (computer science); Mathematical optimization; Combinatorics; Mathematics; Algorithm; Programming language","score_opus":0.04432721795173738,"score_gpt":0.38515818390302503,"score_spread":0.34083096595128765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412548904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02168146,0.00020577069,0.97539383,0.00060225074,0.00048567596,0.0007380102,0.000006073243,0.00022416166,0.000662766],"genre_scores_gemma":[0.5365736,0.00005233936,0.4600157,0.00012538063,0.00022542088,0.0005656217,0.00017710181,0.000041003557,0.0022238404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989756,0.00006851536,0.00018925384,0.00020316482,0.00023795574,0.00032553027],"domain_scores_gemma":[0.9992278,0.00017142219,0.0000030273025,0.00019983944,0.00033393726,0.0000639575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055241125,0.00009154166,0.0000973166,0.0004746824,0.00037107998,0.0003717064,0.00019553573,0.00006542267,0.000035245255],"category_scores_gemma":[0.000046325993,0.0000952581,0.000043069205,0.00078802573,0.000056572873,0.00016637858,0.00005813952,0.00024460387,0.0000256848],"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.00001067304,0.000041430074,0.00008534531,0.000064833235,0.00004602655,7.524133e-7,0.00063619565,0.9037544,0.0006195013,0.005073855,0.003497554,0.0861694],"study_design_scores_gemma":[0.00047243966,0.00003887517,0.00012928636,0.00005385,0.00000416322,6.840326e-7,0.0002951134,0.99220246,0.0035321317,0.00003089674,0.0031518156,0.00008826469],"about_ca_topic_score_codex":0.00004301534,"about_ca_topic_score_gemma":0.000027080185,"teacher_disagreement_score":0.5153781,"about_ca_system_score_codex":0.00018186953,"about_ca_system_score_gemma":0.00010605389,"threshold_uncertainty_score":0.38845128},"labels":[],"label_agreement":null},{"id":"W4412733500","doi":"10.1080/23302674.2025.2536110","title":"Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Systems Science Operations & Logistics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Technician; Scheduling (production processes); Mathematical optimization; Parallel computing; Algorithm; Engineering; Mathematics","score_opus":0.006197027617089738,"score_gpt":0.2355389656096742,"score_spread":0.22934193799258445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412733500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042888084,0.00042133068,0.9932933,0.0001962659,0.00061992905,0.00019779133,0.000018839284,0.000055199012,0.0009085247],"genre_scores_gemma":[0.56283385,0.0001304514,0.43674082,0.000035269084,0.00012580084,0.0000075684266,0.000004037452,0.000010764046,0.00011145695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986754,0.000027392673,0.00048139668,0.00018718063,0.00046017682,0.00016843289],"domain_scores_gemma":[0.99837285,0.00007982196,0.00013792283,0.00009599415,0.0012305005,0.00008289597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006103445,0.00014447489,0.00020479354,0.00048854254,0.0002518586,0.00069556973,0.00027390732,0.00006525447,0.000004340937],"category_scores_gemma":[0.00024529797,0.00011997552,0.000020173127,0.0005948267,0.00024874322,0.00062911777,0.000052393658,0.00021055456,0.0000013422742],"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.0000073502824,0.000016318036,0.00032381873,0.000008412767,0.00005873984,0.00000817782,0.0002093509,0.995131,0.00060829695,0.0014350683,0.000010533431,0.002182894],"study_design_scores_gemma":[0.0004911047,0.000050126095,0.00015492683,0.0005150105,0.000027992945,0.00017287565,0.00054497755,0.99756104,0.00028198923,0.000041344567,0.000028986144,0.00012965765],"about_ca_topic_score_codex":0.000019960351,"about_ca_topic_score_gemma":0.000005209521,"teacher_disagreement_score":0.55854505,"about_ca_system_score_codex":0.0002226147,"about_ca_system_score_gemma":0.0002525329,"threshold_uncertainty_score":0.67073953},"labels":[],"label_agreement":null},{"id":"W4412877155","doi":"10.1145/3711896.3737433","title":"RL4CO: An Extensive Reinforcement Learning for Combinatorial Optimization Benchmark","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Mila - Quebec Artificial Intelligence Institute","funders":"","keywords":"Reinforcement learning; Benchmark (surveying); Computer science; Artificial intelligence; Combinatorial optimization; Machine learning; Algorithm; Geography; Cartography","score_opus":0.007863841065880686,"score_gpt":0.23988732963779247,"score_spread":0.2320234885719118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412877155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00057598035,0.000049611404,0.9834452,0.000050541614,0.0015713233,0.00023114608,5.212664e-7,0.00043449693,0.0136411805],"genre_scores_gemma":[0.44571045,0.00009235454,0.5492816,0.00028192726,0.00029259053,0.0001237877,0.00037336914,0.000047016154,0.0037968843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945784,0.000011619239,0.00017628835,0.0001272745,0.000077306955,0.00014965018],"domain_scores_gemma":[0.9996117,0.000051874205,0.000018697068,0.00011345207,0.00015971415,0.000044598193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010639374,0.0000993283,0.000106899235,0.000073926945,0.00011219404,0.000057842506,0.00007152927,0.00007353684,0.00013103479],"category_scores_gemma":[0.00008871088,0.00010412141,0.00003442935,0.00017492367,0.000009765093,0.00012605074,0.000012347348,0.00008099688,0.0000038530443],"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.000010515599,0.0000080478,0.000020340536,0.00001767155,0.000021813486,1.7062341e-7,0.000065410815,0.99066854,0.000026528065,0.0071209203,0.00063306745,0.0014070016],"study_design_scores_gemma":[0.00074318977,0.000052185496,0.000012717386,0.00001455066,0.000015971691,2.5199608e-7,0.0001789271,0.99631006,0.00096478174,0.00022913265,0.0013604428,0.00011780066],"about_ca_topic_score_codex":0.0000041591284,"about_ca_topic_score_gemma":5.1113574e-7,"teacher_disagreement_score":0.4451345,"about_ca_system_score_codex":0.000048178536,"about_ca_system_score_gemma":0.0000195942,"threshold_uncertainty_score":0.4245948},"labels":[],"label_agreement":null},{"id":"W4412931633","doi":"10.1007/s10951-025-00850-3","title":"Multiprocessor scheduling with testing: improved online algorithms and numerical experiments","year":2025,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiprocessing; Computer science; Parallel computing; Algorithm; Scheduling (production processes); Mathematical optimization; Mathematics","score_opus":0.019713341702457202,"score_gpt":0.26978984311707327,"score_spread":0.25007650141461607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412931633","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40453786,0.002953853,0.59151095,0.0001614989,0.00045007883,0.00009970879,0.0000026774405,0.00013538045,0.00014798106],"genre_scores_gemma":[0.42042196,0.00005116245,0.57922345,0.00007650326,0.0001703693,0.000002760485,0.0000016615477,0.000028201343,0.000023904815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862546,0.000021411206,0.00061726087,0.00019424813,0.00024583464,0.0002958114],"domain_scores_gemma":[0.9988983,0.00016103257,0.00019912678,0.0001370071,0.0004245661,0.00017992446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028196123,0.00025051011,0.00040183833,0.0002978241,0.00012321003,0.00012436496,0.00019936435,0.00011902589,0.0000076068736],"category_scores_gemma":[0.00034404136,0.00020761778,0.000059914357,0.00061564514,0.000053839853,0.00031159824,0.00004033763,0.00054305216,0.0000013225629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008539126,0.00017689244,0.0041808626,0.00016593985,0.00031161276,0.00004220348,0.00044328667,0.93585396,0.015611431,0.000032257838,0.000008657175,0.043087516],"study_design_scores_gemma":[0.0017374298,0.00013503584,0.0004810745,0.00050587236,0.00007296627,0.000109593864,0.0010657685,0.98499316,0.01056025,0.0000370378,0.00006432173,0.00023746218],"about_ca_topic_score_codex":0.0000042767697,"about_ca_topic_score_gemma":4.628016e-7,"teacher_disagreement_score":0.04913924,"about_ca_system_score_codex":0.000073664174,"about_ca_system_score_gemma":0.000111968046,"threshold_uncertainty_score":0.8466407},"labels":[],"label_agreement":null},{"id":"W4412931765","doi":"10.1080/00207543.2025.2536195","title":"Machine learning-based dynamic production planning and control in unreliable manufacturing systems with supply disruptions","year":2025,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Production planning; Production (economics); Control (management); Manufacturing engineering; Production control; Computer science; Engineering; Industrial engineering; Operations management; Artificial intelligence; Economics; Microeconomics","score_opus":0.01678848100153231,"score_gpt":0.3226913126457712,"score_spread":0.3059028316442389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412931765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74931616,0.0056906175,0.2280601,0.009428934,0.0062942733,0.000653714,0.00001060523,0.00015685706,0.0003887376],"genre_scores_gemma":[0.9967764,0.00021897977,0.0021059203,0.000008599842,0.00020300344,0.000017391985,0.000009036514,0.00001518458,0.0006454887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998711,0.00011718228,0.00032465413,0.00016202095,0.0005164285,0.00016875255],"domain_scores_gemma":[0.9990572,0.000103537306,0.000072591385,0.00008456585,0.0006374364,0.00004469777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012223459,0.00009171368,0.00013848256,0.0011396294,0.00009679505,0.00013386493,0.00014466155,0.000046525423,0.00001039087],"category_scores_gemma":[0.00034053033,0.00007989472,0.000021799253,0.0003140866,0.000060372746,0.0002486455,0.000014527282,0.00067541347,0.0000019743518],"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.00016406532,0.000040107418,0.011259768,0.000049997085,0.00007819507,0.000019253157,0.00009699488,0.9859663,0.0008041215,0.00002570811,0.00010645458,0.0013890183],"study_design_scores_gemma":[0.0012793251,0.0000964059,0.00786197,0.0008440016,0.000014780061,0.00015592294,0.0005786457,0.98338974,0.0040031653,0.00007270939,0.0015896502,0.000113712806],"about_ca_topic_score_codex":0.000035732694,"about_ca_topic_score_gemma":0.000013852566,"teacher_disagreement_score":0.24746023,"about_ca_system_score_codex":0.00026869494,"about_ca_system_score_gemma":0.00008118176,"threshold_uncertainty_score":0.32580122},"labels":[],"label_agreement":null},{"id":"W4412969065","doi":"10.1007/979-8-8688-1513-3_9","title":"Static Pods and Scheduling","year":2025,"lang":"en","type":"book-chapter","venue":"Certification study companion series","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brampton Civic Hospital","funders":"","keywords":"Computer science","score_opus":0.029730992688629308,"score_gpt":0.2505859948746023,"score_spread":0.220855002185973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412969065","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012776014,0.009747322,0.22354591,0.0022698473,0.007534179,0.005408564,0.0002961618,0.0073351497,0.73108685],"genre_scores_gemma":[0.33982375,0.0023114542,0.06549353,0.00021530436,0.00046505596,0.00020268808,0.0006539282,0.0003329137,0.59050137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988088,0.00001978384,0.00047310843,0.00034175825,0.00021169303,0.00014483568],"domain_scores_gemma":[0.99920255,0.00006815317,0.00009335048,0.0003962882,0.000166872,0.00007281633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014077888,0.0003207064,0.0003768543,0.00024425695,0.0001667835,0.00015593172,0.00013971607,0.00015036343,0.00012745606],"category_scores_gemma":[0.000025443309,0.00034919483,0.000044977347,0.00008404195,0.00006493429,0.00013810342,0.00005167149,0.0002681312,0.00006173048],"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.00025433925,0.00070555677,0.0022332424,0.0033517433,0.0039880606,0.000048283422,0.023304934,0.36960855,0.000676101,0.35127378,0.02154688,0.22300854],"study_design_scores_gemma":[0.0030765957,0.00047640072,0.0053328415,0.0014325308,0.0012575497,0.000047894366,0.011174979,0.6491453,0.0008854037,0.012360337,0.31024244,0.0045677223],"about_ca_topic_score_codex":0.0000025856948,"about_ca_topic_score_gemma":0.000005183089,"teacher_disagreement_score":0.33891344,"about_ca_system_score_codex":0.000060981725,"about_ca_system_score_gemma":0.000032180596,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W4413122925","doi":"10.1016/j.dam.2025.08.004","title":"An efficient polynomial-time approximation scheme for parallel multi-stage open shops","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"Shaanxi Provincial Science and Technology Department; Key Science and Technology Program of Shaanxi Province; National Social Science Fund of China; Key Research and Development Program of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Georgia Southern University","keywords":"Mathematics; Scheme (mathematics); Polynomial-time approximation scheme; Time complexity; Polynomial; Combinatorics","score_opus":0.026400667419957287,"score_gpt":0.29886612374858745,"score_spread":0.2724654563286302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413122925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062308507,0.000028704952,0.9819026,0.000039616883,0.000109601315,0.001429776,0.000050537725,0.00042207667,0.009786258],"genre_scores_gemma":[0.021106916,0.000004314444,0.9771755,0.000061519684,0.00003594231,0.000476489,0.00020631256,0.000059267153,0.00087377586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989839,0.0000066006305,0.00038213193,0.00024391404,0.00012162249,0.00026181954],"domain_scores_gemma":[0.99928266,0.000077919845,0.000068869165,0.00044535665,0.00004636253,0.00007881134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000290883,0.00021813727,0.00029807052,0.00010202822,0.00013140752,0.00022140979,0.00044657956,0.00011740699,0.00004565865],"category_scores_gemma":[0.00003348388,0.00021255187,0.0000579241,0.00021170595,0.000029055578,0.00008534854,0.00007260552,0.00009787236,0.000050254595],"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.000025175921,0.00020060173,0.0000021782414,0.00047898927,0.000083328734,3.1489665e-7,0.0010718881,0.94740117,0.008742313,0.039924838,0.00058120786,0.001487989],"study_design_scores_gemma":[0.001139358,0.000010626953,0.0000063755974,0.00004070998,0.000031690153,2.9489937e-7,0.00061331573,0.99290705,0.004278075,0.0004113712,0.00031540805,0.00024575018],"about_ca_topic_score_codex":0.000001709559,"about_ca_topic_score_gemma":0.0000010445536,"teacher_disagreement_score":0.045505848,"about_ca_system_score_codex":0.00005549887,"about_ca_system_score_gemma":0.000028838953,"threshold_uncertainty_score":0.8667613},"labels":[],"label_agreement":null},{"id":"W4413208739","doi":"10.1080/00207543.2025.2543492","title":"Integrated optimisation of production scheduling, maintenance, and quality control under non-homogeneous poisson process failures with multiple assignable causes","year":2025,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Canada Foundation for Innovation","keywords":"Scheduling (production processes); Reliability engineering; Homogeneous; Computer science; Production (economics); Poisson process; Quality (philosophy); Process (computing); Engineering; Poisson distribution; Operations management; Mathematics; Statistics; Economics","score_opus":0.0353198594695502,"score_gpt":0.34891218823037073,"score_spread":0.31359232876082055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413208739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.839629,0.0003797956,0.15470932,0.0032757814,0.0014555291,0.00035284445,0.00000865731,0.000051603645,0.00013746101],"genre_scores_gemma":[0.97787744,0.00021929233,0.02098039,0.000016590277,0.00031064812,0.000019520123,0.0000092218,0.000019283461,0.0005476084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99802876,0.00014261914,0.00057048677,0.00023391303,0.0008281063,0.00019612606],"domain_scores_gemma":[0.9943456,0.00013967181,0.00022199846,0.00014537522,0.005084052,0.000063318264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017193055,0.00013588894,0.0002394718,0.00076573825,0.00009791375,0.00009887101,0.00022867812,0.00008542979,0.000020488646],"category_scores_gemma":[0.0016503532,0.00011010804,0.000042738593,0.0005918205,0.00017249672,0.0003920721,0.000020345808,0.0004673597,0.0000013331296],"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.0006581556,0.0001378908,0.00610573,0.00013083748,0.00039413857,0.0000051364464,0.00036231903,0.96385235,0.023031037,0.00020172507,0.00034364103,0.0047770445],"study_design_scores_gemma":[0.006634241,0.000634553,0.021439418,0.0025462613,0.00013898089,0.00039115737,0.011425491,0.31371284,0.6388429,0.0019769256,0.0016239189,0.0006333264],"about_ca_topic_score_codex":0.00008239576,"about_ca_topic_score_gemma":0.00005378224,"teacher_disagreement_score":0.6501395,"about_ca_system_score_codex":0.00021212966,"about_ca_system_score_gemma":0.00026026895,"threshold_uncertainty_score":0.44900757},"labels":[],"label_agreement":null},{"id":"W4413417484","doi":"10.3390/math13162605","title":"Integrated Process Planning and Scheduling Framework Using an Optimized Rule-Mining Approach for Smart Manufacturing","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cape Breton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Process (computing); Smart manufacturing; Process mining; Manufacturing engineering; Industrial engineering; Work in process; Engineering; Operations management; Business process management; Operating system; Business process","score_opus":0.034269467026361154,"score_gpt":0.29286730117285137,"score_spread":0.25859783414649024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413417484","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2739308,0.00017682483,0.72473735,0.0000055824503,0.00012979265,0.00022503009,0.0000037798168,0.0003604285,0.00043044487],"genre_scores_gemma":[0.12712322,0.0000047454864,0.8726458,0.000027968525,0.000048292386,0.000043316864,0.000024961639,0.00005186149,0.000029853469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990405,0.000013136087,0.00034224463,0.00022427052,0.00010742522,0.0002724287],"domain_scores_gemma":[0.9994163,0.00018376151,0.000060629092,0.00019649784,0.00006919657,0.00007362751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002965735,0.00022618558,0.00031556637,0.00018265923,0.00018770728,0.00020664767,0.00012373345,0.0001760736,0.0000052703867],"category_scores_gemma":[0.0001911473,0.00022194622,0.000040055023,0.00020452555,0.00002879111,0.00017055144,0.000027215448,0.0002238992,4.1813186e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008127566,0.00003727111,0.000058915262,0.0007783875,0.000059753173,9.352769e-7,0.0025961264,0.99510443,0.000067907764,0.00024908484,0.0000024182586,0.0010366463],"study_design_scores_gemma":[0.0004224853,0.0000091592565,0.000005633578,0.0005618004,0.00006305366,0.000008583202,0.004834179,0.9872431,0.00445171,0.0021638377,0.0000058380037,0.00023058259],"about_ca_topic_score_codex":0.000001043193,"about_ca_topic_score_gemma":7.802754e-8,"teacher_disagreement_score":0.14790845,"about_ca_system_score_codex":0.000043251144,"about_ca_system_score_gemma":0.000027313832,"threshold_uncertainty_score":0.90507036},"labels":[],"label_agreement":null},{"id":"W4413438078","doi":"10.62051/m633as12","title":"Towards Efficient LLMs: Analyzing Computational Bottlenecks and Optimization Strategies","year":2025,"lang":"en","type":"article","venue":"Transactions on Computer Science and Intelligent Systems Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Arts Foundation; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.03569556815364451,"score_gpt":0.3257574598475096,"score_spread":0.2900618916938651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413438078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005529046,0.00042695546,0.99215233,0.00017572478,0.0005729255,0.00022983312,0.0000040542004,0.00012683516,0.0007822643],"genre_scores_gemma":[0.93275136,0.0002663613,0.06678386,0.000020674393,0.000037039295,0.000027193777,0.000002934184,0.000009362948,0.000101212834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843234,0.000060537954,0.00023797294,0.00031170264,0.000679341,0.00027809467],"domain_scores_gemma":[0.9989063,0.00012668959,0.000014018026,0.00014904675,0.0006939547,0.000109950655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013619234,0.00011300174,0.00013101367,0.00092055363,0.0005859312,0.0007742818,0.0001825654,0.000054233362,0.000010679265],"category_scores_gemma":[0.000015738693,0.0001051006,0.000019900566,0.0014613536,0.0003263415,0.00021064133,0.000013337692,0.0002395159,0.000006123936],"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.0000035214516,0.00002344507,0.000004652809,0.000052719555,0.000015406074,6.1520916e-7,0.0003190599,0.96356153,0.000015570155,0.0017293536,0.000033318585,0.034240823],"study_design_scores_gemma":[0.00010553783,0.000051592702,0.00005847535,0.00011612019,0.000004270468,0.0000052520486,0.00061723834,0.9983567,0.00041283175,0.0000630566,0.000115140225,0.00009376455],"about_ca_topic_score_codex":0.0000415401,"about_ca_topic_score_gemma":0.0000015789826,"teacher_disagreement_score":0.9272223,"about_ca_system_score_codex":0.00013824187,"about_ca_system_score_gemma":0.00019437929,"threshold_uncertainty_score":0.7466417},"labels":[],"label_agreement":null},{"id":"W4413740044","doi":"10.1016/j.jmsy.2025.08.004","title":"Optimisation method for semiconductor wafer manufacturing system scheduling: Reinforcement learning with decision graph guiding","year":2025,"lang":"en","type":"article","venue":"Journal of Manufacturing Systems","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Key Research and Development Program of China","keywords":"Reinforcement learning; Wafer; Scheduling (production processes); Computer science; Graph; Semiconductor device fabrication; Reinforcement; Industrial engineering; Engineering; Mathematical optimization; Manufacturing engineering; Artificial intelligence; Theoretical computer science; Mathematics; Structural engineering; Electrical engineering","score_opus":0.017914928203591394,"score_gpt":0.2568373050433833,"score_spread":0.23892237683979192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413740044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17442438,0.0005668089,0.8217193,0.000031632477,0.0022589343,0.00038669445,0.0000013747692,0.00021702945,0.00039386857],"genre_scores_gemma":[0.71879417,0.000048530223,0.28044325,0.000013353406,0.00032554995,0.000018655468,0.0000057858165,0.000056012974,0.00029471057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976553,0.00008595062,0.001162254,0.00024644696,0.00046976213,0.00038032723],"domain_scores_gemma":[0.99840724,0.00043352143,0.0005118393,0.00025100718,0.00025819833,0.00013817994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015205331,0.00034039124,0.0006043434,0.000741124,0.00026038176,0.00027383535,0.00029842166,0.00018456134,0.0000067304745],"category_scores_gemma":[0.00009110048,0.00027601703,0.00020361012,0.00015490729,0.000015024263,0.0003703395,0.000033451262,0.00036649403,0.0000030174383],"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.00010567594,0.000007938426,0.0000361804,0.0008088072,0.00032288276,0.000009521409,0.00021430266,0.9938451,0.00095929,0.00015582448,0.00010326561,0.0034311886],"study_design_scores_gemma":[0.0017820775,0.00012747786,0.000043827167,0.0028316348,0.00018475758,0.00018794088,0.002273596,0.7469524,0.24333107,0.000034080385,0.0019096663,0.00034143857],"about_ca_topic_score_codex":0.000010872129,"about_ca_topic_score_gemma":8.4217265e-7,"teacher_disagreement_score":0.54436976,"about_ca_system_score_codex":0.00050279126,"about_ca_system_score_gemma":0.00007709918,"threshold_uncertainty_score":0.9999692},"labels":[],"label_agreement":null},{"id":"W4413840524","doi":"10.1016/j.compchemeng.2025.109363","title":"PC-Gym: Benchmark environments for process control problems","year":2025,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","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":"Engineering and Physical Sciences Research Council; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Royal Academy of Engineering; BASF","keywords":"Benchmark (surveying); Process (computing); Control (management); Process control; Computer science; Industrial engineering; Process engineering; Engineering; Manufacturing engineering; Artificial intelligence; Operating system; Geography; Cartography","score_opus":0.003540421362369518,"score_gpt":0.18752663237735473,"score_spread":0.18398621101498522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413840524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013168861,0.00032808902,0.98481476,0.000066437206,0.0006918817,0.0003004431,0.000007250884,0.00046124205,0.00016104634],"genre_scores_gemma":[0.89177394,0.000012664164,0.107587494,0.00012823546,0.00017435217,0.00017605489,0.000047084577,0.00005174641,0.000048409507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916077,0.0000024619899,0.00023171915,0.00021500608,0.000096100564,0.0002939748],"domain_scores_gemma":[0.999627,0.00010081414,0.00001675043,0.00015207869,0.000017458757,0.00008590801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006111495,0.0001951016,0.00021151657,0.000084185835,0.000029547919,0.000038864484,0.0002016052,0.00010567525,0.000007858912],"category_scores_gemma":[0.000033053755,0.0002179586,0.000073015486,0.00017287674,0.000015103932,0.00007001582,0.000021563852,0.00015206407,0.0000044387084],"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.0000035899443,0.00001570527,0.000022000504,0.00022107804,0.00006852229,5.586368e-7,0.000050688934,0.9858458,0.010544094,0.00010256223,0.00029999614,0.0028254066],"study_design_scores_gemma":[0.0008586499,0.000007446838,0.000017186981,0.00011393696,0.000021909034,0.0000013771587,0.000004145033,0.9718476,0.025013896,0.000055847227,0.0018505345,0.00020749602],"about_ca_topic_score_codex":2.7938654e-7,"about_ca_topic_score_gemma":1.46740895e-8,"teacher_disagreement_score":0.87860507,"about_ca_system_score_codex":0.0000791614,"about_ca_system_score_gemma":0.000009288109,"threshold_uncertainty_score":0.8888094},"labels":[],"label_agreement":null},{"id":"W4413872257","doi":"10.5267/j.ijiec.2025.6.009","title":"Performance analysis of an intelligent manufacturing cell with multi-resource collaboration","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Resource (disambiguation); Manufacturing engineering; Computer science; Knowledge management; Engineering; Business; Systems engineering","score_opus":0.014061507123340422,"score_gpt":0.24891725397546083,"score_spread":0.2348557468521204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872257","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5394661,0.000033982702,0.4596224,0.000043169366,0.00065035414,0.000049215956,0.000011589751,0.00004076971,0.0000824269],"genre_scores_gemma":[0.941951,0.000015395814,0.057831157,0.000010903394,0.00011887428,0.000002140782,0.000037121,0.000012638826,0.000020768139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904,0.00001575776,0.0005027583,0.000079263926,0.00027259672,0.00008961167],"domain_scores_gemma":[0.9991785,0.000096629934,0.0001588887,0.0000838241,0.0004261744,0.000055932094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016141363,0.00011408614,0.0002149577,0.0011831905,0.000026838125,0.00006365815,0.00024919046,0.00007072575,0.000012343196],"category_scores_gemma":[0.000040863233,0.00010969232,0.00007342853,0.00076448167,0.000014979105,0.00022607314,0.00001449782,0.00021612276,5.8554093e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027753413,0.0000529914,0.00047096596,0.000008240979,0.0008410167,0.000003725652,0.00022111752,0.9921305,0.00017804855,0.000032953056,0.000019956105,0.0060127284],"study_design_scores_gemma":[0.0007725693,0.000052982155,0.0012271506,0.00010228942,0.00024398135,0.000004869568,0.00019713186,0.9788666,0.018204734,0.0000013807926,0.0002335531,0.000092803915],"about_ca_topic_score_codex":0.000004332617,"about_ca_topic_score_gemma":0.0000032184587,"teacher_disagreement_score":0.40248492,"about_ca_system_score_codex":0.00012591876,"about_ca_system_score_gemma":0.00007913735,"threshold_uncertainty_score":0.44731233},"labels":[],"label_agreement":null},{"id":"W4413872281","doi":"10.5267/j.ijiec.2025.7.002","title":"Recall cost-time tradeoffs for remanufacturing shop lot streaming scheduling problem with non mixed production using an improved non-dominated sorting genetic algorithm","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Remanufacturing; Sorting; Computer science; Scheduling (production processes); Genetic algorithm; Mathematical optimization; Production (economics); Job shop scheduling; Flow shop scheduling; Sorting algorithm; Algorithm; Industrial engineering; Real-time computing; Operations research; Engineering; Manufacturing engineering; Mathematics; Computer network; Machine learning; Economics; Microeconomics","score_opus":0.018330680925257855,"score_gpt":0.2561280281782371,"score_spread":0.23779734725297924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24530315,0.00003090254,0.75182116,0.00009718678,0.0021596,0.00044538552,0.000011949491,0.00011686827,0.0000137704765],"genre_scores_gemma":[0.42405298,0.0000059406666,0.5748458,0.0000080410455,0.00095063716,0.000020755388,0.000041577638,0.000056140838,0.000018136885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981685,0.000025782678,0.0009336025,0.00025313292,0.0003195051,0.0002994556],"domain_scores_gemma":[0.99844474,0.00017250833,0.00033319453,0.0001274958,0.0007961186,0.00012596007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042253462,0.00028469725,0.00035451323,0.0007778053,0.00013062578,0.00022302773,0.00032552754,0.00017580135,0.000004248701],"category_scores_gemma":[0.00019708482,0.00029437494,0.000117110794,0.00041752783,0.000024455245,0.00048117523,0.000027452203,0.0005088154,6.6654263e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055461267,0.00006234865,0.000029641194,0.000027043812,0.00036639842,0.000009221479,0.0001996937,0.9411838,0.009580269,0.0000048105944,0.000011362058,0.048469927],"study_design_scores_gemma":[0.002267105,0.000115339084,0.00009251448,0.0007883529,0.00012650435,0.000103898434,0.00019100467,0.9773011,0.018684266,0.00002672051,0.000029918934,0.00027326122],"about_ca_topic_score_codex":0.000013134015,"about_ca_topic_score_gemma":0.0000021395385,"teacher_disagreement_score":0.17874983,"about_ca_system_score_codex":0.00041323077,"about_ca_system_score_gemma":0.00022372669,"threshold_uncertainty_score":0.9999508},"labels":[],"label_agreement":null},{"id":"W4413872308","doi":"10.5267/j.ijiec.2025.6.006","title":"The distributed flow shop problem under carbon quota constraints","year":2025,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flow (mathematics); Mathematical optimization; Carbon fibers; Computer science; Environmental science; Business; Mathematics; Algorithm","score_opus":0.01557982499816315,"score_gpt":0.24722355988247627,"score_spread":0.2316437348843131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413872308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011642547,0.0002559758,0.9768594,0.0022537617,0.007929402,0.00012013663,0.00003709951,0.00015047428,0.0007511874],"genre_scores_gemma":[0.97329164,0.000056340064,0.025755797,0.000038097565,0.0007449919,0.000006744226,0.000033549855,0.000022665434,0.00005018688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.00002018539,0.00052941724,0.00007262964,0.00028861657,0.00014789021],"domain_scores_gemma":[0.99892825,0.00037234277,0.000094296585,0.000079652345,0.00046233798,0.0000631159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002471728,0.00012586017,0.0001419534,0.00023747847,0.00006703763,0.00017002408,0.000362579,0.000094698225,0.000009828584],"category_scores_gemma":[0.00025176033,0.00010719991,0.00008822384,0.0003212041,0.000045623376,0.00008776021,0.000028035896,0.00041816058,0.0000017837576],"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.000009314821,0.000014121321,0.00006934347,0.0000022741553,0.00031950133,0.0000065663635,0.00003590711,0.9847737,0.00004628041,0.0022906582,0.00070563564,0.011726675],"study_design_scores_gemma":[0.00093133317,0.000013765437,0.00011850447,0.00015278609,0.000029357627,0.000038427403,0.0001089611,0.99594015,0.00021844283,0.00036204714,0.001985895,0.00010030999],"about_ca_topic_score_codex":0.0000030214062,"about_ca_topic_score_gemma":0.0000013803234,"teacher_disagreement_score":0.96164906,"about_ca_system_score_codex":0.00019896447,"about_ca_system_score_gemma":0.00014936463,"threshold_uncertainty_score":0.4371485},"labels":[],"label_agreement":null},{"id":"W4413929950","doi":"10.1016/j.mfglet.2025.06.011","title":"Balancing trade-offs between first three moments of completion times for one-stage production","year":2025,"lang":"en","type":"article","venue":"Manufacturing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Production (economics); Stage (stratigraphy); Completion (oil and gas wells); Computer science; Operations management; Economics; Engineering; Geology; Mechanical engineering; Microeconomics","score_opus":0.017027209396965264,"score_gpt":0.22366253912961565,"score_spread":0.2066353297326504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413929950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.616372,0.00002867789,0.37993094,0.0023072574,0.00060880487,0.00032572405,0.000019971078,0.00026026013,0.00014634343],"genre_scores_gemma":[0.9792743,0.0000053370054,0.020198043,0.000121253375,0.00017328956,0.000031143343,0.000063308624,0.000025441024,0.00010789071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992689,0.0000067030355,0.00023871998,0.00017888095,0.00012091754,0.00018586668],"domain_scores_gemma":[0.99968594,0.00005804967,0.000046977442,0.00017272976,0.000010416602,0.00002590481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012280654,0.00012833498,0.00019078872,0.00015683252,0.00009354473,0.000025106363,0.00010671251,0.000050826093,0.000015150134],"category_scores_gemma":[0.000018233455,0.00014419899,0.000060317674,0.000082346996,0.00002170344,0.00008551865,0.000015543588,0.00009685476,0.0000030360734],"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.0000111441595,0.000016523294,0.0040132925,0.0006224924,0.00014854738,3.9621077e-7,0.00019040176,0.9853734,0.004130376,0.000023118007,0.0014550006,0.0040153284],"study_design_scores_gemma":[0.0011754788,0.000032181222,0.10243383,0.00041008816,0.00012479855,7.1921266e-7,0.00006883754,0.13441427,0.75583225,0.00014777739,0.004905503,0.0004542666],"about_ca_topic_score_codex":0.000011791313,"about_ca_topic_score_gemma":0.000005802145,"teacher_disagreement_score":0.8509591,"about_ca_system_score_codex":0.00008486973,"about_ca_system_score_gemma":0.000004257762,"threshold_uncertainty_score":0.5880264},"labels":[],"label_agreement":null},{"id":"W4413940000","doi":"10.1007/s10479-025-06804-4","title":"Randomized algorithms for fully online multiprocessor scheduling with testing","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta","funders":"","keywords":"Computer science; Theory of computation; Multiprocessing; Parallel computing; Multiprocessor scheduling; Randomized algorithm; Scheduling (production processes); Algorithm; Fair-share scheduling; Rate-monotonic scheduling; Mathematical optimization; Mathematics; Operating system; Schedule","score_opus":0.20645734329322205,"score_gpt":0.4393213788118706,"score_spread":0.23286403551864857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413940000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11435734,0.0013552092,0.8782099,0.0021913971,0.00013058697,0.0014716254,0.000072307965,0.00023635036,0.0019753126],"genre_scores_gemma":[0.28405216,0.0001570973,0.71438634,0.000076532095,0.000091956084,0.0003542235,0.000073633455,0.000029860887,0.0007781807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.000090513146,0.0003864219,0.00020020756,0.00028529658,0.00032682568],"domain_scores_gemma":[0.99610597,0.001035129,0.000016040098,0.0002142417,0.0025628991,0.00006571213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016294967,0.00012193939,0.00032190094,0.00045689684,0.0002854395,0.000112175556,0.00020496325,0.00007558438,0.000018074012],"category_scores_gemma":[0.002943673,0.00010083848,0.000062113766,0.001184045,0.00015177066,0.00016311373,0.00003000311,0.00024904025,0.000003730257],"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.00088756555,0.000074242496,0.000019448742,0.00013402749,0.00010779547,6.6317233e-7,0.00016177872,0.98661804,0.00049325736,0.0009408902,0.00009852636,0.010463743],"study_design_scores_gemma":[0.016190907,0.000054408934,0.00001889716,0.00018111132,0.000012102397,9.697978e-7,0.00034120513,0.97260827,0.010275047,0.00011848954,0.000095334566,0.00010323701],"about_ca_topic_score_codex":0.000057202436,"about_ca_topic_score_gemma":0.000040419385,"teacher_disagreement_score":0.16969483,"about_ca_system_score_codex":0.000015186476,"about_ca_system_score_gemma":0.00020635176,"threshold_uncertainty_score":0.41120738},"labels":[],"label_agreement":null},{"id":"W4413958434","doi":"10.5267/j.jpm.2025.6.004","title":"Makespan optimization in recycling-integrated flow shop scheduling using a modified NEH heuristic with industrial case study","year":2025,"lang":"en","type":"article","venue":"Journal of Project Management","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Flow shop scheduling; Heuristic; Scheduling (production processes); Mathematical optimization; Computer science; Mathematics; Schedule","score_opus":0.042887919103189426,"score_gpt":0.2913558559380324,"score_spread":0.248467936834843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413958434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28968063,0.00009563923,0.70850635,0.000024427776,0.00055302156,0.0006201949,0.000001109507,0.00006431805,0.00045428803],"genre_scores_gemma":[0.6343022,0.000039713574,0.36541727,0.000016437272,0.000096480995,0.000013336092,0.000002864142,0.000029447663,0.00008228987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855673,0.000107367894,0.00068997586,0.0001712189,0.00025864466,0.00021604834],"domain_scores_gemma":[0.99942434,0.000042425243,0.00016740512,0.00016518252,0.00015630704,0.000044323097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006892496,0.00020027149,0.0003187438,0.0011209915,0.000076471006,0.0001408414,0.00014530937,0.00008069301,0.000010511541],"category_scores_gemma":[0.00007135555,0.00017141954,0.000049983024,0.0013831606,0.000013971514,0.00017590054,0.000034221677,0.00043821725,4.1911747e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013709144,0.0001788149,0.0006551318,0.000053519027,0.0002555864,0.00222181,0.0005559193,0.9896532,0.000003328634,0.00000888385,0.000029072107,0.006247635],"study_design_scores_gemma":[0.0033962585,0.00014922862,0.00001346697,0.00042539582,0.00020835767,0.00022009626,0.010952498,0.98442805,0.000017713533,0.0000052752457,0.000022406059,0.00016124357],"about_ca_topic_score_codex":0.000071751194,"about_ca_topic_score_gemma":0.000036424994,"teacher_disagreement_score":0.34462154,"about_ca_system_score_codex":0.00025698525,"about_ca_system_score_gemma":0.00010592407,"threshold_uncertainty_score":0.6990286},"labels":[],"label_agreement":null},{"id":"W4413997978","doi":"10.18280/jesa.580709","title":"Multi-Objective Identical Parallel Flow Shop Scheduling Using NSGA-II and MOPSO with a Novel Load Balancing Procedure","year":2025,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Flow shop scheduling; Scheduling (production processes); Parallel computing; Mathematical optimization; Job shop scheduling; Mathematics; Schedule; Operating system","score_opus":0.014510920746223793,"score_gpt":0.2512650097766114,"score_spread":0.23675408903038764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413997978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32899377,0.0015308979,0.6683483,0.000046474215,0.00032425433,0.00018105785,0.0000064425376,0.0003696224,0.00019917457],"genre_scores_gemma":[0.41258764,0.00008553698,0.5869386,0.000046569654,0.00011418206,0.0000071004624,0.0000016126369,0.00005719587,0.00016153281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981353,0.00006621205,0.0006069317,0.00030967852,0.00040442293,0.00047740786],"domain_scores_gemma":[0.9990188,0.000093120725,0.00014512849,0.00018194511,0.00035017153,0.00021084295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047493583,0.0003584207,0.00044523075,0.00028806872,0.00061876397,0.0004518838,0.00019434371,0.00014203913,0.000018878247],"category_scores_gemma":[0.00038120415,0.00030613813,0.0000842029,0.0006071189,0.00010374154,0.00046446995,0.00009222136,0.00058603036,0.000004963182],"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.000027981438,0.0000670416,0.0026931611,0.00033352288,0.00031050516,0.00006818881,0.001732643,0.98442876,0.0024020136,0.00007860749,0.000031243737,0.007826353],"study_design_scores_gemma":[0.0016020972,0.00005662045,0.02982418,0.0015051968,0.00013052742,0.0012558926,0.0005964971,0.964399,0.00018771594,0.0000989433,0.000011416689,0.00033193198],"about_ca_topic_score_codex":0.000011334351,"about_ca_topic_score_gemma":0.00001836654,"teacher_disagreement_score":0.08359389,"about_ca_system_score_codex":0.00041262954,"about_ca_system_score_gemma":0.00027174564,"threshold_uncertainty_score":0.9999391},"labels":[],"label_agreement":null},{"id":"W4414014094","doi":"10.3390/electronics14173543","title":"Network-Aware Smart Scheduling for Semi-Automated Ceramic Production via Improved Discrete Hippopotamus Optimization","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Hippopotamus; Scheduling (production processes); Computer science; Ceramic; Materials science; Engineering; Operations management; Composite material; Ecology; Biology","score_opus":0.005218383800611357,"score_gpt":0.2252878440981211,"score_spread":0.22006946029750976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414014094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004365808,0.003389112,0.98712033,0.0003287659,0.0015364896,0.0006107796,0.0000052862174,0.0025123698,0.00013107118],"genre_scores_gemma":[0.6777721,0.0013643596,0.31690177,0.00030018415,0.0009017773,0.00039735617,0.0009058489,0.0002167727,0.001239805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986842,0.000026334736,0.0003247654,0.0003199262,0.0000969009,0.0005478316],"domain_scores_gemma":[0.9994224,0.000041553776,0.000060416634,0.00026451613,0.00016017687,0.00005099334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022132997,0.00022837147,0.0002136003,0.00012068082,0.00021683704,0.00007667474,0.0001367764,0.00017756209,0.000010478076],"category_scores_gemma":[0.00007397474,0.00025529737,0.00007334417,0.000630763,0.000018867177,0.00016114443,0.00001991384,0.00025779358,0.000004153345],"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.000022004946,0.000011578116,0.000023328319,0.000069622336,0.00006994471,1.6008322e-7,0.000030739135,0.99479055,0.0008415053,0.000105781895,0.0004661548,0.003568627],"study_design_scores_gemma":[0.0004674439,0.000043592485,0.000010268598,0.000052687115,0.00006110436,0.0000031197337,0.00001881777,0.99406284,0.0036912689,0.0003213913,0.0010137833,0.000253699],"about_ca_topic_score_codex":0.0000022422655,"about_ca_topic_score_gemma":0.000014361286,"teacher_disagreement_score":0.6734063,"about_ca_system_score_codex":0.00029479736,"about_ca_system_score_gemma":0.000104472274,"threshold_uncertainty_score":0.9999899},"labels":[],"label_agreement":null},{"id":"W4414197168","doi":"10.1109/lcn65610.2025.11146365","title":"P3PO: Parallel Processing For Priority Ordering In Programmable Schedulers","year":2025,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada)","funders":"","keywords":"Scalability; Scheduling (production processes); Network packet; Priority queue; Weighted round robin; Queue; Implementation; Round-robin scheduling; Packet processing; Priority inheritance","score_opus":0.011493440338739211,"score_gpt":0.25990231799791896,"score_spread":0.24840887765917974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414197168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011534714,0.00049451017,0.97822905,0.0001668685,0.0002292676,0.00039630083,6.582032e-7,0.00064422295,0.008304386],"genre_scores_gemma":[0.21123314,0.000025358306,0.78761506,0.000057441,0.000028276108,0.00015513874,0.000006807671,0.000020115707,0.00085865136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936587,0.0000047926524,0.00018353437,0.00014550639,0.00005594438,0.00024433516],"domain_scores_gemma":[0.99979174,0.000023479395,0.000011727659,0.00009517951,0.000045956738,0.00003188849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014509307,0.00010198287,0.00012526414,0.00012370474,0.000054363594,0.00007716476,0.00008857393,0.00007072134,0.0000111009],"category_scores_gemma":[0.00004615554,0.000104335246,0.000029268558,0.00041519414,0.000012926533,0.00012192212,0.000014037766,0.00010091322,0.0000026444718],"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.000010548945,0.000029750414,0.0017790223,0.00030954965,0.000015210236,6.892057e-7,0.00012227197,0.9126878,0.000061380815,0.0016004865,0.00010099263,0.083282314],"study_design_scores_gemma":[0.0006286989,0.0000066646508,0.00021122633,0.000070664966,0.0000052475125,3.534335e-7,0.00021748475,0.9959217,0.0005626843,0.00034173415,0.00190805,0.00012550346],"about_ca_topic_score_codex":0.000009640692,"about_ca_topic_score_gemma":0.000034935052,"teacher_disagreement_score":0.19969842,"about_ca_system_score_codex":0.000057253314,"about_ca_system_score_gemma":0.000048472444,"threshold_uncertainty_score":0.42546678},"labels":[],"label_agreement":null},{"id":"W4414413940","doi":"10.1016/j.cor.2025.107284","title":"A novel mathematical model for the scheduling of a zero inventory production: an application of process scheduling in fog computing","year":2025,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Toronto Metropolitan University; Systems, Applications & Products in Data Processing (Canada)","funders":"Ryerson University; Canada Research Chairs; Toronto Metropolitan University","keywords":"Scheduling (production processes); Outsourcing; Linear programming; Job shop scheduling; Integer programming; Process (computing); Production (economics)","score_opus":0.06993947810367439,"score_gpt":0.37732169583345293,"score_spread":0.30738221772977853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414413940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08250351,0.00019246347,0.91598815,0.00027517468,0.00009336543,0.0008435653,0.0000031068282,0.00005786551,0.000042827538],"genre_scores_gemma":[0.582398,0.0000069912076,0.41739032,0.000008155261,0.000037513455,0.00012051166,0.000009582247,0.000012076672,0.000016860457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878263,0.000043608838,0.00046761325,0.00023316607,0.0002592652,0.00021370167],"domain_scores_gemma":[0.9987051,0.00022607279,0.00002553159,0.00033703775,0.0006680505,0.00003824763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011780384,0.00009927803,0.00018665392,0.00038711022,0.00021681617,0.000058642807,0.00034234452,0.0000723447,0.000001109319],"category_scores_gemma":[0.000281146,0.00009009234,0.000040899173,0.0010258442,0.00011930461,0.00016104971,0.000059375914,0.0002729599,7.4894143e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090354315,0.00012959294,0.000051961306,0.00032504695,0.000026746182,3.782259e-8,0.001871431,0.98304915,0.002752364,0.0073730187,0.0000083165705,0.004403286],"study_design_scores_gemma":[0.00033635087,0.000017812425,0.000027437813,0.00020828337,0.000009513613,0.0000011167942,0.00064077106,0.9947472,0.0031664344,0.00077015726,0.0000021301573,0.00007279608],"about_ca_topic_score_codex":0.000013477035,"about_ca_topic_score_gemma":0.000020666059,"teacher_disagreement_score":0.4998945,"about_ca_system_score_codex":0.00006366209,"about_ca_system_score_gemma":0.00017949841,"threshold_uncertainty_score":0.3673859},"labels":[],"label_agreement":null},{"id":"W4414499167","doi":"10.1109/tccn.2025.3614383","title":"Multi-Agent Transformer-Based Workload Allocation and Worker Selection in Distributed Coded Machine Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workload; Exploit; Redundancy (engineering); Computation; Enhanced Data Rates for GSM Evolution; Selection (genetic algorithm); Task (project management); Edge device","score_opus":0.02460330585162574,"score_gpt":0.2661781087591832,"score_spread":0.24157480290755745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414499167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009457256,0.004102997,0.9854101,0.00021825076,0.00013370352,0.0002823505,0.00001858309,0.00021518915,0.00016156492],"genre_scores_gemma":[0.9748979,0.010106316,0.014638249,0.00008125855,0.0000106071375,0.00014167634,0.000059087244,0.000020324167,0.00004457068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991753,0.00012648774,0.00026195435,0.00018497153,0.00006638824,0.00018487163],"domain_scores_gemma":[0.99933183,0.00037833583,0.00003188835,0.0001269227,0.00007966009,0.000051356114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020399253,0.00016450054,0.0001582306,0.00026440716,0.0004490982,0.00006760632,0.000087924,0.00010540882,0.000008429066],"category_scores_gemma":[0.0000062915988,0.00018741598,0.00003615169,0.0007810575,0.0000827055,0.00009177393,0.0000018812212,0.00052857405,0.0000016324383],"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.00006020285,0.00017169064,0.0015251221,0.000031369556,0.00008567273,4.1046894e-7,0.00032069546,0.51072335,0.0003178016,0.000010522137,0.0000023726152,0.48675075],"study_design_scores_gemma":[0.0012338739,0.000028768553,0.0010959799,0.0006486472,0.000063646694,0.0000014201402,0.0002356316,0.995297,0.0008720466,0.000010622471,0.00034465504,0.00016768365],"about_ca_topic_score_codex":0.0000314332,"about_ca_topic_score_gemma":0.0006245263,"teacher_disagreement_score":0.97077185,"about_ca_system_score_codex":0.000076603734,"about_ca_system_score_gemma":0.000022667802,"threshold_uncertainty_score":0.7642602},"labels":[],"label_agreement":null},{"id":"W4414558576","doi":"10.1016/j.ijrobp.2025.06.3310","title":"Automated AI Plan Selection in a Multicriteria Optimization Framework - A Prospective Study","year":2025,"lang":"en","type":"article","venue":"International Journal of Radiation Oncology*Biology*Physics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université Laval; Hôtel-Dieu de Québec","funders":"","keywords":"Plan (archaeology); Selection (genetic algorithm); Likert scale; Scale (ratio); Pareto principle; Radiation treatment planning","score_opus":0.010218876542421821,"score_gpt":0.3168634928167969,"score_spread":0.30664461627437506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414558576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20794141,0.0001557871,0.7864985,0.0005291718,0.003774363,0.000398967,0.000018001849,0.0003967622,0.000287028],"genre_scores_gemma":[0.9279976,0.00009285109,0.07097951,0.00026467693,0.00056670385,0.000029409888,0.00003156558,0.000025055911,0.0000126321165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985684,0.00018583327,0.0007151988,0.00018677168,0.00016384784,0.00017992283],"domain_scores_gemma":[0.9987645,0.0002425735,0.00028766325,0.00007739187,0.0005778755,0.000049955026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004039352,0.0001823921,0.00033328956,0.00043491618,0.000056925175,0.00006767911,0.00028386826,0.00025561723,0.000035948975],"category_scores_gemma":[0.0003692082,0.00018795526,0.00007850788,0.00058445096,0.000044307995,0.0003258576,0.000029361421,0.0005554593,0.000007633045],"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.00010686675,0.0003759911,0.16506739,0.0000046931837,0.00029960333,0.0000082097295,0.0010370234,0.8233686,0.00016421665,0.0014080973,0.00017741632,0.007981872],"study_design_scores_gemma":[0.0031116006,0.00028662893,0.02097781,0.00006688625,0.000044598728,0.00001668404,0.00024567905,0.97198075,0.0003635071,0.002536417,0.00021642722,0.00015303669],"about_ca_topic_score_codex":0.000014880233,"about_ca_topic_score_gemma":0.000009565442,"teacher_disagreement_score":0.7200562,"about_ca_system_score_codex":0.0009028616,"about_ca_system_score_gemma":0.00020998665,"threshold_uncertainty_score":0.7664593},"labels":[],"label_agreement":null},{"id":"W4415062435","doi":"","title":"Dynamic scheduling for deep neural network inference","year":2025,"lang":"fr","type":"article","venue":"theses.fr (ABES)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sliding window protocol; Scheduling (production processes); Artificial neural network; Deep neural networks","score_opus":0.014282621385261207,"score_gpt":0.2743848002826787,"score_spread":0.2601021788974175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415062435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013363736,0.018675663,0.9453814,0.0019016733,0.0074588894,0.00055702496,0.00003288863,0.00056755904,0.012061172],"genre_scores_gemma":[0.62513924,0.0006323128,0.37224928,0.00030456786,0.00046598463,0.00007828252,0.000044573506,0.00007990705,0.001005871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978473,0.000082372426,0.00053778593,0.00044298224,0.00018616804,0.00090339273],"domain_scores_gemma":[0.9982001,0.000857768,0.00009159381,0.00050218153,0.00018413315,0.00016417542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043406367,0.0004222038,0.00046611647,0.00015814163,0.00028102985,0.00021479857,0.00044753446,0.0003522652,0.00027061126],"category_scores_gemma":[0.00050586957,0.00048015785,0.00020885866,0.00076275086,0.00011459992,0.00024671498,0.000118000025,0.0005103252,0.00015981423],"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.000018803668,0.000041307838,0.00041825947,0.0002774337,0.00014112216,0.0000043260848,0.0006092799,0.88082147,0.000037226157,0.056191485,0.000047656817,0.061391644],"study_design_scores_gemma":[0.0007313589,0.000040729454,0.00026088548,0.0004976762,0.00016258912,0.0000049464925,0.0006966819,0.9857119,0.00015926639,0.0054115555,0.0058785486,0.00044387602],"about_ca_topic_score_codex":0.0002112832,"about_ca_topic_score_gemma":0.0001475022,"teacher_disagreement_score":0.6117755,"about_ca_system_score_codex":0.00021776216,"about_ca_system_score_gemma":0.000088722525,"threshold_uncertainty_score":0.99976504},"labels":[],"label_agreement":null},{"id":"W4415455780","doi":"10.1007/978-3-032-09037-9","title":"Advances in Soft Computing","year":2025,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"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":"Centro de Investigación Científica y de Educación Superior de Ensenada, Baja California; Universidad Autónoma del Estado de Morelos; Universidade Federal de Santa Catarina; Banco Bilbao Vizcaya Argentaria; Universidad Panamericana; Universidad Veracruzana; Universidad Autónoma de Coahuila; Centre National de la Recherche Scientifique; Universidad Autónoma del Estado de México; University of Toronto; Universidad Michoacana de San Nicolás de Hidalgo; Universidad Autónoma Metropolitana; Instituto Politécnico Nacional; Instituto Tecnológico y de Estudios Superiores de Monterrey; Université du Luxembourg","keywords":"Automatic summarization; Automation; Simple (philosophy); Range (aeronautics); Geopolitics; Financial market","score_opus":0.006098052586930704,"score_gpt":0.23358194314501787,"score_spread":0.22748389055808718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415455780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001628284,0.003922851,0.98751116,0.00004839384,0.0020667417,0.00012124494,0.0000016053118,0.00021991397,0.0060917987],"genre_scores_gemma":[0.013398388,0.00038970704,0.98480445,0.0004559501,0.0005160069,0.000002989392,0.000015646317,0.000034386972,0.0003824456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865127,0.0000118555945,0.00025997096,0.00045376606,0.0002706111,0.00035251223],"domain_scores_gemma":[0.99928963,0.0002879686,0.00004061088,0.00028146722,0.00005337258,0.000046949466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030360906,0.00023371694,0.0002882634,0.0004897468,0.00007039989,0.000115997,0.0006268066,0.00018218029,0.000012064138],"category_scores_gemma":[0.00006846811,0.00024919747,0.000038456048,0.0007546401,0.00015656152,0.00015291144,0.00014622128,0.00059027376,0.000012921371],"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":[3.1875473e-7,0.0000023855596,0.000030045207,0.000040909457,7.44175e-7,0.000005595401,0.00017760947,0.5957194,7.330012e-7,0.0000109726125,0.000015951358,0.40399536],"study_design_scores_gemma":[0.00013225121,0.00000901733,0.000032394033,0.00063773704,0.0000018398277,0.0000037092154,2.7012896e-7,0.9932114,0.00005549629,0.0048276256,0.0008400721,0.00024819345],"about_ca_topic_score_codex":0.0000035784612,"about_ca_topic_score_gemma":0.00006238191,"teacher_disagreement_score":0.40374717,"about_ca_system_score_codex":0.00024844255,"about_ca_system_score_gemma":0.000273876,"threshold_uncertainty_score":0.999996},"labels":[],"label_agreement":null},{"id":"W4415985875","doi":"10.1016/j.tcs.2025.115642","title":"Single machine controllable scheduling with bounded makespan","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Job shop scheduling; Bounded function; Scheduling (production processes); Time complexity; Upper and lower bounds; Dynamic programming; Approximation algorithm","score_opus":0.005159755932363986,"score_gpt":0.21021545954933094,"score_spread":0.20505570361696696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415985875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03508252,0.00010976372,0.950044,0.000348375,0.00041566408,0.000092305076,0.0000010406869,0.00043011608,0.01347622],"genre_scores_gemma":[0.6621849,0.0000016825694,0.33753467,0.00020713636,0.000034213863,0.0000028462923,8.6001273e-7,0.0000075631783,0.000026167005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990043,0.00001844769,0.00014838269,0.0002526998,0.0002392,0.00033695376],"domain_scores_gemma":[0.99941057,0.000091689835,0.000013203489,0.00026832073,0.00010730597,0.00010889241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036818333,0.00012870811,0.00015458054,0.0001472808,0.00021570231,0.00027655953,0.0003732232,0.000036291014,0.000049976356],"category_scores_gemma":[0.000038069753,0.00010127009,0.000022438415,0.000918604,0.0009153375,0.00013325633,0.000071338545,0.00014321686,0.000021377844],"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.00002176769,0.000035174173,0.00007404998,0.000015999201,0.000015430183,0.000004946237,0.000082165934,0.37112877,0.0009781881,0.6145296,0.000011789353,0.0131021105],"study_design_scores_gemma":[0.00045348195,0.000057840574,0.000040672934,0.000046279143,0.000008902819,0.0000061696323,0.000008733367,0.98472804,0.006780719,0.007653898,0.000082434926,0.00013283463],"about_ca_topic_score_codex":0.0000012267093,"about_ca_topic_score_gemma":9.158374e-7,"teacher_disagreement_score":0.6271024,"about_ca_system_score_codex":0.000059266462,"about_ca_system_score_gemma":0.000052284628,"threshold_uncertainty_score":0.4129674},"labels":[],"label_agreement":null},{"id":"W4416530376","doi":"10.1080/21693277.2025.2582472","title":"Reinforcement learning based dispatching solutions in semiconductor manufacturing: a literature review on validation and deployment","year":2025,"lang":"en","type":"article","venue":"Production & Manufacturing Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Österreichische Forschungsförderungsgesellschaft; Bundesministerium für Wirtschaft und Klimaschutz","keywords":"Software deployment; Scheduling (production processes); Wafer fabrication; Key (lock); Semiconductor device fabrication; Pipeline (software)","score_opus":0.037016422502934646,"score_gpt":0.31448310349005987,"score_spread":0.27746668098712524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416530376","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297755,0.028500935,0.019210275,0.013151435,0.0021407478,0.0033791135,0.000005663612,0.0014174394,0.0024189434],"genre_scores_gemma":[0.98459566,0.011892118,0.0015923709,0.00010522342,0.00013759303,0.00021069516,0.00007355711,0.000036886315,0.0013558789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811554,0.00019685425,0.00034656914,0.0004613367,0.00042780186,0.00045188467],"domain_scores_gemma":[0.9993523,0.00012836255,0.000035750723,0.00031763944,0.00008722553,0.00007876428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015124236,0.0002022823,0.00019946668,0.0007971736,0.00034726053,0.00016291431,0.00013199086,0.00009202281,0.000040672232],"category_scores_gemma":[0.00032771853,0.00019818624,0.000042004558,0.0004384565,0.00003994117,0.0002365324,0.00007333696,0.0010623976,0.00001513336],"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.000019665007,0.000033421285,0.00010616876,0.0019936913,0.000022020185,0.0000036061224,0.00021891232,0.98040307,0.00058871665,0.000040318893,0.0006270885,0.015943354],"study_design_scores_gemma":[0.0010510841,0.00010561014,0.0029737856,0.018078784,0.00003821802,0.00001412212,0.00025824536,0.2224765,0.7442262,0.0003771772,0.009764304,0.00063596526],"about_ca_topic_score_codex":0.000016043443,"about_ca_topic_score_gemma":0.0000051918923,"teacher_disagreement_score":0.7579265,"about_ca_system_score_codex":0.00035468338,"about_ca_system_score_gemma":0.00003823308,"threshold_uncertainty_score":0.8081801},"labels":[],"label_agreement":null},{"id":"W4416578230","doi":"10.2139/ssrn.5797825","title":"A reinforcement learning and a dynamic graph neural network-based scheduling agent to control a multi-task robot","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Scheduling (production processes); Robot; Job shop scheduling; Reinforcement learning; Computation; Artificial neural network; Process (computing); Robotics; Graph; Constraint programming","score_opus":0.0074616958742764914,"score_gpt":0.24605800400368588,"score_spread":0.23859630812940938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416578230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010307768,0.021128235,0.96393377,0.0008479157,0.002132237,0.0012905035,0.000008909461,0.00030156015,0.00004912165],"genre_scores_gemma":[0.894414,0.013943411,0.089021556,0.0004405721,0.0005632166,0.00015012965,0.000058471443,0.00016272017,0.0012459357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900645,0.00046874146,0.0017674676,0.0011073122,0.0007355598,0.005856412],"domain_scores_gemma":[0.99743223,0.000256409,0.0006774265,0.0004948478,0.0004322918,0.0007067678],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0037239844,0.0012576369,0.001313166,0.000990846,0.0011067966,0.00069483044,0.00072247215,0.000662093,0.000051405656],"category_scores_gemma":[0.00035093995,0.0013994469,0.0006752223,0.0009307076,0.000082610415,0.00017096636,0.000322623,0.012561123,0.000020407335],"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.0002996229,0.00006692069,0.0005138394,0.00017448359,0.0014164305,0.000017449767,0.00034204594,0.97149163,0.000088298795,0.0005531542,0.0000029099874,0.025033224],"study_design_scores_gemma":[0.005726414,0.00057646516,0.00010246616,0.0012161279,0.00065603165,0.00015351617,0.00072143244,0.98867947,0.0000120270815,0.00085037027,0.000119447875,0.0011862526],"about_ca_topic_score_codex":0.00009995363,"about_ca_topic_score_gemma":0.00038945116,"teacher_disagreement_score":0.8841062,"about_ca_system_score_codex":0.0033432983,"about_ca_system_score_gemma":0.003527405,"threshold_uncertainty_score":0.9988455},"labels":[],"label_agreement":null},{"id":"W4416850440","doi":"10.3390/app152312626","title":"Dynamic Flexible Job Shop Scheduling via an Adaptive Genetic Algorithm and Deep Learning","year":2025,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs","funders":"","keywords":"Job shop scheduling; Markov decision process; Dynamic priority scheduling; Adaptability; Deep learning; Scheduling (production processes); Genetic algorithm; Flow shop scheduling","score_opus":0.009009393043264684,"score_gpt":0.2398314158375514,"score_spread":0.23082202279428674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416850440","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06307312,0.0011653122,0.92885965,0.000024778852,0.0002139915,0.00010873639,5.966176e-7,0.00041053127,0.0061432994],"genre_scores_gemma":[0.47134954,0.00008066731,0.5284082,0.000036786907,0.000019212532,0.000014921896,0.0000018176712,0.000009426347,0.0000794044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990612,0.00001674506,0.00016425666,0.00031739252,0.0001674242,0.0002729325],"domain_scores_gemma":[0.9997044,0.000059614824,0.00002349639,0.00010590024,0.00002781541,0.00007874339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002597737,0.00014185018,0.0001383185,0.00019265595,0.00038437804,0.00014638185,0.00019795467,0.00007000436,0.00001880746],"category_scores_gemma":[0.000011822207,0.00014026897,0.000018133489,0.0006673609,0.00018456872,0.00013279263,0.000043638574,0.00018004978,0.000013978219],"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.0000015598315,0.0000048616425,0.00012199097,0.0000067415094,0.000009768786,6.7187057e-7,0.00021597488,0.8028296,0.0005593009,0.0007075901,7.674671e-7,0.19554116],"study_design_scores_gemma":[0.00015063577,0.00003505977,0.0007724323,0.000013906977,0.0000115554485,0.0000029304235,0.0012807358,0.99579346,0.00068902026,0.001052481,0.000031120122,0.000166663],"about_ca_topic_score_codex":0.000007878949,"about_ca_topic_score_gemma":0.000006619022,"teacher_disagreement_score":0.4082764,"about_ca_system_score_codex":0.000029986553,"about_ca_system_score_gemma":0.000027928698,"threshold_uncertainty_score":0.57200027},"labels":[],"label_agreement":null},{"id":"W47974647","doi":"10.7202/028608ar","title":"A Note on Manpower Forecasting","year":2005,"lang":"fr","type":"article","venue":"Relations industrielles","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Operations research; Engineering","score_opus":0.03134347865036592,"score_gpt":0.2444626066492632,"score_spread":0.21311912799889726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W47974647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039610635,0.01332247,0.51599085,0.0645356,0.007009598,0.0007019224,0.00014005111,0.0011328286,0.35755607],"genre_scores_gemma":[0.3859793,0.00039385562,0.47579905,0.0003068978,0.0031371028,0.000025988697,0.00007715959,0.00013875986,0.13414188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988392,0.000039218103,0.00035820197,0.00022287619,0.00019156642,0.00034894777],"domain_scores_gemma":[0.99917877,0.00029811932,0.000066708395,0.0002522012,0.00007052024,0.00013370629],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016798927,0.00021922294,0.00015287603,0.00019683724,0.00024549122,0.000078224715,0.00011433828,0.0005545454,0.0021561303],"category_scores_gemma":[0.00026500918,0.000256353,0.000083354294,0.0005336308,0.000056087094,0.00021949025,0.00002428744,0.00083814556,0.002601087],"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.0000026049274,0.000045286495,0.00011237688,0.0000021215792,0.00002804106,0.0000046387845,0.0006104207,0.7623309,0.0000025071918,0.0050094193,0.009348338,0.22250336],"study_design_scores_gemma":[0.00031779835,0.000026221931,0.00006358888,0.00017809645,0.000037407284,0.000016448474,0.00017278656,0.70840186,0.00035428375,0.00009436079,0.290121,0.00021615025],"about_ca_topic_score_codex":0.00002099839,"about_ca_topic_score_gemma":0.0000094676725,"teacher_disagreement_score":0.34636867,"about_ca_system_score_codex":0.0002785495,"about_ca_system_score_gemma":0.000087656656,"threshold_uncertainty_score":0.99998885},"labels":[],"label_agreement":null},{"id":"W5387978","doi":"10.1023/a:1022291313614","title":"Computer-aided prototyping of production flows for a virtual enterprise","year":2003,"lang":"en","type":"article","venue":"Journal of Intelligent Manufacturing","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":20,"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é du Québec en Outaouais","funders":"","keywords":"Computer science; Component (thermodynamics); Distributed computing; Scheme (mathematics); Process (computing); Constraint (computer-aided design); Material flow; Set (abstract data type); Industrial engineering; Batch production; Production line; Production (economics); Software; Production planning; Work (physics); Work flow; Engineering; Operating system; Operations management","score_opus":0.0146074380416139,"score_gpt":0.23351453893115579,"score_spread":0.21890710088954188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W5387978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35495222,0.0001799461,0.64304763,0.0000166607,0.0014853203,0.00024576197,8.731925e-7,0.000029884139,0.00004169436],"genre_scores_gemma":[0.7690378,0.00017370375,0.23031242,0.000012318538,0.0003807679,0.000010731951,0.0000011915372,0.00003155333,0.000039543465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99898326,0.000024156296,0.00058798405,0.00009137093,0.0001626654,0.00015055206],"domain_scores_gemma":[0.9994313,0.000057867357,0.0001989143,0.00010636418,0.00014129862,0.00006425288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003800152,0.00012481876,0.00023103978,0.00020940696,0.000035652676,0.00002568762,0.00011072489,0.000050646064,0.000028407749],"category_scores_gemma":[0.00010188461,0.00011232495,0.00014808624,0.00006833946,0.000011567487,0.00014943373,0.000008115996,0.00016094842,0.0000024561684],"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.000046368044,0.000048125064,0.00002970513,0.00012936642,0.000101288446,0.0000022859924,0.00056382857,0.9587445,0.0014348256,0.000044485125,0.00008579486,0.038769394],"study_design_scores_gemma":[0.0002983613,0.00016870139,0.00003470066,0.00024531988,0.00002749964,0.0000732633,0.00018803297,0.13105585,0.86550134,0.000103424405,0.0021759928,0.00012751398],"about_ca_topic_score_codex":4.5924637e-7,"about_ca_topic_score_gemma":4.2875433e-7,"teacher_disagreement_score":0.86406654,"about_ca_system_score_codex":0.00006915093,"about_ca_system_score_gemma":0.000021361782,"threshold_uncertainty_score":0.45804787},"labels":[],"label_agreement":null},{"id":"W578809198","doi":"10.15807/jorsj.49.174","title":"BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(&lt;Special Issue&gt;Advanced Planning and Scheduling for Supply Chain Management)","year":2006,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of Japan","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Supply chain; Computer science; Scheduling (production processes); Mathematical optimization; Supply chain management; Flow shop scheduling; Dynamic priority scheduling; Job shop scheduling; Fair-share scheduling; Operations research; Schedule; Mathematics; Business; Operating system","score_opus":0.018436567442893105,"score_gpt":0.29911578389198806,"score_spread":0.28067921644909494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578809198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95939934,0.00206345,0.03311845,0.003054329,0.0005485103,0.0008779745,0.000028681668,0.000036408877,0.00087284244],"genre_scores_gemma":[0.6149744,0.0007148036,0.3822091,0.000035107005,0.0011574195,0.000028906561,0.000011663921,0.000041077998,0.00082754326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981237,0.00009183858,0.00062639615,0.00016413025,0.00056962325,0.00042432407],"domain_scores_gemma":[0.99905354,0.00018620845,0.00008029939,0.0001772826,0.00041429375,0.00008836451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017308934,0.00015365197,0.0002842592,0.00032909567,0.0004190378,0.00015098942,0.00035750784,0.00010897725,0.00003627792],"category_scores_gemma":[0.00011906703,0.00013199293,0.00018422303,0.0008903994,0.00011976225,0.00032122948,0.000083612176,0.00056910235,0.0000019145057],"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.000025529875,0.000060687526,0.0011722028,0.000113522314,0.00006665909,9.564449e-7,0.0015323752,0.9896382,0.0021027524,0.00043261208,0.0016911243,0.0031633906],"study_design_scores_gemma":[0.0019848335,0.000059117905,0.0022392615,0.00033097767,0.000022088134,0.0000097013335,0.004854838,0.9861913,0.0018020082,0.0001224965,0.002220401,0.0001630199],"about_ca_topic_score_codex":0.000015560725,"about_ca_topic_score_gemma":0.000021592152,"teacher_disagreement_score":0.34909064,"about_ca_system_score_codex":0.00020540129,"about_ca_system_score_gemma":0.00008623535,"threshold_uncertainty_score":0.5382515},"labels":[],"label_agreement":null},{"id":"W612784360","doi":"10.1007/b135410","title":"Analysis, Control and Optimization of Complex Dynamic Systems","year":2005,"lang":"en","type":"book","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science","score_opus":0.006891500120197882,"score_gpt":0.20787834772640487,"score_spread":0.200986847606207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W612784360","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027974543,0.002059467,0.8975579,0.000008535456,0.0001212036,0.0001639849,0.000079005484,0.00021848877,0.0997886],"genre_scores_gemma":[0.028703088,0.0025217135,0.33229205,0.00006918392,0.0003182747,0.000029228135,0.0027984588,0.00020518371,0.63306284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922705,0.000013454977,0.00036068438,0.00015017566,0.00014415813,0.00010448121],"domain_scores_gemma":[0.99953365,0.000047515954,0.000090445974,0.00018233423,0.00009244677,0.000053603282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008122528,0.00018501603,0.00050801324,0.00034824118,0.000019157907,0.000033851604,0.00007639161,0.00020964394,0.00018670803],"category_scores_gemma":[0.00000547224,0.00018430728,0.00008584442,0.00014947925,0.000028647977,0.00003800142,0.000007986063,0.00010524626,0.000005426715],"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.0000014150306,0.000003289931,0.000007132928,0.000085086904,0.0006720281,3.624106e-7,0.000013033633,0.9980535,0.0000014504009,0.00019372624,0.0005565048,0.0004124619],"study_design_scores_gemma":[0.0003076633,0.0000075622565,0.000024207624,0.00002869152,0.00064954825,0.0000018183143,0.000010072899,0.99739915,3.6966733e-7,0.000002811049,0.0013923374,0.00017575451],"about_ca_topic_score_codex":0.0000052647315,"about_ca_topic_score_gemma":0.000008179033,"teacher_disagreement_score":0.5652659,"about_ca_system_score_codex":0.000075876116,"about_ca_system_score_gemma":0.000023763087,"threshold_uncertainty_score":0.7515833},"labels":[],"label_agreement":null},{"id":"W623748610","doi":"10.71781/11067","title":"Heuristiques efficaces pour l'optimisation de la performance des systèmes séries-parallèles","year":2009,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Humanities; Philosophy","score_opus":0.00469618565482372,"score_gpt":0.180269718700129,"score_spread":0.1755735330453053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W623748610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92643154,0.031262383,0.0135202,0.00014976844,0.00076591887,0.00029302092,0.0000329635,0.00053365907,0.027010525],"genre_scores_gemma":[0.86734617,0.006821856,0.10262945,0.000037650283,0.0003452529,0.00002823296,0.00047189923,0.00007186432,0.022247639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977025,0.0002523019,0.0004882307,0.0005087223,0.00049420673,0.00055407104],"domain_scores_gemma":[0.9984771,0.00025897854,0.00029623503,0.00029207653,0.00034581003,0.0003297884],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003412866,0.00058958546,0.00046356936,0.00035970425,0.004874607,0.00019668273,0.00038499414,0.0007504245,0.000049929706],"category_scores_gemma":[0.00013273543,0.000725059,0.0002646601,0.00036491017,0.0003388456,0.0005313597,0.00004681556,0.0005937832,0.00006931907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003102288,0.00017599792,0.010449812,0.00060617557,0.0003200986,0.00044914044,0.031295598,0.9235705,0.0033463284,0.0046943896,0.0002578112,0.024523878],"study_design_scores_gemma":[0.0017017038,0.0001994516,0.21147023,0.001976172,0.0007018928,0.0013361387,0.03172005,0.70227593,0.042409033,0.0007436431,0.003909973,0.0015557739],"about_ca_topic_score_codex":0.008266604,"about_ca_topic_score_gemma":0.0009755912,"teacher_disagreement_score":0.2212946,"about_ca_system_score_codex":0.006509631,"about_ca_system_score_gemma":0.0013311645,"threshold_uncertainty_score":0.99952006},"labels":[],"label_agreement":null},{"id":"W653365980","doi":"10.1007/978-3-540-33876-5","title":"Multiagent based Supply Chain Management","year":2006,"lang":"en","type":"book","venue":"Studies in computational intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":99,"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":"Supply chain management; Computer science; Supply chain; Artificial intelligence; Business; Marketing","score_opus":0.039078218694567804,"score_gpt":0.299767815151777,"score_spread":0.2606895964572092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W653365980","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061873466,0.0054553477,0.8574927,0.000082058534,0.0016193647,0.00043743657,0.000056595498,0.0003204218,0.13452992],"genre_scores_gemma":[0.008395934,0.0015322586,0.74393094,0.0003956208,0.0005735414,0.00027624753,0.0010970088,0.00018622428,0.24361223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998547,0.000020477628,0.0005107712,0.0003220254,0.00036654496,0.00023314358],"domain_scores_gemma":[0.99926114,0.00032973962,0.00006370165,0.00016193316,0.00014771726,0.000035765435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016967488,0.00032084264,0.00032278098,0.0003465564,0.00006117368,0.000024689663,0.00022440734,0.00011633978,0.00006098977],"category_scores_gemma":[0.000019769233,0.00035357836,0.00008579926,0.00019148177,0.00012909666,0.000032336327,0.00006852511,0.00027551493,0.00013001144],"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.0000025664403,0.000020471283,0.000009281944,0.00028482362,0.000116798445,0.000049842238,0.0001397616,0.9686215,1.47253445e-8,0.0036481302,0.019783242,0.0073235733],"study_design_scores_gemma":[0.00011421098,0.000013460948,0.000038060673,0.00049851846,0.000022260236,0.0000018463512,0.00010854769,0.97736233,0.000009082631,0.012388982,0.009082727,0.0003599785],"about_ca_topic_score_codex":0.0000026528865,"about_ca_topic_score_gemma":0.000012256383,"teacher_disagreement_score":0.113561735,"about_ca_system_score_codex":0.00051863235,"about_ca_system_score_gemma":0.000043667776,"threshold_uncertainty_score":0.99989164},"labels":[],"label_agreement":null},{"id":"W655696419","doi":"10.71781/11095","title":"Planification de la récolte et allocation des produits aux usines","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.036190988235504665,"score_gpt":0.33457063386842567,"score_spread":0.298379645632921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W655696419","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661614,0.0025401448,0.14325877,0.0013868095,0.0015885828,0.0024237048,0.00010881839,0.00007026981,0.082461536],"genre_scores_gemma":[0.15797807,0.00077410624,0.81101286,0.000053838,0.00032096627,0.00010927788,0.0046369196,0.00011192315,0.025002018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850535,0.00017414025,0.0004246577,0.00041928244,0.00019395126,0.00028263478],"domain_scores_gemma":[0.9989967,0.000119545875,0.00018866666,0.0002913628,0.0002921782,0.0001115849],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074404484,0.00032670712,0.00027285653,0.0001519882,0.00021802609,0.0007338896,0.00042929535,0.00046543864,0.00054748595],"category_scores_gemma":[0.0002977244,0.00038475925,0.000055602042,0.00038290943,0.00005041427,0.0004763428,0.000023160912,0.00032946953,0.00044523034],"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.000052553674,0.00019588167,0.0004770501,0.00016072932,0.00008868518,0.000009576534,0.014251996,0.5922372,0.0055014472,0.0010284606,0.00021197641,0.38578445],"study_design_scores_gemma":[0.0016105378,0.00015875927,0.12563467,0.0020029359,0.00049225375,0.000083746294,0.0043088403,0.7473141,0.084230475,0.0010242175,0.031422935,0.0017165355],"about_ca_topic_score_codex":0.00046227514,"about_ca_topic_score_gemma":0.00057229324,"teacher_disagreement_score":0.6677541,"about_ca_system_score_codex":0.00021423885,"about_ca_system_score_gemma":0.00046490444,"threshold_uncertainty_score":0.9998604},"labels":[],"label_agreement":null},{"id":"W6966470547","doi":"10.4230/lipics.isaac.2024.20","title":"Revisit the Scheduling Problem with Calibrations","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Stockpile; Scheduling (production processes); Schedule; Job shop scheduling; Calibration; Time complexity; Robot","score_opus":0.008909819028516699,"score_gpt":0.22157246137045863,"score_spread":0.21266264234194193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966470547","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017175669,0.00079095154,0.96736574,0.0009988409,0.0010554446,0.0013000325,0.0003047249,0.0017465631,0.009262042],"genre_scores_gemma":[0.4956174,0.00027672577,0.4996387,0.00093909027,0.0007496057,0.0005121158,0.000918578,0.00025590297,0.0010918715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985103,0.000013566594,0.0006052227,0.00015144033,0.00028886736,0.00043057962],"domain_scores_gemma":[0.9991983,0.00012157349,0.00005983735,0.00038197404,0.00012340893,0.000114896044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031859922,0.00028737268,0.00022290635,0.00016039779,0.0002961759,0.00076820544,0.0003311509,0.0001312881,0.000060795857],"category_scores_gemma":[0.000026320637,0.00019006284,0.00012384719,0.0004924149,0.00007130014,0.0008919715,0.000050595037,0.0004519117,0.00016728562],"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.000038984585,0.00007284524,0.0005767441,0.0026552847,0.00069026445,0.000010270952,0.014577255,0.9337983,0.000038118906,0.022584202,0.006745013,0.018212687],"study_design_scores_gemma":[0.00048162806,0.00005162911,0.000022270911,0.00038327306,0.00006275564,0.000051705912,0.0009798617,0.94443,0.00027720424,0.00017212775,0.052780584,0.00030696226],"about_ca_topic_score_codex":0.0000029324287,"about_ca_topic_score_gemma":0.0000060716106,"teacher_disagreement_score":0.47844172,"about_ca_system_score_codex":0.00007486405,"about_ca_system_score_gemma":0.000059779602,"threshold_uncertainty_score":0.7750538},"labels":[],"label_agreement":null},{"id":"W6976962287","doi":"10.6084/m9.figshare.24277182.v1","title":"Additional file 1 of Fusobacterium nucleatum upregulates MMP7 to promote metastasis-related characteristics of colorectal cancer cell via activating MAPK(JNK)-AP1 axis","year":2023,"lang":"en","type":"article","venue":"Figshare","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fusobacterium nucleatum; Colorectal cancer; Fusobacterium; KEGG; Cell; Cell culture; Downregulation and upregulation; Gene","score_opus":0.011145120697085845,"score_gpt":0.2089433583697903,"score_spread":0.19779823767270446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976962287","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107661765,0.000015782833,0.0000069962025,0.000010436589,0.00011672772,0.00018533344,0.98798174,0.00030749815,0.00060933665],"genre_scores_gemma":[0.046435766,0.0000033678245,0.01051212,0.0000131429715,0.00008131293,0.0005205933,0.94183475,0.00008396276,0.0005150009],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990238,0.000015843754,0.00034485655,0.00018414504,0.00019395312,0.00023739359],"domain_scores_gemma":[0.9991422,0.00027790558,0.00014354166,0.00013730653,0.00020742572,0.00009159546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000025723422,0.00017561091,0.0002660296,0.00010092253,0.000045563676,0.00002053485,0.00015599436,0.00011578513,0.9353097],"category_scores_gemma":[0.0005094079,0.00019086558,0.00008687322,0.00054479635,0.0000073949527,0.00011890539,0.00007198018,0.00012912093,0.00075307983],"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.000009464862,0.000027272938,0.0000026126963,0.00033744195,0.00008400548,0.0000034917293,0.00032653884,0.014769311,0.0051342896,3.0316983e-7,0.9744908,0.004814464],"study_design_scores_gemma":[0.000489921,0.00015888269,0.019984892,0.005138688,0.000042008876,0.0000076203846,0.00020936936,0.70070195,0.12945361,0.000012522673,0.14296748,0.0008330408],"about_ca_topic_score_codex":0.0000071623945,"about_ca_topic_score_gemma":0.0000056423364,"teacher_disagreement_score":0.9345566,"about_ca_system_score_codex":0.00006805324,"about_ca_system_score_gemma":0.000046136574,"threshold_uncertainty_score":0.96795684},"labels":[],"label_agreement":null},{"id":"W6977181532","doi":"10.6084/m9.figshare.18132151.v1","title":"Additional file 3 of Which chart and which cut-point: deciding on the INTERGROWTH, World Health Organization, or Hadlock fetal growth chart","year":2022,"lang":"en","type":"article","venue":"Figshare","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Women's Health Research Institute; University of British Columbia","funders":"","keywords":"Chart; Fetal growth; Growth chart; Pie chart","score_opus":0.017327251205201927,"score_gpt":0.20874262878817507,"score_spread":0.19141537758297314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977181532","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045061464,0.000034075303,0.00004004949,0.0010092602,0.00009088768,0.00017754498,0.99684227,0.00018873371,0.0015721141],"genre_scores_gemma":[0.026925748,0.000007128196,0.0019547064,0.00082363933,0.00021341996,0.00046993516,0.96834296,0.00008139836,0.0011810584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908245,0.000049801234,0.00023745703,0.00018909031,0.00025247317,0.00018875924],"domain_scores_gemma":[0.998597,0.00081206486,0.00008992914,0.00015550893,0.00026745448,0.000077997334],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000060359198,0.00014331381,0.00015557845,0.00013860798,0.00029954457,0.000046855148,0.00018807556,0.000031385916,0.9725463],"category_scores_gemma":[0.0026623646,0.00012186209,0.000024105642,0.0013203839,0.000004974493,0.00009388564,0.00011512464,0.0002664796,0.00039191835],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000004794742,0.000017416105,0.000003488167,0.00005798563,0.00001968596,7.5566885e-7,0.00025637733,0.0044500157,0.0000012105028,0.000044356835,0.99502134,0.0001225677],"study_design_scores_gemma":[0.0008122465,0.00034466357,0.0011771196,0.0036639827,0.000014814676,0.00010138949,0.0016830981,0.30843723,0.0012148086,0.00008963324,0.681594,0.0008669881],"about_ca_topic_score_codex":0.0000017842686,"about_ca_topic_score_gemma":0.00004373267,"teacher_disagreement_score":0.9721544,"about_ca_system_score_codex":0.00008341676,"about_ca_system_score_gemma":0.000113319395,"threshold_uncertainty_score":0.50374484},"labels":[],"label_agreement":null},{"id":"W6980570636","doi":"","title":"A Citation Network Analysis of Perfectionism in Sport","year":2021,"lang":"en","type":"article","venue":"Digital Commons - USU (Utah State University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Qualitative analysis; Citation analysis; Field (mathematics); Athletes; Scientific literature; Network analysis; Bibliometrics; Social network analysis","score_opus":0.009050060838291464,"score_gpt":0.18746357448146297,"score_spread":0.1784135136431715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980570636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9356949,0.00005752865,0.036096886,0.000019940904,0.000118660355,0.00004805467,0.00006763544,0.00012814766,0.027768256],"genre_scores_gemma":[0.9970967,0.00004309342,0.0018045196,0.0000056372196,0.000008128378,2.1362702e-7,0.0002596662,0.000009902574,0.000772141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994976,0.000012158242,0.00014090924,0.00011982793,0.00009283779,0.00013666996],"domain_scores_gemma":[0.9996507,0.000042282565,0.00003279086,0.0001373996,0.00008804412,0.00004877871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042070966,0.000082777384,0.00019107154,0.0004364876,0.000041076433,0.000046094712,0.00007241931,0.000039553972,0.000028236276],"category_scores_gemma":[0.000011259742,0.00011022404,0.00009631214,0.0034459536,0.000024991416,0.0002682612,0.000028596978,0.00009351544,0.000004514523],"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.000007851021,0.000029879262,0.04222885,0.000007271136,0.000225338,0.0000618222,0.0002335439,0.9553367,0.0000060660905,0.00051895704,0.000024987035,0.0013187189],"study_design_scores_gemma":[0.00070197054,0.00003368878,0.06838698,0.000038270264,0.0002986761,0.0000044043495,0.0013816368,0.9234079,0.00019739511,0.00020072891,0.0049977754,0.00035058288],"about_ca_topic_score_codex":0.00002203529,"about_ca_topic_score_gemma":0.00026375518,"teacher_disagreement_score":0.06140181,"about_ca_system_score_codex":0.000075448166,"about_ca_system_score_gemma":0.000026748132,"threshold_uncertainty_score":0.4494806},"labels":[],"label_agreement":null},{"id":"W6990628831","doi":"","title":"The effect of Li on the petrogenesis of granitic pegmatites","year":2015,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pegmatite; Petrogenesis; Crystallization; Spodumene; Albite; Quartz; Feldspar; Saturation (graph theory); Plagioclase","score_opus":0.010024983230043697,"score_gpt":0.2221364722344541,"score_spread":0.2121114890044104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990628831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97001016,0.0012486526,9.0120693e-7,0.000008207526,0.0013746732,0.00052641856,0.0003628279,0.00020461011,0.026263518],"genre_scores_gemma":[0.9978775,0.0003504812,0.00040467744,0.000015780448,0.000041359595,0.00012067193,0.00022284192,0.00017400362,0.00079268817],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997594,0.00034554335,0.00067952735,0.0002963386,0.0007410541,0.00034355515],"domain_scores_gemma":[0.9969187,0.0015623079,0.0003270891,0.0006998027,0.00037644742,0.000115692616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001262236,0.00048666503,0.00057932833,0.00020074322,0.0004607583,0.000046578338,0.0006517688,0.0003531581,0.00005839168],"category_scores_gemma":[0.0016302391,0.000314162,0.00031853732,0.0005004602,0.00007066806,0.00011424392,0.000030753687,0.0007054816,0.00008095278],"study_design_candidate":"bench_or_experimental","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.0014701237,0.0003706372,0.00028802862,0.0070078406,0.0044030366,0.000043798194,0.0002537032,0.21245085,0.048363518,0.09760112,0.00017472602,0.6275726],"study_design_scores_gemma":[0.002028528,0.0011562846,0.00076188415,0.0018756008,0.0010820506,0.000017476657,0.0011279823,0.015960785,0.9618246,0.006006025,0.0065793633,0.0015794275],"about_ca_topic_score_codex":0.00003174066,"about_ca_topic_score_gemma":0.00008073753,"teacher_disagreement_score":0.9134611,"about_ca_system_score_codex":0.00015543783,"about_ca_system_score_gemma":0.000022293454,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W6991272467","doi":"","title":"A genetic algorithm approach to job shop scheduling problems with a batch allocation issue","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job shop scheduling; Job scheduler; Flow shop scheduling; Batch production; Scheduling (production processes); Genetic algorithm; Batch processing; Job shop","score_opus":0.011641369416697694,"score_gpt":0.21061318595927292,"score_spread":0.19897181654257523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991272467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022377314,0.00011374956,0.95421255,0.0002251066,0.00014464131,0.0003610834,0.000002137482,0.00051972637,0.02204369],"genre_scores_gemma":[0.096670575,0.000062647894,0.90197283,0.00011566101,0.0002802258,0.00014490835,0.000015130146,0.00006662539,0.0006714001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988988,0.00001786897,0.00021386625,0.00028452245,0.00025361538,0.0003313041],"domain_scores_gemma":[0.9994092,0.000016007716,0.000022573733,0.00027470847,0.000102138525,0.00017536189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012190646,0.00019564269,0.00017012251,0.000134992,0.00007735784,0.00008606435,0.00017162265,0.00008945346,0.000120908895],"category_scores_gemma":[0.00001594511,0.00018390606,0.000029161778,0.000614916,0.000019034846,0.00009800686,0.00002029515,0.00016308024,0.00014958096],"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.000004700137,0.00003636183,0.00022892508,0.000031792486,0.000030679355,0.0000034938191,0.00069663685,0.9483678,0.00070684083,0.000043904296,0.00019066334,0.049658213],"study_design_scores_gemma":[0.0003661594,0.00004759224,0.0002925347,0.00004320356,0.000018646026,0.000050300085,0.00021080713,0.9963867,0.00036905461,0.00007367623,0.0018643008,0.00027703115],"about_ca_topic_score_codex":0.000009784255,"about_ca_topic_score_gemma":0.000003373285,"teacher_disagreement_score":0.074293256,"about_ca_system_score_codex":0.00006097924,"about_ca_system_score_gemma":0.000026454214,"threshold_uncertainty_score":0.7499472},"labels":[],"label_agreement":null},{"id":"W6991324176","doi":"","title":"A generic algorithm approach to job shop scheduling problems with a batch allocation issue","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Job scheduler; Job shop scheduling; Flow shop scheduling; Scheduling (production processes); Job shop; Batch production","score_opus":0.015111908134279553,"score_gpt":0.21424162448945008,"score_spread":0.19912971635517052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991324176","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015834158,0.00011174442,0.9541934,0.00028125956,0.00017180006,0.00033046654,0.0000023831783,0.0006021982,0.028472567],"genre_scores_gemma":[0.07410415,0.00007151787,0.92410326,0.00015969118,0.00033235145,0.00016267732,0.00003173287,0.00007269884,0.0009619324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888015,0.000018136547,0.00021073071,0.00029121738,0.00025886146,0.00034089317],"domain_scores_gemma":[0.9994028,0.000014831762,0.000024505283,0.00027418032,0.00010614758,0.00017750643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015364752,0.00020351929,0.00018112191,0.00014479995,0.00008451697,0.000087472676,0.00017478317,0.00009154705,0.000115876595],"category_scores_gemma":[0.000015778658,0.00018868002,0.00003145307,0.00078713556,0.000018339968,0.00013283014,0.000021890306,0.0001675774,0.00014033657],"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.00000519714,0.00004055984,0.00012299707,0.00003064736,0.000034457942,0.0000030577896,0.00069153716,0.94689,0.001387006,0.00007389319,0.00033122962,0.050389443],"study_design_scores_gemma":[0.00035180096,0.00004362529,0.000077420395,0.000035281482,0.000017260925,0.00004282834,0.00023709699,0.9949647,0.0006517254,0.000051662126,0.0032398459,0.0002867566],"about_ca_topic_score_codex":0.000009189262,"about_ca_topic_score_gemma":0.0000033672084,"teacher_disagreement_score":0.058269996,"about_ca_system_score_codex":0.00007134121,"about_ca_system_score_gemma":0.000027725662,"threshold_uncertainty_score":0.7694148},"labels":[],"label_agreement":null},{"id":"W6992021451","doi":"","title":"Integration of agent-based approaches with genetic algorithms for manufacturing scheduling","year":2001,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Job shop scheduling; Genetic algorithm","score_opus":0.03831884143504711,"score_gpt":0.23242506343347583,"score_spread":0.19410622199842872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992021451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22060679,0.000046171772,0.7780699,0.00003522523,0.00008651278,0.00016436371,0.000004202328,0.00014072937,0.0008461041],"genre_scores_gemma":[0.47408438,0.000008068319,0.52575016,0.000008713305,0.000049285787,0.00003249083,0.000017275019,0.000022165896,0.000027454591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937296,0.000008677143,0.00018172851,0.00014321244,0.00012419796,0.00016920791],"domain_scores_gemma":[0.9996776,0.000041014784,0.000038849917,0.00015152573,0.000041408828,0.000049586346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008195921,0.00012514876,0.0001369348,0.00009800594,0.000043032916,0.000024174025,0.000087400425,0.000059211085,0.000044404576],"category_scores_gemma":[0.000013138688,0.0001102586,0.000044794357,0.00011109283,0.000024069042,0.000057392732,0.000004865036,0.00007661424,0.0000030568365],"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.000018549736,0.00001843001,0.000115079325,0.00005004921,0.000023050097,0.0000017773185,0.00009359254,0.9365204,0.0025493717,0.000044661512,0.000008111388,0.060556903],"study_design_scores_gemma":[0.0005076695,0.00004518843,0.0004357525,0.00004217854,0.000020952999,0.000004031081,0.00011527748,0.90795225,0.09055394,0.000115939074,0.00007820484,0.00012864085],"about_ca_topic_score_codex":0.0000021880971,"about_ca_topic_score_gemma":0.000003375767,"teacher_disagreement_score":0.25347757,"about_ca_system_score_codex":0.000029252245,"about_ca_system_score_gemma":0.000015576754,"threshold_uncertainty_score":0.44962153},"labels":[],"label_agreement":null},{"id":"W6992031489","doi":"","title":"A Jupiter permanent tethered observatory. Dynamical analysis","year":2006,"lang":"es","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Atmosphere of Jupiter; Jupiter (rocket family); Solar System","score_opus":0.01432057176808973,"score_gpt":0.23156002893180322,"score_spread":0.21723945716371348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992031489","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4692474,0.005641434,0.17037429,0.029234571,0.0057269055,0.0021172285,0.0008853202,0.004517612,0.31225523],"genre_scores_gemma":[0.9692841,0.00017911401,0.027350953,0.00015186732,0.0012140233,0.00014705771,0.00087786897,0.0001459317,0.0006490864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949532,0.00042101005,0.0012860136,0.0010797183,0.001119315,0.0011407058],"domain_scores_gemma":[0.99724686,0.00026017413,0.00038743246,0.0009722775,0.0005364629,0.0005967752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060946686,0.0008587355,0.0009635837,0.0010543274,0.00063533074,0.00068656256,0.00077695167,0.0010097793,0.00019593324],"category_scores_gemma":[0.0002089506,0.0008990109,0.00077692326,0.0023871996,0.000037664995,0.00046514146,0.00020295454,0.0010178887,0.000074862015],"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.0001487151,0.0010059493,0.007164867,0.00027407342,0.001973195,0.0003381447,0.0008590223,0.1445946,0.0014854538,0.8403776,0.00073807756,0.0010402594],"study_design_scores_gemma":[0.0017179663,0.000061703555,0.047167066,0.00019624384,0.0014687548,0.00035850023,0.00023255093,0.3160041,0.0004423535,0.00024801292,0.6307282,0.0013745541],"about_ca_topic_score_codex":0.000007239227,"about_ca_topic_score_gemma":0.000109261295,"teacher_disagreement_score":0.8401296,"about_ca_system_score_codex":0.0011657852,"about_ca_system_score_gemma":0.0003413846,"threshold_uncertainty_score":0.9993461},"labels":[],"label_agreement":null},{"id":"W6995375752","doi":"","title":"U.F.O. Ontario","year":2017,"lang":"en","type":"other","venue":"YorkSpace (York University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Government (linguistics); Natural (archaeology); Identification (biology)","score_opus":0.010429292146582102,"score_gpt":0.17094815202432317,"score_spread":0.16051885987774106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995375752","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000053279027,0.00048098003,0.013903633,0.000023722203,0.0011428825,0.00009665235,0.00001521476,0.001128207,0.98320335],"genre_scores_gemma":[0.000039899307,0.00030523195,0.02246729,0.0000094456755,0.00020877448,2.7906955e-7,0.000034290366,0.00024569978,0.9766891],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993981,0.000010823879,0.00004471919,0.0002107721,0.00011501921,0.00022056811],"domain_scores_gemma":[0.9992903,0.000009539542,0.00007183627,0.0004997549,0.000013943907,0.00011462939],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000023886796,0.00023524836,0.00023127951,0.00030548315,0.00009302708,0.000059511123,0.00044658518,0.00039561797,0.0026385093],"category_scores_gemma":[0.000005868581,0.00029254015,0.00008533731,0.0001297056,0.000051630508,0.000048628037,0.000044018874,0.00032472968,0.0005165222],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029664477,0.000008495385,0.0001002664,0.000030617583,0.00013441418,0.00007881636,0.00016663763,0.005234051,5.932735e-7,0.00035098894,0.99225867,0.0016334722],"study_design_scores_gemma":[0.0002667506,0.0000062805034,0.00001333618,0.00016945491,0.000048306258,0.0000019480995,0.000073503026,0.001418981,0.0000036618917,0.0000024311046,0.99767077,0.00032460023],"about_ca_topic_score_codex":0.0047372566,"about_ca_topic_score_gemma":0.06775925,"teacher_disagreement_score":0.063021995,"about_ca_system_score_codex":0.00023577671,"about_ca_system_score_gemma":0.000086365624,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W6999432053","doi":"","title":"Covanta Holding Corporation Reports 2015 Third Quarter Results And Affirms 2015 Guidance - Commodities (COMMODIT) News","year":2015,"lang":"en","type":"other","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Corporation; Quarter (Canadian coin); Payment; Work (physics)","score_opus":0.02040587281751308,"score_gpt":0.24934114590149592,"score_spread":0.22893527308398284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999432053","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000542793,0.0058143707,0.041082583,0.000493204,0.004052084,0.0005559641,0.00028802973,0.0028507672,0.9448087],"genre_scores_gemma":[0.004284195,0.0012326101,0.13513513,0.00028648874,0.0023680634,0.00006830965,0.0030832323,0.0010901777,0.8524518],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998223,0.00004798018,0.0006353696,0.0004395493,0.00036663038,0.0002874515],"domain_scores_gemma":[0.9986259,0.000043221127,0.00032189526,0.00068753824,0.00012631307,0.00019513673],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044613308,0.00044103424,0.0005068732,0.00026291548,0.000058924157,0.00020089232,0.00014715218,0.00046029137,0.00016435342],"category_scores_gemma":[0.00007883449,0.00041484786,0.00004816612,0.0001783311,0.000078313285,0.0002014628,0.000048961643,0.00030361285,0.0000943932],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.000009892,0.000011528683,0.000045892102,0.00005900447,0.000056654473,0.000031608564,0.00017888656,0.010181554,0.0000054706206,0.000060136594,0.98915523,0.00020413518],"study_design_scores_gemma":[0.0009811892,0.00006603377,0.000021313828,0.00040830194,0.00006967454,0.00011470888,0.00038981272,0.11839256,0.00007577998,0.00027428917,0.87823695,0.0009693594],"about_ca_topic_score_codex":0.0003891792,"about_ca_topic_score_gemma":0.00081925024,"teacher_disagreement_score":0.11091826,"about_ca_system_score_codex":0.0000813123,"about_ca_system_score_gemma":0.000063528205,"threshold_uncertainty_score":0.99983037},"labels":[],"label_agreement":null},{"id":"W7001133330","doi":"","title":"I02 - Intelligent Optimization of Industrial Operations","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Process (computing); Expert system; Work (physics); Automation; Production (economics)","score_opus":0.0375855891573212,"score_gpt":0.22730372272004193,"score_spread":0.18971813356272071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7001133330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075318506,0.000089132634,0.961196,0.00016123471,0.00059759413,0.00012213606,0.000009076989,0.0002317601,0.03006122],"genre_scores_gemma":[0.6730699,0.00017823828,0.3261054,0.000028151813,0.00017814527,0.000011601188,0.000021670454,0.000022673668,0.000384262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960977,0.000009757716,0.00015915066,0.000060156897,0.00008447119,0.000076721306],"domain_scores_gemma":[0.9998009,0.000013574499,0.000010036971,0.00009857857,0.000041399857,0.00003548387],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00004192564,0.000056195928,0.00007238042,0.00006163944,0.000027234708,0.00001623489,0.000059514627,0.00006057115,0.0029729924],"category_scores_gemma":[0.000040998242,0.00005835621,0.000022632648,0.00017580902,0.000014042782,0.000062357,0.0000070199553,0.000073325755,0.000037852034],"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":[5.7967833e-7,0.00001533338,0.000023385743,0.0000023776167,0.000008974873,2.2637822e-7,0.00016695613,0.9907308,0.00020366811,0.00026303213,0.0009933164,0.0075913533],"study_design_scores_gemma":[0.00015684802,0.000012178377,0.0000014443149,0.000009318189,0.0000061315563,9.73567e-7,0.000035247835,0.99450326,0.0048920875,0.000018952524,0.0003030006,0.00006057069],"about_ca_topic_score_codex":0.0000013910108,"about_ca_topic_score_gemma":6.507512e-7,"teacher_disagreement_score":0.665538,"about_ca_system_score_codex":0.000017695085,"about_ca_system_score_gemma":0.000003939669,"threshold_uncertainty_score":0.99793845},"labels":[],"label_agreement":null},{"id":"W7007885591","doi":"","title":"Agent-based manufacturing scheduling: an overview","year":2002,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.04809670682625367,"score_gpt":0.25258959051808205,"score_spread":0.2044928836918284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007885591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60312355,0.0050044963,0.2934184,0.00092842133,0.002590342,0.0004777507,0.00002457887,0.0055041043,0.08892835],"genre_scores_gemma":[0.7527079,0.00019023787,0.24639353,0.00025716168,0.00015366933,0.0000110757155,0.000012949152,0.000046487436,0.00022698351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993619,0.000015365626,0.00013829772,0.00014133487,0.00013760196,0.0002055308],"domain_scores_gemma":[0.9995998,0.000017024091,0.000015196106,0.00023536965,0.00001573224,0.000116876174],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006486455,0.00012147716,0.000107391774,0.00006857327,0.000057866102,0.0000517864,0.0001260154,0.00006305039,0.0028550902],"category_scores_gemma":[0.000010823907,0.00012764889,0.000045086003,0.00009072449,0.000012515537,0.000107165586,0.000008399091,0.00012496395,0.00030801113],"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.0000013749993,0.0000411017,0.000043642853,0.000058603204,0.000016499818,0.000015267235,0.00013014469,0.94867474,0.0010332403,0.00021844245,0.00043344093,0.049333524],"study_design_scores_gemma":[0.0002695585,0.000013567671,0.000098836834,0.00002301665,0.000008191946,0.0000023779082,0.000019164387,0.9813306,0.015010464,0.00011799713,0.0029377034,0.00016856298],"about_ca_topic_score_codex":9.953438e-7,"about_ca_topic_score_gemma":9.248999e-7,"teacher_disagreement_score":0.14958435,"about_ca_system_score_codex":0.000031713058,"about_ca_system_score_gemma":0.0000033141955,"threshold_uncertainty_score":0.9980564},"labels":[],"label_agreement":null},{"id":"W7014747003","doi":"","title":"Production Planning &amp;amp; Control: The Management of Operations:Special issue: Applied Simulation, Planning and Scheduling Techniques in Industry","year":2011,"lang":"en","type":"book","venue":"VBN Forskningsportal (Aalborg Universitet)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Polytechnique Montréal","funders":"","keywords":"Production planning; Scheduling (production processes); Material requirements planning; Production manager; Production (economics); Automated planning and scheduling","score_opus":0.017199223800486278,"score_gpt":0.2355675072550716,"score_spread":0.21836828345458534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7014747003","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075643085,0.003079804,0.15452842,0.0001547635,0.0025209193,0.0050480743,0.00012251458,0.0021088612,0.75679356],"genre_scores_gemma":[0.41848636,0.00066476775,0.24254586,0.0001956136,0.0065330253,0.00012220885,0.0021961783,0.0006527927,0.3286032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985394,0.000017159797,0.00050319446,0.00039414418,0.00027529887,0.00027081024],"domain_scores_gemma":[0.9992378,0.000044532455,0.00019932385,0.0003234228,0.00012154119,0.00007343204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030017385,0.00037208654,0.00040985376,0.0005202395,0.00019421642,0.000049681497,0.00024653802,0.00057194236,0.00017234303],"category_scores_gemma":[0.000015887252,0.00037812826,0.000063855994,0.00034061164,0.00012213652,0.0002384856,0.000069438654,0.000870425,0.00001491402],"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.000055202618,0.000018341281,0.0006916978,0.00018942957,0.00021040716,0.000016464879,0.0025885005,0.99166584,0.000017029373,0.0014550606,0.0015709562,0.0015210492],"study_design_scores_gemma":[0.006050101,0.00015342631,0.0038956671,0.0093421005,0.0021402242,0.00006693094,0.014342757,0.24266468,0.0012280717,0.0016422519,0.7133027,0.005171144],"about_ca_topic_score_codex":0.000014029226,"about_ca_topic_score_gemma":0.000010457846,"teacher_disagreement_score":0.7490012,"about_ca_system_score_codex":0.00017120471,"about_ca_system_score_gemma":0.00006625603,"threshold_uncertainty_score":0.9998671},"labels":[],"label_agreement":null},{"id":"W7018186952","doi":"","title":"Cooperative scheduling for inter-enterprise manufacturing resource sharing","year":2003,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Job shop scheduling; Shared resource; Resource (disambiguation); Distributed manufacturing","score_opus":0.014329577792860808,"score_gpt":0.23427748092076156,"score_spread":0.21994790312790075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018186952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074568905,0.00008975323,0.8893089,0.000065329674,0.00041561513,0.0002265469,0.000006647128,0.00046859003,0.03484969],"genre_scores_gemma":[0.7199664,0.000009182877,0.27910346,0.00008644155,0.0000887777,0.00004662567,0.00001091059,0.000051573123,0.0006366072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992659,0.0000132761015,0.00018722686,0.00020060103,0.000078239456,0.0002547489],"domain_scores_gemma":[0.99962556,0.000059856353,0.000020590394,0.0001783263,0.00003410095,0.000081585684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016719014,0.0001426142,0.00013690926,0.000077864046,0.0001037547,0.00008461053,0.00012894694,0.00006303176,0.00019178835],"category_scores_gemma":[0.00009123565,0.00014834793,0.000057153014,0.00007264437,0.000015345317,0.00010044439,0.000019762483,0.0001515017,0.000026990389],"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.000016660666,0.0000247682,0.000124446,0.000080314065,0.00007799529,0.0000042427505,0.0010126128,0.9838644,0.0034110453,0.0031000806,0.00049642497,0.0077869627],"study_design_scores_gemma":[0.0006624403,0.000026043212,0.00000805427,0.00008495599,0.0000151052855,0.000008009948,0.0004592891,0.8546208,0.13043766,0.00072614686,0.01267138,0.00028009174],"about_ca_topic_score_codex":5.111851e-7,"about_ca_topic_score_gemma":9.305901e-7,"teacher_disagreement_score":0.64539754,"about_ca_system_score_codex":0.000055634944,"about_ca_system_score_gemma":0.000008510948,"threshold_uncertainty_score":0.6049453},"labels":[],"label_agreement":null},{"id":"W7022201879","doi":"","title":"Cleveland, Ohio","year":2009,"lang":"en","type":"other","venue":"OhioLink ETD Center (Ohio Library and Information Network)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Terrace (agriculture); Road construction; Adventure; Quarter (Canadian coin)","score_opus":0.006068712009394563,"score_gpt":0.18198079350548022,"score_spread":0.17591208149608564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022201879","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018573047,0.0015920529,0.012939842,0.00013439891,0.0012564247,0.00024955024,0.000127725,0.0016648988,0.98203325],"genre_scores_gemma":[0.0032781826,0.085085034,0.20129843,0.019340737,0.014704064,0.0001367957,0.021890827,0.002023879,0.65224206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987618,0.000029897263,0.00047724223,0.00016390171,0.00016307138,0.0004041132],"domain_scores_gemma":[0.9993539,0.000021960313,0.00014905847,0.0002776317,0.000009797684,0.00018765841],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006020409,0.00039388382,0.00034351271,0.0002747289,0.000076844415,0.00025632852,0.0002113268,0.00048006143,0.0024044446],"category_scores_gemma":[0.0000032803312,0.00038261304,0.00008563309,0.00028305012,0.00003146211,0.002554121,0.000055256474,0.0003998304,0.00027224378],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00001473171,0.000013309644,0.000026525853,0.00016244949,0.00008345925,0.0000024373292,0.00008490735,0.019132324,6.4097634e-8,0.06435016,0.8801113,0.03601834],"study_design_scores_gemma":[0.0005779036,0.000021721653,0.000104638064,0.0003398984,0.000016403634,0.000011962713,0.000002424158,0.055820256,0.0000043441246,0.00010453719,0.9425811,0.00041482228],"about_ca_topic_score_codex":2.7927445e-8,"about_ca_topic_score_gemma":3.9615333e-7,"teacher_disagreement_score":0.3297912,"about_ca_system_score_codex":0.000009040511,"about_ca_system_score_gemma":0.000020487745,"threshold_uncertainty_score":0.99986255},"labels":[],"label_agreement":null},{"id":"W7024588946","doi":"","title":"Scheduling an Aircraft Repair Shop","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"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":"Integer programming; Scheduling (production processes); Schedule; Job shop scheduling; Constraint (computer-aided design); Heuristic; Branch and bound; Constraint programming","score_opus":0.02914375978254827,"score_gpt":0.22798740727423672,"score_spread":0.19884364749168845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024588946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14897916,0.00016406219,0.73111343,0.000016576292,0.0007491439,0.00009137966,0.0000013632135,0.0066273054,0.112257555],"genre_scores_gemma":[0.32852924,0.000012049604,0.6709121,0.000061714825,0.0000771633,0.0000046622445,0.0000041227145,0.000025783222,0.00037316178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995158,0.000008198239,0.00012780585,0.00012103218,0.000072152514,0.00015501914],"domain_scores_gemma":[0.999643,0.000007526993,0.0000072327066,0.00021263443,0.000031124935,0.000098454126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000093356764,0.00008908496,0.00007611375,0.000056744557,0.000036247,0.000014179295,0.00008891241,0.000060691782,0.00092836615],"category_scores_gemma":[0.000014119109,0.000085868465,0.000041345367,0.00012007744,0.0000124438275,0.00016689015,0.000010212488,0.00008616373,0.00018010766],"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.000016700289,0.00017835462,0.0075178863,0.00006695189,0.00015092868,0.000036531343,0.0042777965,0.9582107,0.0006445683,0.009725877,0.0009226329,0.018251067],"study_design_scores_gemma":[0.000116968426,0.000019845036,0.00042137687,0.0000054448838,0.0000065386166,0.0000046331525,0.00029896348,0.99584496,0.0028073972,0.000103744875,0.00021925598,0.00015085854],"about_ca_topic_score_codex":0.0000109825605,"about_ca_topic_score_gemma":0.0000059389813,"teacher_disagreement_score":0.17955008,"about_ca_system_score_codex":0.000012770982,"about_ca_system_score_gemma":0.0000068883696,"threshold_uncertainty_score":0.9999849},"labels":[],"label_agreement":null},{"id":"W7026500516","doi":"","title":"Agent-based approach for scheduling of semiconductor fabrication with inter-operation temporal constraints","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Scheduling (production processes); Job shop scheduling; Semiconductor device fabrication; Fabrication","score_opus":0.01931604290884429,"score_gpt":0.2328827640369346,"score_spread":0.2135667211280903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7026500516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061915837,0.000018779056,0.9362706,0.000059093134,0.00006345902,0.00021481697,0.000013593615,0.0001295416,0.0013142581],"genre_scores_gemma":[0.52387637,8.642673e-7,0.47590998,0.000021505473,0.00005597391,0.000024240833,0.00008059684,0.000012322733,0.000018142324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994942,0.00000979866,0.00018247179,0.00011961349,0.0000854025,0.000108521366],"domain_scores_gemma":[0.99967855,0.000021760827,0.00004222557,0.00011383783,0.00010450144,0.000039119608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010391757,0.00009050122,0.00011006951,0.000069147914,0.000030201567,0.000020058325,0.000064865904,0.0000517183,0.000084894535],"category_scores_gemma":[0.000024346646,0.00008365163,0.000029484485,0.000090376416,0.00004159502,0.000099287594,0.0000033018857,0.000062329374,0.0000036542658],"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.000015533704,0.00003885169,0.00032568036,0.00006148941,0.000022824739,7.309929e-8,0.00017621521,0.9595825,0.025673645,0.0001693363,0.00009444103,0.013839415],"study_design_scores_gemma":[0.0006067296,0.00002989092,0.000016598548,0.000019066743,0.000012375531,0.0000012617862,0.00013105333,0.93855184,0.060421992,0.000008175108,0.00010308103,0.00009794469],"about_ca_topic_score_codex":8.116778e-7,"about_ca_topic_score_gemma":8.6408517e-7,"teacher_disagreement_score":0.46196055,"about_ca_system_score_codex":0.000040080417,"about_ca_system_score_gemma":0.00003169637,"threshold_uncertainty_score":0.34112144},"labels":[],"label_agreement":null},{"id":"W7091541872","doi":"10.5683/sp3/i8paz4","title":"Multi-agent-based agile scheduling","year":2025,"lang":"en","type":"dataset","venue":"Borealis","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Agile software development; Scheduling (production processes); Agile manufacturing; Information system; Negotiation; Dynamic priority scheduling","score_opus":0.015773451700561044,"score_gpt":0.2548311581191518,"score_spread":0.23905770641859075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091541872","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.039335e-7,0.00057970977,0.041965034,0.00003654573,0.0007883499,0.00014833317,0.95577645,0.000490126,0.00021464458],"genre_scores_gemma":[0.0000012947036,0.00022673856,0.101560265,0.00024970053,0.00019805106,0.000047136553,0.8975824,0.000027785505,0.00010660512],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988768,0.000027304066,0.00031122955,0.000283505,0.00020752296,0.00029362307],"domain_scores_gemma":[0.9989991,0.000067333196,0.000053883014,0.000689262,0.00007932819,0.00011110414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001152454,0.00032871726,0.0003180494,0.0002755842,0.00007733606,0.0000913017,0.00038264654,0.00039005608,0.00011782985],"category_scores_gemma":[0.0001348223,0.00035547352,0.0001286562,0.0002535838,0.000026076945,0.000039905997,0.00003927558,0.00041042874,0.000018764516],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.0000014678147,0.000020167266,8.557964e-7,0.0001581185,0.00004084305,0.000010554877,0.0000040003806,0.28638518,0.0000017432753,9.407445e-7,0.71300906,0.0003670682],"study_design_scores_gemma":[0.0003056119,0.00000465089,0.0000045334805,0.00012840382,0.00005798612,6.3490063e-7,0.000007709252,0.3238866,0.00007922358,7.6875597e-7,0.6752739,0.00024996002],"about_ca_topic_score_codex":0.0017268572,"about_ca_topic_score_gemma":0.0006909705,"teacher_disagreement_score":0.059595227,"about_ca_system_score_codex":0.00009459999,"about_ca_system_score_gemma":0.00010118808,"threshold_uncertainty_score":0.99988973},"labels":[],"label_agreement":null},{"id":"W7091685481","doi":"10.5683/sp3/jl3sqd","title":"Agent-Based Cooperative Scheduling","year":2025,"lang":"en","type":"dataset","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Two-level scheduling; Scheduling (production processes); Fair-share scheduling; Dynamic priority scheduling; IBM; Round-robin scheduling; Rate-monotonic scheduling; Lottery scheduling","score_opus":0.01144000783745618,"score_gpt":0.2461587556596723,"score_spread":0.2347187478222161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091685481","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010726963,0.00030564747,0.10687282,0.000038979844,0.0013240367,0.00012932337,0.88976514,0.00043869755,0.0011242745],"genre_scores_gemma":[0.0000030919691,0.00013237218,0.056071863,0.00041877737,0.00013507422,0.000030398138,0.94243884,0.000014354725,0.0007552513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991617,0.000021048942,0.00023993105,0.0002225217,0.00014930927,0.00020547688],"domain_scores_gemma":[0.999358,0.00007556756,0.000024073932,0.00038421512,0.000086197746,0.00007192704],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007449893,0.00027633167,0.00026594906,0.00021695488,0.000065238266,0.0000926592,0.00024353413,0.00029109287,0.0009888456],"category_scores_gemma":[0.00007608118,0.00026850303,0.00007426229,0.0003139607,0.000020220776,0.000035749996,0.000027819502,0.00039280878,0.00010794011],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5006485e-7,0.000007329932,1.1011655e-7,0.00006937909,0.00003145759,0.0000033656386,0.0000013865499,0.44629765,5.0053677e-7,0.000004540796,0.5534615,0.00012195545],"study_design_scores_gemma":[0.00018785745,0.0000066577577,1.2318937e-7,0.00008553745,0.000033519693,3.4290164e-7,0.0000119769065,0.4216279,0.00017226333,7.838351e-7,0.57765216,0.00022088767],"about_ca_topic_score_codex":0.000020176773,"about_ca_topic_score_gemma":0.000018148214,"teacher_disagreement_score":0.052673668,"about_ca_system_score_codex":0.000069188754,"about_ca_system_score_gemma":0.00011254598,"threshold_uncertainty_score":0.9999767},"labels":[],"label_agreement":null},{"id":"W70957714","doi":"10.1007/978-3-662-05624-0_3","title":"From FMS to HMS","year":2003,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":15,"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":"Flexibility (engineering); Manufacturing engineering; Automation; Theme (computing); Engineering; Computer-integrated manufacturing; Systems engineering; Process management; Computer science; Management; Mechanical engineering","score_opus":0.012405926664963767,"score_gpt":0.2007693332980732,"score_spread":0.18836340663310944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W70957714","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004514669,0.00028550462,0.12012899,0.000071323164,0.0010090895,0.00007764807,0.000028249035,0.00047244204,0.87792224],"genre_scores_gemma":[0.00002273783,0.00008416619,0.19477479,0.00062528887,0.00037079008,0.000004284936,0.00007343557,0.00010381451,0.8039407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994464,0.0000014335383,0.00015219761,0.00016871707,0.00011622773,0.00011503727],"domain_scores_gemma":[0.9995972,0.000017911814,0.000011885213,0.0002353663,0.000027567063,0.00011010602],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000023661949,0.00019511639,0.00017827399,0.00007796241,0.000015676289,0.000031445852,0.00009523436,0.00022026754,0.005775774],"category_scores_gemma":[0.0000059145136,0.0001961546,0.00005747153,0.000021121916,0.000006127344,0.00001892269,0.00001192729,0.0001606333,0.0024719054],"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.000005427075,0.000010596295,0.0000037841955,0.000039901555,0.00042360325,0.000039056697,0.000461496,0.59198576,0.00003948455,0.051890127,0.31670776,0.03839299],"study_design_scores_gemma":[0.00014591742,0.000012117467,0.0000011010753,0.00006623393,0.000030036683,0.0000017708778,0.000012560744,0.04244562,0.0002517618,0.0033974908,0.9530684,0.000566992],"about_ca_topic_score_codex":0.000008292056,"about_ca_topic_score_gemma":0.00000435301,"teacher_disagreement_score":0.63636065,"about_ca_system_score_codex":0.00003715114,"about_ca_system_score_gemma":0.000006110669,"threshold_uncertainty_score":0.9983048},"labels":[],"label_agreement":null},{"id":"W7099067944","doi":"","title":"Mathematics Education Issues in post-Soviet Kazakhstan: An International Perspective","year":2015,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Curriculum; Kazakh; Ninth; Population; Perspective (graphical); Comparative education","score_opus":0.017888497473513038,"score_gpt":0.29862369808246375,"score_spread":0.28073520060895074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099067944","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36478332,0.0011250095,0.0894114,0.004479154,0.004739177,0.00052205165,0.000021987153,0.0015771197,0.53334075],"genre_scores_gemma":[0.44420677,0.00006376872,0.5530331,0.00019477696,0.00033141623,0.00002093256,0.00006208765,0.000035362307,0.002051739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995905,0.000008386352,0.00011786302,0.000086975284,0.000119952994,0.00007628068],"domain_scores_gemma":[0.9995729,0.000009220895,0.000012200924,0.00010987431,0.00022934974,0.00006645349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010480597,0.00006852653,0.000065105676,0.0001118082,0.00000849835,0.000045874298,0.00010350475,0.00003923933,0.00021872306],"category_scores_gemma":[0.00008669076,0.00006733159,0.000012702897,0.00010417393,0.000008478154,0.00026877894,0.000009042651,0.00006389602,0.00007389242],"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.000027232585,0.0014526548,0.0054307035,0.000052605632,0.00013643356,0.000009267231,0.07771104,0.66962767,0.0003404425,0.21512678,0.008351097,0.021734096],"study_design_scores_gemma":[0.00031105508,0.000030291816,0.0007776586,0.000017831077,0.000004476571,0.0000089468085,0.057460357,0.93666714,0.00042032255,0.0033483123,0.0007699119,0.00018367653],"about_ca_topic_score_codex":0.00009275748,"about_ca_topic_score_gemma":0.000055722558,"teacher_disagreement_score":0.53128904,"about_ca_system_score_codex":0.000114932765,"about_ca_system_score_gemma":0.000056736368,"threshold_uncertainty_score":0.27457026},"labels":[],"label_agreement":null},{"id":"W7099415969","doi":"","title":"Recommended Citation Wang, Shengxuan, &amp;quot;A Linear Programming Approach for Performance Evaluation of Multi-Type Production Lines Applied in Manufacturing Strategies Comparison &amp;quot; (2012). Electronic Theses and Dissertations. Paper 5378. A Linear Programming A","year":2012,"lang":"en","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Windsor; Permission; Production (economics); Linear programming; Citation; Solver","score_opus":0.07173088340692034,"score_gpt":0.324413036380074,"score_spread":0.25268215297315366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099415969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7954071,0.0011017243,0.2007489,0.0000342676,0.0002228114,0.0020324164,0.0000013012656,0.00032556438,0.00012589291],"genre_scores_gemma":[0.5990886,0.00007184258,0.39984843,0.0000038779754,0.00011703508,0.00049461855,0.00028185258,0.000042212396,0.000051487816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805224,0.000072314055,0.0006433788,0.00034547132,0.0003319533,0.000554667],"domain_scores_gemma":[0.9990884,0.00009836819,0.00017503234,0.00023245587,0.00032603752,0.00007971911],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001360926,0.00030769105,0.0003413409,0.00030176292,0.00014500957,0.00008623393,0.00010382879,0.00016176478,0.000019323383],"category_scores_gemma":[0.00018461965,0.0002883865,0.00004993287,0.0004184831,0.000039370556,0.00091106596,0.000018550027,0.00026889503,0.0000037297461],"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.00013248746,0.00054137537,0.0036545317,0.00058479793,0.000102587444,1.3482171e-8,0.008125374,0.76970667,0.004233624,0.00014237933,0.0000111338895,0.21276505],"study_design_scores_gemma":[0.0012851862,0.00009764405,0.003470116,0.000077557976,0.00013897751,0.0000032675105,0.0065120845,0.9687425,0.018134749,0.000026969701,0.0010435961,0.00046734937],"about_ca_topic_score_codex":0.000021734377,"about_ca_topic_score_gemma":0.00026729066,"teacher_disagreement_score":0.21229771,"about_ca_system_score_codex":0.0001365819,"about_ca_system_score_gemma":0.00005873841,"threshold_uncertainty_score":0.99995685},"labels":[],"label_agreement":null},{"id":"W7112777833","doi":"","title":"The Value of Information in Automated Sorting:Leveraging Look-Ahead in Multi-Conveyor Systems with Articulated Robotics for Pick and Place","year":2024,"lang":"en","type":"article","venue":"VBN Forskningsportal (Aalborg Universitet)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"SMT placement equipment; Robotics; Scheduling (production processes); Probabilistic logic; Conveyor belt; Sorting; Information system; Robot; State (computer science)","score_opus":0.006968642227854571,"score_gpt":0.20180210575572677,"score_spread":0.1948334635278722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7112777833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370352,0.00046826704,0.060979053,0.00005190239,0.00023588643,0.000506988,0.000011308985,0.0005630284,0.00014835894],"genre_scores_gemma":[0.9894831,0.000031473286,0.010297202,0.000006530766,0.000008483716,0.000005506564,0.00004526308,0.000023139983,0.00009927505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991674,0.000012959559,0.0003461013,0.00012403037,0.00012130502,0.00022823917],"domain_scores_gemma":[0.9995909,0.00011834964,0.00007600726,0.00009779072,0.00006745949,0.000049497405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024466933,0.00014168139,0.00017619635,0.00029696812,0.00006346141,0.00008498004,0.00008200143,0.000085025385,0.000001482078],"category_scores_gemma":[0.000030084322,0.00011918198,0.000027386543,0.00053625426,0.0000433559,0.00042490152,0.000017281718,0.00014463445,0.0000023962598],"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.000028136334,0.000007976752,0.0027788975,0.0002025166,0.000038211852,0.000013484636,0.0026141172,0.9930953,0.000032101885,0.0009910853,0.000030505227,0.00016767181],"study_design_scores_gemma":[0.0009780114,0.000032058324,0.0013559081,0.00036888308,0.000026520705,0.000009847212,0.004237021,0.99252564,0.0001416164,0.0000059537147,0.00016794118,0.00015057623],"about_ca_topic_score_codex":0.0001458106,"about_ca_topic_score_gemma":0.0000589218,"teacher_disagreement_score":0.052447923,"about_ca_system_score_codex":0.00010319184,"about_ca_system_score_gemma":0.000052770414,"threshold_uncertainty_score":0.48601002},"labels":[],"label_agreement":null},{"id":"W7115008491","doi":"10.1504/ijads.2026.150373","title":"Minimising makespan and total tardiness in no-wait open-shop scheduling problems using metaheuristic algorithms: a narrative review","year":2025,"lang":"en","type":"article","venue":"International Journal of Applied Decision Sciences","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Tardiness; Metaheuristic; Job shop scheduling; Simulated annealing; Particle swarm optimization; Scheduling (production processes); Integer programming; Novelty; Heuristics","score_opus":0.0350360713101105,"score_gpt":0.3502053889591038,"score_spread":0.3151693176489933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115008491","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29457617,0.014861643,0.677297,0.0009017919,0.004106352,0.0006021541,0.0000088129,0.000046398392,0.0075996886],"genre_scores_gemma":[0.32714218,0.0023290764,0.6699792,0.00034204716,0.00015250301,0.0000074561653,0.0000016599524,0.000013964396,0.000031871226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980481,0.00002472695,0.0008450864,0.00023473271,0.0006833466,0.00016401037],"domain_scores_gemma":[0.99873906,0.00034732732,0.00023971344,0.00008837191,0.00051501766,0.000070535185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017241788,0.00015795468,0.0003853117,0.0005959937,0.00010327967,0.0004372461,0.00073743454,0.000052890504,0.000040464114],"category_scores_gemma":[0.00046044026,0.00012950673,0.00005770908,0.00080516346,0.000109207074,0.0004731063,0.00016941942,0.00022273595,0.0000036597953],"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.000067637025,0.000052032352,0.00013570939,0.00007564892,0.00010600928,0.000027485301,0.00065033644,0.9384173,0.0008055999,0.00071174704,0.00018336103,0.05876712],"study_design_scores_gemma":[0.0012132123,0.00003653161,0.00019548544,0.0049481075,0.00003954203,0.0001454807,0.0013964442,0.9872175,0.00041899417,0.0036054722,0.00054829195,0.0002349287],"about_ca_topic_score_codex":0.0000057698944,"about_ca_topic_score_gemma":0.0000027798374,"teacher_disagreement_score":0.058532193,"about_ca_system_score_codex":0.000105512714,"about_ca_system_score_gemma":0.00016625265,"threshold_uncertainty_score":0.5281131},"labels":[],"label_agreement":null},{"id":"W7116967684","doi":"10.1080/00207543.2025.2602898","title":"Integrated scheduling of distributed manufacturing with assembly and distribution: state of the art, challenges, and future directions","year":2025,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Scheduling (production processes); State (computer science); Job shop scheduling; Computer-integrated manufacturing; Distributed manufacturing","score_opus":0.024370724837010676,"score_gpt":0.29892446292201486,"score_spread":0.27455373808500416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116967684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614644,0.0067911297,0.02098886,0.008623467,0.001669038,0.00016557083,0.000060587852,0.000026472228,0.00021049392],"genre_scores_gemma":[0.9872712,0.0087128915,0.0036562053,0.0000028478848,0.00022233199,0.000003324396,0.00001284052,0.00000753398,0.00011085281],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99906045,0.00007096643,0.00028150182,0.000094958865,0.00040420503,0.00008791403],"domain_scores_gemma":[0.9987054,0.00006778896,0.00010116292,0.000090807094,0.0010024154,0.000032417982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062466797,0.00006715999,0.00011932379,0.00021634038,0.00006082838,0.00003080917,0.00014029695,0.000033499415,0.0000034755724],"category_scores_gemma":[0.00016457059,0.000046049285,0.000027002596,0.00025034038,0.000119526216,0.00014103357,0.000039916897,0.00036319537,1.9854713e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008051233,0.00035750848,0.0026437987,0.00056022283,0.0020616322,0.000018124409,0.0021727243,0.31345883,0.009024915,0.0029402617,0.0012852041,0.66467166],"study_design_scores_gemma":[0.004081844,0.0004944099,0.16928545,0.0037576647,0.00018642706,0.00089215406,0.008720385,0.101248346,0.5730879,0.003685007,0.13398832,0.0005721317],"about_ca_topic_score_codex":0.000004523221,"about_ca_topic_score_gemma":0.0000107199285,"teacher_disagreement_score":0.6640995,"about_ca_system_score_codex":0.00007550476,"about_ca_system_score_gemma":0.000067818175,"threshold_uncertainty_score":0.18778354},"labels":[],"label_agreement":null},{"id":"W7117233295","doi":"10.5267/j.ijiec.2025.9.003","title":"Integrated scheduling of multi-objective lot-streaming hybrid flowshop with AGV under dynamic environments","year":2025,"lang":"","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Scheduling (production processes); Dynamic priority scheduling; Automated guided vehicle; Job shop scheduling; Robustness (evolution); Flexible manufacturing system; Two-level scheduling; Fair-share scheduling","score_opus":0.015415521087041487,"score_gpt":0.25249260115186356,"score_spread":0.2370770800648221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117233295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13555026,0.00054860255,0.8580002,0.0003029202,0.005171782,0.00022126926,0.00010046041,0.000054767414,0.00004973417],"genre_scores_gemma":[0.8295329,0.00013468722,0.16978003,0.000022966653,0.00029681134,0.0000053827,0.00006131077,0.000063856445,0.000102019876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698704,0.000073710486,0.0015714394,0.00030376032,0.00073339755,0.00033064172],"domain_scores_gemma":[0.9975886,0.00050674425,0.00066751643,0.00019865058,0.00087290286,0.00016558572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040386376,0.00046328013,0.00063807535,0.0015840635,0.00008915178,0.00017292418,0.00064449635,0.00024901875,0.00004581353],"category_scores_gemma":[0.00055120786,0.00047711798,0.00026214082,0.0008019602,0.00010169596,0.00042890012,0.000092259295,0.0012478648,0.0000050931094],"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.00013883373,0.00026096488,0.00020409923,0.000025707088,0.0025543352,0.000052070096,0.00032976546,0.977681,0.0016898733,0.00018242864,0.000014447169,0.01686652],"study_design_scores_gemma":[0.004755145,0.00014673169,0.0005544369,0.0025588674,0.0002929008,0.00010922362,0.0008834609,0.9860859,0.004087413,0.000036493395,0.00013881619,0.00035063692],"about_ca_topic_score_codex":0.00003567451,"about_ca_topic_score_gemma":0.00000428838,"teacher_disagreement_score":0.69398266,"about_ca_system_score_codex":0.0009690535,"about_ca_system_score_gemma":0.000588713,"threshold_uncertainty_score":0.9997681},"labels":[],"label_agreement":null},{"id":"W7117476694","doi":"10.1016/j.elerap.2025.101571","title":"A reinforcement learning-driven framework for the Q-commerce multi-product unit scheduling problem","year":2025,"lang":"en","type":"article","venue":"Electronic Commerce Research and Applications","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Laurentian University","funders":"Humanities and Social Science Fund of Ministry of Education of China; State Key Laboratory of Fluid Power and Mechatronic Systems; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Job shop scheduling; Scheduling (production processes); Variable neighborhood search; Reinforcement learning; Metaheuristic; Workload; Dynamic priority scheduling; Fair-share scheduling","score_opus":0.04489443385723534,"score_gpt":0.3579772916523766,"score_spread":0.3130828577951412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117476694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005490067,0.0044382615,0.98754704,0.004826812,0.000025232803,0.0014624672,0.000002729398,0.00022021394,0.0009282644],"genre_scores_gemma":[0.8432263,0.0067189997,0.13899276,0.00022197567,0.00027609582,0.005738511,0.00009563218,0.00006981801,0.0046598897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863493,0.000055023833,0.00021829277,0.00026679487,0.00017635415,0.00064858387],"domain_scores_gemma":[0.9983459,0.0009286911,0.000024354624,0.00042134893,0.00019617936,0.00008351135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007252488,0.00014027506,0.00013554476,0.00015591737,0.0010502709,0.00013362514,0.00036912935,0.000075323835,0.000020558455],"category_scores_gemma":[0.0001395589,0.000120313205,0.000043995755,0.00091600284,0.0001251224,0.000052626398,0.00009654893,0.0010978554,0.000015239617],"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.000020634854,0.000077944256,0.00033006433,0.00014081188,0.00016705196,7.230374e-8,0.00025476847,0.67005664,0.00031458496,0.2557465,0.0004632287,0.0724277],"study_design_scores_gemma":[0.0004252481,0.000069134825,0.00016084715,0.000059745373,0.000022632381,0.0000012575426,0.0006308374,0.86121994,0.0004383394,0.005964306,0.13085842,0.00014931709],"about_ca_topic_score_codex":0.000023614355,"about_ca_topic_score_gemma":0.000023812738,"teacher_disagreement_score":0.84855425,"about_ca_system_score_codex":0.000114064336,"about_ca_system_score_gemma":0.00012831797,"threshold_uncertainty_score":0.80779403},"labels":[],"label_agreement":null},{"id":"W7124167003","doi":"10.1109/codit66093.2025.11321812","title":"Permutation in shop scheduling problems with FIFO considerations","year":2025,"lang":"","type":"article","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Cégep de Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flow shop scheduling; Scheduling (production processes); Permutation (music); Job shop scheduling; Task (project management); FIFO (computing and electronics)","score_opus":0.012896250063337113,"score_gpt":0.24021863074623676,"score_spread":0.22732238068289964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124167003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032753933,0.0014240402,0.9229811,0.002695503,0.0006695401,0.000767894,0.000006640972,0.00040282236,0.03829856],"genre_scores_gemma":[0.72266394,0.00011731888,0.27523932,0.00021649928,0.000041652445,0.00006401807,0.000021638074,0.000030629442,0.0016049582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983879,0.000054654254,0.0006011259,0.0003958633,0.00019006831,0.00037039927],"domain_scores_gemma":[0.9991564,0.00023244499,0.000052491912,0.0002635165,0.00021377363,0.000081381615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002605708,0.0002896568,0.00029549826,0.00053862715,0.0001910455,0.0002950078,0.00008492452,0.00019914463,0.0007538506],"category_scores_gemma":[0.00018722766,0.00028955023,0.000047606765,0.0011290549,0.00006226955,0.00031885292,0.000026752812,0.00041152563,0.000053944546],"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.000008125115,0.00006856044,0.0020246152,0.00015181657,0.00007005297,0.0000085783395,0.0011511607,0.9777922,0.000090308255,0.017277949,0.00004826326,0.0013083748],"study_design_scores_gemma":[0.001370292,0.000035905006,0.0005615195,0.00059221336,0.000051362906,0.000008678546,0.00159604,0.99330366,0.0008765113,0.0012061509,0.00006681033,0.00033083637],"about_ca_topic_score_codex":0.00006513931,"about_ca_topic_score_gemma":0.00037780305,"teacher_disagreement_score":0.68991,"about_ca_system_score_codex":0.00017492598,"about_ca_system_score_gemma":0.00031037236,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W7133026883","doi":"","title":"Decision Diagrams and Large Neighbourhood Search for Earliness Tardiness Single Machine Scheduling with Sequence Dependent Setups","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tardiness; Scheduling (production processes); Single-machine scheduling; Integer programming; Job shop scheduling; Scalability; Constraint programming; Linear programming","score_opus":0.024160184902608337,"score_gpt":0.31714212735691377,"score_spread":0.2929819424543054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133026883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38942987,0.004810954,0.601741,0.00023562973,0.0015790852,0.0013952894,0.00029461016,0.00025071495,0.0002628319],"genre_scores_gemma":[0.84553194,0.00083056866,0.14665039,0.000046455876,0.0004050455,0.00038596836,0.0035803744,0.00041545116,0.0021537975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99561775,0.0001299867,0.0007572722,0.0012774433,0.0010992276,0.0011183103],"domain_scores_gemma":[0.9972527,0.0007598671,0.0002947785,0.00067161577,0.0005849251,0.0004361238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009693608,0.00097464904,0.00097603357,0.00048595437,0.0010701357,0.00051355426,0.00052674767,0.0005044089,0.0010872277],"category_scores_gemma":[0.00030023558,0.0009866165,0.00018978606,0.0010099624,0.00006265832,0.0003355193,0.00018377638,0.001245936,0.000016311335],"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.0009743755,0.00033165587,0.0017915668,0.0012778643,0.00034449718,0.000056643657,0.008080726,0.9587753,0.0012859841,0.00043118667,0.000006555494,0.02664369],"study_design_scores_gemma":[0.0042688036,0.00054154056,0.00046180806,0.0007673725,0.00035843396,0.00007651169,0.013790808,0.9737799,0.0042057973,0.000064855565,0.00026030466,0.0014238555],"about_ca_topic_score_codex":0.00037906045,"about_ca_topic_score_gemma":0.0005384589,"teacher_disagreement_score":0.45610207,"about_ca_system_score_codex":0.00037730843,"about_ca_system_score_gemma":0.00027153367,"threshold_uncertainty_score":0.9998259},"labels":[],"label_agreement":null},{"id":"W772046056","doi":"10.1007/978-3-662-48350-3_41","title":"Approximate Deadline-Scheduling with Precedence Constraints","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"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":"Scheduling (production processes); Schedule; Computer science; Mathematical optimization; Job shop scheduling; Annals; Set (abstract data type); Mathematics; Programming language; Operating system","score_opus":0.020394805961642278,"score_gpt":0.23459742814829926,"score_spread":0.21420262218665698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W772046056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000116862095,0.0005214867,0.99151987,0.000048386275,0.0008553483,0.00022318595,0.000008195511,0.00036517155,0.006341525],"genre_scores_gemma":[0.06460555,0.00003430487,0.93470067,0.00011528496,0.0003313758,0.0000069615235,0.000012115425,0.000067238,0.00012651112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805516,0.000007836789,0.00030498832,0.0006060512,0.00059403776,0.0004319264],"domain_scores_gemma":[0.99890494,0.00011657837,0.00008336316,0.00046106832,0.00024972035,0.00018430715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004382569,0.0004057182,0.00035943868,0.00034308442,0.00008611258,0.00019065538,0.00065022067,0.00024450687,0.0000468144],"category_scores_gemma":[0.000056840392,0.00035254195,0.000039922943,0.0003047492,0.0006540995,0.00018586614,0.00011391593,0.00065730733,0.000029955754],"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.0000030979552,0.0000037766365,0.0000130543585,0.000034114644,0.000008731961,0.000021813306,0.00020630963,0.87774736,0.000013131342,0.0003299785,0.0000026243185,0.121616],"study_design_scores_gemma":[0.00024404466,0.00005062031,0.0000035721991,0.00044878563,0.000010295562,0.00008381044,5.7046594e-7,0.9936797,0.00054412644,0.0043700947,0.00008933437,0.00047507245],"about_ca_topic_score_codex":0.000002170803,"about_ca_topic_score_gemma":0.0000133693775,"teacher_disagreement_score":0.12114093,"about_ca_system_score_codex":0.00019077485,"about_ca_system_score_gemma":0.00027400203,"threshold_uncertainty_score":0.99989265},"labels":[],"label_agreement":null},{"id":"W784714403","doi":"10.71781/26695","title":"Les systèmes Xer à une seule recombinase","year":2012,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Recombinase; Philosophy; Biology; Genetics; Recombination","score_opus":0.0358627632657459,"score_gpt":0.2989069972687602,"score_spread":0.2630442340030143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W784714403","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49880043,0.008805777,0.009304328,0.0007070096,0.015160927,0.0018397556,0.00023094173,0.00005393306,0.46509692],"genre_scores_gemma":[0.23475064,0.0002815099,0.4882999,0.000018091703,0.00072858325,0.00011960092,0.0043908926,0.0002716889,0.2711391],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848783,0.00006775247,0.0004654548,0.00036618323,0.0001950167,0.00041777463],"domain_scores_gemma":[0.9990565,0.00008093761,0.00016494471,0.00034984457,0.00013834058,0.00020940157],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030259398,0.0003977413,0.00045012688,0.00012457269,0.00021135945,0.00035322082,0.00049406843,0.00053132814,0.016550085],"category_scores_gemma":[0.000062384526,0.000444059,0.00011208958,0.00034952848,0.000027529955,0.0003477445,0.000059697082,0.0004167364,0.0065054297],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050759085,0.0002844183,0.0008404346,0.00039126983,0.00034844133,0.000029489393,0.014671298,0.08423147,0.0004999465,0.00049038173,0.0010576163,0.89710444],"study_design_scores_gemma":[0.0061808466,0.00033974825,0.02645607,0.006608929,0.0024609123,0.00012936686,0.037824262,0.5113811,0.08773347,0.00048751026,0.313523,0.0068748025],"about_ca_topic_score_codex":0.0020697224,"about_ca_topic_score_gemma":0.0007774498,"teacher_disagreement_score":0.89022964,"about_ca_system_score_codex":0.00017003974,"about_ca_system_score_gemma":0.00009351569,"threshold_uncertainty_score":0.9998011},"labels":[],"label_agreement":null},{"id":"W838194035","doi":"","title":"Stochastic Search for Multiprocessor Scheduling","year":2003,"lang":"en","type":"article","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Scheduling (production processes); Multiprocessor scheduling; Mathematical optimization; Dynamic priority scheduling; Two-level scheduling; Operating system; Schedule","score_opus":0.011997938728699352,"score_gpt":0.20220223447251837,"score_spread":0.190204295743819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W838194035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20468006,0.0017791557,0.78641593,0.0003323787,0.00049593044,0.00062760484,0.00013444335,0.0012240747,0.004310444],"genre_scores_gemma":[0.82205576,0.0006129422,0.17433658,0.00029243834,0.00029746137,0.000023225386,0.00018126846,0.000188392,0.0020119506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685055,0.00014744807,0.00041171597,0.0007496249,0.0004281751,0.0014125004],"domain_scores_gemma":[0.9978935,0.00031521238,0.00013023349,0.0005672176,0.00031771968,0.0007761071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004888362,0.0006548182,0.0005482152,0.00074949325,0.0012821751,0.00023454751,0.00097489153,0.0006423376,0.00029903924],"category_scores_gemma":[0.00015563046,0.000846282,0.00039197423,0.0013341714,0.00026098973,0.001161347,0.00016810272,0.0007335243,0.00013477613],"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.00039922836,0.0001488217,0.00049514865,0.0002661561,0.0002630193,0.00016543693,0.0052451133,0.96806824,0.0013408961,0.018397612,0.0016420238,0.0035683005],"study_design_scores_gemma":[0.009047621,0.00012434502,0.00047021295,0.00028821832,0.0002769615,0.00037910568,0.015996492,0.9505826,0.0065563126,0.00042294688,0.014547082,0.0013080577],"about_ca_topic_score_codex":0.000088939756,"about_ca_topic_score_gemma":0.00004375366,"teacher_disagreement_score":0.6173757,"about_ca_system_score_codex":0.0010494961,"about_ca_system_score_gemma":0.00081801845,"threshold_uncertainty_score":0.99939877},"labels":[],"label_agreement":null},{"id":"W879605811","doi":"","title":"Lp-Based Approximation Algorithms For Scheduling And Inventory Management Problems","year":2012,"lang":"en","type":"dissertation","venue":"eCommons (Cornell University)","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Algorithm; Mathematical optimization; Operations research; Mathematics","score_opus":0.029422444311829145,"score_gpt":0.20429029476054686,"score_spread":0.17486785044871772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W879605811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09415386,0.0026758383,0.8585864,0.000027139184,0.0034318476,0.0026582305,0.000121465404,0.0016072552,0.036738016],"genre_scores_gemma":[0.5285065,0.0013142767,0.43692994,0.000057249363,0.00065297744,0.00011753439,0.009038721,0.00050597085,0.022876784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904835,0.000024939454,0.00020959575,0.00031731938,0.00009289041,0.00030689704],"domain_scores_gemma":[0.99939436,0.000040888444,0.000106894695,0.0002375684,0.00007828283,0.00014201897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015428141,0.0002987156,0.00025747783,0.00041739194,0.00016057306,0.000053442185,0.00019177841,0.0002806409,0.00003861138],"category_scores_gemma":[0.000007421911,0.00038516062,0.00010746015,0.00032127192,0.00002223498,0.00019439343,0.000020108253,0.00023257778,0.000018569677],"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.000042789743,0.000094328265,0.0003022139,0.002028254,0.00024979166,0.0000066950133,0.00039129544,0.9861086,0.000024849258,0.0019889593,0.00024746248,0.008514751],"study_design_scores_gemma":[0.000962866,0.000024588498,0.00041216327,0.00019815631,0.00024685633,7.804424e-7,0.00072463765,0.99426574,0.00018714528,0.00026002014,0.002237003,0.00048003322],"about_ca_topic_score_codex":0.000006591254,"about_ca_topic_score_gemma":0.000050276907,"teacher_disagreement_score":0.43435267,"about_ca_system_score_codex":0.00016167879,"about_ca_system_score_gemma":0.0000232801,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W90914887","doi":"10.1007/978-0-387-36594-7_22","title":"Agent- Based Intelligent Media Distribution in Advertisement","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Western University","funders":"","keywords":"Computer science; Scheduling (production processes); Profitability index; Distribution (mathematics); Advertising; Business; Engineering; Operations management; Mathematics","score_opus":0.02613830665116619,"score_gpt":0.23274313415423992,"score_spread":0.20660482750307374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W90914887","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011245868,0.0005493276,0.7165013,0.00002646029,0.00083917135,0.0001742925,0.000053934313,0.000327212,0.28151706],"genre_scores_gemma":[0.05452519,0.007175194,0.2832087,0.0017456082,0.0024704542,0.00014731791,0.02600727,0.0011150653,0.6236052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990416,0.000003223194,0.00035885876,0.00017636377,0.00023042987,0.00018952448],"domain_scores_gemma":[0.9996166,0.00004363943,0.000029932942,0.00017893413,0.000039673552,0.000091179565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013998996,0.00022714706,0.00019134393,0.00016442644,0.000014227491,0.000016077762,0.00009411705,0.00026051703,0.002183873],"category_scores_gemma":[0.000014504937,0.00023502116,0.00007518064,0.00004423905,0.000016353122,0.000023885563,0.000014944391,0.00025417976,0.00027740133],"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.00002200864,0.00004442523,0.00003868156,0.00015185527,0.000090272595,0.00008883556,0.00013984797,0.8152754,0.0000043151804,0.02749762,0.004644158,0.1520026],"study_design_scores_gemma":[0.00046660684,0.000020034937,0.00009883718,0.0003025906,0.000035433022,0.00000155796,0.00002157417,0.8544902,0.00095851236,0.00047908377,0.1424661,0.00065943366],"about_ca_topic_score_codex":0.0000065339405,"about_ca_topic_score_gemma":0.000065399785,"teacher_disagreement_score":0.4332926,"about_ca_system_score_codex":0.0003345026,"about_ca_system_score_gemma":0.000019509467,"threshold_uncertainty_score":0.9987283},"labels":[],"label_agreement":null},{"id":"W943793448","doi":"10.3233/ica-2002-9304","title":"Holonic coordination and control of an automated guided vehicle system","year":2002,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BC Innovation Council; Simon Fraser University","funders":"KU Leuven","keywords":"Control (management); Computer science; Systems engineering; Embedded system; Engineering; Artificial intelligence","score_opus":0.007836228029168257,"score_gpt":0.19840300864350888,"score_spread":0.19056678061434063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W943793448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41172695,0.00032473585,0.5839146,0.000019348641,0.00046480482,0.00013557641,0.000010828101,0.003332872,0.00007028938],"genre_scores_gemma":[0.9355599,0.0000108038475,0.06426005,0.000010387819,0.0000717003,0.000013157704,0.000016529593,0.000048870268,0.000008560726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903136,0.000027419112,0.00038884825,0.00019099873,0.00013022436,0.00023114824],"domain_scores_gemma":[0.99944097,0.000059531307,0.000048688576,0.0002064577,0.00013219951,0.000112171816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012858669,0.00021671946,0.00029487902,0.00022787813,0.000035193658,0.0000615756,0.00014091488,0.00012693631,0.000011734374],"category_scores_gemma":[0.000021681511,0.00022474136,0.000040574894,0.00038747626,0.000017908034,0.00019788496,0.000013105118,0.00017256102,0.000010711001],"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.0000020764458,0.000017114755,0.0000304245,0.000101681886,0.00006203845,0.000010414193,0.00013531248,0.98813915,0.0063789063,0.00017883535,0.00009365367,0.004850371],"study_design_scores_gemma":[0.0008879768,0.00006900493,0.00028097178,0.00015579938,0.000021848027,0.0000541707,0.00003605334,0.9932456,0.0049792766,0.0000015004733,0.00005223459,0.00021553352],"about_ca_topic_score_codex":0.000019558598,"about_ca_topic_score_gemma":6.8297953e-7,"teacher_disagreement_score":0.523833,"about_ca_system_score_codex":0.00009356238,"about_ca_system_score_gemma":0.00000537474,"threshold_uncertainty_score":0.9164687},"labels":[],"label_agreement":null},{"id":"W965304929","doi":"10.1007/978-1-4615-0373-6_14","title":"Managing and Modelling Financial Flows and Material Flows","year":2003,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"York University","funders":"","keywords":"Material flow; Scheduling (production processes); Computer science; Inventory management; Information flow; Operations research; Material requirements planning; Industrial engineering; Operations management; Production (economics); Engineering; Economics; Microeconomics","score_opus":0.039281535008341244,"score_gpt":0.33268423192683066,"score_spread":0.2934026969184894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W965304929","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020099068,0.00050987815,0.023558434,0.012598649,0.0076901657,0.0051554544,0.0003099692,0.0003795119,0.9296989],"genre_scores_gemma":[0.19700369,0.0681608,0.34838298,0.00044480694,0.0011266585,0.0026636547,0.00070758304,0.00035976843,0.38115007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9904157,0.00014784577,0.0011566925,0.0018317861,0.0050841183,0.0013638434],"domain_scores_gemma":[0.99734265,0.000094240124,0.00004457181,0.0008236568,0.0013613122,0.00033356206],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0085223215,0.0005702925,0.00041224438,0.008435111,0.0022763936,0.004590994,0.0028978623,0.00020026954,0.00083557895],"category_scores_gemma":[0.00037229594,0.000630194,0.00006479611,0.0023837355,0.0038416833,0.0050700004,0.0024776265,0.0012926259,0.00008254867],"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.000047529236,0.00004719536,0.00001957422,0.00007006443,0.000042454125,0.00009636874,0.00036293746,0.59591764,0.00012352038,0.39988068,0.00022978385,0.0031622758],"study_design_scores_gemma":[0.00066757516,0.000073908945,0.0001945635,0.00050798507,0.000011213197,0.000037126138,0.0014454043,0.94119537,0.0001661901,0.016602164,0.03842128,0.0006772352],"about_ca_topic_score_codex":0.00022123322,"about_ca_topic_score_gemma":0.0018699699,"teacher_disagreement_score":0.5485488,"about_ca_system_score_codex":0.0021087069,"about_ca_system_score_gemma":0.00026175726,"threshold_uncertainty_score":0.99961495},"labels":[],"label_agreement":null},{"id":"W968230083","doi":"10.3233/ica-2001-8107","title":"Realizing holonic control with function blocks","year":2001,"lang":"en","type":"article","venue":"Integrated Computer-Aided Engineering","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; National Research Council Canada","funders":"","keywords":"Agile software development; Function (biology); Computer science; Agile manufacturing; Systems engineering; Control (management); Manufacturing engineering; Process management; Software engineering; Engineering; Artificial intelligence","score_opus":0.0050203575477227765,"score_gpt":0.17029944358147087,"score_spread":0.16527908603374808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W968230083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07826185,0.0002599416,0.91762924,0.000039129754,0.00074325246,0.00013609286,0.000004866594,0.0024054693,0.0005201762],"genre_scores_gemma":[0.91224235,0.00004974613,0.087080866,0.000076448654,0.00033513492,0.00003069813,0.00004200158,0.000093147246,0.000049610364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988583,0.000014132503,0.00028984045,0.00025659296,0.00017269279,0.0004084615],"domain_scores_gemma":[0.999392,0.0000646246,0.000032849337,0.00026222933,0.00011098944,0.00013734373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000110814275,0.0003156127,0.00027193132,0.0002460606,0.00006077741,0.00011392338,0.00016643685,0.00013358217,0.000044430904],"category_scores_gemma":[0.000012316742,0.0002885066,0.00006172383,0.00063425413,0.000015488455,0.00017948066,0.000012089856,0.00039656876,0.000030501671],"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.000023150496,0.000012456901,0.00014419187,0.000014921402,0.00012429786,0.000043266096,0.000047469613,0.9890665,0.000590408,0.00012909483,0.00018337241,0.0096209],"study_design_scores_gemma":[0.0009536893,0.00012099997,0.00031416255,0.00014791652,0.000038966202,0.00013956858,0.000032309974,0.99417925,0.00058482646,0.000008500377,0.00312353,0.00035630542],"about_ca_topic_score_codex":0.000032023916,"about_ca_topic_score_gemma":0.0000068367385,"teacher_disagreement_score":0.8339805,"about_ca_system_score_codex":0.00012152789,"about_ca_system_score_gemma":0.000019954128,"threshold_uncertainty_score":0.9999567},"labels":[],"label_agreement":null}]}