{"meta":{"query_hash":"9598dfac4f04","filters":{"venue":"Operational Research"},"cohort_total":25,"direct_labels_cover":0,"predictions_cover":25,"exported":25,"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/9598dfac4f04","api":"https://metacan.xera.ac/api/v1/cohort?venue=Operational+Research"},"results":[{"id":"W1002640774","doi":"10.1007/s12351-015-0190-0","title":"Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Manitoba","funders":"National Natural Science Foundation of China","keywords":"Computational intelligence; Queue; Buffer (optical fiber); Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computer network","score_opus":0.0585801835029579,"score_gpt":0.34571595907665564,"score_spread":0.28713577557369774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002640774","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.09340426,0.000408478,0.49031886,0.3294554,0.00019918206,0.009683719,0.0008348804,0.00087751827,0.07481768],"genre_scores_gemma":[0.9680565,0.000006170565,0.0036375609,0.0014128737,0.0018722364,0.0005353266,0.0031939214,0.000059667647,0.02122575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976102,0.0001826384,0.00029769714,0.00042293887,0.0010550666,0.00043144464],"domain_scores_gemma":[0.99585867,0.001142841,0.00015196807,0.00036025327,0.002448886,0.000037404574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004926324,0.00016120313,0.00024163052,0.0007981724,0.0007920089,0.00074517913,0.0004027553,0.00007567829,0.000096912125],"category_scores_gemma":[0.007817489,0.000103687285,0.000110406465,0.003907361,0.00018197532,0.0014192774,0.0001697512,0.00023046404,0.00012332703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004709698,0.00006563832,0.0001411385,0.000007615856,0.00040180166,0.0000016057439,0.0000991382,0.9104776,0.00003641813,0.08229219,0.005924075,0.00008180612],"study_design_scores_gemma":[0.0010830266,0.000049247516,0.00017697294,0.000022280936,0.00024169142,1.6524423e-7,0.00019504898,0.97565484,0.000021735545,0.014667546,0.00769773,0.00018972096],"about_ca_topic_score_codex":0.0003498261,"about_ca_topic_score_gemma":0.00034328073,"teacher_disagreement_score":0.8746522,"about_ca_system_score_codex":0.00020941625,"about_ca_system_score_gemma":0.00028805528,"threshold_uncertainty_score":0.9358829},"labels":[],"label_agreement":null},{"id":"W1967863088","doi":"10.1007/s12351-011-0106-6","title":"Tail asymptotics for M/M/c retrial queues with non-persistent customers","year":2011,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Carleton University","funders":"","keywords":"Retrial queue; Mathematics; Lemma (botany); Joint probability distribution; Applied mathematics; Scalar (mathematics); Queue; Product (mathematics); Computer science; Queueing theory; Queueing system; Statistics; Computer network","score_opus":0.10422448553669783,"score_gpt":0.33374560155319144,"score_spread":0.2295211160164936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967863088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7029187,0.00010348381,0.011227459,0.003540611,0.0005933368,0.0026039893,0.000028173517,0.00020568936,0.27877852],"genre_scores_gemma":[0.9910093,0.000004577336,0.0027971426,0.0003420879,0.0010689858,0.00011585624,0.00007032596,0.00003241595,0.004559306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984323,0.00002972242,0.00018577269,0.00031127824,0.0006730056,0.0003679394],"domain_scores_gemma":[0.99828947,0.00018381429,0.00005561442,0.00023196705,0.0012160104,0.000023119594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016403331,0.0001190106,0.00015023214,0.00037178837,0.0005789018,0.0002251516,0.000293512,0.00005455405,0.0005621336],"category_scores_gemma":[0.0006874711,0.00009468153,0.00008853732,0.0006791734,0.00017739201,0.0008294376,0.0001092801,0.00019100399,0.00032216316],"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.004517902,0.0005306626,0.005561199,0.00023443255,0.0005979169,0.00003067643,0.00062162476,0.020333957,0.002921249,0.94279516,0.017636245,0.0042189667],"study_design_scores_gemma":[0.01209776,0.0013869181,0.0030565856,0.000448966,0.000752852,0.0000148785975,0.009201308,0.4953322,0.0080112945,0.06746645,0.39958027,0.00265051],"about_ca_topic_score_codex":0.00015789403,"about_ca_topic_score_gemma":0.000104170635,"teacher_disagreement_score":0.8753287,"about_ca_system_score_codex":0.00008369232,"about_ca_system_score_gemma":0.00010170615,"threshold_uncertainty_score":0.6154969},"labels":[],"label_agreement":null},{"id":"W1982108162","doi":"10.1007/bf02941128","title":"Multiple criteria analysis in the context of information imperfections: Processing of additional information","year":2005,"lang":"en","type":"article","venue":"Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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é Laval","funders":"","keywords":"Ambiguity; Context (archaeology); Computer science; Information processing; Process (computing); Computational intelligence; Order (exchange); Adaptation (eye); Bayesian probability; Data mining; Artificial intelligence; Psychology","score_opus":0.21571481054599323,"score_gpt":0.5078727336886218,"score_spread":0.2921579231426286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982108162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91874146,0.00014029007,0.05736252,0.005567532,0.00017758418,0.001661375,0.0034250494,0.000024151233,0.012900045],"genre_scores_gemma":[0.993197,0.0000056218482,0.005777713,0.00026953596,0.000062251835,0.000103906736,0.000522567,0.0000026419411,0.00005874062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99325806,0.00073005323,0.0015106436,0.00016669086,0.004118925,0.00021564898],"domain_scores_gemma":[0.9898219,0.005253109,0.00030594808,0.00038892915,0.0041829883,0.000047135367],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011116284,0.00009358772,0.0002479007,0.0025234292,0.00030440395,0.000634715,0.00073738437,0.0000792235,0.0066535883],"category_scores_gemma":[0.016466435,0.000062896856,0.00011725235,0.004401852,0.00019985922,0.0050945706,0.00012647525,0.00025366276,0.00025235765],"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.0006812669,0.000568991,0.024287196,0.00006121054,0.00012029508,0.0000012419481,0.032430068,0.03641942,0.00465855,0.020898202,0.089773394,0.79010016],"study_design_scores_gemma":[0.0009392395,0.000087054206,0.18232949,0.0000545767,0.000013826718,0.0000074238355,0.012901302,0.70510775,0.0010665475,0.0016299994,0.0957249,0.00013786381],"about_ca_topic_score_codex":0.00017110736,"about_ca_topic_score_gemma":0.0005230167,"teacher_disagreement_score":0.7899623,"about_ca_system_score_codex":0.00010065644,"about_ca_system_score_gemma":0.00039813237,"threshold_uncertainty_score":0.99425447},"labels":[],"label_agreement":null},{"id":"W2091803583","doi":"10.1007/s12351-014-0156-7","title":"Climate-induced catastrophic shifts in pastoralism systems managed under the maximum sustainable yield model","year":2014,"lang":"en","type":"article","venue":"Operational Research","topic":"Ecosystem dynamics and resilience","field":"Environmental Science","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":"Environmental science; Arid; Ecosystem; Precipitation; Grazing; Biomass (ecology); Ecological stability; Climate change; Maximum sustainable yield; Herbivore; Desertification; Vegetation (pathology); Ecology; Atmospheric sciences; Meteorology; Geography; Biology; Geology","score_opus":0.04197141462096572,"score_gpt":0.30578572611242677,"score_spread":0.26381431149146106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091803583","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737068,0.000026632599,0.0016418832,0.0030076308,0.00006981281,0.0006218555,0.000007315878,0.0000113189935,0.020906763],"genre_scores_gemma":[0.9962734,0.000015400365,0.00009106276,0.000112463866,0.000044455657,0.00014352193,0.000011171812,0.000013303063,0.0032952437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748564,0.00033608126,0.00022179949,0.00035039728,0.0009650794,0.0006410027],"domain_scores_gemma":[0.9992181,0.00023197664,0.0000268728,0.00037184812,0.00005477124,0.00009644082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003508766,0.00010201071,0.00011147399,0.00008228706,0.00066724763,0.00026341452,0.00053899596,0.00007520259,0.00016469596],"category_scores_gemma":[0.00012508499,0.00006888802,0.000025008085,0.00040288304,0.00013623928,0.000252074,0.000428278,0.00038377524,0.00034773923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002058269,0.00006626625,0.0033926696,0.000038188307,0.0000033078963,0.000014371955,0.00022206211,0.8043128,0.0043864963,0.18652777,0.0008717457,0.00014367985],"study_design_scores_gemma":[0.00016777666,0.00005263552,0.019046513,0.00003168279,0.0000012343407,0.0000033891902,0.0013217768,0.9758883,0.000034008888,0.002797061,0.0005399057,0.00011570071],"about_ca_topic_score_codex":0.004559338,"about_ca_topic_score_gemma":0.0020230974,"teacher_disagreement_score":0.18373072,"about_ca_system_score_codex":0.0003920027,"about_ca_system_score_gemma":0.00005914745,"threshold_uncertainty_score":0.6892386},"labels":[],"label_agreement":null},{"id":"W2194624903","doi":"10.1007/s12351-015-0216-7","title":"Fuzzy chance-constrained geometric programming: the possibility, necessity and credibility approaches","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","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":"York University","funders":"","keywords":"Credibility; Mathematical optimization; Computational intelligence; Ambiguity; Duality (order theory); Computer science; Credibility theory; Fuzzy logic; Optimization problem; Process (computing); Face (sociological concept); Mathematics; Artificial intelligence","score_opus":0.2686170978067754,"score_gpt":0.3633974369433609,"score_spread":0.09478033913658551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2194624903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73270595,0.003297919,0.09963838,0.010808559,0.000459739,0.0050418973,0.00005019462,0.00086658425,0.14713079],"genre_scores_gemma":[0.9850414,0.000016290955,0.014322331,0.000020855441,0.00009683235,0.00011961364,0.000023853183,0.000012922281,0.00034590162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847823,0.00013756087,0.00019940351,0.00022092472,0.0006513586,0.00031253128],"domain_scores_gemma":[0.99890214,0.0003450934,0.000010819309,0.00022933082,0.0003058003,0.00020679827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034167543,0.00009784315,0.00011691986,0.00012003346,0.00025891146,0.0003434916,0.00018325429,0.000067605324,0.000040245544],"category_scores_gemma":[0.0015119131,0.00006693561,0.000024419103,0.00076804037,0.00034626547,0.00021268548,0.00011680851,0.00033417932,0.000028417779],"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.00013687828,0.0012141607,0.0137893865,0.0010254645,0.00021484865,0.00001455838,0.0075496845,0.04571718,0.0003301946,0.27673513,0.012116853,0.64115566],"study_design_scores_gemma":[0.0014467123,0.00028976455,0.0059774746,0.000045824232,0.00001802523,0.000036707337,0.0036889531,0.92909664,0.00089441467,0.039444495,0.018530283,0.00053069275],"about_ca_topic_score_codex":0.000018094453,"about_ca_topic_score_gemma":0.000018869225,"teacher_disagreement_score":0.88337946,"about_ca_system_score_codex":0.000080653925,"about_ca_system_score_gemma":0.000115481685,"threshold_uncertainty_score":0.33122975},"labels":[],"label_agreement":null},{"id":"W2474290527","doi":"10.1007/s12351-016-0251-z","title":"A new monarch butterfly optimization with an improved crossover operator","year":2016,"lang":"en","type":"article","venue":"Operational Research","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":103,"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":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Crossover; Operator (biology); Benchmark (surveying); Butterfly; Computer science; Swarm intelligence; Mathematical optimization; Metaheuristic; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Ecology","score_opus":0.05427543962770417,"score_gpt":0.36476054377367145,"score_spread":0.3104851041459673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2474290527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015793645,0.00003345874,0.9853568,0.010064213,0.00008636494,0.0006409304,0.000016444035,0.00009810857,0.0021243016],"genre_scores_gemma":[0.065894686,0.00005408517,0.9022592,0.0003263495,0.00037408154,0.00017826425,0.000031407373,0.000047535297,0.030834405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949691,0.0005916848,0.0003484118,0.00093702006,0.0023767708,0.0007770035],"domain_scores_gemma":[0.99521637,0.0005048003,0.000042761178,0.0010386829,0.0025467153,0.00065064844],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020589137,0.00020410797,0.00019083284,0.0004471616,0.00065151515,0.0015556286,0.0016435245,0.0001075526,0.0020404719],"category_scores_gemma":[0.0007893534,0.00012734743,0.000034200617,0.0013463147,0.00020478426,0.0026167887,0.0004968002,0.00032653217,0.0003740407],"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.001902934,0.0014226888,0.0029389248,0.000063339874,0.00027475992,0.00024700255,0.0018807054,0.17540868,0.063383475,0.40375057,0.04381086,0.30491605],"study_design_scores_gemma":[0.0021724778,0.00086601084,0.0006433123,0.000031768916,0.0000020145637,0.000035073303,0.00001925134,0.98446405,0.005284364,0.0007093667,0.0054605496,0.00031174906],"about_ca_topic_score_codex":0.00019246471,"about_ca_topic_score_gemma":0.00002992476,"teacher_disagreement_score":0.8090554,"about_ca_system_score_codex":0.00023374309,"about_ca_system_score_gemma":0.0025324107,"threshold_uncertainty_score":0.99948084},"labels":[],"label_agreement":null},{"id":"W2807367385","doi":"10.1007/s12351-018-0410-5","title":"Formulating the integrated forest harvest-scheduling model to reduce the cost of the road-networks","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Forest Biomass Utilization and Management","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":"Lakehead University","funders":"Natural Resources Canada; Natural Sciences and Engineering Research Council of Canada; Canadian Natural Resources Limited; Ontario Ministry of Natural Resources and Forestry","keywords":"Computational intelligence; Scheduling (production processes); Computer science; Operations research; Mathematical optimization; Artificial intelligence; Engineering; Mathematics","score_opus":0.08130707853938561,"score_gpt":0.3519637063581594,"score_spread":0.27065662781877375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807367385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60805154,0.00013981875,0.34216458,0.009179921,0.000543691,0.0027703247,0.00002485446,0.00009748627,0.0370278],"genre_scores_gemma":[0.99622405,0.0000123281425,0.0010931665,0.00023080669,0.00015455438,0.0001228127,0.000014180269,0.000018697176,0.0021294039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878544,0.00009017914,0.00020485136,0.00012579172,0.0005338771,0.00025984485],"domain_scores_gemma":[0.9990014,0.00012225195,0.000016180484,0.00034589964,0.00046802446,0.000046280005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011630211,0.0000843901,0.000064443775,0.00005807488,0.0005851769,0.00015912594,0.0005136641,0.00004148072,0.00007289887],"category_scores_gemma":[0.00034771074,0.00004108577,0.000035847424,0.0006770201,0.00018397982,0.00010892928,0.00019763612,0.00027255787,0.000030507896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000104439405,0.000008322587,0.00029747208,0.000006027241,0.000015921018,8.958941e-8,0.0003017289,0.94023633,0.001889074,0.048715398,0.0061070872,0.0024120985],"study_design_scores_gemma":[0.00009130667,0.000018363662,0.0062419344,0.00003394645,0.0000026923676,5.8559186e-7,0.00022300304,0.98299044,0.0018346373,0.00023574433,0.008276721,0.00005062199],"about_ca_topic_score_codex":0.00008269531,"about_ca_topic_score_gemma":0.0015182771,"teacher_disagreement_score":0.38817254,"about_ca_system_score_codex":0.0000799263,"about_ca_system_score_gemma":0.00008619345,"threshold_uncertainty_score":0.45007667},"labels":[],"label_agreement":null},{"id":"W2886815464","doi":"10.1007/s12351-018-0415-0","title":"Solving a multi-objective sustainable waste collection problem considering a new collection network","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Waste collection; Heuristic; Data collection; Computational intelligence; Supply chain network; Operations research; Hazardous waste; Meta heuristic; Network planning and design; Reverse logistics; Supply chain; Supply chain management; Municipal solid waste; Artificial intelligence; Waste management; Engineering; Algorithm; Business; Mathematics","score_opus":0.047808935460095334,"score_gpt":0.31450379207285645,"score_spread":0.2666948566127611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886815464","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.16651508,0.0006682314,0.14451633,0.030390836,0.0025924342,0.01791548,0.0000033776103,0.0012406602,0.6361576],"genre_scores_gemma":[0.8114776,0.000014909242,0.010273444,0.0009397121,0.0076429634,0.0005648953,0.00003975945,0.00008296795,0.16896375],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967049,0.00011559026,0.0003536945,0.0006232054,0.001030057,0.0011725633],"domain_scores_gemma":[0.99601024,0.00022643234,0.00009929031,0.00027383032,0.0033401884,0.000050025916],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031787795,0.0002229704,0.00020524685,0.00096404325,0.0033132823,0.0017436,0.00028145456,0.00010754747,0.0011856077],"category_scores_gemma":[0.0014088709,0.00023339977,0.00006319185,0.0038508647,0.00019825337,0.001900694,0.0007002103,0.00039787454,0.00044150374],"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.00057186873,0.00025572616,0.010445318,0.000432048,0.0001804766,0.00010194461,0.0013360655,0.024125963,0.00077127875,0.20221473,0.7581414,0.001423199],"study_design_scores_gemma":[0.0037365723,0.00028252727,0.004538826,0.00021727831,0.000050379327,0.000014051318,0.031204036,0.4686284,0.0007212309,0.042229176,0.44752067,0.0008568253],"about_ca_topic_score_codex":0.01129482,"about_ca_topic_score_gemma":0.0033416327,"teacher_disagreement_score":0.64496255,"about_ca_system_score_codex":0.0009994337,"about_ca_system_score_gemma":0.0008688352,"threshold_uncertainty_score":0.9997274},"labels":[],"label_agreement":null},{"id":"W2891565222","doi":"10.1007/s12351-018-0424-z","title":"Effects of non-normal quality data on the integrated model of imperfect maintenance, early replacement, and economic design of $${\\bar{X}}$$-control charts","year":2018,"lang":"en","type":"article","venue":"Operational Research","topic":"Reliability and Maintenance Optimization","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control chart; Normality; Reliability engineering; Computer science; Quality (philosophy); Reliability (semiconductor); Imperfect; \\bar x and R chart; Sample (material); Control (management); Control limits; Process (computing); Statistics; Mathematics; Engineering; Power (physics)","score_opus":0.05567758386509606,"score_gpt":0.32665989470964635,"score_spread":0.27098231084455027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891565222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8487327,0.000035608755,0.14849743,0.00017586994,0.00005697883,0.0009430334,0.00017108613,0.000009989545,0.0013773106],"genre_scores_gemma":[0.99791116,0.00015994352,0.0016423994,0.000015302716,0.000031144857,0.000048278012,0.000023779774,0.000012131006,0.00015587095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987428,0.00024108525,0.00034302732,0.00020655613,0.00027302717,0.00019350364],"domain_scores_gemma":[0.9982005,0.00086244603,0.00004972667,0.00045149308,0.00039774852,0.00003812539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032102887,0.00009119326,0.0001968282,0.00010766275,0.000077450684,0.000023231925,0.00028641554,0.00005918288,0.000049982795],"category_scores_gemma":[0.00076033804,0.00006385382,0.00002243216,0.00012908502,0.00032146607,0.00026488365,0.00007613963,0.00016763966,0.000007241421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012503905,0.00010357784,0.00062647986,0.0002939454,0.00012216627,2.8040068e-7,0.00055878627,0.6907216,0.27953827,0.022811629,0.0032380624,0.00073482643],"study_design_scores_gemma":[0.0006113472,0.00037712866,0.0019212004,0.00007850079,0.0000055148307,2.8721058e-7,0.000029257257,0.9382015,0.058492735,0.00020007076,0.000025910527,0.00005657349],"about_ca_topic_score_codex":0.00019035532,"about_ca_topic_score_gemma":0.000016724209,"teacher_disagreement_score":0.2474799,"about_ca_system_score_codex":0.00006084579,"about_ca_system_score_gemma":0.00016858114,"threshold_uncertainty_score":0.2603883},"labels":[],"label_agreement":null},{"id":"W2912136880","doi":"10.1007/s12351-019-00451-x","title":"A light robust model for aggregate production planning with consideration of environmental impacts of machines","year":2019,"lang":"en","type":"article","venue":"Operational Research","topic":"Optimization and Mathematical Programming","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","funders":"","keywords":"Aggregate planning; Production (economics); Aggregate (composite); Computer science; Production planning; Environmental pollution; Computational intelligence; Sensitivity (control systems); Variable (mathematics); Product (mathematics); Operations research; Control (management); Function (biology); Risk analysis (engineering); Mathematical optimization; Environmental science; Artificial intelligence; Engineering; Economics; Mathematics; Business; Microeconomics","score_opus":0.05105892803399259,"score_gpt":0.3152119319201446,"score_spread":0.264153003886152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912136880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8897254,0.00013820421,0.10758912,0.0002579453,0.000038615322,0.00096162834,0.000019430614,0.000026003956,0.0012436503],"genre_scores_gemma":[0.9639847,0.000011801429,0.035559557,0.0000035697462,0.000018971143,0.000034772434,0.000029371442,0.000013766518,0.00034344717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934334,0.00001570454,0.00015556625,0.00009334478,0.00027946426,0.00011259248],"domain_scores_gemma":[0.99969304,0.00007100203,0.000020616333,0.00008196831,0.00010261645,0.00003075036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030870922,0.00005429363,0.00009340493,0.00008428989,0.000048412243,0.000021996655,0.00003723442,0.000029510335,0.00006106524],"category_scores_gemma":[0.00008656527,0.00004359979,0.000016363598,0.00007502271,0.000027688871,0.00017274341,0.000011062502,0.00007103988,0.0000043108976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038694667,0.000036561316,0.00029874683,0.00016697355,0.000016533755,1.08537996e-7,0.00036163122,0.8916233,0.10462126,0.0023538386,0.00014326756,0.00033906387],"study_design_scores_gemma":[0.00024522634,0.000077104494,0.00008706977,0.000066871144,0.0000030275028,0.000002265204,0.00007403175,0.9584705,0.04066987,0.00022344179,0.000033069828,0.000047512945],"about_ca_topic_score_codex":0.0000014274325,"about_ca_topic_score_gemma":0.000002594738,"teacher_disagreement_score":0.07425934,"about_ca_system_score_codex":0.000029490833,"about_ca_system_score_gemma":0.0000400244,"threshold_uncertainty_score":0.17779478},"labels":[],"label_agreement":null},{"id":"W3006547441","doi":"10.1007/s12351-020-00551-z","title":"Measuring consistency of interval-valued preference relations: comments and comparison","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Alberta","funders":"National Natural Science Foundation of China","keywords":"Consistency (knowledge bases); Preference; Preference relation; Mathematics; Reciprocal; Interval (graph theory); Multiplicative function; Sequential consistency; Causal consistency; Local consistency; Weak consistency; Relation (database); Strong consistency; Statistics; Consistency model; Discrete mathematics; Computer science; Combinatorics; Algorithm; Data mining; Constraint satisfaction problem; Mathematical analysis","score_opus":0.8489374756264574,"score_gpt":0.5710113278039322,"score_spread":0.2779261478225252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006547441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95632267,0.0005609107,0.016371125,0.011528364,0.00014078036,0.0006501063,0.000054965585,0.000022220225,0.014348843],"genre_scores_gemma":[0.9884918,0.000008653873,0.010583206,0.00023596462,0.000042743784,0.000018586938,0.000006982477,0.000007778022,0.00060429226],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99377596,0.0010288307,0.00092287577,0.00048456967,0.003573606,0.00021413747],"domain_scores_gemma":[0.9934806,0.0037741894,0.00012618682,0.00035449897,0.002064708,0.00019979695],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006003712,0.0000950774,0.00029164503,0.00028380685,0.00037158697,0.00045322505,0.0006683924,0.000060210652,0.0016194214],"category_scores_gemma":[0.026819004,0.0000752743,0.000046149464,0.0007954763,0.00026840437,0.00044172152,0.0006058077,0.00034209792,0.00038779702],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012018887,0.00069661037,0.4784028,0.0000965327,0.00015012968,0.00002448133,0.020462472,0.003286238,0.09093151,0.14862648,0.123241924,0.13287893],"study_design_scores_gemma":[0.002416941,0.0005721528,0.25201726,0.00031587342,0.00001246683,0.000010906566,0.005670208,0.67762744,0.008600831,0.02127013,0.031075034,0.0004107385],"about_ca_topic_score_codex":0.00003776486,"about_ca_topic_score_gemma":0.000023064173,"teacher_disagreement_score":0.6743412,"about_ca_system_score_codex":0.000044219654,"about_ca_system_score_gemma":0.00022201118,"threshold_uncertainty_score":0.9992932},"labels":[],"label_agreement":null},{"id":"W3040613025","doi":"10.1007/s12351-020-00583-5","title":"Reliable cross-docking location problem under the risk of disruptions","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Supply Chain Resilience and Risk Management","field":"Business, Management and Accounting","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Computational intelligence; Flow network; Integer programming; Operations research; Supply chain; Lagrangian relaxation; Mathematical optimization; Network planning and design; Supply chain network; Supply network; Risk analysis (engineering); Supply chain management; Engineering; Mathematics; Artificial intelligence; Computer network; Algorithm; Business","score_opus":0.07509801975831788,"score_gpt":0.3635543060252351,"score_spread":0.2884562862669172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040613025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8295866,0.00044216344,0.012579608,0.07714149,0.00020830348,0.0019426141,0.000012643276,0.00009840462,0.077988155],"genre_scores_gemma":[0.9967432,0.000069930014,0.00021104701,0.0011409862,0.0006404324,0.00008133237,0.000035353303,0.0000117047375,0.0010660177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984366,0.000037982863,0.00022674545,0.00023182917,0.00083137304,0.00023544383],"domain_scores_gemma":[0.9987659,0.00014827253,0.00007077621,0.00018970041,0.0008105073,0.000014852684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013712475,0.00007521311,0.00007867855,0.00011085842,0.00086059375,0.0005134596,0.00036016176,0.00003180787,0.00058056344],"category_scores_gemma":[0.00036353956,0.000049052534,0.000040169503,0.0010923694,0.00018967997,0.0007236674,0.00026438784,0.0002444868,0.0005093391],"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.000059450405,0.00010928423,0.11719335,0.00017544004,0.00004686627,0.0000019445467,0.00028030426,0.38726053,0.0006019677,0.46391144,0.02870832,0.001651083],"study_design_scores_gemma":[0.0009243868,0.0000686663,0.24917912,0.00010491524,0.00005126315,8.317677e-7,0.0056956806,0.44646585,0.00047294528,0.027710536,0.26898777,0.00033804763],"about_ca_topic_score_codex":0.0011347067,"about_ca_topic_score_gemma":0.0000975198,"teacher_disagreement_score":0.43620092,"about_ca_system_score_codex":0.000029980614,"about_ca_system_score_gemma":0.00008334711,"threshold_uncertainty_score":0.66190785},"labels":[],"label_agreement":null},{"id":"W3095582500","doi":"10.1007/s12351-020-00612-3","title":"Solving the integrated forest harvest scheduling model using metaheuristic algorithms","year":2020,"lang":"en","type":"article","venue":"Operational Research","topic":"Forest Management and Policy","field":"Environmental Science","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":"Lakehead University","funders":"","keywords":"Metaheuristic; Computer science; Mathematical optimization; Scheduling (production processes); Computational intelligence; Transportation theory; Function (biology); Algorithm; Operations research; Mathematics; Artificial intelligence","score_opus":0.16341042277682608,"score_gpt":0.375260113949023,"score_spread":0.2118496911721969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095582500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858369,0.00010230327,0.045685086,0.021742795,0.000090394205,0.0009344303,0.000026926153,0.00006744811,0.0455137],"genre_scores_gemma":[0.97735083,0.00001309667,0.016842136,0.0009101661,0.0001797139,0.000025987862,0.000027166872,0.000017425944,0.0046334993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827105,0.0001386725,0.00016241876,0.00026696845,0.00081342185,0.00034748472],"domain_scores_gemma":[0.99950105,0.00014119463,0.00001995857,0.0001596438,0.000048808324,0.00012933736],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009297392,0.00009701027,0.00008075629,0.000040457384,0.000724704,0.00031775804,0.00044023912,0.00003429574,0.0024797295],"category_scores_gemma":[0.00057689485,0.000066436056,0.000037149333,0.00057443406,0.00028200712,0.00037549942,0.00043331622,0.00036389308,0.0017486286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014290736,0.000021032845,0.0032631885,0.000005724069,0.000013080724,0.0000051213988,0.0004329198,0.9731028,0.004643457,0.008844089,0.008939683,0.0007145897],"study_design_scores_gemma":[0.000104716135,0.000025171512,0.0011185794,0.0000061588617,0.000005242642,0.0000010939394,0.000055417637,0.9895039,0.00009395379,0.00056919025,0.008435801,0.00008074582],"about_ca_topic_score_codex":0.0010085654,"about_ca_topic_score_gemma":0.00017510923,"teacher_disagreement_score":0.09151389,"about_ca_system_score_codex":0.000120495446,"about_ca_system_score_gemma":0.00008520652,"threshold_uncertainty_score":0.9990286},"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":"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":"W3169507859","doi":"10.1007/s12351-021-00648-z","title":"A robust possibilistic programming approach for blood supply chain network design in disaster relief considering congestion","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"","keywords":"Computer science; Operations research; Supply chain network; Network planning and design; Pooling; Supply chain; Service level; Robust optimization; Service (business); Queueing theory; Facility location problem; Risk analysis (engineering); Supply chain management; Mathematical optimization; Artificial intelligence; Business; Engineering","score_opus":0.1412188528817411,"score_gpt":0.3308354899447773,"score_spread":0.1896166370630362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169507859","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.2323649,0.002738827,0.65461975,0.045191847,0.0011410424,0.011540967,0.000034372875,0.00039686027,0.051971443],"genre_scores_gemma":[0.8977437,0.00003138818,0.09810826,0.00080155913,0.0009420239,0.0007129235,0.0003414268,0.00003351957,0.001285198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981393,0.000147696,0.0003058207,0.00043075165,0.0005710209,0.00040540728],"domain_scores_gemma":[0.997988,0.0008820175,0.000051040286,0.00015498634,0.0009005868,0.000023413317],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032947506,0.00011751177,0.00014881359,0.00020923904,0.00048725994,0.0010783019,0.00012945023,0.00008345231,0.00033174898],"category_scores_gemma":[0.0020107883,0.00011417725,0.00004176746,0.00081035873,0.00007356649,0.0010234124,0.0000913698,0.0003136771,0.000029391023],"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.00077035686,0.0026122166,0.026100112,0.00081185246,0.00015785261,0.0001513057,0.0005463454,0.34666955,0.0029366747,0.5901148,0.0064618704,0.022667084],"study_design_scores_gemma":[0.008012995,0.0001424504,0.014137045,0.00041257218,0.0001408037,0.00006512291,0.0033122073,0.8928022,0.00059898803,0.012491696,0.06700255,0.0008813964],"about_ca_topic_score_codex":0.00012455905,"about_ca_topic_score_gemma":0.0003290841,"teacher_disagreement_score":0.6653788,"about_ca_system_score_codex":0.000029971372,"about_ca_system_score_gemma":0.0002289326,"threshold_uncertainty_score":0.9999587},"labels":[],"label_agreement":null},{"id":"W3201484950","doi":"10.1007/s12351-021-00674-x","title":"Designing pharmaceutical supply chain networks with perishable items considering congestion","year":2021,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kwantlen Polytechnic University; University of British Columbia","funders":"","keywords":"Supply chain; Computer science; Metric (unit); Sensitivity (control systems); Computational intelligence; Job shop scheduling; Production (economics); Scheduling (production processes); Operations research; Mathematical optimization; Greenhouse gas; Supply chain management; Supply chain network; Risk analysis (engineering); Operations management; Business; Economics; Microeconomics; Schedule; Engineering; Artificial intelligence; Mathematics; Marketing","score_opus":0.07239243685779077,"score_gpt":0.33582319408030725,"score_spread":0.26343075722251647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201484950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3799799,0.005189169,0.18558022,0.11555977,0.0017096198,0.006596428,0.000014884704,0.0009740534,0.3043959],"genre_scores_gemma":[0.98613477,0.000037504196,0.0028904502,0.002289938,0.0013982193,0.00022113051,0.00017315586,0.000047494294,0.00680735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733925,0.00012082476,0.00023318757,0.000494074,0.0010594529,0.00075321743],"domain_scores_gemma":[0.9977428,0.00037031376,0.000038344642,0.0002442865,0.0015618379,0.000042434123],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022730485,0.00016821311,0.00016739623,0.00031256658,0.0008255807,0.0016168962,0.00020584067,0.00007122054,0.0028657576],"category_scores_gemma":[0.0007253691,0.00015964179,0.000035650373,0.0011205758,0.00016125782,0.0010893873,0.00038608426,0.0004927374,0.00020258248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005375598,0.00048099685,0.06925642,0.000788417,0.00028342888,0.002626978,0.00023087159,0.47750956,0.008720931,0.3384288,0.08795294,0.013183105],"study_design_scores_gemma":[0.001890371,0.000045236968,0.0059344824,0.00022375883,0.000039334573,0.000040951334,0.0067480174,0.62394184,0.0016271053,0.0010371518,0.35791728,0.00055447855],"about_ca_topic_score_codex":0.00023287305,"about_ca_topic_score_gemma":0.000101376965,"teacher_disagreement_score":0.60615486,"about_ca_system_score_codex":0.00018174101,"about_ca_system_score_gemma":0.00026829052,"threshold_uncertainty_score":0.9994195},"labels":[],"label_agreement":null},{"id":"W4224282464","doi":"10.1007/s12351-022-00704-2","title":"Port-based supply chain decisions considering governmental pollution tax","year":2022,"lang":"en","type":"article","venue":"Operational Research","topic":"Energy, Environment, and Transportation Policies","field":"Energy","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":"York University","funders":"National Natural Science Foundation of China","keywords":"Pollution; Subsidy; Spillover effect; Business; Natural resource economics; Environmental economics; Economics; Environmental science; Microeconomics; Market economy","score_opus":0.056633660930105245,"score_gpt":0.3276580575856032,"score_spread":0.27102439665549793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224282464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93582577,0.00020822763,0.0009678575,0.009719432,0.00023059502,0.0003681793,0.000786728,0.000064115135,0.051829103],"genre_scores_gemma":[0.98789227,0.00003713241,0.0007701998,0.00091447355,0.00009576926,0.00029812747,0.00065122533,0.000026092404,0.009314696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970189,0.00026548697,0.00026385504,0.0002978247,0.0017925429,0.0003614455],"domain_scores_gemma":[0.9992392,0.00031281702,0.00003466295,0.00023083437,0.00005599306,0.00012647796],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008567663,0.00010856252,0.00010391299,0.0001846554,0.0013208108,0.00006751645,0.00019408044,0.000038073627,0.011517364],"category_scores_gemma":[0.00015465781,0.00011592603,0.00006535563,0.00031393758,0.00015546236,0.00013489788,0.00008194478,0.00032596273,0.0001259111],"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.000094738374,0.00026425123,0.003833634,0.000003665624,0.000032009877,0.000045966226,0.00030481452,0.40709075,0.025529893,0.5519108,0.010042465,0.0008470101],"study_design_scores_gemma":[0.0024769008,0.00039442332,0.11697181,0.00002353542,0.00001500889,0.000030199846,0.0038967165,0.020714551,0.02432406,0.004688922,0.8259437,0.00052013906],"about_ca_topic_score_codex":0.0037996604,"about_ca_topic_score_gemma":0.002023415,"teacher_disagreement_score":0.8159013,"about_ca_system_score_codex":0.0006846789,"about_ca_system_score_gemma":0.0002780031,"threshold_uncertainty_score":0.9999793},"labels":[],"label_agreement":null},{"id":"W4367394417","doi":"10.1007/s12351-023-00774-w","title":"A multi-objective constrained partially observable Markov decision process model for breast cancer screening","year":2023,"lang":"en","type":"article","venue":"Operational Research","topic":"Global Cancer Incidence and Screening","field":"Medicine","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":"Mammography; Breast cancer; Breast cancer screening; Markov decision process; Medicine; Computer science; Actuarial science; Cancer; Markov process; Economics; Statistics; Mathematics","score_opus":0.33942649106872147,"score_gpt":0.5076645604168483,"score_spread":0.1682380693481268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367394417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80608535,0.00036580386,0.16852874,0.017089171,0.00017242436,0.003998326,0.0014827154,0.00022388069,0.0020536077],"genre_scores_gemma":[0.96410143,0.00006538369,0.029302392,0.00046471777,0.0002599939,0.0009449568,0.00013559332,0.000027550714,0.0046979557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974036,0.00005182638,0.0002564871,0.0004354649,0.0012702518,0.0005823635],"domain_scores_gemma":[0.99684805,0.00040059641,0.000027814604,0.00017078886,0.0023301025,0.00022264701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017160552,0.00012471895,0.00021055715,0.00019480164,0.0005545624,0.0001144278,0.00016664671,0.00009703069,0.00028952604],"category_scores_gemma":[0.0009897287,0.00010687046,0.00007738084,0.0008009254,0.0001305915,0.00030534793,0.00008075351,0.0002969888,0.000043950084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.016766673,0.00046825994,0.0883587,0.000514495,0.00045114692,0.00020290152,0.0033356538,0.5828658,0.0608001,0.0035878317,0.052097667,0.1905508],"study_design_scores_gemma":[0.0019029259,0.00012365509,0.04787357,0.00035295234,0.000014593424,0.000025809577,0.00068306056,0.94756335,0.00071404694,0.0003902583,0.00023928817,0.00011651857],"about_ca_topic_score_codex":0.00033236473,"about_ca_topic_score_gemma":0.0005840297,"teacher_disagreement_score":0.36469755,"about_ca_system_score_codex":0.0001883762,"about_ca_system_score_gemma":0.0019999056,"threshold_uncertainty_score":0.43580508},"labels":[],"label_agreement":null},{"id":"W4404373439","doi":"10.1007/s12351-024-00868-z","title":"Multi-venue location optimization with overlapping audience reach areas","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Department of National Defence","funders":"","keywords":"Computational intelligence; Computer science; Artificial intelligence","score_opus":0.09804418290431499,"score_gpt":0.34537199596031526,"score_spread":0.24732781305600027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404373439","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.10069544,0.0015860862,0.7746877,0.034595955,0.001521752,0.0028746377,0.000018175575,0.0007892979,0.08323096],"genre_scores_gemma":[0.98944455,0.00004307251,0.0031845225,0.0003890021,0.0005081131,0.0001564475,0.00023420315,0.000019597,0.006020473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983755,0.000027246195,0.0001827874,0.0003713492,0.00079217734,0.00025093564],"domain_scores_gemma":[0.99888843,0.000033152493,0.0000110027695,0.00019531493,0.00085550244,0.000016601762],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011678365,0.000100807905,0.00007203281,0.0003860367,0.00044036563,0.00082028756,0.00018449513,0.00003689023,0.00079159526],"category_scores_gemma":[0.00030141746,0.00008665592,0.000021142101,0.0014287789,0.00008342351,0.0014395402,0.00010277496,0.00018695592,0.0012075562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038488633,0.00012486307,0.0009837692,0.00041446273,0.000034691217,0.0000109724215,0.00017972816,0.8694039,0.0005431673,0.1124773,0.011836239,0.003952444],"study_design_scores_gemma":[0.00014420513,0.000010557259,0.0054515232,0.000121098776,0.0000067287983,0.0000012065684,0.0002005038,0.9469631,0.000015151502,0.0001098743,0.04685753,0.00011857696],"about_ca_topic_score_codex":0.001078352,"about_ca_topic_score_gemma":0.00058695546,"teacher_disagreement_score":0.8887491,"about_ca_system_score_codex":0.000119107935,"about_ca_system_score_gemma":0.00013419375,"threshold_uncertainty_score":0.99957013},"labels":[],"label_agreement":null},{"id":"W4405213157","doi":"10.1007/s12351-024-00873-2","title":"Pareto-optimal peer evaluation in context-dependent DEA","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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; McGill University","funders":"","keywords":"Attractiveness; Context (archaeology); Data envelopment analysis; Computer science; Computational intelligence; Pareto principle; Dominance (genetics); Machine learning; Mathematical optimization; Mathematics; Psychology","score_opus":0.3683363571449461,"score_gpt":0.5589452745761226,"score_spread":0.19060891743117653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405213157","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92716336,0.0034791937,0.006131772,0.027844667,0.0005563364,0.0007512079,0.000038649174,0.00004286936,0.033991944],"genre_scores_gemma":[0.9807552,0.000010575741,0.00029267475,0.000117680225,0.00015893058,0.000092412105,0.000030103585,0.0000104981855,0.01853191],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9824434,0.0016206303,0.00063632836,0.00079619494,0.014101878,0.000401582],"domain_scores_gemma":[0.99153143,0.0039896667,0.000022974968,0.0004998408,0.0038505925,0.0001054865],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.062124148,0.00010240768,0.00018300458,0.0012799689,0.00031416718,0.0018657014,0.0007007413,0.00009173842,0.0057901475],"category_scores_gemma":[0.022517636,0.00007603315,0.00010495906,0.0027729997,0.0001775705,0.0006182736,0.0001831426,0.0005496723,0.004999783],"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.00011595814,0.00039032177,0.010442651,0.000014069782,0.0000987644,0.00018434244,0.0051574307,0.34342125,0.0049223253,0.15551952,0.11065537,0.369078],"study_design_scores_gemma":[0.00023121246,0.00006143229,0.005919444,0.000032881348,0.000008074588,0.0000076984725,0.0013056146,0.9088441,0.0005645089,0.012513261,0.07038995,0.00012182624],"about_ca_topic_score_codex":0.00031630034,"about_ca_topic_score_gemma":0.0013525276,"teacher_disagreement_score":0.56542283,"about_ca_system_score_codex":0.0004317035,"about_ca_system_score_gemma":0.0014949876,"threshold_uncertainty_score":0.9991705},"labels":[],"label_agreement":null},{"id":"W4405807159","doi":"10.1007/s12351-024-00883-0","title":"Product collection structures in closed-loop supply chains","year":2024,"lang":"en","type":"article","venue":"Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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; Dalhousie University","funders":"","keywords":"Channel (broadcasting); Product (mathematics); Dual (grammatical number); Task (project management); Supply chain; Business; Computer science; Industrial organization; Operations research; Marketing; Telecommunications; Mathematics; Economics","score_opus":0.04613425917603377,"score_gpt":0.33962338124471936,"score_spread":0.2934891220686856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405807159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7571106,0.0020410407,0.0006056771,0.08145371,0.0027010138,0.0045127966,0.000013449489,0.00047076438,0.15109096],"genre_scores_gemma":[0.952894,0.00003160044,0.00017600718,0.0004511037,0.0020118428,0.00028234383,0.000122056255,0.000035554414,0.043995544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997617,0.0000618136,0.00023583944,0.0005235948,0.0010501802,0.00051158684],"domain_scores_gemma":[0.9991242,0.00013424698,0.000015758698,0.00022676215,0.00048405875,0.000014941194],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022278973,0.00013967634,0.00011700716,0.0016162776,0.0003856971,0.0015581618,0.00027820483,0.000050720046,0.0020403608],"category_scores_gemma":[0.0006579262,0.00012787116,0.00004004798,0.0027796808,0.00008665868,0.0011670758,0.0002804554,0.00043175076,0.00056211074],"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.000077152625,0.0000949011,0.008546042,0.0005872501,0.000035696114,0.00019331042,0.00019933462,0.003252483,0.0010564107,0.7286902,0.24387105,0.013396163],"study_design_scores_gemma":[0.00057924865,0.000031960895,0.04918419,0.000116121926,0.000010266926,0.0000049414657,0.0017606245,0.12605722,0.00036634255,0.036802668,0.7847246,0.00036184455],"about_ca_topic_score_codex":0.0019987265,"about_ca_topic_score_gemma":0.00088520686,"teacher_disagreement_score":0.69188756,"about_ca_system_score_codex":0.00038024993,"about_ca_system_score_gemma":0.0002706109,"threshold_uncertainty_score":0.99947834},"labels":[],"label_agreement":null},{"id":"W4410930226","doi":"10.1007/s12351-025-00940-2","title":"An accelerated Benders decomposition algorithm for integrated seaside operations planning with berthing preemption","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Maritime Ports and Logistics","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":"Dalhousie University","funders":"","keywords":"Preemption; Benders' decomposition; Computational intelligence; Decomposition; Computer science; Mathematical optimization; Operations research; Decomposition method (queueing theory); Operation planning; Algorithm; Artificial intelligence; Mathematics; Statistics; Operating system; Chemistry","score_opus":0.07833009290925859,"score_gpt":0.410827688518579,"score_spread":0.3324975956093204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410930226","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.02851611,0.000081506565,0.96547467,0.00030556164,0.00009507614,0.00063362456,0.000087105924,0.00013888851,0.0046674414],"genre_scores_gemma":[0.9328732,0.000012881029,0.06344587,0.000081566,0.00010884165,0.0003159686,0.0022395551,0.000025452124,0.00089666154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897325,0.000072726194,0.00019386572,0.000222724,0.0002616562,0.00027575597],"domain_scores_gemma":[0.9988994,0.0001575474,0.000006544309,0.00014584958,0.0007101063,0.00008056931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052596646,0.000120063414,0.00010988149,0.00024894503,0.0005857762,0.0004508061,0.00013064058,0.00008772083,0.00013740592],"category_scores_gemma":[0.00006645935,0.0001039991,0.000019700266,0.000363733,0.000054399246,0.00040640435,0.00001637617,0.00030083483,0.000004827719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000487057,0.00008694052,0.0004016256,0.000046292702,0.000086969776,0.0000062929466,0.00031688256,0.93862617,0.008053763,0.01026607,0.0037156236,0.038344648],"study_design_scores_gemma":[0.00037563528,0.000111485715,0.0011687637,0.00007546141,0.000007730179,0.000003937469,0.0003072027,0.9916464,0.0038135487,0.00026582804,0.0021007347,0.00012324422],"about_ca_topic_score_codex":0.00018376617,"about_ca_topic_score_gemma":0.0002353231,"teacher_disagreement_score":0.9043571,"about_ca_system_score_codex":0.0001688489,"about_ca_system_score_gemma":0.0002539459,"threshold_uncertainty_score":0.4505376},"labels":[],"label_agreement":null},{"id":"W4411458621","doi":"10.1007/s12351-025-00946-w","title":"Assessing the challenges of digital transformation implementation in sustainable financial services using hybrid multi-criteria group decision-making framework","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Business and Economic Development","field":"Environmental Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computational intelligence; Group decision-making; Digital transformation; Group (periodic table); Computer science; Financial services; Transformation (genetics); Process management; Business intelligence; Knowledge management; Business; Management science; Artificial intelligence; Finance; Economics; Psychology","score_opus":0.05555135738016045,"score_gpt":0.4187296603122404,"score_spread":0.36317830293208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411458621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748171,0.00009205322,0.022069745,0.0008247823,0.00006348618,0.00032524706,0.0000055346695,0.000003423434,0.0017986197],"genre_scores_gemma":[0.99444205,0.00003507362,0.0053830403,0.00004966878,0.000016611148,0.00003491216,0.000012538012,0.000004187074,0.000021925478],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99893427,0.000060952152,0.0002870827,0.00017474363,0.0003055278,0.00023740475],"domain_scores_gemma":[0.9995615,0.00024030889,0.000033122917,0.000095334006,0.000053924556,0.000015805701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013458942,0.00006455525,0.000084052415,0.0001130359,0.00035729926,0.00035484947,0.00018762673,0.00003415838,0.00038886452],"category_scores_gemma":[0.00010324233,0.000052445586,0.000017914468,0.00030416762,0.00006943964,0.0015492771,0.00017137964,0.00012674397,0.000010093909],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016084847,0.00051154994,0.10675889,0.00041613771,0.000029153372,0.000017733833,0.011694746,0.032486036,0.0029848593,0.17724125,0.00025560628,0.6674432],"study_design_scores_gemma":[0.0005501307,0.000022015807,0.82907254,0.00038325146,0.0000031014215,0.0000029227376,0.017787013,0.108044684,0.00042198782,0.041792613,0.0017660367,0.00015370562],"about_ca_topic_score_codex":0.00035280376,"about_ca_topic_score_gemma":0.0003352631,"teacher_disagreement_score":0.72231364,"about_ca_system_score_codex":0.00034154244,"about_ca_system_score_gemma":0.00011491546,"threshold_uncertainty_score":0.42577937},"labels":[],"label_agreement":null},{"id":"W4417114302","doi":"10.1007/s12351-025-00988-0","title":"A multi-stage stochastic programming approach for overhaul and supply chain planning of modular physical assets: case study","year":2025,"lang":"en","type":"article","venue":"Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spare part; Modular design; Interdependence; Asset (computer security); Supply chain; Investment (military); Reduction (mathematics); Stochastic programming; Sample (material)","score_opus":0.14761244866642817,"score_gpt":0.41009672133500863,"score_spread":0.26248427266858043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417114302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9388592,0.000095954216,0.056104947,0.0003905342,0.000069001944,0.0033704247,0.000012259078,0.00003355027,0.0010641265],"genre_scores_gemma":[0.9949276,3.5805425e-7,0.0023920378,0.0001627926,0.00024726597,0.0007630188,0.000067378,0.000016484193,0.001423103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985292,0.000040545146,0.00022273119,0.00038600547,0.00050841196,0.00031309662],"domain_scores_gemma":[0.99922395,0.0001599709,0.000044716566,0.00018780328,0.0003670617,0.000016529491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016082937,0.00013185873,0.00019226295,0.00045834619,0.00046078794,0.0003842156,0.00017418874,0.000034929886,0.00002029877],"category_scores_gemma":[0.00032425037,0.000120474775,0.000046195928,0.0004775376,0.000100153855,0.00042707246,0.00032978022,0.00017545371,0.0000024504884],"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.0020618564,0.029825205,0.19100195,0.010551394,0.0021629985,0.0014909118,0.014736965,0.22340655,0.01000625,0.43309125,0.02046991,0.06119476],"study_design_scores_gemma":[0.0019423809,0.00010036545,0.0026512512,0.00005519989,0.000032338732,0.000003234184,0.014445348,0.97401994,0.000025020112,0.00016892157,0.0064051687,0.00015083108],"about_ca_topic_score_codex":0.00060093106,"about_ca_topic_score_gemma":0.000032242217,"teacher_disagreement_score":0.7506134,"about_ca_system_score_codex":0.000048011963,"about_ca_system_score_gemma":0.000055819542,"threshold_uncertainty_score":0.49128187},"labels":[],"label_agreement":null}]}