{"meta":{"query_hash":"bfe3ee414a5f","filters":{"venue":"European Journal of Operational Research"},"cohort_total":518,"direct_labels_cover":0,"predictions_cover":518,"exported":518,"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/bfe3ee414a5f","api":"https://metacan.xera.ac/api/v1/cohort?venue=European+Journal+of+Operational+Research"},"results":[{"id":"W1421911707","doi":"10.1016/j.ejor.2015.07.048","title":"The traveling salesman problem with time-dependent service times","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":49,"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; HEC Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Service (business); Computer science; Mathematical optimization; Quadratic equation; Duration (music); Computation; Measure (data warehouse); Mathematics; Algorithm; Data mining","score_opus":0.07773001912674993,"score_gpt":0.3329230441880737,"score_spread":0.2551930250613238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1421911707","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.2123403,0.0024947128,0.3272483,0.017849615,0.00067852426,0.0011262421,0.000013390458,0.00030209406,0.43794683],"genre_scores_gemma":[0.8264925,0.00010873778,0.16628739,0.00012502518,0.00090823113,0.000004440597,0.000007395097,0.00014599529,0.00592027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969228,0.0012227421,0.00038256738,0.00009194282,0.001129745,0.00025020746],"domain_scores_gemma":[0.99739236,0.000344601,0.00005545294,0.00014761409,0.0018647127,0.00019523331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0116045615,0.00009451428,0.000107608874,0.00009658013,0.00026574897,0.00031428935,0.0004299384,0.00001629604,0.000050963954],"category_scores_gemma":[0.00034993177,0.00005962073,0.00002445893,0.0003410661,0.000056740766,0.00022970725,0.000055827946,0.00057295285,0.00023272532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006817397,0.000016824053,0.000096509175,0.0000101637925,0.00005581217,0.00006698537,0.0007915073,0.9881149,0.0019189746,0.00046637226,0.0046882876,0.0037055034],"study_design_scores_gemma":[0.0035839484,0.0011166917,0.0022011502,0.00037741452,0.00003364043,0.0012315528,0.0015514831,0.91302514,0.0048099947,0.00040995126,0.07114409,0.0005149333],"about_ca_topic_score_codex":0.0000011679914,"about_ca_topic_score_gemma":0.0000026394853,"teacher_disagreement_score":0.6141522,"about_ca_system_score_codex":0.0001049166,"about_ca_system_score_gemma":0.00027003547,"threshold_uncertainty_score":0.40219325},"labels":[],"label_agreement":null},{"id":"W1428828117","doi":"10.1016/j.ejor.2015.06.073","title":"The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Pairwise comparison; Vehicle routing problem; Purchasing; Computer science; Branch and bound; Scheduling (production processes); Traveling purchaser problem; Shortest path problem; Branch and price; Branch and cut; Integer programming; Graph; Operations research; Routing (electronic design automation); Mathematics; Combinatorial optimization; 2-opt; Economics","score_opus":0.10674453579939322,"score_gpt":0.3311792832241026,"score_spread":0.2244347474247094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1428828117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70553726,0.0009521126,0.28906062,0.00064774894,0.000035558278,0.00028869757,0.0000047986646,0.000028556804,0.003444635],"genre_scores_gemma":[0.8393401,0.00007439858,0.16039313,0.000020984768,0.0000838201,0.0000024557473,0.0000021301207,0.000026766347,0.000056225257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997067,0.0015356295,0.0004004412,0.00014199098,0.00061820814,0.00023673086],"domain_scores_gemma":[0.9981752,0.00047309074,0.000054300028,0.00013035322,0.0008999282,0.00026714362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012803467,0.00010895785,0.00014182024,0.00009333423,0.00031347183,0.00021165585,0.00020220135,0.00002134224,0.000006456668],"category_scores_gemma":[0.0007514131,0.000070807226,0.00001911974,0.00025283045,0.0003685008,0.00026049916,0.000074993004,0.0006213302,0.0000031053867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041299697,0.0001965793,0.024978727,0.00015562851,0.00022340956,0.00010919056,0.008634395,0.9092954,0.0028653615,0.0013595616,0.0006865383,0.05108225],"study_design_scores_gemma":[0.0035966148,0.00045111444,0.038199697,0.00014648552,0.000015683014,0.0005014853,0.0022462916,0.95294845,0.00036767113,0.00014811385,0.0011391559,0.00023922633],"about_ca_topic_score_codex":0.0000031462887,"about_ca_topic_score_gemma":0.0000025998388,"teacher_disagreement_score":0.13380283,"about_ca_system_score_codex":0.00006124356,"about_ca_system_score_gemma":0.00017710259,"threshold_uncertainty_score":0.4437452},"labels":[],"label_agreement":null},{"id":"W1507038277","doi":"10.1016/j.ejor.2004.09.027","title":"The non-central chi-square chart with two-stage samplings","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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 New Brunswick","funders":"","keywords":"Chart; Statistics; Statistic; Stage (stratigraphy); Square (algebra); Chi-square test; Mathematics; \\bar x and R chart; Sample (material); Sampling (signal processing); Control chart; Computer science; Control limits; Process (computing); Geometry; Geology; Telecommunications","score_opus":0.2636473634867568,"score_gpt":0.5035383292571186,"score_spread":0.23989096577036179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507038277","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.28158724,0.00033955593,0.6924104,0.008988638,0.0005503428,0.00031791264,0.00003001903,0.000011837543,0.015764069],"genre_scores_gemma":[0.9754744,0.000029867411,0.022047944,0.000072854404,0.00083343,0.0000012051513,0.0000013344118,0.00002013851,0.0015188367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99326295,0.0006744691,0.0007718099,0.00026675913,0.0045170127,0.0005069878],"domain_scores_gemma":[0.99410385,0.002012389,0.00021910257,0.00028948725,0.0030428832,0.00033229],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0112405075,0.00011908323,0.00017408506,0.00020212453,0.0011180358,0.0010414766,0.0012395475,0.000012059379,0.000183847],"category_scores_gemma":[0.008712234,0.000060998937,0.000063580745,0.0006664437,0.00041237485,0.000652757,0.0001299124,0.0009055335,0.00029666652],"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.0030189212,0.0004548907,0.023201626,0.000029812194,0.00018492113,0.003934773,0.005302282,0.6199856,0.0052433945,0.14852996,0.006509897,0.18360393],"study_design_scores_gemma":[0.01379392,0.0065034595,0.6533763,0.00089829427,0.000027675063,0.0015174369,0.011929676,0.00845702,0.006864554,0.07442379,0.22104746,0.0011604038],"about_ca_topic_score_codex":0.000007781925,"about_ca_topic_score_gemma":0.000016877719,"teacher_disagreement_score":0.6938872,"about_ca_system_score_codex":0.00012121516,"about_ca_system_score_gemma":0.0006385563,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W1583403835","doi":"10.1016/j.ejor.2015.06.082","title":"The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":97,"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":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Vehicle routing problem; Benchmark (surveying); Mathematical optimization; Metaheuristic; Routing (electronic design automation); Heuristic; Dimensioning; Integer programming; Algorithm; Mathematics; Engineering; Computer network","score_opus":0.05021214779436636,"score_gpt":0.32654926189105693,"score_spread":0.2763371140966906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583403835","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.11679239,0.0025738825,0.8518676,0.0043850346,0.00014335837,0.0008306072,0.00001560168,0.000102921054,0.023288608],"genre_scores_gemma":[0.70046985,0.0000732187,0.29846263,0.000024561354,0.00024848568,0.0000032785072,0.0000030957951,0.00004262887,0.00067223114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980632,0.0006948264,0.00035012656,0.000099005265,0.00059155613,0.00020128513],"domain_scores_gemma":[0.9972821,0.0010582941,0.00005994552,0.00010232914,0.0013121879,0.00018513812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065737073,0.00008956523,0.00010638483,0.00009458298,0.00039905912,0.00036200281,0.00014721569,0.000015894699,0.0000097904185],"category_scores_gemma":[0.0016005659,0.00006061998,0.000012443731,0.0003099634,0.00013266152,0.00028644872,0.000057041132,0.00036443278,0.000014367083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001270309,0.000052747364,0.001703732,0.00005109901,0.00019357802,0.00009730475,0.0036406496,0.91600686,0.0013827013,0.0035578387,0.0043237214,0.06886272],"study_design_scores_gemma":[0.0013928515,0.00038332844,0.010084873,0.00015139775,0.000016461343,0.0005115024,0.0004996706,0.98181427,0.00009435395,0.00034520507,0.0045434046,0.00016269305],"about_ca_topic_score_codex":0.0000017309774,"about_ca_topic_score_gemma":0.0000010636552,"teacher_disagreement_score":0.5836775,"about_ca_system_score_codex":0.000062446416,"about_ca_system_score_gemma":0.00018289154,"threshold_uncertainty_score":0.34908015},"labels":[],"label_agreement":null},{"id":"W1795817323","doi":"10.1016/j.ejor.2015.10.006","title":"The bipartite quadratic assignment problem and extensions","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","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":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Tabu search; Quadratic assignment problem; Quadratic equation; Bipartite graph; Mathematics; Simple (philosophy); Mathematical optimization; Exponential function; Local search (optimization); Time complexity; Binary number; Polynomial; Exponential family; Combinatorial optimization; Algorithm; Computer science; Combinatorics; Applied mathematics","score_opus":0.13391053166741307,"score_gpt":0.3505228172317594,"score_spread":0.2166122855643463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795817323","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.12132313,0.011323526,0.47187048,0.030728796,0.0012343375,0.0015914252,0.0000064348155,0.00019432536,0.36172754],"genre_scores_gemma":[0.9799109,0.000194856,0.018897042,0.00003589044,0.00014379671,0.0000027946323,7.6391746e-7,0.000019540363,0.0007944185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870306,0.00032183525,0.00027062342,0.000045007695,0.0005166597,0.00014281408],"domain_scores_gemma":[0.99901897,0.00022562842,0.000022466864,0.00007046664,0.00047339613,0.00018907232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041605597,0.0000473758,0.00006352362,0.000061320345,0.00018692906,0.00024684012,0.00011602373,0.000007655454,0.000021000531],"category_scores_gemma":[0.0005879864,0.00002840755,0.000017694783,0.0001183763,0.00008314822,0.00013799133,0.000041731706,0.00024066304,0.000057230678],"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.00013120016,0.0003077569,0.00024138394,0.00013497988,0.00027113626,0.00037511496,0.006549938,0.42158175,0.00822299,0.20385839,0.23134564,0.12697974],"study_design_scores_gemma":[0.0024417173,0.0013009798,0.0010129391,0.00035661133,0.000029213968,0.0005549812,0.0035145697,0.44801188,0.0008377567,0.011833047,0.5297079,0.00039838356],"about_ca_topic_score_codex":2.0602693e-7,"about_ca_topic_score_gemma":5.554286e-7,"teacher_disagreement_score":0.85858774,"about_ca_system_score_codex":0.00003442239,"about_ca_system_score_gemma":0.000060522798,"threshold_uncertainty_score":0.23802851},"labels":[],"label_agreement":null},{"id":"W1823906467","doi":"10.1016/j.ejor.2015.10.058","title":"A two-stage solution method for the annual dairy transportation problem","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Mitacs","keywords":"Computer science; Transportation theory; Operations research; Cluster analysis; Stage (stratigraphy); Order (exchange); Phase (matter); Operations management; Mathematical optimization; Mathematics; Business; Economics; Artificial intelligence","score_opus":0.13481051807414288,"score_gpt":0.41495660487977276,"score_spread":0.2801460868056299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1823906467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002725488,0.00031462937,0.9915999,0.0013692488,0.00021152015,0.0002849011,0.000038775444,0.000027930857,0.0034275658],"genre_scores_gemma":[0.21809374,0.00003620671,0.78016376,0.000055992397,0.0007067015,0.000011589139,0.0000216244,0.000056024914,0.0008543476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972243,0.0011960806,0.00047836828,0.00010153287,0.0007717029,0.00022806948],"domain_scores_gemma":[0.99697053,0.0006719463,0.00007167937,0.00011851938,0.0020281586,0.00013913258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017890954,0.00008828137,0.00011620373,0.00017495049,0.00021173536,0.00012795963,0.00030081868,0.000019902047,0.000032785505],"category_scores_gemma":[0.0007241408,0.00006509253,0.00006850448,0.00030923207,0.000049009737,0.0004018278,0.0000140588445,0.00043099967,0.000015501499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008823481,0.000019519637,0.000049371734,0.000018291214,0.000044357108,0.000012580665,0.0020706279,0.97098875,0.0023322557,0.0032657827,0.010192034,0.010918198],"study_design_scores_gemma":[0.0023943267,0.0004264912,0.0020342355,0.00005597938,0.000026199436,0.00005572436,0.0019408567,0.9117861,0.0014505896,0.00028036587,0.079380475,0.00016865185],"about_ca_topic_score_codex":0.000005085978,"about_ca_topic_score_gemma":0.000005657351,"teacher_disagreement_score":0.21536824,"about_ca_system_score_codex":0.00011277608,"about_ca_system_score_gemma":0.00022318287,"threshold_uncertainty_score":0.6200683},"labels":[],"label_agreement":null},{"id":"W1843716693","doi":"10.1016/j.ejor.2016.04.065","title":"Large neighborhood search for multi-trip vehicle routing","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":60,"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":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS; National Natural Science Foundation of China","keywords":"Vehicle routing problem; Heuristics; Computer science; Benchmark (surveying); Routing (electronic design automation); Mathematical optimization; Heuristic; Set (abstract data type); Local search (optimization); Artificial intelligence; Mathematics; Computer network","score_opus":0.13418820472179713,"score_gpt":0.3940342656961502,"score_spread":0.25984606097435303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1843716693","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.06560527,0.00019081807,0.92957115,0.00096854765,0.00023388078,0.00021760225,0.000029549887,0.000046671565,0.0031364919],"genre_scores_gemma":[0.9160451,0.00006536191,0.08231664,0.000040142277,0.000654998,0.0000034420036,0.0000029205778,0.00007540903,0.0007959526],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680334,0.0011802525,0.000572143,0.00015536435,0.0007813974,0.00050749566],"domain_scores_gemma":[0.9971993,0.00086255145,0.000053762313,0.00017162944,0.0015076438,0.00020509375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013230037,0.00011654838,0.0001696063,0.00030377888,0.00029269513,0.00014921892,0.00042233118,0.000033115255,0.00019286822],"category_scores_gemma":[0.0018069575,0.000084201856,0.0000986112,0.0003263177,0.000057330737,0.00037833108,0.000088586174,0.00041512624,0.000112607144],"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.00050879346,0.0006172917,0.017608875,0.0002112379,0.00051796646,0.00038663513,0.0044014393,0.2580922,0.49422354,0.04016167,0.017704686,0.16556567],"study_design_scores_gemma":[0.009397608,0.0007531164,0.019701468,0.00043908335,0.00001797943,0.00014842892,0.0005851103,0.9023869,0.044876073,0.00011216476,0.021090688,0.00049139577],"about_ca_topic_score_codex":3.5816936e-7,"about_ca_topic_score_gemma":4.381891e-7,"teacher_disagreement_score":0.85043985,"about_ca_system_score_codex":0.00016181465,"about_ca_system_score_gemma":0.00015807462,"threshold_uncertainty_score":0.4585293},"labels":[],"label_agreement":null},{"id":"W1848719272","doi":"10.1016/j.ejor.2015.10.046","title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":50,"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; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pickup; FIFO and LIFO accounting; Benchmark (surveying); Computer science; Stack (abstract data type); Vehicle routing problem; Mathematical optimization; Travelling salesman problem; Position (finance); Shortest path problem; Path (computing); Algorithm; Routing (electronic design automation); Mathematics; Economics; FIFO (computing and electronics); Theoretical computer science; Artificial intelligence; Operating system","score_opus":0.08679891004603106,"score_gpt":0.3286413364171116,"score_spread":0.2418424263710805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848719272","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.4769251,0.0042726733,0.510889,0.0027196144,0.00011987068,0.0010254922,0.00003121392,0.00004839282,0.003968616],"genre_scores_gemma":[0.73824215,0.0003578822,0.26024055,0.00006319056,0.00037423847,0.000004961522,0.0000041380454,0.000060290553,0.00065259944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867165,0.0003951192,0.00023223065,0.00010482116,0.0004216095,0.00017458454],"domain_scores_gemma":[0.99820375,0.00077121943,0.00003780011,0.00007840151,0.0007424372,0.00016641193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060589,0.00008507576,0.00011488241,0.00010352253,0.00019906796,0.00022560694,0.00012332002,0.000016566288,0.000011200062],"category_scores_gemma":[0.0004771974,0.000055123688,0.000014252742,0.00012140482,0.00011619272,0.00025467706,0.000062860236,0.00030236,0.0000045514153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005453875,0.000053529686,0.004911725,0.00010472792,0.00029242272,0.000064062486,0.0041654417,0.8995574,0.0057525835,0.00037750544,0.008710803,0.07546442],"study_design_scores_gemma":[0.0031148372,0.00068253704,0.0074497242,0.000091751295,0.000019582258,0.0003539593,0.0002827639,0.9742057,0.00054889853,0.00008676143,0.013001113,0.00016238172],"about_ca_topic_score_codex":0.000002301379,"about_ca_topic_score_gemma":0.0000012535492,"teacher_disagreement_score":0.26131704,"about_ca_system_score_codex":0.00003364956,"about_ca_system_score_gemma":0.000096504795,"threshold_uncertainty_score":0.22478788},"labels":[],"label_agreement":null},{"id":"W1853087932","doi":"10.1016/j.ejor.2015.08.040","title":"Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":97,"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":"TRIPS architecture; Vehicle routing problem; Computer science; Mutual exclusion; Discretization; Set (abstract data type); Branch and price; Contrast (vision); Duration (music); Mathematical optimization; Dynamic programming; Routing (electronic design automation); Sequence (biology); Operations research; Algorithm; Integer programming; Mathematics; Theoretical computer science; Artificial intelligence; Parallel computing","score_opus":0.1111965887103439,"score_gpt":0.34816726863885056,"score_spread":0.23697067992850668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1853087932","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.07417467,0.0007371271,0.9193482,0.0026122825,0.000158865,0.00072758907,0.000011412419,0.000026178424,0.0022036943],"genre_scores_gemma":[0.84267986,0.000020556694,0.15643334,0.00003023928,0.00026535187,0.0000048781953,0.0000013225457,0.000040170627,0.00052427483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978564,0.0008137525,0.00037008585,0.000090067566,0.0006671921,0.00020250237],"domain_scores_gemma":[0.9978849,0.00057391665,0.00010154138,0.00014041534,0.0012108231,0.00008840073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00966566,0.00008168927,0.00011960017,0.00007948889,0.00025772708,0.000099139055,0.00033410112,0.000018901517,0.000009811237],"category_scores_gemma":[0.0010165124,0.000045502755,0.000043148793,0.0003154542,0.000119262164,0.00020128708,0.000079307756,0.00039583858,0.000006248651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000925451,0.00003642259,0.0009931052,0.000026727064,0.00008228731,0.000003847543,0.001422594,0.97030216,0.014806491,0.0002421793,0.0012790681,0.010712575],"study_design_scores_gemma":[0.0016270085,0.00021801544,0.007770737,0.00010231785,0.000014970586,0.00007990412,0.00014519738,0.9846857,0.0032813412,0.000026523998,0.0019676504,0.0000805942],"about_ca_topic_score_codex":0.0000033119795,"about_ca_topic_score_gemma":9.577672e-7,"teacher_disagreement_score":0.7685052,"about_ca_system_score_codex":0.000073784395,"about_ca_system_score_gemma":0.00017623504,"threshold_uncertainty_score":0.3349944},"labels":[],"label_agreement":null},{"id":"W1902241019","doi":"10.1016/j.ejor.2015.08.033","title":"A new Bayesian approach to multi-response surface optimization integrating loss function with posterior probability","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","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":"University of Calgary","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Robustness (evolution); Computer science; Bayesian optimization; Bayesian probability; Reliability (semiconductor); Mathematical optimization; Multivariate statistics; Machine learning; Artificial intelligence; Mathematics","score_opus":0.3873727016503927,"score_gpt":0.486740999509749,"score_spread":0.09936829785935625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902241019","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16470094,0.00006307018,0.82943016,0.0014021313,0.00014054078,0.00043485503,0.0000035500361,0.000010648789,0.0038141233],"genre_scores_gemma":[0.4091906,4.909356e-7,0.5888735,0.000084748484,0.0001268911,0.0000018800536,0.0000018113167,0.000022537206,0.0016975735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9810716,0.012762787,0.0010713711,0.00049470353,0.0042494955,0.00035007755],"domain_scores_gemma":[0.9919962,0.0013098419,0.00026564635,0.00041500462,0.005166068,0.00084722973],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.062289976,0.00018390943,0.0003012998,0.0005028056,0.00027635568,0.001142208,0.0009708447,0.000035456287,0.00020573547],"category_scores_gemma":[0.019546252,0.0001177795,0.000081242084,0.0015873977,0.00015447175,0.001145633,0.00025543387,0.0005855267,0.00016266554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015324126,0.00039142373,0.0018496558,0.0000040244504,0.000036778023,0.00009373774,0.0054187286,0.9307947,0.028751703,0.00043759242,0.005294857,0.011602687],"study_design_scores_gemma":[0.016930087,0.03668132,0.05747248,0.0005389283,0.000057134894,0.003227124,0.040100716,0.80920345,0.018079802,0.0015132349,0.014432647,0.0017630841],"about_ca_topic_score_codex":0.000017083295,"about_ca_topic_score_gemma":0.000002756976,"teacher_disagreement_score":0.24448964,"about_ca_system_score_codex":0.00034342465,"about_ca_system_score_gemma":0.0016007083,"threshold_uncertainty_score":0.9998947},"labels":[],"label_agreement":null},{"id":"W1923896538","doi":"10.1016/j.ejor.2015.10.060","title":"Dominance-based rough set approach for group decisions","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":96,"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 Resources Canada","keywords":"Dominance-based rough set approach; Decision table; Decision rule; Rough set; Group decision-making; Computer science; Exploit; Decision analysis; Artificial intelligence; Decision maker; Weighted sum model; Decision support system; Optimal decision; Data mining; Machine learning; Mathematics; Operations research; Decision tree; Mathematical economics","score_opus":0.3279272793515331,"score_gpt":0.3991441726020608,"score_spread":0.07121689325052771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1923896538","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003344909,0.00025706194,0.97107565,0.0026505948,0.00022521858,0.00021537564,0.000008548914,0.000010122663,0.022212489],"genre_scores_gemma":[0.48717824,0.00002026625,0.51187783,0.00025351765,0.0004627239,0.0000060383077,0.000010842724,0.0000125295,0.00017801672],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99668986,0.000977786,0.00045012624,0.00023569848,0.0013268194,0.00031971277],"domain_scores_gemma":[0.996953,0.00059824885,0.00010919016,0.0003192,0.0017187888,0.00030159132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011068408,0.0000988371,0.00016347016,0.0002496669,0.00030457185,0.0005157852,0.0014618003,0.000021640557,0.000009315649],"category_scores_gemma":[0.0016719903,0.00006989697,0.000106799016,0.0004548149,0.00009300247,0.00059283443,0.00020277455,0.00036695023,0.000049635837],"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.0010126827,0.0012657647,0.00044424273,0.000028087356,0.000093352806,0.0007129104,0.0026522693,0.109031506,0.0009521585,0.21139286,0.49872175,0.1736924],"study_design_scores_gemma":[0.0073726736,0.004849544,0.004640275,0.000109821514,0.000009694584,0.00040408754,0.0003295743,0.5515643,0.00028239677,0.0074461508,0.4225544,0.0004371184],"about_ca_topic_score_codex":0.0000019858437,"about_ca_topic_score_gemma":3.9716764e-7,"teacher_disagreement_score":0.4838333,"about_ca_system_score_codex":0.00008992141,"about_ca_system_score_gemma":0.00059764145,"threshold_uncertainty_score":0.49737284},"labels":[],"label_agreement":null},{"id":"W1963617203","doi":"10.1016/j.ejor.2003.08.068","title":"An interval-parameter fuzzy two-stage stochastic program for water resources management under uncertainty","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":283,"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; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Stochastic programming; Mathematical optimization; Fuzzy logic; Computer science; Economic shortage; Process (computing); Stage (stratigraphy); Robust optimization; Mathematics; Artificial intelligence","score_opus":0.05360354090258693,"score_gpt":0.3331294540138367,"score_spread":0.27952591311124975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963617203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72364646,0.00008586828,0.26638854,0.0006189633,0.0002302877,0.0009709347,0.000008515193,0.000095463925,0.007954986],"genre_scores_gemma":[0.98117185,0.000011488479,0.017164873,0.00006147431,0.00036857688,0.000025173838,0.00004812685,0.00006080882,0.001087655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981087,0.00024999306,0.000434064,0.00017235002,0.0006515615,0.0003833485],"domain_scores_gemma":[0.9992294,0.00005063398,0.000037312744,0.00018482651,0.00035540076,0.00014247485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022860547,0.00014490285,0.00014328657,0.0004062914,0.00019623373,0.00049358647,0.00045147445,0.000017860197,0.00010364905],"category_scores_gemma":[0.000029794779,0.00010343906,0.00008617423,0.00015404323,0.00007631885,0.00039438918,0.00008555492,0.00028599653,0.00006026936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012067253,0.00010748603,0.0000068872987,0.0000508447,0.0001103791,0.000046817036,0.0009183031,0.9917144,0.0006860822,0.0015945815,0.00040136918,0.0042421627],"study_design_scores_gemma":[0.017328713,0.00737745,0.0037421004,0.00083742687,0.00019105981,0.000095780495,0.00411462,0.82309526,0.0040509477,0.008148446,0.1295451,0.0014730933],"about_ca_topic_score_codex":0.0000028609634,"about_ca_topic_score_gemma":0.000004934029,"teacher_disagreement_score":0.25752535,"about_ca_system_score_codex":0.00014946281,"about_ca_system_score_gemma":0.000011210984,"threshold_uncertainty_score":0.47596657},"labels":[],"label_agreement":null},{"id":"W1965776203","doi":"10.1016/j.ejor.2008.10.037","title":"Incorporating congestion in preventive healthcare facility network design","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":140,"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; McGill University; University of British Columbia","funders":"National Cancer Institute; Public Health Agency","keywords":"Heuristics; Computer science; Facility location problem; Health care; Context (archaeology); Workload; Operations research; Population; Network planning and design; Queueing theory; Operations management; Engineering; Computer network; Medicine","score_opus":0.21817201500764802,"score_gpt":0.3461847430738333,"score_spread":0.12801272806618527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965776203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9172086,0.00065032236,0.04639062,0.018045766,0.0009377559,0.0011825945,0.0000058003566,0.00004251115,0.015536034],"genre_scores_gemma":[0.99651617,0.000053276523,0.0018364621,0.00040080195,0.0007407312,0.0000048821635,0.000018487684,0.0000092493265,0.00041994732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.997197,0.00081646105,0.0006692279,0.00017744044,0.0008756777,0.00026424206],"domain_scores_gemma":[0.99825066,0.00008064865,0.00010721474,0.00012826992,0.0014027768,0.0000304101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011064078,0.000096779,0.00014856587,0.0003675091,0.00042097483,0.00011938027,0.00028910555,0.00001851008,0.00025777286],"category_scores_gemma":[0.0010128916,0.00008808652,0.00005102574,0.00075344706,0.00010834374,0.0009790849,0.0001362105,0.0004525638,0.00040158068],"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.00068964984,0.00049553846,0.06287808,0.00021343374,0.000063828214,0.00063499,0.00082814984,0.8252796,0.00032213362,0.031398904,0.062650904,0.01454478],"study_design_scores_gemma":[0.0026112525,0.00037836496,0.8848425,0.00039841916,0.000014000963,0.000066550434,0.0012076147,0.059450872,0.000042822543,0.0037718038,0.04673144,0.00048435002],"about_ca_topic_score_codex":0.00019106289,"about_ca_topic_score_gemma":0.00013158756,"teacher_disagreement_score":0.82196444,"about_ca_system_score_codex":0.000107330314,"about_ca_system_score_gemma":0.00017400464,"threshold_uncertainty_score":0.5161641},"labels":[],"label_agreement":null},{"id":"W1965880809","doi":"10.1016/j.ejor.2005.06.053","title":"Modeling and analysis of a supply–assembly–store chain","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Assembly Line Balancing Optimization","field":"Engineering","cited_by":19,"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":"Chinese Academy of Sciences; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Supply chain; Markov chain; Computer science; Workstation; Set (abstract data type); Poisson distribution; Safety stock; Process (computing); Product (mathematics); Component (thermodynamics); Markov process; Conveyor system; Industrial engineering; Operations research; Mathematics; Engineering; Business","score_opus":0.03919696098079783,"score_gpt":0.31523302313956847,"score_spread":0.27603606215877063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965880809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8888735,0.0007126237,0.10738334,0.00040405302,0.000038605085,0.0000614835,0.000008155454,0.000012748541,0.0025054638],"genre_scores_gemma":[0.98378474,0.00025485168,0.015569884,0.000013982915,0.00024970513,5.8967646e-7,0.000012602561,0.000023895003,0.00008973242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984091,0.00026141075,0.00047374977,0.000088425,0.00060526986,0.0001620768],"domain_scores_gemma":[0.9989213,0.00010378174,0.00004303789,0.000106301486,0.00072619354,0.00009939519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028291862,0.000078004006,0.00020230109,0.0007675413,0.0000768176,0.00005947936,0.00016619207,0.000019053736,0.000054830998],"category_scores_gemma":[0.0002742772,0.000070440205,0.000066214365,0.00061951234,0.00003131122,0.0002736952,0.000040793548,0.00028939615,0.0000073904607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015565614,0.000018367346,0.0007991927,0.000009947849,0.00019195768,0.000010688431,0.0004570553,0.9874603,0.00814453,0.0003078866,0.00034913787,0.00223535],"study_design_scores_gemma":[0.00024774385,0.00006343902,0.0050155316,0.000034566634,0.000047075104,0.000015325319,0.00008823772,0.99337214,0.0005968859,0.0000041400485,0.00045312944,0.000061754356],"about_ca_topic_score_codex":0.0000026665953,"about_ca_topic_score_gemma":0.000008868965,"teacher_disagreement_score":0.09491123,"about_ca_system_score_codex":0.00007406065,"about_ca_system_score_gemma":0.00006176484,"threshold_uncertainty_score":0.2872468},"labels":[],"label_agreement":null},{"id":"W1966343351","doi":"10.1016/s0377-2217(01)00226-0","title":"Combining expert judgment: On the performance of trimmed mean vote aggregation procedures in the presence of strategic voting","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Royal Military College of Canada","funders":"","keywords":"Ranking (information retrieval); Voting; Computer science; Rank (graph theory); Analytic hierarchy process; Monte Carlo method; Outcome (game theory); Operations research; Range (aeronautics); Econometrics; Management science; Machine learning; Statistics; Mathematics; Economics; Mathematical economics; Engineering","score_opus":0.50191844313981,"score_gpt":0.46403542919210505,"score_spread":0.03788301394770499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966343351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9901889,0.0003151938,0.0001449224,0.0030509287,0.00010455423,0.0002635721,0.0000025576267,0.0000017051466,0.005927644],"genre_scores_gemma":[0.9987886,0.000075333,0.00056714716,0.00014065963,0.00013922302,0.000003266094,4.1460945e-7,0.000011744932,0.00027362685],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872637,0.0049939,0.0016037433,0.00024211849,0.005630965,0.0002656199],"domain_scores_gemma":[0.9897574,0.007218798,0.0006371304,0.00038557802,0.0019393666,0.00006171687],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.038388547,0.00011402955,0.00023917118,0.0006248234,0.0003351279,0.00039112635,0.0019929963,0.000021911812,0.00029694758],"category_scores_gemma":[0.014722472,0.000056238234,0.00009211419,0.0011883806,0.000269978,0.00050694786,0.0001530143,0.00066029123,0.000038569164],"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.0040614447,0.0035525805,0.028347287,0.0001773417,0.00020782083,0.00064375426,0.16224311,0.20126262,0.26342547,0.096808024,0.03848266,0.20078787],"study_design_scores_gemma":[0.0051175593,0.0045783296,0.11359265,0.0037240542,0.000012186635,0.00034143514,0.032199174,0.7991442,0.036045708,0.0018774752,0.002888325,0.00047892134],"about_ca_topic_score_codex":0.0000062899358,"about_ca_topic_score_gemma":0.000008189733,"teacher_disagreement_score":0.59788156,"about_ca_system_score_codex":0.00004080334,"about_ca_system_score_gemma":0.00016653376,"threshold_uncertainty_score":0.99357694},"labels":[],"label_agreement":null},{"id":"W1966716113","doi":"10.1016/j.ejor.2006.02.019","title":"An exact algorithm for a single-vehicle routing problem with time windows and multiple routes","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":203,"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":"Vehicle routing problem; Benchmark (surveying); Computer science; Set (abstract data type); Shortest path problem; Routing (electronic design automation); Mathematical optimization; Path (computing); Algorithm; Euclidean geometry; Mathematics; Theoretical computer science; Graph","score_opus":0.04058463769978288,"score_gpt":0.30744635570674017,"score_spread":0.2668617180069573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966716113","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.22839937,0.00019251627,0.7662514,0.00024377438,0.000044577013,0.00044030274,0.000022622058,0.0000757535,0.0043297037],"genre_scores_gemma":[0.58465,0.0000037438538,0.41473514,0.0000102138865,0.0003741667,0.000002078308,0.000011780658,0.000052462365,0.00016045145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979326,0.0006426281,0.000428427,0.00015961191,0.00053135294,0.00030538783],"domain_scores_gemma":[0.9983571,0.0005001691,0.00007268193,0.00011390698,0.00082382275,0.00013228823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004591458,0.00012499117,0.00016669635,0.00020274031,0.00026316952,0.0003546281,0.00019845417,0.000024718369,0.000026119767],"category_scores_gemma":[0.00021362015,0.000104035746,0.00003385892,0.0002364915,0.00007356752,0.0005160838,0.000029163652,0.00032552634,0.000008615417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006902608,0.000118747674,0.0017875623,0.000024244497,0.000046515503,0.000059634087,0.0003243655,0.8313988,0.1244668,0.00015253609,0.0005174119,0.041034393],"study_design_scores_gemma":[0.0014070156,0.0006896286,0.0035187134,0.00008316957,0.000008242731,0.0001600176,0.00006427254,0.9861697,0.0068179048,0.000035100322,0.00089754496,0.00014868514],"about_ca_topic_score_codex":0.000005752064,"about_ca_topic_score_gemma":0.0000019793229,"teacher_disagreement_score":0.3562506,"about_ca_system_score_codex":0.00008045208,"about_ca_system_score_gemma":0.00007121646,"threshold_uncertainty_score":0.42424548},"labels":[],"label_agreement":null},{"id":"W1967697240","doi":"10.1016/j.ejor.2005.11.039","title":"Locating landfills—Optimization vs. reality","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":60,"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":"Garbage; Computer science; Operations research; Transfer (computing); Environmental science; Mathematics","score_opus":0.09302513005394504,"score_gpt":0.32421883689409114,"score_spread":0.23119370684014612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967697240","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.2025145,0.00031005894,0.13135788,0.039257187,0.0012068986,0.0006013218,0.000007115063,0.00009525479,0.62464976],"genre_scores_gemma":[0.99391395,0.000014850171,0.0015944762,0.0005168206,0.002114447,0.0000017106794,0.000051998482,0.000017180404,0.0017745518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99790335,0.0002027033,0.0005738528,0.00014736479,0.0009578594,0.00021486398],"domain_scores_gemma":[0.99795157,0.00003536148,0.00009312465,0.0001495147,0.0017518755,0.00001856251],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0062365374,0.00008796346,0.000109818866,0.00038977354,0.00035282443,0.0004087637,0.00031711956,0.000014120715,0.0010626758],"category_scores_gemma":[0.00057708746,0.00007543372,0.00005896666,0.00054395956,0.00006669545,0.0009326769,0.00012476972,0.0002468086,0.00051921094],"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.00010028447,0.00019829307,0.0029937834,0.00008581399,0.000018905937,0.000043405737,0.000037358433,0.84199595,0.0002629367,0.039146215,0.1120858,0.003031266],"study_design_scores_gemma":[0.0018579446,0.0001247682,0.12152199,0.00013047355,0.00003173438,0.000022689575,0.00040373454,0.38863292,0.0001024929,0.0012102566,0.48555815,0.00040283875],"about_ca_topic_score_codex":0.00046308467,"about_ca_topic_score_gemma":0.000081775994,"teacher_disagreement_score":0.7913995,"about_ca_system_score_codex":0.000058575657,"about_ca_system_score_gemma":0.00005793103,"threshold_uncertainty_score":0.9998505},"labels":[],"label_agreement":null},{"id":"W1968398251","doi":"10.1016/j.ejor.2013.03.007","title":"Speciality oils supply chain optimization: From a decoupled to an integrated planning approach","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Process Optimization and Integration","field":"Engineering","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":"Université Laval","funders":"","keywords":"Integrated business planning; Supply chain; Supply chain optimization; Context (archaeology); Production planning; Order (exchange); Computer science; Operations research; Production (economics); Incentive; Supply chain management; Business; Microeconomics; Economics; Marketing; Engineering","score_opus":0.06959560429227445,"score_gpt":0.3245760442128401,"score_spread":0.2549804399205656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968398251","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.099824764,0.00015647171,0.88279265,0.0005791801,0.00019281931,0.00028228667,0.000021435497,0.00005530158,0.01609507],"genre_scores_gemma":[0.79983205,0.00005041158,0.19855735,0.00019929899,0.0008062444,0.000013914049,0.00021179409,0.000051742703,0.00027722985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769056,0.0005676159,0.000581346,0.00017621329,0.0007353509,0.0002489448],"domain_scores_gemma":[0.9975343,0.00009570061,0.000056878187,0.00016554863,0.0018185023,0.00032908478],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019150608,0.0001424195,0.00018232381,0.00038945783,0.0001841005,0.0006071828,0.00042910123,0.000037067544,0.0022135135],"category_scores_gemma":[0.0006044695,0.00012008459,0.00004343865,0.0005425071,0.00004310113,0.0010810161,0.000039681145,0.00052774086,0.0001706312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039039678,0.000061023038,0.00016396992,0.000006055807,0.000027617105,0.000011771643,0.0010330653,0.9807197,0.0034624357,0.00022354549,0.011353724,0.0028980444],"study_design_scores_gemma":[0.0005188398,0.00021086789,0.0033910892,0.00007711496,0.0000040217774,0.000018208051,0.0007960104,0.98961544,0.0014463748,0.000039922543,0.0037131237,0.00016897362],"about_ca_topic_score_codex":0.000023743136,"about_ca_topic_score_gemma":0.0000030676954,"teacher_disagreement_score":0.70000726,"about_ca_system_score_codex":0.00014495275,"about_ca_system_score_gemma":0.00015332458,"threshold_uncertainty_score":0.9986986},"labels":[],"label_agreement":null},{"id":"W1969029115","doi":"10.1016/j.ejor.2013.12.033","title":"A review of recent research on green road freight transportation","year":2014,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Vehicle emissions and performance","field":"Engineering","cited_by":738,"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":"Transport engineering; Traffic management; Green logistics; Sustainable transport; Traffic planning; Road traffic; Business; Computer science; Environmental economics; Engineering; Sustainability; Economics","score_opus":0.28096941110964835,"score_gpt":0.45838803527556166,"score_spread":0.1774186241659133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969029115","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.000025907542,0.98210835,0.00006023589,0.0002625998,0.00015330405,0.0003816481,0.00004201398,0.000008176386,0.016957782],"genre_scores_gemma":[0.000090904825,0.9981592,0.00023945166,0.000043780296,0.0008151653,0.000009962349,0.00008413503,0.000081684106,0.00047570738],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99312955,0.0027738735,0.0015340066,0.00019707144,0.0020034027,0.0003620895],"domain_scores_gemma":[0.996501,0.00049980613,0.00020580356,0.00035997204,0.0021974458,0.0002359323],"candidate_categories":["research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.017010553,0.00022352026,0.0009441361,0.00083370507,0.00017117734,0.00005186064,0.0007855319,0.000077287674,0.0011804565],"category_scores_gemma":[0.00037440428,0.00015782574,0.00029305695,0.0010598236,0.00010287008,0.00014718596,0.000030430438,0.0024335212,0.00031599175],"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.0000128561405,0.000041191026,4.5786462e-7,0.043498415,0.00007561946,0.00005463387,0.000042646254,0.00017875507,0.000007654055,0.0001919491,0.046485625,0.9094102],"study_design_scores_gemma":[0.0001342262,0.00033938096,0.000029622064,0.12068411,0.000028983848,0.00003760643,0.000004092276,0.00013067543,0.000008118337,0.000006565056,0.878479,0.00011761606],"about_ca_topic_score_codex":0.000004540768,"about_ca_topic_score_gemma":0.0000014070152,"teacher_disagreement_score":0.9092926,"about_ca_system_score_codex":0.00018719236,"about_ca_system_score_gemma":0.00055975484,"threshold_uncertainty_score":0.9998679},"labels":[],"label_agreement":null},{"id":"W1969637133","doi":"10.1016/j.ejor.2007.12.039","title":"Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Duopoly; Period (music); Economics; Microeconomics; Mathematics; Mathematical optimization; Physics; Cournot competition","score_opus":0.10709164714954661,"score_gpt":0.33678240284237687,"score_spread":0.22969075569283026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969637133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95589316,0.00010745855,0.00040921918,0.0011009965,0.00032499144,0.00014156727,0.000001931438,0.000011988361,0.042008683],"genre_scores_gemma":[0.9981101,0.000022865512,0.00085207506,0.00012911663,0.00056115404,0.000001876451,0.0000072711027,0.000024547837,0.0002909956],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99767405,0.00031661597,0.0005772474,0.00018347154,0.000911036,0.00033758898],"domain_scores_gemma":[0.9985202,0.00024899415,0.00015487435,0.00014082673,0.00089722394,0.000037877275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044846153,0.00013162984,0.00019825665,0.0007557636,0.0004764152,0.00031599525,0.00035669046,0.000019731411,0.00050653145],"category_scores_gemma":[0.0011469091,0.0001190144,0.00008099525,0.000698574,0.00022571067,0.0010751059,0.0001417977,0.00072460616,0.00013577253],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00896173,0.002238434,0.5193494,0.00043110043,0.000485193,0.02388078,0.008462016,0.010799575,0.26403382,0.04813587,0.013498123,0.099723965],"study_design_scores_gemma":[0.014827534,0.00035860436,0.93911237,0.00046027708,0.00005830137,0.0009162607,0.0022852954,0.020108623,0.00031541128,0.00018791447,0.020565756,0.0008036657],"about_ca_topic_score_codex":0.00014613883,"about_ca_topic_score_gemma":0.00015928796,"teacher_disagreement_score":0.41976297,"about_ca_system_score_codex":0.00010487532,"about_ca_system_score_gemma":0.0002584739,"threshold_uncertainty_score":0.55461645},"labels":[],"label_agreement":null},{"id":"W1969725632","doi":"10.1016/s0377-2217(02)00468-x","title":"Incorporating wealth information into a multiple criteria decision making model","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Decision-Making and Behavioral Economics","field":"Decision Sciences","cited_by":34,"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; Operations research; Artificial intelligence; Mathematics","score_opus":0.29484286713895896,"score_gpt":0.5033476173833448,"score_spread":0.2085047502443858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969725632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79009396,0.000054134514,0.19702908,0.0004862542,0.00043772144,0.00013568059,0.000008657729,0.000007745077,0.011746742],"genre_scores_gemma":[0.86368823,0.000010597295,0.13581488,0.00023377624,0.00013706884,0.0000013174089,0.0000024542478,0.000015815009,0.00009589223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99197435,0.002091283,0.002135038,0.0002613201,0.003222476,0.00031553206],"domain_scores_gemma":[0.991665,0.0028751441,0.0006788516,0.00041076838,0.0041260123,0.00024420346],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.044420514,0.00014412716,0.0002907662,0.0011920138,0.00074565713,0.0018903394,0.0010790129,0.000043602995,0.00038547523],"category_scores_gemma":[0.038098354,0.000105681094,0.000140886,0.0008211567,0.00013134755,0.0028139064,0.0002420829,0.00067985395,0.00087564136],"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.00040550777,0.00015201802,0.0036436706,0.000005546392,0.000012402165,0.000106625484,0.0023466332,0.091918185,0.0017407495,0.007137686,0.025364192,0.86716676],"study_design_scores_gemma":[0.0029869985,0.0012116061,0.010172237,0.0005764451,0.000012177702,0.0005980382,0.004257119,0.54611486,0.0005095157,0.36026078,0.07270801,0.0005922064],"about_ca_topic_score_codex":0.0000033432132,"about_ca_topic_score_gemma":0.000009080089,"teacher_disagreement_score":0.8665746,"about_ca_system_score_codex":0.00021609521,"about_ca_system_score_gemma":0.0008766802,"threshold_uncertainty_score":0.9999023},"labels":[],"label_agreement":null},{"id":"W1969909704","doi":"10.1016/j.ejor.2012.02.010","title":"A new exact discrete linear reformulation of the quadratic assignment problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":24,"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":"Academy of Finland; Polytechnique Montréal; University of Pennsylvania","keywords":"Quadratic assignment problem; Linear programming; Mathematical optimization; Integer programming; Mathematics; Quadratic equation; Quadratic programming; Combinatorial optimization; Assignment problem; Computer science","score_opus":0.08035879040295515,"score_gpt":0.3671476523560229,"score_spread":0.28678886195306774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969909704","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.14570971,0.0005570773,0.8246397,0.0015819778,0.00050532265,0.00043562343,0.0000056676577,0.000029681143,0.026535252],"genre_scores_gemma":[0.8757239,0.000021884329,0.12309303,0.000012934314,0.00048578926,7.4299453e-7,0.0000017120344,0.000028584556,0.0006314344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708164,0.0011637191,0.0005376035,0.000057005607,0.0009391898,0.00022085193],"domain_scores_gemma":[0.99900824,0.00018861507,0.00010754657,0.00016428264,0.00038653417,0.0001448003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064693037,0.000079732294,0.000118359836,0.00013224037,0.000120855526,0.000047400532,0.00029048423,0.000019320907,0.00017041193],"category_scores_gemma":[0.0005021537,0.00005132693,0.00006783713,0.00033108154,0.000036621124,0.00038985914,0.00006716674,0.00042906636,0.000025645959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032110067,0.00003972838,0.0033919015,0.00004223644,0.00006241017,0.000002930698,0.0016369028,0.9535112,0.02887193,0.0020893547,0.0028441045,0.0074752173],"study_design_scores_gemma":[0.0037451908,0.0010028216,0.25058874,0.001151692,0.00008428235,0.00029924163,0.0007472865,0.6235558,0.08027538,0.0005641452,0.03727231,0.0007131194],"about_ca_topic_score_codex":0.0000022725292,"about_ca_topic_score_gemma":3.604747e-7,"teacher_disagreement_score":0.73001415,"about_ca_system_score_codex":0.00012932613,"about_ca_system_score_gemma":0.00014137852,"threshold_uncertainty_score":0.22421445},"labels":[],"label_agreement":null},{"id":"W1970712172","doi":"10.1016/j.ejor.2015.04.017","title":"Exact and heuristic algorithms for the design of hub networks with multiple lines","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Benchmark (surveying); Mathematical optimization; Heuristic; Variable neighborhood search; Set (abstract data type); Computer science; Algorithm; Greedy algorithm; Network planning and design; Greedy randomized adaptive search procedure; Descent (aeronautics); Constraint (computer-aided design); Mathematics; Metaheuristic","score_opus":0.18330858125461627,"score_gpt":0.37627837588089164,"score_spread":0.19296979462627536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970712172","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.004685864,0.00092618883,0.9937073,0.00022503825,0.00008356983,0.00018453374,0.0000029852413,0.000007771847,0.0001767231],"genre_scores_gemma":[0.6546224,0.00014438314,0.34471455,0.0000117962045,0.0003759032,0.0000028673835,0.0000016495203,0.000032036492,0.00009439973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837196,0.0007076655,0.00028886017,0.000066119384,0.00042160554,0.00014381054],"domain_scores_gemma":[0.99660397,0.0019148004,0.000053065978,0.000091719696,0.0012346603,0.00010180263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008039289,0.00006781811,0.00011413239,0.00009384745,0.00010651538,0.000082660204,0.00018381419,0.000013727072,0.0000067300634],"category_scores_gemma":[0.0018371849,0.000041668107,0.000020083065,0.00017680718,0.00009486705,0.00011411237,0.000029316987,0.00026164972,0.000001186876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109106615,0.000011152035,0.0003344639,0.000009996078,0.000038852853,0.0000094934585,0.00020411193,0.99231195,0.00035572718,0.000044547105,0.0015853631,0.004985242],"study_design_scores_gemma":[0.00080353016,0.0003746131,0.0017789362,0.000043473337,0.000008777372,0.000059430346,0.00012064083,0.99544424,0.00023646932,0.000013001622,0.0010677689,0.00004912678],"about_ca_topic_score_codex":0.00000116293,"about_ca_topic_score_gemma":3.9641523e-7,"teacher_disagreement_score":0.64993656,"about_ca_system_score_codex":0.000025231686,"about_ca_system_score_gemma":0.00010075101,"threshold_uncertainty_score":0.27862734},"labels":[],"label_agreement":null},{"id":"W1970804854","doi":"10.1016/j.ejor.2007.03.049","title":"Augmenting the lot sizing order quantity when demand is probabilistic","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":19,"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":"Sizing; Probabilistic logic; Order (exchange); Computer science; Operations research; Economic order quantity; Mathematical optimization; Mathematics; Business; Artificial intelligence; Marketing; Supply chain","score_opus":0.12487804944310577,"score_gpt":0.33881797022245524,"score_spread":0.21393992077934948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970804854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66791725,0.00082823,0.018779237,0.023923084,0.0012059499,0.0008379199,0.0000018993629,0.000040969982,0.28646547],"genre_scores_gemma":[0.9910302,0.00001600597,0.00076778146,0.0027156929,0.0029571424,0.0000014983027,0.00000394679,0.000029651414,0.0024780557],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972695,0.00021849951,0.00058567605,0.0001794646,0.001353069,0.00039378792],"domain_scores_gemma":[0.9977838,0.0002503877,0.00021035034,0.00019592508,0.0015267697,0.0000327727],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.020574762,0.0001173115,0.00012733812,0.00037494223,0.00076030666,0.00092220283,0.0006262105,0.000015134171,0.0013909321],"category_scores_gemma":[0.0014961588,0.000078206394,0.000079964084,0.00051015854,0.00015303091,0.0009223416,0.00035564476,0.00047716362,0.0004914418],"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.0007745709,0.000979571,0.0520126,0.00058420165,0.0005185869,0.001204939,0.0036306623,0.0049589397,0.0053601125,0.34706658,0.5446082,0.038301088],"study_design_scores_gemma":[0.0012933436,0.000117901785,0.05083588,0.00021538287,0.000045075765,0.000030497218,0.0024975594,0.006659548,0.0001738367,0.00321891,0.93463695,0.00027509013],"about_ca_topic_score_codex":0.000045291883,"about_ca_topic_score_gemma":0.00003144501,"teacher_disagreement_score":0.39002883,"about_ca_system_score_codex":0.000073912655,"about_ca_system_score_gemma":0.00006963813,"threshold_uncertainty_score":0.9995219},"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":"W1971870243","doi":"10.1016/j.ejor.2012.09.016","title":"A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Tabu search; Control (management); Routing (electronic design automation); Process (computing); Quality (philosophy); Operations research; Order (exchange); Diversity (politics); Point (geometry); Mathematical optimization; Artificial intelligence; Engineering; Computer network; Mathematics","score_opus":0.06960539709992418,"score_gpt":0.3517991659851844,"score_spread":0.2821937688852602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971870243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8413178,0.0003144932,0.12688984,0.0034402716,0.00008356587,0.001434198,0.000048083613,0.000020770383,0.026451036],"genre_scores_gemma":[0.9909436,0.00004519608,0.008479281,0.000022939696,0.00017654937,0.000007593125,0.000014527545,0.000013797627,0.00029648544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977129,0.00092097744,0.00028696138,0.00007850642,0.00076137163,0.00023928485],"domain_scores_gemma":[0.9980619,0.0004205253,0.00019549351,0.00005442458,0.0011440892,0.00012355405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008025107,0.00005618311,0.00010616432,0.00008596058,0.0006320467,0.0000688716,0.00018359625,0.00001683126,0.00003495753],"category_scores_gemma":[0.00029844642,0.00003647003,0.00004667905,0.00019359993,0.00016253424,0.00033541975,0.000007013484,0.00019557824,0.0000023356745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002665511,0.0008021322,0.023587104,0.000099567995,0.00052703265,0.0000146390375,0.12608129,0.767014,0.028875519,0.03849566,0.0011441009,0.010693407],"study_design_scores_gemma":[0.015592292,0.0056549804,0.4062615,0.001163607,0.0004298984,0.00008512033,0.089597136,0.45496276,0.002470003,0.00020027188,0.02230966,0.0012727837],"about_ca_topic_score_codex":0.000044517816,"about_ca_topic_score_gemma":0.000008938808,"teacher_disagreement_score":0.3826744,"about_ca_system_score_codex":0.000064548374,"about_ca_system_score_gemma":0.0003754845,"threshold_uncertainty_score":0.48612565},"labels":[],"label_agreement":null},{"id":"W1972002269","doi":"10.1016/j.ejor.2005.04.013","title":"Comparison of two multicriteria decision aid methods: Net Flow and Rough Set Methods in a high yield pulping process","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"Université du Québec en Abitibi-Témiscamingue; Université du Québec à Trois-Rivières; Université Laval; University of Ottawa","funders":"","keywords":"ELECTRE; Pareto principle; Rough set; Set (abstract data type); Mathematical optimization; Pareto analysis; Multi-objective optimization; Process (computing); Computer science; Domain (mathematical analysis); Flow (mathematics); Mathematics; Data mining; Multiple-criteria decision analysis","score_opus":0.2638107427569954,"score_gpt":0.5477295663806454,"score_spread":0.28391882362365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972002269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16386065,0.0008162186,0.8320064,0.001744101,0.00015018805,0.00014706301,0.000002943448,0.000006317626,0.0012660915],"genre_scores_gemma":[0.4347296,0.000050607672,0.56499267,0.00006939472,0.00013745266,0.0000010151258,9.388647e-7,0.000007215187,0.0000111187],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944088,0.0032453397,0.00092410087,0.00027729638,0.0008423902,0.0003020645],"domain_scores_gemma":[0.99699724,0.0016669647,0.00018588545,0.00023805011,0.0007597333,0.00015211318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01619167,0.0001228905,0.0003434063,0.00042947146,0.00016578635,0.00035645388,0.0009198938,0.000027864911,0.00005187455],"category_scores_gemma":[0.0019099122,0.00009362487,0.000050476945,0.00058414077,0.00009678841,0.0008976968,0.00035523355,0.00064218295,0.000008068736],"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.00021144998,0.00028866064,0.0026168807,0.00003569407,0.000029990366,0.00010735468,0.006953069,0.06831772,0.01317723,0.0027191946,0.001004289,0.90453845],"study_design_scores_gemma":[0.0023063247,0.0009269158,0.018657329,0.00040909296,0.000006525311,0.0002028113,0.00033185707,0.9589304,0.009035574,0.0025301422,0.0064268224,0.00023623623],"about_ca_topic_score_codex":0.000013500763,"about_ca_topic_score_gemma":0.000007661661,"teacher_disagreement_score":0.90430224,"about_ca_system_score_codex":0.000054356813,"about_ca_system_score_gemma":0.00017800118,"threshold_uncertainty_score":0.5611742},"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":"W1972867159","doi":"10.1016/j.ejor.2008.09.019","title":"Third-order extensions of Lo’s semiparametric bound for European call options","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Context (archaeology); Valuation of options; Econometrics; Skewness; Order (exchange); Variance (accounting); Parametric statistics; Capital asset pricing model; Stochastic game; Call option; Contrast (vision); Economics; Computer science; Mathematical economics; Mathematics; Finance; Statistics","score_opus":0.1605272267897249,"score_gpt":0.3372387262423536,"score_spread":0.17671149945262873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972867159","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.06988429,0.004139316,0.86925876,0.0025501845,0.00028236117,0.00045314277,0.00027105247,0.0000120340665,0.053148843],"genre_scores_gemma":[0.9671983,0.0005172174,0.029745245,0.00013289624,0.0005367442,0.000010826819,0.00001890401,0.000041786538,0.001798059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981464,0.00008960187,0.0010459017,0.00023174008,0.00021265216,0.00027370016],"domain_scores_gemma":[0.9969966,0.0004081096,0.0003827881,0.00023695732,0.0018235866,0.00015195057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004149038,0.00010490677,0.00029178488,0.0006377626,0.00054818124,0.00007339103,0.00048607867,0.000026343561,0.000085872685],"category_scores_gemma":[0.0030884,0.00010393704,0.00014864265,0.0009306762,0.000267664,0.00021332013,0.00009829438,0.0003710988,0.00031575642],"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.00008941448,0.0004566701,0.0007795407,0.00003162491,0.00007482063,0.00004726238,0.00062450464,0.0016412787,0.0008206945,0.974356,0.01989612,0.0011820503],"study_design_scores_gemma":[0.0058249175,0.0032697325,0.28096965,0.00025143896,0.000044649114,0.0010162054,0.00041348176,0.007874358,0.0004471933,0.1228854,0.5759873,0.0010156843],"about_ca_topic_score_codex":0.00001585532,"about_ca_topic_score_gemma":0.0000014799024,"teacher_disagreement_score":0.897314,"about_ca_system_score_codex":0.00006528993,"about_ca_system_score_gemma":0.00023906256,"threshold_uncertainty_score":0.42384297},"labels":[],"label_agreement":null},{"id":"W1973219179","doi":"10.1016/j.ejor.2005.01.021","title":"Interior point models for power system stability problems","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimal Power Flow Distribution","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":"Electric power system; Mathematical optimization; Power flow; Voltage; Nonlinear programming; Stability (learning theory); AC power; Computer science; Control theory (sociology); Interior point method; Point (geometry); Nonlinear system; Power (physics); Optimal control; Power-flow study; Optimization problem; Operating point; Mathematics; Control (management); Engineering; Electronic engineering","score_opus":0.07792103543326995,"score_gpt":0.3141030318449111,"score_spread":0.23618199641164117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973219179","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.476684,0.00075443566,0.48492274,0.0017448057,0.0005349098,0.0008127991,0.00016623919,0.00009401599,0.034286067],"genre_scores_gemma":[0.99272704,0.000012170258,0.0067652445,0.000013472372,0.00035394204,0.000007440325,0.000012666168,0.000035770554,0.00007227009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981105,0.00030875584,0.00057192164,0.000119969794,0.00060756656,0.00028132033],"domain_scores_gemma":[0.9982405,0.000115659015,0.000044259203,0.0001488429,0.0013011951,0.00014954677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053597083,0.00010153277,0.00014931918,0.00014497736,0.00011854405,0.00016496795,0.0002889858,0.000021676495,0.000126604],"category_scores_gemma":[0.00022136816,0.0000876846,0.00009556091,0.00013299425,0.000052383188,0.00065589,0.000050653754,0.00039294106,0.00009912636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036451235,0.00017121171,0.00005724951,0.0003486755,0.00016070495,0.000049577542,0.0017689671,0.865332,0.07600243,0.015436634,0.034918997,0.005389047],"study_design_scores_gemma":[0.002230282,0.001554263,0.0010382961,0.00047371845,0.000015581692,0.0002746605,0.00097275054,0.9256503,0.013476748,0.00019675537,0.053742465,0.00037419397],"about_ca_topic_score_codex":5.637266e-7,"about_ca_topic_score_gemma":0.0000012328484,"teacher_disagreement_score":0.516043,"about_ca_system_score_codex":0.0005049535,"about_ca_system_score_gemma":0.000097644894,"threshold_uncertainty_score":0.35756743},"labels":[],"label_agreement":null},{"id":"W1973912655","doi":"10.1016/j.ejor.2010.02.038","title":"The multi-product newsboy problem with supplier quantity discounts and a budget constraint","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":88,"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":"Newsvendor model; Lagrangian relaxation; Mathematical optimization; Budget constraint; Computer science; Integer programming; Product (mathematics); Constraint (computer-aided design); Relaxation (psychology); Nonlinear system; Extension (predicate logic); Nonlinear programming; Integer (computer science); Mathematics; Supply chain; Economics; Microeconomics","score_opus":0.061643551282242956,"score_gpt":0.312343960297699,"score_spread":0.25070040901545604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973912655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.874694,0.00028140226,0.002456583,0.036083635,0.00083762483,0.0009671526,0.0000063996927,0.000024102084,0.084649116],"genre_scores_gemma":[0.9936988,0.00003806069,0.0025221528,0.00041004198,0.0014977413,0.0000043595933,0.0000053898452,0.000023844534,0.0017996514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981956,0.00013214345,0.00034500592,0.000190925,0.0008544826,0.00028185296],"domain_scores_gemma":[0.9986519,0.00009511493,0.00014446925,0.00019540438,0.0008733355,0.00003975378],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0069006104,0.00011480798,0.00011652092,0.00020582936,0.0007451467,0.0013248544,0.00039077853,0.000011088601,0.000282426],"category_scores_gemma":[0.00042598616,0.00006455955,0.000037091097,0.00023454554,0.0004866683,0.00083269353,0.00023632211,0.000653388,0.00012785656],"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.0010645363,0.0008768498,0.09877888,0.0002957556,0.00039549283,0.0007425348,0.0007734978,0.0008060929,0.017595446,0.6301166,0.19879547,0.049758848],"study_design_scores_gemma":[0.0019016473,0.00014328997,0.07712155,0.000076556425,0.00002013836,0.00009014464,0.001212469,0.0029504392,0.00009034829,0.00059865136,0.9155704,0.00022440733],"about_ca_topic_score_codex":0.000041039923,"about_ca_topic_score_gemma":0.0001948855,"teacher_disagreement_score":0.7167749,"about_ca_system_score_codex":0.000017968761,"about_ca_system_score_gemma":0.00009648732,"threshold_uncertainty_score":0.9997119},"labels":[],"label_agreement":null},{"id":"W1974704271","doi":"10.1016/j.ejor.2015.03.009","title":"Return-on-investment (ROI) criteria for network design","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Queue; Profit (economics); Mathematical optimization; Computer science; Return on investment; Operations research; Mathematics; Microeconomics; Economics; Computer network","score_opus":0.3460494690242972,"score_gpt":0.39041767314027076,"score_spread":0.044368204115973586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974704271","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.0696684,0.0011942436,0.35871738,0.093884595,0.008559032,0.0039540916,0.000016794078,0.00013602113,0.46386942],"genre_scores_gemma":[0.95336044,0.00003431606,0.020463375,0.009299511,0.010437841,0.000028010443,0.000043082706,0.000060771337,0.0062726433],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770546,0.00033439894,0.0004892742,0.00016857681,0.0010034365,0.00029883155],"domain_scores_gemma":[0.99750346,0.00009186622,0.000071155984,0.00017595307,0.0020949256,0.000062638035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01401038,0.000108562774,0.00013322686,0.00027866286,0.00028801482,0.00044145348,0.00041696703,0.000014636161,0.00041912103],"category_scores_gemma":[0.0015516637,0.000087905915,0.000074509546,0.00034518106,0.0000614469,0.00060673343,0.00012027555,0.00021406048,0.00068930996],"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.00043654587,0.00011596331,0.00006353765,0.000029852305,0.000036918147,0.000028051734,0.000081942184,0.07259841,0.00011994796,0.06610752,0.85916525,0.0012160381],"study_design_scores_gemma":[0.0014305114,0.0004111515,0.0013328124,0.000079488585,0.000015212097,0.0000060740635,0.00028859283,0.050980695,0.000044579276,0.0053650956,0.9398805,0.00016528921],"about_ca_topic_score_codex":0.000012174298,"about_ca_topic_score_gemma":0.000004597861,"teacher_disagreement_score":0.883692,"about_ca_system_score_codex":0.00008632397,"about_ca_system_score_gemma":0.00013182584,"threshold_uncertainty_score":0.8859915},"labels":[],"label_agreement":null},{"id":"W1975192801","doi":"10.1016/j.ejor.2008.06.032","title":"Bargaining in competing supply chains with uncertainty","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":143,"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":"Stackelberg competition; Supply chain; Microeconomics; Bargaining problem; Competition (biology); Economics; Nash equilibrium; Mathematical economics; Business","score_opus":0.10463171680218476,"score_gpt":0.3038569881112279,"score_spread":0.19922527130904316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975192801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7894657,0.000108071436,0.0003833339,0.0024596914,0.0001219423,0.00018166062,7.739865e-7,0.000013574629,0.20726523],"genre_scores_gemma":[0.9962495,0.000028077506,0.00057104405,0.000933108,0.0013799786,0.0000023101338,0.000010036281,0.000027563034,0.00079836196],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99771804,0.00024660458,0.0004471735,0.00016597584,0.0010880188,0.0003341952],"domain_scores_gemma":[0.9988269,0.00011873018,0.00013987285,0.00012423487,0.00075906096,0.000031198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055762883,0.0001123065,0.00016301978,0.00077001203,0.000381552,0.0002261671,0.00040612533,0.000011827803,0.0006852586],"category_scores_gemma":[0.00041116192,0.000086336295,0.000047465055,0.00064732507,0.00015343975,0.00085039303,0.00017149434,0.00049883,0.00019644249],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017297446,0.0011456232,0.5117105,0.000183754,0.00023502835,0.014879913,0.0043378985,0.12963995,0.0026451112,0.2209833,0.10003424,0.012474933],"study_design_scores_gemma":[0.008184542,0.00067271467,0.4796535,0.0010216825,0.00002048074,0.00039505758,0.009181285,0.05018914,0.00009651856,0.00051793957,0.44931433,0.0007528085],"about_ca_topic_score_codex":0.000060700713,"about_ca_topic_score_gemma":0.000036910285,"teacher_disagreement_score":0.34928006,"about_ca_system_score_codex":0.00009115275,"about_ca_system_score_gemma":0.00011729632,"threshold_uncertainty_score":0.75031006},"labels":[],"label_agreement":null},{"id":"W1975571906","doi":"10.1016/j.ejor.2011.07.045","title":"Corrigenda to: “Fuzzy multi-objective programming for supplier selection and risk modeling: A possibility approach” [EJOR 200 (3) (2010) 774–787]","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"China; Operations research; Fuzzy logic; Engineering; Management; Computer science; Political science; Economics; Artificial intelligence","score_opus":0.525967632192277,"score_gpt":0.4832156842686499,"score_spread":0.04275194792362713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975571906","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.44128165,0.00009157799,0.5558021,0.000082853134,0.00028240483,0.0008460875,0.00004360598,0.000011180593,0.0015585023],"genre_scores_gemma":[0.60921526,0.000013767887,0.38953853,0.00003345171,0.00029396638,0.000018827806,0.0000034649481,0.00003268106,0.00085003534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99088997,0.0030176914,0.0015591108,0.0008512741,0.0030803208,0.0006016661],"domain_scores_gemma":[0.99000955,0.0012506568,0.00038659194,0.0004412896,0.0073516443,0.0005602431],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04267846,0.00023721297,0.00042440658,0.001100225,0.0010263629,0.0011385946,0.0010676468,0.00006759919,0.00026753265],"category_scores_gemma":[0.021183072,0.00017004124,0.00019034346,0.0010320374,0.00017193238,0.00089072506,0.00038005793,0.0009249448,0.0001092066],"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.0172753,0.0057857507,0.07477297,0.00009696852,0.0007060883,0.00024495865,0.06303359,0.09584348,0.018236184,0.0056977845,0.027942924,0.690364],"study_design_scores_gemma":[0.0043404996,0.0024469509,0.08670154,0.000083681036,0.00004474694,0.00046055813,0.006102267,0.8842044,0.0006532364,0.004729308,0.009647206,0.0005856297],"about_ca_topic_score_codex":0.00007303473,"about_ca_topic_score_gemma":0.000030151956,"teacher_disagreement_score":0.7883609,"about_ca_system_score_codex":0.0001727555,"about_ca_system_score_gemma":0.0004975861,"threshold_uncertainty_score":0.9998983},"labels":[],"label_agreement":null},{"id":"W1977349335","doi":"10.1016/j.ejor.2005.11.006","title":"The prediction–correction approach to nonlinear complementarity problems","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":16,"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":"University of Victoria","keywords":"Logarithm; Complementarity (molecular biology); Nonlinear complementarity problem; Nonlinear system; Quadratic equation; Mixed complementarity problem; Mathematical optimization; Complementarity theory; Convergence (economics); Computer science; Applied mathematics; Mathematics; Algorithm","score_opus":0.0724075139099365,"score_gpt":0.3238441798358856,"score_spread":0.2514366659259491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977349335","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.0010745376,0.000047669768,0.9561642,0.013301326,0.00038269343,0.0001830699,0.000006401642,0.000016810542,0.028823335],"genre_scores_gemma":[0.7546839,0.000048060276,0.2366179,0.0004508782,0.0018577573,0.000011784122,0.000056320558,0.000020744192,0.006252617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685115,0.0009403596,0.00052843936,0.00017318435,0.0013072115,0.00019963036],"domain_scores_gemma":[0.997421,0.00022822605,0.00011071984,0.00019570086,0.0019368881,0.000107437634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054130713,0.00007180856,0.0000863274,0.00025816573,0.0008789114,0.00073830894,0.0008010575,0.000010715481,0.00003221141],"category_scores_gemma":[0.00025765522,0.000047961676,0.000070218004,0.0008856398,0.000048491693,0.0004635697,0.0001733864,0.00032240382,0.00007998329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040660823,0.0005307202,0.0016906523,0.0000048829384,0.00008116809,0.000008680544,0.0006251264,0.7025763,0.0005889887,0.13389046,0.15458165,0.005380705],"study_design_scores_gemma":[0.00046965643,0.00027459627,0.03218038,0.000015094183,0.00000595468,0.00007255427,0.000107433734,0.7635829,0.00011628788,0.000659089,0.20242009,0.00009598574],"about_ca_topic_score_codex":0.000033859884,"about_ca_topic_score_gemma":0.000013379767,"teacher_disagreement_score":0.7536094,"about_ca_system_score_codex":0.000109851535,"about_ca_system_score_gemma":0.00020332044,"threshold_uncertainty_score":0.711953},"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":"W1978415596","doi":"10.1016/s0377-2217(00)00248-4","title":"Recent trends in modeling of deteriorating inventory","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":1300,"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":"Operations research; Computer science; Class (philosophy); Management science; Economics; Mathematics; Artificial intelligence","score_opus":0.18816184126030186,"score_gpt":0.35264798133395103,"score_spread":0.16448614007364917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978415596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83938015,0.00041260116,0.0005265925,0.0024918523,0.00026353527,0.00009127019,4.101031e-7,0.00000706122,0.15682654],"genre_scores_gemma":[0.99763125,0.00018624323,0.00027258554,0.0003231383,0.0009810315,0.0000013417285,0.0000066638895,0.00002052114,0.0005771979],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978528,0.00021953596,0.00067711505,0.00013082052,0.0008818316,0.00023787991],"domain_scores_gemma":[0.99881655,0.000029711813,0.00017430873,0.00012307202,0.00083318277,0.000023180306],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.006379297,0.000087909495,0.00015461192,0.0013645638,0.000112683585,0.00017833135,0.00036470164,0.000013809224,0.0011337206],"category_scores_gemma":[0.00036644697,0.00007706404,0.000065504195,0.0009107972,0.000050741986,0.00088427175,0.00018454547,0.0003187361,0.00005985711],"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.0013157919,0.0014523234,0.09432949,0.00025408543,0.00017926512,0.0021438454,0.0018068511,0.24863932,0.010620706,0.033517275,0.044884995,0.56085604],"study_design_scores_gemma":[0.002964741,0.00026386802,0.020776946,0.0004978547,0.000018078976,0.000034318487,0.0023389375,0.56353426,0.00006940561,0.00092543097,0.40823844,0.00033768383],"about_ca_topic_score_codex":0.00003689344,"about_ca_topic_score_gemma":0.00003216569,"teacher_disagreement_score":0.5605184,"about_ca_system_score_codex":0.000094064766,"about_ca_system_score_gemma":0.00004665928,"threshold_uncertainty_score":0.9997794},"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":"W1979114706","doi":"10.1016/j.ejor.2010.06.026","title":"Social responsibility allocation in two-echelon supply chains: Insights from wholesale price contracts","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":202,"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":"Corporate social responsibility; Supply chain; Profit (economics); Upstream (networking); Business; Microeconomics; Industrial organization; Social responsibility; Downstream (manufacturing); Economics; Marketing; Computer science","score_opus":0.04416915676319654,"score_gpt":0.3388783040624034,"score_spread":0.29470914729920683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979114706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9634756,0.00007390573,0.0003691049,0.009783209,0.00030268464,0.000416349,0.0000023207974,0.000017680004,0.02555917],"genre_scores_gemma":[0.994137,0.000007986877,0.00064560375,0.0007536831,0.0035766112,0.0000074761683,0.000043712258,0.000038230868,0.00078969443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99642605,0.00067749526,0.0007365413,0.00032005683,0.0014384107,0.00040146112],"domain_scores_gemma":[0.99681824,0.00041696485,0.00027211374,0.00025372728,0.002195719,0.00004320361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010166029,0.00016084942,0.00022181576,0.001029269,0.0004127195,0.0007794812,0.00069553056,0.000037991285,0.00039233704],"category_scores_gemma":[0.0035337158,0.00014617345,0.000075921474,0.00088481663,0.00016702402,0.0018586875,0.00032648543,0.001255524,0.00027131272],"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.004523985,0.0027733988,0.05605843,0.0002746524,0.00026858822,0.0044195103,0.0060354057,0.0047150366,0.2537021,0.5901248,0.04467459,0.03242952],"study_design_scores_gemma":[0.0043186774,0.00007522979,0.78951687,0.00010421183,0.000018459808,0.000008726905,0.0030126316,0.006946877,0.00057352404,0.0095550865,0.18551134,0.0003583628],"about_ca_topic_score_codex":0.00032830753,"about_ca_topic_score_gemma":0.00045657897,"teacher_disagreement_score":0.73345846,"about_ca_system_score_codex":0.00019594858,"about_ca_system_score_gemma":0.00030602212,"threshold_uncertainty_score":0.7516555},"labels":[],"label_agreement":null},{"id":"W1980201624","doi":"10.1016/j.ejor.2007.12.014","title":"An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":363,"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é de Montréal; Université du Québec à Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Travelling salesman problem; Mathematical optimization; Heuristics; Combinatorial optimization; 2-opt; Traveling purchaser problem; Vertex (graph theory); Mathematics; Multi-objective optimization; Bottleneck traveling salesman problem; Pareto principle; Constraint (computer-aided design); Computer science; Combinatorics; Graph","score_opus":0.04206008863009993,"score_gpt":0.3738648753142147,"score_spread":0.3318047866841148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980201624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035133387,0.000019753055,0.99470997,0.0015825181,0.0001503182,0.0019714485,0.0000067578117,0.000031397038,0.001176505],"genre_scores_gemma":[0.16591896,0.000005658586,0.83330715,0.00012257767,0.00049223175,0.0000539005,0.000012676767,0.000037230468,0.00004962219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960355,0.0012209583,0.0006619585,0.00045515955,0.0012040177,0.00042239914],"domain_scores_gemma":[0.9932691,0.0006651412,0.00030163885,0.00035490407,0.0051406063,0.0002686247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014928142,0.00017655661,0.00019138138,0.00039146308,0.0007112113,0.00044407923,0.0011086032,0.00003462703,0.000006011826],"category_scores_gemma":[0.0005508286,0.00012084092,0.000055843488,0.0011285825,0.00010597519,0.0010900528,0.000104964456,0.00051203073,0.000009254066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021233698,0.0001767554,0.00002817423,0.000009210233,0.000034947112,0.000012470931,0.002242816,0.9271317,0.0030330385,0.026084041,0.00004688592,0.040987585],"study_design_scores_gemma":[0.0026900708,0.003175122,0.0012231707,0.0001077121,0.000012299306,0.00024942408,0.00072531286,0.98191166,0.0057407133,0.0010448367,0.0028080386,0.0003116186],"about_ca_topic_score_codex":0.000004599754,"about_ca_topic_score_gemma":0.0000069669686,"teacher_disagreement_score":0.16556764,"about_ca_system_score_codex":0.00026198788,"about_ca_system_score_gemma":0.000519883,"threshold_uncertainty_score":0.5470134},"labels":[],"label_agreement":null},{"id":"W1981162594","doi":"10.1016/j.ejor.2007.11.007","title":"Apportionment methods and the Liu–Layland problem","year":2007,"lang":"en","type":"article","venue":"European Journal of 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":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":"Apportionment; Computer science; Operations research; Mathematics; Political science; Law","score_opus":0.07106822064995089,"score_gpt":0.40002046072908043,"score_spread":0.32895224007912954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981162594","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.24039768,0.0015049177,0.48914126,0.02202026,0.00032295054,0.0006238663,0.0000010574518,0.0000309239,0.24595709],"genre_scores_gemma":[0.9778114,0.000045789,0.018815033,0.0007123552,0.0013369377,0.00000131737,0.0000022214176,0.000019205825,0.0012557372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796706,0.0005637453,0.00047574055,0.000118323944,0.0006734089,0.00020170494],"domain_scores_gemma":[0.9983007,0.00060003693,0.00021288185,0.000118955635,0.00074279634,0.00002465644],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.047650464,0.00007393668,0.00013338315,0.00030804836,0.00043347667,0.00033176885,0.00027290135,0.00001040265,0.00021135512],"category_scores_gemma":[0.0013441369,0.000043624867,0.00006312536,0.0003863053,0.0002653737,0.0006047107,0.00018280279,0.00038490043,0.00007112716],"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.0021935394,0.00019506871,0.002582463,0.00007643626,0.00032093632,0.000416422,0.0007719512,0.0062553585,0.0071102516,0.7726636,0.008407787,0.19900617],"study_design_scores_gemma":[0.006829167,0.00018381387,0.038899124,0.00021756749,0.00017701898,0.0002766322,0.0026345272,0.009174436,0.0008287208,0.11006578,0.8302465,0.0004666739],"about_ca_topic_score_codex":0.000005498672,"about_ca_topic_score_gemma":0.0000027906701,"teacher_disagreement_score":0.82183874,"about_ca_system_score_codex":0.00002885001,"about_ca_system_score_gemma":0.000028921719,"threshold_uncertainty_score":0.9806443},"labels":[],"label_agreement":null},{"id":"W1982178888","doi":"10.1016/j.ejor.2005.10.075","title":"Competitive facility location model with concave demand","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":130,"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":"Knapsack problem; Mathematical optimization; Cannibalization; Computer science; Heuristic; Facility location problem; Piecewise linear function; Set (abstract data type); Function (biology); Linear programming; Scheme (mathematics); Location model; Concave function; Operations research; Mathematics; Economics","score_opus":0.07573026627728462,"score_gpt":0.3009627957577998,"score_spread":0.22523252948051514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982178888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4840823,0.00020739563,0.1313571,0.009974443,0.00022742365,0.00056829,0.000013856447,0.00004108633,0.3735281],"genre_scores_gemma":[0.99633443,0.000008051706,0.00067424646,0.00034377267,0.0004958459,0.0000027183728,0.000045817327,0.000010050915,0.002085082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980439,0.00015280655,0.00043277894,0.00016448644,0.0010041496,0.00020189167],"domain_scores_gemma":[0.9966866,0.000032429467,0.0000739143,0.00013622729,0.0030496502,0.000021193076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038144726,0.00010010882,0.00011908648,0.00029921252,0.0003053634,0.00030213743,0.00026110577,0.000012351994,0.00036120033],"category_scores_gemma":[0.00020275461,0.00007746516,0.000039697108,0.0004346448,0.00014511008,0.00092674536,0.000087597014,0.00025359608,0.00055342226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026145624,0.0002731691,0.002567583,0.00009542112,0.000043145777,0.000051948035,0.00008707304,0.6660968,0.0006211941,0.2993142,0.029504614,0.001083367],"study_design_scores_gemma":[0.004227741,0.00032085544,0.20794822,0.00023689875,0.000066188375,0.000033351535,0.0019198909,0.50631475,0.00031063883,0.0031502186,0.27481502,0.0006562408],"about_ca_topic_score_codex":0.00014062865,"about_ca_topic_score_gemma":0.00019024694,"teacher_disagreement_score":0.5122521,"about_ca_system_score_codex":0.00006883545,"about_ca_system_score_gemma":0.00011798629,"threshold_uncertainty_score":0.71133083},"labels":[],"label_agreement":null},{"id":"W1983050889","doi":"10.1016/j.ejor.2013.08.034","title":"Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":93,"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":"Schedule; Computer science; Heuristic; Operations research; Context (archaeology); Mathematical optimization; Incremental heuristic search; Order (exchange); Search algorithm; Beam search; Engineering; Artificial intelligence; Algorithm; Mathematics","score_opus":0.05616401818405493,"score_gpt":0.3486139602267212,"score_spread":0.2924499420426663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983050889","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.295144,0.00011937806,0.69980305,0.00097330613,0.00017632007,0.0010582831,0.00004320032,0.000048771988,0.0026336834],"genre_scores_gemma":[0.7956084,0.000038968643,0.20326695,0.00012851616,0.0002953416,0.000024603556,0.000018780991,0.00007653406,0.0005418818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973897,0.0009306332,0.0004988287,0.00018201649,0.00059048965,0.0004083591],"domain_scores_gemma":[0.9972685,0.00034194533,0.000036337482,0.0001499518,0.0018569368,0.00034632778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006430839,0.00012732603,0.00016997923,0.00037594204,0.00020392737,0.0004219416,0.00027621625,0.00002963104,0.0001875924],"category_scores_gemma":[0.00087553123,0.00010963126,0.0000403178,0.0003467442,0.000030398412,0.00056349044,0.00008399945,0.00049955165,0.00006582768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000441741,0.0006079851,0.0031995673,0.00039503392,0.0004349915,0.00008158492,0.0040275995,0.54632705,0.16540274,0.0024060588,0.05302394,0.22365172],"study_design_scores_gemma":[0.0037922591,0.004789202,0.03126719,0.0003365054,0.000022883984,0.00010219231,0.0012932917,0.9367345,0.0033420264,0.00059269427,0.017130008,0.00059723045],"about_ca_topic_score_codex":0.0000057141597,"about_ca_topic_score_gemma":0.0000021796288,"teacher_disagreement_score":0.50046444,"about_ca_system_score_codex":0.00010803056,"about_ca_system_score_gemma":0.00014052443,"threshold_uncertainty_score":0.44706333},"labels":[],"label_agreement":null},{"id":"W1985824646","doi":"10.1016/j.ejor.2014.07.010","title":"A dynamic benchmarking system for assessing the recovery of inpatients: Evidence from the neurorehabilitation process","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Bridgepoint Active Healthcare; University of Toronto","funders":"","keywords":"Benchmarking; Neurorehabilitation; Process (computing); Computer science; Process management; Psychology; Neuroscience; Business; Rehabilitation","score_opus":0.18779597766663766,"score_gpt":0.5188800942172754,"score_spread":0.33108411655063774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985824646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8574855,0.00018954085,0.13117261,0.009051985,0.00063372415,0.0009069431,0.000017621813,0.000006521384,0.0005356009],"genre_scores_gemma":[0.986076,0.000045684537,0.012909775,0.0002403234,0.0005894977,0.000036582267,0.000022044032,0.000023107585,0.000056999364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98794323,0.0096318815,0.0011074606,0.00016933221,0.00090497104,0.00024313854],"domain_scores_gemma":[0.98144275,0.012689794,0.0005045881,0.0002524454,0.005038174,0.00007224146],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.023965579,0.00008604725,0.00017481983,0.00012121792,0.0019812398,0.00012751618,0.00045720997,0.000037924303,0.000035922698],"category_scores_gemma":[0.01535387,0.000047495516,0.00007075937,0.00036946716,0.00011145619,0.0005802271,0.00006376176,0.0007856353,0.000008471868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001883252,0.0004894726,0.15170978,0.0029503477,0.000285204,0.0000134634765,0.09365436,0.5756549,0.018009791,0.010030744,0.008256017,0.13706264],"study_design_scores_gemma":[0.0016805399,0.0019208582,0.32541186,0.008791359,0.000049460552,0.0000112243615,0.025801402,0.63244104,0.00008720094,0.0005345959,0.0030592498,0.00021120375],"about_ca_topic_score_codex":0.000048533042,"about_ca_topic_score_gemma":0.000026699707,"teacher_disagreement_score":0.17370209,"about_ca_system_score_codex":0.00019590984,"about_ca_system_score_gemma":0.0011241018,"threshold_uncertainty_score":0.99931806},"labels":[],"label_agreement":null},{"id":"W1988882067","doi":"10.1016/s0377-2217(02)00458-7","title":"An interactive approach to improve estimates of value efficiency in data envelopment analysis","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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 Alberta","funders":"","keywords":"Data envelopment analysis; Value (mathematics); Decision maker; Preference; Efficiency; Computer science; Extension (predicate logic); Operations research; Econometrics; Mathematics; Statistics; Machine learning","score_opus":0.24821390985229,"score_gpt":0.49425937245690693,"score_spread":0.24604546260461693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988882067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68829525,0.00016257756,0.28709242,0.00059162313,0.00014940088,0.00026124183,0.00003508386,0.000004314913,0.023408085],"genre_scores_gemma":[0.9417369,0.0000074486647,0.057952173,0.000052478965,0.00004569377,0.0000011939344,0.000012100246,0.000011913363,0.0001801015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9872659,0.0052978843,0.0017525783,0.0006668691,0.0046587805,0.00035798515],"domain_scores_gemma":[0.99286306,0.0022881904,0.00040632166,0.0011425134,0.0030263942,0.00027350086],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06687645,0.00014029097,0.0004871752,0.0035385857,0.0002055876,0.0004887317,0.003224648,0.000023262355,0.0002010333],"category_scores_gemma":[0.028830735,0.000098876124,0.00013520569,0.006410665,0.00020263752,0.0009208699,0.00038201758,0.0005436275,0.000086864056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000285514,0.0029803424,0.018849807,0.000007559516,0.00046139222,0.00013806546,0.007116405,0.91429603,0.03186661,0.008412155,0.0018076247,0.013778477],"study_design_scores_gemma":[0.0014842986,0.0015630071,0.15845361,0.00009728138,0.00018697273,0.00007594914,0.007887684,0.8102476,0.012638317,0.0017315625,0.0051209824,0.00051273045],"about_ca_topic_score_codex":0.000024544484,"about_ca_topic_score_gemma":0.0000127341045,"teacher_disagreement_score":0.25344163,"about_ca_system_score_codex":0.00013813189,"about_ca_system_score_gemma":0.00073528034,"threshold_uncertainty_score":0.97934985},"labels":[],"label_agreement":null},{"id":"W1989228515","doi":"10.1016/j.ejor.2006.09.001","title":"Feature Cluster: Operational Research for Risk Management","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced biosensing and bioanalysis techniques","field":"Biochemistry, Genetics and Molecular Biology","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":"Complementary DNA; Aptamer; Duplex (building); DNA; Analyte; Fluorescence; Oligonucleotide; Hybridization probe; Biophysics; Chemistry; DNA–DNA hybridization; CTD; Molecular biology; Nucleic acid thermodynamics; Combinatorial chemistry; Computational biology; Biology; Biochemistry; Gene; Base sequence; Chromatography; Physics","score_opus":0.04487446833304818,"score_gpt":0.39263665166895767,"score_spread":0.34776218333590947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989228515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76223147,0.004474575,0.12177257,0.03014971,0.0005044758,0.0023919684,0.00034548383,0.000045906927,0.07808383],"genre_scores_gemma":[0.9141875,0.00052201125,0.07115713,0.00014407106,0.0019952243,0.000009050443,0.00018896777,0.000033353637,0.011762708],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965726,0.0014150706,0.00034983203,0.0002922441,0.0010256451,0.00034459893],"domain_scores_gemma":[0.9967675,0.00012234657,0.00010374853,0.0002400837,0.0026755522,0.00009077027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009337878,0.000116780764,0.00013139528,0.0003259467,0.0006254545,0.0001909273,0.00039555936,0.00005570871,0.0000075166517],"category_scores_gemma":[0.00049362204,0.00009084972,0.00014482532,0.00028659348,0.00021395851,0.000016745207,0.00018452098,0.00050112326,0.0000122878655],"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.00093628257,0.0003145578,0.00076495204,0.000029728513,0.00022073595,0.000087710934,0.000028158687,0.0015609413,0.25420365,0.006179363,0.72348285,0.01219107],"study_design_scores_gemma":[0.0013586447,0.0014313925,0.0036831829,0.000065012486,0.000023908675,0.000115083516,0.00014775766,0.0004685235,0.10231845,0.0011004214,0.8890793,0.00020832334],"about_ca_topic_score_codex":0.0000040822742,"about_ca_topic_score_gemma":0.000010832156,"teacher_disagreement_score":0.16559646,"about_ca_system_score_codex":0.000058946982,"about_ca_system_score_gemma":0.00014428644,"threshold_uncertainty_score":0.48105532},"labels":[],"label_agreement":null},{"id":"W1993416905","doi":"10.1016/s0377-2217(02)00553-2","title":"A multi-period optimization model for the procurement of component-based enterprise information technologies","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"ERP Systems Implementation and Impact","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"","keywords":"E-procurement; Component (thermodynamics); Procurement; Computer science; Vendor; Key (lock); Personalization; Process management; Time horizon; Supply chain; Cash flow; Information technology; Operations research; Business; Marketing; Computer security","score_opus":0.18538534891628314,"score_gpt":0.3582635023212911,"score_spread":0.17287815340500798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993416905","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.0051650517,0.00014840609,0.98224807,0.010203879,0.0001231092,0.0008379628,0.000015000715,0.000023472645,0.0012350414],"genre_scores_gemma":[0.9828546,0.000018568271,0.016583875,0.00028420624,0.00012201932,0.000014532893,0.000018693801,0.000011398379,0.000092083996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844015,0.00006877336,0.0005940757,0.00006179769,0.0006846572,0.0001505324],"domain_scores_gemma":[0.9977772,0.000085027445,0.00035824065,0.00011384752,0.0016551351,0.000010524983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027006497,0.00007636489,0.000103501654,0.00042586753,0.00028982628,0.00034565094,0.00033174365,0.000013850252,0.00015353259],"category_scores_gemma":[0.00084401655,0.00005010092,0.000068564055,0.00025995518,0.00007065765,0.001362696,0.0000616219,0.00014818962,0.000029627381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019287659,0.00024519168,0.0006682332,0.00016678295,0.000060685674,0.0000024126953,0.00080526504,0.9601812,0.0019133906,0.0022514756,0.024278719,0.009233761],"study_design_scores_gemma":[0.0013948475,0.00006535961,0.00052040746,0.00006392854,0.000009875631,0.0000027910085,0.0010922598,0.98776543,0.000100967525,0.00000829191,0.008924059,0.000051796593],"about_ca_topic_score_codex":0.0000053080403,"about_ca_topic_score_gemma":0.0000015761453,"teacher_disagreement_score":0.97768956,"about_ca_system_score_codex":0.000046547942,"about_ca_system_score_gemma":0.000049019036,"threshold_uncertainty_score":0.333312},"labels":[],"label_agreement":null},{"id":"W1993659560","doi":"10.1016/j.ejor.2010.04.035","title":"Evolutionary stability of auction and supply chain contracting: An analysis based on disintermediation in the Indian tea supply chains","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Disintermediation; Supply chain; Intermediation; Microeconomics; Industrial organization; Stability (learning theory); Business; Supply and demand; Computer science; Economics; Marketing; Finance","score_opus":0.11452693304654016,"score_gpt":0.4294205108562072,"score_spread":0.31489357780966704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993659560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872701,0.0000102381855,0.005389679,0.0062621594,0.000092191614,0.00020134194,0.000047624468,0.0000027231627,0.00072393427],"genre_scores_gemma":[0.9990934,0.0000057401176,0.00043357667,0.000102626705,0.00026552714,0.0000056218173,0.000024457617,0.000006478396,0.000062539606],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9923032,0.004397696,0.00085727026,0.0002606056,0.0020152675,0.00016596908],"domain_scores_gemma":[0.9944319,0.0033474783,0.0003435731,0.00040761018,0.0013388287,0.00013062134],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03529294,0.00008484433,0.00018682977,0.0010865591,0.00039679196,0.0002214634,0.0006287745,0.000034284123,0.00069020165],"category_scores_gemma":[0.007456419,0.000054109245,0.00009936651,0.0014427063,0.00041676438,0.00056648394,0.000038953967,0.0008356246,0.000016328053],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021499963,0.0033173775,0.7365657,0.000015588963,0.00014746476,0.000096143325,0.021467902,0.03929095,0.048558507,0.1008316,0.001966979,0.045591775],"study_design_scores_gemma":[0.00045569456,0.00038389454,0.96578914,0.000009592496,0.000012683939,0.000027092461,0.004996221,0.024797395,0.00050800183,0.0021093432,0.0008494018,0.00006155246],"about_ca_topic_score_codex":0.000017613153,"about_ca_topic_score_gemma":0.00012478027,"teacher_disagreement_score":0.22922342,"about_ca_system_score_codex":0.00004918286,"about_ca_system_score_gemma":0.00024506688,"threshold_uncertainty_score":0.9933689},"labels":[],"label_agreement":null},{"id":"W1993766766","doi":"10.1016/j.ejor.2005.04.018","title":"Worker deployment in dual resource constrained systems with a task-type factor","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":34,"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; Dual (grammatical number); Task (project management); Computer science; Cognition; Resource (disambiguation); Cognitive resource theory; Cognitive psychology; Artificial intelligence; Psychology; Economics; Management","score_opus":0.34763784107776896,"score_gpt":0.47826450210505894,"score_spread":0.13062666102728998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993766766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98185396,0.0005337832,0.0034309933,0.0036629592,0.00024719173,0.00031921844,0.000014509518,0.00000960969,0.009927762],"genre_scores_gemma":[0.99064124,0.000010870537,0.0053010355,0.00015877027,0.0006594449,0.0000017805618,0.0000017184991,0.000031037853,0.003194105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9866495,0.0046167164,0.0015982643,0.00040058588,0.0062867403,0.0004481993],"domain_scores_gemma":[0.9931158,0.002877679,0.0003274278,0.0004130627,0.002946235,0.00031982778],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.025264343,0.00016101975,0.00034448766,0.0012322955,0.00024099115,0.001359913,0.0008637536,0.00003327677,0.0011748741],"category_scores_gemma":[0.00815271,0.00009909065,0.000071295566,0.0013269633,0.00023060894,0.00064371113,0.00023374439,0.0008398765,0.0007372921],"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.0108211255,0.0019048664,0.052503463,0.000026372101,0.00033412676,0.018553985,0.01635363,0.3135682,0.048006523,0.006590413,0.2558997,0.2754376],"study_design_scores_gemma":[0.00531257,0.0015794868,0.12778066,0.00065144076,0.000006899941,0.002303404,0.0035406125,0.025962614,0.000309978,0.00009374467,0.8320296,0.00042902798],"about_ca_topic_score_codex":0.0000047800154,"about_ca_topic_score_gemma":0.000014373457,"teacher_disagreement_score":0.57612985,"about_ca_system_score_codex":0.00020740932,"about_ca_system_score_gemma":0.00061260496,"threshold_uncertainty_score":0.9997382},"labels":[],"label_agreement":null},{"id":"W1994217814","doi":"10.1016/j.ejor.2010.05.006","title":"Network DEA: Additive efficiency decomposition","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":323,"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":"Computer science; Process (computing); Set (abstract data type); Decomposition; Function (biology); Data envelopment analysis; Mathematical optimization; Black box; Mathematics; Artificial intelligence","score_opus":0.14422685973342436,"score_gpt":0.4682453511546586,"score_spread":0.32401849142123423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994217814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8791957,0.0002009847,0.03942291,0.005800883,0.0012575252,0.00015854104,0.00001236121,0.000012914196,0.07393821],"genre_scores_gemma":[0.988874,0.000010180929,0.007992807,0.0002667051,0.0017303545,8.372562e-7,0.0000045138904,0.000017166618,0.0011033928],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98880965,0.003822662,0.0012404366,0.00035471198,0.0053260326,0.00044648803],"domain_scores_gemma":[0.9887701,0.0039216313,0.00037658415,0.000432791,0.0062245713,0.00027432456],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.053287588,0.00012250392,0.00025401285,0.0008273114,0.00093170564,0.00092840765,0.0016737533,0.000036160665,0.0021203284],"category_scores_gemma":[0.015555044,0.00008508169,0.00018949239,0.0021418694,0.00043243196,0.0006067416,0.000227195,0.0014331541,0.0017548229],"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.00065812794,0.0013182781,0.008778609,0.000004982315,0.00016322428,0.0018591917,0.0025684454,0.13324657,0.15151393,0.089594126,0.49787885,0.11241565],"study_design_scores_gemma":[0.0030927935,0.0033684203,0.3750698,0.00024040027,0.00007342798,0.0020300641,0.0014724741,0.061104856,0.005576238,0.038022876,0.5089466,0.0010020923],"about_ca_topic_score_codex":0.0000029539547,"about_ca_topic_score_gemma":0.0000130163135,"teacher_disagreement_score":0.36629117,"about_ca_system_score_codex":0.000054972734,"about_ca_system_score_gemma":0.00053340814,"threshold_uncertainty_score":0.9990224},"labels":[],"label_agreement":null},{"id":"W1994948315","doi":"10.1016/j.ejor.2014.03.009","title":"Optimal credit period and lot size for deteriorating items with expiration dates under two-level trade credit financing","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":211,"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":"Trade credit; Expiration; Period (music); Business; Finance; Expiration date; Economics; Medicine","score_opus":0.10769701695188363,"score_gpt":0.3142374156106111,"score_spread":0.20654039865872745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994948315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91513515,0.00012410239,0.066656515,0.008684059,0.00041446544,0.000528054,0.000006515065,0.000024307752,0.008426857],"genre_scores_gemma":[0.98428696,0.0000063376337,0.009787143,0.0007537836,0.00462532,0.000009583186,0.000018431498,0.00004079566,0.0004716378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998139,0.00016167629,0.00044344962,0.00022691699,0.0007344182,0.00029451345],"domain_scores_gemma":[0.9987935,0.00026650014,0.00020456914,0.00012554623,0.0005701266,0.00003974923],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004710227,0.00014518255,0.00017631093,0.0002541662,0.0005799953,0.0011566203,0.00026659766,0.000017112348,0.0001358979],"category_scores_gemma":[0.0008733465,0.00011338555,0.000047946214,0.00020617894,0.0001134643,0.0014659158,0.00012972234,0.00025488873,0.000018217104],"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.005912773,0.0015047113,0.025219737,0.0022831575,0.0009889388,0.00069402216,0.0065437783,0.21435592,0.17284593,0.24625267,0.19731237,0.126086],"study_design_scores_gemma":[0.015129441,0.003198101,0.121516325,0.0011968012,0.00015761942,0.00020120431,0.009805622,0.36806494,0.0015036894,0.0012052713,0.47668907,0.0013319274],"about_ca_topic_score_codex":0.000010965229,"about_ca_topic_score_gemma":0.000013185571,"teacher_disagreement_score":0.27937672,"about_ca_system_score_codex":0.00004559559,"about_ca_system_score_gemma":0.00006869308,"threshold_uncertainty_score":0.99988025},"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":"W1995568788","doi":"10.1016/j.ejor.2015.03.007","title":"Selective vehicle routing for a mobile blood donation system","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Blood donation and transfusion practices","field":"Business, Management and Accounting","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Türkiye Bilimler Akademisi","keywords":"Computer science; Vehicle routing problem; Pareto principle; Heuristic; Operations research; Routing (electronic design automation); Blood donor; Set (abstract data type); Turkish; Blood collection; Data collection; Operations management; Engineering; Medicine; Computer network; Mathematics; Statistics; Emergency medicine; Artificial intelligence","score_opus":0.10242848574103644,"score_gpt":0.3459722019811122,"score_spread":0.24354371624007579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995568788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79453194,0.0003606945,0.008744924,0.0056956518,0.0008559676,0.00101277,0.000007836052,0.000071375616,0.18871883],"genre_scores_gemma":[0.99627376,0.0000048556467,0.0011161574,0.00024625185,0.0019361725,0.000012444369,0.000009849477,0.000023406415,0.00037709952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980314,0.00024774118,0.0004199375,0.00013899372,0.00097600446,0.00018595085],"domain_scores_gemma":[0.9945254,0.00026907865,0.00023139457,0.00007466679,0.00485957,0.000039902774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0098461695,0.00007848972,0.000117949145,0.0003946773,0.00035981755,0.00060228474,0.00024974215,0.000019046347,0.000051512776],"category_scores_gemma":[0.001445058,0.00006542451,0.00006419577,0.00047332048,0.00003568982,0.0017812815,0.000057924593,0.00029973802,0.0001616149],"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.0029114806,0.0025609166,0.015267875,0.00068610243,0.0008409894,0.00049766863,0.0034684837,0.015501907,0.031632967,0.791557,0.0847595,0.050315116],"study_design_scores_gemma":[0.02465585,0.0018973302,0.026353596,0.0006770839,0.0003423586,0.0003812196,0.019263351,0.0876316,0.0050001447,0.0023774847,0.8305921,0.0008278742],"about_ca_topic_score_codex":0.000019576712,"about_ca_topic_score_gemma":0.000005398986,"teacher_disagreement_score":0.7891795,"about_ca_system_score_codex":0.000055733974,"about_ca_system_score_gemma":0.00019352575,"threshold_uncertainty_score":0.58078456},"labels":[],"label_agreement":null},{"id":"W1995773479","doi":"10.1016/j.ejor.2005.01.038","title":"An interval nonlinear program for the planning of waste management systems with economies-of-scale effects—A case study for the region of Hamilton, Ontario, Canada","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Northern British Columbia; Dalhousie University; University of Regina","funders":"","keywords":"Nonlinear system; Interval (graph theory); Scale (ratio); Function (biology); Operations research; Economies of scale; Exponential function; Computer science; Quadratic equation; Nonlinear programming; Municipal solid waste; Mathematical optimization; Economics; Engineering; Mathematics; Microeconomics; Waste management; Physics","score_opus":0.041876288410672875,"score_gpt":0.2952712016151384,"score_spread":0.25339491320446556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995773479","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9714597,0.00018741013,0.02594038,0.00008065316,0.00009712651,0.0018479701,0.000005642436,0.000004280959,0.00037684685],"genre_scores_gemma":[0.9954556,0.0000095119485,0.003992434,0.000004347954,0.00017762375,0.00003609306,0.000005543811,0.000021905713,0.00029694056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988832,0.00016378523,0.0004155079,0.000076818564,0.00032858487,0.00013209668],"domain_scores_gemma":[0.99908406,0.00025038482,0.00011746306,0.00015648767,0.0003559916,0.000035639092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015811047,0.00007791781,0.00014450544,0.00010370631,0.00012887629,0.0000716036,0.0002971474,0.0000070481933,0.0000029313396],"category_scores_gemma":[0.0000134651955,0.000044270626,0.000039470655,0.000085604835,0.000041238603,0.00013274609,0.00003090753,0.0001314319,1.0421566e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025380534,0.00009942052,0.00084748823,0.00019588007,0.00030876644,0.00009144147,0.0029059008,0.98838854,0.000018356,0.00002210483,0.0009768846,0.0058914386],"study_design_scores_gemma":[0.0021679716,0.0031771816,0.0035302804,0.00027976607,0.00012074079,0.00012353719,0.012409507,0.96080816,0.0004098578,6.278114e-7,0.016869359,0.000103026854],"about_ca_topic_score_codex":0.008593515,"about_ca_topic_score_gemma":0.052671883,"teacher_disagreement_score":0.04407837,"about_ca_system_score_codex":0.00010389876,"about_ca_system_score_gemma":0.00006039021,"threshold_uncertainty_score":0.9980084},"labels":[],"label_agreement":null},{"id":"W1995986371","doi":"10.1016/j.ejor.2004.01.039","title":"A simple method for computation of fuzzy linear regression","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":171,"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; University of Saskatchewan","funders":"","keywords":"Simple (philosophy); Fuzzy logic; Computation; Variable (mathematics); Simple linear regression; Mathematics; Computer science; Mathematical optimization; Regression; Regression analysis; Algorithm; Artificial intelligence; Statistics","score_opus":0.2072447309299977,"score_gpt":0.4825660956785808,"score_spread":0.27532136474858304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995986371","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.063489355,0.0001291503,0.9319579,0.00096162385,0.00012498144,0.00038395444,0.000020589872,0.0000073189617,0.0029251399],"genre_scores_gemma":[0.5518603,0.000013449507,0.44750777,0.000019978947,0.00038031305,0.0000020944349,0.000011901116,0.000025384565,0.00017880321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974392,0.0008151775,0.00068695616,0.00010764568,0.00080282014,0.00014817981],"domain_scores_gemma":[0.9963886,0.0006246252,0.00029345977,0.00010113354,0.0025100072,0.00008215501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007682914,0.00007613623,0.00020258126,0.000248812,0.00016773303,0.000045591325,0.0001816025,0.000025225192,0.000020302583],"category_scores_gemma":[0.0024171576,0.00005555793,0.000098732606,0.00023261453,0.000041035728,0.00019261337,0.000041632476,0.00021283755,0.0000058744085],"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.0015390243,0.0012301578,0.00023872261,0.0009766902,0.00028416532,0.00014345358,0.0067801704,0.5739457,0.06434629,0.28930083,0.042740915,0.018473875],"study_design_scores_gemma":[0.030898819,0.013157224,0.0056206514,0.0056203995,0.00018291842,0.0009365764,0.005333279,0.21935694,0.073894985,0.6155909,0.028218113,0.0011892453],"about_ca_topic_score_codex":0.000006292018,"about_ca_topic_score_gemma":0.0000021427034,"teacher_disagreement_score":0.48837095,"about_ca_system_score_codex":0.00007458845,"about_ca_system_score_gemma":0.0002703515,"threshold_uncertainty_score":0.28937382},"labels":[],"label_agreement":null},{"id":"W1996653774","doi":"10.1016/j.ejor.2006.12.059","title":"Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Graph theory and applications","field":"Mathematics","cited_by":55,"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":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Extremal graph theory; Vertex (graph theory); Upper and lower bounds; Discrete mathematics; Graph; Chordal graph; Line graph; Voltage graph","score_opus":0.10577459983019742,"score_gpt":0.3979588401396671,"score_spread":0.29218424030946966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996653774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8531373,0.00082666974,0.10496415,0.0055965804,0.00028084344,0.0019756982,0.00014648681,0.000025956326,0.0330463],"genre_scores_gemma":[0.98636705,0.000020921036,0.012262684,0.00012917427,0.00021757722,0.000010626657,0.000009031095,0.000040303752,0.0009426242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963825,0.0011077372,0.000837842,0.00019068997,0.0010528438,0.0004284134],"domain_scores_gemma":[0.99462074,0.0027580701,0.00016364145,0.00034033685,0.0019070868,0.00021010348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024383802,0.00012881374,0.00022689231,0.000515685,0.00058413134,0.00009222646,0.0007524376,0.000041462186,0.0002624534],"category_scores_gemma":[0.0017950658,0.000085735446,0.00018146976,0.00095857086,0.00021232772,0.00016721955,0.000109526474,0.0006506211,0.000026725153],"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.00027372217,0.00023636186,0.00023209528,0.000028898483,0.00010308178,0.000017560988,0.0007555925,0.00045031385,0.012255099,0.9785454,0.0065994696,0.0005023922],"study_design_scores_gemma":[0.0015563242,0.0011248807,0.0049313097,0.00015171281,0.00004727472,0.0002550799,0.0010957734,0.00013409286,0.016709775,0.9628754,0.010915498,0.00020284111],"about_ca_topic_score_codex":0.000004327893,"about_ca_topic_score_gemma":0.0000032719277,"teacher_disagreement_score":0.13322975,"about_ca_system_score_codex":0.000041361065,"about_ca_system_score_gemma":0.00025410994,"threshold_uncertainty_score":0.84509873},"labels":[],"label_agreement":null},{"id":"W1996809294","doi":"10.1016/s0377-2217(99)00013-2","title":"Determination of economic production–shipment policy for a single-vendor–single-buyer system","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":258,"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":"Concordia University","keywords":"Vendor; Production (economics); Product (mathematics); Business; Operations management; Computer science; Operations research; Industrial organization; Marketing; Economics; Microeconomics; Engineering; Mathematics","score_opus":0.11505682081255697,"score_gpt":0.32577948245845556,"score_spread":0.2107226616458986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996809294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57651466,0.00031868106,0.0026151843,0.015735807,0.0016650684,0.0017897873,0.000015383164,0.00005397006,0.4012915],"genre_scores_gemma":[0.98997146,0.00001461171,0.0009909868,0.0001649166,0.0048867557,0.000010650507,0.000015109236,0.000032866836,0.0039126333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814993,0.0001623626,0.0006524497,0.00018698446,0.00060338853,0.00024487352],"domain_scores_gemma":[0.9987029,0.000071137205,0.00025087118,0.00016095306,0.00078620453,0.000027967253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040240046,0.0001098196,0.00017055603,0.000747192,0.00023295009,0.00029910955,0.0003450827,0.00001609201,0.0005109262],"category_scores_gemma":[0.0003333474,0.00009782846,0.000111757516,0.00020920853,0.00008287021,0.00091493,0.00007101297,0.0001372928,0.00023701339],"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.0031114272,0.002721309,0.0013888347,0.0027846294,0.00045955955,0.00028001895,0.0015488842,0.021617392,0.06545267,0.21815024,0.116667554,0.5658175],"study_design_scores_gemma":[0.0031762025,0.0007921471,0.0025358656,0.00075532077,0.0000663982,0.000098566125,0.0015388288,0.012723869,0.0061883926,0.0010372399,0.97067463,0.00041255885],"about_ca_topic_score_codex":0.000022458138,"about_ca_topic_score_gemma":0.000006348919,"teacher_disagreement_score":0.85400707,"about_ca_system_score_codex":0.00035497113,"about_ca_system_score_gemma":0.000109013905,"threshold_uncertainty_score":0.55942833},"labels":[],"label_agreement":null},{"id":"W1998027477","doi":"10.1016/j.ejor.2012.07.016","title":"Price competition and store competition: Store brands vs. national brand","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":138,"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":"Competition (biology); Business; Store brand; National brand; Context (archaeology); Product (mathematics); Advertising; Marketing; Brand management; Product differentiation; Economics; Microeconomics","score_opus":0.0824049495917229,"score_gpt":0.330539131485063,"score_spread":0.24813418189334008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998027477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87728995,0.0007661141,0.0008706423,0.0041069835,0.000525802,0.00018397946,0.00000846838,0.000019114805,0.11622895],"genre_scores_gemma":[0.9954115,0.000050358165,0.00031374683,0.00053499127,0.003205556,0.0000016797329,0.00003385487,0.000021699807,0.0004265758],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9977297,0.00026659903,0.00038113925,0.00012488931,0.0012305321,0.00026712075],"domain_scores_gemma":[0.99783516,0.00023690774,0.00015036714,0.00007704294,0.001640627,0.00005987151],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0070266235,0.00011080456,0.0001522695,0.00048114854,0.0005264193,0.00048148405,0.0001859772,0.000021902584,0.0014335717],"category_scores_gemma":[0.0004572461,0.000096775715,0.000057404533,0.00034090976,0.0001320961,0.0018700968,0.00014428195,0.00045026024,0.00015898852],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017174408,0.0010848995,0.5372014,0.0004682508,0.00021188083,0.00023590407,0.0014257648,0.00024611986,0.01242721,0.3466821,0.07186059,0.02643843],"study_design_scores_gemma":[0.0012434608,0.000048999234,0.70192564,0.00012261668,0.000020094785,0.0001312661,0.00017529386,0.000270088,0.000025669231,0.00019139657,0.29569373,0.0001517697],"about_ca_topic_score_codex":0.000009923259,"about_ca_topic_score_gemma":0.000004713803,"teacher_disagreement_score":0.34649068,"about_ca_system_score_codex":0.000057329733,"about_ca_system_score_gemma":0.00009222711,"threshold_uncertainty_score":0.99947923},"labels":[],"label_agreement":null},{"id":"W1998145039","doi":"10.1016/s0377-2217(01)00233-8","title":"Optimal pricing for service facilities with self-optimizing customers","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Calgary","funders":"National Science Foundation","keywords":"Service (business); Computer science; Operations research; Business; Operations management; Marketing; Mathematics; Economics","score_opus":0.09850947160579349,"score_gpt":0.2896211196052765,"score_spread":0.191111647999483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998145039","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.4598661,0.00055216264,0.007491032,0.021291008,0.0006611621,0.001254477,0.000009310161,0.00011342025,0.5087613],"genre_scores_gemma":[0.97849506,0.000038399718,0.011702069,0.002017673,0.002298159,0.000010705071,0.000009500313,0.00005331406,0.0053751],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815166,0.000099065204,0.00035721736,0.00016663047,0.0008934593,0.0003319836],"domain_scores_gemma":[0.9980408,0.00011273388,0.00013838941,0.00012347722,0.0015438591,0.00004073991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031488,0.00012208606,0.00014348279,0.00050985574,0.00045543164,0.00061969523,0.00039028746,0.00001289698,0.00083329243],"category_scores_gemma":[0.0002222507,0.00009388494,0.00006355899,0.00044796627,0.00005374813,0.0012789071,0.0001309683,0.0002753679,0.00028587758],"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.0016224543,0.0014784874,0.0026811035,0.002272857,0.0011440066,0.0009377675,0.010019565,0.35523865,0.003063108,0.083193325,0.51982707,0.018521603],"study_design_scores_gemma":[0.0018851751,0.0002477717,0.0005073378,0.00014543429,0.00003029214,0.000026896741,0.0045933453,0.064816885,0.000057296358,0.000034336554,0.9274311,0.00022412094],"about_ca_topic_score_codex":0.000012148493,"about_ca_topic_score_gemma":0.0000030088538,"teacher_disagreement_score":0.51862895,"about_ca_system_score_codex":0.000077496705,"about_ca_system_score_gemma":0.00003972814,"threshold_uncertainty_score":0.9123968},"labels":[],"label_agreement":null},{"id":"W1998829509","doi":"10.1016/j.ejor.2004.04.026","title":"A game-theoretic formulation of joint implementation of environmental projects","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":78,"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":"","keywords":"Joint (building); Constraint (computer-aided design); Computer science; Welfare; Game theory; Joint Implementation; Interpretation (philosophy); Operations research; Microeconomics; Mathematical economics; Economics; Mathematics; Engineering; Emissions trading","score_opus":0.23558381901118525,"score_gpt":0.3578740084426785,"score_spread":0.12229018943149328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998829509","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99273294,0.00023572883,0.00091301097,0.0005156038,0.00006235293,0.00014596601,0.00014622005,0.0000012007963,0.005247002],"genre_scores_gemma":[0.99847573,0.000348155,0.00094114855,0.00003101035,0.00013050046,0.0000014908775,0.000020169746,0.000015144176,0.000036677997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99858904,0.00007865553,0.0009502119,0.00010645976,0.000119316435,0.00015629243],"domain_scores_gemma":[0.9992166,0.000044390177,0.00048715316,0.00010509026,0.00009059752,0.00005613305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031401003,0.00006303771,0.00020007332,0.0004129979,0.0000558053,0.000029404344,0.00014968368,0.000016687429,0.00074655673],"category_scores_gemma":[0.00010995604,0.000065550135,0.00008909725,0.000110192406,0.000090808455,0.00028884062,0.000056815577,0.00014721129,0.00008363407],"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.0002923057,0.00065968855,0.032477465,0.00021684088,0.00019066356,0.000027858707,0.018240599,0.0044142255,0.027566742,0.9112111,0.00033345347,0.0043691057],"study_design_scores_gemma":[0.009947794,0.004353148,0.7848541,0.00030593426,0.000021916407,0.00017513147,0.00781081,0.0016826186,0.07250851,0.11402963,0.0037854176,0.0005249924],"about_ca_topic_score_codex":0.00003475314,"about_ca_topic_score_gemma":0.0000055511446,"teacher_disagreement_score":0.7971814,"about_ca_system_score_codex":0.00017653049,"about_ca_system_score_gemma":0.000069156755,"threshold_uncertainty_score":0.8174273},"labels":[],"label_agreement":null},{"id":"W1998833643","doi":"10.1016/j.ejor.2007.10.057","title":"Service network design with management and coordination of multiple fleets","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":167,"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é de Montréal; Natural Sciences and Engineering Research Council; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Fleet management; Computer science; Service (business); Network planning and design; Throughput; Synchronization (alternating current); Operations research; Flow network; Service system; Computer network; Business; Mathematical optimization; Telecommunications; Engineering","score_opus":0.07081002622745247,"score_gpt":0.29609519601836465,"score_spread":0.22528516979091218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998833643","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.08581064,0.00070177094,0.8650084,0.00037743285,0.00012527924,0.00027355147,0.000003152745,0.000014718904,0.04768506],"genre_scores_gemma":[0.95475274,0.00006775284,0.04472395,0.00002317516,0.00016148103,3.5965016e-7,0.0000024097724,0.0000143838615,0.00025373843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99900514,0.0001325819,0.00024974006,0.000050816667,0.00041894236,0.00014277273],"domain_scores_gemma":[0.9990952,0.00019788345,0.000034555105,0.000057216108,0.0005439365,0.00007120181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004141732,0.000050296647,0.000075425174,0.00011364917,0.00006893941,0.00003892969,0.00009561457,0.0000091265365,0.000049966948],"category_scores_gemma":[0.00005412915,0.000039271858,0.000009595838,0.0001839183,0.00003661701,0.000086247506,0.000029442921,0.0001718399,0.0000040812993],"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.00033258356,0.00007172602,0.0038987666,0.00016781078,0.00016029448,0.0007106013,0.00036939906,0.9338971,0.0013032408,0.004792506,0.020712262,0.03358373],"study_design_scores_gemma":[0.005647397,0.0022247687,0.55827826,0.0009277754,0.000078350364,0.00064449664,0.0011153555,0.3176532,0.0040881378,0.00066743465,0.108067594,0.00060722325],"about_ca_topic_score_codex":0.0000026137725,"about_ca_topic_score_gemma":0.0000070619467,"teacher_disagreement_score":0.8689421,"about_ca_system_score_codex":0.000022455319,"about_ca_system_score_gemma":0.000018054892,"threshold_uncertainty_score":0.16014598},"labels":[],"label_agreement":null},{"id":"W1999755164","doi":"10.1016/j.ejor.2009.01.061","title":"Tradeoff-based decomposition and decision-making in multiobjective programming","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decomposition; Computer science; Mathematical optimization; Multiobjective programming; Multi-objective optimization; Operations research; Mathematics","score_opus":0.13138254451192238,"score_gpt":0.48951592855266274,"score_spread":0.35813338404074035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999755164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8418684,0.0003441125,0.15207891,0.0017816428,0.000106484185,0.00021947894,0.0000022702393,0.0000055095256,0.0035931664],"genre_scores_gemma":[0.9261208,0.00006582259,0.0735113,0.0001268385,0.00014132881,7.151632e-7,0.0000015747603,0.0000072298776,0.00002436901],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9953501,0.0013613107,0.00082474627,0.00022337686,0.0020301358,0.00021029518],"domain_scores_gemma":[0.9962309,0.0019052444,0.00019041689,0.00013285535,0.0014231838,0.000117398544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016030842,0.00008285107,0.00016636653,0.0011350069,0.00026321632,0.0006205097,0.0003503897,0.00002413293,0.00006832849],"category_scores_gemma":[0.0042544776,0.00006090084,0.00005785606,0.000967201,0.000081602935,0.00065833365,0.000031376407,0.00041587328,0.000027255785],"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.0004082951,0.00015416213,0.0054317173,5.325589e-7,0.000004078426,0.00025221353,0.0007790482,0.057762753,0.0005844551,0.0010724697,0.000710654,0.93283963],"study_design_scores_gemma":[0.0025678226,0.0018077618,0.86178493,0.00035694966,0.0000057711404,0.00026827867,0.000936532,0.1079447,0.00032723148,0.014263009,0.009504919,0.00023209592],"about_ca_topic_score_codex":0.0000016417041,"about_ca_topic_score_gemma":0.0000055999726,"teacher_disagreement_score":0.93260753,"about_ca_system_score_codex":0.00007603426,"about_ca_system_score_gemma":0.00022601777,"threshold_uncertainty_score":0.5983589},"labels":[],"label_agreement":null},{"id":"W2000223883","doi":"10.1016/j.ejor.2004.07.003","title":"Decision-aid to improve organisational performance","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Quality and Supply Management","field":"Business, Management and Accounting","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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Process management; Operations research; Operations management; Business; Mathematics; Economics","score_opus":0.06953285252709988,"score_gpt":0.3331978992906271,"score_spread":0.2636650467635272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000223883","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91694033,0.000035684232,0.018783707,0.01679966,0.0005979987,0.0002634347,0.0000029777243,0.000015731579,0.046560496],"genre_scores_gemma":[0.98730075,0.000012174725,0.0066922777,0.0026102893,0.0025897436,0.0000024907129,0.0000073687715,0.00002363638,0.00076125417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739546,0.00008163418,0.00050611474,0.00017417326,0.0015733914,0.0002692052],"domain_scores_gemma":[0.9981871,0.000103603525,0.00010016316,0.00016267344,0.001396854,0.00004955516],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006584647,0.00010008616,0.00012296833,0.0005758108,0.00043520654,0.0006199503,0.00056230614,0.000014111205,0.0010933962],"category_scores_gemma":[0.0010279003,0.00008221644,0.000060378454,0.0005771917,0.000063965694,0.0013152465,0.0003180754,0.0003518236,0.003613658],"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.0019607712,0.0011837373,0.00715391,0.00026072937,0.00021619211,0.00082533504,0.0013160874,0.14589225,0.012033672,0.55268115,0.15231626,0.12415991],"study_design_scores_gemma":[0.0032319056,0.00039992016,0.08774192,0.00022377705,0.000014706889,0.000037180587,0.00054274907,0.0007959832,0.0006426522,0.0076011303,0.89845127,0.00031683242],"about_ca_topic_score_codex":0.000015181683,"about_ca_topic_score_gemma":0.0000051670936,"teacher_disagreement_score":0.746135,"about_ca_system_score_codex":0.00011616361,"about_ca_system_score_gemma":0.00017640243,"threshold_uncertainty_score":0.99981976},"labels":[],"label_agreement":null},{"id":"W2000494436","doi":"10.1016/j.ejor.2012.01.048","title":"Measuring returns to scale in DEA models when the firm is regulated","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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é du Québec à Montréal","funders":"","keywords":"Convexity; Data envelopment analysis; Returns to scale; Constraint (computer-aided design); Efficient frontier; Econometrics; Scale (ratio); Mathematical optimization; Economics; Computer science; Mathematics; Production (economics); Microeconomics; Financial economics","score_opus":0.437028573260653,"score_gpt":0.45286194187999645,"score_spread":0.01583336861934348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000494436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95619917,0.0006273982,0.004774204,0.02023658,0.00018208625,0.00015170359,0.0000039736738,0.0000043053474,0.017820574],"genre_scores_gemma":[0.9932163,0.000012323082,0.0027452386,0.0005692239,0.00039770696,0.000001115884,5.2871786e-7,0.000017089491,0.0030404804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9881397,0.004320102,0.0011437306,0.00025706532,0.0056335954,0.0005058384],"domain_scores_gemma":[0.994856,0.0013750482,0.00018180837,0.00052874134,0.0027477285,0.0003106494],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0706673,0.00010778595,0.00022738142,0.0010247347,0.00045746184,0.0006537309,0.0017994733,0.000025404452,0.00063448545],"category_scores_gemma":[0.007167806,0.00006201486,0.00013455073,0.001968489,0.00015479085,0.0010113169,0.00034142897,0.00074966357,0.00075216044],"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.0007207628,0.0009949264,0.068285115,0.00000929441,0.00015689142,0.00023425689,0.09780048,0.46107975,0.03074092,0.0069185207,0.30018732,0.03287178],"study_design_scores_gemma":[0.0023747308,0.00093518,0.6223057,0.0006184311,0.00004829693,0.00061761786,0.009213658,0.18293254,0.0088624405,0.024368843,0.14682165,0.00090090616],"about_ca_topic_score_codex":0.000020354364,"about_ca_topic_score_gemma":0.000036818703,"teacher_disagreement_score":0.5540206,"about_ca_system_score_codex":0.00015329853,"about_ca_system_score_gemma":0.0002676022,"threshold_uncertainty_score":0.9667752},"labels":[],"label_agreement":null},{"id":"W2000901823","doi":"10.1016/j.ejor.2006.02.043","title":"Multi-level resource allocation for HIV prevention: A model for developing countries","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"HIV/AIDS Research and Interventions","field":"Medicine","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":"Western University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Resource allocation; Equity (law); Human immunodeficiency virus (HIV); Heuristic; Business; Computer science; Operations research; Actuarial science; Environmental economics; Economics; Medicine; Mathematics","score_opus":0.23215672037232005,"score_gpt":0.4489987035341629,"score_spread":0.21684198316184283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000901823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010219074,0.00036486212,0.9646018,0.020117817,0.00002146276,0.0008898098,0.0000957553,0.000009142525,0.0036802667],"genre_scores_gemma":[0.30835724,0.00012568581,0.4108608,0.0002757437,0.0014978141,0.000107897366,0.00042325282,0.00007719519,0.27827436],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975578,0.0003617919,0.0006687952,0.00017727786,0.00089699845,0.00033729998],"domain_scores_gemma":[0.99524254,0.00031361458,0.000117113326,0.0001354902,0.0040551834,0.00013603896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058124037,0.0000979612,0.00018501349,0.0004005445,0.00046209843,0.00015972623,0.00022094362,0.000028637618,0.00006934272],"category_scores_gemma":[0.0017088302,0.00008167615,0.00021160167,0.00018692794,0.00011882511,0.0002808812,0.000049347764,0.00029301632,0.000041107603],"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.0021956118,0.0007009528,0.00029785297,0.00038932377,0.00020330468,0.000043640757,0.00052523793,0.004139671,0.01601313,0.037180845,0.9280895,0.010220953],"study_design_scores_gemma":[0.0085576,0.0040413095,0.005428955,0.0010353926,0.00004566391,0.00020043866,0.00032452182,0.50696343,0.0034777413,0.0009745325,0.46874794,0.00020243808],"about_ca_topic_score_codex":0.0000024329916,"about_ca_topic_score_gemma":0.00001427338,"teacher_disagreement_score":0.553741,"about_ca_system_score_codex":0.00020585199,"about_ca_system_score_gemma":0.0011531727,"threshold_uncertainty_score":0.3554134},"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":"W2003435156","doi":"10.1016/s0377-2217(00)00304-0","title":"PariTOP: A goal programming-based software for real estate assessment","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","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":"Québec Metro High Tech Park (Canada); Modellium (Canada); Université Laval","funders":"","keywords":"Computer science; Software; Software engineering; Programming language; Operations research; Mathematics","score_opus":0.07453186034599547,"score_gpt":0.3809128863409613,"score_spread":0.30638102599496586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003435156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015128581,0.00004374311,0.9662268,0.0008449567,0.00019095342,0.00048099898,0.0000069681364,0.000087270586,0.016989732],"genre_scores_gemma":[0.42900988,0.00021234943,0.5697113,0.00004523469,0.00046183905,0.000026628537,0.000032750097,0.00007383495,0.00042614824],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983046,0.00022824839,0.00043436317,0.00009800149,0.00063381996,0.00030099097],"domain_scores_gemma":[0.9983092,0.00033446713,0.000044700526,0.00010221519,0.0010248078,0.00018459598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030442188,0.000095637675,0.00013825482,0.00017717344,0.00017765503,0.0002628004,0.00021662438,0.000019870104,0.00011477782],"category_scores_gemma":[0.0005445057,0.00008083178,0.000074999494,0.00026476564,0.000060646034,0.00018744812,0.00002462061,0.00034699496,0.000022579146],"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.00019100544,0.0004923697,0.00086894975,0.00026527396,0.00013333454,0.00039295762,0.00048827878,0.40747255,0.0010752354,0.0037563115,0.013078673,0.5717851],"study_design_scores_gemma":[0.0033147198,0.0015145523,0.0020709895,0.00022814418,0.000027097261,0.00014171998,0.00034022648,0.48179492,0.00033894926,0.00028211108,0.5095745,0.00037206346],"about_ca_topic_score_codex":0.0000011093205,"about_ca_topic_score_gemma":0.0000019887445,"teacher_disagreement_score":0.571413,"about_ca_system_score_codex":0.00009896247,"about_ca_system_score_gemma":0.0001865042,"threshold_uncertainty_score":0.32962242},"labels":[],"label_agreement":null},{"id":"W2004098306","doi":"10.1016/s0377-2217(02)00655-0","title":"Customer lead time management when both demand and price are lead time sensitive","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"University of Waterloo; McGill University","funders":"","keywords":"Lead time; Lead (geology); Microeconomics; Economies of scale; Economics; Service (business); Function (biology); Investment (military); Scale (ratio); Business; Industrial organization; Marketing; Operations management","score_opus":0.04295795817704477,"score_gpt":0.26084506562753457,"score_spread":0.21788710745048978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004098306","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.46657518,0.00008162845,0.00023885876,0.0006424752,0.00006969762,0.00014859493,0.0000023806876,0.000008672336,0.5322325],"genre_scores_gemma":[0.9751737,0.000045912606,0.00089585525,0.00085436244,0.00065966934,9.841273e-7,0.000010761819,0.000039157305,0.022319593],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862343,0.000049471575,0.0003668134,0.00018608899,0.0004812207,0.00029298337],"domain_scores_gemma":[0.99910796,0.000077109566,0.00017092226,0.00010835026,0.00049383513,0.000041827734],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004047049,0.00012699416,0.00018045,0.00036341467,0.00027593508,0.0013810204,0.0001873442,0.000018414652,0.0005062379],"category_scores_gemma":[0.00021228162,0.00010496324,0.000054795495,0.00017082432,0.000096962154,0.003018742,0.00016185771,0.00027094997,0.0043004532],"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.0010901644,0.0009885365,0.005057227,0.000514395,0.0011217694,0.0045998143,0.00085210626,0.00587735,0.005518489,0.21499076,0.7279245,0.03146486],"study_design_scores_gemma":[0.0049000136,0.0002979525,0.05159325,0.00062121166,0.00009935618,0.00047206055,0.002644817,0.015595806,0.00030003078,0.0082585765,0.9141278,0.0010891235],"about_ca_topic_score_codex":0.0000024577307,"about_ca_topic_score_gemma":0.0000011050194,"teacher_disagreement_score":0.5099129,"about_ca_system_score_codex":0.000051509152,"about_ca_system_score_gemma":0.00003414264,"threshold_uncertainty_score":0.99965566},"labels":[],"label_agreement":null},{"id":"W2004102594","doi":"10.1016/j.ejor.2012.02.021","title":"Multi-criteria analysis and the resolution of sustainable development dilemmas: A stakeholder management approach","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":153,"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":"Stakeholder; Variety (cybernetics); Sustainable development; Stakeholder analysis; Corporate governance; Business; Process management; Management science; Environmental resource management; Computer science; Economics; Political science; Management","score_opus":0.09652732781226708,"score_gpt":0.3090058861997092,"score_spread":0.21247855838744212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004102594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6903294,0.0029250644,0.1794128,0.00533405,0.00034284906,0.0031384788,0.0000035507883,0.000042535215,0.11847131],"genre_scores_gemma":[0.9796919,0.000036549707,0.015932186,0.00018546973,0.0004999715,0.000020596946,0.000017461236,0.000025231511,0.003590626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99669296,0.0005973528,0.0007051478,0.00018794794,0.0012673648,0.0005492056],"domain_scores_gemma":[0.9977561,0.00013188772,0.00029689592,0.00024686794,0.0015255002,0.00004271613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021523815,0.00014938552,0.00027151135,0.0015681637,0.0005346117,0.0004814494,0.00049819006,0.000017716317,0.00017870628],"category_scores_gemma":[0.0004665497,0.00010087623,0.00010357059,0.0017132671,0.00027103384,0.0012713274,0.0007892215,0.00028849512,0.0000219364],"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.003059553,0.0029581971,0.04492925,0.003071518,0.006820106,0.0007401967,0.011855672,0.016907567,0.0004344255,0.85655457,0.038530514,0.014138422],"study_design_scores_gemma":[0.008520045,0.00006661432,0.5411773,0.00011161318,0.00081033725,0.000022236862,0.06934267,0.02444224,0.00007323437,0.0004424228,0.35450035,0.0004909358],"about_ca_topic_score_codex":0.000057336332,"about_ca_topic_score_gemma":0.0000028619443,"teacher_disagreement_score":0.8561122,"about_ca_system_score_codex":0.00014274313,"about_ca_system_score_gemma":0.00005585796,"threshold_uncertainty_score":0.74597675},"labels":[],"label_agreement":null},{"id":"W2004174093","doi":"10.1016/j.ejor.2014.06.030","title":"The economic lot-sizing problem with an emission capacity constraint","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":91,"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":"Erasmus+; Erasmus Universiteit Rotterdam; European Commission","keywords":"Mathematical optimization; Heuristic; Constraint (computer-aided design); Sizing; Upper and lower bounds; A priori and a posteriori; Pareto principle; Computer science; Rounding; Mathematics","score_opus":0.0507416958558434,"score_gpt":0.28837834140175145,"score_spread":0.23763664554590805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004174093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79147804,0.000069313115,0.005641402,0.013235005,0.00025554045,0.00057274493,0.000001190018,0.00003346297,0.18871331],"genre_scores_gemma":[0.99520344,0.000009497015,0.0015793414,0.00039474966,0.0019832042,0.0000034472541,0.0000042475613,0.00003271575,0.0007893622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977703,0.0004848151,0.00040842625,0.00018964629,0.00078647595,0.0003603561],"domain_scores_gemma":[0.9982156,0.00025361203,0.00020883167,0.0002306312,0.001042835,0.00004849105],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.014680595,0.000117674346,0.0001222921,0.00028127132,0.0009616489,0.0014604063,0.00063141243,0.000014360999,0.00017412257],"category_scores_gemma":[0.0005452612,0.0000713718,0.000043188866,0.00019530898,0.00025577212,0.0012187288,0.00020866809,0.0004901343,0.00015645844],"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.0011718251,0.00026346187,0.008809227,0.00027017618,0.00024321803,0.0004365128,0.0008066257,0.053026788,0.002305708,0.75957674,0.04852554,0.12456416],"study_design_scores_gemma":[0.001835282,0.0005262353,0.011013233,0.0001895611,0.000023668626,0.00007645911,0.0052772276,0.036611963,0.00013239095,0.005768707,0.93822914,0.00031610148],"about_ca_topic_score_codex":0.00005342643,"about_ca_topic_score_gemma":0.000027309736,"teacher_disagreement_score":0.88970363,"about_ca_system_score_codex":0.00019323951,"about_ca_system_score_gemma":0.00019010805,"threshold_uncertainty_score":0.99957615},"labels":[],"label_agreement":null},{"id":"W2004480472","doi":"10.1016/j.ejor.2006.12.057","title":"Variable neighborhood search for minimum cost berth allocation","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":186,"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":"","keywords":"Variable neighborhood search; Mathematical optimization; Tardiness; Heuristic; Computer science; Minification; Variable (mathematics); Memetic algorithm; Genetic algorithm; Retard; Local search (optimization); Mathematics; Metaheuristic; Job shop scheduling","score_opus":0.08025433142720256,"score_gpt":0.3410985650891733,"score_spread":0.26084423366197074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004480472","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.00802187,0.00032797366,0.82732534,0.00058470375,0.0004027805,0.0003599384,0.000025151821,0.000021293934,0.16293097],"genre_scores_gemma":[0.97945565,0.000057994726,0.017626358,0.00006112996,0.0010848546,0.0000024010008,0.000032079464,0.000040822593,0.0016387313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982568,0.00015601792,0.00046487735,0.00009525317,0.00067546515,0.00035160384],"domain_scores_gemma":[0.9977747,0.00050362706,0.000031476222,0.00011714813,0.0013845054,0.00018852115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009044541,0.000082845865,0.00011581,0.00024096432,0.00017636226,0.00014437658,0.00025337987,0.000025878635,0.0003750756],"category_scores_gemma":[0.00045186284,0.00007321869,0.000044923312,0.00022464227,0.000058659003,0.00017067912,0.000035080535,0.0004234777,0.000044559274],"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.0007722345,0.0005716011,0.002665365,0.00037725255,0.00041077848,0.00066893385,0.0015038985,0.25139242,0.047359593,0.3213732,0.20763466,0.16527009],"study_design_scores_gemma":[0.0038808633,0.0017128842,0.025261851,0.00024327624,0.000040271105,0.00041550325,0.00068564963,0.16321398,0.013689874,0.0016680373,0.7885543,0.0006334941],"about_ca_topic_score_codex":0.0000031353775,"about_ca_topic_score_gemma":0.0000024104838,"teacher_disagreement_score":0.97143376,"about_ca_system_score_codex":0.000096620526,"about_ca_system_score_gemma":0.00017112888,"threshold_uncertainty_score":0.41068146},"labels":[],"label_agreement":null},{"id":"W2004722584","doi":"10.1016/j.ejor.2012.11.031","title":"Economic and economic-statistical designs of an control chart for two-unit series systems with condition-based maintenance","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":53,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Control chart; Markov chain; Chart; Computer science; Mathematical optimization; Series (stratigraphy); Shewhart individuals control chart; Reliability engineering; Constraint (computer-aided design); Failure rate; Statistics; Mathematics; EWMA chart; Engineering; Machine learning","score_opus":0.22638398270364876,"score_gpt":0.4747020835690045,"score_spread":0.24831810086535575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004722584","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.1498171,0.00014483326,0.8473415,0.0005798369,0.00027634995,0.00035458643,0.0005808629,0.0000043699383,0.00090056786],"genre_scores_gemma":[0.97129387,0.0000032929665,0.02788208,0.000029289677,0.0005508222,0.000010025018,0.000008662268,0.000021387566,0.00020060055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675995,0.0011196992,0.00082367874,0.00020601675,0.00076445646,0.0003261753],"domain_scores_gemma":[0.99246335,0.0053909775,0.00030558647,0.0001670208,0.0013239458,0.00034914858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010948461,0.00010913655,0.0003140552,0.00023651817,0.000266794,0.00029308285,0.00037286998,0.000015671698,0.00015223531],"category_scores_gemma":[0.0030608785,0.00007612119,0.000030169911,0.000072025636,0.0004822142,0.0011847687,0.000029570077,0.00023070554,0.00004712939],"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.008264913,0.0003295126,0.028095195,0.00012046211,0.0001862834,0.00014677785,0.0006675788,0.30912662,0.0054338155,0.6318118,0.004546878,0.011270193],"study_design_scores_gemma":[0.03413539,0.023590766,0.24698335,0.0009428831,0.00016112308,0.0023418758,0.010779162,0.5957931,0.009518273,0.035116628,0.038848635,0.0017887605],"about_ca_topic_score_codex":0.0000067180617,"about_ca_topic_score_gemma":0.000007828882,"teacher_disagreement_score":0.82147676,"about_ca_system_score_codex":0.0000981005,"about_ca_system_score_gemma":0.0004494417,"threshold_uncertainty_score":0.37945396},"labels":[],"label_agreement":null},{"id":"W2005671647","doi":"10.1016/s0377-2217(03)00157-7","title":"Multicriteria optimization of an emulsion polymerization process","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Manufacturing Process and Optimization","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":"Université Laval","funders":"","keywords":"Ranking (information retrieval); Emulsion polymerization; Pareto principle; Computer science; Process (computing); Emulsion; Multi-objective optimization; Domain (mathematical analysis); Process engineering; Quality (philosophy); Polymerization; Mathematical optimization; Mathematics; Materials science; Engineering; Polymer; Chemical engineering; Artificial intelligence; Machine learning","score_opus":0.0381574058144369,"score_gpt":0.3217672273903226,"score_spread":0.2836098215758857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005671647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5802218,0.0003046188,0.40897736,0.00006218082,0.00028344293,0.00018002206,0.000006650515,0.000030980897,0.009932951],"genre_scores_gemma":[0.9775569,0.000099749406,0.022111157,0.000008736375,0.000101777565,0.0000011676212,0.000019893518,0.00003285311,0.00006776415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983727,0.00040520454,0.00043443954,0.000089474306,0.0005568947,0.00014132887],"domain_scores_gemma":[0.99877715,0.000041575287,0.00007877101,0.00009766839,0.0009108099,0.000094038456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013366574,0.00008203462,0.000113344075,0.00028691624,0.000105259474,0.00008721086,0.0001718835,0.000023205415,0.0002987777],"category_scores_gemma":[0.00033096145,0.00007303942,0.000026807798,0.00026865807,0.000039879596,0.00056424,0.000010046363,0.00019388276,0.00000496603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002692485,0.00005114803,0.00005881559,0.000053913263,0.0000102966205,0.000007440166,0.00045352321,0.9878885,0.00952499,0.00025213783,0.000039986764,0.0016323135],"study_design_scores_gemma":[0.0011005711,0.0004827733,0.0018702358,0.00015427556,0.000010643534,0.000054515185,0.00034510088,0.77743655,0.21745153,0.00008009819,0.00081772346,0.00019600184],"about_ca_topic_score_codex":6.969639e-7,"about_ca_topic_score_gemma":2.3001226e-7,"teacher_disagreement_score":0.3973351,"about_ca_system_score_codex":0.000029772147,"about_ca_system_score_gemma":0.00005853358,"threshold_uncertainty_score":0.32714066},"labels":[],"label_agreement":null},{"id":"W2006009715","doi":"10.1016/j.ejor.2005.08.023","title":"Exact and heuristic procedures for the material handling circular flow path design problem","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Pickup; Heuristic; Mathematical optimization; Integer programming; Computer science; Path (computing); Shortest path problem; Linear programming; Set (abstract data type); Loop (graph theory); Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.043618645600213064,"score_gpt":0.2854167476683341,"score_spread":0.24179810206812102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006009715","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.0049510514,0.0005854176,0.99355567,0.00014365949,0.00011173142,0.00023525191,0.000009634316,0.000015354033,0.00039225214],"genre_scores_gemma":[0.90816706,0.00016682962,0.090901434,0.000008031351,0.0006211006,0.0000068993645,0.000009378514,0.000028446926,0.000090846566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908346,0.0001558918,0.00024200698,0.00007807816,0.00027879805,0.0001617762],"domain_scores_gemma":[0.9992002,0.00034924227,0.000033456592,0.000060664974,0.00031680393,0.000039623297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001802568,0.000073308125,0.000079891965,0.00007564732,0.00027155614,0.00021310526,0.00012036616,0.000013223638,0.000014593072],"category_scores_gemma":[0.0003647028,0.000049966267,0.000022259164,0.000054006483,0.00005249,0.000113734655,0.000018276904,0.00017714633,0.0000024401254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050937408,0.000010352982,0.0000063444245,0.00005410877,0.0000149926545,0.000017106533,0.00006552473,0.9934151,0.002816612,0.000419057,0.0020715883,0.0010582382],"study_design_scores_gemma":[0.0013873341,0.00049420394,0.0024844804,0.00020059709,0.00003362243,0.00022084887,0.0000865519,0.97084427,0.009671164,0.004699536,0.009617842,0.00025958012],"about_ca_topic_score_codex":0.0000013303368,"about_ca_topic_score_gemma":4.6840253e-7,"teacher_disagreement_score":0.903216,"about_ca_system_score_codex":0.000038519374,"about_ca_system_score_gemma":0.000058875183,"threshold_uncertainty_score":0.20886177},"labels":[],"label_agreement":null},{"id":"W2007620179","doi":"10.1016/j.ejor.2010.01.047","title":"The setting of profit targets for target oriented divisions","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Wilfrid Laurier University","funders":"","keywords":"Business; Computer science; Profit (economics); Operations research; Industrial organization; Operations management; Economics; Microeconomics; Mathematics","score_opus":0.05363902464748529,"score_gpt":0.3298121752859865,"score_spread":0.27617315063850123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007620179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74058235,0.0005678973,0.017038736,0.060687527,0.0053296266,0.0024150964,0.000027826298,0.0000460849,0.17330487],"genre_scores_gemma":[0.9931062,0.000010128273,0.0027648727,0.0002750262,0.002189307,0.000008164264,0.000015465266,0.000025539315,0.0016053019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981662,0.00012103096,0.00048699186,0.00011703943,0.0008455047,0.00026321673],"domain_scores_gemma":[0.9972038,0.00032901386,0.00023336071,0.0001666124,0.0020413164,0.000025888305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010008642,0.000081074264,0.0001103845,0.00026057824,0.00074247847,0.00030808247,0.000533184,0.000013501314,0.00031943756],"category_scores_gemma":[0.0026746208,0.000051766863,0.00009744479,0.00031779893,0.00012722301,0.0005387321,0.00023837443,0.00041344707,0.0000633667],"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.00042247778,0.00025409553,0.021413868,0.00019399662,0.00014560221,0.00004108392,0.0003983809,0.0007723187,0.025841357,0.5244406,0.4101571,0.015919127],"study_design_scores_gemma":[0.0007917569,0.00009719841,0.022623101,0.00004707067,0.000010720735,0.0000038128499,0.0005673049,0.0057992437,0.0005455363,0.0016856546,0.9677347,0.00009388812],"about_ca_topic_score_codex":0.000005643229,"about_ca_topic_score_gemma":0.000008912368,"teacher_disagreement_score":0.5575776,"about_ca_system_score_codex":0.000015202501,"about_ca_system_score_gemma":0.00007376616,"threshold_uncertainty_score":0.5710619},"labels":[],"label_agreement":null},{"id":"W2008037386","doi":"10.1016/j.ejor.2009.06.026","title":"Robustness and information levels in case-based multiple criteria sorting","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Decision maker; Sorting; Robustness (evolution); Computer science; Weighting; Dimension (graph theory); Preference; Decision problem; Mathematical optimization; Operations research; Mathematics; Statistics; Algorithm","score_opus":0.4283008890905909,"score_gpt":0.514680344923909,"score_spread":0.08637945583331813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008037386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92641187,0.00007120487,0.0679638,0.0033843229,0.0001653282,0.00015545997,0.000010395418,0.000005256923,0.0018323502],"genre_scores_gemma":[0.9731738,0.0000035577864,0.026168695,0.0004159676,0.00015487042,7.1689357e-7,0.0000019033138,0.000008189371,0.00007230959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920914,0.0028094093,0.0017420049,0.00021419913,0.0028356437,0.0003073337],"domain_scores_gemma":[0.9933262,0.0029426657,0.0003498143,0.00025714905,0.0029280994,0.00019606912],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03751712,0.00011644042,0.00024681818,0.0016001886,0.0003461655,0.0016591726,0.0006059606,0.000031140567,0.00043437482],"category_scores_gemma":[0.030878589,0.00008693187,0.00006208266,0.00092362793,0.0000991882,0.0030359305,0.00012724356,0.00055182166,0.000063529595],"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.00094350474,0.00031767075,0.01560654,0.000016801898,0.000015840998,0.010848735,0.0040263017,0.19563939,0.023136938,0.0019339758,0.0116427345,0.73587155],"study_design_scores_gemma":[0.0039216955,0.0007727649,0.33665594,0.00024594236,0.0000030037606,0.0032322765,0.0019645323,0.6407869,0.00076536037,0.0007708267,0.010608261,0.00027248758],"about_ca_topic_score_codex":0.000005432712,"about_ca_topic_score_gemma":0.000008143162,"teacher_disagreement_score":0.7355991,"about_ca_system_score_codex":0.000081128455,"about_ca_system_score_gemma":0.00027711768,"threshold_uncertainty_score":0.9993772},"labels":[],"label_agreement":null},{"id":"W2008060214","doi":"10.1016/j.ejor.2014.09.032","title":"Investigating work-related ill health effects in optimizing the performance of manufacturing systems","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Occupational Health and Safety Research","field":"Health Professions","cited_by":37,"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":"Workplace Safety and Insurance Board","keywords":"Risk analysis (engineering); Work (physics); Markov chain; Computer science; Risk factor; Operations management; Business; Medicine; Economics; Engineering","score_opus":0.13015543910169258,"score_gpt":0.45755961626882585,"score_spread":0.32740417716713327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008060214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847388,0.00067833945,0.00028095438,0.005818325,0.0004454965,0.0008926271,0.0000025480012,0.0000064785877,0.00713642],"genre_scores_gemma":[0.9972891,0.0001959763,0.0012250768,0.0003470135,0.00044571675,0.000018504348,0.0000065610884,0.000028012386,0.0004439984],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9821922,0.0137543315,0.0015952396,0.00016827033,0.0015979894,0.0006919318],"domain_scores_gemma":[0.991615,0.0059840474,0.00050201116,0.00022749398,0.001351677,0.0003197608],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.041842073,0.000113867936,0.0003303332,0.0004659613,0.0012383014,0.000035365105,0.00052856206,0.00004861501,0.00006002319],"category_scores_gemma":[0.0039846,0.000074560376,0.000053642718,0.0005794029,0.00018515455,0.0002470331,0.000178735,0.0026636862,0.00011516981],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001410196,0.00039493042,0.52729124,0.0070315306,0.00015792168,0.00007718486,0.022367453,0.29659086,0.0014255436,0.01862151,0.010904229,0.11372737],"study_design_scores_gemma":[0.002240274,0.0013275752,0.96109825,0.0052411,0.0000028525942,0.000022142332,0.0011263232,0.023902342,0.00018164844,0.000069301204,0.0046589514,0.00012922173],"about_ca_topic_score_codex":0.000093050985,"about_ca_topic_score_gemma":0.000007261199,"teacher_disagreement_score":0.43380702,"about_ca_system_score_codex":0.00032196185,"about_ca_system_score_gemma":0.0014541257,"threshold_uncertainty_score":0.9996372},"labels":[],"label_agreement":null},{"id":"W2008705270","doi":"10.1016/j.ejor.2007.03.035","title":"Maximizing throughput in queueing networks with limited flexibility","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"McMaster University","funders":"","keywords":"Server; Queueing theory; Computer science; Flexibility (engineering); Throughput; Layered queueing network; Class (philosophy); Computer network; Capacity planning; Set (abstract data type); Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence; Telecommunications; Operating system","score_opus":0.08447565047504504,"score_gpt":0.3474532981743744,"score_spread":0.2629776476993294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008705270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85197604,0.00021168956,0.101907276,0.0013530537,0.00011219621,0.00015336569,2.68824e-7,0.000022643224,0.044263497],"genre_scores_gemma":[0.99384016,0.000012420033,0.004043627,0.00044920907,0.0014383296,5.508642e-7,0.000004427422,0.00003208076,0.00017922248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9976111,0.00031268457,0.000612259,0.00021194185,0.00085067935,0.00040130384],"domain_scores_gemma":[0.99789494,0.00041635655,0.00022150212,0.0001932998,0.0012421192,0.000031804506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020009957,0.00011873807,0.00019534268,0.0007605091,0.00028781497,0.00032367598,0.00040011774,0.000021516045,0.00016004397],"category_scores_gemma":[0.0012884942,0.00009179897,0.00006476193,0.0014000119,0.00014705914,0.0015329442,0.00016229351,0.0008271965,0.0000580413],"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.0026686525,0.00035999346,0.03810436,0.000060231676,0.00012980147,0.002997416,0.00037106837,0.8646875,0.0018954632,0.060020115,0.0009195171,0.027785867],"study_design_scores_gemma":[0.010573666,0.0008585511,0.48522827,0.0024589193,0.00015807198,0.0004183125,0.0072805877,0.37983486,0.0008849064,0.01729612,0.093163334,0.0018444019],"about_ca_topic_score_codex":0.0000311279,"about_ca_topic_score_gemma":0.000083669984,"teacher_disagreement_score":0.48485264,"about_ca_system_score_codex":0.00012356426,"about_ca_system_score_gemma":0.00006117536,"threshold_uncertainty_score":0.69350916},"labels":[],"label_agreement":null},{"id":"W2008773175","doi":"10.1016/j.ejor.2009.10.011","title":"Game-theoretic analyses of decentralized assembly supply chains: Non-cooperative equilibria vs. coordination with cost-sharing contracts","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":134,"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":"Stackelberg competition; Supply chain; Profit (economics); Multiplicative function; Nash equilibrium; Profit sharing; Microeconomics; Computer science; Channel coordination; Industrial organization; Operations research; Supply chain management; Business; Mathematical optimization; Economics; Mathematics; Marketing","score_opus":0.0962230064810534,"score_gpt":0.3656862761120138,"score_spread":0.2694632696309604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008773175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483621,0.00025940203,0.005924422,0.005115277,0.00018275029,0.0007973415,0.0000046308414,0.000021228514,0.03933284],"genre_scores_gemma":[0.9971926,0.000076618446,0.00038865441,0.00088065607,0.00066983455,0.0000045605757,0.000043118223,0.000031649117,0.00071226066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99685884,0.0002891101,0.00076009706,0.00026811412,0.0014077941,0.00041607764],"domain_scores_gemma":[0.9965203,0.00014354957,0.00041737576,0.00022187151,0.0026324864,0.00006442177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004949735,0.00020198301,0.00036226833,0.0008074154,0.0002264697,0.00067304616,0.00061987096,0.000026299487,0.0005094337],"category_scores_gemma":[0.0007109427,0.00015191351,0.00011101945,0.000792558,0.00017733073,0.0017679933,0.00013004243,0.0003895185,0.00007199034],"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.010881528,0.0033871876,0.025006961,0.00061733107,0.0015489863,0.0023323104,0.002403102,0.05121208,0.35715964,0.45413867,0.061295263,0.030016951],"study_design_scores_gemma":[0.035234317,0.0061629717,0.4625382,0.0043661133,0.000651365,0.00018395558,0.0047445036,0.32383975,0.04115847,0.0040014754,0.11489808,0.0022207897],"about_ca_topic_score_codex":0.000024830144,"about_ca_topic_score_gemma":0.0000051227266,"teacher_disagreement_score":0.4501372,"about_ca_system_score_codex":0.00010725303,"about_ca_system_score_gemma":0.00013753801,"threshold_uncertainty_score":0.64901996},"labels":[],"label_agreement":null},{"id":"W2008806816","doi":"10.1016/s0377-2217(02)00915-3","title":"Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":347,"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":"","keywords":"Computer science; Vehicle routing problem; Fleet management; Time horizon; Field (mathematics); Routing (electronic design automation); Operations research; Routing algorithm; Algorithm; Emphasis (telecommunications); Mathematical optimization; Telecommunications; Computer network; Routing protocol; Engineering","score_opus":0.06723250682678367,"score_gpt":0.36649379506851854,"score_spread":0.29926128824173487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008806816","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.4498955,0.0006700851,0.484542,0.0004016523,0.00028495767,0.00022802514,0.000004773066,0.00011358963,0.06385941],"genre_scores_gemma":[0.8012952,0.00017486131,0.19804125,0.000011620098,0.00021893947,4.203172e-7,0.0000031992192,0.000038080616,0.00021638266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647146,0.001930306,0.0005198328,0.00014139219,0.0006164682,0.00032056108],"domain_scores_gemma":[0.9985932,0.00040746373,0.00007746373,0.00011002777,0.00065353035,0.00015830893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008181138,0.0001193769,0.00017486095,0.00017691481,0.00031985878,0.00033508785,0.00017903972,0.000031507774,0.0001064494],"category_scores_gemma":[0.0006478077,0.00011403348,0.000041450145,0.00027356434,0.00012856313,0.0004071197,0.00004551709,0.0005212091,0.000043667256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024735626,0.00004150307,0.0005426837,0.000028682427,0.000071716444,0.000105528066,0.0014917835,0.91336703,0.06223197,0.012186822,0.0020691908,0.007838325],"study_design_scores_gemma":[0.0012909315,0.0002636543,0.008963018,0.00011581196,0.000009756664,0.00025705845,0.0009807989,0.98372275,0.0016318632,0.00021316267,0.0023063126,0.00024485867],"about_ca_topic_score_codex":0.00000293289,"about_ca_topic_score_gemma":2.3544762e-7,"teacher_disagreement_score":0.35139975,"about_ca_system_score_codex":0.00009117485,"about_ca_system_score_gemma":0.00016865772,"threshold_uncertainty_score":0.46501502},"labels":[],"label_agreement":null},{"id":"W2009333025","doi":"10.1016/s0377-2217(01)00169-2","title":"Accounting for time-varying queueing effects in workforce scheduling","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":83,"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":"Staffing; Computer science; Queueing theory; Schedule; Scheduling (production processes); Mathematical optimization; Operations research; Set (abstract data type); Queue; Real-time computing; Computer network; Mathematics; Economics","score_opus":0.06397752846340668,"score_gpt":0.33074207758785423,"score_spread":0.2667645491244476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009333025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8933915,0.0012181064,0.044291835,0.0032906434,0.0003405182,0.0005828008,9.607231e-7,0.000049471306,0.056834158],"genre_scores_gemma":[0.98751307,0.000014236908,0.008762611,0.00044672083,0.0023313025,0.0000048015013,0.0000037371601,0.000050511768,0.0008730286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788165,0.00025771995,0.0005720345,0.00020553869,0.0006836278,0.00039941273],"domain_scores_gemma":[0.9977331,0.00092029624,0.00024915172,0.00013764329,0.0009346655,0.000025139138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008817426,0.00012828021,0.00022589695,0.0009324707,0.00044927807,0.00056630996,0.00044725498,0.00002311155,0.00027082124],"category_scores_gemma":[0.004971311,0.00011766947,0.000119750985,0.0009135841,0.00006252254,0.0020272222,0.00015355567,0.0005487288,0.00039107242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006659098,0.00045809645,0.008572157,0.0005296091,0.00020905929,0.001012233,0.00075515575,0.7418708,0.048124425,0.08640703,0.0046118395,0.10678365],"study_design_scores_gemma":[0.0029935336,0.00010775572,0.0018868917,0.0015357088,0.00005018192,0.000036912825,0.00026815396,0.9550598,0.00050194893,0.007106965,0.029982641,0.00046947596],"about_ca_topic_score_codex":0.0000040598593,"about_ca_topic_score_gemma":0.0000015349566,"teacher_disagreement_score":0.21318899,"about_ca_system_score_codex":0.00009160792,"about_ca_system_score_gemma":0.000025096235,"threshold_uncertainty_score":0.59514827},"labels":[],"label_agreement":null},{"id":"W2009658327","doi":"10.1016/j.ejor.2004.07.060","title":"Inventory rationing via drop-shipping in Internet retailing: A sensitivity analysis","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Rationing; Lead time; Operations research; Computer science; Reorder point; Profit margin; Stock (firearms); Profit (economics); Monte Carlo method; The Internet; Economic order quantity; Business; Economics; Marketing; Microeconomics; Supply chain; Mathematics; Statistics","score_opus":0.09055646450931035,"score_gpt":0.31540344608453036,"score_spread":0.22484698157522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009658327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9252782,0.0001301985,0.035570703,0.0043784105,0.00028748246,0.0002165125,4.403555e-7,0.000019262077,0.034118798],"genre_scores_gemma":[0.99728936,0.000009609884,0.0005023746,0.000697625,0.0010080544,0.0000018981989,0.000017656941,0.000021261561,0.00045214154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973579,0.00044419762,0.0006424477,0.00022649113,0.0010289719,0.0002999788],"domain_scores_gemma":[0.9987275,0.00007829359,0.00021387896,0.00016145923,0.000782723,0.00003611985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011898776,0.0001233768,0.00022230044,0.0019724036,0.00019420304,0.00058118295,0.00029507338,0.000020836815,0.00036203372],"category_scores_gemma":[0.0008092557,0.000114651506,0.00015336132,0.0015955372,0.00009644151,0.0013545747,0.00023903983,0.0005534646,0.00023382812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008893242,0.0016516073,0.28323984,0.0003474834,0.0019946808,0.007907886,0.0044055353,0.50196844,0.01633462,0.14927587,0.013109337,0.018875396],"study_design_scores_gemma":[0.008337521,0.0004024669,0.31838605,0.0010659767,0.0004178024,0.00010675077,0.00417133,0.5096873,0.0009717701,0.0056304084,0.14957176,0.0012508518],"about_ca_topic_score_codex":0.000201409,"about_ca_topic_score_gemma":0.00021033705,"teacher_disagreement_score":0.14364547,"about_ca_system_score_codex":0.00025568507,"about_ca_system_score_gemma":0.00009626973,"threshold_uncertainty_score":0.56043607},"labels":[],"label_agreement":null},{"id":"W2010087413","doi":"10.1016/j.ejor.2014.09.025","title":"Reconfiguration of satellite orbit for cooperative observation using variable-size multi-objective differential evolution","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Satellite Communication Systems","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Crossover; Initialization; Computer science; Differential evolution; Control reconfiguration; Mathematical optimization; Variable (mathematics); Convergence (economics); Evolutionary algorithm; Algorithm; Genetic algorithm; Mathematics; Artificial intelligence","score_opus":0.1593607907918241,"score_gpt":0.3536290888243274,"score_spread":0.1942682980325033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010087413","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.27421132,0.0008247366,0.720527,0.000100747246,0.0005544493,0.00063210086,0.000031025123,0.000027469421,0.0030911309],"genre_scores_gemma":[0.9637815,0.00016380857,0.03532445,0.000010371735,0.00044202484,0.000008065221,0.000030506857,0.000046091933,0.00019319919],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637383,0.0017386444,0.00092429697,0.00014370026,0.00060599955,0.00021351458],"domain_scores_gemma":[0.9945365,0.0011571287,0.0002199397,0.00024829165,0.0037490085,0.00008911633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048608445,0.00013617317,0.00026131945,0.00027536813,0.00022007046,0.00012535386,0.0003492483,0.000048944803,0.00007176879],"category_scores_gemma":[0.0021565696,0.00012663008,0.00007959456,0.00041151216,0.00008577059,0.0005314028,0.000037925,0.00036780554,0.0000150183805],"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.00031974,0.00014544633,0.0010186528,0.00016924545,0.00021528323,0.0000019274103,0.001960212,0.08756273,0.88440794,0.013287972,0.00021477464,0.010696098],"study_design_scores_gemma":[0.003907661,0.00091640116,0.06692183,0.00068903924,0.000046828627,0.0000690785,0.0009035812,0.8679582,0.041633002,0.00041507493,0.016110506,0.00042878097],"about_ca_topic_score_codex":0.000009719705,"about_ca_topic_score_gemma":0.000004505344,"teacher_disagreement_score":0.8427749,"about_ca_system_score_codex":0.00030488145,"about_ca_system_score_gemma":0.00018428566,"threshold_uncertainty_score":0.51638246},"labels":[],"label_agreement":null},{"id":"W2010431656","doi":"10.1016/j.ejor.2004.06.026","title":"Coordinating pricing and production decisions in the presence of price competition","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":51,"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":"Profitability index; Production (economics); Microeconomics; Industrial organization; Competition (biology); Pricing strategies; Revenue; Position (finance); Business; Economics; Revenue management","score_opus":0.08811151490865506,"score_gpt":0.32348716885055234,"score_spread":0.2353756539418973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010431656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9641817,0.00012557756,0.0018700195,0.010226197,0.00015020983,0.00025145986,2.8679395e-7,0.000003373533,0.02319117],"genre_scores_gemma":[0.9983821,0.000057470912,0.00072335586,0.00019623329,0.00055837503,0.0000017748316,0.000001954314,0.000006875535,0.00007188174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984958,0.00019718285,0.00034031153,0.00010036268,0.00074373785,0.00012257152],"domain_scores_gemma":[0.99896896,0.00017517412,0.00013981915,0.00009098625,0.00061616814,0.000008897316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007869524,0.000050856725,0.000076622324,0.00040089086,0.00020768544,0.00018985952,0.00025406532,0.0000068626337,0.000032088425],"category_scores_gemma":[0.0022068482,0.000035064702,0.000022659307,0.00053968845,0.000090893496,0.0007866962,0.000119476375,0.00024628823,0.000013777489],"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.00033066547,0.0011080551,0.016856136,0.00030457185,0.00006514779,0.00034074383,0.0053625526,0.056521997,0.021520376,0.8507679,0.010586707,0.036235116],"study_design_scores_gemma":[0.0061729415,0.00077702577,0.7690392,0.0037032666,0.000049699192,0.00025166085,0.027758194,0.009190303,0.001682509,0.032903016,0.14791012,0.00056207075],"about_ca_topic_score_codex":0.000027760954,"about_ca_topic_score_gemma":0.000009553911,"teacher_disagreement_score":0.8178649,"about_ca_system_score_codex":0.00003644903,"about_ca_system_score_gemma":0.000037909336,"threshold_uncertainty_score":0.27274355},"labels":[],"label_agreement":null},{"id":"W2012309514","doi":"10.1016/j.ejor.2006.09.086","title":"Applications of bulk queues to group testing models with incomplete identification","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":76,"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":"Poisson distribution; Mathematical optimization; Queue; Markov chain; Population; Computer science; Markov decision process; Profit (economics); Random variable; Mathematics; Group (periodic table); Markov process; Statistics","score_opus":0.16044544884921288,"score_gpt":0.38546475566623467,"score_spread":0.22501930681702179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012309514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835971,0.00011588788,0.13836998,0.0007943193,0.0000304876,0.00042841287,0.0000058530345,0.000020751695,0.02426331],"genre_scores_gemma":[0.96679056,0.0000016875524,0.032313004,0.00012609776,0.0004542722,0.000009453994,0.0000063776074,0.000024564128,0.0002739896],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99786484,0.000288541,0.00059609814,0.00015236833,0.0009389739,0.00015914973],"domain_scores_gemma":[0.9964147,0.00031930814,0.00017831012,0.0001689832,0.0028450242,0.00007363468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030193354,0.0000767103,0.00015186546,0.00048044953,0.00021142949,0.00007935917,0.00016598252,0.000013447864,0.000013667064],"category_scores_gemma":[0.00066832505,0.00006053804,0.0000390042,0.0008088974,0.00009342731,0.00020021212,0.000044199656,0.00032322592,0.000041881205],"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.00019042818,0.00020772498,0.0017182118,0.000038636124,0.000029350636,0.00005502086,0.00015696078,0.0037325039,0.9800201,0.004003422,0.0006367651,0.009210893],"study_design_scores_gemma":[0.007858197,0.008076749,0.20781758,0.0023363128,0.0001621343,0.0050665727,0.0013239501,0.07293718,0.6558338,0.006390666,0.031406086,0.00079075946],"about_ca_topic_score_codex":0.000052996875,"about_ca_topic_score_gemma":0.000008324999,"teacher_disagreement_score":0.3241863,"about_ca_system_score_codex":0.000076757206,"about_ca_system_score_gemma":0.00019068994,"threshold_uncertainty_score":0.24686696},"labels":[],"label_agreement":null},{"id":"W2012920499","doi":"10.1016/j.ejor.2009.05.012","title":"Deriving the DEA frontier for two-stage processes","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":223,"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":"Data envelopment analysis; Efficient frontier; Frontier; Econometrics; Stage (stratigraphy); Process (computing); Projection (relational algebra); Envelopment; Economics; Computer science; Mathematical optimization; Mathematics; Algorithm; Financial economics","score_opus":0.275618365468491,"score_gpt":0.49971664747528316,"score_spread":0.22409828200679216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012920499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49227765,0.002482894,0.4045728,0.05468131,0.00049322605,0.00058327307,0.000020917747,0.000017215332,0.044870697],"genre_scores_gemma":[0.9857584,0.00001739962,0.0064845528,0.00059017236,0.00062799186,0.0000012335726,0.0000012262489,0.000011674612,0.0065073227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9927097,0.0020424852,0.000926443,0.00025774218,0.0037345982,0.0003290495],"domain_scores_gemma":[0.9891986,0.0037473787,0.0002854831,0.00034878336,0.0062920135,0.00012769856],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.043046217,0.000097655786,0.0002009944,0.0005076263,0.00096474035,0.001318901,0.00180724,0.000013576985,0.00029020023],"category_scores_gemma":[0.035974335,0.00005176795,0.00015324185,0.0013857692,0.00019868065,0.0005888384,0.00009263992,0.00043951932,0.00015541738],"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.0010642406,0.0011077425,0.005816127,0.000030638148,0.00024719615,0.00056433707,0.008516,0.202557,0.043340586,0.044367284,0.43643016,0.2559587],"study_design_scores_gemma":[0.002817192,0.0025279252,0.059196163,0.00022226629,0.000054857803,0.00028500496,0.004399645,0.045406435,0.007169918,0.01770591,0.85968316,0.00053153577],"about_ca_topic_score_codex":0.0000020290488,"about_ca_topic_score_gemma":0.000009264244,"teacher_disagreement_score":0.49348077,"about_ca_system_score_codex":0.000053267086,"about_ca_system_score_gemma":0.0007185793,"threshold_uncertainty_score":0.99971783},"labels":[],"label_agreement":null},{"id":"W2013043413","doi":"10.1016/j.ejor.2012.01.032","title":"A general decomposition approach for multi-criteria decision trees","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":34,"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; University of Victoria; Université du Québec à Rimouski; Defence Research and Development Canada","funders":"","keywords":"Mathematical optimization; Weighted sum model; Lexicographical order; Multiple-criteria decision analysis; ELECTRE; Mathematics; Decomposition; Computer science; Weighting; Set (abstract data type); Decision analysis; Influence diagram; Mathematical economics","score_opus":0.5542226438846996,"score_gpt":0.5734047981644698,"score_spread":0.019182154279770214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013043413","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.31527865,0.00046111475,0.68048096,0.0003538665,0.00077860965,0.00034059305,0.000031054773,0.000008461759,0.0022666994],"genre_scores_gemma":[0.57312727,0.000012293143,0.4243703,0.00011627943,0.001492828,0.0000063284006,0.000010961992,0.000030107474,0.0008336576],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98850965,0.0038868608,0.0018527202,0.00042164483,0.004667084,0.0006620392],"domain_scores_gemma":[0.9902261,0.0036018617,0.00040114447,0.0005096848,0.0047360365,0.00052518013],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05517361,0.00020341507,0.0004065635,0.0013502624,0.00069352356,0.0013817335,0.0016223275,0.00005452157,0.00085650454],"category_scores_gemma":[0.015927486,0.00014067022,0.00031053106,0.00081810774,0.0001666823,0.0017461614,0.00037899186,0.0005149392,0.00034998613],"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.004093167,0.0029489321,0.010221203,0.000022353472,0.00015741553,0.00015373412,0.004568889,0.010251601,0.23725578,0.010515172,0.26973164,0.4500801],"study_design_scores_gemma":[0.009975296,0.0016414076,0.29499978,0.00022288364,0.000036865535,0.0014187206,0.001871712,0.4454289,0.005113333,0.0027586115,0.23569135,0.0008411256],"about_ca_topic_score_codex":0.0000020334676,"about_ca_topic_score_gemma":0.000001411007,"teacher_disagreement_score":0.449239,"about_ca_system_score_codex":0.00014786527,"about_ca_system_score_gemma":0.00020364833,"threshold_uncertainty_score":0.99965495},"labels":[],"label_agreement":null},{"id":"W2014726216","doi":"10.1016/j.ejor.2005.02.081","title":"Mathematical structure of a bilevel strategic pricing model","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Bilevel optimization; Oligopoly; Context (archaeology); Computer science; Schedule; Revenue; Operations research; Game theory; Microeconomics; Product (mathematics); Service (business); Revenue management; Mathematical optimization; Industrial organization; Mathematical economics; Business; Cournot competition; Economics; Optimization problem; Marketing; Mathematics","score_opus":0.19229040438597142,"score_gpt":0.3463435826363318,"score_spread":0.15405317825036038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014726216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7305907,0.00042926517,0.16682446,0.0005213094,0.00007146563,0.0000742835,0.000060325852,0.0000029871162,0.10142523],"genre_scores_gemma":[0.9905361,0.000017660217,0.0084341755,0.00005765081,0.00012587552,1.8045314e-7,0.0000036426825,0.000012243858,0.0008125025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983673,0.0001307649,0.0009252802,0.000116013194,0.0002847989,0.00017583204],"domain_scores_gemma":[0.99896246,0.000097395416,0.00025770348,0.0001261374,0.00045324033,0.00010306735],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0059598982,0.00006145305,0.00022347373,0.0005938266,0.00013294962,0.000054042604,0.00029679007,0.000014222444,0.0013790008],"category_scores_gemma":[0.00018907177,0.00005652042,0.000107409665,0.00037430297,0.00006054525,0.00010715423,0.000062297615,0.00038076713,0.00008263525],"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.00006108314,0.00014481829,0.0007595097,0.000023815111,0.00007923655,0.00004307752,0.00053116586,0.030237129,0.007355371,0.9599281,0.00056675525,0.00026992892],"study_design_scores_gemma":[0.0023509185,0.0010010764,0.0160013,0.00014842505,0.000023498014,0.000333121,0.0020226208,0.31323546,0.003747276,0.65796167,0.002673274,0.00050135213],"about_ca_topic_score_codex":0.000002223016,"about_ca_topic_score_gemma":0.0000011040635,"teacher_disagreement_score":0.30196643,"about_ca_system_score_codex":0.000056832847,"about_ca_system_score_gemma":0.00009520724,"threshold_uncertainty_score":0.9995339},"labels":[],"label_agreement":null},{"id":"W2015378169","doi":"10.1016/j.ejor.2004.05.009","title":"A dynamic programming approach to price installment options","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":33,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Warrant; Geometric Brownian motion; Computer science; Range (aeronautics); Call option; Put option; Valuation of options; Dynamic programming; Monotonic function; Mathematical optimization; Mathematical economics; Economics; Econometrics; Finance; Mathematics; Algorithm","score_opus":0.09272874575277709,"score_gpt":0.32244007880225484,"score_spread":0.22971133304947775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015378169","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.016551595,0.00065734866,0.94319606,0.0031246466,0.00007480846,0.00029922722,0.000023080804,0.000007763691,0.036065493],"genre_scores_gemma":[0.84710556,0.000045932662,0.15225644,0.00013310793,0.00014829384,0.000026997153,0.000007715566,0.000019767185,0.0002561886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871635,0.000025018384,0.0006022338,0.00020866502,0.00019025926,0.00025747155],"domain_scores_gemma":[0.99903584,0.000035124463,0.00014699732,0.00015304472,0.000448024,0.00018099762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027985128,0.00007930714,0.00015809844,0.00040132998,0.0003045422,0.00018508572,0.00041299564,0.000017667197,0.000026452291],"category_scores_gemma":[0.00047774837,0.00007967493,0.00006661725,0.0006666144,0.000061391176,0.0002051683,0.000102480844,0.00032842925,0.000556231],"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.00001924265,0.00033639284,0.000030982712,0.000009991454,0.000018840701,0.000008886544,0.0006342651,0.00729537,0.00012619451,0.9894544,0.00013021797,0.0019352197],"study_design_scores_gemma":[0.0050071673,0.0030586617,0.08245663,0.0002930246,0.000015579211,0.0005648544,0.0016595322,0.004029017,0.00010872423,0.31868973,0.5830675,0.0010496288],"about_ca_topic_score_codex":0.000012224551,"about_ca_topic_score_gemma":0.000001526142,"teacher_disagreement_score":0.83055395,"about_ca_system_score_codex":0.0002488338,"about_ca_system_score_gemma":0.00017958504,"threshold_uncertainty_score":0.71494097},"labels":[],"label_agreement":null},{"id":"W2015646948","doi":"10.1016/j.ejor.2011.11.009","title":"General network design: A unified view of combined location and network design problems","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":147,"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":"Facility location problem; Computer science; Network planning and design; Tree network; Service (business); Operations research; Flow network; Star (game theory); Mathematical optimization; Computer network; Mathematics","score_opus":0.21999060321587016,"score_gpt":0.30997421057517593,"score_spread":0.08998360735930577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015646948","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.0441497,0.0019496296,0.9249701,0.004528949,0.0009248375,0.0018137387,0.0000012214222,0.00004323428,0.021618571],"genre_scores_gemma":[0.97196126,0.00029917833,0.02519603,0.00062866777,0.0011851878,0.00000893772,0.000011274705,0.000028444192,0.00068101415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976027,0.00060988683,0.00067868695,0.00016587069,0.00066315953,0.0002797049],"domain_scores_gemma":[0.9975351,0.00006717879,0.0001463226,0.00016234012,0.0020513046,0.000037753405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010301321,0.00011846659,0.00019125918,0.00022222605,0.00028000135,0.00014980261,0.00034266364,0.000020291425,0.00046828092],"category_scores_gemma":[0.00031038225,0.00010017553,0.000039140406,0.00089770247,0.000101680824,0.00064602145,0.00015888625,0.00022937327,0.00011416364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522106,0.00026525004,0.00097597414,0.00027520247,0.00013728008,0.000026193342,0.00039706627,0.84247947,0.00042093595,0.08630833,0.060588807,0.0074732606],"study_design_scores_gemma":[0.00605153,0.001815606,0.17335819,0.0014735691,0.00019704811,0.000041525356,0.00058565167,0.69326985,0.00025684005,0.02021159,0.101691864,0.0010467396],"about_ca_topic_score_codex":0.000088819674,"about_ca_topic_score_gemma":0.00002121816,"teacher_disagreement_score":0.92781156,"about_ca_system_score_codex":0.000025758369,"about_ca_system_score_gemma":0.000108096334,"threshold_uncertainty_score":0.5127348},"labels":[],"label_agreement":null},{"id":"W2016338503","doi":"10.1016/s0377-2217(02)00641-0","title":"Retail promotions with negative brand image effects: Is cooperation possible?","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":205,"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":"","keywords":"Promotion (chess); Brand image; Image (mathematics); Revenue; Nash equilibrium; Business; Differential (mechanical device); Advertising; Differential game; Channel (broadcasting); Marketing; Microeconomics; Computer science; Economics; Mathematics; Mathematical optimization; Telecommunications","score_opus":0.05521878976130972,"score_gpt":0.31228792187776727,"score_spread":0.25706913211645754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016338503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8160576,0.00016766021,0.0042499253,0.0028915931,0.00019959088,0.00048583333,0.000003194161,0.000019972438,0.1759246],"genre_scores_gemma":[0.99517965,0.000019376634,0.0018566553,0.0003671476,0.0004454813,0.0000046013142,0.000006535461,0.00003337606,0.002087177],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9978287,0.00053110323,0.00037231803,0.00018278061,0.0008317607,0.0002533098],"domain_scores_gemma":[0.99692136,0.00024307329,0.00014651119,0.00014701491,0.0025028826,0.000039152954],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004607909,0.00013068994,0.00015899548,0.00044309374,0.0006222616,0.0010353299,0.00022912295,0.000017959845,0.0015723095],"category_scores_gemma":[0.0013121503,0.00009568973,0.000058233956,0.0007646577,0.00014060533,0.0018219273,0.00005495309,0.0005152182,0.00026504655],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005016079,0.0039961934,0.28189668,0.0016750115,0.0013471473,0.0068364786,0.0075722313,0.001232048,0.24523063,0.12102651,0.18337773,0.14079325],"study_design_scores_gemma":[0.018456979,0.0019809036,0.6614581,0.0021526816,0.0004939848,0.0010143208,0.002055046,0.003000627,0.023297997,0.0020832915,0.2822024,0.0018037206],"about_ca_topic_score_codex":0.000016452374,"about_ca_topic_score_gemma":0.000013699916,"teacher_disagreement_score":0.37956136,"about_ca_system_score_codex":0.00003892566,"about_ca_system_score_gemma":0.00020249009,"threshold_uncertainty_score":0.9993404},"labels":[],"label_agreement":null},{"id":"W2016578500","doi":"10.1016/s0377-2217(00)00243-5","title":"Inventory models with minimal service level constraints","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":111,"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":"Economic shortage; Stockout; Service level; Computation; Holding cost; Mathematical optimization; Computer science; Constraint (computer-aided design); Stock (firearms); Operations research; Service (business); Safety stock; Total cost; Economics; Mathematics; Microeconomics; Statistics; Business; Algorithm","score_opus":0.23559730966501116,"score_gpt":0.3235416527234062,"score_spread":0.08794434305839502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016578500","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.4315168,0.00013000554,0.005045081,0.011396623,0.0003074455,0.00030220323,0.0000034515317,0.000025134788,0.5512732],"genre_scores_gemma":[0.99154073,0.000023973138,0.0008770009,0.0032273044,0.0018925812,0.0000025848783,0.000011871273,0.000034381144,0.002389596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976003,0.00017370876,0.00042136214,0.00017775653,0.0013064289,0.0003204236],"domain_scores_gemma":[0.9976013,0.000049198366,0.00015891712,0.00015787003,0.0019827273,0.000049988776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004177449,0.00012800042,0.00014590056,0.00053710165,0.0002859402,0.00052172743,0.0005274382,0.000015759595,0.0016808287],"category_scores_gemma":[0.00014794373,0.000098467935,0.00005522079,0.00058242684,0.00017899799,0.0018001703,0.0001962993,0.00038089807,0.00058360596],"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.0029093775,0.0016120506,0.027601387,0.00043384108,0.00067108596,0.007463793,0.0016608386,0.039945334,0.0029991323,0.4439564,0.43410832,0.036638416],"study_design_scores_gemma":[0.005844945,0.00045870972,0.03155706,0.0005339281,0.00006014018,0.00039528834,0.0047166236,0.05023973,0.000055437977,0.0031133767,0.9023812,0.0006435832],"about_ca_topic_score_codex":0.00002791683,"about_ca_topic_score_gemma":0.000025991241,"teacher_disagreement_score":0.5600239,"about_ca_system_score_codex":0.00006419697,"about_ca_system_score_gemma":0.00013938184,"threshold_uncertainty_score":0.99923176},"labels":[],"label_agreement":null},{"id":"W2016619874","doi":"10.1016/j.ejor.2004.06.016","title":"The single-node dynamic service scheduling and dispatching problem","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Operations research; Mathematical optimization; Distributed computing; Computer network; Quality of service; Mathematics","score_opus":0.0517134440202458,"score_gpt":0.3366651362674725,"score_spread":0.2849516922472267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016619874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64907926,0.0014519718,0.33530018,0.008045777,0.00020048833,0.00016950456,0.000002583441,0.000048985432,0.005701281],"genre_scores_gemma":[0.8050882,0.0001842189,0.19443503,0.00005862808,0.0001418129,8.595895e-7,0.000001391722,0.000038109534,0.0000517356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812347,0.0005970298,0.00037876674,0.000092642425,0.00057052454,0.00023755322],"domain_scores_gemma":[0.9987526,0.0003556367,0.000048385846,0.00011009353,0.00062196783,0.00011134221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061054663,0.00008468988,0.000090037865,0.00011994953,0.0004874785,0.00039500796,0.00027920865,0.000016409396,0.000008341277],"category_scores_gemma":[0.0005152442,0.00006207406,0.000026545164,0.00030557622,0.00006100195,0.00027501088,0.00008152606,0.00063667004,0.000019173156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012727036,0.000013525417,0.00006713595,0.000020386333,0.000023195933,0.000026800224,0.00057450996,0.97239226,0.016410943,0.0009568561,0.00002409553,0.009477533],"study_design_scores_gemma":[0.0027750505,0.00039024968,0.013746438,0.000860877,0.000021682323,0.00083515013,0.0013383987,0.9672743,0.0031349077,0.0023520675,0.0068082684,0.0004625751],"about_ca_topic_score_codex":0.0000021069245,"about_ca_topic_score_gemma":0.000006545173,"teacher_disagreement_score":0.15600897,"about_ca_system_score_codex":0.00013572379,"about_ca_system_score_gemma":0.000096611184,"threshold_uncertainty_score":0.3809071},"labels":[],"label_agreement":null},{"id":"W2017073655","doi":"10.1016/s0377-2217(03)00389-8","title":"A mixed integer formulation for maximal covering by inclined parallelograms","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parallelogram; Integer (computer science); Mathematics; Combinatorics; Integer programming; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.12250108941023673,"score_gpt":0.3605759589767022,"score_spread":0.23807486956646545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017073655","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.037111104,0.00019850295,0.9590776,0.0011882568,0.0002997579,0.00018507447,0.0000038471007,0.000009892805,0.0019259702],"genre_scores_gemma":[0.88579917,0.000017749477,0.11316704,0.00013482702,0.00021042067,0.0000055044884,0.000021854015,0.0000109638995,0.00063245255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748504,0.0007989931,0.0004915562,0.00018773561,0.00079876394,0.00023792741],"domain_scores_gemma":[0.9976162,0.00045770002,0.00012910349,0.00013425102,0.0015337422,0.00012903086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062357397,0.00009122516,0.00012142903,0.00027584558,0.00033710827,0.0003730639,0.00044345792,0.000021358146,0.000033272438],"category_scores_gemma":[0.0012494631,0.00007946992,0.00008747608,0.00044705177,0.00002439485,0.0008121111,0.000076572076,0.00025247494,0.000026581673],"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.0002748756,0.00041861372,0.0002831651,0.000030043788,0.000106744155,0.00005507302,0.00072235544,0.06767704,0.037544645,0.77803,0.056459446,0.058397997],"study_design_scores_gemma":[0.0051086918,0.0028109062,0.0043167877,0.000095746844,0.000012379007,0.00039538054,0.00014363973,0.33696055,0.020882027,0.017348295,0.611417,0.00050859293],"about_ca_topic_score_codex":8.682323e-7,"about_ca_topic_score_gemma":7.802111e-7,"teacher_disagreement_score":0.84868807,"about_ca_system_score_codex":0.00007990059,"about_ca_system_score_gemma":0.00029237295,"threshold_uncertainty_score":0.35974637},"labels":[],"label_agreement":null},{"id":"W2017259383","doi":"10.1016/s0377-2217(99)00220-9","title":"Using GIS to assess the risks of hazardous materials transport in networks","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":154,"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":"Hazardous waste; SAFER; Routing (electronic design automation); Flow network; Computer science; Population; Geographic information system; Risk analysis (engineering); Environmental science; Data mining; Geography; Mathematical optimization; Engineering; Mathematics; Business; Cartography; Computer network; Computer security","score_opus":0.6070050088753729,"score_gpt":0.5414467475301,"score_spread":0.06555826134527287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017259383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98433775,0.00013993554,0.0073554427,0.002835049,0.00008702318,0.00010286284,0.000011096737,0.0000010962269,0.00512974],"genre_scores_gemma":[0.99665433,0.00025890575,0.0017711215,0.00009806818,0.00028310393,5.6335097e-7,0.0000013096322,0.0000107507385,0.00092184823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99107784,0.004259819,0.0013700254,0.00018862683,0.002852529,0.00025113748],"domain_scores_gemma":[0.9970076,0.0010634152,0.00016624537,0.00029961485,0.0013306547,0.00013243509],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.04050766,0.0000815505,0.00030569808,0.0004887825,0.00024648607,0.00025063878,0.0011593414,0.000022454169,0.003995763],"category_scores_gemma":[0.0013514819,0.000046170935,0.00012634182,0.0014164719,0.00014583774,0.00030579447,0.000052952524,0.00039664045,0.00011728403],"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.0005613908,0.00010203777,0.008420438,0.0000016414434,0.000045969733,0.0003134194,0.001224547,0.9277128,0.007750849,0.00034612624,0.0019574245,0.051563382],"study_design_scores_gemma":[0.0013096698,0.00066615746,0.9346451,0.00020194551,0.000037059683,0.00022112169,0.0018486604,0.024711696,0.0035519549,0.0018179517,0.030712036,0.0002766064],"about_ca_topic_score_codex":0.00009348752,"about_ca_topic_score_gemma":0.000044994376,"teacher_disagreement_score":0.9262247,"about_ca_system_score_codex":0.000043376873,"about_ca_system_score_gemma":0.0002528607,"threshold_uncertainty_score":0.99691474},"labels":[],"label_agreement":null},{"id":"W2017602820","doi":"10.1016/j.ejor.2007.08.021","title":"A tabu search heuristic for the generalized minimum spanning tree problem","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Tabu search; Minimum spanning tree; Guided Local Search; Mathematical optimization; Heuristic; Spanning tree; Beam search; Mathematics; Vertex (graph theory); k-minimum spanning tree; Tree (set theory); Kruskal's algorithm; Set (abstract data type); Computer science; Graph; Algorithm; Search algorithm; Combinatorics; Tree structure; K-ary tree; Binary tree","score_opus":0.11878875091194746,"score_gpt":0.3928427993228669,"score_spread":0.27405404841091946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017602820","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.06373905,0.0008328063,0.92384857,0.0012622153,0.00026919314,0.00041227907,0.000006251389,0.000034837285,0.009594807],"genre_scores_gemma":[0.7133923,0.00010480461,0.2837881,0.00006860446,0.0012487186,0.0000051437687,0.0000056402914,0.00008292997,0.0013037188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969612,0.0008379927,0.0006430109,0.00012811997,0.000970458,0.00045921552],"domain_scores_gemma":[0.9962199,0.0020242166,0.000059858863,0.0001739667,0.0013573795,0.00016471259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024915202,0.000114727256,0.00015654443,0.0003152395,0.00041382824,0.00023243573,0.0005044133,0.00002601808,0.00009259545],"category_scores_gemma":[0.0013696966,0.00008281819,0.00009550286,0.00046150564,0.00010189138,0.00016612123,0.000066932225,0.00066478335,0.000029287847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002449775,0.000049116494,0.00037939855,0.00006414871,0.00014438514,0.00012260844,0.0017190654,0.9165468,0.02734089,0.002903483,0.013955159,0.03652996],"study_design_scores_gemma":[0.0033204015,0.0006457283,0.014277445,0.00019124706,0.000036363224,0.00033191222,0.0009524938,0.9176417,0.007832399,0.00020305478,0.054211058,0.00035620618],"about_ca_topic_score_codex":0.0000018594948,"about_ca_topic_score_gemma":0.0000020816115,"teacher_disagreement_score":0.64965326,"about_ca_system_score_codex":0.000116180534,"about_ca_system_score_gemma":0.00015910968,"threshold_uncertainty_score":0.8635161},"labels":[],"label_agreement":null},{"id":"W2018348419","doi":"10.1016/j.ejor.2011.10.023","title":"Additive super-efficiency in integer-valued data envelopment analysis","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Rounding; Integer (computer science); Envelopment; Mathematical optimization; Integer programming; Computer science; Mathematics","score_opus":0.4952010641297377,"score_gpt":0.4914514800180555,"score_spread":0.0037495841116821915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018348419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8153819,0.00058039505,0.08446073,0.002048072,0.00040707938,0.0003114805,0.00011785191,0.000013886009,0.09667864],"genre_scores_gemma":[0.9907679,0.00005608015,0.0075767906,0.00011685435,0.0001546975,0.0000011855426,0.000029223129,0.000016038579,0.0012812231],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98360795,0.006629256,0.0020910322,0.00073423015,0.006427091,0.0005104463],"domain_scores_gemma":[0.99228185,0.0019475884,0.0003865625,0.0012289629,0.0038712793,0.00028377882],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.07813684,0.00017220683,0.0005037187,0.0044417395,0.00037343067,0.0005226998,0.0048939753,0.000034348304,0.0046425224],"category_scores_gemma":[0.022515353,0.00011972668,0.000227546,0.00774121,0.00045467503,0.0011240103,0.0010359923,0.00094981975,0.001004664],"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.0031011172,0.012711011,0.2387519,0.000021956212,0.005217396,0.01470643,0.10656865,0.0744979,0.009631941,0.044291116,0.19090018,0.2996004],"study_design_scores_gemma":[0.0022101093,0.0014038695,0.76239824,0.00016214621,0.0002797629,0.0001776642,0.01221489,0.16902053,0.0022201508,0.0021648325,0.046946127,0.00080169184],"about_ca_topic_score_codex":0.000063780826,"about_ca_topic_score_gemma":0.00011230166,"teacher_disagreement_score":0.5236463,"about_ca_system_score_codex":0.0001825853,"about_ca_system_score_gemma":0.0009554991,"threshold_uncertainty_score":0.99977314},"labels":[],"label_agreement":null},{"id":"W2020889483","doi":"10.1016/j.ejor.2014.09.015","title":"A column generation approach for a multi-attribute vehicle routing problem","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":53,"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 à Montréal; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Column generation; Vehicle routing problem; Column (typography); Computer science; Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.18071534324525806,"score_gpt":0.37511228400514873,"score_spread":0.19439694075989067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020889483","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.030571375,0.000077582874,0.9665071,0.00020143787,0.0001156347,0.00031226888,0.000007671555,0.000039888128,0.0021670794],"genre_scores_gemma":[0.5009729,0.000009995284,0.4979878,0.000031254032,0.0006707059,0.0000087066865,0.00002058207,0.00004417743,0.0002538492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685776,0.0014265457,0.00060263317,0.00016286329,0.0006206555,0.00032955108],"domain_scores_gemma":[0.997944,0.00027831254,0.00008942437,0.00014282057,0.001397774,0.00014769356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014061226,0.00011483993,0.0001802136,0.00022352453,0.00034778024,0.00028385062,0.00030346937,0.000034844783,0.000022302844],"category_scores_gemma":[0.0014900434,0.00010974015,0.00008013949,0.00032419158,0.000048553884,0.00029325942,0.000049349586,0.00045987187,0.000016497315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017373197,0.00006449965,0.00048428462,0.000042540516,0.00004204556,0.0000036612012,0.0004030299,0.94979316,0.03771728,0.0013157632,0.0040474026,0.006068981],"study_design_scores_gemma":[0.0011920362,0.0001916927,0.0011706258,0.000028631985,0.0000068119957,0.000029796667,0.000059473427,0.9911352,0.0027023165,0.000008437476,0.0033590314,0.000115985],"about_ca_topic_score_codex":0.0000010813482,"about_ca_topic_score_gemma":6.9319736e-7,"teacher_disagreement_score":0.47040156,"about_ca_system_score_codex":0.00012464834,"about_ca_system_score_gemma":0.00009521577,"threshold_uncertainty_score":0.4873368},"labels":[],"label_agreement":null},{"id":"W2020990525","doi":"10.1016/j.ejor.2013.09.002","title":"Choosing the optimal intervention method to reduce human-related machine failures","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Assembly Line Balancing Optimization","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":"University of Toronto; Bombardier (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Revenue; Operator (biology); Intervention (counseling); Risk analysis (engineering); Operations research; Decision maker; Cost–benefit analysis; Reliability engineering; Engineering; Economics; Business","score_opus":0.04300486630016078,"score_gpt":0.374856443525975,"score_spread":0.33185157722581426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020990525","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.4275827,0.0005923421,0.55057204,0.0073959003,0.0003841484,0.0006045702,0.00000448137,0.00007630634,0.012787477],"genre_scores_gemma":[0.94376975,0.000010479102,0.0549355,0.00003947536,0.00034897096,0.000005414775,0.000010330922,0.00004700184,0.000833104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731535,0.0011345636,0.00056391675,0.00011149223,0.0006447908,0.00022991169],"domain_scores_gemma":[0.99861157,0.00017426207,0.00006501939,0.00015255033,0.00087192765,0.00012468571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005295433,0.00010512941,0.00012697127,0.00029163886,0.0002865701,0.00034603543,0.00040956264,0.000021687316,0.000501971],"category_scores_gemma":[0.00045116237,0.00007519669,0.00007604754,0.00037424717,0.000033293527,0.00042693253,0.0000933412,0.00066847156,0.00029141505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014462587,0.000033410604,0.00006176342,0.000011539622,0.00006693629,0.000017590972,0.00059858523,0.8715055,0.09652927,0.0007890148,0.017903239,0.012468701],"study_design_scores_gemma":[0.002459224,0.0011574297,0.0690836,0.0006648314,0.000041109914,0.0005340164,0.001116891,0.8630634,0.030828718,0.0003151935,0.030172378,0.00056319317],"about_ca_topic_score_codex":0.000022526121,"about_ca_topic_score_gemma":0.000002295337,"teacher_disagreement_score":0.516187,"about_ca_system_score_codex":0.00011629722,"about_ca_system_score_gemma":0.000035206845,"threshold_uncertainty_score":0.5496231},"labels":[],"label_agreement":null},{"id":"W2021332829","doi":"10.1016/j.ejor.2011.06.011","title":"Models and algorithms to improve earthwork operations in road design using mixed integer linear programming","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"BIM and Construction Integration","field":"Engineering","cited_by":85,"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":"Earthworks; Integer programming; Linear programming; Integer (computer science); Mathematical optimization; Computer science; Set (abstract data type); Process (computing); Linear model; Algorithm; Mathematics; Engineering","score_opus":0.16808669972142634,"score_gpt":0.33526374380344826,"score_spread":0.16717704408202191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021332829","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.27171296,0.00026640453,0.72589874,0.00010393483,0.00030330155,0.00028306097,0.0000031049879,0.000017577959,0.0014109027],"genre_scores_gemma":[0.81240606,0.000037334594,0.1872221,0.000016782018,0.00021770214,0.000005962915,0.000001257586,0.00002407244,0.00006871978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998388,0.00046400816,0.00044364383,0.00012685849,0.00036609004,0.00021141826],"domain_scores_gemma":[0.9990744,0.00004668056,0.000021670225,0.00009016827,0.0006187436,0.00014831385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002549634,0.000098979035,0.00012609069,0.00042090678,0.00014003999,0.00014442165,0.00014522673,0.0000294225,0.0000558866],"category_scores_gemma":[0.00015326368,0.00008633138,0.00003098713,0.00034462675,0.000059308724,0.00054591213,0.0000391106,0.0004977677,0.000019118861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012073044,0.00008097159,0.00016066984,0.000014449961,0.000059035625,0.000105367064,0.005307798,0.78105766,0.02428047,0.004867355,0.00024737953,0.18369813],"study_design_scores_gemma":[0.0005327512,0.00037967623,0.0015463087,0.00014576755,0.0000062158833,0.00016805579,0.0009867179,0.9895888,0.0054840045,0.00022093776,0.0007698796,0.00017091598],"about_ca_topic_score_codex":0.000025166188,"about_ca_topic_score_gemma":0.000017314007,"teacher_disagreement_score":0.5406931,"about_ca_system_score_codex":0.00007657062,"about_ca_system_score_gemma":0.00012191908,"threshold_uncertainty_score":0.35204917},"labels":[],"label_agreement":null},{"id":"W2022679355","doi":"10.1016/j.ejor.2010.08.025","title":"A bargaining game model for measuring performance of two-stage network structures","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":140,"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":"Worcester Polytechnic Institute","keywords":"Data envelopment analysis; Bargaining problem; Measure (data warehouse); Stage (stratigraphy); Computer science; Nash equilibrium; Game theory; Efficiency; Process (computing); Mathematical optimization; Economics; Black box; Mathematical economics; Econometrics; Mathematics; Statistics; Artificial intelligence","score_opus":0.38247782007045567,"score_gpt":0.48257574727556063,"score_spread":0.10009792720510496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022679355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83685064,0.00004068865,0.15446337,0.000382975,0.00015115605,0.00014808892,0.000013825473,0.000004011463,0.007945241],"genre_scores_gemma":[0.97223,0.000007478333,0.024640357,0.000048243335,0.0007244445,0.0000034574164,0.0000014521156,0.000014031297,0.002330532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965113,0.000596528,0.00080656284,0.00017925166,0.0016787284,0.00022766391],"domain_scores_gemma":[0.99521977,0.0012348413,0.00030976566,0.00027483943,0.0028232087,0.00013757599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0248262,0.00007513927,0.0001674412,0.00025843043,0.00046739366,0.00019828536,0.00088399637,0.000018749435,0.00037650426],"category_scores_gemma":[0.0036529307,0.000053627755,0.00010158173,0.00042771056,0.0002166022,0.00043788986,0.00011205018,0.00061076134,0.00003258717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024334485,0.00003309763,0.0009304256,0.0000037841476,0.000018946203,0.0000029328228,0.0006426248,0.7113856,0.03907015,0.23500954,0.0021012712,0.010558282],"study_design_scores_gemma":[0.0013563354,0.00041316458,0.008887329,0.000047906575,0.000008576255,0.000087369874,0.0004573125,0.86665076,0.00874466,0.09699934,0.01616738,0.00017989503],"about_ca_topic_score_codex":4.5586472e-7,"about_ca_topic_score_gemma":0.0000021845815,"teacher_disagreement_score":0.15526514,"about_ca_system_score_codex":0.000015466527,"about_ca_system_score_gemma":0.00031906914,"threshold_uncertainty_score":0.8604315},"labels":[],"label_agreement":null},{"id":"W2023281330","doi":"10.1016/j.ejor.2009.10.023","title":"Rough support vector regression","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":34,"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; Saint Mary's University","funders":"","keywords":"Support vector machine; Mathematics; Rough set; Context (archaeology); Extension (predicate logic); Interval (graph theory); Range (aeronautics); Regression analysis; Regression; Upper and lower bounds; Data mining; Computer science; Artificial intelligence; Statistics; Combinatorics","score_opus":0.11570687870872379,"score_gpt":0.38359387294277214,"score_spread":0.2678869942340484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023281330","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.07459327,0.001097225,0.16236345,0.100503474,0.0015574796,0.00041339782,0.000006087767,0.00008692839,0.6593787],"genre_scores_gemma":[0.9620168,0.00010509524,0.03574732,0.00063313544,0.00063661864,2.6268052e-7,0.0000018854678,0.000006912133,0.00085194566],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99697703,0.0008808684,0.00039336458,0.0001750512,0.0012973591,0.00027635143],"domain_scores_gemma":[0.9985141,0.00011750991,0.000097034696,0.00026760495,0.00081604073,0.00018768951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049569104,0.0000846386,0.00012504893,0.0002153271,0.00027738448,0.00043150707,0.0012045078,0.000016849452,0.00014933196],"category_scores_gemma":[0.00036295524,0.000055542216,0.000074871066,0.00038594176,0.000048463215,0.00074687233,0.0001413397,0.0005041329,0.00029027715],"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.00017010841,0.0005676923,0.00027706145,0.000008518143,0.00003706068,0.0048430637,0.0021148014,0.0011998835,0.013489545,0.1669599,0.3315446,0.47878778],"study_design_scores_gemma":[0.003645245,0.013127256,0.24080873,0.00033905456,0.000009470911,0.00316627,0.00015577326,0.01586466,0.0049838386,0.012324449,0.70481616,0.0007590892],"about_ca_topic_score_codex":6.2586645e-7,"about_ca_topic_score_gemma":1.1262444e-7,"teacher_disagreement_score":0.8874236,"about_ca_system_score_codex":0.000052610645,"about_ca_system_score_gemma":0.00028694107,"threshold_uncertainty_score":0.41610324},"labels":[],"label_agreement":null},{"id":"W2023470442","doi":"10.1016/j.ejor.2015.01.020","title":"The discrete time window assignment vehicle routing problem","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"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":"Column generation; Vehicle routing problem; Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Window (computing); Routing (electronic design automation); Assignment problem; Mathematics","score_opus":0.07976025754685145,"score_gpt":0.34897727786088706,"score_spread":0.2692170203140356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023470442","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.22893846,0.0025056733,0.402839,0.015528085,0.0013225725,0.0011511688,0.000018099727,0.00027464694,0.3474223],"genre_scores_gemma":[0.95835024,0.000043970773,0.038552042,0.000035071153,0.0006543399,0.0000024919748,0.0000029899986,0.000059645405,0.0022991768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958614,0.0019615435,0.00051736773,0.00009881832,0.0012361042,0.0003247329],"domain_scores_gemma":[0.99810326,0.000490401,0.00007216857,0.00016530734,0.000934299,0.00023455817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017951207,0.00009684251,0.000117117524,0.00010550463,0.00036065426,0.00039660546,0.00045519412,0.000018172279,0.00005028325],"category_scores_gemma":[0.0012205978,0.000066275905,0.000050758383,0.0002942375,0.000091432514,0.00028231076,0.00010613075,0.00062640803,0.00025365144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005253922,0.000022441898,0.00044734013,0.000006546913,0.000068609006,0.00007160947,0.00090670236,0.95610934,0.012613113,0.0012232456,0.016831875,0.011646636],"study_design_scores_gemma":[0.0023277435,0.00072278775,0.0056625055,0.0002032104,0.000017140257,0.00023052927,0.0008616296,0.9053153,0.005784046,0.0005031106,0.077996686,0.0003753235],"about_ca_topic_score_codex":8.2622375e-7,"about_ca_topic_score_gemma":2.5784038e-7,"teacher_disagreement_score":0.7294118,"about_ca_system_score_codex":0.00020632042,"about_ca_system_score_gemma":0.00019601964,"threshold_uncertainty_score":0.62215656},"labels":[],"label_agreement":null},{"id":"W2023725141","doi":"10.1016/j.ejor.2007.12.009","title":"Statistically grounded logic operators in fuzzy sets","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"University of Alberta","funders":"","keywords":"Fuzzy logic; Mathematics; Fuzzy set; Dependency (UML); Membership function; Weight function; T-norm; Function (biology); Fuzzy number; Interpretation (philosophy); Cluster analysis; Algebra over a field; Algorithm; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence; Pure mathematics; Statistics","score_opus":0.11402964769395359,"score_gpt":0.39088101606572545,"score_spread":0.2768513683717719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023725141","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.11288163,0.00043275044,0.5471579,0.007691901,0.0006824087,0.0003229304,0.000006535573,0.000028547405,0.3307954],"genre_scores_gemma":[0.8770086,0.000056688506,0.122121714,0.00046225663,0.00020820912,5.3481494e-7,0.000002117901,0.000011279925,0.00012859973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99594593,0.0012084106,0.0007229096,0.00023957738,0.0014015585,0.00048162974],"domain_scores_gemma":[0.9979095,0.0005795503,0.00008700578,0.00024155219,0.00092268304,0.00025971784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016282305,0.00011069681,0.00017202036,0.0005180491,0.00021270617,0.00049664604,0.0012599924,0.00002615889,0.00009937271],"category_scores_gemma":[0.0009426272,0.00008250308,0.00005156254,0.0007655087,0.00012633066,0.00063658477,0.00027889412,0.0007614052,0.00019781114],"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.00016890274,0.00045014612,0.001753733,0.000013855261,0.000031855983,0.009641323,0.0015497613,0.0015463108,0.001688655,0.85525453,0.008832254,0.11906865],"study_design_scores_gemma":[0.0061918763,0.0058716508,0.82426137,0.0002885949,0.000008079148,0.0023512468,0.0009287192,0.017408278,0.0006818072,0.088235565,0.05273576,0.0010370599],"about_ca_topic_score_codex":0.000009476107,"about_ca_topic_score_gemma":0.000015845497,"teacher_disagreement_score":0.8225076,"about_ca_system_score_codex":0.00014410393,"about_ca_system_score_gemma":0.00036894734,"threshold_uncertainty_score":0.56431544},"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":"W2024345355","doi":"10.1016/s0377-2217(01)00090-x","title":"Dealing with interval scale data in data envelopment analysis","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"University of Alberta","funders":"","keywords":"Data envelopment analysis; Scale (ratio); Interval (graph theory); Interval data; Variable (mathematics); Econometrics; Statistics; Level of measurement; Profit (economics); Computer science; Mathematics; Economics; Geography","score_opus":0.5450084714764613,"score_gpt":0.5053043003198925,"score_spread":0.03970417115656877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024345355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.867322,0.0013410801,0.08183621,0.018547121,0.00018057648,0.00022295916,0.00013140001,0.0000112895805,0.03040734],"genre_scores_gemma":[0.981816,0.00008594918,0.016445894,0.00010008944,0.0001533487,2.2813833e-7,0.000039465256,0.000012705805,0.00134633],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9887069,0.002975331,0.0014113388,0.0006674792,0.0059084687,0.00033047816],"domain_scores_gemma":[0.9942575,0.0015427319,0.0002972043,0.00203052,0.0016788075,0.00019322865],"candidate_categories":["metaresearch","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.06072169,0.00011351235,0.0003587675,0.0023042043,0.0002935434,0.0009199888,0.0063643595,0.00001664603,0.0020459911],"category_scores_gemma":[0.007204092,0.00007289545,0.000069241745,0.004290037,0.00023946393,0.0013336629,0.0016803263,0.00066609343,0.00045925422],"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.0007384105,0.0023825571,0.3182411,0.000013723653,0.0023695012,0.0056854845,0.008400301,0.2915957,0.0024298984,0.001579169,0.10252416,0.26404],"study_design_scores_gemma":[0.0011389902,0.0003416178,0.12731932,0.00012687595,0.00014740051,0.00017787097,0.0016436417,0.7950124,0.00010006263,0.00012839673,0.07356342,0.00029995],"about_ca_topic_score_codex":0.000021310252,"about_ca_topic_score_gemma":0.00035604514,"teacher_disagreement_score":0.5034167,"about_ca_system_score_codex":0.00007928432,"about_ca_system_score_gemma":0.00019390567,"threshold_uncertainty_score":0.9990117},"labels":[],"label_agreement":null},{"id":"W2025661878","doi":"10.1016/j.ejor.2003.09.024","title":"Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Travelling salesman problem; Undirected graph; Combinatorics; Bottleneck traveling salesman problem; Euclidean geometry; Disjoint sets; Lin–Kernighan heuristic; Mathematics; Algorithm; Branch and cut; Hamiltonian path; Discrete mathematics; Computer science; Graph; Integer programming","score_opus":0.10347229407901987,"score_gpt":0.36713532248867153,"score_spread":0.26366302840965167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025661878","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.05425559,0.0026726217,0.912051,0.0023201685,0.00058605406,0.0007974455,0.000014304087,0.00008171145,0.02722109],"genre_scores_gemma":[0.82780445,0.00032365607,0.17051436,0.000052610183,0.0003120163,0.0000092722985,0.000003202208,0.0000676595,0.0009127875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779826,0.0010548019,0.00036418415,0.00009845476,0.0004505868,0.0002336955],"domain_scores_gemma":[0.99819076,0.0008497134,0.000040359817,0.000114658986,0.00070232246,0.000102205624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074309004,0.00008911714,0.00011613023,0.00014437882,0.00031238495,0.00018340068,0.00021550943,0.00001891603,0.000081572674],"category_scores_gemma":[0.0011114896,0.00006322371,0.000046628284,0.0002704108,0.00009335148,0.0001392324,0.000022558086,0.0004048208,0.000015965838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082847866,0.000084872576,0.0006620449,0.0001287199,0.00030458038,0.000055805674,0.0020724905,0.88228655,0.020698493,0.017038362,0.011184612,0.06540061],"study_design_scores_gemma":[0.005090247,0.0010435818,0.019075617,0.00032909433,0.00007877154,0.0010961982,0.00060193456,0.67393076,0.015285121,0.0018614745,0.28090006,0.00070712157],"about_ca_topic_score_codex":5.537138e-7,"about_ca_topic_score_gemma":7.8020656e-7,"teacher_disagreement_score":0.77354884,"about_ca_system_score_codex":0.000054357195,"about_ca_system_score_gemma":0.000099443736,"threshold_uncertainty_score":0.25781882},"labels":[],"label_agreement":null},{"id":"W2026126425","doi":"10.1016/j.ejor.2011.06.018","title":"Inventory competition for newsvendors under the objective of profit satisficing","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Profit maximization; Satisficing; Nash equilibrium; Economics; Multiplicative function; Stocking; Microeconomics; Profit (economics); Maximization; Mathematical economics; Econometrics; Mathematics","score_opus":0.17863910406010677,"score_gpt":0.32426860118762957,"score_spread":0.1456294971275228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026126425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7127863,0.00029864514,0.014167795,0.0049134768,0.0009942615,0.0012641483,0.000005386493,0.0000192328,0.26555076],"genre_scores_gemma":[0.99731505,0.0000122392885,0.0004652526,0.000559648,0.0010287006,0.0000069911134,0.000006151598,0.00002040163,0.0005855712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99845004,0.00021974785,0.00040952532,0.000107093656,0.0006361526,0.00017746253],"domain_scores_gemma":[0.9983054,0.000134263,0.00023447057,0.00012235828,0.001187661,0.000015890128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005310723,0.000077834025,0.000115069546,0.00034005064,0.00027771125,0.00011371445,0.00037045585,0.000011008374,0.00052330823],"category_scores_gemma":[0.00034706623,0.00005310788,0.00009404718,0.0002617738,0.00015399998,0.000572659,0.0001304702,0.00021545851,0.00005886062],"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.0004429971,0.00017670754,0.006300473,0.00015933774,0.00016673638,0.000026216785,0.0012234704,0.00092116016,0.002270574,0.9593582,0.025125088,0.0038290168],"study_design_scores_gemma":[0.009793194,0.0019815897,0.47395784,0.0013777862,0.0002665418,0.000057011013,0.054005895,0.014817037,0.0057714838,0.07374334,0.3632369,0.0009913765],"about_ca_topic_score_codex":0.000053291802,"about_ca_topic_score_gemma":0.000015737822,"teacher_disagreement_score":0.8856149,"about_ca_system_score_codex":0.000054700038,"about_ca_system_score_gemma":0.00007349976,"threshold_uncertainty_score":0.5729858},"labels":[],"label_agreement":null},{"id":"W2026626290","doi":"10.1016/j.ejor.2008.06.017","title":"Allocating the fixed cost as a complement of other cost inputs: A DEA approach","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":120,"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":"Complement (music); Fixed cost; Cost allocation; Total cost; Computer science; Mathematical optimization; Cost efficiency; Operations research; Economics; Microeconomics; Mathematics","score_opus":0.44139566915698003,"score_gpt":0.48894218138329,"score_spread":0.047546512226309956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026626290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7404787,0.00065630366,0.102438085,0.014574152,0.00022467159,0.0009822735,0.000034949713,0.000011017025,0.14059983],"genre_scores_gemma":[0.9915656,0.000018528463,0.0056919055,0.0005525124,0.00024278017,0.0000031536595,0.0000029625762,0.00001848066,0.0019040683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.98625636,0.0053099077,0.0015429705,0.00029224053,0.006255467,0.0003430353],"domain_scores_gemma":[0.9914251,0.0028888248,0.00053121755,0.0005134678,0.00447897,0.00016245017],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.042229764,0.00012140556,0.00030377318,0.0006020064,0.00082675484,0.00031512423,0.0020111876,0.000018354915,0.0008924172],"category_scores_gemma":[0.011678813,0.00006796125,0.00018735259,0.0016879565,0.00070641324,0.00028373874,0.000310336,0.0006495038,0.00041441186],"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.0014517206,0.004148298,0.05361862,0.000039897674,0.0009671892,0.0011368154,0.042147923,0.3977119,0.05858615,0.051408928,0.3303086,0.058473945],"study_design_scores_gemma":[0.00574957,0.0027484999,0.10278684,0.0004001506,0.000081221944,0.0029225657,0.011927788,0.1547192,0.008897372,0.0016898466,0.7072476,0.0008293386],"about_ca_topic_score_codex":0.00003396346,"about_ca_topic_score_gemma":0.0000072862704,"teacher_disagreement_score":0.376939,"about_ca_system_score_codex":0.00009347397,"about_ca_system_score_gemma":0.00076310465,"threshold_uncertainty_score":0.9966462},"labels":[],"label_agreement":null},{"id":"W2027362250","doi":"10.1016/j.ejor.2007.05.042","title":"Retailer’s optimal replenishment decisions with credit-linked demand under permissible delay in payments","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":240,"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":"Trade credit; Payment; Order (exchange); Economic order quantity; Business; Microeconomics; Period (music); Economics; Actuarial science; Finance; Supply chain; Marketing","score_opus":0.11670707189862543,"score_gpt":0.3446620012063871,"score_spread":0.22795492930776168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027362250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90561295,0.00022734374,0.009729054,0.003768264,0.00033505127,0.00040842232,0.0000015317892,0.000016729455,0.07990068],"genre_scores_gemma":[0.99319047,0.000052746476,0.0022991823,0.0009831855,0.0013671526,0.0000033020028,0.000016271924,0.00003838017,0.0020493378],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965345,0.0001929573,0.00075706193,0.00026989152,0.0017637432,0.0004818073],"domain_scores_gemma":[0.9983041,0.00021217874,0.00019806455,0.00023426386,0.00097494404,0.0000764448],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.012510687,0.00015763556,0.00019385909,0.0010091137,0.00034582298,0.0005316284,0.00052686513,0.000026260332,0.0010354586],"category_scores_gemma":[0.000495923,0.000116756484,0.000072481176,0.0007204707,0.00011997537,0.0011297045,0.0002747588,0.0005543563,0.0002345983],"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.009462014,0.0044879834,0.1572609,0.00029872276,0.00089492364,0.01999228,0.002134131,0.13460383,0.009103909,0.09335422,0.5303066,0.03810051],"study_design_scores_gemma":[0.007359656,0.000758441,0.38015175,0.0007883716,0.000051809984,0.00015886467,0.004556553,0.009550647,0.00027645804,0.0007266253,0.5950253,0.00059551164],"about_ca_topic_score_codex":0.00002257119,"about_ca_topic_score_gemma":0.000035938134,"teacher_disagreement_score":0.22289084,"about_ca_system_score_codex":0.0001764223,"about_ca_system_score_gemma":0.00013106987,"threshold_uncertainty_score":0.99987775},"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":"W2029049650","doi":"10.1016/j.ejor.2007.01.054","title":"Solving circle packing problems by global optimization: Numerical results and industrial applications","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":215,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circle packing; Rectangle; Packing problems; Container (type theory); Heuristic; Mathematical optimization; Global optimization; Computer science; Set packing; Work (physics); Mathematics; Combinatorics; Geometry; Engineering; Mechanical engineering","score_opus":0.06645379157372057,"score_gpt":0.3199350637391034,"score_spread":0.25348127216538285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049650","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.0026338864,0.0007559313,0.96060914,0.0008318141,0.00019996543,0.0002949929,0.000037436504,0.000054451593,0.0345824],"genre_scores_gemma":[0.9808667,0.00021944704,0.017985411,0.000049335624,0.0006533358,0.000002837054,0.000042167216,0.00003373173,0.0001470456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801004,0.00025323057,0.00064144825,0.00015072443,0.0006534467,0.00029111476],"domain_scores_gemma":[0.9987792,0.00020368182,0.00008551938,0.0001149264,0.0005877474,0.00022897338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047058496,0.000101974474,0.00013032582,0.0001499778,0.00027724003,0.00028709654,0.00021593271,0.000046373163,0.00006118492],"category_scores_gemma":[0.0003244874,0.000102967984,0.000033837507,0.00057457126,0.00008153556,0.00030501332,0.000054799668,0.00051922235,0.000021022874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005342534,0.000046830875,0.0005298397,0.000015214028,0.000036330992,0.000019753435,0.00023712189,0.9630729,0.0004923679,0.00036885723,0.0120700635,0.023057282],"study_design_scores_gemma":[0.007992225,0.0011306225,0.006196234,0.0006140917,0.00004439718,0.00088730163,0.0007144261,0.5665427,0.0015953513,0.0002884672,0.4128763,0.0011178814],"about_ca_topic_score_codex":0.0000023273024,"about_ca_topic_score_gemma":0.0000010383509,"teacher_disagreement_score":0.9782328,"about_ca_system_score_codex":0.00012116578,"about_ca_system_score_gemma":0.000086953805,"threshold_uncertainty_score":0.41989124},"labels":[],"label_agreement":null},{"id":"W2029272463","doi":"10.1016/j.ejor.2011.01.016","title":"Globally optimal clusterwise regression by mixed logical-quadratic programming","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Regression analysis; Integer programming; Quadratic equation; Mathematical optimization; Operations research; Mathematics; Statistics","score_opus":0.1333836776367603,"score_gpt":0.376373881362056,"score_spread":0.24299020372529573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029272463","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.034452394,0.00059684087,0.9537784,0.0017913325,0.0003097617,0.0003270373,0.0000040678133,0.00005066948,0.008689516],"genre_scores_gemma":[0.52671343,0.00007667574,0.4715045,0.000095382915,0.00025205265,0.00000621497,0.00000323202,0.000030323203,0.0013182007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99321055,0.0023374802,0.0007249838,0.00040260656,0.0026467207,0.0006776629],"domain_scores_gemma":[0.9967219,0.00029472917,0.00019476554,0.00046733645,0.0018483822,0.00047287135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008105674,0.00018572541,0.00023654726,0.00032986084,0.00047532155,0.0006268449,0.0027521914,0.000040862236,0.000109945126],"category_scores_gemma":[0.0011548372,0.00013480322,0.000107508466,0.00073438574,0.0002621706,0.0012534013,0.0011927236,0.0010312625,0.00020914034],"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.001128827,0.0025354985,0.00055017567,0.00010692733,0.0002547248,0.010214275,0.006655483,0.0047403355,0.042270638,0.02800859,0.048985284,0.8545492],"study_design_scores_gemma":[0.019673904,0.040625278,0.034162056,0.0034547248,0.00006058218,0.01237768,0.0048746127,0.3937828,0.0634524,0.0069997297,0.41616297,0.004373269],"about_ca_topic_score_codex":0.000004419346,"about_ca_topic_score_gemma":6.236648e-7,"teacher_disagreement_score":0.850176,"about_ca_system_score_codex":0.00018555323,"about_ca_system_score_gemma":0.00037246698,"threshold_uncertainty_score":0.604468},"labels":[],"label_agreement":null},{"id":"W2030367097","doi":"10.1016/j.ejor.2014.03.025","title":"Lease expiration management for a single lease term in the apartment industry","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Western University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lease; Apartment; Renting; Revenue; Context (archaeology); Term (time); Revenue management; Business; Total revenue; Finance; Microeconomics; Actuarial science; Economics; Computer science; Engineering","score_opus":0.1468736560292749,"score_gpt":0.3363362549384432,"score_spread":0.1894625989091683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030367097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49703914,0.00012767351,0.0058997846,0.02391945,0.00067436986,0.001667858,0.000003122039,0.000016664228,0.47065195],"genre_scores_gemma":[0.992475,0.0000062331933,0.0003114913,0.0037637956,0.0021440922,0.000030516692,0.00001992906,0.00001739514,0.0012315819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784374,0.00035012534,0.00045458655,0.00016864104,0.0009139015,0.00026903147],"domain_scores_gemma":[0.9991229,0.00012601043,0.00014106205,0.00019204663,0.00039324677,0.000024717807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008949986,0.000107808344,0.00011124492,0.0004973283,0.00028472944,0.00064023293,0.0005212524,0.000022210697,0.00028263777],"category_scores_gemma":[0.0003870976,0.00007687483,0.00007491114,0.00034102864,0.00006328966,0.0007036139,0.0001350677,0.00037766958,0.00017237647],"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.0009636546,0.0029426625,0.009418958,0.00064591866,0.00018729124,0.00077732763,0.0010959717,0.0075827925,0.00326,0.52933276,0.36391068,0.079882],"study_design_scores_gemma":[0.0030625733,0.00036203096,0.021504836,0.00018767663,0.000032769225,0.000015027994,0.0023241309,0.004754559,0.000110364475,0.0018734752,0.9655589,0.00021366893],"about_ca_topic_score_codex":0.000004783501,"about_ca_topic_score_gemma":0.000006735326,"teacher_disagreement_score":0.6016482,"about_ca_system_score_codex":0.00008262406,"about_ca_system_score_gemma":0.000024266668,"threshold_uncertainty_score":0.6173781},"labels":[],"label_agreement":null},{"id":"W2031199642","doi":"10.1016/j.ejor.2007.05.014","title":"A two-stage fuzzy robust integer programming approach for capacity planning of environmental management systems","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Dalhousie University","funders":"","keywords":"Mathematical optimization; Integer programming; Robust optimization; Stochastic programming; Computer science; Fuzzy logic; Robustness (evolution); Linear programming; Probabilistic logic; Context (archaeology); Operations research; Mathematics; Artificial intelligence","score_opus":0.08575189804795146,"score_gpt":0.28884948626454093,"score_spread":0.20309758821658946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031199642","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.16667219,0.00036521527,0.79272777,0.000014465822,0.000141676,0.0006555032,0.0000116391475,0.000020356652,0.039391164],"genre_scores_gemma":[0.93783337,0.000017630846,0.060983516,0.0000038506637,0.00024345312,0.0000054397133,0.000025511185,0.000033878223,0.00085337803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983354,0.0001517295,0.00049261126,0.00010877504,0.00064434746,0.00026710946],"domain_scores_gemma":[0.99956745,0.000058759655,0.000081458325,0.00009875151,0.00011090085,0.00008268907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048353164,0.000099014214,0.00013376966,0.00038215873,0.000115050265,0.0001277127,0.00025248705,0.000015106817,0.000014754274],"category_scores_gemma":[0.000024554018,0.00008645199,0.000061312465,0.00015052558,0.00005960382,0.0002114652,0.00006658165,0.00024771452,0.0000041872277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008496139,0.000072140036,0.00043657856,0.00021048894,0.00011591137,0.000044095574,0.0006538071,0.99316776,0.0012039023,0.0013341607,0.00038553323,0.0022906747],"study_design_scores_gemma":[0.0049024993,0.00094910123,0.01076918,0.0005363549,0.00007870764,0.00008442141,0.011823673,0.90523976,0.001817365,0.000022168631,0.06319423,0.00058252126],"about_ca_topic_score_codex":0.0000013048947,"about_ca_topic_score_gemma":1.8796834e-7,"teacher_disagreement_score":0.77116114,"about_ca_system_score_codex":0.000111413116,"about_ca_system_score_gemma":0.0000058598757,"threshold_uncertainty_score":0.35254097},"labels":[],"label_agreement":null},{"id":"W2033020716","doi":"10.1016/j.ejor.2008.02.029","title":"Optimal ordering and transfer policy for an inventory with stock dependent demand","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Concordia University","funders":"","keywords":"Stock (firearms); Transfer (computing); Operations research; Microeconomics; Business; Economics; Computer science; Mathematics","score_opus":0.12675033020924217,"score_gpt":0.3269600305457939,"score_spread":0.20020970033655175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033020716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9773274,0.00013591941,0.010287131,0.0014756292,0.00007000018,0.0003159127,0.0000015892732,0.000010543702,0.010375873],"genre_scores_gemma":[0.9954807,0.00005038278,0.0010356819,0.00055508927,0.0019795746,0.0000070448637,0.000007842259,0.00003418425,0.00084948813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984593,0.00011659868,0.00029010006,0.00016942385,0.0007057922,0.0002588305],"domain_scores_gemma":[0.99906886,0.00004006866,0.000050446568,0.000104170496,0.00068180537,0.00005462501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002661106,0.00010840193,0.00012946146,0.0005405305,0.00050101697,0.00028799655,0.00025537467,0.000013226105,0.00010048646],"category_scores_gemma":[0.00014058745,0.000083841456,0.0000396001,0.00021668467,0.0001360478,0.0012065659,0.00008246347,0.00021660287,0.000016240765],"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.015684292,0.004784247,0.14182113,0.0023964094,0.0020212424,0.0051683993,0.013776383,0.18421808,0.030764543,0.3687293,0.17174403,0.058891967],"study_design_scores_gemma":[0.020551156,0.005160687,0.12738082,0.0005461936,0.00013859019,0.0010009155,0.0047223014,0.08124839,0.0009912968,0.00081026554,0.756004,0.001445384],"about_ca_topic_score_codex":0.000033247867,"about_ca_topic_score_gemma":0.000019945843,"teacher_disagreement_score":0.58426,"about_ca_system_score_codex":0.000046096047,"about_ca_system_score_gemma":0.00012677637,"threshold_uncertainty_score":0.38534683},"labels":[],"label_agreement":null},{"id":"W2035380861","doi":"10.1016/j.ejor.2007.03.007","title":"A review of the joint replenishment problem literature: 1989–2005","year":2007,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":294,"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":"Joint (building); Computer science; Quality (philosophy); Mathematical optimization; Operations research; Mathematical economics; Economics; Mathematics; Engineering","score_opus":0.2120009324741855,"score_gpt":0.39129490063724176,"score_spread":0.17929396816305626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035380861","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":[8.361318e-7,0.9335999,0.00002735942,0.0019542305,0.00049060327,0.001084331,0.000007766682,0.0000069065673,0.0628281],"genre_scores_gemma":[0.000009645372,0.99034876,0.00028464067,0.002298927,0.0033152623,0.000013660016,0.00005464293,0.00006979911,0.0036046503],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99381083,0.0009796474,0.0021498697,0.00032204215,0.0022902328,0.0004473537],"domain_scores_gemma":[0.9957359,0.0001439812,0.0013964792,0.0005914066,0.00208428,0.000047957663],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0239345,0.00032759886,0.000988395,0.00093077193,0.00028406616,0.0005039599,0.0014640884,0.00005476222,0.0010622274],"category_scores_gemma":[0.0011586312,0.0001870359,0.000873278,0.00150281,0.00017816808,0.0005831799,0.0008888348,0.0014167819,0.00030807144],"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.00001375894,0.00016170535,0.0000025418008,0.10644963,0.00019561267,0.00015191533,0.000028014943,0.0000047071294,0.000001605152,0.009510227,0.5604871,0.32299322],"study_design_scores_gemma":[0.00017130392,0.000034321845,0.000010479932,0.17771882,0.00014201693,0.00005791579,0.000014560058,0.0000047304784,6.62286e-7,0.00005893976,0.8216467,0.0001395922],"about_ca_topic_score_codex":0.000004848184,"about_ca_topic_score_gemma":0.0000016183344,"teacher_disagreement_score":0.32285362,"about_ca_system_score_codex":0.00021380189,"about_ca_system_score_gemma":0.00042668736,"threshold_uncertainty_score":0.9998509},"labels":[],"label_agreement":null},{"id":"W2036016884","doi":"10.1016/j.ejor.2006.03.048","title":"Classifying inputs and outputs in data envelopment analysis","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Computer science; Aggregate (composite); Constant (computer programming); Returns to scale; Scale (ratio); Econometrics; Mathematical optimization; Operations research; Production (economics); Mathematics; Economics","score_opus":0.3869024093103371,"score_gpt":0.4902033584011331,"score_spread":0.10330094909079601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036016884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9417458,0.0009755634,0.029619066,0.011215756,0.00011669726,0.00010288864,0.000016770524,0.000005001746,0.016202431],"genre_scores_gemma":[0.99281627,0.000044816756,0.0052619865,0.000101317804,0.000190132,2.8486244e-7,0.0000140628945,0.000008527517,0.0015625847],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99024355,0.0032455605,0.0014146848,0.0004616859,0.004339537,0.00029497058],"domain_scores_gemma":[0.9958403,0.0017018324,0.0002668147,0.0006047885,0.0014568857,0.00012935072],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.05555726,0.00009897932,0.00031725215,0.0029883066,0.00029417893,0.0009238725,0.0017218958,0.000021062195,0.00020639725],"category_scores_gemma":[0.00634618,0.000070243004,0.00008116948,0.0040016323,0.00021558134,0.0007312452,0.0006873829,0.0005255947,0.000121891986],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028940785,0.0011057036,0.6809698,0.000011013913,0.0006593231,0.0029721255,0.002595548,0.12926622,0.013167989,0.011353062,0.073285855,0.08432398],"study_design_scores_gemma":[0.000655375,0.00009647808,0.8956953,0.00003826901,0.00004862632,0.00005564439,0.00033075895,0.046544433,0.00019915335,0.0010691092,0.055102706,0.00016409473],"about_ca_topic_score_codex":0.00003195848,"about_ca_topic_score_gemma":0.00020428377,"teacher_disagreement_score":0.21472558,"about_ca_system_score_codex":0.00009211796,"about_ca_system_score_gemma":0.00034999577,"threshold_uncertainty_score":0.9725025},"labels":[],"label_agreement":null},{"id":"W2036776481","doi":"10.1016/s0377-2217(01)00366-6","title":"Fuzzy interval and semi-orders","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"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":"Government of Canada","keywords":"Interval (graph theory); Fuzzy logic; Mathematics; Computer science; Mathematical optimization; Artificial intelligence; Combinatorics","score_opus":0.5111493511154003,"score_gpt":0.5116162654155219,"score_spread":0.0004669143001215792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036776481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8842182,0.00110364,0.004767485,0.0090738945,0.0006109227,0.00015108305,0.000010338441,0.000008946571,0.100055486],"genre_scores_gemma":[0.98840815,0.00007963614,0.0053592664,0.0003002345,0.00047531337,4.862926e-7,4.3012875e-7,0.000018750217,0.0053577186],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99072874,0.0032212283,0.0011191925,0.0003051334,0.0043319645,0.0002937682],"domain_scores_gemma":[0.99380356,0.0026804518,0.00020423357,0.00031866267,0.002702145,0.00029093912],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.026532173,0.00010825555,0.00023148299,0.0008989116,0.00035888952,0.0013330654,0.0011067115,0.000022638831,0.004036055],"category_scores_gemma":[0.018553728,0.0000739787,0.0000985576,0.00067910744,0.00025891114,0.0007594372,0.00042172227,0.00065169774,0.0014506145],"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.00035541662,0.0003194844,0.008251201,0.000008343013,0.000077212135,0.0020415406,0.0041985237,0.0013698154,0.017059937,0.009118839,0.54008794,0.41711175],"study_design_scores_gemma":[0.0033310717,0.0014104762,0.12400895,0.00025722705,0.000009752334,0.002095478,0.0029574432,0.023274345,0.0003894889,0.010491648,0.8313338,0.00044028138],"about_ca_topic_score_codex":0.0000020783177,"about_ca_topic_score_gemma":0.0000020398043,"teacher_disagreement_score":0.41667148,"about_ca_system_score_codex":0.000047161313,"about_ca_system_score_gemma":0.00006780562,"threshold_uncertainty_score":0.99970365},"labels":[],"label_agreement":null},{"id":"W2036909357","doi":"10.1016/j.ejor.2006.03.053","title":"An interval-parameter fuzzy nonlinear optimization model for stream water quality management under uncertainty","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":148,"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 Regina","funders":"","keywords":"Linearization; Mathematical optimization; Fuzzy logic; Interval (graph theory); Nonlinear programming; Nonlinear system; Computer science; Optimization problem; Fuzzy set; Mathematics; Artificial intelligence","score_opus":0.07461369782545231,"score_gpt":0.33592533543967407,"score_spread":0.26131163761422177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036909357","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.10027501,0.00002896969,0.89203846,0.00022849659,0.00009244673,0.00029897812,0.000013921593,0.000034460947,0.006989255],"genre_scores_gemma":[0.86530465,0.000027983386,0.13175924,0.000056802997,0.00040382077,0.00000830372,0.00027812642,0.000056688965,0.002104387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806035,0.0003375374,0.00056277256,0.00015802988,0.00059429585,0.00028699357],"domain_scores_gemma":[0.9991194,0.000045709538,0.00004648524,0.00017440094,0.00053383934,0.000080175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026632233,0.0001290044,0.00014076647,0.0003134795,0.00015993002,0.00032710066,0.00032204646,0.000023779005,0.00008532833],"category_scores_gemma":[0.000020297359,0.00009650885,0.00008074938,0.00011842397,0.000043813914,0.00047993628,0.000058917765,0.0001982917,0.000019556752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000925194,0.000092096554,0.000037407146,0.000043325403,0.000054055497,0.000008391574,0.00016426304,0.9946091,0.00038996642,0.001747111,0.0020778277,0.0006839352],"study_design_scores_gemma":[0.00077022036,0.00012943304,0.00033289415,0.000026217358,0.000014136576,0.000002366991,0.00009448148,0.9966053,0.0002617983,0.00053236476,0.0011060387,0.00012475249],"about_ca_topic_score_codex":0.000004369452,"about_ca_topic_score_gemma":0.000005807507,"teacher_disagreement_score":0.7650296,"about_ca_system_score_codex":0.0001155141,"about_ca_system_score_gemma":0.000012577342,"threshold_uncertainty_score":0.39355168},"labels":[],"label_agreement":null},{"id":"W2036961948","doi":"10.1016/j.ejor.2009.01.026","title":"Fuzzy multi-objective programming for supplier selection and risk modeling: A possibility approach","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":216,"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":"Fuzzy logic; Computer science; Selection (genetic algorithm); Supply chain; Programming paradigm; Operations research; Mathematical optimization; Machine learning; Artificial intelligence; Mathematics; Business","score_opus":0.37158248385785386,"score_gpt":0.5019066362398276,"score_spread":0.1303241523819737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036961948","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.44740602,0.00015880958,0.5498318,0.00025797123,0.00008050785,0.0005311965,0.000014524801,0.000009055043,0.0017100759],"genre_scores_gemma":[0.70902705,0.000018830095,0.2903121,0.00003280311,0.0003175257,0.000004798521,0.0000029200335,0.000015212157,0.00026871197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99150336,0.003192468,0.0012780654,0.0006163838,0.0029892894,0.0004204476],"domain_scores_gemma":[0.9915959,0.00154565,0.0003293115,0.00029426822,0.0059488155,0.00028602942],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.046592258,0.0001673714,0.00033130404,0.0008362844,0.00089244667,0.0015200386,0.00073469314,0.00004870658,0.00003533199],"category_scores_gemma":[0.020559378,0.00011690972,0.00016331753,0.00084318826,0.000119213306,0.00085031346,0.00014250772,0.0008193773,0.000021302996],"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.0037351218,0.00210398,0.011821133,0.000022249702,0.00015395267,0.000059449765,0.008651354,0.14166346,0.011631711,0.0044890423,0.0042646746,0.8114039],"study_design_scores_gemma":[0.0025022062,0.0011407263,0.04207812,0.00003239453,0.000015172795,0.00023438322,0.0017900711,0.94197714,0.00014316589,0.007369033,0.0025093295,0.00020828494],"about_ca_topic_score_codex":0.000008244446,"about_ca_topic_score_gemma":0.000004850268,"teacher_disagreement_score":0.81119555,"about_ca_system_score_codex":0.00013210144,"about_ca_system_score_gemma":0.00031852923,"threshold_uncertainty_score":0.9995165},"labels":[],"label_agreement":null},{"id":"W2038830712","doi":"10.1016/j.ejor.2011.12.015","title":"Dual role of price and myopia in a marketing channel","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Context (archaeology); Product (mathematics); Quality (philosophy); Dual (grammatical number); Microeconomics; Channel (broadcasting); Economics; Limit price; Business; Marketing; Price level; Computer science; Mathematics; Monetary economics; Telecommunications","score_opus":0.09007102696663051,"score_gpt":0.30298360429680005,"score_spread":0.21291257733016955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038830712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92484486,0.0003014242,0.000022286078,0.00017041902,0.000051940857,0.00006956566,5.4973685e-7,0.0000025834127,0.07453636],"genre_scores_gemma":[0.99916077,0.000038956634,0.00031011953,0.00004468668,0.0002936192,7.056202e-7,9.381391e-7,0.000012966154,0.00013725593],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99863124,0.00027060014,0.0003778778,0.00010019494,0.0004472329,0.00017286216],"domain_scores_gemma":[0.99902105,0.00016420768,0.00012975672,0.00006939367,0.00059616676,0.000019433119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009259043,0.000064150845,0.000117494,0.000528242,0.000097199474,0.00010220892,0.00016737774,0.000012020374,0.0003944563],"category_scores_gemma":[0.00083247764,0.00005525769,0.00002997447,0.00033970783,0.00006652574,0.0005890199,0.0001943944,0.00030507162,0.000018368937],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023184712,0.00061636436,0.8160321,0.0003625991,0.00008107609,0.00075799477,0.0040380126,0.00004761808,0.034945022,0.009951846,0.0019413471,0.12890756],"study_design_scores_gemma":[0.0005164392,0.000039575523,0.9936465,0.00016370974,0.000007252184,0.000026432524,0.0007671518,0.00050377625,0.00010774633,0.0002059551,0.003943456,0.00007202677],"about_ca_topic_score_codex":0.00007417841,"about_ca_topic_score_gemma":0.000013105265,"teacher_disagreement_score":0.17761439,"about_ca_system_score_codex":0.0000116798265,"about_ca_system_score_gemma":0.000050765226,"threshold_uncertainty_score":0.43190196},"labels":[],"label_agreement":null},{"id":"W2039059059","doi":"10.1016/j.ejor.2011.02.009","title":"Integrated airline crew scheduling: A bi-dynamic constraint aggregation method using neighborhoods","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Column generation; Computer science; Crew scheduling; Schedule; Scheduling (production processes); Set cover problem; Constraint (computer-aided design); Mathematical optimization; Sequence (biology); Set (abstract data type); Constraint programming; Computational complexity theory; Operations research; Algorithm; Mathematics; Engineering","score_opus":0.15304093307016245,"score_gpt":0.3942011772132707,"score_spread":0.24116024414310824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039059059","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037982482,0.0001266548,0.9514358,0.00010353854,0.00022440084,0.000594244,0.000007320455,0.000057059326,0.009468515],"genre_scores_gemma":[0.38993764,0.000023369836,0.6097329,0.000024289375,0.00015353145,0.000006681632,0.0000058875917,0.00005482185,0.000060838527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99534535,0.0025058158,0.0008571148,0.00017687211,0.0007768623,0.00033797513],"domain_scores_gemma":[0.9973188,0.00032099738,0.00013914492,0.00019120777,0.0018100484,0.00021978904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010969925,0.00017303503,0.00023628164,0.0006345825,0.00020594042,0.00015570603,0.0003885786,0.000051433362,0.00064359704],"category_scores_gemma":[0.0016651409,0.00015305026,0.00009618116,0.00078428246,0.00012936845,0.00041472583,0.000068238616,0.0010163999,0.00004198888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108248256,0.00009140778,0.00025663,0.000042709882,0.00014248658,0.00019684489,0.0010794948,0.8913208,0.04607142,0.0018695329,0.00014597506,0.05867441],"study_design_scores_gemma":[0.0008123581,0.00018732087,0.0012983646,0.00017741077,0.000014947743,0.00034531986,0.0003009227,0.99094987,0.0048367106,0.00016383604,0.00074573146,0.00016719627],"about_ca_topic_score_codex":0.000006397297,"about_ca_topic_score_gemma":0.0000011210831,"teacher_disagreement_score":0.35195515,"about_ca_system_score_codex":0.0002435854,"about_ca_system_score_gemma":0.0003742358,"threshold_uncertainty_score":0.7046936},"labels":[],"label_agreement":null},{"id":"W2039195319","doi":"10.1016/s0377-2217(98)00237-9","title":"A note on the location of an obnoxious facility on a network","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":32,"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":"Facility location problem; Computer science; 1-center problem; Location model; Mathematical optimization; Operations research; Mathematics","score_opus":0.10167913269627703,"score_gpt":0.3308248429206352,"score_spread":0.22914571022435815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039195319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8724616,0.000055766155,0.0007034436,0.0141829075,0.00022633327,0.00034598866,0.0000034816703,0.00001376353,0.11200667],"genre_scores_gemma":[0.9965269,0.000028716122,0.00007670026,0.0014466126,0.0008050785,0.0000026179086,0.000013334428,0.000008647892,0.0010913727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976953,0.00041407297,0.0004611361,0.0001469943,0.0010918219,0.00019065426],"domain_scores_gemma":[0.9983249,0.00008699216,0.00006478437,0.00027000406,0.0012296885,0.000023663297],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0071911495,0.0000889463,0.00010457698,0.00017304369,0.00032714228,0.00017557836,0.00045041114,0.0000134185,0.0025087446],"category_scores_gemma":[0.0006472319,0.000059470174,0.000052503703,0.0006703119,0.00009509885,0.000447771,0.000046442794,0.00033154475,0.0015133686],"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.0011940276,0.0007795167,0.0002467183,0.00009014669,0.00005859615,0.000037381695,0.00034589318,0.72729105,0.00026080685,0.0641953,0.07125233,0.13424824],"study_design_scores_gemma":[0.0020930436,0.0014088607,0.17853701,0.00044804916,0.000036606845,0.000012014991,0.0006156473,0.13283204,0.00022443384,0.002045566,0.6812886,0.00045811533],"about_ca_topic_score_codex":0.000061315804,"about_ca_topic_score_gemma":0.000046508656,"teacher_disagreement_score":0.61003625,"about_ca_system_score_codex":0.00004026955,"about_ca_system_score_gemma":0.000081875296,"threshold_uncertainty_score":0.99926406},"labels":[],"label_agreement":null},{"id":"W2039567769","doi":"10.1016/s0377-2217(01)00271-5","title":"The development and evaluation of a fuzzy logic expert system for renal transplantation assignment: Is this a useful tool?","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Organ Donation and Transplantation","field":"Medicine","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":"St. Joseph’s Healthcare Hamilton; St. Joseph's Hospital; McMaster University","funders":"National Research Council Canada","keywords":"United Network for Organ Sharing; Computer science; Fuzzy logic; Vagueness; Expert system; Artificial intelligence; Sorting; Operations research; Data mining; Transplantation; Mathematics; Algorithm; Medicine","score_opus":0.22216575566809754,"score_gpt":0.39219526481203987,"score_spread":0.17002950914394233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039567769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9601042,0.0023691761,0.009536363,0.0083646765,0.00018723142,0.0012962496,0.000028227194,0.000011642064,0.018102216],"genre_scores_gemma":[0.99553055,0.00044646894,0.0031757802,0.00008935192,0.0001516228,0.000013151946,0.000018038074,0.000013188403,0.00056183524],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969296,0.00064862706,0.000568863,0.000114946975,0.0016068538,0.00013111917],"domain_scores_gemma":[0.9975316,0.00031408045,0.00013634242,0.00007659293,0.0018692636,0.000072102426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007399153,0.00007358296,0.00012155907,0.000182788,0.0003172422,0.000071031274,0.00008817336,0.000021461678,0.00018127939],"category_scores_gemma":[0.00022218474,0.00004777494,0.00004738138,0.00014247275,0.00006941546,0.00015395449,0.000007028812,0.0001626121,0.000017474418],"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.010343805,0.0016965312,0.006007716,0.0021285273,0.0019239353,0.0003891247,0.12323392,0.0011722944,0.23334354,0.03844225,0.030562634,0.55075574],"study_design_scores_gemma":[0.06646509,0.008816384,0.34733868,0.0051470203,0.001155519,0.0048387847,0.010371676,0.06290783,0.3763111,0.00072429277,0.1148907,0.0010329409],"about_ca_topic_score_codex":7.0073656e-7,"about_ca_topic_score_gemma":0.0000013741144,"teacher_disagreement_score":0.5497228,"about_ca_system_score_codex":0.00013718627,"about_ca_system_score_gemma":0.00021993411,"threshold_uncertainty_score":0.25644135},"labels":[],"label_agreement":null},{"id":"W2040075495","doi":"10.1016/j.ejor.2013.08.002","title":"The bi-objective Pollution-Routing Problem","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":442,"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":"University of Southampton","keywords":"Weighting; Mathematical optimization; Computer science; Normalization (sociology); Vehicle routing problem; Set (abstract data type); Routing (electronic design automation); Minification; Constraint (computer-aided design); Extension (predicate logic); Mathematics","score_opus":0.05395561392824383,"score_gpt":0.3389584209137308,"score_spread":0.28500280698548697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040075495","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.3036712,0.0022062089,0.3461417,0.015259035,0.0014723833,0.0014764286,0.000010816222,0.00023945808,0.32952276],"genre_scores_gemma":[0.9555721,0.00010779996,0.04275326,0.000046366575,0.00051184144,0.000004924719,0.0000011003401,0.000041326435,0.00096124853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683136,0.0015064236,0.00049275643,0.00008983911,0.0007661122,0.0003134969],"domain_scores_gemma":[0.99757236,0.0005902085,0.00006715637,0.0001386328,0.0015079952,0.00012366078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008382143,0.00008873171,0.00009838456,0.00017006084,0.00060114375,0.0004516336,0.00039356863,0.000018500039,0.00016855437],"category_scores_gemma":[0.0012870118,0.000060470033,0.000055910237,0.0004279917,0.00011139398,0.00038004096,0.00007039839,0.0007000036,0.00029550013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027860826,0.00004409257,0.0006712497,0.000019615969,0.00016527053,0.000041053412,0.0018188871,0.85236216,0.025773298,0.01098735,0.04111831,0.06697085],"study_design_scores_gemma":[0.002657887,0.0009014104,0.13043207,0.00043934435,0.000025807576,0.0006667879,0.0038593072,0.76901495,0.011142984,0.0030065116,0.07705238,0.0008005665],"about_ca_topic_score_codex":0.000004609836,"about_ca_topic_score_gemma":7.9786105e-7,"teacher_disagreement_score":0.6519009,"about_ca_system_score_codex":0.00013792448,"about_ca_system_score_gemma":0.00013185908,"threshold_uncertainty_score":0.46235725},"labels":[],"label_agreement":null},{"id":"W2040530174","doi":"10.1016/j.ejor.2009.04.026","title":"Combining integer programming and the randomization method to schedule employees","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":96,"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; Universiteit van Amsterdam","keywords":"Schedule; Computer science; Staffing; Mathematical optimization; Integer programming; Integer (computer science); Generator (circuit theory); Iterated function; Tardiness; Interval (graph theory); Operations research; Algorithm; Job shop scheduling; Mathematics; Power (physics)","score_opus":0.05009622218239913,"score_gpt":0.3665433050220586,"score_spread":0.3164470828396595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040530174","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.18334307,0.0003886748,0.75625324,0.039838806,0.00014335338,0.0006482201,4.49407e-7,0.000036975653,0.019347195],"genre_scores_gemma":[0.9721367,0.000007116917,0.025471942,0.0012898318,0.00080113445,0.0000022293323,0.0000022608938,0.000014820125,0.00027397007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793375,0.00079240365,0.00038435662,0.00012742676,0.00058496493,0.00017708998],"domain_scores_gemma":[0.9980742,0.00050256914,0.00014497284,0.00010520637,0.0011471781,0.00002587782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018151658,0.00008186573,0.00018259365,0.00040187882,0.00046718988,0.00069789635,0.00029409386,0.000009952258,0.00006074362],"category_scores_gemma":[0.0031446973,0.00005078293,0.00006659513,0.0006098079,0.000096307886,0.00082417316,0.00011681762,0.00035269375,0.000052430158],"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.0053169266,0.00019646212,0.0005306857,0.000026016138,0.00016975563,0.000107619126,0.0012370376,0.061929706,0.0040169973,0.75888103,0.0027620646,0.16482572],"study_design_scores_gemma":[0.07489537,0.0018003092,0.016005643,0.0018148856,0.00064697606,0.00038603117,0.010084099,0.20672064,0.0023689112,0.17267297,0.51078105,0.0018231358],"about_ca_topic_score_codex":0.0000035653463,"about_ca_topic_score_gemma":0.0000012014964,"teacher_disagreement_score":0.7887936,"about_ca_system_score_codex":0.000022644954,"about_ca_system_score_gemma":0.000028840741,"threshold_uncertainty_score":0.67298305},"labels":[],"label_agreement":null},{"id":"W2040572217","doi":"10.1016/j.ejor.2004.01.032","title":"The shortest path problem with forbidden paths","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":80,"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":"Shortest path problem; Constrained Shortest Path First; K shortest path routing; Longest path problem; Shortest Path Faster Algorithm; Euclidean shortest path; Yen's algorithm; Distance; Widest path problem; Mathematics; Matching (statistics); Path (computing); Mathematical optimization; Algorithm; Computer science; Graph; Combinatorics; Dijkstra's algorithm","score_opus":0.057786834878117005,"score_gpt":0.31843098541114934,"score_spread":0.26064415053303236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040572217","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.02032617,0.00067852373,0.8315092,0.042692654,0.0003837827,0.00061917095,0.000008332395,0.000045384564,0.103736795],"genre_scores_gemma":[0.89449775,0.00020727246,0.102075994,0.00022245583,0.000566065,0.0000040881823,0.0000048328584,0.000020529242,0.002401012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976346,0.00036596632,0.00027468335,0.00015047663,0.0013082355,0.0002660455],"domain_scores_gemma":[0.9986665,0.00013146107,0.00007543842,0.00028885223,0.00072724296,0.00011048838],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0057249614,0.000072940165,0.00007072679,0.00011419544,0.00056239456,0.0012184443,0.0016755451,0.000006043254,0.000010662775],"category_scores_gemma":[0.00012255613,0.00003860334,0.000033568554,0.00038454338,0.000110265384,0.0010525243,0.00035368823,0.00037027785,0.000113348404],"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.00009520059,0.0003191175,0.0005423587,0.000010406011,0.00013845072,0.002886893,0.0012429763,0.0061299354,0.00066337915,0.7609162,0.033230122,0.19382499],"study_design_scores_gemma":[0.0068751443,0.008963788,0.052030634,0.00069352554,0.00002444507,0.0016678148,0.0011338864,0.012338923,0.0012414933,0.027396575,0.88677555,0.0008582106],"about_ca_topic_score_codex":0.0000030974627,"about_ca_topic_score_gemma":0.0000041878748,"teacher_disagreement_score":0.87417156,"about_ca_system_score_codex":0.00005005144,"about_ca_system_score_gemma":0.00031211152,"threshold_uncertainty_score":0.9998184},"labels":[],"label_agreement":null},{"id":"W2041733553","doi":"10.1016/j.ejor.2007.01.052","title":"A generic approach to measuring the machine flexibility of manufacturing systems","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":93,"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; Toronto Metropolitan University","funders":"","keywords":"Flexibility (engineering); Computer science; Measure (data warehouse); Machine tool; Industrial engineering; Data mining; Engineering; Mathematics","score_opus":0.3746706158938157,"score_gpt":0.45380924083370744,"score_spread":0.07913862493989177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041733553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82878536,0.00062287116,0.13849576,0.0008106469,0.00020651327,0.00019968748,0.0000041813487,0.000004279001,0.030870691],"genre_scores_gemma":[0.994842,0.000005605233,0.0037887054,0.00006311164,0.00035060348,6.577418e-7,6.4109923e-7,0.000013568992,0.0009351391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.98651075,0.0040787784,0.0017470766,0.00034264146,0.0069363667,0.0003843618],"domain_scores_gemma":[0.99345964,0.0023098064,0.00036006325,0.0006203528,0.0030235,0.00022664467],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.1420687,0.0001089068,0.00029239108,0.00095944747,0.00048103137,0.0004728739,0.0020220773,0.000018651872,0.000061628896],"category_scores_gemma":[0.009539901,0.00005857163,0.00017193642,0.001518366,0.00022221288,0.00024991872,0.00032353264,0.0006065991,0.00011109693],"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.00039561215,0.0004557424,0.0026137019,0.000023090517,0.000115046816,0.00012321425,0.0029316773,0.9382681,0.022103174,0.0034914946,0.0040584225,0.025420712],"study_design_scores_gemma":[0.0027464563,0.0022393237,0.5823932,0.00046206906,0.00009974325,0.0016619253,0.013864336,0.19049366,0.09424568,0.0017033084,0.109052755,0.0010375425],"about_ca_topic_score_codex":0.00002994298,"about_ca_topic_score_gemma":0.000006470631,"teacher_disagreement_score":0.7477745,"about_ca_system_score_codex":0.00012622827,"about_ca_system_score_gemma":0.00023253457,"threshold_uncertainty_score":0.99880314},"labels":[],"label_agreement":null},{"id":"W2041825410","doi":"10.1016/j.ejor.2014.02.056","title":"Operational transportation planning of freight forwarding companies in horizontal coalitions","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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; Computer Research Institute of Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Profitability index; Order (exchange); Computer science; Operational planning; Process (computing); Business; Traffic management; Routing (electronic design automation); Transportation planning; Operations research; Transport engineering; Industrial organization; Marketing; Finance; Computer network; Engineering","score_opus":0.08032545244081116,"score_gpt":0.3588431303229579,"score_spread":0.27851767788214676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041825410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63039565,0.00016255744,0.36030793,0.00023471264,0.00017361616,0.000108604465,0.000022077114,0.000018768786,0.008576079],"genre_scores_gemma":[0.9331874,0.000020777225,0.06643512,0.0000146830525,0.00024301127,0.000001866909,0.000036010137,0.00002814916,0.00003293897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730664,0.0009407747,0.0007383857,0.000099592646,0.0007218745,0.00019270535],"domain_scores_gemma":[0.99864656,0.00046124976,0.00007571908,0.00008912831,0.0006427443,0.000084595886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005463177,0.00009344408,0.00019882688,0.00048032936,0.00013186979,0.00007479126,0.00021838112,0.000026189691,0.000108047694],"category_scores_gemma":[0.00046482327,0.000091349895,0.00006060843,0.00037136694,0.000070954105,0.00039069136,0.000012506635,0.0004585914,0.000008882158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029079452,0.000034530767,0.0059116553,0.00002940078,0.000026778407,0.00001896738,0.0011958296,0.97070456,0.011054067,0.009709166,0.0005229287,0.00076304947],"study_design_scores_gemma":[0.00271486,0.00060199667,0.24676907,0.0006401727,0.000018553983,0.00008343773,0.0012241796,0.73145133,0.0100227,0.00059921265,0.0055237412,0.0003507305],"about_ca_topic_score_codex":0.000004043173,"about_ca_topic_score_gemma":0.00000461003,"teacher_disagreement_score":0.3027918,"about_ca_system_score_codex":0.00008306656,"about_ca_system_score_gemma":0.00009095879,"threshold_uncertainty_score":0.37251407},"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":"W2042557607","doi":"10.1016/j.ejor.2008.08.015","title":"Location with acceleration–deceleration distance","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Acceleration; Heuristic; Point (geometry); Mathematical optimization; Travel time; Mathematics; Zero (linguistics); Computer science; Algorithm; Geometry; Physics","score_opus":0.1353533354940566,"score_gpt":0.38323387947957693,"score_spread":0.24788054398552034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042557607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46660647,0.0005236702,0.4222776,0.011487915,0.00036439628,0.00046705749,0.000006288267,0.0000576102,0.09820901],"genre_scores_gemma":[0.9894214,0.00022297914,0.0069127646,0.00009637794,0.0005273589,0.0000022802858,0.00002427886,0.000013237984,0.0027793078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99687165,0.0010739067,0.00035404714,0.00011777604,0.0014026801,0.00017993049],"domain_scores_gemma":[0.99615675,0.00016913089,0.00013539151,0.000081240105,0.0033280742,0.00012942917],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003577602,0.000063616746,0.00008662249,0.00020895226,0.0014189713,0.0001642506,0.00020733406,0.000021053937,0.00018278831],"category_scores_gemma":[0.00047600025,0.00005286849,0.000024855251,0.0006366614,0.00028592814,0.0008651714,0.000005268822,0.00028037754,0.000056200803],"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.0015395887,0.00082216103,0.07199116,0.000056169494,0.00015651455,0.0010693143,0.12378077,0.4753983,0.0021374659,0.24609658,0.065850124,0.01110185],"study_design_scores_gemma":[0.003978183,0.0017673003,0.5257623,0.00047427806,0.000030484147,0.0002682946,0.009316118,0.003919577,0.0011318249,0.0003780258,0.45232,0.00065360114],"about_ca_topic_score_codex":0.000029295667,"about_ca_topic_score_gemma":0.00010029846,"teacher_disagreement_score":0.5228149,"about_ca_system_score_codex":0.00010183246,"about_ca_system_score_gemma":0.0009928438,"threshold_uncertainty_score":0.999881},"labels":[],"label_agreement":null},{"id":"W2043936000","doi":"10.1016/j.ejor.2008.03.005","title":"Dynamic pricing of multiple home delivery options","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":93,"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":"Markov decision process; Order (exchange); Revenue management; Dynamic pricing; Business; Time horizon; Stochastic game; Computer science; Process (computing); Holding cost; Microeconomics; Markov process; Operations research; Marketing; Economics; Operations management; Revenue; Finance","score_opus":0.09327877656522843,"score_gpt":0.3029304513230756,"score_spread":0.20965167475784718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043936000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661376,0.000303896,0.0012330277,0.0011496634,0.00027162235,0.00014816105,0.0000020676612,0.00001058454,0.030743392],"genre_scores_gemma":[0.9965265,0.0001704585,0.0012134862,0.00023650024,0.0005663789,0.0000012619846,0.00000986673,0.000021173071,0.0012543872],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99812007,0.00015044757,0.0004750338,0.00011810995,0.000931342,0.0002050046],"domain_scores_gemma":[0.9983123,0.000112321904,0.00017598037,0.00013723731,0.0012374513,0.00002472339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029289334,0.00008321505,0.00013946235,0.0007051629,0.0003472622,0.0001048641,0.00039160383,0.0000118615,0.0005060707],"category_scores_gemma":[0.00042860155,0.00007116208,0.00009371951,0.00045444132,0.00014523379,0.0008898519,0.00021133383,0.00027872145,0.00026852346],"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.0018263855,0.0039736643,0.17936327,0.0011101254,0.0010678311,0.005071231,0.0031645573,0.1076694,0.11289453,0.122346915,0.42928246,0.032229625],"study_design_scores_gemma":[0.0049379626,0.0004486255,0.5508191,0.000490996,0.000052936262,0.00019010014,0.0022834775,0.085041575,0.00043696057,0.00076212944,0.3539655,0.0005706722],"about_ca_topic_score_codex":0.0000234708,"about_ca_topic_score_gemma":0.000004993664,"teacher_disagreement_score":0.37145582,"about_ca_system_score_codex":0.000060301718,"about_ca_system_score_gemma":0.000077716926,"threshold_uncertainty_score":0.5541119},"labels":[],"label_agreement":null},{"id":"W2044423959","doi":"10.1016/j.ejor.2007.10.009","title":"Performance evaluation: An integrated method using data envelopment analysis and fuzzy preference relations","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":138,"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":"Pairwise comparison; Data envelopment analysis; Preference; Preference relation; Ranking (information retrieval); Relation (database); Fuzzy logic; Preference learning; Rank (graph theory); Context (archaeology); Computer science; Mathematics; Decision maker; Data mining; Mathematical optimization; Operations research; Artificial intelligence; Statistics","score_opus":0.8028777714725182,"score_gpt":0.6170902791930558,"score_spread":0.18578749227946234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044423959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66906285,0.00010924622,0.32745785,0.00028309258,0.00012302338,0.00014823223,0.00001765953,0.000003930494,0.0027941368],"genre_scores_gemma":[0.70165306,0.000020456124,0.29779288,0.000038666243,0.00014905087,4.407911e-7,0.00002766283,0.000010238646,0.00030751867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98336494,0.006830701,0.0018107457,0.0006103255,0.0070507163,0.0003325568],"domain_scores_gemma":[0.98749673,0.0032503982,0.0004316781,0.00091466506,0.0076255775,0.00028096978],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.18242276,0.00013520244,0.00029904186,0.002406017,0.0007274479,0.0011043958,0.0018514347,0.00003511835,0.0015022957],"category_scores_gemma":[0.017940566,0.00009550138,0.00005950738,0.0033351954,0.00015494198,0.0022259064,0.0006658748,0.00063951855,0.00008715755],"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.00034223805,0.00015833767,0.033081125,0.0000021470332,0.00024623587,0.00009377829,0.0021249892,0.04343881,0.008815152,0.0004853013,0.0015573704,0.9096545],"study_design_scores_gemma":[0.00046057813,0.00013646571,0.4067813,0.000032077372,0.00006413768,0.00009688012,0.00090541405,0.5845974,0.00021255662,0.00026428822,0.006338442,0.00011046741],"about_ca_topic_score_codex":0.000012465207,"about_ca_topic_score_gemma":0.000042653894,"teacher_disagreement_score":0.90954405,"about_ca_system_score_codex":0.00018180939,"about_ca_system_score_gemma":0.00087210035,"threshold_uncertainty_score":0.9999325},"labels":[],"label_agreement":null},{"id":"W2045524187","doi":"10.1016/j.ejor.2004.01.037","title":"Loop based facility planning and material handling","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":96,"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":"University of Houston","keywords":"Material handling; Sizing; Material flow; Computer science; Facility management; Material requirements planning; Facility location problem; Materials management; Manufacturing engineering; Operations research; Operations management; Engineering; Production (economics); Business","score_opus":0.06950537514229406,"score_gpt":0.3218496818095045,"score_spread":0.25234430666721047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045524187","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.40241337,0.00018030351,0.5951829,0.00016077062,0.0001839786,0.000053836,0.000014749378,0.000023944069,0.0017861789],"genre_scores_gemma":[0.9808983,0.000022631697,0.018847983,0.000013568829,0.0001687719,3.9215954e-7,0.000010387715,0.000010721597,0.000027208294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992092,0.00010747627,0.00020333144,0.00006565426,0.00028496026,0.00012934137],"domain_scores_gemma":[0.999582,0.00006778682,0.000020767166,0.000053541913,0.00020024704,0.00007567422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012006734,0.000057734687,0.00007366499,0.00011772863,0.0001334926,0.000115119816,0.00008273442,0.0000126463465,0.00003690394],"category_scores_gemma":[0.00023482814,0.000050717343,0.000015140463,0.000056254637,0.000052872376,0.00014584963,0.00001951547,0.00025514374,0.000010070048],"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.00003400914,0.000008309845,0.000043913198,0.000014934119,0.0000065838994,0.00006616295,0.00008600139,0.99518365,0.003463457,0.00014538904,0.00007672166,0.0008708898],"study_design_scores_gemma":[0.01717614,0.0031708211,0.056986332,0.0016958434,0.00006386007,0.00089109846,0.0011928794,0.43654734,0.44312754,0.0061024292,0.031141708,0.0019040237],"about_ca_topic_score_codex":8.964915e-7,"about_ca_topic_score_gemma":1.8275098e-7,"teacher_disagreement_score":0.57848495,"about_ca_system_score_codex":0.000054878266,"about_ca_system_score_gemma":0.000049294176,"threshold_uncertainty_score":0.20681931},"labels":[],"label_agreement":null},{"id":"W2045599420","doi":"10.1016/j.ejor.2005.12.026","title":"A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Satellite Communication Systems","field":"Engineering","cited_by":244,"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":"","keywords":"Tabu search; Earth observation satellite; Computer science; Satellite; Bounding overwatch; Scheduling (production processes); Heuristic; Column generation; Earth observation; Orbit determination; Operations research; Time horizon; Real-time computing; Remote sensing; Mathematical optimization; Algorithm; Aerospace engineering; Artificial intelligence; Geology; Mathematics; Engineering","score_opus":0.1788735015970575,"score_gpt":0.3574932122903898,"score_spread":0.17861971069333227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045599420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43748727,0.116122976,0.43549266,0.0015865772,0.00085402286,0.0037289849,0.00011671825,0.00012613276,0.004484647],"genre_scores_gemma":[0.7992621,0.0069051543,0.18976483,0.000022291915,0.00019738323,0.000021632073,0.000025682239,0.000068354086,0.0037325877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977456,0.0005366491,0.00079044845,0.0001327944,0.00056780217,0.00022672069],"domain_scores_gemma":[0.99766314,0.00080903503,0.00012305143,0.00032187,0.0010137619,0.00006914382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041132425,0.00013194761,0.00018037192,0.00020062285,0.0002074588,0.00016265627,0.00048474266,0.000025622901,0.00001888053],"category_scores_gemma":[0.0001814787,0.000098520315,0.00007435705,0.00028975238,0.0001303766,0.00022679457,0.00009343715,0.0003036067,0.00002634616],"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.0010423841,0.0026109575,0.0934073,0.004524156,0.0027348006,0.0003895248,0.010054266,0.30936053,0.25494254,0.061326385,0.004940999,0.25466615],"study_design_scores_gemma":[0.0037465335,0.00019407042,0.63106596,0.0004943209,0.00004286143,0.0000626945,0.0010721078,0.14366211,0.005488436,0.000040732833,0.21384287,0.00028731584],"about_ca_topic_score_codex":0.000010511454,"about_ca_topic_score_gemma":0.000013747633,"teacher_disagreement_score":0.53765863,"about_ca_system_score_codex":0.00003829611,"about_ca_system_score_gemma":0.000031010804,"threshold_uncertainty_score":0.4017542},"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":"W2046989465","doi":"10.1016/j.ejor.2012.03.038","title":"Allocation of information granularity in optimization and decision-making models: Towards building the foundations of Granular Computing","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":184,"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":"Granularity; Granular computing; Computer science; Rough set; Set (abstract data type); Theoretical computer science; Suite; Information processing; Data mining; Mathematical optimization; Mathematics","score_opus":0.0866097097615769,"score_gpt":0.36433847419847165,"score_spread":0.27772876443689476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046989465","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.10642105,0.00021041116,0.8914877,0.0004619408,0.00008118472,0.00010900822,0.0000011961964,0.0000024780325,0.0012250099],"genre_scores_gemma":[0.7176905,0.0000727014,0.28215876,0.00002903865,0.000043728578,3.8600305e-7,0.0000017845763,0.0000027788847,3.1466018e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769515,0.00059986365,0.00066087255,0.0000699768,0.00081658416,0.00015755164],"domain_scores_gemma":[0.9980835,0.00044904137,0.00025720816,0.00015258952,0.0010088249,0.000048884234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009403766,0.00006005048,0.00012283905,0.00038157313,0.00021324639,0.00017159095,0.0004850242,0.00001817582,0.0000048876623],"category_scores_gemma":[0.00073650724,0.00004239794,0.000035889567,0.0005683462,0.00009013753,0.0023985477,0.00021534499,0.00025262288,9.2947874e-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.000024910363,0.000071514354,0.0010978378,0.000017684773,0.000009891409,0.0000016356983,0.003738055,0.7623231,0.0001700335,0.09498985,0.000045506516,0.13751],"study_design_scores_gemma":[0.00031279106,0.0000945513,0.028899077,0.00012992033,0.00000306168,0.00003467171,0.00019722029,0.96523,0.00007177455,0.004877047,0.00009950635,0.00005040119],"about_ca_topic_score_codex":0.000012831689,"about_ca_topic_score_gemma":0.0000010603655,"teacher_disagreement_score":0.6112695,"about_ca_system_score_codex":0.000045675948,"about_ca_system_score_gemma":0.00014234886,"threshold_uncertainty_score":0.32591763},"labels":[],"label_agreement":null},{"id":"W2047497563","doi":"10.1016/j.ejor.2014.12.033","title":"Inventory sharing and coordination among n independent retailers","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":34,"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":"Business; Profitability index; Incentive; Profit sharing; Information sharing; Industrial organization; Order (exchange); Profit (economics); Microeconomics; Information asymmetry; Computer science; Economics; Finance","score_opus":0.15159092249880507,"score_gpt":0.3192967254753582,"score_spread":0.16770580297655313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047497563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86305463,0.00018827883,0.00022743779,0.0025834371,0.00036826154,0.00015476627,2.8022512e-7,0.000012667549,0.13341026],"genre_scores_gemma":[0.9949415,0.000011566361,0.00007877831,0.00036577575,0.0014132082,0.0000019407905,0.0000067466826,0.000020758922,0.0031597645],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99799347,0.00014861867,0.00035891106,0.000161749,0.001138711,0.00019852273],"domain_scores_gemma":[0.9985216,0.000023938313,0.00015185124,0.00011486161,0.0011253398,0.000062379775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009105677,0.00008706975,0.00010792705,0.00061206915,0.00019404126,0.00066185114,0.00034394098,0.000016173472,0.00021184298],"category_scores_gemma":[0.00072348583,0.000075802265,0.000038688217,0.00028988023,0.00011991308,0.0016467418,0.00037995825,0.00033958073,0.00016449585],"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.0002937302,0.00025867549,0.5106984,0.00013958722,0.00015200675,0.00066504325,0.001043776,0.0023512936,0.0006781483,0.11191298,0.3640948,0.0077115716],"study_design_scores_gemma":[0.004763023,0.00033089527,0.26799,0.0003370099,0.000046845336,0.000050236897,0.006740521,0.05124958,0.00006078949,0.0056968853,0.66224307,0.00049114996],"about_ca_topic_score_codex":0.000034024953,"about_ca_topic_score_gemma":0.000010222599,"teacher_disagreement_score":0.2981483,"about_ca_system_score_codex":0.00010477761,"about_ca_system_score_gemma":0.00005631851,"threshold_uncertainty_score":0.6382246},"labels":[],"label_agreement":null},{"id":"W2047651186","doi":"10.1016/s0377-2217(01)00102-3","title":"Fuzzy versions of the covering circle problem","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Cover (algebra); Fuzzy logic; Mathematics; Set (abstract data type); Center (category theory); Mathematical optimization; Plane (geometry); Fuzzy set; Fuzzy number; Polynomial; Computer science; Geometry; Artificial intelligence","score_opus":0.45987380977741976,"score_gpt":0.4781812495719007,"score_spread":0.018307439794480962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047651186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8516669,0.00039240846,0.0019785843,0.007036006,0.0006953926,0.00025712853,0.00001930806,0.0000055862197,0.13794866],"genre_scores_gemma":[0.9921857,0.000027232776,0.00412745,0.00010871224,0.00024308129,5.2577684e-7,1.9610108e-7,0.0000147020055,0.0032924092],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9899954,0.0029592826,0.0011681261,0.0002209342,0.0054026395,0.00025359096],"domain_scores_gemma":[0.99345636,0.0024102803,0.00035291532,0.00050928805,0.0031160943,0.00015503116],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02022338,0.0000809128,0.00020028443,0.0005027962,0.0004913365,0.0004458251,0.0020331955,0.000019802605,0.0023848212],"category_scores_gemma":[0.013637156,0.000049684426,0.0001809417,0.0011602569,0.00023686934,0.0005328934,0.0005992722,0.0005872882,0.00074685283],"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.00036744814,0.00085126376,0.014875686,0.000024489198,0.00013130077,0.00058540824,0.008744483,0.03576171,0.20173688,0.014332003,0.461197,0.26139235],"study_design_scores_gemma":[0.005148401,0.0013639004,0.44984806,0.00093891344,0.000025191124,0.0010200833,0.004339804,0.01887262,0.008994574,0.018180046,0.4906955,0.0005729084],"about_ca_topic_score_codex":0.0000024499918,"about_ca_topic_score_gemma":0.0000016684895,"teacher_disagreement_score":0.43497238,"about_ca_system_score_codex":0.00006603096,"about_ca_system_score_gemma":0.00014921825,"threshold_uncertainty_score":0.9985271},"labels":[],"label_agreement":null},{"id":"W2047709292","doi":"10.1016/j.ejor.2006.03.033","title":"Challenges of Continuous Optimization in Theory and Applications","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Mathematical optimization; Benchmark (surveying); Heuristic; Combinatorial optimization; Computer science; Mathematics; Regular polygon; Clique problem; Quadratic equation; Clique; Graph; Combinatorics","score_opus":0.0484715312907173,"score_gpt":0.34615689763662827,"score_spread":0.297685366345911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047709292","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.0018577548,0.0016804447,0.9742981,0.0007509947,0.0000152319,0.00009945828,4.9677493e-7,0.000011502096,0.021285996],"genre_scores_gemma":[0.8456599,0.00050359534,0.15359457,0.0000189218,0.0000964885,0.0000024097044,0.0000011269163,0.0000061176092,0.000116886775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789536,0.0011504546,0.000372428,0.00011746157,0.0003606126,0.00010369753],"domain_scores_gemma":[0.99869555,0.00033698982,0.00011547782,0.00013013468,0.00068737345,0.000034454362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006259612,0.000048008107,0.000102595935,0.00035083422,0.000074355594,0.0000759873,0.0003915035,0.00001394743,0.0000051434577],"category_scores_gemma":[0.00018277203,0.00004187574,0.000020274021,0.000272338,0.00007748756,0.00024267513,0.00010696533,0.00017334323,0.0000019426009],"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.00002165497,0.00012645753,0.0002682039,0.000010827175,0.000005804349,0.00001774616,0.00024297765,0.21813028,0.00035985702,0.75225824,0.0003828606,0.028175086],"study_design_scores_gemma":[0.0056744386,0.0030005977,0.1406069,0.0008721325,0.000015992046,0.0008257693,0.0008527473,0.68699193,0.008093385,0.13041341,0.021689788,0.00096293347],"about_ca_topic_score_codex":0.0000025148445,"about_ca_topic_score_gemma":9.2759103e-7,"teacher_disagreement_score":0.84380215,"about_ca_system_score_codex":0.000019130846,"about_ca_system_score_gemma":0.00008203415,"threshold_uncertainty_score":0.2169469},"labels":[],"label_agreement":null},{"id":"W2049300338","doi":"10.1016/j.ejor.2011.05.043","title":"Cost evaluation in M/G/1 queue with T-policy revisited, technical note","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University","keywords":"Convexity; Queue; Function (biology); Computer science; Operations research; Operations management; Service (business); Mathematical economics; Economics; Mathematics; Business; Computer network; Marketing","score_opus":0.1643303888274868,"score_gpt":0.4035531105405183,"score_spread":0.2392227217130315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049300338","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.33008865,0.0004414115,0.05100836,0.007769752,0.00016925872,0.0015084618,0.0000049264995,0.00006485883,0.60894436],"genre_scores_gemma":[0.9941666,0.000017998002,0.0040721316,0.00039554373,0.0011241966,0.000005493248,0.000008846046,0.000028000291,0.0001812016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9972871,0.0005765977,0.00048453038,0.00017722714,0.0012309564,0.00024362314],"domain_scores_gemma":[0.99720645,0.0001289849,0.00020598338,0.00019464426,0.0022354147,0.000028499206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014861757,0.00010161296,0.0001667363,0.0012067477,0.00017536063,0.00018093418,0.00042252813,0.000020166257,0.00064771314],"category_scores_gemma":[0.0033288638,0.00007640206,0.000053183605,0.0014392992,0.00013914857,0.0013224845,0.00013068428,0.00058025843,0.00029302592],"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.0057616136,0.0015104022,0.021516366,0.00018564124,0.00020017596,0.002855403,0.0014594614,0.060743697,0.01852859,0.70096314,0.009582036,0.17669347],"study_design_scores_gemma":[0.019103907,0.0017062719,0.5119144,0.0037550218,0.00049165357,0.00094292813,0.0024798617,0.12689531,0.0016836532,0.089944124,0.23870319,0.0023796842],"about_ca_topic_score_codex":0.00004393246,"about_ca_topic_score_gemma":0.000046717312,"teacher_disagreement_score":0.66407794,"about_ca_system_score_codex":0.00018716177,"about_ca_system_score_gemma":0.00023885825,"threshold_uncertainty_score":0.7092005},"labels":[],"label_agreement":null},{"id":"W2049343437","doi":"10.1016/j.ejor.2010.02.011","title":"Constrained group balancing: Why does it work","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Assembly Line Balancing Optimization","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 Toronto","funders":"","keywords":"Group (periodic table); Work (physics); Computer science; Group work; Mathematics; Operations research; Engineering; Mathematics education","score_opus":0.027312467042595445,"score_gpt":0.29640953296158956,"score_spread":0.2690970659189941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049343437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7839374,0.00025701566,0.10544771,0.0068179094,0.003116805,0.0003841199,0.000016675864,0.00015509788,0.09986728],"genre_scores_gemma":[0.9783861,0.00003933734,0.01972272,0.00012179175,0.0012584911,0.0000013759702,0.000011016465,0.000049198992,0.00040996456],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980285,0.00031703318,0.00047567405,0.00011444562,0.0007863741,0.0002779559],"domain_scores_gemma":[0.99853987,0.00027655417,0.00005563955,0.00016600262,0.0007819352,0.00018003106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039881826,0.000113803464,0.00014932692,0.00026625596,0.00016528313,0.00021076112,0.0003519814,0.000034839908,0.00057378825],"category_scores_gemma":[0.00093328516,0.0000856333,0.00005836157,0.00035418227,0.00010128732,0.0003303339,0.000048301878,0.0010896383,0.00010636791],"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.0002463096,0.00026724738,0.012264844,0.00010799512,0.00028180113,0.0009826509,0.0022804975,0.23816705,0.440816,0.015003481,0.2776037,0.01197845],"study_design_scores_gemma":[0.005267472,0.0009797266,0.07977844,0.0007140243,0.000046662528,0.0010316428,0.0011888527,0.13621075,0.013557933,0.0005526807,0.7593926,0.0012791901],"about_ca_topic_score_codex":0.0000011401662,"about_ca_topic_score_gemma":0.000012468657,"teacher_disagreement_score":0.48178893,"about_ca_system_score_codex":0.00005013785,"about_ca_system_score_gemma":0.00010106208,"threshold_uncertainty_score":0.6282579},"labels":[],"label_agreement":null},{"id":"W2049395631","doi":"10.1016/j.ejor.2003.12.019","title":"Hedge fund performance appraisal using data envelopment analysis","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":131,"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":"Data envelopment analysis; Hedge fund; Alternative beta; Alternative investment; Business; Fund of funds; Performance fee; Selection (genetic algorithm); Open-end fund; Returns-based style analysis; Institutional investor; Actuarial science; Computer science; Econometrics; Finance; Economics; Statistics; Mathematics; Corporate governance","score_opus":0.6017834948954146,"score_gpt":0.5525389889096208,"score_spread":0.049244505985793774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049395631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9136455,0.00028123878,0.0781399,0.0017812243,0.0002512661,0.0000696435,0.00001594491,0.000005509189,0.005809767],"genre_scores_gemma":[0.9780022,0.000049415554,0.020943662,0.00008658514,0.0004134539,2.3147489e-7,0.000016399254,0.00001546312,0.00047262036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883101,0.0022751861,0.0015316505,0.000546171,0.0069142655,0.0004226025],"domain_scores_gemma":[0.9935743,0.0013860976,0.00040582457,0.0011135977,0.0032444734,0.00027566802],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.05662457,0.00014225919,0.0003797044,0.0023172637,0.0008020097,0.0010611424,0.0036034663,0.000025048452,0.00058857416],"category_scores_gemma":[0.008900647,0.00010034247,0.00018877836,0.005275056,0.00033359585,0.0013628528,0.00087292324,0.00066657545,0.00058005314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015082739,0.000425229,0.018816987,0.0000048683705,0.0007076596,0.00044480423,0.0014558015,0.9475079,0.0059057977,0.0013708618,0.00374904,0.019460186],"study_design_scores_gemma":[0.0031092842,0.001060715,0.4202126,0.00018652367,0.0005396041,0.0006599728,0.0022915257,0.43346426,0.0025961173,0.000667079,0.13436358,0.00084872585],"about_ca_topic_score_codex":0.000014535381,"about_ca_topic_score_gemma":0.000013663016,"teacher_disagreement_score":0.5140437,"about_ca_system_score_codex":0.00020306339,"about_ca_system_score_gemma":0.001307991,"threshold_uncertainty_score":0.99997586},"labels":[],"label_agreement":null},{"id":"W2049458779","doi":"10.1016/j.ejor.2011.03.027","title":"The impact of sharing customer returns information in a supply chain with and without a buyback policy","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":52,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Supply chain; Business; Information sharing; Incentive; Profit (economics); Microeconomics; Profit sharing; Industrial organization; Marketing; Economics; Finance; Computer science","score_opus":0.07817604280596131,"score_gpt":0.326459209409938,"score_spread":0.2482831666039767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049458779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91396534,0.000053098203,0.000060745024,0.00089617836,0.000031258805,0.00020973379,0.000001194808,0.0000037087798,0.08477873],"genre_scores_gemma":[0.9990963,0.000052572086,0.00012137829,0.00012222417,0.00031238838,0.0000024039234,0.0000031316647,0.000011466927,0.00027818594],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99867797,0.00009947117,0.00039402567,0.00007444999,0.0005439976,0.00021010221],"domain_scores_gemma":[0.9990109,0.000034774068,0.00019021967,0.000119109485,0.00062033784,0.000024664263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043886155,0.00008294718,0.00010961774,0.0007193383,0.00016154752,0.00031766723,0.0003171983,0.000010402434,0.00013969142],"category_scores_gemma":[0.00033394212,0.00004702111,0.000039883493,0.00049372535,0.00013305397,0.0016322718,0.00019145769,0.00026416295,0.000043688993],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029943262,0.00032179127,0.821862,0.00020365912,0.00029797165,0.00009682378,0.008152394,0.0025136478,0.0006361725,0.13226804,0.014694763,0.015958417],"study_design_scores_gemma":[0.002431553,0.00040085948,0.96442294,0.0002940279,0.000011088296,0.000037851947,0.002751903,0.009286094,0.00004715884,0.0008556099,0.019288376,0.00017255526],"about_ca_topic_score_codex":0.00049053825,"about_ca_topic_score_gemma":0.000039828945,"teacher_disagreement_score":0.14256093,"about_ca_system_score_codex":0.000066243505,"about_ca_system_score_gemma":0.000105113235,"threshold_uncertainty_score":0.30632725},"labels":[],"label_agreement":null},{"id":"W2049792611","doi":"10.1016/j.ejor.2013.02.021","title":"Economic and economic statistical designs of the synthetic <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" overflow=\"scroll\"><mml:mrow><mml:mover accent=\"true\"><mml:mrow><mml:mi>X</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy=\"true\">¯</mml:mo></mml:mrow></mml:mover></mml:mrow></mml:math> chart using loss functions","year":2013,"lang":"lv","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","cited_by":50,"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; Universiti Sains Malaysia","keywords":"EWMA chart; Control chart; Statistics; Algorithm; Mathematics; Taguchi methods; Function (biology); Chart; Computer science; Process (computing)","score_opus":0.06859289612185412,"score_gpt":0.3280842810376489,"score_spread":0.2594913849157948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049792611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7421428,0.0007912652,0.006626682,0.0010058784,0.002470354,0.00006179465,0.00053859694,0.00004325841,0.24631934],"genre_scores_gemma":[0.99021167,0.00074429286,0.005054857,0.0005522266,0.0022477738,0.00016567028,0.00013326136,0.00043851332,0.0004517109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9890992,0.0013730638,0.002517147,0.0014929839,0.0035904062,0.0019271682],"domain_scores_gemma":[0.98946136,0.0053671557,0.0018700269,0.0014928724,0.00052923674,0.0012793706],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.005700786,0.0006283649,0.00036509297,0.00063718326,0.0021183107,0.0028480983,0.002532406,0.0007433389,0.4453158],"category_scores_gemma":[0.006323228,0.0009621546,0.0009495068,0.00070226105,0.0026981249,0.0026975947,0.002174578,0.0021938821,0.0039164145],"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.0018379317,0.00030982387,0.000097255106,0.00046838596,0.0011598371,0.0011269833,0.001477314,0.021637345,0.0041330787,0.7936992,0.16790073,0.00615214],"study_design_scores_gemma":[0.0026080199,0.0025712217,0.0020309624,0.0013991441,0.0007464974,0.0025132706,0.0037248246,0.33152735,0.6477811,0.0007479569,0.0029324905,0.0014171792],"about_ca_topic_score_codex":0.0007026675,"about_ca_topic_score_gemma":0.00028804943,"teacher_disagreement_score":0.7929512,"about_ca_system_score_codex":0.000057609246,"about_ca_system_score_gemma":0.0031425569,"threshold_uncertainty_score":0.9992829},"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":"W2050615162","doi":"10.1016/j.ejor.2010.07.012","title":"A note on competitive supply chains with generalised supply costs","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 British Columbia","funders":"","keywords":"Diseconomies of scale; Outsourcing; Supply chain; Economies of scale; Industrial organization; Competition (biology); Microeconomics; Scale (ratio); Business; Point (geometry); Competitive advantage; Economics; Supply chain management; Marketing; Mathematics","score_opus":0.04958543114186326,"score_gpt":0.30592430149536737,"score_spread":0.2563388703535041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050615162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6336105,0.000027188573,0.00035926074,0.017224768,0.0007693754,0.000454518,0.000011656674,0.00002723643,0.34751552],"genre_scores_gemma":[0.9891644,0.00001445775,0.00082611124,0.00327117,0.00399696,0.000005610942,0.000039078437,0.00004845483,0.0026337334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99726146,0.00021664445,0.00039364022,0.00023755836,0.0015168554,0.00037381207],"domain_scores_gemma":[0.9978842,0.00014427857,0.00017198073,0.00023580028,0.001498498,0.00006524678],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0040691574,0.00017187258,0.00018290561,0.0007052845,0.0004139263,0.000729171,0.0005957665,0.000023279248,0.0021771956],"category_scores_gemma":[0.0003997428,0.00012542025,0.00008241935,0.00044659752,0.00020903564,0.00081718893,0.00017314966,0.0009268403,0.0008608024],"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.001513207,0.0007929301,0.011285726,0.000068266556,0.00016123624,0.0018375926,0.00041110915,0.0013028652,0.023139378,0.7852577,0.16378409,0.0104459375],"study_design_scores_gemma":[0.003583157,0.000625377,0.077770196,0.0002455294,0.000023895836,0.00005707899,0.0005955863,0.0035093378,0.0007937147,0.00017858681,0.9122568,0.00036075313],"about_ca_topic_score_codex":0.000038963808,"about_ca_topic_score_gemma":0.000099319164,"teacher_disagreement_score":0.78507906,"about_ca_system_score_codex":0.00008172755,"about_ca_system_score_gemma":0.00012571979,"threshold_uncertainty_score":0.99991715},"labels":[],"label_agreement":null},{"id":"W2051204535","doi":"10.1016/j.ejor.2005.10.012","title":"Multi-objectives Tabu Search based algorithm for progressive resource allocation","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","cited_by":67,"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; Tabu search; Resource allocation; Scheduling (production processes); Operations research; Schedule; Task (project management); Mathematical optimization; Set (abstract data type); Algorithm; Mathematics","score_opus":0.2167307243235256,"score_gpt":0.46419412353311057,"score_spread":0.24746339920958496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051204535","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.078077674,0.0010121774,0.90319824,0.0061871824,0.00020319746,0.0012855625,0.000072860734,0.000027116532,0.009935957],"genre_scores_gemma":[0.5505399,0.0000046467044,0.4451248,0.00013411744,0.001427243,0.00001925812,0.000028335786,0.000052216204,0.0026694532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98769933,0.0048760623,0.0014056596,0.0005239033,0.004916381,0.0005786583],"domain_scores_gemma":[0.98633546,0.004900929,0.000396148,0.0003914137,0.007739631,0.00023639483],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.043376192,0.00018676146,0.0003123457,0.0013564938,0.0008058445,0.0012286454,0.0014292307,0.00005270435,0.00028778092],"category_scores_gemma":[0.009041531,0.00013709751,0.0002380221,0.0012867193,0.00049814733,0.00058384455,0.00016310689,0.0008332156,0.0001493984],"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.0010657118,0.0012476239,0.002481753,0.000029834604,0.00013576697,0.0006803904,0.0025959816,0.062485535,0.05165124,0.0027720167,0.032798436,0.84205574],"study_design_scores_gemma":[0.007890338,0.0025728538,0.03577762,0.00030283173,0.00002474041,0.00045112532,0.0065483777,0.7957063,0.03020231,0.0011537576,0.118735544,0.0006342245],"about_ca_topic_score_codex":0.0000096660615,"about_ca_topic_score_gemma":0.000003139859,"teacher_disagreement_score":0.8414215,"about_ca_system_score_codex":0.00016668461,"about_ca_system_score_gemma":0.0012004296,"threshold_uncertainty_score":0.9998082},"labels":[],"label_agreement":null},{"id":"W2051607417","doi":"10.1016/j.ejor.2014.09.018","title":"Parametric replenishment policies for inventory systems with lost sales and fixed order cost","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of British Columbia; University of Calgary","funders":"","keywords":"Inventory control; Parametric statistics; Heuristic; Mathematical optimization; Computer science; Set (abstract data type); Order (exchange); Operations research; Service level; Holding cost; Economics; Mathematics; Statistics","score_opus":0.09801676200632305,"score_gpt":0.3181632214711098,"score_spread":0.22014645946478678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051607417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511797,0.0015824646,0.01643987,0.01633467,0.0012551369,0.0028159362,0.0000139756185,0.000052583928,0.11032566],"genre_scores_gemma":[0.99429876,0.000044813787,0.0005335039,0.00079846836,0.001959067,0.000014433012,0.000019824067,0.000034151708,0.002296969],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811876,0.00021285133,0.00039135385,0.00017816812,0.00082741515,0.00027147774],"domain_scores_gemma":[0.99802744,0.00021196083,0.00018858837,0.00015228512,0.0013752788,0.000044424018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005780081,0.000117708165,0.00017354051,0.0006912885,0.0003162577,0.0008454921,0.00027788998,0.000014514625,0.00007963324],"category_scores_gemma":[0.0009801132,0.000085242886,0.00003933597,0.00047507868,0.00014428311,0.0006031218,0.00014438543,0.00019427543,0.00010381955],"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.0013165355,0.0006253512,0.04885172,0.0012307196,0.00045114657,0.00012855502,0.00050411304,0.013816115,0.00078863866,0.33606225,0.58555424,0.010670594],"study_design_scores_gemma":[0.0018660012,0.0003895345,0.012227483,0.00019196009,0.000028107084,0.000022219703,0.00092901994,0.017914094,0.000021548633,0.00015636448,0.96607494,0.00017870443],"about_ca_topic_score_codex":0.000033637432,"about_ca_topic_score_gemma":0.000007531056,"teacher_disagreement_score":0.3805207,"about_ca_system_score_codex":0.00005884877,"about_ca_system_score_gemma":0.00005658902,"threshold_uncertainty_score":0.81531},"labels":[],"label_agreement":null},{"id":"W2051767752","doi":"10.1016/j.ejor.2004.04.051","title":"Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Schedule; Computer science; Flow network; Operations research; Assignment problem; Mathematical optimization; Integer (computer science); Revenue; Integer programming; Branch and bound; Mathematics; Economics; Algorithm; Finance","score_opus":0.03351273727517879,"score_gpt":0.3092219762336378,"score_spread":0.275709238958459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051767752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6910428,0.0025776303,0.24338678,0.0072541074,0.00017507498,0.00072773045,0.00006226692,0.00014902146,0.054624636],"genre_scores_gemma":[0.9035721,0.00009548565,0.094332926,0.000052952804,0.0005178607,0.0000012343721,0.0000069815032,0.000049379996,0.0013710881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975825,0.0008526367,0.00039079384,0.00013024661,0.0007992437,0.00024460792],"domain_scores_gemma":[0.99909526,0.0002035006,0.000060529208,0.000114191986,0.00034587528,0.00018066897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053592087,0.00011752411,0.00017264155,0.00020635349,0.00018512442,0.0002004676,0.00016915139,0.000021477408,0.0006703857],"category_scores_gemma":[0.00027007508,0.00009790162,0.000027439866,0.00015172869,0.00015856771,0.0002753042,0.000051307165,0.00050546805,0.00019449346],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008438884,0.000054377433,0.00055070064,0.00002447607,0.00011767273,0.00023937416,0.00083540066,0.9220105,0.042035274,0.00016060927,0.0037221208,0.030165102],"study_design_scores_gemma":[0.0076115592,0.0022510558,0.016372867,0.0013719092,0.000089189394,0.0049458193,0.00054963614,0.8938156,0.02265769,0.00005811552,0.04913928,0.0011372989],"about_ca_topic_score_codex":3.7243205e-7,"about_ca_topic_score_gemma":3.692526e-7,"teacher_disagreement_score":0.21252933,"about_ca_system_score_codex":0.0001362092,"about_ca_system_score_gemma":0.00012723736,"threshold_uncertainty_score":0.73402536},"labels":[],"label_agreement":null},{"id":"W2051997331","doi":"10.1016/j.ejor.2006.09.021","title":"A multicriteria facility location model for municipal solid waste management in North Greece","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":205,"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":"Plan (archaeology); Lexicographical order; Minimax; Linear programming; Operations research; Municipal solid waste; Facility location problem; Location model; Integer programming; Regional planning; Business; Computer science; Environmental planning; Urban planning; Geography; Engineering; Mathematics; Mathematical optimization; Civil engineering; Waste management","score_opus":0.12820172737574284,"score_gpt":0.34907023946817684,"score_spread":0.220868512092434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051997331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94849503,0.00008778525,0.03952845,0.00211784,0.0002451157,0.00077293994,0.000014879416,0.000016478083,0.008721459],"genre_scores_gemma":[0.9953343,0.000018929728,0.0018914178,0.0002511253,0.0004803571,0.00002193569,0.00009762114,0.000015283164,0.0018890039],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977231,0.00013659916,0.00078575173,0.00023245829,0.00079362903,0.00032846522],"domain_scores_gemma":[0.9982666,0.000031276617,0.000081744634,0.00021657847,0.0013806835,0.000023112212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004587493,0.00012912414,0.00015544973,0.0006541616,0.0002458228,0.0002799667,0.0004517658,0.000016003516,0.000097957585],"category_scores_gemma":[0.00023443875,0.00012044847,0.0000752901,0.0006371775,0.00006850804,0.00090907613,0.00019491112,0.00022027286,0.00018384027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033584988,0.00044280128,0.0014264546,0.00029643343,0.000036052334,0.000034829885,0.00022864573,0.96679354,0.00028575028,0.013985841,0.011520018,0.004613775],"study_design_scores_gemma":[0.0013755678,0.000032305707,0.028350366,0.000040841514,0.000013027677,0.0000013952401,0.0004444473,0.95537674,0.000016667904,0.0004790833,0.013724755,0.00014477769],"about_ca_topic_score_codex":0.0002576523,"about_ca_topic_score_gemma":0.0018736746,"teacher_disagreement_score":0.046839274,"about_ca_system_score_codex":0.00011057298,"about_ca_system_score_gemma":0.000046017176,"threshold_uncertainty_score":0.4911746},"labels":[],"label_agreement":null},{"id":"W2052753388","doi":"10.1016/j.ejor.2013.07.026","title":"A spatial optimisation model for multi-period landscape level fuel management to mitigate wildfire impacts","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":76,"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":"Fogarty International Center; Bushfire Cooperative Research Centre","keywords":"Integer programming; Scheduling (production processes); Computer science; Environmental resource management; Operations research; Range (aeronautics); Environmental science; Operations management; Engineering","score_opus":0.1958944974755469,"score_gpt":0.35155665989116297,"score_spread":0.15566216241561606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052753388","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.3853392,0.0001485302,0.5500279,0.03551561,0.0007795212,0.003316662,0.000028244369,0.000059653656,0.024784686],"genre_scores_gemma":[0.9752427,0.000024972858,0.018447725,0.0012876148,0.0007189493,0.000052865566,0.00004680556,0.000034026554,0.004144347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977699,0.00008854805,0.0006015656,0.00024410931,0.0009204058,0.00037546424],"domain_scores_gemma":[0.99825996,0.000019718173,0.00008188414,0.00019975445,0.001353741,0.00008494826],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030766258,0.0001550431,0.00015803339,0.0006300633,0.000346621,0.0007313723,0.00046790118,0.000020034873,0.0006271921],"category_scores_gemma":[0.00039810437,0.00013320682,0.00010552972,0.00035769047,0.000040804527,0.0012476433,0.00022210767,0.00019314891,0.0011584025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006883078,0.0010000902,0.0018078588,0.0008230896,0.0003688717,0.00007102482,0.002205496,0.56958926,0.0032024414,0.017816165,0.3181538,0.084273614],"study_design_scores_gemma":[0.0015835299,0.00008348798,0.04619003,0.00008257704,0.000019637562,0.0000036221475,0.0006299395,0.93260676,0.000016442369,0.00021823104,0.018367253,0.00019846624],"about_ca_topic_score_codex":0.00014845132,"about_ca_topic_score_gemma":0.00012276974,"teacher_disagreement_score":0.5899035,"about_ca_system_score_codex":0.000073202944,"about_ca_system_score_gemma":0.00006567612,"threshold_uncertainty_score":0.9996193},"labels":[],"label_agreement":null},{"id":"W2052997156","doi":"10.1016/j.ejor.2014.04.013","title":"The static bicycle relocation problem with demand intervals","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":150,"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":"University of Southampton","keywords":"Mathematical optimization; Bounding overwatch; Relocation; Vehicle routing problem; Travelling salesman problem; Context (archaeology); Branch and cut; Computer science; Integer programming; Routing (electronic design automation); Traveling purchaser problem; Facility location problem; Node (physics); Mathematics; 2-opt; Engineering","score_opus":0.04100789879994455,"score_gpt":0.31392349708450284,"score_spread":0.2729155982845583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052997156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7375651,0.00016813255,0.22077574,0.0069735055,0.00016667694,0.00032582527,0.0000054066145,0.000044859335,0.03397474],"genre_scores_gemma":[0.9959885,0.000041951494,0.0034391873,0.00005180898,0.000106185296,0.0000042722727,0.0000060983466,0.0000174923,0.00034450355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986015,0.00035410802,0.00036507405,0.00005690072,0.0004892091,0.00013318389],"domain_scores_gemma":[0.99861395,0.00026224938,0.000040622006,0.00010915154,0.00091397687,0.00006006953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272654,0.00005404184,0.00006287363,0.00011647978,0.00023929858,0.00014610111,0.00018549032,0.000007861818,0.000036881356],"category_scores_gemma":[0.00018374083,0.000033150613,0.000020347914,0.0002709999,0.00008856048,0.00019518091,0.0000068914546,0.00029872838,0.000046760826],"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.00032427473,0.00023214052,0.0048771603,0.00018290733,0.00039237246,0.000051515755,0.0059539857,0.69571465,0.02691796,0.09595084,0.07099526,0.098406926],"study_design_scores_gemma":[0.0033847974,0.002225035,0.4565387,0.0005438881,0.000041660205,0.00019819391,0.0017838991,0.07260064,0.0065008285,0.0026196898,0.45308208,0.00048059132],"about_ca_topic_score_codex":0.0000010985408,"about_ca_topic_score_gemma":0.000013191433,"teacher_disagreement_score":0.623114,"about_ca_system_score_codex":0.000036348043,"about_ca_system_score_gemma":0.00007389922,"threshold_uncertainty_score":0.18405154},"labels":[],"label_agreement":null},{"id":"W2054000503","doi":"10.1016/j.ejor.2010.10.007","title":"Real-time fuzzy regression analysis: A convex hull approach","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Fuzzy Systems and Optimization","field":"Mathematics","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":"University of Alberta","funders":"","keywords":"Convex hull; Hull; Fuzzy logic; Output-sensitive algorithm; Regression analysis; Computer science; Convex combination; Regression; Linear regression; Mathematics; Mathematical optimization; Fuzzy number; Algorithm; Regular polygon; Convex optimization; Fuzzy set; Artificial intelligence; Statistics; Machine learning; Engineering; Geometry","score_opus":0.09571325426548198,"score_gpt":0.38315631475799916,"score_spread":0.28744306049251717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054000503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234959,0.00007825334,0.005829792,0.0010335777,0.00030140107,0.00039571276,0.00002052814,0.00003452522,0.26881033],"genre_scores_gemma":[0.8970119,0.000053659147,0.093648106,0.000023312208,0.0011041152,0.0000035973721,0.00003219196,0.000051313396,0.0080718035],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99558014,0.0016062343,0.0007830449,0.00021291652,0.001546176,0.00027147288],"domain_scores_gemma":[0.9965524,0.00049450155,0.00029759144,0.00034638433,0.0020807418,0.0002283522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011245197,0.00013490961,0.00034778143,0.00068864744,0.00031698187,0.000259643,0.0004781351,0.00005472771,0.0006475664],"category_scores_gemma":[0.0019146621,0.00009345972,0.00019362241,0.0008578884,0.00011939191,0.0003142279,0.000102365375,0.0008944368,0.00012242165],"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.0011288121,0.0025571429,0.005234071,0.00036353417,0.0029768588,0.0011025115,0.008150177,0.0109815765,0.39418843,0.2413445,0.32776958,0.0042027947],"study_design_scores_gemma":[0.03160186,0.009733595,0.161707,0.0029557657,0.0038136474,0.0060222596,0.011412606,0.5410866,0.022999933,0.063525684,0.13882501,0.006316019],"about_ca_topic_score_codex":0.000007622945,"about_ca_topic_score_gemma":0.0000027804124,"teacher_disagreement_score":0.53010505,"about_ca_system_score_codex":0.000045587192,"about_ca_system_score_gemma":0.0002499397,"threshold_uncertainty_score":0.7090398},"labels":[],"label_agreement":null},{"id":"W2054425848","doi":"10.1016/j.ejor.2007.04.021","title":"Analysis of a newsvendor which has errors in inventory data records","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"York University","funders":"","keywords":"Newsvendor model; Barcode; Computer science; Cycle count; Supply chain; Operations research; Inventory control; Inventory theory; Identification (biology); Process (computing); Economic shortage; Operations management; Economics; Business; Mathematics","score_opus":0.2357561439077662,"score_gpt":0.3744353710653593,"score_spread":0.1386792271575931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054425848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8794025,0.0002323417,0.0013405482,0.003968716,0.00040790148,0.00024633136,0.000008630465,0.000009788721,0.11438323],"genre_scores_gemma":[0.9973646,0.000030304802,0.00037394857,0.00039173238,0.00093846954,6.7704923e-7,0.00007121653,0.00002104396,0.00080805266],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9969125,0.00026454267,0.0009294876,0.00023973198,0.0013328054,0.00032097765],"domain_scores_gemma":[0.99796945,0.0001450091,0.00030747493,0.00037073737,0.0011677532,0.000039592214],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.019675918,0.0001082059,0.0002704154,0.0032226834,0.00014479825,0.0002565699,0.0011680345,0.000020246986,0.0011498191],"category_scores_gemma":[0.0015689001,0.00009501696,0.00009625129,0.0033535138,0.00012101371,0.0012857782,0.00061224925,0.00042649818,0.000090750866],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012541683,0.0016414963,0.72595304,0.00029190537,0.0020730172,0.0014350195,0.0011008916,0.014922773,0.0027246608,0.020179654,0.1983181,0.03010527],"study_design_scores_gemma":[0.0015121758,0.00012010481,0.5072512,0.00015214944,0.0001930689,0.0000050867634,0.0018288321,0.035018798,0.00004773723,0.00016757537,0.45348537,0.00021790397],"about_ca_topic_score_codex":0.00024328717,"about_ca_topic_score_gemma":0.0014318626,"teacher_disagreement_score":0.25516728,"about_ca_system_score_codex":0.000087284585,"about_ca_system_score_gemma":0.00014017733,"threshold_uncertainty_score":0.99976325},"labels":[],"label_agreement":null},{"id":"W2055388930","doi":"10.1016/j.ejor.2004.07.076","title":"A smoothing heuristic for a bilevel pricing problem","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Variational Analysis","field":"Computer Science","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":"Polytechnique Montréal; Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Mathematical optimization; Bilevel optimization; Smoothing; Computer science; Heuristic; Point (geometry); Class (philosophy); Set (abstract data type); Scale (ratio); Algorithm; Mathematics; Optimization problem; Artificial intelligence","score_opus":0.10081635464685444,"score_gpt":0.3689721968451751,"score_spread":0.26815584219832067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055388930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009302385,0.00009036635,0.9791988,0.014682652,0.000056061686,0.00012783252,0.0000023576433,0.00001118829,0.0049004667],"genre_scores_gemma":[0.4765346,0.000017361313,0.52136457,0.00037538155,0.0005025078,0.0000030526105,0.0000028642162,0.000010032708,0.0011896405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976926,0.0005275437,0.00050417625,0.000167908,0.0008985965,0.00020920034],"domain_scores_gemma":[0.9974472,0.00045608322,0.00014416542,0.00013935505,0.0016861268,0.00012708512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062330794,0.00007189397,0.00011856626,0.0004356606,0.00037553554,0.00047977973,0.0007085747,0.000012418469,0.000075641256],"category_scores_gemma":[0.0008058017,0.000057205583,0.00009311961,0.00054042676,0.000029420737,0.00079210236,0.00012348156,0.0002512416,0.000055034907],"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.00008431906,0.00041287302,0.00023067708,0.000036011563,0.00017470322,0.0000589607,0.0036972067,0.37599254,0.0031990241,0.5133144,0.024179906,0.078619316],"study_design_scores_gemma":[0.0012075666,0.00039752788,0.0022158718,0.0000800608,0.000011098578,0.00011153845,0.000058459504,0.9098478,0.00033062816,0.0024958279,0.08307256,0.00017105513],"about_ca_topic_score_codex":0.000001525241,"about_ca_topic_score_gemma":0.0000011025704,"teacher_disagreement_score":0.53385526,"about_ca_system_score_codex":0.00009447014,"about_ca_system_score_gemma":0.00036849335,"threshold_uncertainty_score":0.46265268},"labels":[],"label_agreement":null},{"id":"W2055985121","doi":"10.1016/s0377-2217(99)00313-6","title":"An exponential queue with competition for service","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Service (business); Computer science; Competition (biology); Queue; Operations research; Epoch (astronomy); Queueing theory; Float (project management); Operations management; Computer network; Mathematics; Business; Economics; Marketing; Management","score_opus":0.05478906906631784,"score_gpt":0.33206831378748947,"score_spread":0.2772792447211716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055985121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95607877,0.000028655659,0.015525015,0.0035648698,0.00006164092,0.00019050823,0.000004343834,0.00002048215,0.02452573],"genre_scores_gemma":[0.99300116,0.000006027986,0.0030823066,0.00088143913,0.0024263142,0.0000031194343,0.000042735195,0.000030782354,0.000526123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854296,0.00022100132,0.00028732125,0.00014293371,0.0006152767,0.00019048396],"domain_scores_gemma":[0.9977951,0.0000976543,0.000105128885,0.00013970208,0.0018344821,0.000027934439],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036727535,0.00008286735,0.000118467324,0.00028032565,0.00040358616,0.00040308427,0.00035247504,0.00001102251,0.0017384399],"category_scores_gemma":[0.00012237225,0.00006449022,0.000048647533,0.0004296864,0.000061373044,0.0017731023,0.000024845049,0.0002248149,0.00029646727],"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.009482756,0.0011963713,0.0008616904,0.00022361372,0.00035620006,0.0005343922,0.0006266606,0.41936374,0.047611825,0.45903164,0.0053373356,0.055373784],"study_design_scores_gemma":[0.010475249,0.0018952867,0.017149962,0.00074984616,0.00026348405,0.00028251956,0.0022492043,0.10668359,0.0016092055,0.031750582,0.82572025,0.001170795],"about_ca_topic_score_codex":0.000013521066,"about_ca_topic_score_gemma":0.00002178013,"teacher_disagreement_score":0.82038295,"about_ca_system_score_codex":0.000029200648,"about_ca_system_score_gemma":0.00005419796,"threshold_uncertainty_score":0.9991741},"labels":[],"label_agreement":null},{"id":"W2056981121","doi":"10.1016/j.ejor.2010.09.038","title":"Continuous time mean variance asset allocation: A time-consistent strategy","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":126,"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":"Variance (accounting); Investment (military); Asset (computer security); Constraint (computer-aided design); Asset allocation; Investment strategy; Mathematical optimization; Computer science; Scheme (mathematics); Economics; Econometrics; Mathematics; Microeconomics; Finance","score_opus":0.06603854491675439,"score_gpt":0.2997477944726221,"score_spread":0.23370924955586775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056981121","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.17652668,0.0020750095,0.37252578,0.018021861,0.0009908009,0.0010187781,0.00047654405,0.000056848246,0.4283077],"genre_scores_gemma":[0.9871787,0.00002852137,0.007114002,0.0001686379,0.00091341574,0.000009855828,0.000026107144,0.000030409392,0.0045303814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983825,0.00006297049,0.0008194444,0.0002489408,0.00022038026,0.00026574804],"domain_scores_gemma":[0.9980732,0.00018801133,0.00032093478,0.00025654354,0.0009904641,0.00017081745],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0047622244,0.00010864191,0.0002598816,0.00024828588,0.00030056224,0.0002744361,0.00054347556,0.00004085205,0.0013402199],"category_scores_gemma":[0.00087313965,0.0001093911,0.00009058439,0.00033868264,0.00015122842,0.00028275314,0.00007490569,0.0006834697,0.0048742937],"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.000050177812,0.00023049011,0.00020714581,0.00000890666,0.000055680757,0.00004366469,0.00022628023,0.00016974128,0.008508479,0.9795795,0.007560461,0.0033594621],"study_design_scores_gemma":[0.0045933314,0.0024683606,0.11375621,0.00015967159,0.000033965087,0.00114001,0.0002462034,0.019280678,0.0009538421,0.24946886,0.6066198,0.0012790601],"about_ca_topic_score_codex":0.000014929604,"about_ca_topic_score_gemma":0.0000041635712,"teacher_disagreement_score":0.810652,"about_ca_system_score_codex":0.00004858745,"about_ca_system_score_gemma":0.00025584438,"threshold_uncertainty_score":0.9995727},"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":"W2061091622","doi":"10.1016/j.ejor.2009.07.007","title":"Heuristics for the Stochastic Eulerian Tour Problem","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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é de Montréal","funders":"","keywords":"Heuristics; Eulerian path; Concatenation (mathematics); Mathematical optimization; Heuristic; Computer science; Grid; Probabilistic logic; Mathematics; Enhanced Data Rates for GSM Evolution; Algorithm; Combinatorics; Artificial intelligence; Applied mathematics; Lagrangian","score_opus":0.08847412350347472,"score_gpt":0.3704656567390892,"score_spread":0.2819915332356145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061091622","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.0028125115,0.00034600467,0.98866564,0.002574684,0.00020246542,0.00025376154,0.000006814874,0.000024429253,0.005113699],"genre_scores_gemma":[0.8327964,0.00004076276,0.16543435,0.00011658283,0.0010143154,0.0000026275918,0.0000030923657,0.00003668655,0.0005551722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829566,0.00045461007,0.00039384988,0.00007649896,0.000548692,0.00023066657],"domain_scores_gemma":[0.9980135,0.00075752096,0.000046763136,0.00012793404,0.0009577574,0.00009655298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064512338,0.00008029381,0.00010441664,0.00013496622,0.00027641392,0.000198629,0.0003743991,0.000015600252,0.00007229518],"category_scores_gemma":[0.0013788972,0.000056791057,0.00005703067,0.0002290362,0.00004484162,0.00012721615,0.000022128559,0.00043499033,0.00002312437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031540727,0.000019471756,0.0000048282177,0.000007848531,0.00002502041,0.000012554269,0.00023251718,0.9635044,0.0022679206,0.0026899953,0.014786878,0.016417032],"study_design_scores_gemma":[0.0012640574,0.0008207581,0.00581123,0.00011527133,0.00002291998,0.00017894313,0.00018336393,0.9570192,0.00052827137,0.0010945174,0.03275062,0.00021082597],"about_ca_topic_score_codex":1.8718453e-7,"about_ca_topic_score_gemma":2.2450061e-7,"teacher_disagreement_score":0.8299839,"about_ca_system_score_codex":0.0000608346,"about_ca_system_score_gemma":0.000100438156,"threshold_uncertainty_score":0.23158722},"labels":[],"label_agreement":null},{"id":"W2062432234","doi":"10.1016/j.ejor.2009.03.030","title":"Joint pricing and procurement of substitutable products with random demands – A technical note","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":26,"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","keywords":"Joint (building); Procurement; Industrial organization; Computer science; Microeconomics; Business; Operations research; Operations management; Economics; Marketing; Mathematics; Engineering","score_opus":0.06973488776054429,"score_gpt":0.2978123789540686,"score_spread":0.2280774911935243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062432234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7665584,0.0014612222,0.017871749,0.026976975,0.0004096342,0.0022009,0.0000018908905,0.000054355074,0.18446489],"genre_scores_gemma":[0.9956691,0.000035541503,0.0026624084,0.0003610326,0.0009104665,0.000002143004,0.0000030591034,0.00001303471,0.0003432136],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980312,0.00010032903,0.00045694332,0.00016744935,0.0010271682,0.00021691818],"domain_scores_gemma":[0.99782866,0.000034241737,0.00019292257,0.00012823714,0.0017887101,0.000027245474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005696426,0.000102108905,0.00019600848,0.00043661776,0.00019364047,0.00024257015,0.000209304,0.000011902046,0.00006870402],"category_scores_gemma":[0.00084928924,0.00006946706,0.00003413128,0.0004509552,0.0001104044,0.0007271475,0.00010268675,0.00027480474,0.000015093669],"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.011638744,0.004274262,0.016786274,0.0026322093,0.00050979294,0.0020777085,0.0016128646,0.01848967,0.3557738,0.30265382,0.20413457,0.07941628],"study_design_scores_gemma":[0.026932374,0.0045525,0.25746012,0.0033814008,0.0002713211,0.00030137616,0.0011587656,0.01146885,0.018129595,0.002745497,0.6723712,0.0012269813],"about_ca_topic_score_codex":0.000006055982,"about_ca_topic_score_gemma":0.0000024929532,"teacher_disagreement_score":0.46823665,"about_ca_system_score_codex":0.000043163305,"about_ca_system_score_gemma":0.00009593956,"threshold_uncertainty_score":0.28327844},"labels":[],"label_agreement":null},{"id":"W2062812576","doi":"10.1016/s0377-2217(03)00298-4","title":"Multicomponent efficiency measurement and core business identification in multiplant firms: A DEA model","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Core (optical fiber); Measure (data warehouse); Identification (biology); Set (abstract data type); Function (biology); Computer science; Operations research; Component (thermodynamics); Selection (genetic algorithm); Performance measurement; Industrial organization; Econometrics; Industrial engineering; Business; Economics; Mathematical optimization; Mathematics; Marketing; Data mining; Engineering; Artificial intelligence","score_opus":0.40952030295168457,"score_gpt":0.45101046397754113,"score_spread":0.041490161025856565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062812576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93203145,0.0006280477,0.06365062,0.0013554436,0.00013877226,0.00019623962,0.000004579553,0.0000041480066,0.00199071],"genre_scores_gemma":[0.9958953,0.00005445415,0.0036486294,0.000045891455,0.000045658373,0.000001950296,0.0000014014905,0.000013164811,0.0002935295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9888744,0.002767893,0.0015525199,0.00041778808,0.0060548848,0.00033256743],"domain_scores_gemma":[0.9924605,0.00090522715,0.0003239727,0.0003461063,0.0057892753,0.00017492409],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.062175963,0.00012702524,0.0002602879,0.0012869176,0.000375617,0.0005656361,0.0007403587,0.00002528089,0.000052509466],"category_scores_gemma":[0.02592037,0.00009018432,0.00007116515,0.0016499922,0.00022656439,0.000427792,0.000105774845,0.0004600042,0.00009788873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021400882,0.0011276379,0.011911649,0.00001578434,0.00003609404,0.00032013663,0.0029061097,0.8210248,0.14423671,0.0091793435,0.0019816535,0.0070460765],"study_design_scores_gemma":[0.0017271114,0.00014911812,0.18690854,0.00017194593,0.000013169133,0.00017818008,0.0008597963,0.8039432,0.0014965789,0.0015047466,0.002817499,0.0002301229],"about_ca_topic_score_codex":0.000011038993,"about_ca_topic_score_gemma":0.000025565982,"teacher_disagreement_score":0.1749969,"about_ca_system_score_codex":0.00020285463,"about_ca_system_score_gemma":0.00056900224,"threshold_uncertainty_score":0.9822847},"labels":[],"label_agreement":null},{"id":"W2065030872","doi":"10.1016/j.ejor.2009.01.005","title":"Dynamic mean–variance portfolio selection with borrowing constraint","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of Calgary","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Efficient frontier; Portfolio; Constraint (computer-aided design); Mathematical optimization; Selection (genetic algorithm); Mathematics; Dynamic programming; Piecewise linear function; Stochastic control; Piecewise; Variance (accounting); Quadratic equation; Bellman equation; Economics; Computer science; Optimal control; Finance","score_opus":0.05163873018543871,"score_gpt":0.3018043664760169,"score_spread":0.2501656362905782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065030872","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.030036116,0.00073883904,0.91695136,0.0041840062,0.000079919984,0.00015653104,0.000020741423,0.00001093113,0.04782158],"genre_scores_gemma":[0.98314714,0.00005707673,0.01604805,0.00018924543,0.0001735702,0.0000023929958,0.0000047467843,0.000013746191,0.00036400303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988189,0.000033962133,0.000553982,0.00019116481,0.00017557839,0.00022645693],"domain_scores_gemma":[0.99903107,0.000057270667,0.00022948981,0.00010652934,0.0004699608,0.000105660445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002528902,0.00008378422,0.00017890826,0.00029550234,0.00027959756,0.00014736361,0.00025562986,0.000020249898,0.00014866353],"category_scores_gemma":[0.00024969358,0.0000777466,0.000049896134,0.0005126452,0.00008420452,0.00029569314,0.00001814588,0.00040576162,0.00016700175],"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.000069933405,0.000107051965,0.00027717566,0.000004391061,0.000022730228,0.00004434111,0.00020186153,0.00086075277,0.00064623525,0.9927463,0.00049221545,0.0045270356],"study_design_scores_gemma":[0.0049113124,0.006225454,0.43585,0.0004029342,0.000026802434,0.002213073,0.00064786477,0.0240771,0.00039929806,0.42729652,0.096847035,0.0011025954],"about_ca_topic_score_codex":0.0000064103324,"about_ca_topic_score_gemma":0.0000028634627,"teacher_disagreement_score":0.95311105,"about_ca_system_score_codex":0.000113032904,"about_ca_system_score_gemma":0.00018625704,"threshold_uncertainty_score":0.31704143},"labels":[],"label_agreement":null},{"id":"W2065222472","doi":"10.1016/j.ejor.2014.07.011","title":"A multi-level Taguchi-factorial two-stage stochastic programming approach for characterization of parameter uncertainties and their interactions: An application to water resources management","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":91,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Taguchi methods; Mathematical optimization; Orthogonal array; Computer science; Fractional factorial design; Factorial; Design of experiments; Stochastic programming; Factorial experiment; Linear programming; Operations research; Data mining; Mathematics; Machine learning; Statistics","score_opus":0.06938168568994357,"score_gpt":0.3054444906908475,"score_spread":0.23606280500090393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065222472","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.29871136,0.0000059363088,0.7005185,0.000043312222,0.000069959286,0.0004978492,0.00000904026,0.000013463509,0.00013058243],"genre_scores_gemma":[0.94376826,0.0000056789486,0.055402335,0.000013772804,0.00030214846,0.000047734495,0.00013236117,0.000035275825,0.00029242848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867666,0.00027168513,0.00039924833,0.00015879725,0.00029971442,0.00019390475],"domain_scores_gemma":[0.99929035,0.00006980414,0.00006730673,0.00013154629,0.00035375275,0.00008723489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018637144,0.00011805343,0.00014510423,0.00040006405,0.00014378142,0.000233117,0.00021254744,0.000014389406,0.000007907902],"category_scores_gemma":[0.00006610402,0.00008447207,0.00003837916,0.00012755347,0.000042789037,0.00035998822,0.00007277186,0.0001466146,0.0000028059605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039277697,0.00017466117,0.00008571939,0.00024714498,0.00015236865,0.0000010607752,0.008251629,0.8170785,0.1082733,0.0005637596,0.000044336546,0.06473477],"study_design_scores_gemma":[0.0013238752,0.00043896356,0.0024843675,0.00007294492,0.000019719171,0.000004082391,0.0007298952,0.97353387,0.0034072578,0.000033613836,0.01777388,0.00017755633],"about_ca_topic_score_codex":0.0000025558286,"about_ca_topic_score_gemma":0.0000018514273,"teacher_disagreement_score":0.64511615,"about_ca_system_score_codex":0.00004039649,"about_ca_system_score_gemma":0.0000040401023,"threshold_uncertainty_score":0.3444671},"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":"W2066178808","doi":"10.1016/j.ejor.2007.11.027","title":"Partial integration of frequency allocation within antenna positioning in GSM mobile networks","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Wireless Communication Networks Research","field":"Computer Science","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":"HEC Montréal; Université du Québec à Montréal","funders":"","keywords":"GSM; Computer science; Cellular network; Telecommunications; Antenna (radio); Mobile telephony; Computer network; Mobile radio","score_opus":0.07206903383830825,"score_gpt":0.37327860711123667,"score_spread":0.3012095732729284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066178808","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.19101617,0.000572791,0.804371,0.0008250076,0.00016212679,0.00023306075,6.72032e-7,0.000010359074,0.0028088198],"genre_scores_gemma":[0.96500975,0.00016013526,0.03442364,0.000043161028,0.00025995178,0.0000050949307,0.000009387337,0.000015061932,0.00007383278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99431205,0.00241404,0.0012008705,0.00021356012,0.0014858235,0.00037366265],"domain_scores_gemma":[0.9957966,0.00075617427,0.0003119814,0.0004591954,0.0025196164,0.0001564204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023036,0.000104090024,0.00018319768,0.0008002037,0.00022402516,0.000244379,0.001569129,0.00004343908,0.000031835436],"category_scores_gemma":[0.00073912257,0.000092878356,0.00006488614,0.0014560167,0.0001826958,0.0010940444,0.00029888412,0.0011441234,0.00001740314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046822013,0.0010458676,0.006589969,0.000032551452,0.000087876004,0.0005179829,0.009176356,0.38437393,0.24569167,0.25351974,0.0010510194,0.09744482],"study_design_scores_gemma":[0.0014698092,0.0014396923,0.069552325,0.0006499522,0.0000037504599,0.00020269392,0.00086762325,0.9119806,0.012158217,0.0010987939,0.00031067702,0.00026582173],"about_ca_topic_score_codex":0.000029841327,"about_ca_topic_score_gemma":0.000046315283,"teacher_disagreement_score":0.77399355,"about_ca_system_score_codex":0.0002061258,"about_ca_system_score_gemma":0.00040235894,"threshold_uncertainty_score":0.79838634},"labels":[],"label_agreement":null},{"id":"W2066268728","doi":"10.1016/j.ejor.2008.03.033","title":"Ant colony optimization with a specialized pheromone trail for the car-sequencing problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Assembly Line Balancing Optimization","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Ant colony optimization algorithms; Metaheuristic; Computer science; Benchmark (surveying); Artificial intelligence; Mathematical optimization; Ant colony; Pheromone; Mathematics; Ecology; Biology; Geography","score_opus":0.07406110709103525,"score_gpt":0.29940270242077405,"score_spread":0.2253415953297388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066268728","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.061881512,0.00045431498,0.92866194,0.000992012,0.00017801362,0.0007584671,0.00001097299,0.00004659304,0.0070161824],"genre_scores_gemma":[0.8347336,0.00034104643,0.16329658,0.000036476038,0.0010022968,0.000016271613,0.00001668507,0.00007677838,0.0004802788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819225,0.00029741199,0.000420838,0.0001103751,0.0007336838,0.0002454142],"domain_scores_gemma":[0.99808484,0.0003482437,0.00008125018,0.00012503208,0.0012752911,0.00008532795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024080488,0.00011110054,0.00015895025,0.000144689,0.00046037635,0.00010822688,0.00026593768,0.000020860645,0.00005946212],"category_scores_gemma":[0.00032209154,0.0000735499,0.00004920568,0.00035134522,0.000098285695,0.00030729242,0.000021298218,0.0003430882,0.000008645088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013312369,0.000018617873,0.000055374592,0.000014394648,0.000056395616,0.000066404486,0.0008769206,0.9887217,0.0049275914,0.00019040922,0.0045940266,0.00034499835],"study_design_scores_gemma":[0.00224893,0.00081084634,0.0013969797,0.0001435266,0.000026604817,0.00069755514,0.00037650747,0.984238,0.0030107293,0.000014971588,0.0068271025,0.00020823661],"about_ca_topic_score_codex":0.000004091656,"about_ca_topic_score_gemma":0.000007212619,"teacher_disagreement_score":0.77285206,"about_ca_system_score_codex":0.0002258394,"about_ca_system_score_gemma":0.00037767363,"threshold_uncertainty_score":0.35408893},"labels":[],"label_agreement":null},{"id":"W2068400656","doi":"10.1016/s0377-2217(02)00243-6","title":"A multivariate statistical approach to reducing the number of variables in data envelopment analysis","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":294,"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 Military College of Canada","funders":"","keywords":"Data envelopment analysis; Efficiency; Econometrics; Statistics; Multivariate statistics; Computer science; Variables; Mathematics","score_opus":0.36163971452391647,"score_gpt":0.5072767616607607,"score_spread":0.14563704713684428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068400656","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.19413991,0.00010660172,0.74392796,0.0023305023,0.00012636876,0.00025126842,0.000064748325,0.000002787954,0.059049845],"genre_scores_gemma":[0.86926293,0.00000779389,0.12999088,0.000057029516,0.000048239148,9.771649e-7,0.000008533669,0.00000842066,0.00061516924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9833549,0.0094303265,0.0016755456,0.00047856494,0.0047359434,0.00032471935],"domain_scores_gemma":[0.9920509,0.004622691,0.0002762541,0.00091842766,0.001962409,0.00016934378],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.09764312,0.00010016713,0.00036693754,0.0011491977,0.00026440324,0.00041777187,0.0023627288,0.000018046196,0.0006778986],"category_scores_gemma":[0.043519575,0.000057553243,0.000087826025,0.005378751,0.00020812608,0.00031771918,0.00043781576,0.0005233302,0.00013243992],"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.00028593995,0.0016299337,0.043500863,0.000009290617,0.0009442846,0.0002046261,0.008083697,0.802352,0.0042068954,0.10794271,0.02038911,0.010450616],"study_design_scores_gemma":[0.0020139473,0.0002633206,0.55779964,0.00014863753,0.000321454,0.00023938125,0.0073019443,0.3652467,0.00074785406,0.005127213,0.060243875,0.0005460241],"about_ca_topic_score_codex":0.00006214281,"about_ca_topic_score_gemma":0.000011396186,"teacher_disagreement_score":0.67512304,"about_ca_system_score_codex":0.00008379438,"about_ca_system_score_gemma":0.0007126828,"threshold_uncertainty_score":0.96453726},"labels":[],"label_agreement":null},{"id":"W2068810128","doi":"10.1016/s0377-2217(02)00598-2","title":"Progressive option bounds from the sequence of concurrently expiring options","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"University of Ottawa","funders":"","keywords":"Arbitrage; Sequence (biology); Constraint (computer-aided design); Asset (computer security); Set (abstract data type); Valuation of options; Stochastic discount factor; Computer science; Mathematical optimization; Economics; Econometrics; Finance; Mathematics; Capital asset pricing model","score_opus":0.20396669327803166,"score_gpt":0.3629874712162863,"score_spread":0.15902077793825461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068810128","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.26276264,0.01589341,0.6915072,0.0036277561,0.00050672225,0.00045813576,0.00039332098,0.000008732774,0.024842083],"genre_scores_gemma":[0.99387646,0.0001419602,0.005568083,0.00004217791,0.00024981025,0.00000933032,0.000010530911,0.000011392691,0.000090235575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988039,0.00010063732,0.00062657346,0.00014391723,0.00017075175,0.00015423085],"domain_scores_gemma":[0.99854404,0.00026000387,0.00033529283,0.00016188361,0.0006359534,0.000062806634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027786845,0.00006422548,0.00014850948,0.000113277856,0.00029665665,0.0001171259,0.0003663951,0.000017309922,0.0001814567],"category_scores_gemma":[0.0013614267,0.00005258183,0.00006726486,0.0003316763,0.00020098707,0.00022152123,0.00004344316,0.00031648125,0.00012805805],"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.000011531351,0.00006397327,0.0008101385,0.0000038883295,0.000021765003,0.0000071210548,0.0004010443,0.00022542433,0.0006648632,0.9965489,0.00032914712,0.00091221184],"study_design_scores_gemma":[0.002741938,0.0011093745,0.09900509,0.00042556724,0.000026169591,0.00022628784,0.001740942,0.002950416,0.0019795268,0.6728908,0.21635418,0.00054973084],"about_ca_topic_score_codex":0.00001563044,"about_ca_topic_score_gemma":0.0000011522574,"teacher_disagreement_score":0.73111385,"about_ca_system_score_codex":0.00005864875,"about_ca_system_score_gemma":0.0001720917,"threshold_uncertainty_score":0.22816733},"labels":[],"label_agreement":null},{"id":"W2070048370","doi":"10.1016/j.ejor.2008.03.046","title":"The variable radius covering problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":69,"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; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Monotonic function; Mathematical optimization; Cover (algebra); Variable (mathematics); RADIUS; Mathematics; Plane (geometry); Planar; Function (biology); Set (abstract data type); Facility location problem; Set cover problem; Covering problems; Computer science; Geometry; Mathematical analysis","score_opus":0.11013752496199865,"score_gpt":0.3036408005666974,"score_spread":0.19350327560469877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070048370","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.24704437,0.0008450749,0.009628006,0.022394177,0.0013182036,0.00056325726,0.0000021071494,0.00004493742,0.71815985],"genre_scores_gemma":[0.9872577,0.0002331509,0.0011042582,0.0006009533,0.0015226905,0.0000033292827,0.0000046342398,0.000017928882,0.0092553245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981211,0.00015428076,0.00041736825,0.000106153224,0.00096478837,0.00023631466],"domain_scores_gemma":[0.99847037,0.00006950661,0.000055865028,0.00015039773,0.0012317981,0.000022048242],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0064143883,0.00007088398,0.00007893752,0.00018721812,0.0011755344,0.0003595207,0.00048601915,0.000008272806,0.0005060348],"category_scores_gemma":[0.00063456886,0.000047684458,0.000048543545,0.00046513972,0.00012035062,0.0008015279,0.00017951375,0.00030138931,0.0008812098],"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.00027304713,0.0002649501,0.002472686,0.00009975057,0.00013997078,0.0002749196,0.0003299853,0.06745847,0.0019461723,0.36852115,0.5475439,0.010675023],"study_design_scores_gemma":[0.00038824521,0.00003365129,0.010601376,0.000024759187,0.000004256853,0.000033864122,0.00015307669,0.0055509326,0.000017594035,0.0005018803,0.9826148,0.000075571115],"about_ca_topic_score_codex":0.00007143133,"about_ca_topic_score_gemma":0.000012801924,"teacher_disagreement_score":0.7402134,"about_ca_system_score_codex":0.000045327382,"about_ca_system_score_gemma":0.0001089344,"threshold_uncertainty_score":0.9998967},"labels":[],"label_agreement":null},{"id":"W2071327538","doi":"10.1016/s0377-2217(99)00274-x","title":"On the single-assignment p-hub center problem","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Center (category theory); Computer science; Basis (linear algebra); Mathematical optimization; Mathematics","score_opus":0.12220707681811069,"score_gpt":0.3048564898713042,"score_spread":0.18264941305319352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071327538","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.31005296,0.000046887275,0.00035567212,0.049222857,0.0002448704,0.0003464225,0.0000021756434,0.000015833313,0.63971233],"genre_scores_gemma":[0.98769844,0.000028106482,0.00010678129,0.003297929,0.00079987926,0.000003910099,0.0000072080115,0.00001609632,0.008041627],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977631,0.0002575428,0.0004171073,0.00013904092,0.0011919865,0.00023123289],"domain_scores_gemma":[0.9991217,0.0000627164,0.0000432264,0.00018102088,0.000568371,0.000022910883],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004869879,0.000092953764,0.00008235325,0.000205311,0.0003502837,0.00047569984,0.0004795333,0.000009287898,0.015010011],"category_scores_gemma":[0.00022464436,0.000057814537,0.000071258735,0.00032698357,0.000078676574,0.0004908847,0.00008631007,0.0003237709,0.0050457087],"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.00038635414,0.0012358947,0.00034012826,0.000055166525,0.00010186499,0.00010728709,0.00026767046,0.024923217,0.0010424146,0.21373796,0.6835029,0.07429914],"study_design_scores_gemma":[0.00060771586,0.00014478482,0.0049155625,0.000084808824,0.0000062799963,0.000007072596,0.0001845328,0.002116491,0.00004857041,0.0011328177,0.990638,0.000113320115],"about_ca_topic_score_codex":0.000017762586,"about_ca_topic_score_gemma":0.000009538967,"teacher_disagreement_score":0.6776455,"about_ca_system_score_codex":0.000063020554,"about_ca_system_score_gemma":0.000030489146,"threshold_uncertainty_score":0.99572897},"labels":[],"label_agreement":null},{"id":"W2072759805","doi":"10.1016/j.ejor.2011.05.022","title":"The impact of transportation delays on repairshop capacity pooling and spare part inventories","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Spare part; Pooling; Operations research; Computer science; Queueing theory; Operations management; Economics; Engineering; Computer network","score_opus":0.15090754866049386,"score_gpt":0.33738918854993494,"score_spread":0.18648163988944108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072759805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907783,0.000088625304,0.0003630004,0.00019062698,0.000057349032,0.00006127966,0.000004017838,0.0000054149086,0.00845138],"genre_scores_gemma":[0.99911594,0.00004661158,0.00022753768,0.000033905228,0.00046315763,7.196068e-7,0.000005164972,0.000013551516,0.000093434566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99863327,0.0002271051,0.00038907616,0.00009845108,0.0005017633,0.00015033886],"domain_scores_gemma":[0.99836504,0.00019289071,0.00023647626,0.000120031444,0.001062633,0.000022938168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065246,0.00007651819,0.00011329835,0.00019944993,0.00038066856,0.0001148257,0.00020766418,0.000011222296,0.00012374883],"category_scores_gemma":[0.00092552754,0.000047727845,0.000096673466,0.00027329716,0.00019422428,0.0006778567,0.000024356144,0.00027340167,0.000015139311],"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.006723437,0.000778516,0.15604073,0.00020763141,0.001347144,0.00054311624,0.0077551836,0.07557841,0.00700973,0.71480644,0.013022148,0.016187515],"study_design_scores_gemma":[0.002821927,0.0015522421,0.88472307,0.00094885007,0.0002358177,0.000060187704,0.0055893487,0.014466979,0.0027743464,0.061959296,0.024145003,0.0007229301],"about_ca_topic_score_codex":0.0000636172,"about_ca_topic_score_gemma":0.000027982802,"teacher_disagreement_score":0.72868234,"about_ca_system_score_codex":0.000032171796,"about_ca_system_score_gemma":0.000041750536,"threshold_uncertainty_score":0.29278332},"labels":[],"label_agreement":null},{"id":"W2073910737","doi":"10.1016/j.ejor.2013.03.026","title":"Optimal average sample number of the SPRT chart for monitoring fraction nonconforming","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Process Monitoring","field":"Decision Sciences","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":"Concordia University","funders":"","keywords":"Sequential probability ratio test; CUSUM; Control chart; Chart; Statistics; X-bar chart; Sample size determination; Fraction (chemistry); Mathematics; Sequential analysis; Sequential sampling; Computer science; Control limits; Process (computing)","score_opus":0.26417019682670795,"score_gpt":0.5101998877720714,"score_spread":0.24602969094536342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073910737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56933975,0.000044373886,0.42446524,0.0009930468,0.00077088946,0.0003068373,0.000020452888,0.0000038370604,0.0040555615],"genre_scores_gemma":[0.93039525,0.000007969448,0.06757881,0.000016506572,0.0009955164,0.0000059236213,6.656159e-7,0.000016456599,0.0009829233],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9953766,0.0005677277,0.00091637886,0.00017623187,0.002695429,0.00026767334],"domain_scores_gemma":[0.9892818,0.0052984636,0.000343182,0.00022775233,0.0047085015,0.00014034077],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.008574472,0.00008687087,0.0001892409,0.00015563276,0.00048261537,0.0003469707,0.0008574726,0.000019933537,0.00057517696],"category_scores_gemma":[0.024495916,0.00005303156,0.000111749854,0.00040535108,0.00014818265,0.0011760175,0.00018565093,0.00051560916,0.00018637425],"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.0011150239,0.0005244384,0.1492034,0.000114959454,0.00021009496,0.000071395974,0.003947848,0.1280646,0.09701616,0.02283568,0.02172321,0.5751732],"study_design_scores_gemma":[0.004995534,0.0019047223,0.60479254,0.0009357395,0.000036052767,0.0005055911,0.010268781,0.054702412,0.1145003,0.07953815,0.12691739,0.00090276235],"about_ca_topic_score_codex":0.000012230422,"about_ca_topic_score_gemma":3.3688383e-7,"teacher_disagreement_score":0.5742704,"about_ca_system_score_codex":0.0000971974,"about_ca_system_score_gemma":0.00021459284,"threshold_uncertainty_score":0.9837212},"labels":[],"label_agreement":null},{"id":"W2074019423","doi":"10.1016/j.ejor.2010.02.022","title":"A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":156,"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 Military College of Canada","funders":"Science and Engineering Research Board","keywords":"Variable neighborhood search; Heuristics; Variable (mathematics); Mathematical optimization; PlanetLab; Computer science; Descent (aeronautics); Local search (optimization); Mathematics; Metaheuristic","score_opus":0.0700874788475297,"score_gpt":0.33205587870339404,"score_spread":0.26196839985586434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074019423","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.15574953,0.00015776351,0.8089276,0.005450806,0.00095898745,0.00083235325,0.000022588134,0.000087637345,0.027812727],"genre_scores_gemma":[0.6901949,0.000017865985,0.30809945,0.00005957862,0.0010840639,0.000009623862,0.00001738238,0.0000670511,0.00045009676],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972634,0.0007830662,0.0005469391,0.00014535295,0.00086017075,0.00040107794],"domain_scores_gemma":[0.99652034,0.0008403948,0.0000659669,0.00021102464,0.0021945012,0.00016776226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013851076,0.000120651945,0.00014154184,0.00026110196,0.00044995185,0.00039841892,0.00053350045,0.000043581913,0.00017670525],"category_scores_gemma":[0.0014447523,0.000090759546,0.00006194993,0.00054872537,0.000116984214,0.00036830388,0.00005914099,0.0010986726,0.000021203377],"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.00003728985,0.00006205849,0.00014197762,0.00003514013,0.00007016055,0.0000094479665,0.0011088022,0.46623495,0.50707775,0.013537091,0.004023399,0.007661929],"study_design_scores_gemma":[0.0012125422,0.00039983023,0.0014308683,0.00007959153,0.000016554935,0.00015212604,0.0002732698,0.9564787,0.023802388,0.0008387924,0.015088588,0.00022675804],"about_ca_topic_score_codex":0.000003115999,"about_ca_topic_score_gemma":0.000003970088,"teacher_disagreement_score":0.53444535,"about_ca_system_score_codex":0.00009670507,"about_ca_system_score_gemma":0.00031022285,"threshold_uncertainty_score":0.48005342},"labels":[],"label_agreement":null},{"id":"W2074314438","doi":"10.1016/j.ejor.2008.10.030","title":"Activity list representation for a generalization of the resource-constrained project scheduling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Resource-Constrained Project Scheduling","field":"Decision Sciences","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":"Université de Montréal","funders":"","keywords":"Scheduling (production processes); Computer science; Generalization; Mathematical optimization; Representation (politics); Resource constraints; Mathematics","score_opus":0.3762451047095662,"score_gpt":0.47259360421699004,"score_spread":0.09634849950742386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074314438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9247312,0.000085167274,0.05867593,0.0033133714,0.0001453302,0.0010198351,0.000028283253,0.000009650082,0.011991247],"genre_scores_gemma":[0.9488988,0.00001735544,0.049026243,0.00006633135,0.00054378354,0.000010734339,0.00000520425,0.000029143835,0.001402388],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9888818,0.0049283057,0.0014749052,0.00039743257,0.003960268,0.00035724667],"domain_scores_gemma":[0.99078983,0.0029471566,0.0009069214,0.0004923839,0.004744756,0.000118980046],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.02574607,0.0001528759,0.00033457484,0.0008101755,0.00094731984,0.00032098716,0.0013443696,0.000048973998,0.0000905361],"category_scores_gemma":[0.024535907,0.00009630304,0.00031791467,0.0019379576,0.0006853345,0.0006259099,0.00023672631,0.0006256354,0.00001037343],"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.0037163117,0.0009445305,0.04225803,0.00011377165,0.00037300654,0.000206902,0.02313416,0.20281357,0.6100777,0.015435441,0.030306209,0.070620365],"study_design_scores_gemma":[0.020761875,0.0063127764,0.16081822,0.0017007404,0.00016933594,0.006323235,0.019268056,0.28237575,0.3626227,0.011506378,0.1261539,0.001986999],"about_ca_topic_score_codex":0.00001914201,"about_ca_topic_score_gemma":0.000005768103,"teacher_disagreement_score":0.24745499,"about_ca_system_score_codex":0.000098632474,"about_ca_system_score_gemma":0.0015112426,"threshold_uncertainty_score":0.98368084},"labels":[],"label_agreement":null},{"id":"W2074423738","doi":"10.1016/j.ejor.2012.10.014","title":"Foreign exchange transaction exposure in a newsvendor setting","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"","keywords":"Newsvendor model; Business; Database transaction; Currency; Settlement (finance); Debt; Microeconomics; Obligation; Economics; Monetary economics; Finance; Supply chain; Computer science; Marketing; Payment","score_opus":0.09998277123387986,"score_gpt":0.3174199094004594,"score_spread":0.21743713816657953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074423738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61171323,0.0012186186,0.0031403212,0.005538135,0.00096122036,0.0005073696,0.0000019318868,0.000025322812,0.37689385],"genre_scores_gemma":[0.9941408,0.000031898442,0.00037887422,0.000673253,0.0038581563,0.000004479774,0.000007081167,0.000024997296,0.00088046934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980282,0.00026915668,0.00042006955,0.000104130726,0.0008110221,0.00036737276],"domain_scores_gemma":[0.9993135,0.00006985547,0.000119153876,0.0000981442,0.00036441736,0.000034973644],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008817829,0.0000925933,0.00011538264,0.00072363927,0.00017745548,0.0002497482,0.00026151942,0.000016189713,0.0013465579],"category_scores_gemma":[0.00027359347,0.000078825724,0.00006967735,0.0004413651,0.00003981426,0.0020258105,0.00007541042,0.00038871216,0.00032797168],"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.0013799989,0.0024710416,0.25545,0.0010511171,0.00026866584,0.0012136231,0.0058052596,0.0047196425,0.011384056,0.1445844,0.3151299,0.2565423],"study_design_scores_gemma":[0.0027679782,0.00016684187,0.1508488,0.00024824563,0.000019195626,0.00004660114,0.0038718951,0.0023403761,0.00020055211,0.0005532103,0.83865225,0.00028404372],"about_ca_topic_score_codex":0.000019687539,"about_ca_topic_score_gemma":0.000007907862,"teacher_disagreement_score":0.5235224,"about_ca_system_score_codex":0.00008572478,"about_ca_system_score_gemma":0.000030188592,"threshold_uncertainty_score":0.9995664},"labels":[],"label_agreement":null},{"id":"W2075038193","doi":"10.1016/j.ejor.2005.08.027","title":"Multi-period planning and uncertainty issues in cellular manufacturing: A review and future directions","year":2006,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":167,"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; Operations research; New product development; Product (mathematics); Resource (disambiguation); Cellular manufacturing; Product mix; Resource planning; Risk analysis (engineering); Management science; Industrial engineering; Operations management; Economics; Business; Environmental resource management; Engineering; Marketing","score_opus":0.08361112438579654,"score_gpt":0.37955347176824783,"score_spread":0.2959423473824513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075038193","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.000010730148,0.9970225,0.0018406168,0.00014183944,0.00011719664,0.00026010195,0.000016664608,0.00001716621,0.0005731669],"genre_scores_gemma":[0.00008373052,0.9923383,0.006589566,0.000009533987,0.00055703527,0.0000068764716,0.000050819548,0.000056115772,0.00030803902],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980644,0.0005673103,0.00065025367,0.00019036779,0.00030483332,0.00022283773],"domain_scores_gemma":[0.9993878,0.00013958695,0.00010348367,0.00012264137,0.00014426948,0.00010221768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016003823,0.00023065777,0.00066407985,0.00042726638,0.00015263874,0.00013596754,0.00016361382,0.000061122286,0.000023371018],"category_scores_gemma":[0.0001380004,0.00018375897,0.00007010178,0.00016341006,0.000074265765,0.00015056954,0.00006300246,0.0011163997,0.0000052522305],"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.00000993917,0.00007269502,0.0000045294814,0.029733244,0.0001702049,0.00093596324,0.0003811162,0.14935964,0.0000043976925,0.00010928712,0.0045609195,0.81465805],"study_design_scores_gemma":[0.0001691567,0.000040982202,0.000049516155,0.007807077,0.00006366701,0.00018725087,0.00002558562,0.0006016477,0.0000028673735,0.000007740793,0.9908738,0.0001707193],"about_ca_topic_score_codex":0.0000034154912,"about_ca_topic_score_gemma":0.0000020681312,"teacher_disagreement_score":0.98631287,"about_ca_system_score_codex":0.00011667556,"about_ca_system_score_gemma":0.00006463586,"threshold_uncertainty_score":0.7493473},"labels":[],"label_agreement":null},{"id":"W2075625095","doi":"10.1016/j.ejor.2005.04.024","title":"On “An EOQ model for perishable items under stock-dependent selling rate and time-dependent partial backlogging” by Dye and Ouyang","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":42,"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":"William Paterson University of New Jersey","keywords":"Economic order quantity; Stock (firearms); Inventory management; Mathematical optimization; Computer science; Operations research; Economics; Econometrics; Mathematics; Operations management; Business; Supply chain","score_opus":0.084163859544147,"score_gpt":0.32133913153957705,"score_spread":0.23717527199543004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075625095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90559775,0.0007988186,0.05317909,0.011740564,0.00034304505,0.0011476708,0.000027778126,0.000049816434,0.027115442],"genre_scores_gemma":[0.98787653,0.000072756564,0.0005740486,0.0016722238,0.0015709142,0.000008931059,0.000026196722,0.00004978704,0.008148587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798304,0.00020211827,0.00042206488,0.0002918506,0.00075324875,0.00034770704],"domain_scores_gemma":[0.99905217,0.00013416847,0.00013721058,0.00013231751,0.0004676936,0.0000764668],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0061605456,0.00015783169,0.00017294467,0.0003143187,0.0005380355,0.0010558619,0.00026150743,0.00002564972,0.00035378136],"category_scores_gemma":[0.00015929462,0.0001356648,0.000046184174,0.000097954515,0.00007577001,0.001336249,0.00016347687,0.00032176604,0.00011087259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017524139,0.0010202836,0.0006480927,0.00022892948,0.0002966598,0.00009853713,0.0009868222,0.65080726,0.03377432,0.046027,0.24355161,0.02080809],"study_design_scores_gemma":[0.0017878858,0.0002274943,0.00016723522,0.00006709479,0.000022435815,0.000008607315,0.0002782591,0.94984376,0.00031265014,0.0008151477,0.0462589,0.00021051304],"about_ca_topic_score_codex":0.000009549656,"about_ca_topic_score_gemma":0.000005103491,"teacher_disagreement_score":0.29903653,"about_ca_system_score_codex":0.00007427222,"about_ca_system_score_gemma":0.000046646714,"threshold_uncertainty_score":0.99998116},"labels":[],"label_agreement":null},{"id":"W2077568024","doi":"10.1016/j.ejor.2005.11.041","title":"The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"The Scarborough Hospital; McMaster University; University of Toronto","funders":"","keywords":"Facility location problem; Operations research; Computer science; Profit (economics); Service (business); Cost allocation; Total cost; Customer service; Business; Economics; Microeconomics; Marketing; Mathematics","score_opus":0.04401024142207485,"score_gpt":0.2821804260447206,"score_spread":0.23817018462264575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077568024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94406956,0.000607332,0.003337029,0.029995527,0.0001310991,0.0007147212,0.000005847536,0.000028918115,0.021109981],"genre_scores_gemma":[0.9982727,0.00007812381,0.00017351807,0.00040032272,0.00025765246,0.0000072362127,0.000034559285,0.000010490908,0.00076537684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99802935,0.00025957954,0.0004332767,0.00019365596,0.0008764691,0.00020765862],"domain_scores_gemma":[0.99700886,0.00010687582,0.00009616402,0.0001410926,0.0026174854,0.000029534338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005392289,0.0001130391,0.000097344004,0.00020026052,0.00073965616,0.0006915435,0.00021256997,0.000016086859,0.000052021696],"category_scores_gemma":[0.00025342192,0.00007474639,0.000014714225,0.0005507305,0.00014444652,0.0009701494,0.00011436916,0.00025995696,0.00013212526],"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.003253863,0.0017799757,0.10343771,0.0026124907,0.0007720709,0.0001675929,0.0021609983,0.25009438,0.013139614,0.36996228,0.116228156,0.13639088],"study_design_scores_gemma":[0.0035721448,0.00024939116,0.6606634,0.0002724832,0.00008691854,0.00007248672,0.002551913,0.0445558,0.00015277378,0.001255558,0.286025,0.0005421124],"about_ca_topic_score_codex":0.0009564743,"about_ca_topic_score_gemma":0.0020741315,"teacher_disagreement_score":0.5572257,"about_ca_system_score_codex":0.00007089297,"about_ca_system_score_gemma":0.00006984134,"threshold_uncertainty_score":0.666857},"labels":[],"label_agreement":null},{"id":"W2077707231","doi":"10.1016/j.ejor.2005.07.032","title":"Computing the asymptotic worst-case of bin packing lower bounds","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":18,"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":"Université de Montréal","keywords":"Bin packing problem; Upper and lower bounds; Bin; Mathematics; Asymptotic analysis; Combinatorics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.04496201590172233,"score_gpt":0.3090551839637535,"score_spread":0.26409316806203115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077707231","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8469993,0.0011088497,0.05818454,0.0011886238,0.0008117357,0.00022389421,0.00000835037,0.00004373777,0.09143099],"genre_scores_gemma":[0.99643755,0.000027106076,0.0026679805,0.000026146661,0.0004467882,2.2931236e-7,0.000003107137,0.000029511453,0.00036157086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982166,0.0005065533,0.0004945161,0.000070182665,0.0005142684,0.00019783012],"domain_scores_gemma":[0.99878335,0.00031413708,0.00007352438,0.0001221974,0.00065128313,0.00005553418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072573,0.00007940369,0.00011158894,0.00020937732,0.0002448668,0.00020379473,0.00023209791,0.000015849992,0.00017147305],"category_scores_gemma":[0.00018144013,0.00005654732,0.00006290789,0.00037757197,0.00010282797,0.00014714204,0.000046463683,0.0004629565,0.000034918354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014665029,0.000041764983,0.00056891306,0.000022422477,0.00003323003,0.00047430227,0.00039588276,0.98339635,0.0019985042,0.0034813052,0.0073911375,0.0021815218],"study_design_scores_gemma":[0.0032827551,0.0009568217,0.022575121,0.0010487878,0.00004482962,0.007025453,0.0009700791,0.8903613,0.004297168,0.0007938569,0.06796967,0.00067414495],"about_ca_topic_score_codex":0.00000703667,"about_ca_topic_score_gemma":0.0000048960037,"teacher_disagreement_score":0.14943829,"about_ca_system_score_codex":0.000046660698,"about_ca_system_score_gemma":0.000070905175,"threshold_uncertainty_score":0.23059328},"labels":[],"label_agreement":null},{"id":"W2078532622","doi":"10.1016/s0377-2217(00)00113-2","title":"Comparisons and evaluations of alternative approaches to the treatment of congestion in DEA","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":96,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Data envelopment analysis; Annals; Operations research; Production (economics); Computer science; Mathematical economics; Mathematics; Economics; Econometrics; Statistics; Microeconomics; History","score_opus":0.7068223700814493,"score_gpt":0.5339683929785835,"score_spread":0.17285397710286587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078532622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98025346,0.00042784156,0.008648137,0.0072990884,0.00004005633,0.00016575593,0.0000063704065,5.877965e-7,0.0031587128],"genre_scores_gemma":[0.99757755,0.00011595561,0.0018903586,0.000015740332,0.0000700496,0.0000017308688,0.0000010948575,0.0000041132926,0.00032338055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99352473,0.0031714367,0.0008269556,0.0001541095,0.0022023395,0.00012040655],"domain_scores_gemma":[0.9956232,0.0023019318,0.00023076024,0.00020095315,0.0015703841,0.000072821495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017924199,0.00005820669,0.00020653462,0.0007331189,0.00014221454,0.000101247235,0.0004460865,0.000009320943,0.000082718616],"category_scores_gemma":[0.004069732,0.00003223952,0.000060342918,0.0011627713,0.00023312024,0.00014824966,0.00005296426,0.00013702695,0.000024609066],"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.00046542683,0.0015647913,0.09529018,0.0000030155782,0.0001234638,0.000059762377,0.016027674,0.7710976,0.00338705,0.013021911,0.00243164,0.0965275],"study_design_scores_gemma":[0.0014254488,0.0028017391,0.85906553,0.000092860035,0.00003143364,0.0000702744,0.0044738213,0.112820625,0.0018432508,0.0014755148,0.015796738,0.00010276357],"about_ca_topic_score_codex":0.000037064132,"about_ca_topic_score_gemma":0.00011295595,"teacher_disagreement_score":0.76377535,"about_ca_system_score_codex":0.00006902906,"about_ca_system_score_gemma":0.00019868204,"threshold_uncertainty_score":0.6212205},"labels":[],"label_agreement":null},{"id":"W2079597083","doi":"10.1016/s0377-2217(00)00308-8","title":"Optimal investment in setup reduction in manufacturing systems with WIP inventories","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Waterloo; McMaster University","funders":"","keywords":"Reduction (mathematics); Investment (military); Operations management; Operations research; Computer science; Business; Manufacturing engineering; Mathematical optimization; Economics; Mathematics; Engineering","score_opus":0.07997262308144266,"score_gpt":0.29743755767190944,"score_spread":0.21746493459046679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079597083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94981647,0.00018246825,0.00010283071,0.001702527,0.00032829773,0.00027132148,3.6132283e-7,0.000008370947,0.047587357],"genre_scores_gemma":[0.99674684,0.000054654538,0.00020698343,0.0002234864,0.001400376,0.000008384819,0.000009349368,0.000024507402,0.0013254049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776953,0.00025667177,0.0005148798,0.00018226581,0.0009680067,0.0003086468],"domain_scores_gemma":[0.9993593,0.000030998675,0.00014309265,0.00012724902,0.00030889743,0.000030437719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004806637,0.00011939909,0.00015877404,0.0011090402,0.00013479835,0.0005243895,0.0002946117,0.000016473241,0.00017543446],"category_scores_gemma":[0.00010772442,0.000095128,0.00003142312,0.00054205843,0.000086676104,0.0014360837,0.00012998552,0.00042501505,0.000094773044],"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.0031048907,0.0016490184,0.12533721,0.00063153333,0.00023063507,0.009126262,0.0029514148,0.69752294,0.0022745659,0.0884877,0.062915325,0.0057685124],"study_design_scores_gemma":[0.007157925,0.0006569372,0.18854415,0.001686862,0.000025489762,0.00036306484,0.015256445,0.02031575,0.0004298502,0.0006356805,0.76421565,0.0007121774],"about_ca_topic_score_codex":0.00017955103,"about_ca_topic_score_gemma":0.000041233387,"teacher_disagreement_score":0.7013003,"about_ca_system_score_codex":0.0002374576,"about_ca_system_score_gemma":0.000069090405,"threshold_uncertainty_score":0.50567},"labels":[],"label_agreement":null},{"id":"W2079982674","doi":"10.1016/j.ejor.2007.02.045","title":"Circumstantial power: Optimal persuadable voters","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":11,"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":"European Regional Development Fund; Royal Canadian Geographical Society","keywords":"Circumstantial evidence; Power (physics); Mathematical economics; Computer science; Economics; Political science; Physics; Thermodynamics","score_opus":0.11004846466087169,"score_gpt":0.3286839589659798,"score_spread":0.2186354943051081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079982674","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78788555,0.00085727824,0.021031173,0.000777289,0.0006720724,0.00009507646,0.000016222895,0.000008107779,0.18865725],"genre_scores_gemma":[0.9948587,0.000019959476,0.0012998086,0.00007643963,0.0006591997,2.5755395e-7,0.0000020580478,0.000025200594,0.003058417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980282,0.00029588654,0.00088050024,0.0001775368,0.00024645575,0.00037137422],"domain_scores_gemma":[0.99882704,0.00021648308,0.0002437855,0.00015484763,0.000383447,0.00017439532],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.026775982,0.0000866862,0.0002120139,0.00049026345,0.00025893963,0.00020006525,0.00042597554,0.000026638716,0.0010053098],"category_scores_gemma":[0.00081125385,0.000086152555,0.000113595284,0.00027627553,0.00012234217,0.0003244529,0.000061035375,0.00052151986,0.0010992043],"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.0008821346,0.0003807856,0.013935889,0.000038027552,0.00024991462,0.0012585573,0.0055950466,0.003138042,0.008130669,0.94601876,0.018328844,0.0020433322],"study_design_scores_gemma":[0.0062301243,0.0046167066,0.1347857,0.0003360055,0.000012556905,0.001701916,0.0063365204,0.0018070738,0.0037326433,0.0076793036,0.83165044,0.001111052],"about_ca_topic_score_codex":0.000009033449,"about_ca_topic_score_gemma":8.3387795e-7,"teacher_disagreement_score":0.9383395,"about_ca_system_score_codex":0.00011180772,"about_ca_system_score_gemma":0.00007406175,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W2080237581","doi":"10.1016/j.ejor.2003.10.019","title":"Prototyping an intelligent decision support system for improving urban infrastructures management","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":53,"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":"Decision support system; Sewerage; Computer science; Process (computing); Process management; Intelligent decision support system; Population; Knowledge management; Systems engineering; Engineering; Artificial intelligence","score_opus":0.07362771019235809,"score_gpt":0.36057991177272325,"score_spread":0.28695220158036516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080237581","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.03886942,0.000067487155,0.9584862,0.00020957373,0.0004577963,0.0008496338,0.0000026052733,0.000019127574,0.0010381696],"genre_scores_gemma":[0.8389045,0.000006993005,0.16048795,0.000034702025,0.00044644452,0.000014654715,0.0000043281375,0.000015397478,0.00008501838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725205,0.00043097016,0.00066588586,0.000256341,0.0011253143,0.00026941192],"domain_scores_gemma":[0.9982648,0.00008993733,0.00019337276,0.00027874843,0.0009919086,0.00018123085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065767216,0.000105623854,0.00013636367,0.00041039704,0.00040268476,0.00058503746,0.00092420855,0.000019697296,0.000015096726],"category_scores_gemma":[0.00015680866,0.00008189443,0.00007718674,0.00023476678,0.0000260943,0.000894899,0.00018727474,0.00023182553,0.000034636232],"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.0005046515,0.0003830222,0.00052261015,0.00067213655,0.00014807387,0.0007007508,0.006553476,0.04517357,0.0213651,0.4644958,0.0036977641,0.45578304],"study_design_scores_gemma":[0.032798484,0.026480466,0.19886328,0.0071032783,0.0001232705,0.004470438,0.008894301,0.40544918,0.12591676,0.014750207,0.17180751,0.0033428282],"about_ca_topic_score_codex":0.0000062120066,"about_ca_topic_score_gemma":0.0000019476386,"teacher_disagreement_score":0.8000351,"about_ca_system_score_codex":0.00028847653,"about_ca_system_score_gemma":0.00022856474,"threshold_uncertainty_score":0.564153},"labels":[],"label_agreement":null},{"id":"W2081153133","doi":"10.1016/j.ejor.2006.03.037","title":"Optimal ordering policies when the supplier provides a progressive interest scheme","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":74,"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":"National Science Council; William Paterson University of New Jersey","keywords":"Interest rate; Economic order quantity; Issuer; Balance (ability); Business; Competitor analysis; Equity (law); Economics; Credit card; Monetary economics; Finance; Marketing","score_opus":0.09285610408099224,"score_gpt":0.31979043598660695,"score_spread":0.2269343319056147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081153133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84394467,0.00061624194,0.0009430434,0.036263622,0.00039195444,0.00063269964,0.0000026527114,0.00003484541,0.11717025],"genre_scores_gemma":[0.99019927,0.00000648258,0.0013018451,0.0008458896,0.0045165643,0.000009839589,0.000010888178,0.00003326451,0.0030759724],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804777,0.00016759557,0.00044582904,0.00015181524,0.0008553534,0.00033164673],"domain_scores_gemma":[0.9985902,0.000086250024,0.00018105686,0.00016777725,0.0009547131,0.000020052224],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0035860185,0.00012523583,0.00012200388,0.00038615667,0.0005048087,0.0013590538,0.0006836684,0.000013346941,0.0008912642],"category_scores_gemma":[0.00035635225,0.000079473844,0.0000833999,0.00030115168,0.00023447175,0.001003819,0.0004481242,0.00041999758,0.00026882187],"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.00032001137,0.0004370727,0.008465939,0.00014915716,0.00015499639,0.0005887848,0.0006409856,0.0040792613,0.005153391,0.26357448,0.7111924,0.005243475],"study_design_scores_gemma":[0.0008183738,0.00012880648,0.012012167,0.00015240558,0.000014621974,0.000040011946,0.001549962,0.0046644094,0.00021287164,0.0011679401,0.9790588,0.00017962743],"about_ca_topic_score_codex":0.000071230075,"about_ca_topic_score_gemma":0.000017632892,"teacher_disagreement_score":0.26786634,"about_ca_system_score_codex":0.00005856415,"about_ca_system_score_gemma":0.00007157978,"threshold_uncertainty_score":0.99967766},"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":"W2082713764","doi":"10.1016/j.ejor.2009.02.033","title":"Using copulas to model repeat purchase behaviour – An exploratory analysis via a case study","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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 Guelph","funders":"","keywords":"Purchasing; Product (mathematics); Dependency (UML); Computer science; Consumer behaviour; Process (computing); Population; Business; Econometrics; Marketing; Economics; Mathematics; Artificial intelligence","score_opus":0.23376204761028502,"score_gpt":0.416857534251113,"score_spread":0.18309548664082798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082713764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98615307,0.000039346603,0.012193969,0.00033526955,0.00007066882,0.00027954474,0.0000024608878,0.00001598792,0.00090971566],"genre_scores_gemma":[0.99709886,0.0000016254212,0.001741267,0.00038482322,0.0006213379,0.0000020499483,0.000007305132,0.000028941115,0.00011377244],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690753,0.0005420731,0.0006743825,0.0003099002,0.0012298906,0.00033625044],"domain_scores_gemma":[0.9973926,0.000046694742,0.00016817341,0.00035049336,0.00192144,0.00012063295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008759184,0.00016803043,0.00027790657,0.001879129,0.00067342486,0.0008763006,0.00043141504,0.00001893395,0.00021775615],"category_scores_gemma":[0.0002858013,0.00015060544,0.00014164072,0.0017337527,0.000036017664,0.001776288,0.00019050768,0.0004956863,0.000043351072],"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.0018451923,0.0066028074,0.3965508,0.000037967675,0.000777021,0.123947166,0.010431636,0.30731264,0.033547346,0.0005485534,0.0026811692,0.11571771],"study_design_scores_gemma":[0.0052186837,0.0020235856,0.24202941,0.00015321668,0.0027932727,0.0032384458,0.02558097,0.7155658,0.0001493402,0.0002488989,0.0014910662,0.0015072942],"about_ca_topic_score_codex":0.0002140005,"about_ca_topic_score_gemma":0.0001766689,"teacher_disagreement_score":0.40825316,"about_ca_system_score_codex":0.00008270604,"about_ca_system_score_gemma":0.00013082684,"threshold_uncertainty_score":0.84501874},"labels":[],"label_agreement":null},{"id":"W2084296369","doi":"10.1016/j.ejor.2005.12.049","title":"Alternative configurations for cutting machines in a tube cutting mill","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Mill; Tube (container); Manufacturing engineering; Computer science; Cutting tool; Engineering drawing; Mechanical engineering; Engineering","score_opus":0.06251405671264575,"score_gpt":0.3424651484516882,"score_spread":0.2799510917390424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084296369","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.30365667,0.0015788017,0.43001932,0.0038386574,0.0011352006,0.0010892033,0.00009382482,0.000103664104,0.25848466],"genre_scores_gemma":[0.9820125,0.00004012594,0.016658416,0.000036380647,0.0006163711,0.000005164205,0.00002466357,0.000035246707,0.00057111913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.00031437888,0.0005016504,0.00008971588,0.00037493015,0.00021067924],"domain_scores_gemma":[0.9987784,0.00035562395,0.000054244338,0.00006253842,0.00069659797,0.00005257141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027631028,0.000082791965,0.00011426031,0.0003599118,0.00015966967,0.00017362609,0.00017830018,0.000015606616,0.00009841963],"category_scores_gemma":[0.00042577097,0.00007522542,0.000049242233,0.00025925704,0.00003581314,0.00025513547,0.000018687473,0.00034516348,0.000020307489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018839675,0.00003368814,0.00072886125,0.00002379176,0.00001808013,0.000032340708,0.00045214902,0.97894293,0.006172239,0.007168692,0.0040234276,0.0023849725],"study_design_scores_gemma":[0.0019022378,0.00020199585,0.0056748586,0.00026728885,0.0000057155225,0.00009120768,0.00015574969,0.9545739,0.003072931,0.001304443,0.03253113,0.00021853532],"about_ca_topic_score_codex":0.000014578967,"about_ca_topic_score_gemma":0.00001057407,"teacher_disagreement_score":0.6783559,"about_ca_system_score_codex":0.000071786315,"about_ca_system_score_gemma":0.00006544028,"threshold_uncertainty_score":0.30676037},"labels":[],"label_agreement":null},{"id":"W2084502319","doi":"10.1016/s0377-2217(98)00396-8","title":"Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"","keywords":"Queueing theory; Computer science; Markov chain; Tree (set theory); Queue; Stationary distribution; Birth–death process; Markov process; Bulk queue; Mathematical optimization; Computer network; Mathematics; Combinatorics; Statistics; Machine learning","score_opus":0.022258352862121595,"score_gpt":0.28541215909177314,"score_spread":0.26315380622965157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084502319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9639569,0.0006035349,0.0017004722,0.0057654744,0.000030866606,0.0003137828,0.0000071518307,0.00001536381,0.027606433],"genre_scores_gemma":[0.9946758,0.00021432374,0.0011736557,0.00049785763,0.00095272955,0.0000031475133,0.0000055572737,0.000034644774,0.0024422945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792784,0.00041718368,0.0003503826,0.00023424467,0.00081652094,0.00025384722],"domain_scores_gemma":[0.997924,0.0005092081,0.00017098064,0.0001706385,0.0011852501,0.00003998006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038361552,0.00016555225,0.0002444457,0.00027901737,0.000621663,0.000687458,0.00039334572,0.000019719102,0.0007132489],"category_scores_gemma":[0.0010051321,0.00009201123,0.000045037217,0.0005723065,0.00038448925,0.0012515667,0.00012686114,0.00056921353,0.00003936317],"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.06639948,0.0018703333,0.058732443,0.0025067762,0.0039615026,0.004623915,0.01391745,0.054308217,0.0043213787,0.381679,0.015997438,0.3916821],"study_design_scores_gemma":[0.07509007,0.0053742863,0.2765942,0.005929526,0.0018009779,0.0041332818,0.01685965,0.086279996,0.0017007596,0.18008208,0.3412202,0.004935006],"about_ca_topic_score_codex":0.000025759287,"about_ca_topic_score_gemma":0.000086191576,"teacher_disagreement_score":0.38674706,"about_ca_system_score_codex":0.000025716625,"about_ca_system_score_gemma":0.00013103202,"threshold_uncertainty_score":0.7809575},"labels":[],"label_agreement":null},{"id":"W2084913131","doi":"10.1016/j.ejor.2008.12.019","title":"Enhanced-interval linear programming","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","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 Regina","funders":"","keywords":"Interval (graph theory); Linear programming; Mathematical optimization; Stochastic programming; Linear-fractional programming; Mathematics; Fuzzy logic; Goal programming; Constraint programming; Computer science; Constraint (computer-aided design); Constraint satisfaction; Extension (predicate logic); Probabilistic logic; Artificial intelligence; Statistics","score_opus":0.07324067857832808,"score_gpt":0.30518364250783925,"score_spread":0.23194296392951116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084913131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7637619,0.00043080872,0.15936449,0.00040107322,0.00035629145,0.00021396317,0.0000015397775,0.000076861375,0.075393096],"genre_scores_gemma":[0.9883144,0.00015573097,0.009247496,0.000017509434,0.00061648525,0.0000011141716,0.0000051104444,0.000027691343,0.0016144442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986754,0.00020897809,0.0002908167,0.00006715677,0.00057287765,0.00018473816],"domain_scores_gemma":[0.99940664,0.00003415813,0.000027435362,0.0000760959,0.00037522658,0.00008046479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012991711,0.00006632314,0.00008472983,0.00022613176,0.00015289662,0.000071105795,0.00023684907,0.000010237996,0.00013627589],"category_scores_gemma":[0.00008862,0.000055853005,0.000049481103,0.000200407,0.000055952936,0.0002601474,0.00004810979,0.00031326825,0.00017011643],"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.000122027646,0.00013258222,0.00058153435,0.000056843382,0.00016537671,0.0009791474,0.0038793639,0.92665124,0.010312855,0.0008987734,0.02837255,0.027847692],"study_design_scores_gemma":[0.002627709,0.0014228158,0.014635164,0.00030003075,0.000019919846,0.000502215,0.00050720555,0.17669903,0.020041184,0.000040439943,0.78264815,0.00055614806],"about_ca_topic_score_codex":4.8713656e-7,"about_ca_topic_score_gemma":3.2463134e-7,"teacher_disagreement_score":0.75427556,"about_ca_system_score_codex":0.000042698,"about_ca_system_score_gemma":0.000022355855,"threshold_uncertainty_score":0.22776194},"labels":[],"label_agreement":null},{"id":"W2085067859","doi":"10.1016/j.ejor.2003.04.001","title":"Single item lot-sizing problems with backlogging on a single machine at a finite production rate","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"McGill University","funders":"","keywords":"Sizing; Production (economics); Schedule; Mathematical optimization; Computer science; Sequence (biology); Computation; Production planning; Time horizon; Dynamic programming; Finite set; Holding cost; Single-machine scheduling; Mathematics; Job shop scheduling; Algorithm; Economics","score_opus":0.1131074793577895,"score_gpt":0.279930229690317,"score_spread":0.1668227503325275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085067859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7091774,0.00039435152,0.0014689472,0.008140135,0.0008079369,0.0007792987,0.0000019838794,0.00005579145,0.27917415],"genre_scores_gemma":[0.9910104,0.000016530395,0.0005218872,0.0008726959,0.0012220085,0.000005192003,0.000014209465,0.00005669456,0.006280334],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736196,0.00047424217,0.00046014096,0.00029158924,0.0010378924,0.00037416205],"domain_scores_gemma":[0.9984538,0.0001615401,0.00024725572,0.00020080338,0.00089446164,0.000042114447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065243365,0.00017152113,0.00016840777,0.0006691698,0.000573483,0.0006456933,0.0002676699,0.000015681908,0.00065379444],"category_scores_gemma":[0.0014938846,0.00012882041,0.0000642934,0.00062250235,0.00010127646,0.0010256589,0.00012699973,0.0004075828,0.00045626034],"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.0053627333,0.0077226865,0.03720634,0.001673906,0.0010435445,0.0036123744,0.003025398,0.30137023,0.3094061,0.096477106,0.19330902,0.039790574],"study_design_scores_gemma":[0.0021977916,0.0010112723,0.0033492057,0.0007808549,0.000032859374,0.00009224232,0.0005791579,0.004272405,0.003927151,0.00030627177,0.9830486,0.00040216683],"about_ca_topic_score_codex":0.000007322974,"about_ca_topic_score_gemma":0.000018226956,"teacher_disagreement_score":0.7897396,"about_ca_system_score_codex":0.0002190722,"about_ca_system_score_gemma":0.000050429826,"threshold_uncertainty_score":0.71585906},"labels":[],"label_agreement":null},{"id":"W2086111082","doi":"10.1016/j.ejor.2014.08.035","title":"A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Infrastructure Maintenance and Monitoring","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Earthworks; Integer programming; Schedule; Linear programming; Computer science; Integer (computer science); Mathematical optimization; Algorithm; Mathematics; Geology; Geotechnical engineering","score_opus":0.04540281215405716,"score_gpt":0.2990662925051689,"score_spread":0.25366348035111175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086111082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8031561,0.00013023375,0.19129704,0.0012210438,0.00033153966,0.0002169386,0.0000010506448,0.00001735845,0.003628706],"genre_scores_gemma":[0.9503228,0.000029665463,0.049151484,0.000055164834,0.00038797985,0.000004368031,4.3810098e-7,0.000020612642,0.000027495465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855214,0.0002463355,0.00036510706,0.00011067474,0.00045022613,0.00027553723],"domain_scores_gemma":[0.99934405,0.00013991991,0.00001735553,0.000096958924,0.00027840896,0.00012332357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002598992,0.00009731782,0.00013275693,0.0001690951,0.00013694838,0.00014429406,0.0001522301,0.000020117086,0.000007361229],"category_scores_gemma":[0.0005409156,0.00006781236,0.00003053357,0.00013118713,0.000096036674,0.00014221472,0.000082044346,0.00053364155,0.000006665029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050289233,0.000009512775,0.00026908188,0.000011272769,0.000023667888,0.00004118239,0.00081343873,0.94614965,0.008567038,0.0014124596,0.00033954688,0.04231289],"study_design_scores_gemma":[0.0011143464,0.00030366756,0.002910484,0.0003851862,0.000010949119,0.0004273849,0.0012531268,0.97081584,0.010401283,0.00024721463,0.011896517,0.00023401898],"about_ca_topic_score_codex":0.0000032695345,"about_ca_topic_score_gemma":0.000003882213,"teacher_disagreement_score":0.1471667,"about_ca_system_score_codex":0.00008639629,"about_ca_system_score_gemma":0.00005392559,"threshold_uncertainty_score":0.27653077},"labels":[],"label_agreement":null},{"id":"W2086399386","doi":"10.1016/j.ejor.2012.02.007","title":"Heuristics for the multi-depot petrol station replenishment problem with time windows","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":104,"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":"TRIPS architecture; Truck; Heuristics; Computer science; Operations research; Heuristic; Set (abstract data type); Depot; Revenue; Vehicle routing problem; Mathematical optimization; Schedule; Gasoline; Transport engineering; Routing (electronic design automation); Engineering; Mathematics; Automotive engineering; Computer network","score_opus":0.08523717946583616,"score_gpt":0.3594690999722097,"score_spread":0.27423192050637357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086399386","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.012053547,0.0004241228,0.9838054,0.00088562426,0.00014956966,0.00052062253,0.000019879015,0.000031421907,0.002109821],"genre_scores_gemma":[0.5259441,0.00005054989,0.47232026,0.00003970307,0.00062589615,0.000012994244,0.000011453177,0.00006224876,0.0009327915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777544,0.0007100853,0.00040929063,0.00008189485,0.0007205527,0.00030275123],"domain_scores_gemma":[0.997831,0.00080582645,0.00008173733,0.00014547541,0.0010049964,0.00013098761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008881834,0.00009544361,0.00011157673,0.00012639619,0.00028161827,0.00015390976,0.00024114821,0.000015261248,0.0000903418],"category_scores_gemma":[0.00074218045,0.00006182947,0.00004154133,0.0001965115,0.000058582722,0.00028983748,0.00003093473,0.0003963074,0.000049497452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001258452,0.00009203209,0.001074188,0.000037065336,0.00011679191,0.000010317517,0.0010537303,0.97691953,0.0046447897,0.000522283,0.009303622,0.0060998267],"study_design_scores_gemma":[0.002771052,0.0007753313,0.014916664,0.0001220881,0.00004969808,0.0002355327,0.00035456015,0.91837656,0.0031240364,0.00002152574,0.05898652,0.00026645788],"about_ca_topic_score_codex":6.8387027e-7,"about_ca_topic_score_gemma":4.059989e-7,"teacher_disagreement_score":0.51389056,"about_ca_system_score_codex":0.000109790606,"about_ca_system_score_gemma":0.000097345095,"threshold_uncertainty_score":0.30782843},"labels":[],"label_agreement":null},{"id":"W2086961297","doi":"10.1016/j.ejor.2014.10.025","title":"A multi-step goal programming approach for group decision making with incomplete interval additive reciprocal comparison matrices","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":64,"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":"National Natural Science Foundation of China","keywords":"Multiplicative function; Interval (graph theory); Reciprocal; Mathematics; Goal programming; Mathematical optimization; Linear programming; Logarithm; Group (periodic table); Preference; Constraint (computer-aided design); Group decision-making; Statistics; Combinatorics","score_opus":0.3359376798616845,"score_gpt":0.5029340869811448,"score_spread":0.16699640711946034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086961297","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.07560759,0.0001338106,0.9216983,0.0002078838,0.00026576605,0.0006886554,0.00002863132,0.000016879458,0.0013525053],"genre_scores_gemma":[0.5182887,0.0000027045207,0.48095125,0.00006097635,0.00053606735,0.000014145897,0.000009160068,0.000036941674,0.00010009188],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9853108,0.0046784463,0.0023206174,0.00081001857,0.006198302,0.00068183366],"domain_scores_gemma":[0.9817966,0.010720747,0.0009048326,0.00053076935,0.005701832,0.00034520708],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.04832694,0.00029759968,0.00070280686,0.0014530311,0.0009116088,0.0025150275,0.0023445801,0.00006276876,0.00021036043],"category_scores_gemma":[0.02271011,0.00019054009,0.0002688746,0.0012654837,0.00035731556,0.0011140726,0.00066410494,0.0010436584,0.00013068209],"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.004142962,0.0005943542,0.0031767301,0.000020854663,0.00007594197,0.000094248884,0.0014069609,0.005030672,0.0012910666,0.0011180238,0.010720482,0.9723277],"study_design_scores_gemma":[0.00561638,0.0042726314,0.03504037,0.0008305156,0.00002625707,0.0005046768,0.004380862,0.78705347,0.000088183304,0.00044876957,0.1612475,0.00049035694],"about_ca_topic_score_codex":0.000003856289,"about_ca_topic_score_gemma":0.000019509696,"teacher_disagreement_score":0.97183734,"about_ca_system_score_codex":0.00018361848,"about_ca_system_score_gemma":0.00021710442,"threshold_uncertainty_score":0.99852043},"labels":[],"label_agreement":null},{"id":"W2087135139","doi":"10.1016/j.ejor.2011.01.009","title":"Public Disclosure Programs vs. traditional approaches for environmental regulation: Green goodwill and the policies of the firm","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Environmental Sustainability in Business","field":"Business, Management and Accounting","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":"Group for Research in Decision Analysis; HEC Montréal; Defence Research and Development Canada","funders":"","keywords":"Goodwill; Business; Accounting; Environmental economics; Industrial organization; Process management; Economics","score_opus":0.22628078196285667,"score_gpt":0.26237864490174695,"score_spread":0.03609786293889028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087135139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644284,0.00019113095,0.00018920544,0.025580944,0.00009641298,0.00087690266,0.000014139688,0.0000048580423,0.008617994],"genre_scores_gemma":[0.99820876,0.000009419482,0.00029392648,0.00018231772,0.0007386114,0.000016612796,0.000019704483,0.000018946726,0.00051170157],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982222,0.00025590896,0.00039038947,0.00012921722,0.00081108813,0.00019123404],"domain_scores_gemma":[0.99924266,0.00015175962,0.00022262122,0.00017186113,0.00019119894,0.000019907853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038318387,0.00009999373,0.00013206594,0.00010896872,0.00050392805,0.0001889144,0.0005008129,0.000019573825,0.0001604308],"category_scores_gemma":[0.00030611738,0.000054496468,0.00010913755,0.0002093524,0.0013370276,0.00086000934,0.00028026933,0.00022486696,0.0000056977865],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014306352,0.0013795609,0.49212572,0.00034343198,0.00023300406,0.000010250751,0.0025577738,0.00030821384,0.0003691911,0.4642734,0.0033304866,0.033638336],"study_design_scores_gemma":[0.0011587216,0.00007005424,0.9762482,0.000026626098,0.000020541165,0.000023799801,0.00073078513,0.00062972505,0.000025936484,0.0068821283,0.014109848,0.00007364825],"about_ca_topic_score_codex":0.000028671797,"about_ca_topic_score_gemma":0.0000069356065,"teacher_disagreement_score":0.48412246,"about_ca_system_score_codex":0.000056612585,"about_ca_system_score_gemma":0.000041548643,"threshold_uncertainty_score":0.4926334},"labels":[],"label_agreement":null},{"id":"W2087399459","doi":"10.1016/j.ejor.2008.08.024","title":"A Lagrangian relaxation approach to large-scale flow interception problems","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Infrastructure Resilience and Vulnerability Analysis","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":"York University","funders":"","keywords":"Lagrangian relaxation; Interception; Scale (ratio); Lagrangian; Flow (mathematics); Relaxation (psychology); Mathematical optimization; Applied mathematics; Computer science; Mathematical economics; Mathematics; Geography; Geometry; Cartography","score_opus":0.04250689065343159,"score_gpt":0.2906611714301789,"score_spread":0.24815428077674728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087399459","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5637084,0.000108665656,0.40861207,0.00030650652,0.0001222574,0.00019035401,0.000007938891,0.00002714921,0.026916591],"genre_scores_gemma":[0.98382,0.000072413546,0.0152481375,0.000044538796,0.0004194682,0.000003336671,0.000015909573,0.000021708576,0.00035447744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786985,0.0005042881,0.00041895694,0.00013202957,0.0008179588,0.0002569373],"domain_scores_gemma":[0.9989212,0.00004782191,0.00003508029,0.00014592799,0.00068668305,0.00016326827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031944162,0.00009266587,0.00014397567,0.00042135356,0.0002832776,0.00007920122,0.00027479563,0.000027288086,0.00018025115],"category_scores_gemma":[0.0002264014,0.000075984506,0.00009360832,0.0005735392,0.00005973568,0.0003625374,0.00003884578,0.00056451437,0.00018820628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033022516,0.00008076642,0.0006854449,0.000027536222,0.000039423878,0.000021228683,0.00644496,0.96985406,0.009650719,0.00010572091,0.009291446,0.003765697],"study_design_scores_gemma":[0.0015647642,0.0008991537,0.18894893,0.00020294359,0.00002990556,0.00075763796,0.0023964392,0.7523235,0.001996791,0.00020270704,0.050153647,0.00052355445],"about_ca_topic_score_codex":0.000002366513,"about_ca_topic_score_gemma":0.000006362685,"teacher_disagreement_score":0.42011157,"about_ca_system_score_codex":0.00013107856,"about_ca_system_score_gemma":0.000064593456,"threshold_uncertainty_score":0.30985585},"labels":[],"label_agreement":null},{"id":"W2087852198","doi":"10.1016/j.ejor.2012.03.044","title":"A simple and effective metaheuristic for the Minimum Latency Problem","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":135,"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":"Metaheuristic; Mathematical optimization; Computer science; Travelling salesman problem; Iterated local search; Scheduling (production processes); Benchmark (surveying); Iterated function; Job shop scheduling; Variable neighborhood search; Simple (philosophy); Algorithm; Mathematics","score_opus":0.07068969871385707,"score_gpt":0.37249692924056277,"score_spread":0.3018072305267057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087852198","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.1813102,0.0056486456,0.7999343,0.0014359967,0.00048207096,0.0013381742,0.000020817386,0.00004586491,0.00978388],"genre_scores_gemma":[0.9527813,0.000093628405,0.04638804,0.00002511149,0.0005146125,0.000011207249,0.000001702107,0.000031879157,0.00015251689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982641,0.000836074,0.00026525935,0.000058571717,0.00034162047,0.00023438939],"domain_scores_gemma":[0.99735785,0.001903829,0.000036507667,0.000079944315,0.00051289157,0.000108965025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009760468,0.000069209505,0.00010115005,0.000107747095,0.00022800786,0.00010103046,0.00015852445,0.000012927064,0.000039281083],"category_scores_gemma":[0.0013866192,0.00004542273,0.00003981698,0.00016469056,0.00006072554,0.00021911,0.000041651838,0.00030969977,0.000012902231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004034032,0.00027059446,0.010813327,0.00044083723,0.0010396357,0.000049885177,0.009124483,0.71255136,0.042229094,0.019379351,0.047239967,0.15645805],"study_design_scores_gemma":[0.004010547,0.0014003334,0.18889053,0.00018774276,0.00016712936,0.0005408425,0.0008208087,0.65275985,0.0053742584,0.0013876813,0.1438799,0.0005803425],"about_ca_topic_score_codex":4.7119266e-7,"about_ca_topic_score_gemma":1.4567313e-7,"teacher_disagreement_score":0.7714711,"about_ca_system_score_codex":0.000037485755,"about_ca_system_score_gemma":0.000032384247,"threshold_uncertainty_score":0.3382803},"labels":[],"label_agreement":null},{"id":"W2089343656","doi":"10.1016/j.ejor.2015.02.004","title":"A study of the powerplay in one-day cricket","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sports Analytics and Performance","field":"Economics, Econometrics and Finance","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":"Simon Fraser University","funders":"","keywords":"Cricket; Computer science; Biology","score_opus":0.3174348592134423,"score_gpt":0.36340356663205686,"score_spread":0.045968707418614585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089343656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96230364,0.00036913957,0.00006330707,0.0009008234,0.00019396648,0.00010881311,0.0000069851517,6.704093e-7,0.036052663],"genre_scores_gemma":[0.99856377,0.000044663335,0.000061866864,0.00005358095,0.00015194294,7.149229e-7,5.667957e-7,0.000010248848,0.0011126525],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99849653,0.00023463581,0.00073591294,0.00010571974,0.00028298167,0.00014421633],"domain_scores_gemma":[0.99900955,0.00006300056,0.00023165053,0.00018594175,0.00043175838,0.00007811139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011639863,0.000052120733,0.00018318709,0.0003389505,0.00006765148,0.00006666256,0.00044089905,0.000011222547,0.00021362028],"category_scores_gemma":[0.0006778181,0.00003916762,0.000048422833,0.00043585224,0.000055583743,0.00017852122,0.00010374507,0.00037029962,0.00008604868],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013439874,0.0016237915,0.9127076,0.000009852246,0.00009076821,0.00015430228,0.01231569,0.015776541,0.000046477817,0.04344341,0.013061695,0.0006354636],"study_design_scores_gemma":[0.0017730703,0.0009915035,0.95796883,0.000047091555,0.000002578055,0.000020790349,0.0019021588,0.0019308607,0.000035421806,0.0011891351,0.034039162,0.00009938551],"about_ca_topic_score_codex":0.000057825375,"about_ca_topic_score_gemma":0.000032976557,"teacher_disagreement_score":0.045261234,"about_ca_system_score_codex":0.000072986695,"about_ca_system_score_gemma":0.00013328547,"threshold_uncertainty_score":0.40341675},"labels":[],"label_agreement":null},{"id":"W2090118375","doi":"10.1016/j.ejor.2006.05.009","title":"General solutions to the single vehicle routing problem with pickups and deliveries","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":106,"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":"Norges Forskningsråd","keywords":"Vehicle routing problem; Heuristics; Mathematical optimization; Tabu search; Computer science; Integer programming; Pickup; Routing (electronic design automation); Mathematics; Artificial intelligence","score_opus":0.06103351430024579,"score_gpt":0.3031094858809919,"score_spread":0.24207597158074612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090118375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73503137,0.0004282195,0.24704792,0.004342566,0.0000803414,0.00022253774,0.000007970798,0.00004209849,0.012796977],"genre_scores_gemma":[0.8812528,0.000013121701,0.11779565,0.000048752318,0.00043372568,0.0000019739764,0.0000020988962,0.000029237252,0.00042262962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982306,0.0006160886,0.0002975328,0.000092660914,0.00050922355,0.0002539322],"domain_scores_gemma":[0.9989999,0.00016464072,0.000034155557,0.00009719667,0.00061853015,0.00008556121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324766,0.00007847259,0.000086715365,0.00013139506,0.00045746425,0.0002758043,0.000185555,0.000011731857,0.000025083842],"category_scores_gemma":[0.00016966573,0.00005348637,0.000020241836,0.00032970897,0.0000835852,0.00020981696,0.00007396478,0.00033066142,0.0000139018675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002142202,0.000021514996,0.0008667354,0.0000062658637,0.000018754652,0.000025289606,0.00044149917,0.97272724,0.01572072,0.0028385897,0.0036227354,0.0036892297],"study_design_scores_gemma":[0.0028314572,0.002189079,0.20044214,0.00045567364,0.000050582512,0.0012005926,0.0011734074,0.688609,0.011150192,0.0003917278,0.090683304,0.00082281337],"about_ca_topic_score_codex":0.000012436899,"about_ca_topic_score_gemma":0.000021163272,"teacher_disagreement_score":0.2841182,"about_ca_system_score_codex":0.00007501023,"about_ca_system_score_gemma":0.00006510706,"threshold_uncertainty_score":0.35184914},"labels":[],"label_agreement":null},{"id":"W2090370952","doi":"10.1016/j.ejor.2013.10.002","title":"Fixed cost and resource allocation based on DEA cross-efficiency","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":207,"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":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Data envelopment analysis; Resource allocation; Computer science; Maximization; Resource (disambiguation); Mathematical optimization; Operations research; Mathematics","score_opus":0.19099251530014638,"score_gpt":0.4596566418996745,"score_spread":0.2686641265995281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090370952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9095474,0.00022280308,0.023921326,0.015308613,0.00015289152,0.00038048864,0.000007316506,0.000011790849,0.050447404],"genre_scores_gemma":[0.9947005,0.00000624066,0.001674118,0.0006273747,0.00018189888,0.00000283525,0.000004059811,0.000016995862,0.002785959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98955864,0.0036165887,0.0010689669,0.00038991813,0.0050191754,0.0003467086],"domain_scores_gemma":[0.990465,0.003864015,0.00029139384,0.00045693727,0.0046291808,0.00029351612],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.034622867,0.00012508646,0.00021413957,0.0011211878,0.00074659765,0.0020180414,0.0011271536,0.00003028647,0.0013469789],"category_scores_gemma":[0.021189181,0.000084704836,0.000104791114,0.0014129506,0.00048087336,0.0005859102,0.00014072518,0.000613501,0.0017763566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056739117,0.0013426645,0.033767167,0.000014965447,0.00006431171,0.000334808,0.0017137144,0.6078541,0.022410534,0.01382808,0.17313948,0.14496277],"study_design_scores_gemma":[0.0019012678,0.0016366636,0.39082387,0.00014057144,0.000012179259,0.00010221825,0.0006557373,0.4942582,0.0017389345,0.0010230764,0.10736606,0.00034121473],"about_ca_topic_score_codex":0.000009422353,"about_ca_topic_score_gemma":0.0000019316687,"teacher_disagreement_score":0.3570567,"about_ca_system_score_codex":0.00009540554,"about_ca_system_score_gemma":0.00039319808,"threshold_uncertainty_score":0.9995659},"labels":[],"label_agreement":null},{"id":"W2091143067","doi":"10.1016/j.ejor.2013.02.026","title":"Shortening cycle times in multi-product, capacitated production environments through quality level improvements and setup reduction","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Carleton University","funders":"","keywords":"Product (mathematics); Production (economics); Quality (philosophy); Computer science; Reduction (mathematics); Mathematical optimization; Nonlinear programming; Process (computing); Geometric programming; Investment (military); Reliability engineering; Operations research; Nonlinear system; Mathematics; Engineering; Economics","score_opus":0.20024556004061123,"score_gpt":0.3503208404782514,"score_spread":0.15007528043764018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091143067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892527,0.00012540027,0.000701634,0.0030501373,0.00043698473,0.00052967836,0.0000015622164,0.000009935396,0.0058919634],"genre_scores_gemma":[0.9937363,0.00005772291,0.0019181378,0.00019387991,0.00091548054,0.000011621637,0.000021277097,0.00002564806,0.0031198934],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99771756,0.00031221836,0.00059592683,0.00029815699,0.0007982,0.00027795092],"domain_scores_gemma":[0.9992348,0.000021353299,0.00019659546,0.0001615951,0.000359308,0.00002632934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046794424,0.00012912278,0.0001513672,0.00038296325,0.0002764226,0.0003864907,0.00021094158,0.000016172411,0.00037677822],"category_scores_gemma":[0.0004228428,0.00011271736,0.00003684937,0.00032023314,0.00014064435,0.0028825991,0.00018576859,0.0003694963,0.00022872355],"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.00077079586,0.0035315235,0.06740934,0.00072097377,0.00059717067,0.0002175898,0.005910807,0.017968126,0.59817487,0.011501332,0.13205047,0.16114698],"study_design_scores_gemma":[0.005038567,0.0002760571,0.8975538,0.00039027218,0.000043036904,0.000057814967,0.010235181,0.015048375,0.0050680395,0.002509501,0.06296269,0.0008166535],"about_ca_topic_score_codex":0.00033517752,"about_ca_topic_score_gemma":0.000008897089,"teacher_disagreement_score":0.83014446,"about_ca_system_score_codex":0.00011062828,"about_ca_system_score_gemma":0.000024734207,"threshold_uncertainty_score":0.45964807},"labels":[],"label_agreement":null},{"id":"W2091169026","doi":"10.1016/j.ejor.2009.12.021","title":"On competitive sequential location in a network with a decreasing demand intensity","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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 British Columbia","funders":"","keywords":"Profit (economics); Order (exchange); Position (finance); Graph; Mathematical optimization; Mathematical economics; Computer science; Enhanced Data Rates for GSM Evolution; Mathematics; Economics; Microeconomics; Combinatorics; Artificial intelligence","score_opus":0.055858379932600205,"score_gpt":0.3165959480873473,"score_spread":0.26073756815474713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091169026","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9677792,0.000019474379,0.00077243836,0.00077192986,0.00019154765,0.0001091587,2.6247082e-7,0.000005192233,0.030350778],"genre_scores_gemma":[0.9978063,0.0000030016465,0.0007454468,0.00025153093,0.0011119413,9.269821e-7,0.0000051137386,0.000015666315,0.000060050956],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9986253,0.00019389633,0.00026878336,0.00012553099,0.00058312976,0.00020337281],"domain_scores_gemma":[0.9981063,0.0001982475,0.000106828535,0.00009230904,0.0014714979,0.00002482104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055082426,0.0000799873,0.00011848647,0.0003595744,0.00023698977,0.00038338196,0.00018654916,0.000015099257,0.0002539825],"category_scores_gemma":[0.0006711782,0.00006184184,0.000027158832,0.00052382646,0.00009839443,0.00054260116,0.00008473935,0.0008143637,0.00006549402],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009045259,0.00088684564,0.6821944,0.00013150816,0.0001383536,0.0035179951,0.0007649983,0.012204261,0.018412603,0.20471635,0.0073148096,0.0606726],"study_design_scores_gemma":[0.0017912834,0.0001906892,0.9818026,0.00056599197,0.000023641138,0.0001681537,0.00025070563,0.0031462815,0.0000973188,0.0009128592,0.01085113,0.00019937921],"about_ca_topic_score_codex":0.00006199483,"about_ca_topic_score_gemma":0.00033089033,"teacher_disagreement_score":0.29960814,"about_ca_system_score_codex":0.000028166092,"about_ca_system_score_gemma":0.00012702284,"threshold_uncertainty_score":0.3696961},"labels":[],"label_agreement":null},{"id":"W2092309000","doi":"10.1016/s0377-2217(01)00134-5","title":"MRP performance effects due to forecast bias and demand uncertainty","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","cited_by":81,"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":"Safety stock; Stock (firearms); Lead time; Operations research; Demand forecasting; Computer science; Inventory management; Econometrics; Production (economics); Operations management; Economics; Business; Microeconomics; Marketing; Supply chain; Engineering","score_opus":0.38811084445789057,"score_gpt":0.44624068027433167,"score_spread":0.0581298358164411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092309000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689696,0.0001857006,0.007873606,0.004510439,0.000067186906,0.00023088894,0.00000510538,0.0000096548,0.018147856],"genre_scores_gemma":[0.98749614,0.000056483634,0.009679518,0.00021389879,0.0002628032,0.000005022226,6.754248e-7,0.000012946155,0.0022725407],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.996207,0.00094610977,0.00058607664,0.00022991694,0.0017852979,0.00024560507],"domain_scores_gemma":[0.9961322,0.0016905743,0.00012118087,0.00025220047,0.0015261924,0.00027767167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014687577,0.00008921165,0.0001738792,0.00045266788,0.00048458047,0.00049450336,0.0006828437,0.000017938899,0.0004000974],"category_scores_gemma":[0.006155132,0.00005911205,0.000053110325,0.0007760916,0.00014929139,0.00029773134,0.00022809673,0.00037918027,0.0004431512],"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.00015791589,0.00023551959,0.0070714294,0.000025224223,0.000033425178,0.0003691322,0.0019025176,0.0071279146,0.003647654,0.010631617,0.42504916,0.5437485],"study_design_scores_gemma":[0.0018433561,0.005634504,0.22354192,0.0005340937,0.000015775306,0.0025958412,0.0003581603,0.16605945,0.005296565,0.0067164623,0.5868296,0.0005742651],"about_ca_topic_score_codex":0.0000026870266,"about_ca_topic_score_gemma":0.0000026475182,"teacher_disagreement_score":0.5431742,"about_ca_system_score_codex":0.000040182837,"about_ca_system_score_gemma":0.000049448518,"threshold_uncertainty_score":0.73687124},"labels":[],"label_agreement":null},{"id":"W2094165722","doi":"10.1016/j.ejor.2004.07.007","title":"Price limits and capital requirements of futures clearinghouses","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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":"McMaster University; Concordia University","funders":"Concordia University; Ottawa Hospital Research Institute","keywords":"Futures contract; Economics; Market liquidity; Capital requirement; Capital (architecture); Financial economics; Econometrics; Monetary economics; Microeconomics","score_opus":0.1272917525481836,"score_gpt":0.32833223487012025,"score_spread":0.20104048232193666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094165722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8889442,0.0032205437,0.087356254,0.0017385021,0.00012216708,0.00013982502,0.000033005887,0.000004553361,0.01844094],"genre_scores_gemma":[0.9951832,0.00024102598,0.0041918103,0.000051021678,0.00022990239,0.0000015671634,0.0000013987612,0.000012817146,0.000087251276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990697,0.000017964938,0.0005089877,0.00012438337,0.00014043604,0.00013852405],"domain_scores_gemma":[0.9991985,0.000056388628,0.00020617725,0.00009107192,0.0003698953,0.00007796974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016767951,0.00005494157,0.0001460549,0.00021301188,0.00016824206,0.00006382266,0.00021878412,0.000015722448,0.000035506204],"category_scores_gemma":[0.0005772692,0.000053421256,0.00003667547,0.0002032683,0.00010874146,0.0002048569,0.00006138587,0.00019981126,0.000066276676],"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.00003551608,0.00010970726,0.0009061073,0.000017957263,0.000023784472,0.000011653577,0.0008546593,0.00021097479,0.0008778042,0.9956082,0.00015443313,0.0011891931],"study_design_scores_gemma":[0.003370887,0.0020694186,0.55164635,0.00022340642,0.0000098918745,0.00018360333,0.0010159429,0.00010582515,0.0019500623,0.41945443,0.019601956,0.0003682372],"about_ca_topic_score_codex":0.000021100892,"about_ca_topic_score_gemma":0.0000027718554,"teacher_disagreement_score":0.5761538,"about_ca_system_score_codex":0.000043441425,"about_ca_system_score_gemma":0.00009144787,"threshold_uncertainty_score":0.21784556},"labels":[],"label_agreement":null},{"id":"W2094377372","doi":"10.1016/j.ejor.2011.07.056","title":"A note on replacement policy for a system subject to non-homogeneous pure birth shocks","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Reliability and Maintenance Optimization","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homogeneous; Computer science; Subject (documents); Type (biology); Process (computing); Operations research; Mathematics; Geology","score_opus":0.050028334555752896,"score_gpt":0.31568662808074194,"score_spread":0.26565829352498904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094377372","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.4087915,0.00012900085,0.49210885,0.001982801,0.0008679612,0.0019331858,0.00007602107,0.00009260484,0.09401806],"genre_scores_gemma":[0.98767316,0.000040338502,0.010866252,0.00008962649,0.00056665036,0.000017162505,0.000004292851,0.000044701876,0.0006978263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983805,0.00022899438,0.00041443773,0.00014424733,0.00054019,0.0002916206],"domain_scores_gemma":[0.9985878,0.00011117352,0.000040343995,0.00019607115,0.0008754392,0.00018916688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032393606,0.000106306536,0.00014618544,0.00040503626,0.00015171978,0.000084198495,0.00027772176,0.000024209203,0.0000477083],"category_scores_gemma":[0.00065967377,0.00008649576,0.000078002755,0.00029023178,0.000026759706,0.0001162395,0.000039107097,0.00027265542,0.00009689647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027938616,0.00020720513,0.00015843101,0.00033773453,0.0001340216,0.00024975857,0.004977655,0.9316467,0.012104373,0.013754822,0.024317412,0.009317992],"study_design_scores_gemma":[0.012072823,0.033094566,0.018664507,0.0037312445,0.0000737667,0.0015780212,0.0034433235,0.628256,0.08169703,0.0006326285,0.21475998,0.0019960785],"about_ca_topic_score_codex":0.000005946037,"about_ca_topic_score_gemma":0.000003976126,"teacher_disagreement_score":0.5788816,"about_ca_system_score_codex":0.00036703996,"about_ca_system_score_gemma":0.00020482147,"threshold_uncertainty_score":0.3527195},"labels":[],"label_agreement":null},{"id":"W2094566145","doi":"10.1016/j.ejor.2012.05.029","title":"A diversified Tabu search approach for the open-pit mine production scheduling problem with metal uncertainty","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Mining Techniques and Economics","field":"Engineering","cited_by":161,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tabu search; Metaheuristic; Guided Local Search; Mathematical optimization; Computer science; Scheduling (production processes); Exploit; Variable neighborhood search; Mathematics","score_opus":0.16204917188519696,"score_gpt":0.33215614068170296,"score_spread":0.170106968796506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094566145","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7048776,0.0012497791,0.26138344,0.0020325936,0.00036291755,0.002276066,0.000024819794,0.000064679574,0.027728088],"genre_scores_gemma":[0.86487406,0.00007283703,0.1337431,0.000015229189,0.0007309329,0.000020746469,0.000011325583,0.000034751934,0.00049698324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868226,0.00021600792,0.0002831795,0.000115977695,0.00037523507,0.00032731783],"domain_scores_gemma":[0.99901015,0.00014570012,0.000044853023,0.00016243839,0.00052360405,0.00011327749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009158479,0.00009459536,0.00013370598,0.00012871111,0.00035457202,0.00024755052,0.0005792539,0.000017422173,0.0000616622],"category_scores_gemma":[0.00012825486,0.00005963834,0.00004549563,0.00018098638,0.00008019548,0.0005876078,0.00015182304,0.0004797125,0.000009053233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046402618,0.00015021225,0.00062921026,0.00008082322,0.00028241525,0.000005867613,0.0017769801,0.9678297,0.0048475247,0.0057950676,0.0129459305,0.0051922384],"study_design_scores_gemma":[0.004780506,0.0028978244,0.006229665,0.0003677652,0.00015759784,0.0010831943,0.007613407,0.8373231,0.015327193,0.00019138504,0.12304527,0.0009830437],"about_ca_topic_score_codex":0.000007396609,"about_ca_topic_score_gemma":0.000001640857,"teacher_disagreement_score":0.15999648,"about_ca_system_score_codex":0.00011180931,"about_ca_system_score_gemma":0.00009756361,"threshold_uncertainty_score":0.31741643},"labels":[],"label_agreement":null},{"id":"W2094854597","doi":"10.1016/j.ejor.2010.10.025","title":"Effectiveness of retail joint promotions under different channel structures","year":2010,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":39,"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 Ontario Institute of Technology","funders":"","keywords":"Business; Incentive; Channel (broadcasting); Promotion (chess); Industrial organization; Supply chain; Channel coordination; Microeconomics; Joint (building); Marketing; Economics; Supply chain management; Telecommunications","score_opus":0.1054129163056565,"score_gpt":0.3153376148447297,"score_spread":0.20992469853907322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094854597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9717485,0.000043168093,0.0013927111,0.0015672675,0.00074589223,0.0002898524,0.0000024276396,0.000009863157,0.02420034],"genre_scores_gemma":[0.9981189,0.000007755891,0.00011891982,0.000100134115,0.0012018174,0.000003652852,0.0000122271385,0.000025107682,0.0004114899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978296,0.00036560683,0.00044051316,0.00015509238,0.0009896711,0.00021947612],"domain_scores_gemma":[0.9981979,0.000115906645,0.00018885461,0.00018862821,0.0012748194,0.000033856842],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0057259337,0.000117046744,0.0001906882,0.0005713799,0.0002423625,0.00025947788,0.00040007834,0.000021864065,0.0011982546],"category_scores_gemma":[0.00056127715,0.0000846,0.00011277386,0.0002912171,0.00016574643,0.0005617348,0.00024019102,0.00059439556,0.00007357883],"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.0004863701,0.00103903,0.004409262,0.0010189023,0.00034539745,0.00016841012,0.00025918486,0.0039212634,0.3025682,0.66733456,0.01423358,0.004215852],"study_design_scores_gemma":[0.0029669092,0.00041934053,0.9276873,0.0004803911,0.000059765127,0.000044056407,0.000733691,0.0031920709,0.012055354,0.024532124,0.027441313,0.000387666],"about_ca_topic_score_codex":0.00001288451,"about_ca_topic_score_gemma":0.0000067153915,"teacher_disagreement_score":0.92327803,"about_ca_system_score_codex":0.00003348202,"about_ca_system_score_gemma":0.000054883938,"threshold_uncertainty_score":0.9997148},"labels":[],"label_agreement":null},{"id":"W2094896680","doi":"10.1016/s0377-2217(03)00158-9","title":"Multicriteria optimization of a single-cell oil production","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Control Systems Optimization","field":"Engineering","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":"Université Laval","funders":"","keywords":"Mathematical optimization; Bioprocess; Multi-objective optimization; Ranking (information retrieval); Computer science; Representation (politics); Production (economics); Pareto principle; Domain (mathematical analysis); Genetic algorithm; Mathematics; Machine learning; Engineering","score_opus":0.047336442500549934,"score_gpt":0.28888702160045565,"score_spread":0.2415505790999057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094896680","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.1474645,0.0019302452,0.77164125,0.00031571146,0.0015239138,0.00032185958,0.000008824352,0.00006175601,0.076731965],"genre_scores_gemma":[0.9380257,0.00011547428,0.060941406,0.0000047864796,0.00022400708,0.0000019663987,0.000004859921,0.00004005357,0.00064172567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785036,0.000753722,0.0005637687,0.00009980214,0.0005678994,0.00016447197],"domain_scores_gemma":[0.99817777,0.00008613903,0.00010447561,0.00013118959,0.0014269635,0.00007345526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024288488,0.00008612655,0.00014405992,0.00028470517,0.00007762834,0.000055579087,0.00013834743,0.000020095162,0.000088272376],"category_scores_gemma":[0.0010777183,0.00008106287,0.000042613246,0.00031704447,0.000047160494,0.00042934663,0.000012213828,0.0002250211,0.000016292512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023464261,0.000052138475,0.000020050222,0.00003696928,0.000013352254,0.000008805245,0.0001714372,0.81728685,0.180869,0.000120835924,0.00034664443,0.0010504785],"study_design_scores_gemma":[0.0061614634,0.0014996242,0.00045217108,0.00079172116,0.00004937347,0.0005829406,0.0010034811,0.62171537,0.34307247,0.000098077384,0.023854598,0.00071872433],"about_ca_topic_score_codex":3.7720093e-7,"about_ca_topic_score_gemma":3.0517702e-7,"teacher_disagreement_score":0.7905612,"about_ca_system_score_codex":0.00011096077,"about_ca_system_score_gemma":0.00006747179,"threshold_uncertainty_score":0.33056477},"labels":[],"label_agreement":null},{"id":"W2097428991","doi":"10.1016/j.ejor.2008.07.023","title":"A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":94,"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":"Heuristics; Heuristic; Hyper-heuristic; Computer science; Mathematical optimization; Null-move heuristic; Consistent heuristic; Set (abstract data type); Algorithm; Mathematics; Incremental heuristic search; Artificial intelligence; Beam search; Search algorithm","score_opus":0.5359042032405876,"score_gpt":0.4791834452571304,"score_spread":0.056720757983457215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097428991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74533695,0.0013908828,0.24711654,0.0012537265,0.00074144104,0.0023678034,0.00008446305,0.000015429918,0.0016927378],"genre_scores_gemma":[0.99173266,0.000033588334,0.00513567,0.00001155023,0.00028543096,0.00005212611,0.000008505144,0.000023671328,0.0027168286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922675,0.0029130797,0.0014752267,0.00026986355,0.002768817,0.0003055214],"domain_scores_gemma":[0.9713786,0.015866823,0.0005029555,0.00033672884,0.011798408,0.00011647582],"candidate_categories":["metaresearch","sts"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.040930383,0.00011536237,0.0003159582,0.00086091156,0.0016426486,0.00035279134,0.0009463626,0.000023524852,0.000030761228],"category_scores_gemma":[0.034982268,0.00007153116,0.00014712095,0.0013354644,0.00024253069,0.00032004857,0.00007077714,0.0003650107,0.000035611072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013520704,0.010533805,0.00535516,0.00013558539,0.0013289381,0.0001487145,0.028928969,0.7525313,0.0064999396,0.0720631,0.10026826,0.02085416],"study_design_scores_gemma":[0.023397537,0.017045066,0.19839124,0.00046804015,0.00052588526,0.0015521012,0.044292394,0.6537189,0.00042168782,0.009786323,0.04955902,0.00084184477],"about_ca_topic_score_codex":0.000015173041,"about_ca_topic_score_gemma":0.0000039329816,"teacher_disagreement_score":0.24639565,"about_ca_system_score_codex":0.00006377721,"about_ca_system_score_gemma":0.00049821305,"threshold_uncertainty_score":0.9996571},"labels":[],"label_agreement":null},{"id":"W2097955291","doi":"10.1016/s0377-2217(00)00040-0","title":"Project evaluation and selection in a network of collaboration: A consensual disaggregation multi-criterion approach","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":37,"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":"Selection (genetic algorithm); Computer science; Set (abstract data type); Operations research; Management science; Resentment; Project management; Process management; Business; Economics; Political science; Management; Artificial intelligence; Engineering","score_opus":0.5159412359458836,"score_gpt":0.5604851938150975,"score_spread":0.044543957869213946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097955291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9660324,0.0005065156,0.029942412,0.00073764764,0.00016834156,0.00070807885,0.000006183589,0.0000048320967,0.0018935795],"genre_scores_gemma":[0.97031134,0.000078660545,0.028893197,0.000035123463,0.0003762974,0.000008022603,0.00000636216,0.000016707632,0.0002742582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9844202,0.008696191,0.0017248034,0.00039103357,0.004489529,0.00027825354],"domain_scores_gemma":[0.990085,0.0016500247,0.0005543254,0.0001586456,0.0074501107,0.000101867634],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.055492587,0.0001292389,0.00031338274,0.001053482,0.00027135067,0.0006342508,0.0003999085,0.000046904952,0.00016966542],"category_scores_gemma":[0.018868065,0.00010057903,0.000058894424,0.003037889,0.00019867465,0.000962829,0.00013494022,0.00043107494,0.00001696744],"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.0061202333,0.0019339074,0.14735849,0.00005857824,0.00012877287,0.00032389793,0.019089678,0.17002007,0.09573512,0.0050152466,0.026285209,0.5279308],"study_design_scores_gemma":[0.004443457,0.0007862254,0.3287773,0.00025430595,0.000013579897,0.000620863,0.0037914182,0.6528228,0.00024866962,0.0011187205,0.00691952,0.00020310067],"about_ca_topic_score_codex":0.000014804685,"about_ca_topic_score_gemma":0.00005962307,"teacher_disagreement_score":0.52772766,"about_ca_system_score_codex":0.00019165743,"about_ca_system_score_gemma":0.00089414703,"threshold_uncertainty_score":0.98939645},"labels":[],"label_agreement":null},{"id":"W2099860183","doi":"10.1016/j.ejor.2009.06.034","title":"An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":272,"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":"Vehicle routing problem; Column generation; Mathematical optimization; Benchmark (surveying); Computer science; Routing (electronic design automation); Shortest path problem; Lagrangian relaxation; Set (abstract data type); Linear programming; Dynamic programming; Mathematics; Computer network","score_opus":0.06359111993787328,"score_gpt":0.3323522610403489,"score_spread":0.2687611411024756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099860183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60983163,0.000106881525,0.38895342,0.00024879305,0.000021690474,0.0003763297,0.000022120004,0.00003625351,0.00040289262],"genre_scores_gemma":[0.5798408,0.000013742621,0.41992632,0.0000171604,0.00011245318,7.245367e-7,0.0000048643965,0.00002740337,0.00005652455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804664,0.0006389552,0.0004423163,0.00013033676,0.00050475996,0.00023701729],"domain_scores_gemma":[0.9981675,0.00054107775,0.00008691329,0.00012468526,0.0009323222,0.00014750626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041287774,0.00010580657,0.00018566125,0.00020981877,0.00015669645,0.00018961122,0.00017947012,0.000023625184,0.000013655309],"category_scores_gemma":[0.00040040998,0.000087440014,0.000034786437,0.00023192585,0.000065518165,0.00063322793,0.00001916371,0.00030558277,0.000002726229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014582185,0.00010396243,0.0013063278,0.000022511971,0.000055375665,0.000033155477,0.000698733,0.7455714,0.11445777,0.00012515782,0.00031240747,0.13716741],"study_design_scores_gemma":[0.001231776,0.0011297185,0.013494716,0.00011299291,0.000008327923,0.00006293878,0.000059409154,0.97646403,0.006857392,0.000021791244,0.00044746874,0.0001094188],"about_ca_topic_score_codex":0.0000017463523,"about_ca_topic_score_gemma":3.4207832e-7,"teacher_disagreement_score":0.23089267,"about_ca_system_score_codex":0.00004178917,"about_ca_system_score_gemma":0.00008057009,"threshold_uncertainty_score":0.35657004},"labels":[],"label_agreement":null},{"id":"W2103676410","doi":"10.1016/j.ejor.2013.05.024","title":"Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach","year":2013,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":163,"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":"Column generation; Vehicle routing problem; Branch and price; Computer science; Mathematical optimization; Column (typography); Operations research; Shortest path problem; Integer programming; Integer (computer science); Set (abstract data type); Routing (electronic design automation); Service (business); Mathematics; Economics","score_opus":0.0456891675178521,"score_gpt":0.28375451622333697,"score_spread":0.23806534870548487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103676410","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.44945183,0.00033067632,0.54802614,0.00029292866,0.000021898382,0.0002516359,0.0000022399806,0.00001912758,0.0016035095],"genre_scores_gemma":[0.9443302,0.000032285552,0.054991435,0.00003013895,0.00024334858,0.0000049250107,0.000005845319,0.0000394901,0.0003223153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981491,0.0006411482,0.00033519117,0.00016509018,0.0004766422,0.0002328387],"domain_scores_gemma":[0.9989504,0.00022495553,0.000060725622,0.00008146565,0.000511993,0.00017043506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003197468,0.00011613713,0.00016044255,0.00017685513,0.0003035308,0.00037689088,0.00009381967,0.000030178946,0.00005742997],"category_scores_gemma":[0.00034253372,0.00010027608,0.0000151345785,0.0001980217,0.00012989056,0.00052057195,0.00005289943,0.00040813864,0.000018012424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000641708,0.00006002508,0.0006963745,0.000072940325,0.000114602786,0.000014489366,0.0027991598,0.7958131,0.17984527,0.0004375706,0.0015076004,0.018574718],"study_design_scores_gemma":[0.00079129654,0.00019248512,0.015778432,0.000050595867,0.000009555417,0.00023398988,0.000119970886,0.9824321,0.0002344125,0.000016186974,0.000025764737,0.000115174706],"about_ca_topic_score_codex":0.0000054701895,"about_ca_topic_score_gemma":4.884592e-7,"teacher_disagreement_score":0.49487838,"about_ca_system_score_codex":0.000051961684,"about_ca_system_score_gemma":0.00006649751,"threshold_uncertainty_score":0.40891397},"labels":[],"label_agreement":null},{"id":"W2121442838","doi":"10.1016/s0377-2217(03)00170-x","title":"Equity in international greenhouse gases abatement scenarios: A multicriteria approach","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":83,"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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Greenhouse gas; Equity (law); Compromise; Climate change; Environmental economics; Global warming; Sustainable development; Climate change mitigation; Process (computing); Developing country; Economics; Natural resource economics; Business; Environmental resource management; Computer science; Economic growth; Political science","score_opus":0.40460573791226007,"score_gpt":0.414379998791305,"score_spread":0.009774260879044927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121442838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6815816,0.001029488,0.0023136549,0.002602813,0.0007414958,0.00025175198,0.00014345202,0.00000776552,0.31132793],"genre_scores_gemma":[0.99387974,0.0005407638,0.004446777,0.00022437934,0.0003219203,0.000004563671,0.000014935345,0.000024995274,0.00054191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99804884,0.0002732977,0.00096927915,0.00022024999,0.0001523791,0.00033592913],"domain_scores_gemma":[0.9991777,0.00010970843,0.00021751932,0.00015557144,0.00020629122,0.00013321631],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008920463,0.00010180493,0.00023139176,0.0006556448,0.00011732928,0.00026586468,0.00044640203,0.000025441968,0.0015145957],"category_scores_gemma":[0.0012432488,0.000107378626,0.0000842537,0.00018981921,0.000082238745,0.00043972462,0.00015281775,0.00039142926,0.00044025888],"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.0006332899,0.0034851723,0.11310696,0.00016574745,0.0003752788,0.00063772337,0.012626323,0.015619486,0.001448731,0.82878065,0.01832949,0.004791169],"study_design_scores_gemma":[0.018182138,0.0018908506,0.22818825,0.00050379854,0.000015138993,0.0011010398,0.006503197,0.053038914,0.0011783123,0.031235728,0.6563016,0.0018610155],"about_ca_topic_score_codex":0.000051328654,"about_ca_topic_score_gemma":0.000016716096,"teacher_disagreement_score":0.7975449,"about_ca_system_score_codex":0.00035912998,"about_ca_system_score_gemma":0.00007946421,"threshold_uncertainty_score":0.9993982},"labels":[],"label_agreement":null},{"id":"W2122672261","doi":"10.1016/j.ejor.2008.05.011","title":"Additive efficiency decomposition in two-stage DEA","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":684,"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":"China Scholarship Council; Worcester Polytechnic Institute","keywords":"Data envelopment analysis; Returns to scale; Decomposition; Stage (stratigraphy); Efficiency; Constant (computer programming); Process (computing); Product (mathematics); Computer science; Econometrics; Additive model; Scale (ratio); Operations research; Economics; Mathematical optimization; Mathematics; Statistics; Production (economics); Microeconomics","score_opus":0.23002185385976237,"score_gpt":0.5026539069179089,"score_spread":0.27263205305814653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122672261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9401576,0.00020045636,0.012043724,0.001428634,0.0001545143,0.00010633175,0.0000120352,0.000005257176,0.045891427],"genre_scores_gemma":[0.99487066,0.000045283716,0.002476307,0.00014332728,0.00026713236,9.487463e-7,0.0000044463955,0.00001460112,0.0021773023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9871339,0.005417423,0.001400175,0.000363484,0.0052938825,0.0003910929],"domain_scores_gemma":[0.99276775,0.0028867791,0.0003077503,0.00032882486,0.003509221,0.0001996452],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.033434123,0.0001195168,0.0002810451,0.0019432406,0.0006212296,0.00031895738,0.0012889586,0.000017705928,0.0010072973],"category_scores_gemma":[0.010669654,0.00008787687,0.00016439815,0.0026598568,0.00043539327,0.0007121277,0.00018041879,0.000809344,0.0010760919],"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.0015266162,0.0038676318,0.07535941,0.000010957232,0.00015517455,0.023677776,0.016480364,0.6282749,0.06858086,0.030493347,0.10101287,0.050560094],"study_design_scores_gemma":[0.0075443783,0.0028562157,0.7855924,0.00037096918,0.000023513485,0.0030089652,0.0042700167,0.102617696,0.009065306,0.0043814834,0.07928469,0.0009843827],"about_ca_topic_score_codex":0.000018661975,"about_ca_topic_score_gemma":0.000026235912,"teacher_disagreement_score":0.710233,"about_ca_system_score_codex":0.00018474381,"about_ca_system_score_gemma":0.0006711298,"threshold_uncertainty_score":0.99990594},"labels":[],"label_agreement":null},{"id":"W2124804420","doi":"10.1016/j.ejor.2007.11.043","title":"A dynamic model for advertising and pricing competition between national and store brands","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":115,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Advertising; National brand; Business; Private label; Competition (biology); Revenue; Differential game; Marketing","score_opus":0.08476004093805813,"score_gpt":0.3616258474403189,"score_spread":0.2768658065022608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124804420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9198543,0.00021774518,0.07313745,0.0008995087,0.000052449253,0.0001479151,0.0000045185084,0.0000070614315,0.0056790514],"genre_scores_gemma":[0.9963895,0.000016858332,0.0027699927,0.00013980265,0.00044819264,6.9051055e-7,0.000015137298,0.000017222883,0.00020259405],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9987305,0.000051665662,0.0003291739,0.00012251329,0.0005856913,0.00018049538],"domain_scores_gemma":[0.99840057,0.00035069475,0.00010170782,0.000037802125,0.0010797043,0.00002952668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007854448,0.00007419278,0.00011123495,0.00046239205,0.00042327755,0.00032405587,0.00009915704,0.000016065651,0.000026197857],"category_scores_gemma":[0.00045912646,0.000066925626,0.000031659692,0.00017399606,0.00007020245,0.0007621089,0.00008943899,0.0002381314,0.000003971442],"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.0022498453,0.00031428222,0.33832285,0.00090337737,0.000275099,0.00021450616,0.0023034264,0.0054162308,0.049336802,0.05997291,0.005561219,0.5351294],"study_design_scores_gemma":[0.0019987016,0.00006988854,0.78609675,0.00024372111,0.00004331469,0.00005055957,0.0002329553,0.20206454,0.000026050282,0.0014687632,0.007509323,0.0001954153],"about_ca_topic_score_codex":0.0000055677638,"about_ca_topic_score_gemma":0.000013917477,"teacher_disagreement_score":0.53493404,"about_ca_system_score_codex":0.000044305656,"about_ca_system_score_gemma":0.00006499425,"threshold_uncertainty_score":0.32555515},"labels":[],"label_agreement":null},{"id":"W2126371856","doi":"10.1016/j.ejor.2005.03.010","title":"An application of DPCA to oil data for CBM modeling","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Fault Detection and Control Systems","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":"University of Toronto; University of New Brunswick","funders":"","keywords":"Principal component analysis; Dimensionality reduction; Computer science; Covariate; Autocorrelation; Multivariate statistics; Data mining; Curse of dimensionality; Data set; Artificial intelligence; Statistics; Machine learning; Mathematics","score_opus":0.11144519213809996,"score_gpt":0.3865966990733528,"score_spread":0.27515150693525287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126371856","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.18000084,0.00032225446,0.81181294,0.0014418918,0.00017927535,0.00021461552,0.00007820893,0.000026998254,0.0059229857],"genre_scores_gemma":[0.99181086,0.000022969029,0.0069869882,0.00003739649,0.0009398925,0.0000049754235,0.00001690514,0.000022950135,0.00015708024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874103,0.00017447762,0.00040138114,0.00010073472,0.0004536129,0.0001287597],"domain_scores_gemma":[0.9988903,0.00005909381,0.000029660763,0.00027461725,0.00062580855,0.00012056287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034975659,0.000052294592,0.00010098265,0.00018627333,0.000077908415,0.000066601635,0.00049077306,0.0000128190195,0.000021289652],"category_scores_gemma":[0.00015335898,0.00004698732,0.00002746763,0.00012321654,0.000010863752,0.00033199275,0.000030867337,0.00015951127,0.000051464514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068632864,0.000025203084,0.00000614221,0.000020659965,0.000020250434,0.0000011609777,0.00014342128,0.878064,0.06434975,0.00040023157,0.0023253735,0.054575212],"study_design_scores_gemma":[0.00034363774,0.00013518042,0.000044368408,0.000022172451,0.0000024016738,0.0000129483315,0.00007561349,0.91273886,0.0007936862,0.000005393427,0.085781865,0.000043877528],"about_ca_topic_score_codex":0.000003958086,"about_ca_topic_score_gemma":0.000010389906,"teacher_disagreement_score":0.81181,"about_ca_system_score_codex":0.00004770688,"about_ca_system_score_gemma":0.000050069186,"threshold_uncertainty_score":0.19160873},"labels":[],"label_agreement":null},{"id":"W2128012538","doi":"10.1016/j.ejor.2008.11.019","title":"Inexact de Novo programming for water resources systems planning","year":2008,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","field":"Engineering","cited_by":53,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Water Network","keywords":"Flexibility (engineering); Computer science; Mathematical optimization; Interval (graph theory); Budget constraint; Limit (mathematics); Linear programming; Revenue; Water resources; Operations research; Mathematics; Algorithm; Economics","score_opus":0.09151735004140345,"score_gpt":0.3065427271023481,"score_spread":0.21502537706094466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128012538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9120149,0.0005570882,0.076047145,0.00022195086,0.00015872245,0.00030367862,0.000002308616,0.000044849017,0.010649341],"genre_scores_gemma":[0.9925904,0.000032422475,0.004530471,0.000014435506,0.0007879186,0.0000066135926,0.000013624055,0.000039833893,0.0019842784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986223,0.00021558833,0.0003222854,0.0000775885,0.0004598919,0.0003023625],"domain_scores_gemma":[0.99940187,0.000073996394,0.000027311737,0.00007252592,0.00033490852,0.00008938125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002545958,0.000079743106,0.000104920764,0.0002900659,0.0002704965,0.0002162758,0.00023501799,0.000016044596,0.000024028162],"category_scores_gemma":[0.00008158507,0.000057407517,0.00004688229,0.000109905195,0.00004204189,0.00023680518,0.00003937006,0.00023996417,0.000019085941],"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.00006119703,0.000018464862,0.0008455192,0.000052462507,0.000051322975,0.00023315169,0.0033368927,0.98481184,0.0021159386,0.00004688902,0.008013341,0.00041297727],"study_design_scores_gemma":[0.0013803012,0.0005002726,0.0027878508,0.0002115364,0.000013069615,0.00049331726,0.0005633908,0.18606007,0.0016874195,0.0000117394875,0.806067,0.00022402884],"about_ca_topic_score_codex":0.0000010924356,"about_ca_topic_score_gemma":1.356357e-7,"teacher_disagreement_score":0.7987518,"about_ca_system_score_codex":0.0000674127,"about_ca_system_score_gemma":0.000016161708,"threshold_uncertainty_score":0.23410106},"labels":[],"label_agreement":null},{"id":"W2130625409","doi":"10.1016/j.ejor.2012.01.022","title":"Relative efficiency measurement: The problem of a missing output in a subset of decision making units","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"","keywords":"Data envelopment analysis; Set (abstract data type); Missing data; Efficiency; Computer science; Data set; Mathematical optimization; Mathematics; Statistics; Artificial intelligence","score_opus":0.4136293626168012,"score_gpt":0.470557383246712,"score_spread":0.05692802062991076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130625409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108037,0.002448387,0.069618456,0.0020112875,0.00012746495,0.00027121184,0.000006481923,0.0000025409156,0.014710506],"genre_scores_gemma":[0.99178165,0.0000130157805,0.007980838,0.00002711903,0.00009439625,5.5944867e-7,3.4650188e-7,0.000012273963,0.000089793415],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9819463,0.0067095184,0.0020776817,0.00021959271,0.0086514,0.00039549914],"domain_scores_gemma":[0.9857709,0.0046237432,0.00081441936,0.00036796217,0.008307754,0.000115212126],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.1229296,0.00011162507,0.00034353425,0.0014017939,0.0003136416,0.00017463879,0.0013989442,0.000027259375,0.000090249305],"category_scores_gemma":[0.032473464,0.00006317076,0.00013256211,0.0042876764,0.0003625753,0.0007406336,0.0002467937,0.0006849549,0.00004439199],"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.0023326222,0.0034952452,0.14062516,0.00008114736,0.00034770393,0.00042672895,0.0846958,0.17733215,0.050242737,0.04122666,0.013369642,0.48582438],"study_design_scores_gemma":[0.0051341425,0.002827688,0.8610822,0.006715935,0.00013486289,0.0007144681,0.017776761,0.04815566,0.00947737,0.026373262,0.020790428,0.0008171984],"about_ca_topic_score_codex":0.0000067597116,"about_ca_topic_score_gemma":0.000008839384,"teacher_disagreement_score":0.7204571,"about_ca_system_score_codex":0.00014236038,"about_ca_system_score_gemma":0.00075910066,"threshold_uncertainty_score":0.9756764},"labels":[],"label_agreement":null},{"id":"W2132965194","doi":"10.1016/j.ejor.2011.04.022","title":"Mining axiomatic fuzzy set association rules for classification problems","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Interpretability; Association rule learning; Computer science; Data mining; Axiom; Classifier (UML); Fuzzy logic; Fuzzy rule; Artificial intelligence; Fuzzy set; Rough set; Machine learning; Class (philosophy); Mathematics","score_opus":0.27293754368649475,"score_gpt":0.377612287166583,"score_spread":0.10467474348008826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132965194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053170994,0.0001355642,0.91844946,0.0046865,0.00029265153,0.00047655782,0.000043348,0.00003857891,0.022706358],"genre_scores_gemma":[0.48587933,0.00003499595,0.51237184,0.00008628021,0.0003871197,0.000030047277,0.00003974849,0.000019915084,0.0011507284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978155,0.0005005791,0.0004957074,0.00018627022,0.0007686168,0.00023333597],"domain_scores_gemma":[0.9974481,0.00040174733,0.00027969695,0.0002417746,0.0015194617,0.00010924972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008198095,0.00007372581,0.00010907319,0.00024068121,0.00035817613,0.00036399518,0.0009479919,0.000021491433,0.000023453811],"category_scores_gemma":[0.00092301663,0.00006278212,0.00005726728,0.00032068382,0.000035684818,0.0008035657,0.00011641718,0.0002061876,0.00011726689],"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.00007084605,0.00088668027,0.0027796673,0.000117084724,0.00028997712,0.000049700953,0.023045992,0.00021976384,0.023170466,0.49013102,0.15421407,0.3050247],"study_design_scores_gemma":[0.004435307,0.0036430564,0.2654566,0.00067728496,0.000063488966,0.00035372959,0.0031267342,0.49008456,0.0044852104,0.031596012,0.19504546,0.001032596],"about_ca_topic_score_codex":0.000003085543,"about_ca_topic_score_gemma":9.965192e-7,"teacher_disagreement_score":0.4898648,"about_ca_system_score_codex":0.00012037149,"about_ca_system_score_gemma":0.00022512898,"threshold_uncertainty_score":0.35100138},"labels":[],"label_agreement":null},{"id":"W2137517701","doi":"10.1016/j.ejor.2015.05.082","title":"Multi-level facility location as the maximization of a submodular set function","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"HEC Montréal; Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Set function; Facility location problem; Property (philosophy); Set (abstract data type); Representation (politics); Mathematical optimization; Combinatorial optimization; Function (biology); Maximization; 1-center problem; Mathematics; Computer science; Optimization problem","score_opus":0.3494665569867854,"score_gpt":0.38350349018324087,"score_spread":0.034036933196455454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137517701","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.041397784,0.00024184302,0.9549524,0.0022368745,0.0002750247,0.00013637288,0.000008539428,0.000008108623,0.00074306346],"genre_scores_gemma":[0.97406745,0.000019576833,0.025308318,0.00009884842,0.00014262291,0.0000014495621,0.000009237945,0.0000050496064,0.00034742474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99622387,0.0016951658,0.00042785,0.000150914,0.0013509071,0.00015129437],"domain_scores_gemma":[0.9955129,0.00016837697,0.00014831265,0.0003051361,0.0037459382,0.00011931428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009633831,0.00007093743,0.00010042298,0.00021517352,0.0002368344,0.00019672116,0.000878625,0.000016528604,0.000029048359],"category_scores_gemma":[0.0014380349,0.000049555005,0.000054778895,0.000731617,0.00016226749,0.00064356707,0.00021275664,0.0003633376,0.00008056448],"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.0012622995,0.0020877288,0.0049352413,0.00013661647,0.00043378552,0.00029079203,0.027739966,0.20968734,0.017160483,0.31847543,0.03823015,0.37956017],"study_design_scores_gemma":[0.0054602483,0.004188435,0.27227724,0.00021828087,0.000027977329,0.0006974326,0.0021224401,0.6295755,0.0048127756,0.027594123,0.052502222,0.00052335014],"about_ca_topic_score_codex":0.000017512111,"about_ca_topic_score_gemma":0.0000040819655,"teacher_disagreement_score":0.9326697,"about_ca_system_score_codex":0.00006425878,"about_ca_system_score_gemma":0.0005210998,"threshold_uncertainty_score":0.33389127},"labels":[],"label_agreement":null},{"id":"W2140930222","doi":"10.1016/s0377-2217(01)00402-7","title":"Methodological contrasts in costing greenhouse gas abatement policies: Optimization and simulation modeling of micro-economic effects in Canada","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis; Simon Fraser University","funders":"Division of Materials Research","keywords":"Greenhouse gas; Economics; Activity-based costing; Order (exchange); Operations research; Environmental economics; Econometrics; Environmental science; Natural resource economics; Engineering; Finance; Accounting","score_opus":0.4454863890860673,"score_gpt":0.3829522080929819,"score_spread":0.06253418099308539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140930222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905705,0.00082918437,0.006238827,0.00070715667,0.00007601979,0.0001504309,0.000029334116,0.0000011782648,0.001397394],"genre_scores_gemma":[0.995462,0.00091792754,0.0034116956,0.000080438826,0.000094165574,0.0000017699504,0.000003838199,0.0000142838835,0.000013866606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998188,0.0003436295,0.0010124276,0.00015759173,0.00006607566,0.00023223266],"domain_scores_gemma":[0.998732,0.00078261597,0.0002533699,0.0000756855,0.000081251594,0.00007509521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004391763,0.000082132414,0.00031426956,0.00045934398,0.00005857554,0.000052507366,0.0001385419,0.00002321146,0.00014419176],"category_scores_gemma":[0.00093126367,0.00008966236,0.000029986437,0.00012223168,0.000035296944,0.00023909322,0.000058835085,0.00024618334,0.000009732685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003339163,0.00003372521,0.021076443,0.000023637956,0.0000103823295,0.00001633708,0.0006253632,0.9763273,0.000058153768,0.001334897,0.000028753646,0.0004316078],"study_design_scores_gemma":[0.0009512021,0.00010715345,0.009673137,0.000064944215,0.0000010008644,0.000008761585,0.00017975095,0.9885039,0.000030307496,0.00033706933,0.000064095606,0.00007871105],"about_ca_topic_score_codex":0.05162962,"about_ca_topic_score_gemma":0.030030662,"teacher_disagreement_score":0.021598961,"about_ca_system_score_codex":0.0006541151,"about_ca_system_score_gemma":0.000080628546,"threshold_uncertainty_score":0.98766875},"labels":[],"label_agreement":null},{"id":"W2147359356","doi":"10.1016/s0377-2217(02)00826-3","title":"A tabu search algorithm for self-healing ring network design","year":2003,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optical Network Technologies","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":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Foundation for Community Association Research","keywords":"Tabu search; Mathematical optimization; Guided Local Search; Ring (chemistry); Computer science; Algorithm; Set (abstract data type); Heuristic; Network planning and design; Theoretical computer science; Mathematics; Computer network","score_opus":0.08412239204493605,"score_gpt":0.33662061018527234,"score_spread":0.2524982181403363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147359356","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024626136,0.0015405812,0.99155045,0.00013912836,0.00022167478,0.0002865915,0.000002340653,0.000103256905,0.003693389],"genre_scores_gemma":[0.089658074,0.0004438065,0.90902144,0.000021431095,0.00067083735,0.000008229619,0.0000015576027,0.00006853658,0.00010607571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743706,0.00063264254,0.00047199088,0.00014886909,0.00068233104,0.0006270793],"domain_scores_gemma":[0.9978143,0.0010406107,0.000034005174,0.00015948524,0.00079262466,0.00015895175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077563473,0.00013009197,0.00018800274,0.00020790033,0.00032075745,0.00014279435,0.00038334352,0.00004096884,0.000041504616],"category_scores_gemma":[0.00080305577,0.00011661685,0.00007203184,0.00048194037,0.00008322961,0.00025743656,0.000055381814,0.00091314997,0.00004016728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016831971,0.000024794557,0.000016763186,0.000016408167,0.000060026603,0.00008470978,0.00007389061,0.9535268,0.0007293897,0.00775336,0.0036111414,0.034085885],"study_design_scores_gemma":[0.0012011577,0.00071542064,0.0001547099,0.00016933633,0.000012046345,0.00021153838,0.00023358168,0.9372075,0.0028077844,0.0030385782,0.053956173,0.00029214696],"about_ca_topic_score_codex":1.3884299e-7,"about_ca_topic_score_gemma":1.4863174e-7,"teacher_disagreement_score":0.087195456,"about_ca_system_score_codex":0.0001700334,"about_ca_system_score_gemma":0.00013708242,"threshold_uncertainty_score":0.47554973},"labels":[],"label_agreement":null},{"id":"W2151339549","doi":"10.1016/s0377-2217(00)00267-8","title":"On generalized minimum spanning trees","year":2001,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transport Systems and Technology","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":"HEC Montréal","funders":"","keywords":"Minimum spanning tree; Spanning tree; Distributed minimum spanning tree; Minimum degree spanning tree; Kruskal's algorithm; Euclidean minimum spanning tree; Mathematics; Tree (set theory); Mathematical optimization; Combinatorics; k-minimum spanning tree; Computer science; Connected dominating set; Steiner tree problem; Tree structure; K-ary tree; Binary tree","score_opus":0.07062903256916202,"score_gpt":0.31850650235135364,"score_spread":0.2478774697821916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151339549","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95736355,0.0004890699,0.0033888698,0.00065478287,0.0002425384,0.00005909167,0.0000024359322,0.000038528346,0.037761122],"genre_scores_gemma":[0.9973735,0.00014931001,0.0010116374,0.000028551152,0.00039533305,0.000001022735,0.0000025787826,0.000029150146,0.0010088857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867195,0.00019442354,0.0003425194,0.00007758077,0.0005035008,0.00021004387],"domain_scores_gemma":[0.99945104,0.00008421197,0.000026031581,0.00011266634,0.00023931361,0.000086724365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015508954,0.00007587217,0.00012743022,0.00033665987,0.000101463476,0.000055017266,0.00024341512,0.000022908884,0.00031143724],"category_scores_gemma":[0.00008646398,0.00006122715,0.000054887947,0.00020999264,0.000045579287,0.00010638321,0.000012704803,0.00045495364,0.00016676448],"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.00068854174,0.00037152373,0.0074263746,0.000077021185,0.0005273684,0.012857707,0.0017531012,0.3708704,0.27207232,0.105232984,0.16542077,0.062701896],"study_design_scores_gemma":[0.00518431,0.002270639,0.10049632,0.0005474326,0.0000186749,0.002041174,0.0003893153,0.018839076,0.0076647103,0.0011936929,0.86074704,0.000607618],"about_ca_topic_score_codex":0.0000020551067,"about_ca_topic_score_gemma":0.000004001196,"teacher_disagreement_score":0.69532627,"about_ca_system_score_codex":0.00004381064,"about_ca_system_score_gemma":0.00003499343,"threshold_uncertainty_score":0.34100193},"labels":[],"label_agreement":null},{"id":"W2152061634","doi":"10.1016/j.ejor.2005.06.038","title":"Optimal workforce size and allocation for urban retail chains","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Assembly Line Balancing Optimization","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":"York University","funders":"","keywords":"Workforce; Business; Profit (economics); Supervisor; Supply chain; Queueing theory; Markov chain; Workforce management; Absenteeism; Computer science; Industrial organization; Operations management; Operations research; Microeconomics; Marketing; Economics; Mathematics; Computer network","score_opus":0.050370662543127,"score_gpt":0.31480340517877825,"score_spread":0.26443274263565125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152061634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58108,0.0016703297,0.3987439,0.0051546744,0.00023920153,0.0004950698,0.000011421454,0.00006750069,0.012537883],"genre_scores_gemma":[0.9273136,0.00017038164,0.06947119,0.000046723777,0.0011650663,0.0000034888208,0.000008716501,0.000040241022,0.0017805919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878615,0.0001672356,0.00034562263,0.00009445033,0.0004103878,0.00019612299],"domain_scores_gemma":[0.998769,0.00030028197,0.000043642387,0.00008800477,0.00069058535,0.00010848632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026090096,0.0000818104,0.00010697095,0.00013294657,0.00015100586,0.00012722325,0.00015399541,0.000021690423,0.000041181498],"category_scores_gemma":[0.00080452475,0.00007627682,0.000034164823,0.00014912394,0.00003961566,0.00036100612,0.000026498856,0.00026883025,0.000018272798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007585089,0.000028761644,0.00022443278,0.00002292952,0.00003342506,0.000008158807,0.00068339804,0.9612525,0.0111656515,0.0021873266,0.01244683,0.011870709],"study_design_scores_gemma":[0.001413301,0.00039951853,0.008475881,0.00011347135,0.000011906424,0.00009115185,0.00016503085,0.8892697,0.002714757,0.000012989751,0.09713512,0.00019718712],"about_ca_topic_score_codex":2.2591159e-7,"about_ca_topic_score_gemma":0.0000010422234,"teacher_disagreement_score":0.34623358,"about_ca_system_score_codex":0.000098150245,"about_ca_system_score_gemma":0.000074583695,"threshold_uncertainty_score":0.31104785},"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":"W2155032754","doi":"10.1016/j.ejor.2012.08.014","title":"Rich routing problems arising in supply chain management","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":105,"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":"Interdependence; Computer science; Supply chain; Vehicle routing problem; Scheduling (production processes); Supply chain management; Routing (electronic design automation); Operations research; Context (archaeology); Mathematical optimization; Focus (optics); Mathematics; Business","score_opus":0.07711657160685632,"score_gpt":0.35139712469357054,"score_spread":0.27428055308671423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155032754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74213165,0.0014233096,0.15537626,0.00086531945,0.0006579907,0.00043663013,0.0000029517867,0.00006590997,0.09903996],"genre_scores_gemma":[0.918909,0.00011003732,0.08018844,0.000024257612,0.00041091617,0.000002018991,0.0000025845097,0.000042784784,0.0003099732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968866,0.0012532078,0.00057031895,0.00008961099,0.00075665367,0.00044358138],"domain_scores_gemma":[0.99921626,0.00020063315,0.000053001877,0.00011662253,0.0002722596,0.00014123645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016302474,0.00009616336,0.0001316445,0.0005227527,0.00012539652,0.00013711634,0.0002658478,0.000019771394,0.00010631683],"category_scores_gemma":[0.0003571429,0.00009076589,0.000035004312,0.00058762403,0.00003114092,0.0004433589,0.000088248395,0.00066063274,0.00006854924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001591725,0.00008654185,0.021783045,0.00006103773,0.000048134483,0.00009414059,0.0026337816,0.9511828,0.0038951328,0.0025691683,0.0013187127,0.016311623],"study_design_scores_gemma":[0.0038683421,0.0003264232,0.4329462,0.0013788475,0.000026077743,0.00045180807,0.0027981682,0.529647,0.004358692,0.00022481366,0.023155052,0.00081861083],"about_ca_topic_score_codex":0.0000012788895,"about_ca_topic_score_gemma":5.109051e-7,"teacher_disagreement_score":0.4215358,"about_ca_system_score_codex":0.00020056395,"about_ca_system_score_gemma":0.000031195916,"threshold_uncertainty_score":0.5650144},"labels":[],"label_agreement":null},{"id":"W2156761946","doi":"10.1016/j.ejor.2012.11.030","title":"A Markovian queueing model for ambulance offload delays","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":71,"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":"Overcrowding; Queueing theory; Computer science; Queue; Emergency department; Markov process; Markov chain; Computer network; Medicine; Statistics; Nursing","score_opus":0.10829215085009539,"score_gpt":0.3577038544373128,"score_spread":0.2494117035872174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156761946","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.36968783,0.0008712218,0.5666899,0.005280449,0.00045657076,0.0004594334,0.00000965491,0.000043809265,0.056501154],"genre_scores_gemma":[0.98374104,0.000012796377,0.01049207,0.0007181745,0.0034024124,0.000004239701,0.000008473628,0.000040191346,0.001580571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815774,0.00017589504,0.00043566158,0.00013041009,0.0006869986,0.00041327704],"domain_scores_gemma":[0.9979547,0.0002227976,0.0002057558,0.00015885883,0.0014101018,0.000047776088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009638863,0.00010824955,0.00016769675,0.00045131816,0.0004314675,0.00027791766,0.00042469415,0.000016936012,0.00015876228],"category_scores_gemma":[0.0016591031,0.00009164666,0.00012772938,0.00037614212,0.00007803891,0.00225729,0.00014624343,0.00034908863,0.00019709868],"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.0016114144,0.00057171076,0.006895848,0.00023694035,0.00034355096,0.0001173055,0.0008836634,0.36274803,0.020554764,0.52931017,0.051700056,0.025026534],"study_design_scores_gemma":[0.0015401258,0.000076512304,0.0033626808,0.00019161294,0.00007517083,0.000044237036,0.0003871433,0.87135416,0.00022557724,0.010784358,0.11157004,0.00038835875],"about_ca_topic_score_codex":0.000004051807,"about_ca_topic_score_gemma":0.0000033491863,"teacher_disagreement_score":0.61405325,"about_ca_system_score_codex":0.00006772849,"about_ca_system_score_gemma":0.00006718628,"threshold_uncertainty_score":0.37372422},"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":"W2157761976","doi":"10.1016/j.ejor.2004.01.049","title":"Data dependent worst case bounds for weighted set packing","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Search Problems","field":"Computer 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":"University of Toronto; University of New Brunswick","funders":"","keywords":"Set (abstract data type); Computer science; Mathematical optimization; Set packing; Combinatorics; Mathematics; Algorithm","score_opus":0.28979600900726327,"score_gpt":0.4341920657037415,"score_spread":0.14439605669647826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157761976","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.008357499,0.0001698317,0.97814506,0.009901764,0.00023159587,0.00026737066,0.000053422278,0.000016983542,0.0028564436],"genre_scores_gemma":[0.7691954,0.00008248173,0.22914721,0.000350051,0.00049481174,0.0000030430617,0.000047128076,0.000023503631,0.0006563968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969243,0.0007860482,0.0004806639,0.00027839647,0.0011891709,0.00034144495],"domain_scores_gemma":[0.9970936,0.00029932312,0.00010413183,0.0005315699,0.0017191961,0.00025217954],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010513001,0.00008953226,0.00011923264,0.00034170708,0.0006380405,0.0010979716,0.0018731317,0.000017989558,0.00006460175],"category_scores_gemma":[0.0007882438,0.00007254595,0.000046171623,0.00044469905,0.00008231606,0.0014503687,0.00067575084,0.00046856905,0.000066686414],"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.00051463867,0.0015025435,0.00051714806,0.00015571371,0.00050054933,0.043080516,0.010397879,0.15819131,0.0059137153,0.56167096,0.1168615,0.10069351],"study_design_scores_gemma":[0.016537752,0.00460376,0.0012184527,0.000624902,0.000029332461,0.027008342,0.0013954403,0.61896306,0.002415611,0.022921324,0.30313405,0.0011479341],"about_ca_topic_score_codex":0.0000065343906,"about_ca_topic_score_gemma":0.000016972108,"teacher_disagreement_score":0.76083785,"about_ca_system_score_codex":0.00012048087,"about_ca_system_score_gemma":0.0008411993,"threshold_uncertainty_score":0.99993896},"labels":[],"label_agreement":null},{"id":"W2167451609","doi":"10.1016/j.ejor.2014.03.036","title":"A new distance measure including the weak preference relation: Application to the multiple criteria aggregation procedure for mixed evaluations","year":2014,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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é Laval; University of Ottawa; Wilfrid Laurier University","funders":"","keywords":"Measure (data warehouse); Preference; Ambiguity; Relation (database); Preference relation; Mathematics; Computer science; Econometrics; Statistics; Data mining","score_opus":0.49120252718623775,"score_gpt":0.522083046585105,"score_spread":0.030880519398867212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167451609","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.016562622,0.00015662603,0.94731975,0.03252047,0.0004079064,0.0012027507,0.000016848659,0.000009913852,0.0018030888],"genre_scores_gemma":[0.9642658,0.000006028672,0.03233603,0.0002916736,0.0013980499,0.000060981016,0.000008709839,0.00002620581,0.0016064842],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98852146,0.004492969,0.0013261347,0.000452326,0.0049004555,0.00030667378],"domain_scores_gemma":[0.9824553,0.008636478,0.00052332913,0.00076900766,0.0073876716,0.00022822914],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.054649614,0.0001504669,0.00021028325,0.00038145436,0.001719106,0.0015292824,0.0020992996,0.000036457623,0.00018292395],"category_scores_gemma":[0.088670895,0.000080383,0.00012402778,0.0013564648,0.00009977217,0.0007349435,0.00028405956,0.0005069104,0.0003103853],"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.00094976544,0.000104456754,0.002415724,0.000013477664,0.000047511498,0.0000021288217,0.006199227,0.05457989,0.024973573,0.0343905,0.29666144,0.5796623],"study_design_scores_gemma":[0.0014548417,0.00037645924,0.103161976,0.00023956406,0.00001871296,0.000052472667,0.0010857781,0.32424966,0.0007355271,0.015049292,0.55336684,0.00020889995],"about_ca_topic_score_codex":0.0000045943957,"about_ca_topic_score_gemma":0.00009123741,"teacher_disagreement_score":0.94770324,"about_ca_system_score_codex":0.00014153034,"about_ca_system_score_gemma":0.00057496515,"threshold_uncertainty_score":0.9995805},"labels":[],"label_agreement":null},{"id":"W2168381469","doi":"10.1016/s0377-2217(99)00073-9","title":"An efficient transformation of the generalized vehicle routing problem","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":155,"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","funders":"","keywords":"Arc routing; Vehicle routing problem; Transformation (genetics); Computer science; Routing (electronic design automation); Mathematical optimization; Arc (geometry); Mathematics; Computer network","score_opus":0.05034688933492008,"score_gpt":0.33841100554714104,"score_spread":0.28806411621222094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168381469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95918447,0.00007020865,0.02530455,0.00036826573,0.00007002675,0.00015253497,0.000004046954,0.00001858323,0.014827304],"genre_scores_gemma":[0.9726346,0.000030660238,0.027020961,0.000021455768,0.0001407286,9.1929286e-7,0.0000022110305,0.000025613961,0.00012285249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967557,0.0016407704,0.00056801626,0.00007002379,0.00078427285,0.00018120016],"domain_scores_gemma":[0.99909544,0.0000933083,0.000056403867,0.00015065474,0.00052566937,0.00007855273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006502471,0.00007142254,0.000109270935,0.00011542169,0.00019772928,0.00008491101,0.00036917764,0.000018045017,0.0003398982],"category_scores_gemma":[0.000108837994,0.000051387222,0.00006396622,0.00039897207,0.000061489154,0.00021598073,0.000013249187,0.0003775215,0.000018541927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023637862,0.000032900436,0.00010120517,0.000011870728,0.000012495594,0.0000024946662,0.001423151,0.95672554,0.027587306,0.0007289427,0.00010319564,0.013247245],"study_design_scores_gemma":[0.0007344484,0.00012535954,0.007621503,0.00008171414,0.000005866999,0.00003536523,0.000115743336,0.9745666,0.01524973,0.000027646847,0.0013579839,0.000078049],"about_ca_topic_score_codex":0.0000021463802,"about_ca_topic_score_gemma":4.3266735e-7,"teacher_disagreement_score":0.017841032,"about_ca_system_score_codex":0.000062869614,"about_ca_system_score_gemma":0.00008349666,"threshold_uncertainty_score":0.3721647},"labels":[],"label_agreement":null},{"id":"W2189045623","doi":"10.1016/j.ejor.2015.06.062","title":"Supply chain design for unlocking the value of remanufacturing under uncertainty","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","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":"McGill University","funders":"","keywords":"Cannibalization; Remanufacturing; Original equipment manufacturer; Reverse logistics; Supply chain; Valuation (finance); Industrial organization; Quality (philosophy); Computer science; Business; Stochastic programming; Risk analysis (engineering); Economics; Mathematical optimization; Marketing; Manufacturing engineering; Mathematics; Engineering","score_opus":0.14852149712990856,"score_gpt":0.3394352765035936,"score_spread":0.19091377937368506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2189045623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46375528,0.0010231759,0.42871076,0.0620801,0.001474362,0.0036749868,0.000008573549,0.000056794404,0.03921596],"genre_scores_gemma":[0.99371,0.000008114896,0.002777132,0.0006978823,0.0018503439,0.0000084877,0.00000700627,0.000039834442,0.0009012443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969695,0.00054541114,0.0005656678,0.00017005896,0.0013736387,0.00037570705],"domain_scores_gemma":[0.996047,0.000671136,0.00028311246,0.00022733018,0.0027335205,0.000037882317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022994837,0.00012802803,0.0001813657,0.00053060247,0.00036621536,0.0004457859,0.000789114,0.00001796098,0.00009204268],"category_scores_gemma":[0.0025202844,0.00008636887,0.000101723024,0.00045086714,0.00014289509,0.00068590674,0.0003311272,0.00034016382,0.000033929187],"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.00043435852,0.00007858644,0.00032905876,0.000102496684,0.00009619698,0.00007113438,0.00038536696,0.85528326,0.00036606973,0.08600752,0.054326296,0.0025196844],"study_design_scores_gemma":[0.008839555,0.0009860909,0.015637098,0.0006795705,0.00016508433,0.000072858486,0.03880501,0.2972776,0.0022263497,0.067662574,0.56683713,0.00081108644],"about_ca_topic_score_codex":0.000060569495,"about_ca_topic_score_gemma":0.000004821155,"teacher_disagreement_score":0.55800563,"about_ca_system_score_codex":0.00018268863,"about_ca_system_score_gemma":0.0002855768,"threshold_uncertainty_score":0.79695976},"labels":[],"label_agreement":null},{"id":"W2195716313","doi":"10.1016/j.ejor.2015.08.036","title":"Use of a discrete-event simulation in a Kaizen event: A case study in healthcare","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":111,"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":"Kaizen; Discrete event simulation; Event (particle physics); Lean manufacturing; Health care; Computer science; Operations management; Process management; Business; Engineering; Simulation","score_opus":0.5545062610351178,"score_gpt":0.5982721507514147,"score_spread":0.04376588971629691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2195716313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99036133,0.00012298525,0.0031434714,0.0048112194,0.00016116338,0.0012084659,0.000013010725,0.000004200373,0.00017417622],"genre_scores_gemma":[0.99659634,0.00003003484,0.0027627023,0.00013426949,0.00019496316,0.000019613442,0.0000136973285,0.000027779588,0.00022062831],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98326933,0.013182202,0.0018506837,0.00020305435,0.0011202466,0.00037450335],"domain_scores_gemma":[0.99469984,0.0010864144,0.00030146653,0.00022209967,0.0033866386,0.00030353563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020025328,0.000110543675,0.00030772985,0.0008783535,0.00032429377,0.00004762035,0.00017710945,0.000057575067,0.00005735358],"category_scores_gemma":[0.004905908,0.00009210097,0.00004537814,0.0009188433,0.000045093115,0.0005701209,0.000115374074,0.001355219,0.000025034931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000607508,0.0006092103,0.24376848,0.00006212331,0.000014976362,0.0027304846,0.027370725,0.7223644,0.000028949433,0.0005377843,0.0002388012,0.0016665527],"study_design_scores_gemma":[0.011972569,0.0076086298,0.2987838,0.0019723147,0.000016578604,0.00045871636,0.086039,0.58967316,0.00000839003,0.00022346154,0.002829225,0.0004141507],"about_ca_topic_score_codex":0.0028588749,"about_ca_topic_score_gemma":0.0035746498,"teacher_disagreement_score":0.13269125,"about_ca_system_score_codex":0.0005709536,"about_ca_system_score_gemma":0.0025991478,"threshold_uncertainty_score":0.69404185},"labels":[],"label_agreement":null},{"id":"W2262003201","doi":"10.1016/j.ejor.2016.02.012","title":"Exact and heuristic algorithms for the Hamiltonian p -median problem","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"Federación Española de Enfermedades Raras; University of Southampton","keywords":"Algorithm; Metaheuristic; Heuristic; Constructive; Mathematics; Mathematical optimization; Iterated function; Null-move heuristic; Consistent heuristic; Computer science; Search algorithm; Incremental heuristic search; Beam search","score_opus":0.1178388932720871,"score_gpt":0.3376843804834279,"score_spread":0.2198454872113408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2262003201","genre_codex":"commentary","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.15864441,0.001992267,0.21889426,0.5425978,0.0027450912,0.0033417367,0.0000457682,0.00008182809,0.07165686],"genre_scores_gemma":[0.9921877,0.00019295212,0.0013006768,0.0006810667,0.0017543874,0.000011125223,0.0000036162585,0.000019092502,0.0038494016],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986533,0.00009664713,0.00033492115,0.00013079833,0.00057831994,0.00020602909],"domain_scores_gemma":[0.99859416,0.0002133133,0.000050019404,0.00012579259,0.0009887074,0.00002798009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057159015,0.00007577914,0.000082434366,0.00020942249,0.0004225553,0.00030787115,0.00031834,0.000009216553,0.0003613032],"category_scores_gemma":[0.00094386894,0.000038848462,0.000046895537,0.00018684364,0.00013551177,0.0005638107,0.00012534915,0.00012909702,0.00022598138],"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.00038703237,0.00026322895,0.0029075865,0.00029499145,0.00023238017,0.00007332959,0.00041368877,0.0012599758,0.0031003982,0.11540992,0.284871,0.59078646],"study_design_scores_gemma":[0.0012738251,0.00011644547,0.051311083,0.00010441705,0.000021380323,0.000012760629,0.000293042,0.008722069,0.000023007675,0.0017044415,0.93628156,0.00013597624],"about_ca_topic_score_codex":0.00003342257,"about_ca_topic_score_gemma":0.00004113783,"teacher_disagreement_score":0.8335433,"about_ca_system_score_codex":0.000028510896,"about_ca_system_score_gemma":0.00005138042,"threshold_uncertainty_score":0.39560166},"labels":[],"label_agreement":null},{"id":"W2269163318","doi":"10.1016/j.ejor.2016.02.002","title":"Democratic elections and centralized decisions: Condorcet and Approval Voting compared with Median and Coverage locations","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Calgary","keywords":"Condorcet method; Approval voting; Voting; Quality (philosophy); Democracy; Median; Mathematics; Statistics; Computer science; Econometrics; Mathematical optimization; Political science; Law","score_opus":0.10868174260374897,"score_gpt":0.30547495532230545,"score_spread":0.1967932127185565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269163318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9724656,0.0009862133,0.020430798,0.0023674555,0.000063692954,0.00016798911,0.00002734847,0.0000052693263,0.00348567],"genre_scores_gemma":[0.99737006,0.00033405845,0.0012639532,0.000041796287,0.00012046282,0.0000021805402,0.00000202098,0.000014296857,0.00085119036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986472,0.0003812677,0.0004938328,0.00017552021,0.00011786999,0.0001843104],"domain_scores_gemma":[0.9985085,0.00083467236,0.00017051215,0.00008283812,0.00023183259,0.00017162731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004305611,0.00007831047,0.00020616571,0.00025527136,0.00038750158,0.00020249003,0.00010432004,0.0000142260415,0.00006317445],"category_scores_gemma":[0.0013666619,0.00005511108,0.00001813106,0.00014453864,0.0002293416,0.00029536348,0.000044562094,0.00019540565,0.000022622533],"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.0007354955,0.00025703822,0.20945442,0.00008565723,0.00039649862,0.00017750557,0.0034972318,0.00039973744,0.0054557347,0.7638249,0.0034850533,0.0122307865],"study_design_scores_gemma":[0.026478812,0.0040305196,0.82191026,0.0026122625,0.00006478016,0.0059660706,0.002865811,0.016151626,0.00074765296,0.073362865,0.044412985,0.0013963298],"about_ca_topic_score_codex":0.0000073681576,"about_ca_topic_score_gemma":0.000009922409,"teacher_disagreement_score":0.690462,"about_ca_system_score_codex":0.000035127894,"about_ca_system_score_gemma":0.000058650683,"threshold_uncertainty_score":0.29803878},"labels":[],"label_agreement":null},{"id":"W2273298990","doi":"10.1016/j.ejor.2016.02.010","title":"Multi-server accumulating priority queues with heterogeneous servers","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; Queue; Service (business); Idle; Queueing theory; Class (philosophy); Function (biology); Computer network; Operations research; Distributed computing; Operating system; Mathematics; Business","score_opus":0.09992637560611724,"score_gpt":0.35210793849242805,"score_spread":0.25218156288631083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273298990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98994327,0.000067136454,0.005564764,0.0017730362,0.00007766053,0.00010441103,0.0000015386771,0.000023633647,0.0024445362],"genre_scores_gemma":[0.99430466,0.000009448673,0.0034760523,0.000257531,0.0010622246,0.0000010321776,0.000002165546,0.000038908205,0.0008479562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978051,0.00032071507,0.00042297313,0.00020499005,0.0009487185,0.0002974895],"domain_scores_gemma":[0.9974075,0.00025804565,0.0002562498,0.00021006979,0.0018289371,0.000039200357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187396,0.00012969763,0.00017609951,0.00038173053,0.00038449487,0.00033813197,0.00047696952,0.000016800595,0.00046326264],"category_scores_gemma":[0.0014148974,0.00007601094,0.00009387468,0.00042877323,0.0001467204,0.0018874541,0.00016114835,0.00029044622,0.00033777225],"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.0065628695,0.0018625834,0.2102163,0.00048710487,0.0021920756,0.009095866,0.001255053,0.33443347,0.24650702,0.07407761,0.006354848,0.1069552],"study_design_scores_gemma":[0.04673999,0.0030782218,0.31793934,0.0077719036,0.00082330056,0.0016202743,0.0043426678,0.1535057,0.021597477,0.013146074,0.4236118,0.0058232704],"about_ca_topic_score_codex":0.000018552722,"about_ca_topic_score_gemma":0.00004268897,"teacher_disagreement_score":0.41725695,"about_ca_system_score_codex":0.00008821561,"about_ca_system_score_gemma":0.000078086414,"threshold_uncertainty_score":0.5072401},"labels":[],"label_agreement":null},{"id":"W2290394383","doi":"10.1016/j.ejor.2016.02.036","title":"From partial derivatives of DEA frontiers to marginal products, marginal rates of substitution, and returns to scale","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Data envelopment analysis; Returns to scale; Econometrics; Function (biology); Economics; Substitution (logic); Efficient frontier; Production–possibility frontier; Marginal cost; Transformation (genetics); Point (geometry); Production (economics); Scale (ratio); Parametric statistics; Constant (computer programming); Mathematical economics; Mathematics; Computer science; Mathematical optimization; Statistics; Microeconomics; Financial economics","score_opus":0.15578706842482337,"score_gpt":0.4305235655144412,"score_spread":0.27473649708961784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290394383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9536099,0.00029737304,0.03384048,0.011464538,0.00016951765,0.00014413976,0.000047000205,0.00000214331,0.00042495175],"genre_scores_gemma":[0.9758898,0.000029021783,0.022882016,0.00005425247,0.0003684165,0.000001127753,0.000001628633,0.0000112719945,0.0007624446],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9927533,0.0021810425,0.0012063918,0.00040840148,0.0031682865,0.00028254202],"domain_scores_gemma":[0.9925775,0.001121842,0.00033259316,0.00036635748,0.0053084334,0.00029328556],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.015224478,0.00012266923,0.00037977382,0.00096347794,0.00020956503,0.00018795881,0.000930279,0.000021991067,0.00032196473],"category_scores_gemma":[0.016269788,0.000073043164,0.000083164254,0.00131754,0.00059970183,0.0005208872,0.00024494663,0.00020674281,0.00008332102],"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.002462822,0.00038451303,0.09938453,0.000014894954,0.00017429492,0.00010601862,0.0053361207,0.0031610816,0.81288457,0.0041786623,0.05447392,0.01743858],"study_design_scores_gemma":[0.0016287873,0.0019535306,0.6777208,0.00054788275,0.00004048974,0.00005720123,0.002227881,0.00058460986,0.2717897,0.0028424512,0.040263817,0.00034287805],"about_ca_topic_score_codex":0.00001699579,"about_ca_topic_score_gemma":0.000009069311,"teacher_disagreement_score":0.57833624,"about_ca_system_score_codex":0.00006229824,"about_ca_system_score_gemma":0.0005290121,"threshold_uncertainty_score":0.9920166},"labels":[],"label_agreement":null},{"id":"W2295594847","doi":"10.1016/j.ejor.2016.01.029","title":"Using simulation to test ideas for improving speech language pathology services","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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; University of Saskatchewan","funders":"","keywords":"Computer science; Test (biology); Natural language processing; Artificial intelligence; Biology","score_opus":0.25645289157098233,"score_gpt":0.5535151994231536,"score_spread":0.2970623078521713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295594847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7513464,0.00007502125,0.24118932,0.005585538,0.00030274596,0.0006998073,0.000041469684,0.000012584539,0.0007470831],"genre_scores_gemma":[0.91474843,0.000010202915,0.0822939,0.0005811602,0.0013176958,0.0000092106,0.0000102929835,0.000035685294,0.0009934297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620384,0.0019091117,0.0007878408,0.00018869684,0.00052235933,0.00038812487],"domain_scores_gemma":[0.9943799,0.0021789768,0.00019128385,0.00016944877,0.0028570525,0.00022338155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009842058,0.00009093859,0.00016214872,0.00036206597,0.0010863878,0.000058563437,0.00023433642,0.00005503701,0.00020314567],"category_scores_gemma":[0.0049414695,0.000060634982,0.00004620988,0.00027069656,0.000027817377,0.0003639172,0.00008938747,0.00037102142,0.00015252277],"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.001148454,0.000433153,0.020594006,0.0005296467,0.000055764485,0.00035901088,0.018851995,0.16028565,0.6761281,0.004337643,0.0016455812,0.115630984],"study_design_scores_gemma":[0.014205141,0.010180396,0.045520496,0.004549875,0.000084650375,0.0003010411,0.0199353,0.8358998,0.00534375,0.0009410811,0.061695106,0.0013433701],"about_ca_topic_score_codex":0.000034996156,"about_ca_topic_score_gemma":0.000053791304,"teacher_disagreement_score":0.6756141,"about_ca_system_score_codex":0.00024314772,"about_ca_system_score_gemma":0.0007880116,"threshold_uncertainty_score":0.83557266},"labels":[],"label_agreement":null},{"id":"W2299728052","doi":"10.1016/j.ejor.2017.01.049","title":"Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Conic section; Computer science; Class (philosophy); Optimization problem; Integer (computer science); Global optimization; State (computer science); Mathematics; Algorithm; Artificial intelligence","score_opus":0.1595511448030978,"score_gpt":0.34824145341378754,"score_spread":0.18869030861068975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299728052","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.011396976,0.00079022907,0.96601665,0.0059085772,0.000360233,0.000994959,0.00007888647,0.000021862845,0.014431607],"genre_scores_gemma":[0.9645327,0.00065141736,0.032867327,0.000006831332,0.00044739395,0.000020745838,0.000010643807,0.000029844141,0.0014331461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984774,0.00041598853,0.0002947915,0.00009568845,0.00053974026,0.00017641863],"domain_scores_gemma":[0.99846816,0.00036185587,0.000073795825,0.00026891925,0.0007699948,0.000057255893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048618726,0.00006888873,0.00010119477,0.000088720946,0.0010471282,0.00024269424,0.0003841764,0.000019329824,0.00001764669],"category_scores_gemma":[0.0012933586,0.00004070411,0.00004185038,0.00008335901,0.0003437672,0.0002223022,0.00010230088,0.0005045204,0.0000040999894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025191332,0.000027821636,0.000032788746,0.0000699682,0.000024834195,9.3229664e-7,0.00050375884,0.98815006,0.00004360506,0.0019902594,0.0010930835,0.008037685],"study_design_scores_gemma":[0.0011121113,0.00037085236,0.009310807,0.00019327819,0.00002396094,0.0000679193,0.00068451965,0.88835245,0.0015306346,0.009371665,0.08875665,0.00022517305],"about_ca_topic_score_codex":7.5892183e-7,"about_ca_topic_score_gemma":0.0000026750076,"teacher_disagreement_score":0.95313567,"about_ca_system_score_codex":0.000044127148,"about_ca_system_score_gemma":0.000060730523,"threshold_uncertainty_score":0.805377},"labels":[],"label_agreement":null},{"id":"W2332834184","doi":"10.1016/j.ejor.2016.03.040","title":"An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":266,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Heuristics; Computer science; Synchronization (alternating current); Routing (electronic design automation); Set (abstract data type); Mathematical optimization; Real-time computing; Operations research; Computer network; Mathematics","score_opus":0.0590928165349166,"score_gpt":0.34067075522544904,"score_spread":0.28157793869053244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332834184","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.026745426,0.00027052625,0.97010475,0.0008574836,0.00007515882,0.0005001739,0.000022130089,0.000048770828,0.0013755931],"genre_scores_gemma":[0.9217843,0.0001196019,0.07726195,0.000031014955,0.0005598101,0.000009896176,0.000007287259,0.00009058121,0.00013560172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962,0.001639443,0.0005138787,0.00020715006,0.00094726094,0.0004922159],"domain_scores_gemma":[0.9957244,0.0018102739,0.00009127669,0.00024539727,0.001955049,0.00017359604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011641142,0.00015395762,0.00016428814,0.0002167256,0.00053406187,0.00025589025,0.0004939969,0.00003130135,0.00005759904],"category_scores_gemma":[0.0006239368,0.00008703938,0.000056485387,0.0004947542,0.000099217345,0.0006723507,0.0000576971,0.00048040948,0.00002620408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054244447,0.00011914106,0.007245197,0.00003438722,0.00017219296,0.00004239656,0.0016106872,0.8223668,0.03468287,0.007256199,0.00015673267,0.12577096],"study_design_scores_gemma":[0.0034394613,0.0010452545,0.007317424,0.00024648113,0.000017988805,0.0000664129,0.0005759452,0.97767025,0.008197859,0.00004816814,0.0011693008,0.00020547936],"about_ca_topic_score_codex":0.0000022498812,"about_ca_topic_score_gemma":0.0000055463706,"teacher_disagreement_score":0.89503884,"about_ca_system_score_codex":0.00023101429,"about_ca_system_score_gemma":0.0002469092,"threshold_uncertainty_score":0.4107626},"labels":[],"label_agreement":null},{"id":"W2337514772","doi":"10.1016/j.ejor.2016.04.007","title":"A practical vehicle routing problem with desynchronized arrivals to depot","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Université Laval; Transport Canada","funders":"","keywords":"Computer science; Heuristic; Operations research; Vehicle routing problem; Key (lock); Routing (electronic design automation); Duration (music); Component (thermodynamics); Mathematical optimization; Artificial intelligence; Computer network; Mathematics","score_opus":0.09863036971870431,"score_gpt":0.38735915200099236,"score_spread":0.28872878228228804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337514772","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.17507125,0.000036690846,0.80689263,0.0054867426,0.00007247224,0.00022692785,0.0000030198876,0.000054211083,0.012156047],"genre_scores_gemma":[0.6423325,0.000018157865,0.35701108,0.000046077443,0.00025848215,0.0000027203582,3.7652234e-7,0.000047685557,0.0002829557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964471,0.0014701787,0.0005140969,0.00015644543,0.0010251071,0.00038708135],"domain_scores_gemma":[0.9974877,0.0008382791,0.000065399734,0.00016769335,0.0011313311,0.0003095707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008054665,0.00011827033,0.00017191742,0.0002529736,0.00017928563,0.00019209406,0.00026957822,0.00002228116,0.00021197338],"category_scores_gemma":[0.002382027,0.00007429921,0.000040763312,0.00044062323,0.00006842015,0.00043541912,0.00007779741,0.00042998034,0.0002013878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009174255,0.0002351733,0.005699567,0.00008169193,0.00038184415,0.0016106663,0.0018287915,0.47469097,0.38284585,0.007765083,0.024188416,0.09975452],"study_design_scores_gemma":[0.03574741,0.014028182,0.096207924,0.008847106,0.0002067541,0.010240294,0.0020735664,0.3723828,0.31594583,0.0009463929,0.13910154,0.0042722235],"about_ca_topic_score_codex":8.2131055e-7,"about_ca_topic_score_gemma":0.0000011422622,"teacher_disagreement_score":0.4672612,"about_ca_system_score_codex":0.00020272571,"about_ca_system_score_gemma":0.00028178885,"threshold_uncertainty_score":0.3029834},"labels":[],"label_agreement":null},{"id":"W2337987866","doi":"10.1016/j.ejor.2016.03.052","title":"Modeling the logistics response to a bioterrorist anthrax attack","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Bacillus and Francisella bacterial research","field":"Biochemistry, Genetics and Molecular Biology","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":"Université Laval","funders":"Centers for Disease Control and Prevention; China Scholarship Council","keywords":"Software deployment; Intervention (counseling); Medical emergency; Computer security; Business; Risk analysis (engineering); Operations research; Operations management; Computer science; Medicine; Engineering","score_opus":0.1257915137727002,"score_gpt":0.3924439036193147,"score_spread":0.2666523898466145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337987866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9191576,0.00023211677,0.06375009,0.014971879,0.00019418522,0.00015720798,0.000029999801,0.0000020198602,0.0015048634],"genre_scores_gemma":[0.9955901,0.00022849625,0.000674311,0.00019851545,0.0010845186,0.0000020704467,0.000003000618,0.000024359037,0.002194615],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966384,0.0017401323,0.0003582757,0.00019186844,0.00074657175,0.0003247506],"domain_scores_gemma":[0.99780566,0.00017664379,0.000040249364,0.00029883755,0.001464052,0.00021456234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009491321,0.00009257496,0.00010216817,0.00012261537,0.00029308908,0.00013205617,0.0006219722,0.000033335422,0.00011825611],"category_scores_gemma":[0.004138748,0.000047320053,0.00007686654,0.00016879059,0.00020342486,0.000010043259,0.00027693494,0.00023912033,0.00018459752],"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.0028546036,0.00004040998,0.000052618423,0.0000025573313,0.00002780593,0.00007019662,0.00008423322,0.0018032965,0.9766853,0.00009575058,0.009981389,0.008301842],"study_design_scores_gemma":[0.0038921337,0.008212051,0.007814672,0.000285951,0.000015262793,0.0005413225,0.00045660386,0.0032063758,0.121492125,0.00011597633,0.85339665,0.0005708718],"about_ca_topic_score_codex":0.0000032466041,"about_ca_topic_score_gemma":0.000005224454,"teacher_disagreement_score":0.8551932,"about_ca_system_score_codex":0.000044978966,"about_ca_system_score_gemma":0.00039735154,"threshold_uncertainty_score":0.49547672},"labels":[],"label_agreement":null},{"id":"W2338272829","doi":"10.1016/j.ejor.2016.04.015","title":"Modeling synergies in multi-criteria supplier selection and order allocation: An application to commodity trading","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":64,"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":"Order (exchange); Selection (genetic algorithm); Commodity; Computer science; Operations research; Industrial organization; Business; Microeconomics; Economics; Artificial intelligence; Finance; Mathematics","score_opus":0.07733320720124824,"score_gpt":0.34508305123220895,"score_spread":0.2677498440309607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338272829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71742314,0.000026532385,0.270718,0.010458133,0.000069584115,0.00034648317,0.0000011794917,0.00001564154,0.0009412766],"genre_scores_gemma":[0.9942424,0.000012662488,0.0045413612,0.00032368995,0.00067624176,0.000014364488,0.000007755211,0.0000262711,0.0001552105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841994,0.000229346,0.00039284906,0.00022151011,0.00048623292,0.00025014323],"domain_scores_gemma":[0.998376,0.00007051003,0.000064862936,0.00012298461,0.001327163,0.00003845374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005474365,0.000100341254,0.00011894849,0.00080317823,0.00025884557,0.00045745325,0.0002772697,0.000017556158,0.000115765324],"category_scores_gemma":[0.00053237664,0.00007780631,0.000018289451,0.00062573934,0.000037022546,0.0017931528,0.00015963218,0.0001816663,0.000038593178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015411898,0.0014543612,0.052372646,0.00048367333,0.00014986625,0.00021414687,0.0027066744,0.449988,0.14715427,0.13152716,0.014537281,0.19787073],"study_design_scores_gemma":[0.0019834146,0.00012395097,0.043865245,0.00015653644,0.0000111443605,0.000017843813,0.0017831934,0.93021953,0.00013943647,0.001577956,0.019842414,0.00027933187],"about_ca_topic_score_codex":0.00008000818,"about_ca_topic_score_gemma":0.00012395268,"teacher_disagreement_score":0.48023152,"about_ca_system_score_codex":0.00016510182,"about_ca_system_score_gemma":0.00005860306,"threshold_uncertainty_score":0.44112322},"labels":[],"label_agreement":null},{"id":"W2392609035","doi":"10.1016/j.ejor.2016.05.009","title":"Resource pooling in the presence of failures: Efficiency versus risk","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pooling; Queue; Server; Computer science; Queueing theory; Resource (disambiguation); Risk pool; Computer network; Artificial intelligence; Economics; Actuarial science","score_opus":0.05861832224142698,"score_gpt":0.32879188586161956,"score_spread":0.27017356362019257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392609035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96004146,0.0002137535,0.0064891162,0.005614935,0.00010844217,0.00014131636,0.0000026784508,0.000006857705,0.027381456],"genre_scores_gemma":[0.9986615,0.000031307663,0.00029361396,0.00007417648,0.0007370283,8.961943e-7,7.639113e-7,0.000013016687,0.00018766365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717337,0.0009150137,0.0004696211,0.00013538977,0.00108657,0.00022003235],"domain_scores_gemma":[0.99686366,0.0018548075,0.0002841678,0.00022002976,0.0007636012,0.000013725188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014948587,0.000076004304,0.00012631148,0.0005020104,0.00023555961,0.00013886328,0.0008691105,0.0000119881415,0.0001614016],"category_scores_gemma":[0.007925812,0.000040214585,0.00007880385,0.0007971115,0.0002095285,0.00077297137,0.00016318045,0.00036932537,0.00009985799],"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.0104684,0.0014417008,0.029318977,0.00021531618,0.00045001792,0.0016318639,0.0058113593,0.2303197,0.05172854,0.53028196,0.026360312,0.11197187],"study_design_scores_gemma":[0.020619137,0.0016211226,0.089536875,0.0032102263,0.00029238765,0.00011521381,0.02376694,0.02454363,0.0029423404,0.027529228,0.8044625,0.0013604112],"about_ca_topic_score_codex":0.000023551205,"about_ca_topic_score_gemma":0.000013694323,"teacher_disagreement_score":0.77810216,"about_ca_system_score_codex":0.000033451863,"about_ca_system_score_gemma":0.00005475088,"threshold_uncertainty_score":0.9488509},"labels":[],"label_agreement":null},{"id":"W2397097391","doi":"10.1016/j.ejor.2016.05.015","title":"Modeling the optimal ethnic composition of an adult stem cell registry","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Hematopoietic Stem Cell Transplantation","field":"Medicine","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":"Canadian Blood Services; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Blood Services","keywords":"Ethnic group; Ethnic composition; Composition (language); Computer science; Sociology; Anthropology","score_opus":0.12043096136361026,"score_gpt":0.38075960555989513,"score_spread":0.2603286441962849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397097391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640592,0.00015306825,0.02893361,0.0024852622,0.0000534981,0.00015907559,0.000009295511,0.0000043203554,0.004142708],"genre_scores_gemma":[0.99544936,0.0001763941,0.003483543,0.00006598103,0.00027299812,0.0000011956763,0.0000066860116,0.000020959837,0.00052289333],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99689937,0.0010912409,0.00055939803,0.00011916357,0.0011647375,0.00016607274],"domain_scores_gemma":[0.9974022,0.00028774876,0.000107111606,0.00021370008,0.0018450101,0.0001442387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040239524,0.000074118376,0.00015039022,0.0001402502,0.0001168744,0.00002874516,0.0002375077,0.00002468102,0.00010720138],"category_scores_gemma":[0.00007989137,0.000039073104,0.00007224497,0.0001488367,0.00012314512,0.0002049905,0.000023176606,0.00035484,0.000046175657],"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.0015269693,0.00033576923,0.00028625337,0.00016727965,0.0000688412,0.00045786717,0.0022906822,0.010574593,0.9732172,0.0014381149,0.00046324675,0.00917322],"study_design_scores_gemma":[0.019213445,0.009294286,0.027083626,0.0066859038,0.00027457898,0.008141362,0.008010879,0.14231046,0.7775048,0.00016626685,0.000744157,0.0005702578],"about_ca_topic_score_codex":0.000003350086,"about_ca_topic_score_gemma":6.551214e-7,"teacher_disagreement_score":0.19571237,"about_ca_system_score_codex":0.000060364964,"about_ca_system_score_gemma":0.00028948422,"threshold_uncertainty_score":0.1593355},"labels":[],"label_agreement":null},{"id":"W2399882124","doi":"10.1016/j.ejor.2016.05.025","title":"Joint optimization models for shelf display and inventory control considering the impact of spatial relationship on demand","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Joint (building); Simulated annealing; Mathematical optimization; Heuristic; Operations research; Profit (economics); Optimization problem; Inventory control; Artificial intelligence; Economics; Mathematics; Algorithm; Microeconomics; Engineering","score_opus":0.13110328368520935,"score_gpt":0.3243333417852385,"score_spread":0.19323005810002913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399882124","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.48164767,0.00026628128,0.49097472,0.010672629,0.00031090234,0.0011415987,0.00001834353,0.0000136176905,0.014954221],"genre_scores_gemma":[0.99863523,0.000022665068,0.00026250258,0.00017505069,0.00069264707,0.00000577421,0.0000036374913,0.000018159333,0.00018431389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861056,0.0002286412,0.0004051584,0.0001141518,0.00048322303,0.00015824518],"domain_scores_gemma":[0.9985067,0.00043667646,0.00021002103,0.000112383685,0.0007092577,0.000024958577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048025483,0.00008695515,0.00012865858,0.00030577654,0.00027599983,0.0001829142,0.00016002775,0.000014200761,0.00013155017],"category_scores_gemma":[0.0012069627,0.00004534581,0.00009332557,0.00010018609,0.00013415817,0.0007202701,0.00007110112,0.0001327809,0.000010060526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010473296,0.00018038873,0.019306567,0.00008988563,0.00021977208,0.000020548407,0.000244568,0.82537067,0.001889577,0.13034748,0.017863372,0.003419852],"study_design_scores_gemma":[0.006334681,0.00066971354,0.07952163,0.00050014653,0.000055710094,0.000013449456,0.00024765596,0.9006425,0.000103971615,0.007977863,0.0037075172,0.00022515339],"about_ca_topic_score_codex":0.000022902828,"about_ca_topic_score_gemma":0.0000028770078,"teacher_disagreement_score":0.51698756,"about_ca_system_score_codex":0.000060367514,"about_ca_system_score_gemma":0.00006242936,"threshold_uncertainty_score":0.21227954},"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":"W2482679439","doi":"10.1016/j.ejor.2016.07.031","title":"When to introduce an online channel, and offer money back guarantees and personalized pricing?","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":186,"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; National Natural Science Foundation of China","keywords":"Channel (broadcasting); Order (exchange); Product (mathematics); Business; Dual (grammatical number); Selection (genetic algorithm); Microeconomics; Computer science; Industrial organization; Marketing; Economics; Telecommunications; Finance","score_opus":0.10634448224129936,"score_gpt":0.33083224127388766,"score_spread":0.2244877590325883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482679439","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98444474,0.0002955529,0.00054376014,0.01275427,0.00009803514,0.00014279447,0.0000050077847,0.0000071622053,0.0017086645],"genre_scores_gemma":[0.9947794,0.00010224189,0.0010473678,0.0008009696,0.0015568641,9.86799e-7,0.0000042023225,0.000028047743,0.001679939],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9984063,0.00023361776,0.00032165265,0.00022062066,0.0005814541,0.00023639042],"domain_scores_gemma":[0.9986715,0.00014192628,0.0000793746,0.0001222795,0.00091601105,0.000068913665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037350915,0.00011452741,0.0001668791,0.0004428889,0.00023629278,0.00045659332,0.00023117044,0.000015127069,0.00065674476],"category_scores_gemma":[0.0007161617,0.000074031224,0.000029025176,0.00019172033,0.00011786128,0.001095133,0.00024753675,0.00021600079,0.000088097826],"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.004219302,0.0008766043,0.13867515,0.000300399,0.0002401423,0.00069509976,0.0046042255,0.00004066122,0.2736339,0.010854554,0.071577534,0.49428242],"study_design_scores_gemma":[0.0041910224,0.0005304762,0.76642746,0.0006736846,0.00006169931,0.00020794976,0.0009759198,0.00108797,0.0002794092,0.00055580743,0.22451058,0.0004980088],"about_ca_topic_score_codex":0.000036238875,"about_ca_topic_score_gemma":0.000021464955,"teacher_disagreement_score":0.6277523,"about_ca_system_score_codex":0.000019772247,"about_ca_system_score_gemma":0.000045067765,"threshold_uncertainty_score":0.71908945},"labels":[],"label_agreement":null},{"id":"W2497949436","doi":"10.1016/j.ejor.2016.07.057","title":"A new lift-and-project operator","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Operator (biology); Lift (data mining); Mathematics; Set (abstract data type); Hull; Binary number; Combinatorics; Integer (computer science); Computer science; Discrete mathematics; Data mining; Arithmetic; Engineering","score_opus":0.1280800995088859,"score_gpt":0.38667762288483915,"score_spread":0.2585975233759532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497949436","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.0052558514,0.00034295785,0.9459765,0.03125538,0.00019607843,0.00017917562,0.0000022953848,0.000021679765,0.016770106],"genre_scores_gemma":[0.62336457,0.0009925357,0.3509143,0.00086729915,0.0010962893,0.0000027898525,9.008288e-7,0.000037149217,0.02272417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969893,0.0012211717,0.00034731682,0.00018311139,0.001007879,0.00025122406],"domain_scores_gemma":[0.9980643,0.00028692937,0.000056863068,0.0001990332,0.0011095179,0.00028339977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052453196,0.0000745308,0.000105196275,0.00035830578,0.000211577,0.0005255338,0.00085018843,0.000014076289,0.00023323848],"category_scores_gemma":[0.00088245404,0.000043111577,0.000039870236,0.00040654163,0.00007553708,0.0010064063,0.00032749874,0.00025908323,0.00021722727],"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.000113121525,0.00013064862,0.0009867593,0.000013243275,0.000080570404,0.000512779,0.0022472122,0.0003299227,0.030452177,0.30231223,0.27673885,0.3860825],"study_design_scores_gemma":[0.0070278747,0.003707689,0.014075023,0.0005115901,0.000005988474,0.001175718,0.00017902146,0.012806189,0.0042628804,0.0031738607,0.9524819,0.0005922257],"about_ca_topic_score_codex":0.000003945197,"about_ca_topic_score_gemma":8.017321e-7,"teacher_disagreement_score":0.6757431,"about_ca_system_score_codex":0.00004543855,"about_ca_system_score_gemma":0.00097427925,"threshold_uncertainty_score":0.5067734},"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":"W2516687230","doi":"10.1016/j.ejor.2016.08.024","title":"Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":105,"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 General Hospital; University Health Network; University of Toronto","funders":"","keywords":"Benders' decomposition; Knapsack problem; Scheduling (production processes); Computer science; Time horizon; Integer programming; Schedule; Mathematical optimization; Algorithm; Mathematics","score_opus":0.40222369779406786,"score_gpt":0.5037765717942564,"score_spread":0.10155287400018853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516687230","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.13276109,0.00009317618,0.842481,0.021961216,0.0002704531,0.0010074672,0.00009175627,0.000026706002,0.0013071469],"genre_scores_gemma":[0.8219219,0.000018570858,0.17630175,0.00032760622,0.0010111197,0.0000542549,0.00011677129,0.000043512213,0.00020455105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99260855,0.0043849787,0.0013106673,0.00029457288,0.0008190295,0.0005822222],"domain_scores_gemma":[0.9928921,0.0021896095,0.00035975638,0.00020144825,0.0040922994,0.000264777],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.015511441,0.00016018131,0.00026163182,0.00031225276,0.0028324784,0.00014053777,0.00032389516,0.000086036816,0.00022124256],"category_scores_gemma":[0.0061371564,0.000103615304,0.00010456429,0.00035686314,0.00008641761,0.00052188936,0.000075038995,0.00080273394,0.00005551851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015866108,0.0010267923,0.021768134,0.0008747603,0.00028044073,0.00013878016,0.0042967033,0.66799366,0.11097119,0.10628678,0.010446918,0.07432924],"study_design_scores_gemma":[0.01828934,0.0049955114,0.021447627,0.0068890075,0.00007628078,0.00009136076,0.012201501,0.9105244,0.0075690933,0.001964753,0.014698472,0.0012526509],"about_ca_topic_score_codex":0.0000057567313,"about_ca_topic_score_gemma":0.0000076178935,"teacher_disagreement_score":0.68916076,"about_ca_system_score_codex":0.00042433987,"about_ca_system_score_gemma":0.0018061199,"threshold_uncertainty_score":0.9984657},"labels":[],"label_agreement":null},{"id":"W2517446547","doi":"10.1016/j.ejor.2016.08.014","title":"A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for International Governance Innovation; Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Greenhouse gas; Hierarchical database model; Graph; China; Conflict resolution; Computer science; Operations research; Theoretical computer science; Mathematics; Political science; Data mining; Geology; Law","score_opus":0.18617372860610062,"score_gpt":0.4356804138662638,"score_spread":0.2495066852601632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517446547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49731222,0.00001619123,0.49299628,0.008973095,0.000008110485,0.00026112373,0.000036742287,0.0000041671374,0.00039206966],"genre_scores_gemma":[0.97277725,0.000031027448,0.023889715,0.0000839769,0.00041297066,0.000023827968,0.0000043408045,0.000019756066,0.0027571588],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9962491,0.0009225584,0.00063563196,0.00035803142,0.0015632105,0.00027150236],"domain_scores_gemma":[0.9960949,0.0016753032,0.00016359445,0.00031804774,0.0013289846,0.00041920107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011334662,0.00011249374,0.00019522567,0.00044334686,0.0005348713,0.00023928723,0.00065472856,0.000027511553,0.00003841617],"category_scores_gemma":[0.0023894245,0.000058944006,0.00006429299,0.00048709442,0.00028985902,0.00037611413,0.0001456931,0.00024457785,0.00006150805],"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.0040099113,0.00043056047,0.015538204,0.000017462891,0.000110105815,0.000024236255,0.0032402652,0.014552296,0.24317089,0.19372901,0.032636218,0.49254084],"study_design_scores_gemma":[0.007854626,0.006350817,0.47967553,0.00043278225,0.0000645118,0.00031813467,0.00026368827,0.1417696,0.010153682,0.2464497,0.10575784,0.000909083],"about_ca_topic_score_codex":0.0000031996763,"about_ca_topic_score_gemma":0.000005956735,"teacher_disagreement_score":0.49163178,"about_ca_system_score_codex":0.000041195235,"about_ca_system_score_gemma":0.00018325914,"threshold_uncertainty_score":0.41138515},"labels":[],"label_agreement":null},{"id":"W2519691106","doi":"10.1016/j.ejor.2018.05.017","title":"Data-driven analytics to support scheduling of multi-priority multi-class patients with wait time targets","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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 Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Analytics; Schedule; Deadline-monotonic scheduling; Operations research; Operations management; Dynamic priority scheduling; Data mining; Rate-monotonic scheduling","score_opus":0.2803828324942689,"score_gpt":0.4989741436652641,"score_spread":0.21859131117099523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519691106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8886527,0.00003683435,0.10349914,0.003611265,0.00044734465,0.0013185205,0.00049067824,0.000020463482,0.0019230525],"genre_scores_gemma":[0.75717044,0.000018709841,0.24039535,0.00034217892,0.00062334345,0.0000036015085,0.0002651003,0.000046238194,0.0011350489],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99378467,0.002777632,0.0012752399,0.00032926424,0.0013335745,0.0004996056],"domain_scores_gemma":[0.9876622,0.00037870437,0.00034967266,0.0005433138,0.010610948,0.00045513906],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009070285,0.00015273281,0.00033498346,0.0004679836,0.0011802117,0.00006752129,0.0007813232,0.00006919069,0.0009605078],"category_scores_gemma":[0.0035710554,0.000115709125,0.000041361785,0.0006415888,0.00017843783,0.00054723513,0.00040479866,0.0010709574,0.00077455264],"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.005139958,0.007095963,0.5492439,0.00084049674,0.0011915249,0.0003881655,0.037777975,0.2756612,0.01397286,0.0023255087,0.08089848,0.025463942],"study_design_scores_gemma":[0.00854403,0.0060739517,0.22865687,0.0009907477,0.00006123499,0.000012072297,0.0014433902,0.71882445,0.00021428741,0.000008477323,0.034635767,0.0005347242],"about_ca_topic_score_codex":0.00002718173,"about_ca_topic_score_gemma":0.00010079103,"teacher_disagreement_score":0.44316325,"about_ca_system_score_codex":0.00020195321,"about_ca_system_score_gemma":0.0023398711,"threshold_uncertainty_score":0.99995273},"labels":[],"label_agreement":null},{"id":"W2546223729","doi":"10.1016/j.ejor.2018.06.046","title":"Column generation for vehicle routing problems with multiple synchronization constraints","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Synchronization (alternating current); Variable (mathematics); Operations research; Routing (electronic design automation); Vehicle routing problem; Computer science; Heuristic; Mathematical optimization; Engineering; Computer network; Mathematics; Artificial intelligence","score_opus":0.08981736353026892,"score_gpt":0.3414826033651602,"score_spread":0.25166523983489125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546223729","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.14920554,0.0000470747,0.847483,0.00021219958,0.00018508668,0.00033415496,0.000009134877,0.000036975445,0.0024868941],"genre_scores_gemma":[0.86327356,0.000011909964,0.13532075,0.00002893724,0.0011671454,0.0000057534103,0.0000184564,0.000052028652,0.000121439196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979326,0.00060168986,0.00047780923,0.00014248138,0.00057617907,0.00026922062],"domain_scores_gemma":[0.99680287,0.0002892851,0.00009234809,0.000118259675,0.002586186,0.00011103203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005580449,0.00010094349,0.0001296671,0.00019004222,0.0004007495,0.00023933283,0.00019564264,0.000027612637,0.00010591578],"category_scores_gemma":[0.0011560894,0.00008984478,0.000033586388,0.00035137447,0.00020294615,0.00034906197,0.000025766616,0.00026941692,0.000027410913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075070166,0.00005535062,0.0028170992,0.00004756681,0.00008853274,0.000015397614,0.0011253959,0.8666602,0.10070851,0.0008615797,0.0039192406,0.023626097],"study_design_scores_gemma":[0.001258781,0.0005957003,0.0016800635,0.00009831538,0.0000075597586,0.000061247796,0.00009873779,0.9866022,0.0076387427,0.000012364064,0.001826354,0.00011994148],"about_ca_topic_score_codex":0.0000011092112,"about_ca_topic_score_gemma":0.000006948394,"teacher_disagreement_score":0.71406806,"about_ca_system_score_codex":0.0001426276,"about_ca_system_score_gemma":0.0001869715,"threshold_uncertainty_score":0.36637637},"labels":[],"label_agreement":null},{"id":"W2553201125","doi":"10.1016/j.ejor.2019.11.048","title":"Improvement of technical efficiency of firm groups","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","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é de Sherbrooke","funders":"","keywords":"Merge (version control); Impossibility; Computer science; Complementarity (molecular biology); Industrial organization; Microeconomics; Mathematical economics; Mathematical optimization; Viewpoints; Operations research; Business; Economics; Mathematics","score_opus":0.07066828771670115,"score_gpt":0.2998456679668514,"score_spread":0.22917738025015028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553201125","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9234192,0.0005570387,0.0018039327,0.0003786012,0.00018513687,0.00013029677,0.000037452362,0.0000014910449,0.073486894],"genre_scores_gemma":[0.99786925,0.00012285548,0.0007479581,0.000026405403,0.000106853826,7.050599e-7,0.0000021222806,0.000013634175,0.0011102333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99844956,0.000067811496,0.0010366689,0.00014202677,0.00013472521,0.00016918078],"domain_scores_gemma":[0.9988664,0.00013715772,0.000394753,0.00020489199,0.00032999978,0.00006682294],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0062471116,0.00006249226,0.0002809509,0.00027781105,0.000043231485,0.000027569158,0.00042139326,0.000020879721,0.0009962494],"category_scores_gemma":[0.00026948535,0.000058485115,0.000116646275,0.00014293985,0.00011346916,0.0001742291,0.00012810797,0.0002573343,0.00018272862],"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.00016574163,0.0003191438,0.007790402,0.000058046917,0.000060664228,0.000008624671,0.00041334948,0.0022021523,0.028653903,0.95796007,0.0013389303,0.0010289724],"study_design_scores_gemma":[0.024212305,0.040370118,0.38563457,0.0012511561,0.000046442627,0.00038244063,0.003696745,0.016050626,0.083581366,0.19588034,0.24656096,0.0023329183],"about_ca_topic_score_codex":0.0000100924435,"about_ca_topic_score_gemma":7.220678e-7,"teacher_disagreement_score":0.7620797,"about_ca_system_score_codex":0.00007265482,"about_ca_system_score_gemma":0.00008548666,"threshold_uncertainty_score":0.999917},"labels":[],"label_agreement":null},{"id":"W2556044044","doi":"10.1016/j.ejor.2016.11.022","title":"Integrated optimization of strategic and tactical planning decisions in forestry","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Forest Management and Policy","field":"Environmental Science","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":"Technical University of Nova Scotia; Université Laval; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Université Laval","keywords":"Solver; Computer science; Mathematical optimization; Integrated business planning; Column generation; Strategic planning; Optimization problem; Heuristics; Operations research; Mathematics; Algorithm","score_opus":0.1494577172923586,"score_gpt":0.3817257983010914,"score_spread":0.23226808100873278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556044044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95728403,0.000025893309,0.0026910158,0.0009932651,0.000022229522,0.00005820914,0.0000020553744,0.0000014324618,0.03892184],"genre_scores_gemma":[0.99496424,0.0000797052,0.004122534,0.000018262486,0.000039112012,3.8360406e-7,0.0000012254073,0.000006342614,0.0007682195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9986867,0.00037548775,0.0002765659,0.00007986711,0.00045402418,0.00012735551],"domain_scores_gemma":[0.9994558,0.00029137635,0.000053863067,0.000060769078,0.00006190358,0.00007625435],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020580913,0.0000447519,0.00006938261,0.0001663507,0.000054915763,0.000038999304,0.00016341779,0.00001229193,0.0014181184],"category_scores_gemma":[0.0006043678,0.000026975027,0.0000161148,0.00023940296,0.00018693758,0.00029710698,0.00010773324,0.00016013521,0.000070829796],"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.0011353059,0.0005168555,0.38768172,0.000015997828,0.00006175329,0.0008808603,0.0016183445,0.47699142,0.02982371,0.03339576,0.025465753,0.042412523],"study_design_scores_gemma":[0.00557229,0.0025979064,0.8758729,0.0011106814,0.000017007042,0.00022413356,0.0008169563,0.08876193,0.0009191679,0.004596426,0.019084508,0.0004261059],"about_ca_topic_score_codex":0.0000131227225,"about_ca_topic_score_gemma":0.0000038223016,"teacher_disagreement_score":0.48819116,"about_ca_system_score_codex":0.000050292994,"about_ca_system_score_gemma":0.00003864488,"threshold_uncertainty_score":0.99949473},"labels":[],"label_agreement":null},{"id":"W2559457754","doi":"10.1016/j.ejor.2016.11.042","title":"An iterative pseudo-gap enumeration approach for the Multidimensional Multiple-choice Knapsack Problem","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","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":"University of Alberta","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Knapsack problem; Enumeration; Benchmark (surveying); Heuristics; Mathematical optimization; Mathematics; Constraint (computer-aided design); Limit (mathematics); Combinatorial optimization; Convergence (economics); Computer science; Algorithm; Combinatorics","score_opus":0.10061928635637359,"score_gpt":0.340530058788879,"score_spread":0.23991077243250541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559457754","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.016897231,0.00030347242,0.9750347,0.001955823,0.0003117185,0.00082375726,0.000055997505,0.00005035201,0.004566964],"genre_scores_gemma":[0.90844434,0.000107462656,0.08964273,0.000085746346,0.0007966363,0.000024604191,0.000033489858,0.00005729029,0.0008077084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762565,0.00072581536,0.00049296796,0.0001716946,0.0007099312,0.00027394886],"domain_scores_gemma":[0.99633056,0.0017399455,0.00007771892,0.00018588266,0.0015172377,0.00014864914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038754845,0.00013986397,0.000134571,0.00018409644,0.0004409291,0.00022666923,0.00033784032,0.000032590782,0.00014527334],"category_scores_gemma":[0.0008680125,0.00007738049,0.000077683944,0.00019847424,0.00010589553,0.0006674994,0.000030748884,0.00033991752,0.000038322556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016819929,0.00016341996,0.0009296609,0.0000369186,0.00013914666,0.000007531139,0.0013115957,0.8791366,0.08653414,0.0043904823,0.014835362,0.012346925],"study_design_scores_gemma":[0.0034776183,0.0007589275,0.0052668066,0.00015381552,0.000018292923,0.000093100854,0.00018558986,0.9293881,0.0049333773,0.000104230734,0.05530743,0.00031271178],"about_ca_topic_score_codex":0.0000017424292,"about_ca_topic_score_gemma":0.000002801565,"teacher_disagreement_score":0.8915471,"about_ca_system_score_codex":0.0000846643,"about_ca_system_score_gemma":0.000113525515,"threshold_uncertainty_score":0.3391315},"labels":[],"label_agreement":null},{"id":"W2584186442","doi":"10.1016/j.ejor.2017.01.044","title":"Decision rule approximations for the risk averse reservoir management problem","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water resources management and optimization","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":"HEC Montréal; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Hydro-Québec","keywords":"Computer science; Stochastic programming; Mathematical optimization; Decision rule; Minification; Affine transformation; Stochastic modelling; Dynamic programming; Operations research; Artificial intelligence; Mathematics","score_opus":0.06484209147452236,"score_gpt":0.31827447181085944,"score_spread":0.2534323803363371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584186442","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.0860478,0.00042601695,0.7461234,0.0032312933,0.0006723998,0.0016327485,0.000032941945,0.000048862676,0.16178459],"genre_scores_gemma":[0.89822495,0.001016664,0.09293659,0.000021834432,0.00065991114,0.00002785083,0.000012949434,0.000055617926,0.0070436248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986257,0.00017529081,0.00030623903,0.000091480004,0.0006150284,0.00018624893],"domain_scores_gemma":[0.9989036,0.00020102729,0.00009559545,0.0003238613,0.00041673158,0.00005923211],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004657088,0.00007579915,0.000076361044,0.00018439823,0.0013066093,0.0007600555,0.00081783725,0.000011728161,0.000078881814],"category_scores_gemma":[0.0002907192,0.00004980913,0.000070433714,0.000083337036,0.00007110284,0.0004263804,0.00017437722,0.00026495245,0.00007718423],"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.00010025182,0.000035828383,0.00033577252,0.000052920288,0.000158006,0.000026426318,0.00038471387,0.90938497,0.00005509072,0.0038467958,0.05135744,0.034261774],"study_design_scores_gemma":[0.0018879076,0.00017511091,0.03517065,0.00015224282,0.000048735663,0.000010114223,0.00036308082,0.47023776,0.00013585805,0.0025973557,0.48905742,0.00016376837],"about_ca_topic_score_codex":0.0000017786163,"about_ca_topic_score_gemma":0.0000030996757,"teacher_disagreement_score":0.8121772,"about_ca_system_score_codex":0.000050476432,"about_ca_system_score_gemma":0.000012381944,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W2588539916","doi":"10.1016/j.ejor.2017.01.045","title":"A routing and scheduling approach to rail transportation of hazardous materials with demand due dates","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","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":"McMaster University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Tardiness; Scheduling (production processes); Integer programming; Hazardous waste; Computer science; Operations research; Routing (electronic design automation); Job shop scheduling; Train; Heuristic; Mathematical optimization; Transport engineering; Engineering; Mathematics; Computer network; Algorithm","score_opus":0.21346693454947477,"score_gpt":0.4330628127785226,"score_spread":0.21959587822904783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588539916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96827465,0.00008331499,0.026736401,0.0018833231,0.000031802043,0.000089184134,0.00001553121,0.0000013320157,0.0028844818],"genre_scores_gemma":[0.9780485,0.000054908218,0.02137967,0.000020218775,0.00014701544,7.48956e-7,0.0000041956873,0.0000097005095,0.00033501486],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9958884,0.00097151566,0.00078545965,0.0002171788,0.00197193,0.00016547866],"domain_scores_gemma":[0.99673134,0.00042732808,0.00040192564,0.000294288,0.001990036,0.00015510009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021631941,0.00007817476,0.00028915348,0.00034673812,0.00071386504,0.00096262473,0.00074286823,0.000015838998,0.00007345351],"category_scores_gemma":[0.0039056956,0.00004791606,0.000048926424,0.00022728152,0.0001970527,0.00065224036,0.00006319242,0.00019192186,0.000019205201],"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.0076798797,0.0009376942,0.15572071,0.00013082959,0.0010447887,0.0012292231,0.03426699,0.25557053,0.3575914,0.036761854,0.0035521125,0.145514],"study_design_scores_gemma":[0.0017492217,0.0007953652,0.9716622,0.00023516921,0.00004621586,0.00014972265,0.003688703,0.004768941,0.014251646,0.0012234139,0.0012145702,0.00021478598],"about_ca_topic_score_codex":0.000023738292,"about_ca_topic_score_gemma":0.000015711452,"teacher_disagreement_score":0.8159415,"about_ca_system_score_codex":0.000012295244,"about_ca_system_score_gemma":0.00016045819,"threshold_uncertainty_score":0.9282612},"labels":[],"label_agreement":null},{"id":"W2594867531","doi":"10.1016/j.ejor.2017.03.011","title":"Polynomial optimization for water networks: Global solutions for the valve setting problem","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Water Systems and Optimization","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Solver; Mathematical optimization; Polynomial; Quadratic programming; Optimization problem; Mathematics; Quadratic equation; Semidefinite programming; Computer science; Applied mathematics","score_opus":0.06819483357295815,"score_gpt":0.32004444419336636,"score_spread":0.2518496106204082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594867531","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.0011682872,0.00024133919,0.99287605,0.002309999,0.00068480655,0.0005683315,0.000028176439,0.000013701412,0.0021093169],"genre_scores_gemma":[0.9712261,0.000052563097,0.025629085,0.00002273577,0.002589166,0.00002827709,0.000032998258,0.0000359562,0.00038313156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998746,0.00016400774,0.0003699614,0.0000902922,0.00028829434,0.00034145126],"domain_scores_gemma":[0.9986313,0.00014422284,0.00007241511,0.00016825493,0.0009175447,0.00006623568],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.004958926,0.00008219994,0.00009821197,0.00005066789,0.0016909308,0.0007419089,0.00042449005,0.000024752455,0.00002078684],"category_scores_gemma":[0.00025733167,0.000050076655,0.00011561233,0.000037110312,0.000058316495,0.00042666637,0.000076625205,0.00016367133,0.000005544991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003632985,0.000008345361,0.000046877452,0.000015836464,0.000063012725,0.0000014209246,0.0001179523,0.9408964,0.00008336362,0.00023380072,0.057345163,0.0011515028],"study_design_scores_gemma":[0.0007134989,0.00011698249,0.0007211798,0.000050468007,0.000015806823,0.000023813567,0.000044360528,0.97784287,0.00009465376,0.0000277347,0.02027527,0.00007338531],"about_ca_topic_score_codex":0.0000037884006,"about_ca_topic_score_gemma":0.00001031139,"teacher_disagreement_score":0.9700578,"about_ca_system_score_codex":0.00009937679,"about_ca_system_score_gemma":0.00005764846,"threshold_uncertainty_score":0.99960876},"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":"W2599098979","doi":"10.1016/j.ejor.2018.11.032","title":"Sustainable transmission planning in imperfectly competitive electricity industries: Balancing economic and environmental outcomes","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Power System Optimization","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":"HEC Montréal","funders":"HEC Montréal; Aalto-Yliopisto; McGill University; National Science Foundation","keywords":"Economics; Oligopoly; Cournot competition; Microeconomics; Electricity; Incentive; Electricity market; Environmental economics; Variable cost; Industrial organization; Renewable energy; Electric power industry; Engineering","score_opus":0.017768946206609966,"score_gpt":0.2761366840218413,"score_spread":0.25836773781523137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599098979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98665446,0.00056118786,0.0051767346,0.00011894873,0.00006257839,0.00014864361,0.0000028331472,0.000011098342,0.007263501],"genre_scores_gemma":[0.999089,0.00010918568,0.00035402543,0.000013399375,0.00014777793,0.0000011925761,0.000004567245,0.000023378592,0.0002574759],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99851453,0.00042031295,0.000369339,0.00010831424,0.0002968714,0.00029065207],"domain_scores_gemma":[0.9994679,0.00024263006,0.00004073972,0.000058304013,0.000093736155,0.00009667231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025422415,0.00009343285,0.00015427294,0.00039679126,0.00016743616,0.000105144136,0.0001372552,0.000028620105,0.00009008606],"category_scores_gemma":[0.00014404014,0.00008492503,0.000019541145,0.00017288889,0.0000642974,0.0003779242,0.000029422128,0.00046854172,0.000017735887],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008272221,0.00033263883,0.43557417,0.00025907005,0.00048792164,0.002346513,0.025562286,0.40133527,0.08439531,0.008341731,0.013652692,0.026885195],"study_design_scores_gemma":[0.0071858047,0.003836964,0.5334786,0.00076001155,0.000026889142,0.00084611407,0.010462907,0.37966818,0.03432672,0.00012635716,0.02828164,0.0009997935],"about_ca_topic_score_codex":0.0000089882,"about_ca_topic_score_gemma":0.0000014164414,"teacher_disagreement_score":0.09790447,"about_ca_system_score_codex":0.0004663794,"about_ca_system_score_gemma":0.0001336984,"threshold_uncertainty_score":0.34631422},"labels":[],"label_agreement":null},{"id":"W2602684069","doi":"10.1016/j.ejor.2018.01.054","title":"The quadratic shortest path problem: complexity, approximability, and solution methods","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"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":"Air Force Office of Scientific Research; Air Force Materiel Command; U.S. Air Force; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Shortest path problem; Quadratic equation; Mathematical optimization; Combinatorics; Regular polygon; Function (biology); Approximation algorithm; Graph","score_opus":0.16577740807923447,"score_gpt":0.4255515052571589,"score_spread":0.25977409717792443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602684069","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.040392864,0.0005916156,0.93375117,0.0023784821,0.0002902903,0.00031510025,0.0000035275925,0.00004717208,0.022229785],"genre_scores_gemma":[0.5202755,0.00009239445,0.4789783,0.00002241954,0.0004380543,0.0000023268758,0.0000017048218,0.000029176792,0.00016012379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945925,0.0037872784,0.0005536562,0.00013238663,0.00064982387,0.00028436107],"domain_scores_gemma":[0.99737334,0.00096316,0.000064506436,0.00019061295,0.0012705126,0.00013786502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024506766,0.00010242827,0.00014024982,0.00013102741,0.00071890553,0.0003716837,0.0003467525,0.000022465663,0.000055028504],"category_scores_gemma":[0.0016090783,0.00007199962,0.0000393263,0.00033764154,0.0006237324,0.00024369705,0.00014555818,0.000557837,0.000024285644],"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.00041196632,0.0004513626,0.00616143,0.00028352733,0.0005677846,0.00011550305,0.009105756,0.115402736,0.13867202,0.11671324,0.035845164,0.5762695],"study_design_scores_gemma":[0.0007238874,0.0007990355,0.019759318,0.00011331727,0.000016442516,0.0003072649,0.00028418744,0.95107454,0.0022400888,0.005493329,0.018950045,0.00023856551],"about_ca_topic_score_codex":0.0000022251406,"about_ca_topic_score_gemma":0.0000045710444,"teacher_disagreement_score":0.8356718,"about_ca_system_score_codex":0.00008894325,"about_ca_system_score_gemma":0.000110678506,"threshold_uncertainty_score":0.8493605},"labels":[],"label_agreement":null},{"id":"W2605417500","doi":"10.1016/j.ejor.2017.03.082","title":"Properties of ladder tournaments","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Experimental Behavioral Economics Studies","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Transitive relation; Tournament; Hierarchy; Ranking (information retrieval); Productivity; Rank (graph theory); Function (biology); Reflexivity; Hierarchical organization; Microeconomics; Mathematical economics; Computer science; Process (computing); Econometrics; Externality; Economics; Mathematics; Artificial intelligence; Combinatorics; Management; Sociology","score_opus":0.3520935372785382,"score_gpt":0.4814552831862474,"score_spread":0.1293617459077092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605417500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8529597,0.00042739464,0.0000048998318,0.0035841132,0.00021692211,0.000090229485,0.000002245894,0.0000018331029,0.14271267],"genre_scores_gemma":[0.9956397,0.00027639436,0.00045650912,0.000027520544,0.00039100583,0.000001091367,2.0573611e-7,0.000009648429,0.0031979305],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9978652,0.0007077881,0.00035644206,0.0000816932,0.0007944402,0.00019445432],"domain_scores_gemma":[0.99839604,0.00004328272,0.00024090473,0.0001574485,0.0010549088,0.000107433414],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0055765957,0.000052599127,0.0001323101,0.00010669635,0.0015766124,0.00032848047,0.0007653656,0.000013065099,0.0002363182],"category_scores_gemma":[0.0011499688,0.00004196864,0.00006291572,0.000038055066,0.0008783099,0.0006044959,0.00021434743,0.00023785235,0.00007028127],"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.0009141966,0.0015833802,0.16358392,0.000056912937,0.0005390415,0.00057438365,0.1152997,0.00015861388,0.52443826,0.10688005,0.051222257,0.03474927],"study_design_scores_gemma":[0.0065571507,0.003272716,0.37211716,0.001507007,0.0000629585,0.00008154666,0.0864501,0.00006928423,0.20493715,0.0020831537,0.32185662,0.0010051628],"about_ca_topic_score_codex":0.00021331983,"about_ca_topic_score_gemma":0.000060851842,"teacher_disagreement_score":0.31950113,"about_ca_system_score_codex":0.0001179322,"about_ca_system_score_gemma":0.00033517057,"threshold_uncertainty_score":0.9997232},"labels":[],"label_agreement":null},{"id":"W2618694566","doi":"10.1016/j.ejor.2017.05.035","title":"Resource constrained routing and scheduling: Review and research prospects","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":108,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Operations research; Heuristic; Routing (electronic design automation); Service (business); Resource (disambiguation); Management science; Operations management; Business; Computer network; Engineering; Marketing; Artificial intelligence","score_opus":0.14144834507892676,"score_gpt":0.42008395228908246,"score_spread":0.2786356072101557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618694566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57175696,0.07258073,0.026280385,0.041585844,0.0004218591,0.002090552,0.000024200257,0.00016416653,0.2850953],"genre_scores_gemma":[0.94506186,0.004102955,0.04988219,0.00006822026,0.00035688953,0.0000020192256,0.0000014513109,0.000045597066,0.00047879704],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965415,0.0016297034,0.0004567126,0.00017082418,0.00087177,0.00032946488],"domain_scores_gemma":[0.99763316,0.0005460178,0.00009221724,0.0002729115,0.0012271814,0.00022853947],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.027736573,0.000098981574,0.0002145015,0.00022934873,0.0010774895,0.00070825784,0.00041306988,0.000026491853,0.000050838866],"category_scores_gemma":[0.009449678,0.00008755811,0.0000271295,0.00016876777,0.0004631431,0.0003568178,0.00025362536,0.001145685,0.000013771459],"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.0005901781,0.00050890906,0.04561033,0.010854322,0.0014184366,0.004704336,0.012421394,0.12452026,0.1259334,0.14390455,0.076349415,0.4531845],"study_design_scores_gemma":[0.012667382,0.0031952206,0.25118688,0.02552688,0.00023388724,0.0067963777,0.0029268789,0.49852547,0.009862091,0.0021805163,0.18442273,0.0024756826],"about_ca_topic_score_codex":0.0000012801951,"about_ca_topic_score_gemma":3.8300544e-7,"teacher_disagreement_score":0.45070878,"about_ca_system_score_codex":0.00005482899,"about_ca_system_score_gemma":0.00012540851,"threshold_uncertainty_score":0.99889416},"labels":[],"label_agreement":null},{"id":"W2626391197","doi":"10.1016/j.ejor.2017.06.028","title":"The static bike relocation problem with multiple vehicles and visits","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":124,"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":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Relocation; Iterated local search; Computer science; Integer programming; Metaheuristic; Bike sharing; Scheme (mathematics); Vehicle routing problem; Service (business); Mathematical optimization; Iterated function; Operations research; Transport engineering; Routing (electronic design automation); Algorithm; Computer network; Mathematics; Engineering","score_opus":0.056017343068158795,"score_gpt":0.32570382956338184,"score_spread":0.26968648649522303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626391197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98414093,0.00016823805,0.0055484497,0.0047828793,0.000065965156,0.00018653166,0.0000072732496,0.000014664441,0.0050850846],"genre_scores_gemma":[0.9969532,0.00015178848,0.0025314596,0.000017913497,0.000070477676,0.0000031271186,0.0000037528455,0.000013618217,0.0002546458],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99908984,0.000114784394,0.00023921015,0.00005705878,0.00038802956,0.00011110871],"domain_scores_gemma":[0.99880856,0.00017938174,0.000052951502,0.00014622699,0.00075538206,0.000057473873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019918454,0.00004891011,0.000052326304,0.00007420191,0.0008230181,0.000385488,0.00020266851,0.00000777898,0.000008270659],"category_scores_gemma":[0.00024863824,0.000030821022,0.000011467987,0.00007287325,0.00013143402,0.00031989755,0.000012448844,0.00025931667,0.000011797136],"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.0010402433,0.00042076985,0.15062076,0.0004150929,0.000890796,0.0004236684,0.013619574,0.1971486,0.1055513,0.0905012,0.053574167,0.38579383],"study_design_scores_gemma":[0.0009657285,0.000239284,0.9568087,0.000099357436,0.000007202752,0.000041064235,0.00041483226,0.008918908,0.0010691622,0.00018541401,0.031158386,0.00009195791],"about_ca_topic_score_codex":0.0000037760974,"about_ca_topic_score_gemma":0.00004538155,"teacher_disagreement_score":0.8061879,"about_ca_system_score_codex":0.000021951888,"about_ca_system_score_gemma":0.000077827455,"threshold_uncertainty_score":0.6330073},"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":"W2693076760","doi":"10.1016/j.ejor.2018.02.045","title":"Trade-off preservation in inverse multi-objective convex optimization","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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 Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Inverse; Linear programming; Computer science; Pareto principle; Mathematics; Optimization problem; Convex optimization; Regular polygon","score_opus":0.08503374081602867,"score_gpt":0.3640516131639794,"score_spread":0.2790178723479507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2693076760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038129573,0.000073500894,0.99006534,0.0017957456,0.00030795857,0.0002998401,0.00000296989,0.000022437629,0.0036192623],"genre_scores_gemma":[0.28246596,0.00011103803,0.7160032,0.00033567633,0.00046014896,0.0000061466426,0.0000075374264,0.000031865235,0.0005784583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99555624,0.0019814097,0.000666739,0.00034462588,0.0011165616,0.00033441352],"domain_scores_gemma":[0.99639505,0.0003105939,0.0002312138,0.00028890162,0.0026023171,0.00017189929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004661056,0.00014330167,0.00018897715,0.0008113687,0.00030609863,0.0002794615,0.000953532,0.000038434435,0.00011384939],"category_scores_gemma":[0.0021169083,0.00013286054,0.000056279107,0.0014046232,0.000263592,0.0029984142,0.00025471373,0.00060235494,0.00008394566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017459643,0.000524404,0.0012544789,0.000009059152,0.000045432378,0.00026783254,0.0070338766,0.9599548,0.0019928731,0.00598246,0.0017140129,0.021046171],"study_design_scores_gemma":[0.002114149,0.00057045906,0.01819756,0.00005740213,0.0000018152137,0.0000701736,0.00024373819,0.975071,0.0010607931,0.00013747164,0.0023181066,0.00015731138],"about_ca_topic_score_codex":0.0000054768634,"about_ca_topic_score_gemma":0.000011787897,"teacher_disagreement_score":0.278653,"about_ca_system_score_codex":0.00030317518,"about_ca_system_score_gemma":0.00047572103,"threshold_uncertainty_score":0.54178953},"labels":[],"label_agreement":null},{"id":"W2724744744","doi":"10.1016/j.ejor.2017.06.062","title":"Production and replacement policies for a deteriorating manufacturing system under random demand and quality","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":44,"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":"Hamilton–Jacobi–Bellman equation; Markov decision process; Production (economics); Mathematical optimization; Time horizon; Computer science; Sensitivity (control systems); Production planning; Quality (philosophy); Markov process; Order (exchange); Bellman equation; Operations research; Mathematics; Economics; Engineering; Microeconomics","score_opus":0.09305910125818627,"score_gpt":0.35965701011906903,"score_spread":0.26659790886088275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2724744744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511692,0.00019932861,0.046306208,0.0008640571,0.00015691096,0.00026633206,0.000002726923,0.000010005616,0.0010252324],"genre_scores_gemma":[0.9953376,0.00018854061,0.00405723,0.0000070487117,0.00024926383,0.000004623404,0.0000010739639,0.000012646714,0.00014199193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99898016,0.0002491522,0.0003084385,0.00009953087,0.00023654326,0.00012617033],"domain_scores_gemma":[0.9992947,0.000112561625,0.00008446374,0.00012607391,0.00032300575,0.000059204773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005841507,0.000060572493,0.00011719346,0.00007262804,0.0005866754,0.00040744303,0.000088999346,0.000013219774,0.000002241075],"category_scores_gemma":[0.0009590535,0.00004837309,0.000021027003,0.000014920789,0.00009048101,0.00038506332,0.000044927834,0.00014072252,7.1721837e-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.0034488486,0.00010290916,0.006335737,0.0035084437,0.00042885318,0.000033970893,0.006759992,0.7809245,0.15049176,0.016647091,0.0028132887,0.028504606],"study_design_scores_gemma":[0.017954834,0.0025496671,0.51599914,0.004307851,0.00011314339,0.0010024835,0.012218486,0.3207022,0.11413755,0.0012601637,0.008509092,0.0012454324],"about_ca_topic_score_codex":0.000005204782,"about_ca_topic_score_gemma":0.0000061039837,"teacher_disagreement_score":0.5096634,"about_ca_system_score_codex":0.000065141474,"about_ca_system_score_gemma":0.00002392873,"threshold_uncertainty_score":0.45122924},"labels":[],"label_agreement":null},{"id":"W2734135737","doi":"10.1016/j.ejor.2017.06.066","title":"On the joint signature of several coherent systems with some shared components","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Statistical Distribution Estimation and Applications","field":"Mathematics","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":"Joint (building); Signature (topology); Representation (politics); Computer science; Joint probability distribution; Reliability (semiconductor); Matrix (chemical analysis); Independent and identically distributed random variables; Theoretical computer science; Statistical physics; Mathematics; Physics; Random variable; Power (physics); Statistics; Engineering; Quantum mechanics","score_opus":0.3477187785040592,"score_gpt":0.4355698385927779,"score_spread":0.08785106008871874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734135737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6487051,0.0001441841,0.27304295,0.032813974,0.0003697134,0.0018518118,0.0010190152,0.000026672184,0.042026572],"genre_scores_gemma":[0.9976934,0.0000046273585,0.0015056822,0.000053412576,0.00011922331,0.000006429856,0.000016976153,0.000012685649,0.0005875553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976139,0.00061306736,0.00042079476,0.000092558614,0.0011269003,0.00013279129],"domain_scores_gemma":[0.99709225,0.00082791253,0.0003334519,0.00030974532,0.0013354974,0.00010115604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025030263,0.000076918295,0.00015305118,0.00006552685,0.0006081233,0.000271945,0.00048679984,0.000015674708,0.00034655133],"category_scores_gemma":[0.0027001742,0.000042147825,0.00004597369,0.000058360347,0.00024784385,0.00015151454,0.00006662902,0.0004500203,0.00006895013],"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.000088956396,0.00017835351,0.00001753902,0.00002334844,0.00004562817,0.000023579192,0.00009567325,0.00067658455,0.0015410706,0.96195805,0.035283174,0.000068017296],"study_design_scores_gemma":[0.0121545205,0.0051430212,0.602323,0.0053075124,0.00017022634,0.00060666434,0.0018765022,0.14780377,0.0053101447,0.1991338,0.01904273,0.0011281153],"about_ca_topic_score_codex":0.0000031737386,"about_ca_topic_score_gemma":3.4064465e-7,"teacher_disagreement_score":0.7628243,"about_ca_system_score_codex":0.000054371452,"about_ca_system_score_gemma":0.000117194584,"threshold_uncertainty_score":0.46772543},"labels":[],"label_agreement":null},{"id":"W2742435143","doi":"10.1016/j.ejor.2017.08.002","title":"Universal recurrence algorithm for computing Nuttall, generalized Marcum and incomplete Toronto functions and moments of a noncentral χ 2 random variable","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":4,"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":"Fundação para a Ciência e a Tecnologia","keywords":"Variable (mathematics); Variety (cybernetics); Algorithm; Computer science; Moment (physics); Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.08310522167949963,"score_gpt":0.3208781496755416,"score_spread":0.237772927996042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742435143","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.027317327,0.0014379504,0.9660128,0.0005248804,0.00016180635,0.00023795057,0.0002372616,0.0000019153845,0.0040681544],"genre_scores_gemma":[0.9169274,0.00041768193,0.081823856,0.000025104851,0.00038074813,0.000005168373,0.000013413658,0.000014428176,0.00039221515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991534,0.000031369156,0.00041245227,0.00015445211,0.00008796843,0.00016035886],"domain_scores_gemma":[0.9989362,0.00014017704,0.00031258204,0.00011979718,0.00040125765,0.000089983754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021001175,0.00006266816,0.00020360232,0.00007094511,0.00062722457,0.00016883633,0.000246297,0.000016731397,0.000034404024],"category_scores_gemma":[0.0004233762,0.00006360912,0.00003480396,0.000049773975,0.0001552371,0.00034463545,0.00013013673,0.00012052853,0.0000033224999],"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.00041956932,0.00021302153,0.0027286226,0.00007326033,0.00016043996,0.000008918327,0.0007741796,0.00019240087,0.0007135592,0.9339812,0.0015309311,0.059203915],"study_design_scores_gemma":[0.03708441,0.003465165,0.2300541,0.00063476147,0.00007508594,0.00022767222,0.0014095333,0.41932788,0.0001619017,0.14406525,0.16244774,0.001046524],"about_ca_topic_score_codex":0.00013907948,"about_ca_topic_score_gemma":0.0000065812337,"teacher_disagreement_score":0.88961005,"about_ca_system_score_codex":0.00005699008,"about_ca_system_score_gemma":0.00008052637,"threshold_uncertainty_score":0.48241678},"labels":[],"label_agreement":null},{"id":"W2754742831","doi":"10.1016/j.ejor.2017.09.004","title":"Offshoring and outsourcing in a global supply chain: Impact of the arm’s length regulation on transfer pricing","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":73,"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":"Outsourcing; Supply chain; Business; Industrial organization; Profit (economics); Transfer pricing; Multinational corporation; Division of labour; Procurement; Offshoring; Commerce; Order (exchange); Production (economics); Microeconomics; Economics; Marketing; Market economy; Finance","score_opus":0.08008098550728045,"score_gpt":0.3356770351486652,"score_spread":0.25559604964138477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754742831","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9580382,0.000041287392,0.00013252937,0.002648281,0.0001399838,0.00018073349,0.0000014392842,0.0000025749925,0.038814984],"genre_scores_gemma":[0.99897414,0.000014618456,0.00002851952,0.00010347814,0.0006656503,9.1577704e-7,0.0000011770834,0.0000123106365,0.00019915664],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99839544,0.0001693891,0.00036608247,0.00012996631,0.00074158015,0.00019756827],"domain_scores_gemma":[0.9992453,0.000049726106,0.00014533293,0.00021580895,0.00032407878,0.000019764508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004344181,0.00009309894,0.00013742337,0.0002517294,0.0004356056,0.0004752992,0.00045161272,0.000014037829,0.0001058082],"category_scores_gemma":[0.00054895825,0.000061510174,0.00009118619,0.00017535203,0.00011080239,0.0007894541,0.00015792742,0.00027859124,0.000009597425],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086953933,0.00042563255,0.8378086,0.00019482308,0.0001611049,0.0001325013,0.0011739574,0.039762177,0.005129686,0.07697883,0.004315748,0.033047393],"study_design_scores_gemma":[0.00092625554,0.00010575103,0.9893579,0.0003296255,0.0000071336895,0.0000056095146,0.0002255328,0.006816775,0.000093961,0.00034103062,0.0017209792,0.00006944829],"about_ca_topic_score_codex":0.00013792269,"about_ca_topic_score_gemma":0.00003270948,"teacher_disagreement_score":0.1515493,"about_ca_system_score_codex":0.00012958526,"about_ca_system_score_gemma":0.00005696316,"threshold_uncertainty_score":0.4583321},"labels":[],"label_agreement":null},{"id":"W2756063524","doi":"10.1016/j.ejor.2017.08.040","title":"High dimensional data classification and feature selection using support vector machines","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","cited_by":320,"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":"Computer science; Feature selection; Support vector machine; Binary classification; Classifier (UML); Artificial intelligence; Data mining; Machine learning; Big data; Linear classifier; Data classification","score_opus":0.1663939795343459,"score_gpt":0.41915785578311104,"score_spread":0.2527638762487652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756063524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99033064,0.0003496031,0.0022870528,0.0055019413,0.00033761695,0.000118021395,0.000035688587,0.000002731162,0.0010367353],"genre_scores_gemma":[0.9932027,0.00009853783,0.00416811,0.000069166264,0.0010535428,8.227538e-7,0.0001605559,0.000016176842,0.0012304188],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9985649,0.00040853355,0.00020616536,0.00024190379,0.0004543282,0.00012419984],"domain_scores_gemma":[0.9985773,0.000013196912,0.00019257792,0.00041701674,0.0006985162,0.00010141996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021188767,0.00007608934,0.00008035844,0.000092391616,0.00064713747,0.00025024032,0.0004975635,0.000038197082,0.000055977012],"category_scores_gemma":[0.0005936411,0.00006156945,0.000023947387,0.00004767651,0.00012583444,0.000048588572,0.0002839213,0.00024448612,0.0000068519353],"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.00017109312,0.00003837301,0.0037059204,0.0000055599244,0.00002688244,0.0000071334057,0.000017396052,0.000114018454,0.95661426,0.00033254983,0.033325035,0.005641788],"study_design_scores_gemma":[0.0017227795,0.00080254255,0.8261345,0.00007913789,0.000027395954,0.0004944432,0.00008266927,0.012613973,0.040310167,0.00008919367,0.11737999,0.00026319412],"about_ca_topic_score_codex":0.0000063299462,"about_ca_topic_score_gemma":0.000006034796,"teacher_disagreement_score":0.9163041,"about_ca_system_score_codex":0.000022794413,"about_ca_system_score_gemma":0.0003062806,"threshold_uncertainty_score":0.49773237},"labels":[],"label_agreement":null},{"id":"W2769284177","doi":"10.1016/j.ejor.2017.11.016","title":"The load planning problem for double-stack intermodal trains","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","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":"Université du Québec à Montréal; Université de Montréal","funders":"Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Stack (abstract data type); Train; Computer science; Mathematical optimization; Parallel computing; Operations research; Mathematics; Operating system","score_opus":0.18773935755667384,"score_gpt":0.3973687753027945,"score_spread":0.20962941774612068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769284177","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.071214624,0.0016145763,0.09599627,0.008266328,0.0015758466,0.00092518324,0.000059928298,0.00004833501,0.8202989],"genre_scores_gemma":[0.99366,0.000066832166,0.0025457242,0.000015943138,0.00087112084,0.000003970178,0.0000029588218,0.000026915259,0.0028065487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875987,0.00009088788,0.00032241707,0.00006916376,0.0005151563,0.0002425184],"domain_scores_gemma":[0.9986829,0.00021347974,0.00006624867,0.00018696199,0.0007529332,0.00009747298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004848675,0.00007035669,0.00008988618,0.000049460985,0.00098316,0.0008323647,0.0006032591,0.000014188928,0.00005427476],"category_scores_gemma":[0.00049606734,0.000046026566,0.000058110003,0.00002318233,0.00014954053,0.00019353446,0.00007158854,0.00042869418,0.000016530923],"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.0018201488,0.00018288694,0.0022870016,0.00028249636,0.00060939527,0.0014949809,0.0050737476,0.17877334,0.0061016576,0.114769995,0.5259263,0.16267803],"study_design_scores_gemma":[0.0027244918,0.00059849216,0.013447761,0.00023312743,0.000013310426,0.00018432541,0.0002990571,0.039463487,0.0006872773,0.0012399477,0.940874,0.00023476912],"about_ca_topic_score_codex":0.000002291146,"about_ca_topic_score_gemma":0.0000048148995,"teacher_disagreement_score":0.92244536,"about_ca_system_score_codex":0.00006589421,"about_ca_system_score_gemma":0.00014894811,"threshold_uncertainty_score":0.8026512},"labels":[],"label_agreement":null},{"id":"W2773971719","doi":"10.1016/j.ejor.2017.11.061","title":"Simulation of intermodal freight transportation systems: a taxonomy","year":2017,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":191,"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":"Taxonomy (biology); Computer science; Container (type theory); Field (mathematics); Operations research; Transport engineering; Traffic management; Transportation planning; Decision support system; Engineering; Data mining","score_opus":0.14536786056020828,"score_gpt":0.3406096048827289,"score_spread":0.19524174432252062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773971719","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44862047,0.000853076,0.39677835,0.0003056033,0.0012767962,0.0005645176,0.000109368426,0.000028380215,0.15146345],"genre_scores_gemma":[0.9984658,0.000025919859,0.0008558873,0.0000025888844,0.00035338182,0.0000015058253,0.000009308437,0.000015355618,0.00027026565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987873,0.00014267415,0.00045271093,0.000056505793,0.00045171328,0.00010913993],"domain_scores_gemma":[0.9987492,0.00013115491,0.00012387783,0.00015461307,0.00077273406,0.00006844233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017712777,0.000059004193,0.00012273513,0.00013528079,0.00015508714,0.00016035892,0.0002745701,0.000016696678,0.00016041765],"category_scores_gemma":[0.00032338954,0.000050256967,0.00004501957,0.000033399665,0.000085559,0.00028708164,0.000012056584,0.0002520912,0.000012943891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037173697,0.000028678562,0.0014565609,0.00007563504,0.00004636502,0.00012694723,0.00017207797,0.988177,0.0009202441,0.0031078272,0.001831899,0.0040195873],"study_design_scores_gemma":[0.0011858592,0.0004240457,0.13678338,0.00040375805,0.000024388044,0.000029580193,0.00018349232,0.76798695,0.0008528385,0.00012206665,0.09179184,0.00021178061],"about_ca_topic_score_codex":0.000008853414,"about_ca_topic_score_gemma":0.0000036283968,"teacher_disagreement_score":0.54984534,"about_ca_system_score_codex":0.00003291457,"about_ca_system_score_gemma":0.000055526,"threshold_uncertainty_score":0.20494196},"labels":[],"label_agreement":null},{"id":"W2782943320","doi":"10.1016/j.ejor.2019.01.033","title":"Asymptotic correlation structure of discounted Incurred But Not Reported claims under fractional Poisson arrival process","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Probability and Risk Models","field":"Decision Sciences","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":"Covariance; Compound Poisson process; Mathematics; Renewal theory; Covariance and correlation; Queue; Applied mathematics; Poisson distribution; Exponential function; Markovian arrival process; Mathematical optimization; Queueing theory; Random variable; Poisson process; Statistics; Computer science; Mathematical analysis; Convergence of random variables","score_opus":0.20156280698135307,"score_gpt":0.4619659420905095,"score_spread":0.26040313510915647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782943320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808645,0.000055292065,0.014034474,0.0020284965,0.0005545326,0.0002654791,0.000049888054,0.0000055633163,0.0021417388],"genre_scores_gemma":[0.9974119,0.000010360218,0.000621621,0.000079310244,0.0002950058,5.523844e-7,0.000022735896,0.000018201716,0.0015402877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9895462,0.0021176976,0.0016881095,0.0003898939,0.005985089,0.00027302298],"domain_scores_gemma":[0.99063665,0.0016165307,0.00081351656,0.00041594656,0.0063299327,0.00018741118],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0128251845,0.00014431306,0.0003459113,0.000617959,0.0002818357,0.00031543945,0.00088486564,0.00006913759,0.0017758193],"category_scores_gemma":[0.005894949,0.00009585867,0.0001520312,0.00088028144,0.00026985517,0.001323548,0.00013807205,0.0010875379,0.00020044141],"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.0032663648,0.0006905432,0.052259076,0.000060063358,0.00028083008,0.00014007634,0.00255265,0.7502982,0.155131,0.02664558,0.0038280247,0.004847564],"study_design_scores_gemma":[0.0039510936,0.0016719057,0.75603783,0.00035152643,0.000040617484,0.00087694067,0.0029284356,0.11353171,0.012590882,0.105420224,0.0021178536,0.0004809938],"about_ca_topic_score_codex":0.000008481729,"about_ca_topic_score_gemma":0.0000066717485,"teacher_disagreement_score":0.70377874,"about_ca_system_score_codex":0.00013824672,"about_ca_system_score_gemma":0.0011931182,"threshold_uncertainty_score":0.9991367},"labels":[],"label_agreement":null},{"id":"W2786155106","doi":"10.1016/j.ejor.2018.01.022","title":"Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Mathematical Programming","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":"Université de Montréal","funders":"European Regional Development Fund; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; European Commission","keywords":"Heuristics; Mathematical optimization; Linear programming; Integer programming; Mathematics; Heuristic; Limit (mathematics); Fixed charge; Scaling; Iterative method; Set (abstract data type); Integer (computer science); Algorithm; Computer science","score_opus":0.12431254137681133,"score_gpt":0.3508453785029433,"score_spread":0.22653283712613195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786155106","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.0047920863,0.000051515162,0.9931784,0.00023338679,0.00014728606,0.00043696314,0.000007702317,0.00003596823,0.001116677],"genre_scores_gemma":[0.52421856,0.000009684091,0.47502267,0.000059281803,0.0005754879,0.000007175177,0.0000080788595,0.000039125338,0.00005997158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820423,0.00051898824,0.00041292812,0.00011877762,0.0004138197,0.00033127863],"domain_scores_gemma":[0.9976513,0.0008968973,0.000056255467,0.00009515485,0.0011336302,0.00016678218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050106933,0.00012001208,0.00016627758,0.00014438322,0.00039716932,0.00023261452,0.00014904291,0.000027437121,0.000072556],"category_scores_gemma":[0.001296439,0.000098084995,0.000043777534,0.0002099157,0.00014531071,0.0001366241,0.000026946955,0.00035295248,0.000029661505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006275302,0.0003390806,0.000053692675,0.00025076384,0.0001467675,0.00007445057,0.0025387986,0.93329054,0.0023994534,0.0069237426,0.010544193,0.04281096],"study_design_scores_gemma":[0.0007669917,0.000652897,0.00004273642,0.00018550361,0.000008099491,0.000009473472,0.00004877141,0.9909299,0.0009508124,0.00010503305,0.0061920234,0.000107737935],"about_ca_topic_score_codex":1.525297e-7,"about_ca_topic_score_gemma":1.8282067e-7,"teacher_disagreement_score":0.51942647,"about_ca_system_score_codex":0.00004668917,"about_ca_system_score_gemma":0.00005316998,"threshold_uncertainty_score":0.399979},"labels":[],"label_agreement":null},{"id":"W2790369493","doi":"10.1016/j.ejor.2018.03.007","title":"Matrix representations of the inverse problem in the graph model for conflict resolution","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":48,"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; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"Nanjing University of Aeronautics and Astronautics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Decision maker; Inverse; Matrix (chemical analysis); Preference; Graph; Mathematical economics; Stability (learning theory); Mathematics; Conflict resolution; Computer science; Mathematical optimization; Operations research; Combinatorics; Political science; Law; Statistics; Machine learning","score_opus":0.4206229275895411,"score_gpt":0.5233741400698904,"score_spread":0.10275121248034924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790369493","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7850217,0.00012630169,0.12490166,0.040270038,0.000171435,0.0015749016,0.000083614344,0.0000053297226,0.04784499],"genre_scores_gemma":[0.9905013,0.000011077924,0.005978511,0.00015738091,0.00019587995,0.000012003459,0.000001483843,0.000006518215,0.0031358614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99468297,0.002637203,0.00076185644,0.0001504579,0.001610106,0.00015742244],"domain_scores_gemma":[0.9947341,0.0018996644,0.00024829016,0.00041434733,0.0026559844,0.00004758116],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.029887699,0.000052472584,0.0000999525,0.00029627833,0.00051221554,0.00016150744,0.001409413,0.0000149468715,0.000084046354],"category_scores_gemma":[0.004686525,0.000026185726,0.00011145256,0.0010923994,0.00058427145,0.00026010314,0.00011553917,0.00030096815,0.000053233372],"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.0005679765,0.000376383,0.0017364923,0.000008669978,0.000033033994,0.0000058000196,0.019393397,0.101559155,0.025575265,0.62562466,0.22254731,0.002571834],"study_design_scores_gemma":[0.0027711613,0.0010291866,0.05967882,0.0001422689,0.000027436648,0.00014145004,0.010505249,0.31490508,0.0033453207,0.5047642,0.102469996,0.00021986364],"about_ca_topic_score_codex":0.0000052336404,"about_ca_topic_score_gemma":0.000040560233,"teacher_disagreement_score":0.21334592,"about_ca_system_score_codex":0.000021851878,"about_ca_system_score_gemma":0.0002879558,"threshold_uncertainty_score":0.99893475},"labels":[],"label_agreement":null},{"id":"W2791401340","doi":"10.1016/j.ejor.2018.02.024","title":"Effects of multipurpose shopping trips on retail store location in a duopoly","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","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":"University of New Brunswick","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Fondo Nacional de Desarrollo Científico, Tecnológico y de Innovación Tecnológica; Comisión Nacional de Investigación Científica y Tecnológica; Instituto de Sistemas Complejos de Ingeniería","keywords":"TRIPS architecture; Product (mathematics); Computer science; Heuristic; Business; Product type; Mathematics; Artificial intelligence","score_opus":0.09235377037770756,"score_gpt":0.3005499662677431,"score_spread":0.20819619589003555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791401340","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96730936,0.0009199096,0.01731578,0.00016987418,0.00036755938,0.00023183497,0.0000046181854,0.000015500153,0.013665547],"genre_scores_gemma":[0.9981698,0.00009316661,0.0010498371,0.00001847336,0.0004070294,0.0000010896393,0.0000031302645,0.000023956485,0.00023355488],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99842536,0.00031869928,0.00042180024,0.00008420163,0.00057427207,0.0001756374],"domain_scores_gemma":[0.99885345,0.00025500034,0.00004094798,0.00009933178,0.00066775945,0.00008349223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018895742,0.00007996021,0.00013959133,0.00038743357,0.000058971204,0.000028631468,0.0002113711,0.000023871342,0.000060776587],"category_scores_gemma":[0.00053776195,0.000068704234,0.0000371478,0.0003536231,0.0001414562,0.00012454076,0.000012296572,0.00044629368,0.000053624044],"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.0027841546,0.0016785628,0.014999809,0.0015655103,0.00048025025,0.003939031,0.010734075,0.14193985,0.6838035,0.02674786,0.02615674,0.08517067],"study_design_scores_gemma":[0.012258858,0.010345531,0.6385638,0.0039362526,0.00006029885,0.0001626905,0.00058100093,0.10103342,0.19116282,0.00027181723,0.040678866,0.0009446318],"about_ca_topic_score_codex":0.000002477348,"about_ca_topic_score_gemma":0.000008523618,"teacher_disagreement_score":0.623564,"about_ca_system_score_codex":0.00009809004,"about_ca_system_score_gemma":0.00009015946,"threshold_uncertainty_score":0.28016773},"labels":[],"label_agreement":null},{"id":"W2792935258","doi":"10.1016/j.ejor.2018.03.016","title":"Shipment consolidation with two demand classes: Rationing the dispatch capacity","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","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":"University of Waterloo","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Rationing; Markov decision process; Computer science; Consolidation (business); Mathematical optimization; Operations research; Order (exchange); Holding cost; Total cost; Process (computing); Markov process; Economic dispatch; Economics; Mathematics; Microeconomics; Finance","score_opus":0.08171851194323396,"score_gpt":0.33988747636341365,"score_spread":0.25816896442017967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792935258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87700623,0.000037228718,0.105142646,0.0018043832,0.00014919025,0.0001699301,0.000008349664,0.000017799128,0.015664218],"genre_scores_gemma":[0.99632204,0.00001835606,0.0029673288,0.00009911142,0.00039917024,0.00000452672,0.0000143311,0.000015292395,0.0001598447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984334,0.00033846629,0.00036819855,0.000079520316,0.0006266026,0.00015382784],"domain_scores_gemma":[0.9980925,0.00016360395,0.00004891361,0.00012455572,0.0015029147,0.00006755788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029441,0.0000723855,0.000075525204,0.00013709671,0.00041244153,0.00018995174,0.00018593635,0.000010373339,0.0002328007],"category_scores_gemma":[0.00013752798,0.000046874433,0.000024140385,0.00030110296,0.00023931882,0.00032505882,0.000009217756,0.00037909724,0.00007267668],"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.0009261827,0.0007742071,0.07037387,0.00018637237,0.001392156,0.0002999786,0.04251197,0.45689794,0.16575155,0.14191712,0.089169465,0.029799178],"study_design_scores_gemma":[0.0048864284,0.0017650606,0.74046594,0.0003936408,0.00007261643,0.00032144474,0.003966723,0.038685672,0.036617856,0.0006462979,0.17158018,0.00059814105],"about_ca_topic_score_codex":0.0000050816175,"about_ca_topic_score_gemma":0.00009794637,"teacher_disagreement_score":0.67009205,"about_ca_system_score_codex":0.00006634314,"about_ca_system_score_gemma":0.00013937653,"threshold_uncertainty_score":0.31722087},"labels":[],"label_agreement":null},{"id":"W2793538957","doi":"10.1016/j.ejor.2018.02.055","title":"Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":226,"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; Université de Montréal; HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Relocation; Context (archaeology); Dynamism; Computer science; Operations research; Field (mathematics); Risk analysis (engineering); Management science; Business; Engineering","score_opus":0.11353635718162455,"score_gpt":0.3555186643399212,"score_spread":0.24198230715829663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793538957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90808886,0.0014695561,0.04558104,0.027443768,0.0004913276,0.00022888034,0.0000017603635,0.0000141510145,0.016680678],"genre_scores_gemma":[0.9968126,0.0016561837,0.0007245833,0.00015794505,0.0004434985,0.0000017064643,0.000014153982,0.000011032518,0.0001782964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980456,0.00017913387,0.00064529316,0.00015402306,0.0008395669,0.00013636722],"domain_scores_gemma":[0.997665,0.0000255799,0.00009070685,0.00010169909,0.0020818666,0.00003518151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053059957,0.00007514377,0.00011222008,0.0006999515,0.00017438801,0.00007973156,0.00019134482,0.000020510925,0.0008056747],"category_scores_gemma":[0.0008755261,0.000066053995,0.000016842298,0.00089414325,0.0001264747,0.0009791376,0.00014724329,0.00017519046,0.000012345842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039567737,0.00061600684,0.020539254,0.00032981002,0.00008743165,0.00002436111,0.0024094363,0.44476786,0.00030813838,0.1031512,0.022487076,0.40488374],"study_design_scores_gemma":[0.0007593889,0.00009004344,0.11813397,0.00014685768,0.000009900151,0.000005720172,0.00054878916,0.8701636,0.000014485202,0.0011238428,0.008879131,0.00012427574],"about_ca_topic_score_codex":0.000118009535,"about_ca_topic_score_gemma":0.00021446208,"teacher_disagreement_score":0.42539576,"about_ca_system_score_codex":0.00002602445,"about_ca_system_score_gemma":0.00005438356,"threshold_uncertainty_score":0.8821573},"labels":[],"label_agreement":null},{"id":"W286790658","doi":"10.1016/j.ejor.2003.10.029","title":"SARPlan: A decision support system for Canadian Search and Rescue Operations","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":3,"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":"Search and rescue; Decision support system; Computer science; Operations research; Engineering; Artificial intelligence; Robot","score_opus":0.0883167890346906,"score_gpt":0.3564225687883026,"score_spread":0.268105779753612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W286790658","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.07199496,0.00016862956,0.9112885,0.010378839,0.0004511068,0.00055742584,0.000067885005,0.000019266514,0.005073364],"genre_scores_gemma":[0.8451707,0.000041984065,0.15373102,0.00014598091,0.0003419645,0.0000037604054,0.000020072692,0.000013099526,0.0005314674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795365,0.0003015524,0.0003598592,0.00021619206,0.0008418386,0.00032690162],"domain_scores_gemma":[0.998256,0.00009763515,0.000011343828,0.0002415536,0.0010282638,0.00036518154],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0070043355,0.000079015874,0.00011172783,0.0005976363,0.0006937227,0.0011277732,0.0009537637,0.000015401221,0.000018756122],"category_scores_gemma":[0.0002941674,0.00006436092,0.00003993318,0.0003338109,0.000060776718,0.0010798573,0.00023460572,0.00026716548,0.0000990068],"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.00012428952,0.0001526834,0.00011737258,0.00008646737,0.00011712152,0.0020855116,0.002103857,0.10921803,0.0018166512,0.7599806,0.01626337,0.107934006],"study_design_scores_gemma":[0.019855848,0.009479524,0.038262863,0.0016734827,0.000051987066,0.005123442,0.0037404618,0.61449045,0.0045596925,0.0021977872,0.2989569,0.0016075738],"about_ca_topic_score_codex":0.00167897,"about_ca_topic_score_gemma":0.00440976,"teacher_disagreement_score":0.77317566,"about_ca_system_score_codex":0.00020291226,"about_ca_system_score_gemma":0.0010789137,"threshold_uncertainty_score":0.99990916},"labels":[],"label_agreement":null},{"id":"W2883979235","doi":"10.1016/j.ejor.2018.07.032","title":"A capacitated lot sizing problem with stochastic setup times and overtime","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"HEC Montréal; Polytechnique Montréal","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Overtime; Computer science; Benchmark (surveying); Heuristic; Sizing; Mathematical optimization; Stochastic programming; Operations research; Mathematics","score_opus":0.06259020489094468,"score_gpt":0.29001962862979797,"score_spread":0.22742942373885328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883979235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.711676,0.00036494437,0.005816354,0.008720031,0.00029603177,0.0006697522,0.0000036488968,0.00004938656,0.27240387],"genre_scores_gemma":[0.9946213,0.000005110074,0.0010688991,0.0007017471,0.0016415967,0.0000020350305,0.000005242726,0.000029516883,0.0019245934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834186,0.00013040238,0.0002953331,0.00016327547,0.0008099373,0.0002592029],"domain_scores_gemma":[0.9984696,0.000069607544,0.00011774941,0.00010348667,0.0012019842,0.000037565733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030530412,0.00010826492,0.00012268143,0.00043008212,0.00038253592,0.00061786664,0.00023592928,0.000010832139,0.0008868312],"category_scores_gemma":[0.00023898859,0.00007771289,0.000026434676,0.00037167594,0.00026865175,0.0009903299,0.00016659561,0.00025726663,0.00039713838],"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.00497597,0.001407944,0.0097060995,0.00085722795,0.0014047206,0.002179025,0.006076374,0.009152327,0.024054792,0.27566743,0.6213675,0.043150555],"study_design_scores_gemma":[0.012069749,0.00469007,0.050251804,0.0024386847,0.00021415253,0.0005006445,0.006812486,0.11029593,0.00056318403,0.006412902,0.80415046,0.0015999633],"about_ca_topic_score_codex":0.000021459009,"about_ca_topic_score_gemma":0.000008536583,"teacher_disagreement_score":0.28294525,"about_ca_system_score_codex":0.000037517522,"about_ca_system_score_gemma":0.0000620522,"threshold_uncertainty_score":0.971018},"labels":[],"label_agreement":null},{"id":"W2884242239","doi":"10.1016/j.ejor.2018.07.034","title":"Rationalising the use of Twitter by official organisations during risk events: Operationalising the Social Amplification of Risk Framework through causal loop diagrams","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk Perception and Management","field":"Social Sciences","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":"Dalhousie University","funders":"","keywords":"Causal loop diagram; Social media; Knowledge management; Risk communication; Key (lock); Risk perception; Event (particle physics); Risk management; Task (project management); Computer science; Risk analysis (engineering); Perception; Business; Process management; Psychology; System dynamics; Computer security; Engineering; Systems engineering","score_opus":0.20827455601001488,"score_gpt":0.437881052735599,"score_spread":0.22960649672558414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884242239","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90664715,0.000064176806,0.08135263,0.010479225,0.0003386029,0.00037316987,0.00006735557,0.000007844329,0.00066984975],"genre_scores_gemma":[0.99361485,0.0004416174,0.0028874788,0.0002201673,0.0024365736,0.000003875677,0.000021151269,0.00002064783,0.0003536617],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.9912944,0.0054708943,0.00079554314,0.00017438324,0.0020179888,0.00024679437],"domain_scores_gemma":[0.9947225,0.0013060113,0.0005758979,0.00020470792,0.003128118,0.000062805164],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008073501,0.00010763238,0.00015572451,0.00012433431,0.0038543981,0.00036919882,0.0005784822,0.000047149646,0.00079872797],"category_scores_gemma":[0.005808218,0.0000710029,0.00011397952,0.0007073926,0.001024769,0.00074870395,0.00011733297,0.00061121816,0.00004069866],"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.0007529999,0.001130516,0.032858413,0.0000305753,0.00066528254,0.000007888192,0.4929087,0.01702675,0.01848376,0.2869684,0.1420464,0.0071203127],"study_design_scores_gemma":[0.0018598796,0.00049571594,0.73697394,0.00027871982,0.00020816614,0.000011713674,0.059096396,0.0013406868,0.0023574133,0.008173967,0.18870082,0.0005025524],"about_ca_topic_score_codex":0.0006254669,"about_ca_topic_score_gemma":0.00026573,"teacher_disagreement_score":0.70411557,"about_ca_system_score_codex":0.00016683486,"about_ca_system_score_gemma":0.0004347495,"threshold_uncertainty_score":0.9974424},"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":"W2890826880","doi":"10.1016/j.ejor.2018.09.008","title":"A dynamic multi-stage slacks-based measure data envelopment analysis model with knowledge accumulation and technological evolution","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Measure (data warehouse); Computer science; Endowment; Econometrics; Operations research; Mathematical optimization; Economics; Mathematics; Data mining","score_opus":0.5396066245187701,"score_gpt":0.5337896822506221,"score_spread":0.005816942268147995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890826880","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.26945952,0.0002403509,0.72806996,0.0012536714,0.000021391466,0.0001147443,0.000022197115,0.000010919786,0.0008072309],"genre_scores_gemma":[0.94484407,0.000009749779,0.054150503,0.00003165533,0.0000459023,0.0000010146274,0.0000206132,0.000012769159,0.0008837176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920397,0.0025130562,0.0009216097,0.0006132365,0.0036141956,0.0002982292],"domain_scores_gemma":[0.99256194,0.0008887824,0.00032699958,0.00084641407,0.005197351,0.0001785052],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.038608372,0.00014783743,0.00031366968,0.0022120562,0.00070883334,0.0006025014,0.0016730855,0.0000486327,0.000118329204],"category_scores_gemma":[0.0085004,0.00009165849,0.000084515064,0.0038809222,0.0008877964,0.00069763424,0.00044883796,0.0005338056,0.000112579764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081150775,0.0009799005,0.02639122,0.000007659633,0.00055059686,0.00014066989,0.0011140937,0.90981644,0.0101587,0.0026579455,0.0017778005,0.045593474],"study_design_scores_gemma":[0.00059342006,0.00026168948,0.05156635,0.000028371805,0.00006740624,0.0000118141625,0.00021948169,0.94576335,0.00007695091,0.00010967257,0.0011934928,0.00010800539],"about_ca_topic_score_codex":0.000003849602,"about_ca_topic_score_gemma":0.00015514782,"teacher_disagreement_score":0.6753846,"about_ca_system_score_codex":0.00021381558,"about_ca_system_score_gemma":0.0008966599,"threshold_uncertainty_score":0.9998514},"labels":[],"label_agreement":null},{"id":"W2895123429","doi":"10.1016/j.ejor.2018.09.047","title":"Optimizing a mineral value chain with market uncertainty using benders decomposition","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Mining Techniques and Economics","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":"McGill University; University of Calgary","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Benders' decomposition; Value (mathematics); Decomposition; Chain (unit); Mathematical optimization; Computer science; Mathematics; Statistics; Chemistry","score_opus":0.07163220766877489,"score_gpt":0.3370308822454136,"score_spread":0.26539867457663874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895123429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8950261,0.000067980385,0.07698722,0.00022124083,0.0001227281,0.000093364535,0.000004638576,0.000028806386,0.027447904],"genre_scores_gemma":[0.88998055,0.00002736368,0.1092356,0.000039369734,0.0005948376,6.5256376e-7,0.0000030955655,0.000032981297,0.00008553357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998836,0.00025648388,0.00028847755,0.000094409115,0.00029741134,0.00022724293],"domain_scores_gemma":[0.99930024,0.000067152716,0.000043589604,0.00010159465,0.00038045485,0.000106963074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027684462,0.000087509645,0.000112094596,0.00022740228,0.00018483264,0.0001434595,0.0002005047,0.00001785215,0.00023645423],"category_scores_gemma":[0.000040705007,0.00007420501,0.000036449954,0.00013457282,0.00009654627,0.00023826554,0.00004011943,0.00032193886,0.000011977881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038318275,0.00004457234,0.00032281768,0.000028738832,0.00014021526,0.00020964001,0.0014578216,0.9474315,0.024517462,0.0014419911,0.021607405,0.0024146594],"study_design_scores_gemma":[0.00056348124,0.0007155692,0.00092696346,0.0001897064,0.000007788833,0.00039785018,0.0002405761,0.99087733,0.0016814892,0.00006833756,0.0041710744,0.00015984854],"about_ca_topic_score_codex":0.0000056352624,"about_ca_topic_score_gemma":0.0000037955529,"teacher_disagreement_score":0.043445818,"about_ca_system_score_codex":0.00018264749,"about_ca_system_score_gemma":0.00008760147,"threshold_uncertainty_score":0.30259925},"labels":[],"label_agreement":null},{"id":"W2899304741","doi":"10.1016/j.ejor.2018.10.044","title":"Data envelopment analysis and big data","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"National Natural Science Foundation of China; Grantová Agentura České Republiky; Pennsylvania State University","keywords":"Data envelopment analysis; Cardinality (data modeling); Set (abstract data type); Dimension (graph theory); Data set; Mathematical optimization; Computer science; Function (biology); Point (geometry); Scale (ratio); Computation; Standard deviation; Mathematics; Statistics; Data mining; Algorithm","score_opus":0.6518505430652791,"score_gpt":0.5397122734197641,"score_spread":0.11213826964551499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899304741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67914313,0.0014384083,0.2511603,0.024137586,0.0010734444,0.0002454305,0.00064596604,0.000016166281,0.04213957],"genre_scores_gemma":[0.98560345,0.0001018472,0.011140853,0.00018741602,0.0011517286,1.1381597e-7,0.000069486814,0.000010243677,0.0017348449],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9891543,0.0034377668,0.0011521857,0.00066687143,0.005310028,0.00027885268],"domain_scores_gemma":[0.99144834,0.0019424735,0.00029217073,0.0023646418,0.0036991267,0.0002532602],"candidate_categories":["metaresearch","scholarly_communication","open_science"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.087168775,0.00009797078,0.0002874672,0.0018861733,0.0006417206,0.0012797561,0.006000709,0.00001707805,0.00075156573],"category_scores_gemma":[0.022003178,0.00006440389,0.0000565845,0.0039030053,0.00064707425,0.000945685,0.003358688,0.00040517317,0.0005014474],"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.00025279334,0.00043291904,0.039811302,0.000003961771,0.0016674355,0.0005947604,0.0017745402,0.00085897825,0.004748493,0.001331864,0.35054967,0.5979733],"study_design_scores_gemma":[0.0005430737,0.00041151763,0.24072395,0.000028680584,0.0001940445,0.00011897259,0.0006738202,0.07235913,0.00027368372,0.00055576884,0.6839064,0.00021100418],"about_ca_topic_score_codex":0.000012969988,"about_ca_topic_score_gemma":0.0001035459,"teacher_disagreement_score":0.5977623,"about_ca_system_score_codex":0.000035554836,"about_ca_system_score_gemma":0.00057448226,"threshold_uncertainty_score":0.999757},"labels":[],"label_agreement":null},{"id":"W2902000811","doi":"10.1016/j.ejor.2020.09.017","title":"An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Universitetet i Bergen; Türkiye Bilimler Akademisi","keywords":"Graph coloring; Fractional coloring; Combinatorics; Greedy coloring; Perfect graph; Mathematics; List coloring; Complete coloring; Graph partition; Discrete mathematics; Graph; Algorithm; Computer science; Graph power; Line graph","score_opus":0.29019233814412476,"score_gpt":0.4730422828480221,"score_spread":0.18284994470389732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902000811","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8102739,0.0013821269,0.12920217,0.035255928,0.0019816968,0.0024138393,0.00018870972,0.00007555301,0.019226108],"genre_scores_gemma":[0.9144445,0.000059343518,0.084021114,0.00022229599,0.0010168399,0.000017700837,0.000014812388,0.000044834054,0.00015856256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.986911,0.005260815,0.0015970322,0.00080194365,0.0047827926,0.00064643833],"domain_scores_gemma":[0.99130213,0.0032739697,0.00043758113,0.00056776014,0.00392152,0.0004970352],"candidate_categories":["metaresearch","scholarly_communication","research_integrity"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.056987878,0.00026294604,0.0005131877,0.0018588107,0.0009266098,0.0020088041,0.002895977,0.000076691635,0.00012939372],"category_scores_gemma":[0.011025819,0.00017092856,0.00027160256,0.002758609,0.00020333964,0.00040688715,0.0008653799,0.0042864946,0.00025133524],"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.0010196795,0.0009507697,0.012245886,0.00004282762,0.0006232131,0.0019946762,0.030818842,0.79966694,0.0077804606,0.009474957,0.03321407,0.10216769],"study_design_scores_gemma":[0.0062682126,0.01259412,0.42067385,0.0033568982,0.00022040594,0.0016834561,0.024067825,0.26010102,0.004920857,0.227697,0.035321508,0.0030948708],"about_ca_topic_score_codex":0.00008178836,"about_ca_topic_score_gemma":0.000028106853,"teacher_disagreement_score":0.5395659,"about_ca_system_score_codex":0.00019610809,"about_ca_system_score_gemma":0.0016168662,"threshold_uncertainty_score":0.9990272},"labels":[],"label_agreement":null},{"id":"W2903252607","doi":"10.1016/j.ejor.2019.10.007","title":"A branch-and-cut algorithm for an assembly routing problem","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"HEC Montréal","keywords":"Branch and cut; Linear programming relaxation; Integer programming; Context (archaeology); Mathematical optimization; Routing (electronic design automation); Set (abstract data type); Linear programming; Algorithm; Production planning; Production (economics); Relaxation (psychology); Computer science; Lagrangian relaxation; Product (mathematics); Integer (computer science); Column generation; Mathematics; Programming language","score_opus":0.07423329463476477,"score_gpt":0.37031368853167523,"score_spread":0.29608039389691043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903252607","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.21934956,0.00018593096,0.76665366,0.00033121268,0.00023339265,0.00042181928,0.000009880107,0.00004680479,0.012767733],"genre_scores_gemma":[0.60007864,0.000030309879,0.39886507,0.000034634842,0.0004203713,0.0000025973525,0.0000058803257,0.00005561412,0.00050688884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979395,0.00072163576,0.00041664197,0.000133304,0.0005272799,0.0002615913],"domain_scores_gemma":[0.9984779,0.00036982246,0.0000545675,0.000116901356,0.00083275465,0.00014809007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008672445,0.00009305306,0.0001523479,0.00020876812,0.00014824305,0.00024260934,0.00023404683,0.000024268413,0.00004914904],"category_scores_gemma":[0.0003118375,0.000084641884,0.000045688757,0.00019392927,0.000029789808,0.00046372597,0.000045653276,0.00041823325,0.00003505148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006817467,0.00009248377,0.0011545483,0.00012431304,0.00014353573,0.000030581457,0.0018016087,0.50728595,0.07545591,0.0037081789,0.0025275545,0.40760717],"study_design_scores_gemma":[0.0011348429,0.0005950927,0.0026433435,0.000102285834,0.0000062426166,0.00012811413,0.0001402566,0.9876724,0.0023239625,0.00012025572,0.0049790093,0.00015421366],"about_ca_topic_score_codex":9.3719547e-7,"about_ca_topic_score_gemma":4.2887916e-7,"teacher_disagreement_score":0.48038644,"about_ca_system_score_codex":0.00006058115,"about_ca_system_score_gemma":0.00009616907,"threshold_uncertainty_score":0.3451596},"labels":[],"label_agreement":null},{"id":"W2905414953","doi":"10.1016/j.ejor.2019.09.019","title":"Weak Comonotonicity","year":2018,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diversification (marketing strategy); Value at risk; Portfolio; Maximization; Value (mathematics); Economics; Expected shortfall; Econometrics; Actuarial science; Microeconomics; Mathematics; Financial economics; Risk management; Finance; Business; Statistics","score_opus":0.34232166411899717,"score_gpt":0.501639199687339,"score_spread":0.15931753556834188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905414953","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.3859078,0.0015735065,0.07311012,0.013629269,0.0046446635,0.00072704005,0.00010809893,0.000025394358,0.5202741],"genre_scores_gemma":[0.9622833,0.0017745752,0.01478742,0.00017572664,0.0039074966,0.0000026176708,0.000028644985,0.00005094465,0.016989276],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9841085,0.006749585,0.0016547802,0.0004796904,0.006655914,0.00035153455],"domain_scores_gemma":[0.984849,0.0013921653,0.0008311532,0.00076076004,0.011908638,0.00025832717],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.05867273,0.00019346381,0.0004332248,0.0012292225,0.00046809527,0.0017213706,0.002775423,0.000094236355,0.0017542047],"category_scores_gemma":[0.011729927,0.00013490068,0.0002801405,0.00070333976,0.00041512636,0.00041649753,0.0014493007,0.00202104,0.0017806866],"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.0002850741,0.0001801173,0.0036935995,0.0000058901796,0.00009067678,0.00028828852,0.00077994703,0.04754472,0.00020195507,0.0040612775,0.90744305,0.035425417],"study_design_scores_gemma":[0.0007696106,0.0008168529,0.037923668,0.00019761038,0.000017703298,0.00019997443,0.00028060487,0.016626105,0.0004550062,0.020287963,0.9220839,0.0003409625],"about_ca_topic_score_codex":0.0000067362103,"about_ca_topic_score_gemma":0.0000040636673,"teacher_disagreement_score":0.5763755,"about_ca_system_score_codex":0.00013408049,"about_ca_system_score_gemma":0.0016339882,"threshold_uncertainty_score":0.99931496},"labels":[],"label_agreement":null},{"id":"W2906524013","doi":"10.1016/j.ejor.2018.12.021","title":"Benders decomposition for very large scale partial set covering and maximal covering location problems","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":119,"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":"Vienna Science and Technology Fund","keywords":"Facility location problem; Benders' decomposition; Benchmark (surveying); Mathematical optimization; Decomposition; Set (abstract data type); Covering problems; Computer science; Scale (ratio); Decomposition method (queueing theory); Constraint (computer-aided design); Operations research; Mathematics; Statistics","score_opus":0.09564507909703968,"score_gpt":0.34553275188480104,"score_spread":0.24988767278776136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906524013","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8830151,0.00008898501,0.1075356,0.0029096557,0.0005272315,0.0004396711,0.00000874969,0.000019294597,0.0054557207],"genre_scores_gemma":[0.99698865,0.000024177716,0.0007823214,0.0003554368,0.001584246,0.000006485303,0.000040290248,0.000016839162,0.0002015574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998599,0.00008285607,0.00037663803,0.0001695921,0.00052768516,0.00024424834],"domain_scores_gemma":[0.99844354,0.000031606192,0.00006656004,0.00009428745,0.001334175,0.000029856716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040052137,0.000086735105,0.000098297045,0.00027251913,0.00052399654,0.0004220634,0.00017062061,0.00001530474,0.00020088266],"category_scores_gemma":[0.00024883496,0.000082412946,0.000039611037,0.00025830895,0.00008549798,0.0012003588,0.00014063968,0.00014247741,0.00013490526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0067868843,0.0025627783,0.03866429,0.0050558303,0.0009945341,0.00012183334,0.011315202,0.3504537,0.0688904,0.1895478,0.26017353,0.065433204],"study_design_scores_gemma":[0.004220466,0.0006436322,0.06120752,0.00037794485,0.00005831985,0.000029361752,0.0023456146,0.50546694,0.0009252408,0.0010061801,0.42323792,0.00048089883],"about_ca_topic_score_codex":0.000027932183,"about_ca_topic_score_gemma":0.00007778517,"teacher_disagreement_score":0.18854162,"about_ca_system_score_codex":0.00005448956,"about_ca_system_score_gemma":0.000048796654,"threshold_uncertainty_score":0.40699673},"labels":[],"label_agreement":null},{"id":"W2908471060","doi":"10.1016/j.ejor.2019.01.006","title":"A new FlowSort-based method to deal with information imperfections in sorting decision-making problems","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":64,"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":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Sorting; Imperfect; Perfect information; Context (archaeology); Interval (graph theory); Fuzzy logic; Field (mathematics); Data mining; Point (geometry); Mathematical optimization; Artificial intelligence; Algorithm; Mathematics","score_opus":0.1757442513378903,"score_gpt":0.49563948171100314,"score_spread":0.31989523037311285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908471060","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.3080298,0.000023001614,0.68464494,0.0010823195,0.00015203746,0.00043008302,0.0000037689674,0.000008177687,0.005625895],"genre_scores_gemma":[0.5894199,8.6277083e-7,0.40998435,0.0002501221,0.00014190112,0.0000028257061,0.0000011018607,0.000017381937,0.00018154911],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.98814255,0.0028770703,0.0021838818,0.0003832535,0.0059276475,0.00048558923],"domain_scores_gemma":[0.98802465,0.0069550355,0.00047545854,0.00043875398,0.0037477692,0.00035831844],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.046542455,0.0001733993,0.00036463595,0.0032106657,0.00031623206,0.0017650982,0.0012656767,0.00003934411,0.0021332374],"category_scores_gemma":[0.009473524,0.00011857442,0.00012021657,0.0029507289,0.000034491135,0.0021410312,0.0002915658,0.0008612711,0.0016298272],"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.00071912963,0.0000499594,0.009843428,0.0000055762803,0.000013153507,0.000082870996,0.0015341053,0.4672061,0.0031895384,0.0005215233,0.0044921744,0.51234245],"study_design_scores_gemma":[0.011621425,0.005168821,0.3709392,0.004361819,0.000020548197,0.0012336894,0.005476553,0.36596048,0.0014745962,0.008717758,0.22378854,0.0012365864],"about_ca_topic_score_codex":0.000022306782,"about_ca_topic_score_gemma":0.00006168056,"teacher_disagreement_score":0.5111059,"about_ca_system_score_codex":0.00023571694,"about_ca_system_score_gemma":0.0014125117,"threshold_uncertainty_score":0.99927115},"labels":[],"label_agreement":null},{"id":"W2913171886","doi":"10.1016/j.ejor.2019.01.043","title":"Almost Robust Discrete Optimization","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Toronto","funders":"","keywords":"Mathematical optimization; Robust optimization; Robustness (evolution); Computer science; Binary number; Linear programming; Optimization problem; Dependency (UML); Discrete optimization; Decision maker; Mathematics","score_opus":0.21660367295538616,"score_gpt":0.44467976105589285,"score_spread":0.2280760881005067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913171886","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.20392689,0.00049747544,0.44707438,0.008316201,0.0015311888,0.00052660366,0.000021184698,0.000017907969,0.33808815],"genre_scores_gemma":[0.9540833,0.00039050094,0.028398052,0.00015612398,0.00059542025,7.1975455e-7,0.000016035901,0.000027787924,0.016332017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99238837,0.0023413044,0.0009948725,0.00025238807,0.0037735412,0.00024954462],"domain_scores_gemma":[0.99430746,0.0008466179,0.0003114911,0.0003445707,0.0039957967,0.00019408987],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.021379866,0.00009757763,0.00019874642,0.0006959502,0.00026395303,0.0007864794,0.0009263101,0.000026438092,0.00397152],"category_scores_gemma":[0.0039022064,0.00006593292,0.00010899988,0.0010820464,0.000095644806,0.0011113732,0.00014794993,0.00045027473,0.0020031692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009471769,0.00003325622,0.005206335,8.245473e-7,0.00001178854,0.000047485537,0.00023821801,0.96450543,0.0002720314,0.001689117,0.02299297,0.0049078334],"study_design_scores_gemma":[0.0027250508,0.0017515132,0.053968284,0.000118438875,0.000014406156,0.00044230264,0.001895357,0.63125694,0.000533245,0.0014861715,0.30535913,0.00044915196],"about_ca_topic_score_codex":0.0000024564047,"about_ca_topic_score_gemma":7.419282e-7,"teacher_disagreement_score":0.75015646,"about_ca_system_score_codex":0.000054542405,"about_ca_system_score_gemma":0.00033330725,"threshold_uncertainty_score":0.9987739},"labels":[],"label_agreement":null},{"id":"W2917799162","doi":"10.1016/j.ejor.2019.02.043","title":"Mixed stabilities for analyzing opponents’ heterogeneous behavior within the graph model for conflict resolution","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":33,"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; Centre for International Governance Innovation; Balsillie School of International Affairs; University of Waterloo","funders":"National Science Foundation","keywords":"Conflict resolution; Stability (learning theory); Decision maker; Graph; Resolution (logic); Conflict analysis; Mixed model; Mixed graph; Computer science; Mathematical economics; Mathematics; Operations research; Artificial intelligence; Theoretical computer science; Sociology; Machine learning","score_opus":0.4733390425696968,"score_gpt":0.470154653480243,"score_spread":0.0031843890894537874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917799162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.892533,0.00012908975,0.10391482,0.001858038,0.00015624918,0.0008835875,0.000097419455,0.000004698652,0.00042311134],"genre_scores_gemma":[0.99020207,0.000008818543,0.0054310746,0.00008428317,0.00018819771,0.000055264885,0.000010115941,0.000018974231,0.0040011792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956531,0.0014603235,0.00089986855,0.00025953923,0.0014718439,0.00025532168],"domain_scores_gemma":[0.9928092,0.0032833305,0.0002799344,0.00040797974,0.0030974878,0.00012210466],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.03089422,0.00009642705,0.00018650999,0.00030833323,0.0007008271,0.00048295187,0.0010702882,0.000022351891,0.000116154886],"category_scores_gemma":[0.0034419785,0.000057888967,0.0002218688,0.0003298906,0.00023299512,0.00032239212,0.00010523967,0.00029191579,0.00007955703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020222233,0.00042696946,0.0022473165,0.000022959483,0.00012915205,0.000009871219,0.0058606495,0.5875946,0.07858336,0.30274454,0.013360689,0.0069976025],"study_design_scores_gemma":[0.0045367614,0.0026921062,0.013714375,0.000110856956,0.00009464899,0.00021962431,0.007557273,0.8138307,0.00995728,0.10468965,0.042054296,0.00054246123],"about_ca_topic_score_codex":0.0000013083832,"about_ca_topic_score_gemma":0.0000047869808,"teacher_disagreement_score":0.22623602,"about_ca_system_score_codex":0.000049406113,"about_ca_system_score_gemma":0.00027200053,"threshold_uncertainty_score":0.99789834},"labels":[],"label_agreement":null},{"id":"W2921825769","doi":"10.1016/j.ejor.2019.02.051","title":"Appointment scheduling with multiple providers and stochastic service times","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"University of Alberta","funders":"","keywords":"Computer science; Service provider; Schedule; Heuristic; Overtime; Scheduling (production processes); Operations research; Job shop scheduling; Markov chain; Markov decision process; Markov process; Mathematical optimization; Service (business); Artificial intelligence; Machine learning; Business; Mathematics; Marketing","score_opus":0.11900085266531477,"score_gpt":0.4349375392900597,"score_spread":0.31593668662474494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921825769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565666,0.00020177857,0.02257821,0.014580513,0.00016979566,0.0010159911,0.000006418404,0.000013494439,0.004867198],"genre_scores_gemma":[0.969499,0.000030311234,0.0281422,0.00068976276,0.00028843453,0.000010031247,0.000013768324,0.000031947206,0.0012945699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616903,0.0020111024,0.0005679368,0.00018630091,0.00074368727,0.0003219595],"domain_scores_gemma":[0.9959278,0.000793788,0.00015416332,0.00015279173,0.0027518286,0.00021962685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059080967,0.00010086903,0.00017580904,0.00023727342,0.00083488517,0.000092673494,0.0001590987,0.0000360682,0.000507398],"category_scores_gemma":[0.0007685471,0.00007091512,0.000020132342,0.0003063718,0.000049401726,0.00039181038,0.00008360448,0.0009793718,0.00038452315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023064108,0.00042605877,0.06242297,0.0008967109,0.00027857858,0.00015245711,0.025886973,0.87174845,0.0077982447,0.014936969,0.0036766417,0.009469518],"study_design_scores_gemma":[0.018335354,0.006989012,0.10744175,0.0053411773,0.00006452882,0.00034739013,0.047961626,0.78693,0.00017485359,0.00026971436,0.025142817,0.0010017357],"about_ca_topic_score_codex":0.00003732894,"about_ca_topic_score_gemma":0.00003293602,"teacher_disagreement_score":0.08481843,"about_ca_system_score_codex":0.00012306683,"about_ca_system_score_gemma":0.0013247988,"threshold_uncertainty_score":0.6421346},"labels":[],"label_agreement":null},{"id":"W2935359384","doi":"10.1016/j.ejor.2019.03.043","title":"Optimal pricing in iterative flexible combinatorial procurement auctions","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial auction; Procurement; Bidding; Computer science; Profit maximization; Mathematical optimization; Profit (economics); Common value auction; Maximization; Microeconomics; Economics; Mathematics; Business; Marketing","score_opus":0.23057010675032194,"score_gpt":0.48081776787941793,"score_spread":0.250247661129096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935359384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91087174,0.000083799816,0.02187114,0.0049269944,0.00090123713,0.00050229486,0.0000071215973,0.000009589332,0.060826067],"genre_scores_gemma":[0.9907687,0.0000073232773,0.0020544808,0.000057188972,0.0004621733,0.000005370169,0.000002069287,0.0000105759045,0.0066321576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99423414,0.002099402,0.00089577754,0.00024607565,0.0023031714,0.0002214105],"domain_scores_gemma":[0.9962276,0.00093889795,0.00021179026,0.00024190199,0.0022563841,0.00012339948],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.020487178,0.000081572965,0.00017409708,0.0007085691,0.00032522797,0.00041936993,0.00067739934,0.000019616878,0.001839125],"category_scores_gemma":[0.0022859308,0.00005992624,0.00007604631,0.0012396276,0.00011741765,0.00072350504,0.000136552,0.0006494343,0.0015732044],"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.0006542646,0.00082057604,0.007071586,0.000007561879,0.000053668395,0.000076148266,0.005495477,0.11854114,0.021349415,0.81569964,0.023381568,0.0068489476],"study_design_scores_gemma":[0.009736082,0.004435514,0.109121986,0.00040703992,0.000017146962,0.0005540626,0.018646594,0.012958081,0.02200157,0.14486669,0.67643285,0.0008223714],"about_ca_topic_score_codex":0.0000017144041,"about_ca_topic_score_gemma":7.740424e-7,"teacher_disagreement_score":0.670833,"about_ca_system_score_codex":0.00013378664,"about_ca_system_score_gemma":0.0003822597,"threshold_uncertainty_score":0.99920416},"labels":[],"label_agreement":null},{"id":"W2943369941","doi":"10.1016/j.ejor.2019.04.028","title":"Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","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 Calgary","funders":"","keywords":"DOCK; Doors; Truck; Computer science; Garbage collection; Scheduling (production processes); GRASP; Operations research; Engineering; Operations management; Operating system; Garbage; Marine engineering","score_opus":0.04499644966441839,"score_gpt":0.32665404700687234,"score_spread":0.28165759734245394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943369941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614267,0.00013311613,0.034980197,0.0000904393,0.000078074045,0.00011909405,0.000011781131,0.000012547841,0.0031480975],"genre_scores_gemma":[0.9803349,0.00009525194,0.018744495,0.0000160402,0.000060248243,0.000001026852,0.000012588928,0.00003202371,0.00070343504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842954,0.00021495261,0.00037842416,0.00012599786,0.0006577899,0.00019332829],"domain_scores_gemma":[0.9985091,0.00016868177,0.0000852562,0.00013146024,0.0009932478,0.000112242466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056592,0.000117203526,0.00017271648,0.00015921924,0.000110324996,0.00010124379,0.00018389846,0.000024686215,0.000092691625],"category_scores_gemma":[0.00015564186,0.00008854462,0.000022572161,0.00018219197,0.000068818794,0.00022148238,0.00006838091,0.00041381718,0.000021473323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018644014,0.000019232064,0.0015084615,0.00006427013,0.00004115204,0.000031408497,0.00031912906,0.98506796,0.012021782,0.0001583324,0.000052855656,0.0005289593],"study_design_scores_gemma":[0.0060917907,0.0018829968,0.050563633,0.0012531308,0.000046838188,0.0005066651,0.0014220921,0.83299667,0.09750794,0.00028989802,0.0067229476,0.00071538734],"about_ca_topic_score_codex":0.000007230794,"about_ca_topic_score_gemma":0.0000072312937,"teacher_disagreement_score":0.1520713,"about_ca_system_score_codex":0.00013950016,"about_ca_system_score_gemma":0.0001173006,"threshold_uncertainty_score":0.36107448},"labels":[],"label_agreement":null},{"id":"W2944565881","doi":"10.1016/j.ejor.2019.04.047","title":"The Steiner Traveling Salesman Problem and its extensions","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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; Ministerio de Economía y Competitividad","keywords":"Travelling salesman problem; Bottleneck traveling salesman problem; Mathematics; Steiner tree problem; Mathematical optimization; Integer programming; Extension (predicate logic); Graph; Branch and cut; 2-opt; Combinatorics; Computer science","score_opus":0.0678517191682732,"score_gpt":0.3429520143905892,"score_spread":0.275100295222316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944565881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433782,0.0023755126,0.010638825,0.0024219921,0.0003510242,0.00033278778,0.0000033437689,0.00003704409,0.040461253],"genre_scores_gemma":[0.979901,0.00041216143,0.01763868,0.000026302145,0.0002142561,8.226628e-7,0.0000010319317,0.000035406316,0.0017703224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980464,0.0008015485,0.0003392532,0.000082363214,0.00053422636,0.00019618512],"domain_scores_gemma":[0.9984998,0.0005215314,0.000035551122,0.00010198669,0.0007405123,0.00010060455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069884583,0.0000679394,0.000089855894,0.000094587434,0.00026958337,0.00018971083,0.00021162762,0.00001465117,0.00006211287],"category_scores_gemma":[0.0004580945,0.000045771485,0.000028804456,0.0001882079,0.00003702634,0.00017642089,0.00005670787,0.00052314333,0.00009867312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004919008,0.000025324669,0.00080466317,0.000048704733,0.000087901826,0.00007032263,0.0009902811,0.87807614,0.08565686,0.014303061,0.0035884927,0.016299088],"study_design_scores_gemma":[0.0017702645,0.0004951504,0.029726919,0.00035111935,0.000014981333,0.0005463593,0.00069522794,0.91444457,0.0029883138,0.00034893712,0.048284236,0.0003339446],"about_ca_topic_score_codex":1.8808251e-7,"about_ca_topic_score_gemma":3.4586358e-7,"teacher_disagreement_score":0.08266855,"about_ca_system_score_codex":0.000032010958,"about_ca_system_score_gemma":0.000065349195,"threshold_uncertainty_score":0.24220742},"labels":[],"label_agreement":null},{"id":"W2949203745","doi":"10.1016/j.ejor.2019.10.010","title":"A concise guide to existing and emerging vehicle routing problem variants","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; 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":"Vehicle routing problem; Computer science; Diversity (politics); Focus (optics); Routing (electronic design automation); Data science; Management science; Operations research; Risk analysis (engineering); Engineering; Business; Political science; Computer network","score_opus":0.10251774212373478,"score_gpt":0.40096161314748013,"score_spread":0.29844387102374537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949203745","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.3098083,0.0012357043,0.58849615,0.0021965266,0.001278681,0.0011463454,0.000039822848,0.00015110402,0.09564738],"genre_scores_gemma":[0.65994245,0.00011778802,0.3378291,0.0000894871,0.0008302507,0.000004541734,0.000008465509,0.0001321737,0.0010457226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533474,0.0016998067,0.001080751,0.00032236506,0.0011123476,0.00044997974],"domain_scores_gemma":[0.997101,0.0005473056,0.00017636492,0.00028846512,0.0015915481,0.0002952786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01613283,0.00023164488,0.00036956058,0.00053448684,0.00024322045,0.00058135454,0.0005687333,0.00007022398,0.00007967696],"category_scores_gemma":[0.0026253301,0.00023263547,0.00007628782,0.00033491864,0.000046059446,0.00021601653,0.00085287844,0.0018279565,0.00007401075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023986553,0.000013597913,0.0005760844,0.00015275207,0.00007595085,0.00012266396,0.001483071,0.97641313,0.00738618,0.00037989704,0.003750951,0.0096217375],"study_design_scores_gemma":[0.0010956913,0.00022144942,0.0068821544,0.002107793,0.000027346505,0.00019183903,0.00047121427,0.97527975,0.0008450695,0.00012265358,0.012215578,0.00053947576],"about_ca_topic_score_codex":0.0000066135312,"about_ca_topic_score_gemma":7.147982e-7,"teacher_disagreement_score":0.35013413,"about_ca_system_score_codex":0.00024318622,"about_ca_system_score_gemma":0.00035275542,"threshold_uncertainty_score":0.9486599},"labels":[],"label_agreement":null},{"id":"W2952084589","doi":"10.1016/j.ejor.2019.05.036","title":"The return function: A new computable perspective on Bayesian–Nash equilibria","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Bayesian probability; Mathematical economics; Computer science; Outcome (game theory); Function (biology); Mathematical optimization; Bayesian game; Convergence (economics); Best response; Perspective (graphical); Mathematics; Economics; Game theory; Artificial intelligence; Repeated game","score_opus":0.20200591777418922,"score_gpt":0.4604277054761807,"score_spread":0.25842178770199153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952084589","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.3267274,0.0006699938,0.018660473,0.06670425,0.0010191838,0.000554641,0.000008808318,0.000017845587,0.5856374],"genre_scores_gemma":[0.937362,0.000016573986,0.00045388652,0.00032257938,0.00093596353,0.0000010252072,8.094375e-7,0.000014676762,0.060892455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932264,0.0027210067,0.0006348646,0.0002755224,0.0028688542,0.00027334294],"domain_scores_gemma":[0.9921893,0.004192054,0.00020158339,0.0004989309,0.0026872554,0.0002308975],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.022226304,0.00009494111,0.00015874964,0.0002468281,0.0007047158,0.0010641254,0.0013523843,0.000018985553,0.0025517982],"category_scores_gemma":[0.003798178,0.000052679625,0.00012564451,0.00085377856,0.0001879143,0.00040349402,0.00019086341,0.0007612091,0.005435074],"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.0009156166,0.00010129589,0.00040872875,8.9438663e-7,0.000053573145,0.000028701279,0.00086362445,0.0043982966,0.0052030897,0.6988397,0.274452,0.014734488],"study_design_scores_gemma":[0.0012827584,0.0019580454,0.014618803,0.000058842255,0.0000073676906,0.00015246884,0.0050343308,0.0056254156,0.00041694162,0.2229211,0.7477581,0.0001658142],"about_ca_topic_score_codex":0.0000030929314,"about_ca_topic_score_gemma":0.000001899202,"teacher_disagreement_score":0.6106346,"about_ca_system_score_codex":0.00011384299,"about_ca_system_score_gemma":0.0006044397,"threshold_uncertainty_score":0.9999729},"labels":[],"label_agreement":null},{"id":"W2954633348","doi":"10.1016/j.ejor.2019.06.032","title":"A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","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":"École de Technologie Supérieure; Transport Canada","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Pickup; Benchmark (surveying); Vehicle routing problem; Computer science; Column generation; Branch and cut; Operations research; Service (business); Routing (electronic design automation); Mathematical optimization; Algorithm; Integer programming; Business; Mathematics; Computer network; Marketing","score_opus":0.05003301532035377,"score_gpt":0.25972006346922477,"score_spread":0.209687048148871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954633348","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96381944,0.008237372,0.022575295,0.00043571042,0.00008129022,0.00082566525,0.000148131,0.000021707407,0.0038553914],"genre_scores_gemma":[0.9831966,0.0015946404,0.007986287,0.0000391354,0.00010941404,0.000004948428,0.000007282724,0.000031698506,0.007029993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990989,0.00009906798,0.00020421967,0.00011913409,0.00028968012,0.00018900825],"domain_scores_gemma":[0.99921227,0.0003319144,0.000024906056,0.000066418615,0.0002505617,0.00011390685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011250289,0.00010390216,0.00013999874,0.000090656446,0.00019310952,0.00012584029,0.000088946785,0.000018784975,0.000041296993],"category_scores_gemma":[0.000023026201,0.000065068,0.000019042158,0.00006710641,0.00020930074,0.00017608871,0.00003496082,0.00027771326,0.000017507782],"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.0076154494,0.0006919179,0.13341795,0.0045562857,0.0069474755,0.001523283,0.058634453,0.22939473,0.13979562,0.010864075,0.043764047,0.36279473],"study_design_scores_gemma":[0.011163603,0.0025795444,0.10942339,0.0003539751,0.0001289701,0.0013147286,0.0009802133,0.65016,0.0010445517,0.00007880645,0.22197576,0.000796471],"about_ca_topic_score_codex":0.000004298178,"about_ca_topic_score_gemma":0.000005388871,"teacher_disagreement_score":0.42076525,"about_ca_system_score_codex":0.00002902208,"about_ca_system_score_gemma":0.000043619897,"threshold_uncertainty_score":0.2653396},"labels":[],"label_agreement":null},{"id":"W2955657827","doi":"10.1016/j.ejor.2019.08.053","title":"Optimal dynamic reinsurance policies under a generalized Denneberg’s absolute deviation principle","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","cited_by":62,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinsurance; Mathematical economics; Absolute (philosophy); Mathematics; Absolute deviation; Dynamic programming; Mathematical optimization; Applied mathematics; Economics; Statistics; Actuarial science; Philosophy","score_opus":0.06707694475361713,"score_gpt":0.3220084421427112,"score_spread":0.25493149738909404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955657827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95984274,0.0013652557,0.007965442,0.0018740013,0.00042007008,0.00023228848,0.000026599939,0.000007830464,0.028265791],"genre_scores_gemma":[0.98721427,0.0007983863,0.0029944056,0.00027186473,0.0002838099,0.0000037545483,0.000011283684,0.000033186065,0.008389061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99801946,0.00020816212,0.0008727124,0.00024317631,0.0002929754,0.00036352262],"domain_scores_gemma":[0.9987849,0.00006646041,0.00034367532,0.00024562172,0.00046949554,0.00008981792],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004888065,0.00012066797,0.00028401028,0.00047806063,0.00022005413,0.00021665028,0.0004518848,0.00003112944,0.0004700638],"category_scores_gemma":[0.00023928055,0.000120923985,0.00012906342,0.00038227416,0.00006612089,0.0005218586,0.00011944659,0.0003996027,0.0023255292],"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.00033738592,0.00022334741,0.017394423,0.000053132375,0.00017086255,0.000089806104,0.0010287019,0.093640134,0.0017736322,0.87941927,0.0039358516,0.0019334519],"study_design_scores_gemma":[0.0021056382,0.00052568375,0.79235494,0.00008004683,0.000004434342,0.00003925964,0.00014108449,0.012322072,0.000098757664,0.004031759,0.18798135,0.00031498715],"about_ca_topic_score_codex":0.000034097044,"about_ca_topic_score_gemma":0.00001045151,"teacher_disagreement_score":0.8753875,"about_ca_system_score_codex":0.00024120657,"about_ca_system_score_gemma":0.00010391813,"threshold_uncertainty_score":0.9984513},"labels":[],"label_agreement":null},{"id":"W2955847803","doi":"10.1016/j.ejor.2021.03.025","title":"Nash equilibria in nonzero-sum differential games with impulse control","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","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":"HEC Montréal","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Mathematics; Differential game; Zero (linguistics); Zero-sum game; Impulse control; Control theory (sociology); Mathematical economics; Computer science; Control (management); Mathematical optimization; Artificial intelligence; Psychology","score_opus":0.06517767348667924,"score_gpt":0.3704378430500263,"score_spread":0.30526016956334706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955847803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514566,0.0001723044,0.012150571,0.010753972,0.00005996239,0.000107306434,0.000002945328,0.0000034555196,0.025292888],"genre_scores_gemma":[0.9967098,0.000052141826,0.001070488,0.0006877887,0.00028473674,0.00000199921,0.000006047061,0.00001258249,0.0011743658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9969991,0.001621431,0.00050671824,0.0001503298,0.0004323049,0.0002901459],"domain_scores_gemma":[0.99793094,0.0009795217,0.00005502886,0.00012388975,0.00069274876,0.00021788136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038127585,0.00008492597,0.00036339927,0.00012361238,0.000078982564,0.000028162869,0.000115954135,0.000040381405,0.002096445],"category_scores_gemma":[0.0024663284,0.000051442912,0.00007955864,0.00015114248,0.00031250363,0.00008324836,0.000058318852,0.00081257493,0.00009419791],"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.012480875,0.003416192,0.037513454,0.00029820733,0.00089747383,0.027558064,0.00090502383,0.0011479477,0.09742578,0.80442625,0.00752712,0.0064036073],"study_design_scores_gemma":[0.058269687,0.014794213,0.7005102,0.0032177179,0.0003291675,0.013341891,0.0011086197,0.12798585,0.008779604,0.062459834,0.008213756,0.0009894689],"about_ca_topic_score_codex":5.826185e-7,"about_ca_topic_score_gemma":0.0000016973441,"teacher_disagreement_score":0.7419664,"about_ca_system_score_codex":0.000031015345,"about_ca_system_score_gemma":0.0003366258,"threshold_uncertainty_score":0.9988158},"labels":[],"label_agreement":null},{"id":"W2959724087","doi":"10.1016/j.ejor.2019.07.020","title":"Price optimization with reference price effects: A generalized Benders’ decomposition method and a myopic heuristic approach","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Heuristic; Computation; Decomposition; Maximization; Computer science; Integer (computer science); Mathematics; Algorithm","score_opus":0.05829256702903345,"score_gpt":0.33593071672722713,"score_spread":0.27763814969819367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959724087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5878704,0.00034331682,0.338711,0.00062763697,0.00010576146,0.000600666,0.0000013024638,0.000021934778,0.071717955],"genre_scores_gemma":[0.9477011,0.000041166844,0.051439643,0.00021421167,0.00024309273,0.000004359743,0.000023026683,0.000027405678,0.0003059931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99805015,0.00052167487,0.00030670888,0.00021556013,0.00069524295,0.00021068781],"domain_scores_gemma":[0.99844456,0.00029840917,0.00017508306,0.00012717387,0.0009198833,0.000034898352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887575,0.000119018696,0.00017742507,0.0004124493,0.00024204204,0.0005653532,0.0002117983,0.000020602953,0.00020664174],"category_scores_gemma":[0.00024066301,0.00009038451,0.000029374312,0.0004575981,0.000041628016,0.0008953522,0.00012412276,0.00039364476,0.000034325793],"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.010673712,0.0027441494,0.2375317,0.005864559,0.001231413,0.0015290932,0.0032752657,0.41692665,0.09255194,0.10691406,0.008299636,0.11245781],"study_design_scores_gemma":[0.013057593,0.0011858785,0.57941633,0.0012140971,0.0003550692,0.00083967944,0.000821038,0.37418082,0.00029301282,0.0004920566,0.026936576,0.0012078062],"about_ca_topic_score_codex":0.000022162149,"about_ca_topic_score_gemma":9.869603e-7,"teacher_disagreement_score":0.35983068,"about_ca_system_score_codex":0.0000385366,"about_ca_system_score_gemma":0.00007943782,"threshold_uncertainty_score":0.5451714},"labels":[],"label_agreement":null},{"id":"W2960490086","doi":"10.1016/j.ejor.2019.07.012","title":"A conic relaxation model for searching for the global optimum of network data envelopment analysis","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Innovative Research Group Project of the National Natural Science Foundation of China","keywords":"Conic section; Data envelopment analysis; Mathematical optimization; Relaxation (psychology); Linear programming; Multiplier (economics); Computer science; Computation; Linear model; Network model; Mathematics; Algorithm; Data mining","score_opus":0.4024850938230459,"score_gpt":0.5118073584611952,"score_spread":0.10932226463814926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960490086","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.06912985,0.0004137424,0.9243516,0.0041082273,0.00014763781,0.00049549073,0.00012930496,0.000002526238,0.0012216424],"genre_scores_gemma":[0.9526791,0.000042082793,0.04568991,0.00009226721,0.0002226363,0.0000031903185,0.000036460988,0.000010862852,0.0012235072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925721,0.0016064929,0.0013335227,0.00040101982,0.0037349325,0.00035191077],"domain_scores_gemma":[0.98696595,0.0070587057,0.00058966095,0.00091180677,0.0043654284,0.00010842802],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.080643974,0.000098715136,0.00034665875,0.00044908831,0.0005436058,0.00049814564,0.002950855,0.00002264953,0.000113632246],"category_scores_gemma":[0.011725704,0.00005844913,0.000299209,0.0022620836,0.00016257941,0.0005125846,0.00050419185,0.00029665136,0.000040746112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023453876,0.000049209735,0.0027782223,0.0000037626514,0.00037538513,0.0000014977542,0.000287475,0.9762576,0.00015934918,0.0070268256,0.0072612264,0.0055648712],"study_design_scores_gemma":[0.00049447845,0.00018871418,0.006504841,0.0000218679,0.00010834415,0.0000046145765,0.00026758705,0.9842197,0.000015677333,0.0028259412,0.005286233,0.00006202732],"about_ca_topic_score_codex":0.0000061828314,"about_ca_topic_score_gemma":0.000024392277,"teacher_disagreement_score":0.8835492,"about_ca_system_score_codex":0.00012773248,"about_ca_system_score_gemma":0.001030433,"threshold_uncertainty_score":0.99659896},"labels":[],"label_agreement":null},{"id":"W2963427521","doi":"10.1016/j.ejor.2018.10.035","title":"Power transmission network expansion planning: A semidefinite programming branch-and-bound approach","year":2018,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":43,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Branch and bound; Mathematical optimization; Integer programming; Node (physics); Computer science; Linear programming relaxation; Relaxation (psychology); Transmission (telecommunications); Tree (set theory); Integer (computer science); Network planning and design; Upper and lower bounds; Search tree; Mathematics; Search algorithm","score_opus":0.047010121484510725,"score_gpt":0.30601575257613706,"score_spread":0.25900563109162633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963427521","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.20353206,0.0059450977,0.7166539,0.00028619403,0.00046917805,0.00044257453,0.0000017358783,0.0000954212,0.07257387],"genre_scores_gemma":[0.9760111,0.00010329469,0.022820398,0.000027039563,0.000733891,0.0000027654776,0.000006368327,0.000053450578,0.0002416917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975697,0.0006267221,0.00048794356,0.00015637488,0.00079449837,0.00036475965],"domain_scores_gemma":[0.99885106,0.00014646217,0.00005919771,0.00012215917,0.0006335093,0.00018762807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044513694,0.00012739863,0.00016755353,0.00025265658,0.00032199628,0.00025642736,0.00021944805,0.00003906543,0.000068457266],"category_scores_gemma":[0.00014162879,0.00010692739,0.000045051613,0.0004771899,0.000097101976,0.00034162105,0.00003536142,0.0005327381,0.00003209734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095803494,0.00039558677,0.0034712465,0.00038911126,0.0005164685,0.00052101637,0.019783152,0.6990486,0.054428052,0.004013852,0.091857724,0.12461715],"study_design_scores_gemma":[0.0057168896,0.005937508,0.023254458,0.0028012826,0.000061131206,0.0032469924,0.0008486776,0.5015382,0.0045979167,0.0004910744,0.45009407,0.001411767],"about_ca_topic_score_codex":6.07366e-7,"about_ca_topic_score_gemma":8.944223e-8,"teacher_disagreement_score":0.77247906,"about_ca_system_score_codex":0.00007199153,"about_ca_system_score_gemma":0.000099029436,"threshold_uncertainty_score":0.43603724},"labels":[],"label_agreement":null},{"id":"W2964487007","doi":"10.1016/j.ejor.2019.07.049","title":"Multi-objective optimization of a two-echelon vehicle routing problem with vehicle synchronization and ‘grey zone’ customers arising in urban logistics","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":150,"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; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichische Forschungsförderungsgesellschaft","keywords":"Vehicle routing problem; Computer science; Operations research; Synchronization (alternating current); City logistics; Routing (electronic design automation); Business; Mathematical optimization; Transport engineering; Computer network; Mathematics; Engineering","score_opus":0.038374522156203794,"score_gpt":0.3206628979252961,"score_spread":0.2822883757690923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964487007","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.36082613,0.00015618405,0.63707,0.00006140689,0.00005438183,0.0002945456,0.00000344749,0.000021125776,0.0015127651],"genre_scores_gemma":[0.7739227,0.000046139285,0.2258558,0.000008120157,0.00005723432,0.0000012270166,0.0000060019797,0.000046799807,0.0000560137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973022,0.0009965926,0.0006176559,0.00018540511,0.00062953954,0.00026864978],"domain_scores_gemma":[0.9981182,0.00032283098,0.00017061795,0.00012996257,0.0011645526,0.00009382071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046110814,0.00013546426,0.00023357349,0.0004733129,0.000106646556,0.00012937057,0.000174272,0.000039499,0.000025358871],"category_scores_gemma":[0.0005203895,0.00012487512,0.000026019075,0.0007778958,0.00010079681,0.00048785907,0.000063885,0.0005987993,0.000006492311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006686402,0.000048753795,0.026278384,0.00006066662,0.000030401792,0.000021513386,0.0014367796,0.95988965,0.010198496,0.00018772317,0.0000115375215,0.0017692219],"study_design_scores_gemma":[0.0019053692,0.00027654984,0.011051942,0.00033061634,0.000008823462,0.00003122728,0.00045959596,0.984259,0.001527768,0.000004190088,0.000014791563,0.0001300954],"about_ca_topic_score_codex":0.000014948688,"about_ca_topic_score_gemma":0.0000055125997,"teacher_disagreement_score":0.41309652,"about_ca_system_score_codex":0.00024675007,"about_ca_system_score_gemma":0.00017641821,"threshold_uncertainty_score":0.50922596},"labels":[],"label_agreement":null},{"id":"W2966040948","doi":"10.1016/j.ejor.2020.09.019","title":"Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Sizing; Mathematical optimization; Time horizon; Benders' decomposition; Decomposition; Computer science; Production (economics); Holding cost; Process (computing); Variable (mathematics); Operations research; Mathematics; Economics","score_opus":0.12242809421037062,"score_gpt":0.3141267384615399,"score_spread":0.19169864425116925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966040948","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.393918,0.00029915638,0.5510904,0.04988526,0.00019268402,0.0018247197,0.00008792993,0.000040316958,0.0026615316],"genre_scores_gemma":[0.9952877,0.000003491233,0.0024550937,0.00096602936,0.0011270843,0.0000059194726,0.00010468143,0.000021639704,0.000028327044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986167,0.00006247102,0.00029544224,0.00018820584,0.0006361687,0.00020102192],"domain_scores_gemma":[0.9989474,0.00007172673,0.00014337419,0.00006579361,0.00072687207,0.000044841378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013265002,0.00010342615,0.000119807344,0.00012194078,0.00034427183,0.00050286064,0.00017557085,0.000012103739,0.00008552572],"category_scores_gemma":[0.00023521463,0.00007923404,0.00003735052,0.00021966368,0.0000653134,0.0006857527,0.00011671338,0.00022169661,0.000009168491],"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.014225047,0.0010469868,0.0109293675,0.003429659,0.001601825,0.00076519256,0.004370987,0.16302359,0.0321449,0.36430582,0.30551744,0.098639205],"study_design_scores_gemma":[0.027879247,0.007649549,0.09570238,0.0022411551,0.0005513855,0.0002990929,0.010748846,0.46504828,0.00092884694,0.01583082,0.37094215,0.0021782427],"about_ca_topic_score_codex":0.0000071353847,"about_ca_topic_score_gemma":0.0000127434605,"teacher_disagreement_score":0.60136974,"about_ca_system_score_codex":0.000058653397,"about_ca_system_score_gemma":0.000053207757,"threshold_uncertainty_score":0.48490968},"labels":[],"label_agreement":null},{"id":"W2969100573","doi":"10.1016/j.ejor.2019.08.014","title":"Considering short-term and long-term uncertainties in location and capacity planning of public healthcare facilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":47,"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":"Term (time); Service (business); Computer science; Queueing theory; Operations research; Service level; Robust optimization; Mathematical optimization; Service provider; Set (abstract data type); Order (exchange); Business; Engineering; Mathematics; Computer network; Statistics","score_opus":0.21631236469189882,"score_gpt":0.3509168728064556,"score_spread":0.1346045081145568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969100573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99526864,0.0005246121,0.00029164512,0.002123126,0.000100637255,0.00016899891,0.0000018299945,0.0000045608995,0.0015159483],"genre_scores_gemma":[0.9993841,0.0001058962,0.00006758073,0.0000845929,0.00010679023,0.0000015328422,0.000008472939,0.0000076299675,0.00023337392],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99852747,0.00018152568,0.00046009914,0.00014250215,0.0005091832,0.00017921775],"domain_scores_gemma":[0.9988636,0.000058759524,0.000055388053,0.00009722484,0.00089835894,0.000026712794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037190446,0.000080769,0.0001486298,0.0005362702,0.000120928955,0.00024205382,0.00013430385,0.000015400734,0.00012876862],"category_scores_gemma":[0.0003761164,0.00007333277,0.00001971865,0.00025165253,0.00013852498,0.0010016605,0.0001478775,0.00023578729,0.00001588592],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005645073,0.000049960177,0.9723474,0.0011311952,0.000028105906,0.000019113284,0.0011994751,0.0026821028,0.000889539,0.016218808,0.00017743083,0.0052004545],"study_design_scores_gemma":[0.00039197755,0.000057759185,0.9930432,0.00027404577,0.0000030615465,0.0000095188425,0.0024584709,0.0026505648,0.00002827197,0.00010581586,0.0008870718,0.000090279515],"about_ca_topic_score_codex":0.00017878979,"about_ca_topic_score_gemma":0.00023786677,"teacher_disagreement_score":0.020695798,"about_ca_system_score_codex":0.000041539308,"about_ca_system_score_gemma":0.00006460639,"threshold_uncertainty_score":0.29904234},"labels":[],"label_agreement":null},{"id":"W2971552437","doi":"10.1016/j.ejor.2019.09.007","title":"Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interactive kiosk; Product (mathematics); Service (business); Computer science; Service provider; Operations research; Substitution (logic); Business; Marketing; World Wide Web; Engineering; Mathematics","score_opus":0.11201954784859956,"score_gpt":0.3275346788876024,"score_spread":0.21551513103900283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971552437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810809,0.000099640616,0.004160494,0.0029825044,0.00021017628,0.0005635468,0.0000038104283,0.000010802372,0.010888158],"genre_scores_gemma":[0.9964688,0.000019723504,0.0008249336,0.0006729993,0.0009919857,0.0000074095383,0.000026287462,0.000026077136,0.00096181536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982379,0.00011962868,0.00032135998,0.0002073875,0.0008366403,0.00027707257],"domain_scores_gemma":[0.99889946,0.00010840085,0.00015509335,0.00011132607,0.0006825918,0.00004310293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003281258,0.00012460715,0.00016166939,0.00035212503,0.00033353537,0.00051810406,0.00023460915,0.000011291946,0.00035568204],"category_scores_gemma":[0.00007676222,0.000097313394,0.000048828468,0.00017596764,0.00009669042,0.0010724644,0.00012190545,0.0002920038,0.00010459071],"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.0049984674,0.0017803288,0.28327593,0.0020339196,0.0015103256,0.00043186915,0.0018874237,0.20983107,0.036882598,0.3370866,0.11294657,0.007334896],"study_design_scores_gemma":[0.019576956,0.00078535755,0.22577168,0.0014546167,0.00020666602,0.00007175282,0.0021402712,0.08173745,0.0025711,0.0020896236,0.66253626,0.0010582522],"about_ca_topic_score_codex":0.000014976737,"about_ca_topic_score_gemma":0.000005697239,"teacher_disagreement_score":0.5495897,"about_ca_system_score_codex":0.00008848608,"about_ca_system_score_gemma":0.000065110464,"threshold_uncertainty_score":0.4996089},"labels":[],"label_agreement":null},{"id":"W2971712595","doi":"10.1016/j.ejor.2019.08.047","title":"On the construction of a feasible range of multidimensional poverty under benchmark weight uncertainty","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Income, Poverty, and Inequality","field":"Social Sciences","cited_by":19,"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; Edge Hill University","keywords":"Stochastic dominance; Benchmark (surveying); Poverty; Portfolio; Econometrics; Range (aeronautics); Population; Mathematics; Dominance (genetics); Mathematical optimization; Economics; Computer science; Geography; Economic growth","score_opus":0.09124551068509444,"score_gpt":0.3755260425692831,"score_spread":0.28428053188418867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971712595","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8775447,0.000086045664,0.00010646037,0.004640579,0.0003984342,0.00021352051,0.000020852456,0.0000022551208,0.116987154],"genre_scores_gemma":[0.99758065,0.00009062825,0.00050709717,0.00030418136,0.0002766897,5.906781e-7,0.000003011269,0.00000810445,0.0012290714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99372596,0.0034025668,0.00051166676,0.00011928893,0.0020299954,0.00021052794],"domain_scores_gemma":[0.9961002,0.0014714075,0.00024067587,0.00016089223,0.001933474,0.00009334425],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011739845,0.00007462541,0.00018332616,0.00016109005,0.00036731787,0.00003781989,0.00035807432,0.00003173156,0.0034017074],"category_scores_gemma":[0.0013634766,0.000045723318,0.000121793586,0.00032476042,0.0005041119,0.00023078597,0.000062938394,0.00042878135,0.000067008135],"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.0007463677,0.00032441464,0.010358454,0.000024179699,0.000088503475,0.000008111949,0.0035814983,0.0015703696,0.0067313802,0.9540441,0.021820035,0.00070256134],"study_design_scores_gemma":[0.015190025,0.009160782,0.62406653,0.002136032,0.00010015612,0.00012882824,0.05145026,0.0047783116,0.017152378,0.0628555,0.21168926,0.0012919089],"about_ca_topic_score_codex":0.00023174183,"about_ca_topic_score_gemma":0.000029527584,"teacher_disagreement_score":0.8911886,"about_ca_system_score_codex":0.00013657984,"about_ca_system_score_gemma":0.00079303724,"threshold_uncertainty_score":0.9975093},"labels":[],"label_agreement":null},{"id":"W2974223901","doi":"10.1016/j.ejor.2019.08.040","title":"Pareto solutions in multicriteria optimization under uncertainty","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":39,"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":"University of Colorado Denver; Lancaster University","keywords":"Mathematical optimization; Uncountable set; Pareto principle; Mathematics; Multi-objective optimization; Leverage (statistics); Robustness (evolution); Computer science; Countable set; Discrete mathematics","score_opus":0.2795321122757877,"score_gpt":0.4655253884037594,"score_spread":0.18599327612797167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974223901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79246324,0.000399225,0.1535383,0.0069031897,0.0010777692,0.0005286072,0.000020567639,0.000012125269,0.045056973],"genre_scores_gemma":[0.98900205,0.00020930536,0.0080114035,0.00013843593,0.0002029419,0.0000012192722,0.000012975123,0.00001544022,0.0024062067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932107,0.002844983,0.0010357599,0.00024208757,0.0023666052,0.00029987592],"domain_scores_gemma":[0.9956513,0.0009595881,0.00020274971,0.00027969002,0.002764081,0.00014260034],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.020481346,0.000090495276,0.00019365104,0.00094479526,0.00020398683,0.00049869163,0.000651749,0.000030647974,0.0022201915],"category_scores_gemma":[0.0031766475,0.00006664195,0.000078658675,0.001189324,0.00009458565,0.0008275047,0.00013232828,0.00043208324,0.000736082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084536645,0.00006624841,0.0053954916,7.5386015e-7,0.0000063773396,0.000028032591,0.00030875203,0.98311776,0.0004949435,0.0016455341,0.0059063826,0.0029451875],"study_design_scores_gemma":[0.0015714593,0.00046525663,0.080591165,0.00007791122,0.0000043561427,0.00009054745,0.0019572682,0.8866434,0.000072719624,0.0016508173,0.02666848,0.00020663267],"about_ca_topic_score_codex":0.000012856605,"about_ca_topic_score_gemma":0.000015944242,"teacher_disagreement_score":0.19653884,"about_ca_system_score_codex":0.0001257582,"about_ca_system_score_gemma":0.00041030505,"threshold_uncertainty_score":0.9986919},"labels":[],"label_agreement":null},{"id":"W2974538316","doi":"10.1016/j.ejor.2019.09.002","title":"Ranking flexibility structures in queueing systems","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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; National Science Foundation","keywords":"Computer science; Flexibility (engineering); Ranking (information retrieval); Scheduling (production processes); Mathematical optimization; Queueing theory; Construct (python library); Operations research; Distributed computing; Mathematics; Artificial intelligence; Statistics; Computer network","score_opus":0.07116925766332625,"score_gpt":0.3478621419927272,"score_spread":0.2766928843294009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974538316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96366554,0.0002373125,0.0008793443,0.00042719208,0.00028830493,0.00015027812,5.132439e-7,0.0000099149465,0.034341585],"genre_scores_gemma":[0.9979112,0.0000058703276,0.0002970709,0.00014155052,0.0011446972,7.170903e-7,0.0000032631483,0.000022509657,0.00047311847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99754167,0.0005454307,0.0005609717,0.00018594354,0.00091605383,0.00024991148],"domain_scores_gemma":[0.99839056,0.00025782562,0.00020401969,0.00019507266,0.00093478075,0.000017752025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011923029,0.00009538856,0.00020725456,0.00074454484,0.00015752786,0.00048458326,0.0004499127,0.000017188931,0.00046433817],"category_scores_gemma":[0.001242056,0.00007743372,0.00007409649,0.000668727,0.00006151791,0.0014114336,0.00016524519,0.0005836461,0.0003402167],"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.00054788426,0.00010411516,0.04233312,0.00021143584,0.00008558575,0.00041487635,0.00026437547,0.6047845,0.012520229,0.33337405,0.000923397,0.0044364],"study_design_scores_gemma":[0.010752112,0.00043921187,0.33627802,0.0027954965,0.000106534164,0.0002701924,0.00792077,0.32993653,0.00085808395,0.09460341,0.21422967,0.0018099708],"about_ca_topic_score_codex":0.000049466264,"about_ca_topic_score_gemma":0.000008861752,"teacher_disagreement_score":0.2939449,"about_ca_system_score_codex":0.00010096504,"about_ca_system_score_gemma":0.00006732036,"threshold_uncertainty_score":0.5084177},"labels":[],"label_agreement":null},{"id":"W2987023879","doi":"10.1016/j.ejor.2019.11.015","title":"Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":55,"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":"Iterated local search; Mathematical optimization; Computer science; Heuristic; Routing (electronic design automation); Metaheuristic; Product (mathematics); Time horizon; Set (abstract data type); Quality (philosophy); USable; Vehicle routing problem; Algorithm; Mathematics","score_opus":0.053666287729541004,"score_gpt":0.32640920298315945,"score_spread":0.27274291525361843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987023879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65845263,0.00045387034,0.3377019,0.00033497962,0.00009736549,0.00069403666,0.000013253238,0.000039550057,0.0022124276],"genre_scores_gemma":[0.7050791,0.0000354892,0.29420236,0.000017949236,0.00023428349,0.000004525953,0.00001066597,0.000047767484,0.00036785187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984207,0.00042026193,0.00033833346,0.00016620736,0.00042422462,0.00023025007],"domain_scores_gemma":[0.99862444,0.0001801759,0.00006155051,0.000115672105,0.0008867448,0.00013140889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045673917,0.00010084216,0.00014965594,0.00019027677,0.00021042424,0.00024357723,0.0001272075,0.000013529221,0.000018650377],"category_scores_gemma":[0.00032423116,0.00008554471,0.000017234228,0.00016655849,0.000051745767,0.0005713371,0.00003952316,0.00031948803,0.0000054881266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029694702,0.00020115651,0.010877543,0.00082572596,0.0003038396,0.0000728213,0.0044583557,0.72125214,0.022539154,0.0037030412,0.003296312,0.23217294],"study_design_scores_gemma":[0.0012958777,0.00082090707,0.004063246,0.00016767776,0.000011554375,0.00031538517,0.00012534528,0.9892826,0.0010026646,0.00012776,0.0026174807,0.00016947465],"about_ca_topic_score_codex":0.0000014874232,"about_ca_topic_score_gemma":5.7261764e-7,"teacher_disagreement_score":0.26803046,"about_ca_system_score_codex":0.000053239448,"about_ca_system_score_gemma":0.00013016592,"threshold_uncertainty_score":0.3488412},"labels":[],"label_agreement":null},{"id":"W2989913882","doi":"10.1016/j.ejor.2019.11.041","title":"Comparison of fluid approximations for service systems with state-dependent service rates and return probabilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Service (business); Bistability; Queueing theory; Ordinary differential equation; Applied mathematics; Stochastic differential equation; Set (abstract data type); Differential equation; Mathematical optimization; Mathematics; Physics; Mathematical analysis; Economics","score_opus":0.0762223104135542,"score_gpt":0.3469369497810108,"score_spread":0.2707146393674566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989913882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893884,0.00019983982,0.0055319476,0.001384604,0.000066687484,0.0005141649,0.0000076040815,0.000009092495,0.0028976817],"genre_scores_gemma":[0.99722105,0.0000043553205,0.0017649065,0.00013802738,0.0002481442,0.000005312227,0.00001582995,0.000026343532,0.0005760285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818784,0.00020116911,0.0005542197,0.00015282886,0.0007187879,0.000185183],"domain_scores_gemma":[0.9943938,0.00046197782,0.00033492464,0.00015411593,0.004631804,0.000023351718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005807064,0.00010019188,0.00025317384,0.00035378145,0.00019750469,0.00031425545,0.00027782284,0.0000139379,0.000041217692],"category_scores_gemma":[0.00035327332,0.0000736207,0.000031675256,0.0005116296,0.00006095049,0.001009742,0.00011077405,0.0002256014,0.000028824812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00463169,0.00072968006,0.06408998,0.0074117994,0.000751732,0.000032593427,0.004902897,0.701822,0.064030044,0.14874907,0.0013839036,0.0014646155],"study_design_scores_gemma":[0.008595337,0.0016316292,0.01865257,0.002715419,0.00029186645,0.000108885506,0.04856371,0.8622445,0.007927239,0.012316922,0.03584286,0.001109098],"about_ca_topic_score_codex":0.000029052133,"about_ca_topic_score_gemma":0.000039159146,"teacher_disagreement_score":0.16042247,"about_ca_system_score_codex":0.000035511282,"about_ca_system_score_gemma":0.00007951575,"threshold_uncertainty_score":0.30303726},"labels":[],"label_agreement":null},{"id":"W2991187918","doi":"10.1016/j.ejor.2019.11.043","title":"A branch-and-price heuristic for the crew pairing problem with language constraints","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"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; Group for Research in Decision Analysis; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Computer science; Heuristic; Set (abstract data type); Schedule; Operations research; Tree (set theory); Mathematical optimization; Artificial intelligence; Programming language; Mathematics; Engineering","score_opus":0.0438936097016484,"score_gpt":0.3347566218631179,"score_spread":0.2908630121614695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991187918","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.34343123,0.001072578,0.63252187,0.0013112808,0.00014459937,0.0007094691,0.000011107838,0.00004201928,0.020755831],"genre_scores_gemma":[0.94276315,0.000042982698,0.056468844,0.000042415795,0.00017013158,0.0000032291387,0.0000013824291,0.00003437891,0.00047348754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.0003858039,0.00024613066,0.00008502169,0.00040805282,0.00018426465],"domain_scores_gemma":[0.99830353,0.0010424289,0.000040921554,0.00010355542,0.00043678176,0.00007277155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005130776,0.000071235074,0.000103015045,0.0000970846,0.00013568155,0.00015132737,0.00019692481,0.000011326581,0.00013084669],"category_scores_gemma":[0.00045392607,0.000045411514,0.000027312857,0.00015847417,0.000089127105,0.00013109007,0.000032823304,0.0003626672,0.000024708927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017955306,0.000036866302,0.002587152,0.0002656851,0.00022756828,0.0000775892,0.00396305,0.9231994,0.017632091,0.004012316,0.0019753084,0.045843404],"study_design_scores_gemma":[0.008305898,0.0020497027,0.0718723,0.0012959758,0.00007795921,0.001827211,0.0037178125,0.88353616,0.0041669426,0.00022751474,0.022138111,0.00078443915],"about_ca_topic_score_codex":6.5919096e-7,"about_ca_topic_score_gemma":4.2351803e-7,"teacher_disagreement_score":0.5993319,"about_ca_system_score_codex":0.00003396492,"about_ca_system_score_gemma":0.000082286475,"threshold_uncertainty_score":0.18518278},"labels":[],"label_agreement":null},{"id":"W2997578005","doi":"10.1016/j.ejor.2020.01.055","title":"Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":124,"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é de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Electric vehicle; Mathematical optimization; Heuristic; Software deployment; Novelty; Integer programming; Time horizon; Operations research; Linear programming; State (computer science); Charging station; Power (physics); Mathematics; Algorithm; Artificial intelligence","score_opus":0.038647356587535875,"score_gpt":0.2947704572191696,"score_spread":0.25612310063163374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997578005","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.4465477,0.0010664655,0.55056286,0.0013719497,0.000022670405,0.00014746058,0.000010005721,0.0000064957303,0.00026443665],"genre_scores_gemma":[0.993881,0.00022416416,0.005582105,0.000076124124,0.00019411159,0.0000019624529,0.000004033135,0.000023551818,0.00001296991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987549,0.00023220245,0.00032877695,0.00008522496,0.0004139696,0.00018491138],"domain_scores_gemma":[0.9991765,0.00023548421,0.00005435521,0.000052286745,0.00040445448,0.00007692869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010233237,0.00007602135,0.000113432354,0.00006144948,0.00019002229,0.000076012286,0.00015678362,0.000014653784,0.000017912858],"category_scores_gemma":[0.00016058933,0.00005036725,0.000041664392,0.00028454163,0.000057761255,0.00023309981,0.000021799757,0.00038103922,0.0000016595233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005835194,0.000051250536,0.0008137219,0.00015496496,0.00018106455,0.00004141155,0.005310489,0.7201845,0.20356525,0.009690981,0.004127686,0.05529515],"study_design_scores_gemma":[0.0015111978,0.0012266242,0.044023294,0.00010804843,0.000028630155,0.00016526393,0.0015325577,0.93130773,0.016999727,0.00023749351,0.0026813557,0.00017806588],"about_ca_topic_score_codex":0.000004067439,"about_ca_topic_score_gemma":0.0000010286714,"teacher_disagreement_score":0.5473333,"about_ca_system_score_codex":0.00005679737,"about_ca_system_score_gemma":0.00008180575,"threshold_uncertainty_score":0.20539169},"labels":[],"label_agreement":null},{"id":"W3000512791","doi":"10.1016/j.ejor.2019.12.039","title":"Portfolio problems with two levels decision-makers: Optimal portfolio selection with pricing decisions on transaction costs","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":29,"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":"Ministerio de Ciencia y Tecnología","keywords":"Portfolio; Transaction cost; Computer science; Portfolio optimization; Selection (genetic algorithm); Microeconomics; Database transaction; Economics; Application portfolio management; Modern portfolio theory; Operations research; Project portfolio management; Business; Finance; Mathematics; Project management","score_opus":0.12422491092322667,"score_gpt":0.311175158493147,"score_spread":0.1869502475699203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000512791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377638,0.00019789254,0.32894382,0.0019762584,0.00011580247,0.0003476235,0.0000476364,0.000015537616,0.030591661],"genre_scores_gemma":[0.9869692,0.00013593353,0.011682114,0.00029131607,0.00043554697,0.0000046615505,0.0000064265346,0.00005696157,0.00041786712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978775,0.00015194554,0.0009156147,0.00039454235,0.0003160581,0.00034438918],"domain_scores_gemma":[0.9982274,0.0003362372,0.0003811158,0.0001600094,0.0005728548,0.00032238523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034430453,0.00017533464,0.00035001364,0.00046518378,0.0003696959,0.00031755966,0.0003245601,0.00003109948,0.000888286],"category_scores_gemma":[0.00036948788,0.00014195357,0.00009162852,0.00053985126,0.000094568095,0.00072460365,0.000033251323,0.00071752776,0.00022838092],"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.00430487,0.0003961731,0.004253051,0.000018675573,0.00039769764,0.00040509328,0.0020348458,0.813827,0.0006481756,0.14538147,0.005270617,0.023062339],"study_design_scores_gemma":[0.05931938,0.077265404,0.13789217,0.0047529843,0.00020280505,0.00663631,0.007153218,0.25224635,0.0058249854,0.023632236,0.41961047,0.0054637096],"about_ca_topic_score_codex":0.000018589662,"about_ca_topic_score_gemma":0.000010464856,"teacher_disagreement_score":0.56158066,"about_ca_system_score_codex":0.00026702863,"about_ca_system_score_gemma":0.0002567281,"threshold_uncertainty_score":0.9726109},"labels":[],"label_agreement":null},{"id":"W3003545925","doi":"10.1016/j.ejor.2020.01.044","title":"Strategic offering of a flexible producer in day-ahead and intraday power markets","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Power System Optimization","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":"HEC Montréal","funders":"","keywords":"Profit maximization; Clearance; Profit (economics); Market power; Market clearing; Industrial organization; Competition (biology); Clearing; Electricity market; Imperfect competition; Business; Microeconomics; Economics; Electricity; Finance","score_opus":0.0715432544506043,"score_gpt":0.2978802218438506,"score_spread":0.2263369673932463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003545925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9575651,0.0018793317,0.005705888,0.0010519525,0.00014454869,0.00022818147,0.0000035737464,0.000017847135,0.033403542],"genre_scores_gemma":[0.99854493,0.00010022334,0.0011103973,0.000016430393,0.00011648159,0.0000011167731,0.0000014256656,0.00002608276,0.00008292647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819314,0.00053412246,0.00046639924,0.00011068818,0.00051254994,0.00018311168],"domain_scores_gemma":[0.999331,0.00011018898,0.000045246128,0.00007725232,0.0003191072,0.000117194075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002907293,0.00007839351,0.00015481484,0.00024014921,0.000032015934,0.00006892139,0.00017302441,0.000016957558,0.00015016922],"category_scores_gemma":[0.0003017825,0.000071284136,0.000021537799,0.00043889758,0.000034339777,0.00024757985,0.000037828948,0.0004099909,0.000012288239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001114423,0.00041882516,0.010857677,0.0009886484,0.00053448125,0.001960857,0.026668515,0.48263133,0.42440292,0.013796339,0.018854268,0.017771728],"study_design_scores_gemma":[0.010489448,0.0061495425,0.41217253,0.0024573694,0.000047995556,0.0011600186,0.003676115,0.47340235,0.07498055,0.00043087182,0.01340482,0.0016283861],"about_ca_topic_score_codex":0.0000011726787,"about_ca_topic_score_gemma":4.8115584e-7,"teacher_disagreement_score":0.40131485,"about_ca_system_score_codex":0.000054579785,"about_ca_system_score_gemma":0.00011460241,"threshold_uncertainty_score":0.29068828},"labels":[],"label_agreement":null},{"id":"W3024132172","doi":"10.1016/j.ejor.2020.03.082","title":"Incorporating patient preferences in the design and operation of cancer screening facility networks","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Economic and Environmental Valuation","field":"Economics, Econometrics and Finance","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Psychological intervention; Computer science; Population; Queueing theory; Medicine; Nursing; Environmental health","score_opus":0.42203619982616064,"score_gpt":0.3186894712101401,"score_spread":0.10334672861602057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024132172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.936145,0.0012684339,0.059564237,0.0019655677,0.000027646445,0.00017004885,0.0000132712075,8.05707e-7,0.000844959],"genre_scores_gemma":[0.9967983,0.00025518166,0.002682331,0.00017468727,0.000071553244,0.0000034209077,0.000004812158,0.000004000784,0.000005715822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9985955,0.00051209226,0.0005853576,0.00011701317,0.00010420159,0.00008585367],"domain_scores_gemma":[0.9994873,0.00015152154,0.00021621048,0.00004965019,0.000053846157,0.000041502382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005108168,0.000048466587,0.00012405263,0.00006921965,0.00009777017,0.00007302406,0.00015145827,0.000013246933,0.00013115624],"category_scores_gemma":[0.00022680973,0.00003881113,0.000021989239,0.00010385113,0.00007335087,0.00027139176,0.000047728587,0.00024215473,0.000011552835],"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.000095663294,0.000052323157,0.33873734,0.000011849894,0.00002742152,0.0000066589078,0.0050526503,0.63475406,0.00023768129,0.0042298804,0.00040048998,0.016393943],"study_design_scores_gemma":[0.00069967576,0.0007561395,0.75999486,0.000041483498,0.0000027969197,0.0000048153815,0.0015910183,0.23530416,0.00016837262,0.00067142525,0.0006615853,0.000103668586],"about_ca_topic_score_codex":0.00003443591,"about_ca_topic_score_gemma":0.000004607765,"teacher_disagreement_score":0.4212575,"about_ca_system_score_codex":0.000033241897,"about_ca_system_score_gemma":0.000029008821,"threshold_uncertainty_score":0.17703992},"labels":[],"label_agreement":null},{"id":"W3027262244","doi":"10.1016/j.ejor.2020.05.005","title":"Alternating Lagrangian decomposition for integrated airline crew scheduling problem","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Crew; Crew scheduling; Column generation; Computer science; Scheduling (production processes); Mathematical optimization; Set (abstract data type); Constraint programming; Operations research; Decomposition; Context (archaeology); Assignment problem; Engineering; Mathematics; Aeronautics","score_opus":0.0954391724302661,"score_gpt":0.38727626805254606,"score_spread":0.29183709562227994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027262244","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.07759463,0.00021432119,0.9158135,0.0029302072,0.00011392122,0.0002258072,0.000011528221,0.000059327762,0.003036726],"genre_scores_gemma":[0.52091295,0.00002696556,0.47824258,0.0001065271,0.00061535236,0.0000021648261,0.000019210962,0.000043310432,0.000030932497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789727,0.0006580175,0.00057061506,0.00012442052,0.0005179717,0.00023169818],"domain_scores_gemma":[0.9980048,0.00032994666,0.00007672306,0.00006704023,0.0013276964,0.00019377594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045653395,0.00010283051,0.00015440585,0.00018488854,0.00019004432,0.00020819152,0.00029503717,0.000022259568,0.00008208281],"category_scores_gemma":[0.001177812,0.00009433995,0.0000760638,0.0003873623,0.000031428917,0.0002911851,0.000039106446,0.0005654825,0.000030386575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006515261,0.000017110693,0.00008202335,0.00005671351,0.000047522197,0.000027027301,0.00051438034,0.9366309,0.050236683,0.00055058557,0.001076801,0.010695108],"study_design_scores_gemma":[0.0009426834,0.00032121426,0.00024111698,0.00015701633,0.000008320714,0.00003961738,0.00016417696,0.9844311,0.007981021,0.00004476554,0.005550815,0.000118147735],"about_ca_topic_score_codex":8.227229e-7,"about_ca_topic_score_gemma":3.625248e-7,"teacher_disagreement_score":0.4433183,"about_ca_system_score_codex":0.00008412829,"about_ca_system_score_gemma":0.000102026424,"threshold_uncertainty_score":0.38470715},"labels":[],"label_agreement":null},{"id":"W3027680723","doi":"10.1016/j.ejor.2020.05.014","title":"Manufacturer vs. Consumer Subsidy with Green Technology Investment and Environmental Concern","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":250,"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":"Youth Innovation Promotion Association of the Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Subsidy; Production (economics); Incentive; Profit (economics); Consumption (sociology); Economics; Business; Welfare; Investment (military); Microeconomics; Industrial organization; Market economy","score_opus":0.04526066025482519,"score_gpt":0.2637256614478679,"score_spread":0.2184650011930427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3027680723","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9097943,0.00064598786,0.0006009793,0.07072647,0.00006500725,0.00054207037,0.0000051017123,0.000029692734,0.017590396],"genre_scores_gemma":[0.99212414,0.000040028626,0.000471417,0.006137258,0.00064146565,0.0000035549142,0.000012897881,0.000032917073,0.00053634716],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982754,0.00011790192,0.00029350934,0.00021583456,0.0008254237,0.00027195262],"domain_scores_gemma":[0.999406,0.000048668837,0.00012927224,0.000116926385,0.0002447027,0.00005442557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001305782,0.00013192999,0.00015814745,0.00040054077,0.00023137842,0.00030091565,0.00034487236,0.000019859983,0.0005909949],"category_scores_gemma":[0.00014674147,0.00009910388,0.000027024691,0.0003063981,0.00035341916,0.00060093304,0.0004057497,0.00043837389,0.00020238051],"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.005580215,0.0010667822,0.4166514,0.0012323406,0.0019267157,0.0223038,0.00412455,0.006605772,0.014333895,0.16690078,0.30068547,0.058588296],"study_design_scores_gemma":[0.0027866622,0.0005074914,0.029505366,0.0000573553,0.000046075438,0.0000820642,0.005189522,0.0016467277,0.00035636924,0.0007107801,0.95882916,0.00028241688],"about_ca_topic_score_codex":0.000018555142,"about_ca_topic_score_gemma":0.00000306998,"teacher_disagreement_score":0.6581437,"about_ca_system_score_codex":0.00006772609,"about_ca_system_score_gemma":0.000056324494,"threshold_uncertainty_score":0.647098},"labels":[],"label_agreement":null},{"id":"W3028362015","doi":"10.1016/j.ejor.2020.05.013","title":"The newsvendor problem: The role of prospect theory and feedback","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of Manitoba; Sheridan College","funders":"","keywords":"Newsvendor model; Economics; Prospect theory; Heuristic; Frame (networking); Economic order quantity; Order (exchange); Microeconomics; Computer science; Business; Supply chain; Marketing","score_opus":0.05146047883690669,"score_gpt":0.28180151968061984,"score_spread":0.23034104084371315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028362015","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.23254737,0.005929991,0.00071599806,0.13604468,0.00036085947,0.001516673,0.0000043865666,0.000027920178,0.6228521],"genre_scores_gemma":[0.9959981,0.00009161888,0.00011967049,0.0011746737,0.0014817155,0.0000029623966,0.0000013258309,0.000017127195,0.0011127992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982767,0.00039398443,0.00033825322,0.00010159561,0.0007214112,0.00016803485],"domain_scores_gemma":[0.99889284,0.00026315203,0.00015339044,0.00010919411,0.0005576383,0.000023777351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077168983,0.00007114221,0.00009099369,0.00007583113,0.0004611889,0.00048037726,0.0005193201,0.0000068693444,0.00022213564],"category_scores_gemma":[0.00079443754,0.00003596936,0.000052640622,0.000277641,0.00023373625,0.00039345663,0.00031552417,0.00030587436,0.000094490395],"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.0005027791,0.00005951674,0.0026360091,0.000060895578,0.00009676863,0.000029741368,0.0008934572,0.0002239212,0.0027557646,0.91601837,0.048737723,0.02798508],"study_design_scores_gemma":[0.0006038286,0.00014128622,0.007953321,0.000047697493,0.000016148102,0.000007215327,0.004410558,0.0012123396,0.0002409222,0.015422961,0.9698696,0.00007413787],"about_ca_topic_score_codex":0.0000061330143,"about_ca_topic_score_gemma":0.0000020627604,"teacher_disagreement_score":0.92113185,"about_ca_system_score_codex":0.0000122731235,"about_ca_system_score_gemma":0.000045963207,"threshold_uncertainty_score":0.4632289},"labels":[],"label_agreement":null},{"id":"W3028532936","doi":"10.1016/j.ejor.2020.05.010","title":"Data-driven optimization model customization","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Université de Montréal","funders":"","keywords":"Computer science; Personalization; Software; Cloud computing; Software as a service; Industrial engineering; Software engineering; Operations research; Software development","score_opus":0.2302421959424558,"score_gpt":0.35944957438263136,"score_spread":0.12920737844017557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028532936","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.07253729,0.00027937663,0.77356553,0.03379906,0.00043455808,0.00051226816,0.000039836148,0.00007873957,0.118753344],"genre_scores_gemma":[0.98674667,0.00003848538,0.009862332,0.0012633255,0.0017600101,5.8461586e-7,0.00012417861,0.000031661177,0.00017273311],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998361,0.00016275782,0.00038414123,0.00016876738,0.00077003846,0.00015328237],"domain_scores_gemma":[0.99836046,0.0000655114,0.00014502907,0.00016343265,0.001229282,0.000036294055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028627466,0.000077050165,0.00010985926,0.00023980817,0.0002456236,0.00053271174,0.0006583853,0.000013460529,0.0005600792],"category_scores_gemma":[0.0011091458,0.00006755489,0.000034174744,0.0004732206,0.000042964017,0.0020353438,0.0004125481,0.00033937665,0.00018444183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013246732,0.000039385515,0.001771155,0.000023520684,0.000015895717,0.000056504166,0.00008650062,0.9409117,0.0007679604,0.0007777802,0.050170958,0.005246144],"study_design_scores_gemma":[0.0004446621,0.000017101267,0.0011985592,0.000022578037,0.000018602399,0.0000051182737,0.00005666573,0.966676,0.0000047863277,0.000011684518,0.031470113,0.00007413701],"about_ca_topic_score_codex":0.0000045327993,"about_ca_topic_score_gemma":0.0000016844785,"teacher_disagreement_score":0.9142094,"about_ca_system_score_codex":0.00001786694,"about_ca_system_score_gemma":0.00012443487,"threshold_uncertainty_score":0.61324745},"labels":[],"label_agreement":null},{"id":"W3029602321","doi":"10.1016/j.ejor.2020.05.015","title":"Balancing Fairness and Efficiency: Performance Evaluation with Disadvantaged Units in Non-homogeneous Environments","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmarking; Data envelopment analysis; Allowance (engineering); Computer science; Disadvantaged; Set (abstract data type); Operations research; Fairness measure; Performance measurement; Homogeneous; Field (mathematics); Environmental economics; Management science; Economics; Operations management; Business; Mathematical optimization; Mathematics; Marketing","score_opus":0.15876672152104548,"score_gpt":0.4085629980624624,"score_spread":0.2497962765414169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029602321","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98745185,0.00016011024,0.009138738,0.0016367234,0.000036648195,0.00015762176,0.0000021013655,0.0000018068449,0.001414404],"genre_scores_gemma":[0.9990551,0.000039810788,0.00055124663,0.00012292263,0.00010699239,0.000001260071,0.0000024565643,0.000013463433,0.00010677109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9910806,0.0024974132,0.00076533394,0.00034324784,0.00505349,0.00025991732],"domain_scores_gemma":[0.9974686,0.0008211024,0.00021218963,0.00019434144,0.0011052428,0.00019851104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026373258,0.00010919873,0.00022178389,0.00048462124,0.00032948074,0.000337535,0.0006686567,0.000016435351,0.00013348127],"category_scores_gemma":[0.005974597,0.000072483126,0.000028071032,0.0018817644,0.00023241156,0.00054936146,0.00015728259,0.0005067749,0.00010615554],"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.0007334857,0.00025139528,0.18473099,0.000014202571,0.000046031586,0.00070086325,0.010198576,0.6629088,0.048558194,0.00014875055,0.0005105732,0.09119815],"study_design_scores_gemma":[0.0018488077,0.0012962293,0.51457286,0.00011953283,0.000017071094,0.00013489273,0.0017489485,0.47658968,0.0023180165,0.00003425542,0.0011305525,0.0001891625],"about_ca_topic_score_codex":0.00000204522,"about_ca_topic_score_gemma":0.00000460482,"teacher_disagreement_score":0.32984185,"about_ca_system_score_codex":0.00010032868,"about_ca_system_score_gemma":0.00038290335,"threshold_uncertainty_score":0.91404974},"labels":[],"label_agreement":null},{"id":"W3033378018","doi":"10.1016/j.ejor.2020.04.053","title":"The Pallet Loading Problem: Three-dimensional bin packing with practical constraints","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":81,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pallet; Computer science; Bin; Mathematical optimization; Bin packing problem; Generator (circuit theory); Load bearing; Representation (politics); Algorithm; Structural engineering; Mathematics; Power (physics); Engineering","score_opus":0.10714454501389158,"score_gpt":0.328749102098871,"score_spread":0.2216045570849794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033378018","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.12384158,0.00246599,0.47105476,0.18696126,0.0012211481,0.0021196478,0.000050578226,0.0004004718,0.21188457],"genre_scores_gemma":[0.97764105,0.00006346688,0.021552382,0.00023928496,0.00037544893,0.0000017060514,0.0000045199295,0.000043078067,0.000079055106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779356,0.00045765823,0.0004015798,0.00011335397,0.0009642669,0.0002695607],"domain_scores_gemma":[0.9983539,0.00051834004,0.00006587343,0.00008540154,0.0007488225,0.00022765079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030180651,0.0001044124,0.00011640559,0.00007865837,0.00038856236,0.00037571887,0.0002273413,0.000018789824,0.0002670678],"category_scores_gemma":[0.0005250129,0.00006505185,0.000040137587,0.00029837398,0.00022335057,0.00025156676,0.000052778618,0.0008678482,0.00012897336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003597569,0.00006623549,0.00129102,0.00006384009,0.00030715865,0.00095683,0.0012029504,0.90115404,0.009241813,0.016777676,0.058758568,0.009820108],"study_design_scores_gemma":[0.006306277,0.0032303664,0.004959599,0.0011497309,0.00005942401,0.0030084974,0.0010393779,0.67863464,0.0037640233,0.0006104699,0.29617184,0.0010657189],"about_ca_topic_score_codex":4.7417376e-7,"about_ca_topic_score_gemma":0.0000032040427,"teacher_disagreement_score":0.85379946,"about_ca_system_score_codex":0.000041909243,"about_ca_system_score_gemma":0.00025141836,"threshold_uncertainty_score":0.3770417},"labels":[],"label_agreement":null},{"id":"W3033405475","doi":"10.1016/j.ejor.2020.05.054","title":"The two-echelon production-routing problem","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Université Laval; Transport Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Mathematical optimization; Routing (electronic design automation); Production (economics); Supply chain; Vendor-managed inventory; Vendor; Supply chain management; Mathematics; Economics","score_opus":0.11010586751565572,"score_gpt":0.367330615983832,"score_spread":0.2572247484681763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033405475","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.2291215,0.0029651206,0.46667615,0.112398386,0.0022868807,0.0013756513,0.000009469596,0.00045357196,0.18471327],"genre_scores_gemma":[0.9270167,0.00013126478,0.07069111,0.000095082585,0.0016217565,0.0000018131549,0.0000015033952,0.00005059395,0.00039019133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970115,0.0013394915,0.0004932587,0.000112981696,0.00079769985,0.00024506715],"domain_scores_gemma":[0.99835247,0.00035879997,0.00006382565,0.00011521028,0.00095988874,0.00014983551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009273195,0.00008234416,0.00009784918,0.00007572394,0.00047460973,0.00027414173,0.0003973169,0.000011818759,0.000047894617],"category_scores_gemma":[0.0028304935,0.000059006157,0.000047827474,0.00048302775,0.00007794362,0.00023597758,0.00007083982,0.00080005894,0.000102283266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003900037,0.000012990426,0.00027876877,0.000020075213,0.000052247324,0.000041273863,0.0013553977,0.9328586,0.023620492,0.0023172686,0.014094924,0.025308982],"study_design_scores_gemma":[0.00192608,0.0006922957,0.0049296776,0.0002678526,0.000024056248,0.00043090634,0.0016420839,0.7785994,0.025787625,0.00036266702,0.18481171,0.0005256629],"about_ca_topic_score_codex":4.5386986e-7,"about_ca_topic_score_gemma":3.3845077e-7,"teacher_disagreement_score":0.69789517,"about_ca_system_score_codex":0.000067833214,"about_ca_system_score_gemma":0.00012202553,"threshold_uncertainty_score":0.36503625},"labels":[],"label_agreement":null},{"id":"W3034082077","doi":"10.1016/j.ejor.2024.10.001","title":"Generalized likelihood ratio method for stochastic models with uniform random numbers as inputs","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Statistical Methods and Inference","field":"Mathematics","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":"Université de Montréal; Computer Research Institute of Montréal","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Estimator; Mathematics; Applied mathematics; Quantile; Random variable; Markov chain; Copula (linguistics); Mathematical optimization; Statistics; Econometrics","score_opus":0.1975599517841269,"score_gpt":0.47359019436937305,"score_spread":0.2760302425852461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034082077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028511307,0.00016495657,0.9858027,0.0017853474,0.00014689198,0.00041302838,0.000038692713,0.000016379932,0.008780853],"genre_scores_gemma":[0.1158697,0.000025849811,0.881938,0.0001452285,0.0005144326,0.00001907067,0.0000064767037,0.000059014783,0.0014222295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959741,0.0016877785,0.0006414141,0.00022305011,0.0011349081,0.00033874807],"domain_scores_gemma":[0.99180484,0.005997388,0.0000903211,0.0001586718,0.0017084387,0.00024033597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012287746,0.0001514748,0.00031053714,0.00026408385,0.00023288012,0.00043452848,0.00031458505,0.000028394263,0.00033930858],"category_scores_gemma":[0.0049839956,0.00009772484,0.00011015591,0.00031756764,0.00010347851,0.00031144352,0.000059423357,0.00057970465,0.000042732492],"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.0010651228,0.00008144695,7.020436e-7,0.00010154477,0.00018432889,0.0001731736,0.00085239083,0.0058843708,0.0018524006,0.9684678,0.007991343,0.013345425],"study_design_scores_gemma":[0.003342007,0.0015875382,0.000009903783,0.0004759771,0.000071637674,0.0004039995,0.0001818887,0.372357,0.0008578412,0.61793435,0.0025710512,0.00020678728],"about_ca_topic_score_codex":0.0000060540697,"about_ca_topic_score_gemma":0.0000030125786,"teacher_disagreement_score":0.36647266,"about_ca_system_score_codex":0.000090576585,"about_ca_system_score_gemma":0.00084176287,"threshold_uncertainty_score":0.5966668},"labels":[],"label_agreement":null},{"id":"W3036118533","doi":"10.1016/j.ejor.2020.06.017","title":"Optimal government scrappage subsidies in the presence of strategic consumers","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Energy, Environment, and Transportation Policies","field":"Energy","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subsidy; Government (linguistics); Period (music); Economics; Public economics; Business; Market economy","score_opus":0.13133310688682642,"score_gpt":0.3279483175123282,"score_spread":0.1966152106255018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036118533","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95295626,0.00038601275,0.00015012751,0.004666929,0.000029426557,0.00007647846,0.00001551162,0.000002279692,0.04171698],"genre_scores_gemma":[0.9985082,0.00045064927,0.00047499358,0.00024785314,0.00010430962,0.0000018083746,0.0000045618026,0.00001211914,0.00019547176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99685717,0.0010029977,0.00046654243,0.00010664106,0.0013915264,0.00017514138],"domain_scores_gemma":[0.99924946,0.00031743516,0.0001119443,0.00010390982,0.00013007424,0.00008718913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021474333,0.000078616664,0.0001255871,0.000056795816,0.000094752235,0.00005564675,0.00042695834,0.000012805191,0.00032185356],"category_scores_gemma":[0.00020865968,0.000054073964,0.00005927035,0.0002148929,0.0002631012,0.00016657654,0.00002762033,0.0003592902,0.000026726511],"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.00077703747,0.00047293474,0.011146958,0.00008149552,0.00020277953,0.0009739107,0.020591604,0.59802186,0.06314651,0.30023363,0.0032723134,0.0010789731],"study_design_scores_gemma":[0.007946057,0.0046824636,0.7287642,0.00038547162,0.00008098291,0.00014827737,0.086156204,0.007874952,0.04615553,0.0012687078,0.115750015,0.00078717456],"about_ca_topic_score_codex":0.000051450937,"about_ca_topic_score_gemma":0.00003927513,"teacher_disagreement_score":0.7176172,"about_ca_system_score_codex":0.000029374278,"about_ca_system_score_gemma":0.0000923274,"threshold_uncertainty_score":0.35240707},"labels":[],"label_agreement":null},{"id":"W3039073724","doi":"10.1016/j.ejor.2020.06.021","title":"The impact of product recall on advertising decisions and firm profit while envisioning crisis or being hazard myopic","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Digital Marketing and Social Media","field":"Social Sciences","cited_by":35,"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","keywords":"Profit (economics); Moral hazard; Business; Advertising; Recall; Product (mathematics); Hazard; Marketing; Economics; Microeconomics; Psychology; Mathematics; Incentive","score_opus":0.15157989913110395,"score_gpt":0.4289525421604629,"score_spread":0.27737264302935893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039073724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93560576,0.00030297786,0.00004277398,0.018503077,0.00010845008,0.00018015313,0.0000041265253,0.000006616478,0.045246076],"genre_scores_gemma":[0.9977911,0.00050945923,0.00038627503,0.00007928626,0.00070890906,9.1421754e-7,7.6223745e-7,0.0000137104835,0.00050954847],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9959594,0.0018836755,0.0004138044,0.00015305652,0.0013221741,0.00026786528],"domain_scores_gemma":[0.99576724,0.0028423003,0.0001255799,0.00008914013,0.000893644,0.00028212016],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.009104242,0.00007473459,0.00015066912,0.00009089855,0.0013121268,0.00044717145,0.00037441816,0.000017780229,0.00007349128],"category_scores_gemma":[0.027825845,0.0000432042,0.00008794977,0.00041722337,0.00029132018,0.0003004781,0.00010831018,0.000471537,0.000015416887],"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.004299198,0.00030190972,0.030099167,0.000046191144,0.00037890594,0.0005177567,0.12902968,0.0016935003,0.0048757866,0.019776242,0.13047738,0.6785043],"study_design_scores_gemma":[0.0042816885,0.014791448,0.70020473,0.0038677384,0.00007061188,0.00007936896,0.07387341,0.0016311961,0.0017366176,0.0039866045,0.1944055,0.0010710628],"about_ca_topic_score_codex":0.000035878245,"about_ca_topic_score_gemma":0.000014895893,"teacher_disagreement_score":0.67743325,"about_ca_system_score_codex":0.00008590519,"about_ca_system_score_gemma":0.0007506158,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W3041106420","doi":"10.1016/j.ejor.2020.07.002","title":"Option pricing with conditional GARCH models","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","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":"Western University","funders":"","keywords":"Autoregressive conditional heteroskedasticity; Valuation of options; Econometrics; Conditional variance; Stochastic discount factor; Flexibility (engineering); Variance (accounting); Moment (physics); Class (philosophy); Computer science; Economics; Mathematical optimization; Mathematics; Capital asset pricing model","score_opus":0.2655253926555582,"score_gpt":0.3210391489940542,"score_spread":0.055513756338496034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041106420","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.202135,0.0007112828,0.77146095,0.0062490064,0.000057310357,0.00012889349,0.00004045346,0.00000788044,0.019209243],"genre_scores_gemma":[0.9924084,0.00009708297,0.0064545916,0.00028470327,0.00055108825,0.0000013158565,0.000013837072,0.000021645717,0.00016735423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984911,0.0001682814,0.0006361898,0.00020273888,0.00028862766,0.00021307722],"domain_scores_gemma":[0.9988545,0.00009896253,0.00017462319,0.000087910455,0.0006170322,0.00016697968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034209944,0.00008168612,0.00019914989,0.0002191009,0.00024001529,0.00014616703,0.00026308047,0.000019717205,0.00014534754],"category_scores_gemma":[0.0004266788,0.00007531225,0.000064077634,0.00029692723,0.00008385673,0.00061090395,0.000057458088,0.000548657,0.00026500976],"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.00035380566,0.00008976459,0.0029133363,0.000024494304,0.000047473844,0.000102901584,0.0017930052,0.18257718,0.0004112504,0.80929065,0.0013580851,0.0010380315],"study_design_scores_gemma":[0.0024596883,0.002073926,0.026876919,0.000116818504,0.000006268165,0.000099285804,0.00036886547,0.823708,0.00024102104,0.10807951,0.035602406,0.00036729738],"about_ca_topic_score_codex":0.000008170185,"about_ca_topic_score_gemma":8.607623e-7,"teacher_disagreement_score":0.79027337,"about_ca_system_score_codex":0.000072824616,"about_ca_system_score_gemma":0.00014883954,"threshold_uncertainty_score":0.3406253},"labels":[],"label_agreement":null},{"id":"W3044436207","doi":"10.1016/j.ejor.2020.07.028","title":"Indifference pricing of insurance-linked securities in a multi-period model","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","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":"Université de Lausanne; Australian Research Council; University of New South Wales; Australian Government; Universität Ulm; University of Waterloo; Society of Actuaries","keywords":"Economics; Reinsurance; Actuarial science; Payment; Interim; Financial market; Finance","score_opus":0.20840313955155118,"score_gpt":0.3234232447472296,"score_spread":0.11502010519567843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044436207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.978864,0.0012776933,0.0125215985,0.0012867571,0.000066212866,0.00014751258,0.00004622758,0.0000029806379,0.0057870043],"genre_scores_gemma":[0.99574274,0.00065266096,0.0031633014,0.000173435,0.00010918321,0.0000024261092,0.0000022446345,0.00001622243,0.00013777585],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99832296,0.00013755461,0.0009486331,0.00017189732,0.00020009224,0.00021885414],"domain_scores_gemma":[0.9992232,0.00004585886,0.0002647603,0.000100233585,0.00028833438,0.00007761084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027093885,0.0000857004,0.00030629596,0.00037767898,0.0000876473,0.00006886196,0.00039791013,0.000022455075,0.00005980214],"category_scores_gemma":[0.00060378306,0.000087409564,0.00007500078,0.0004149412,0.00009136592,0.00033253487,0.00010429162,0.0004926207,0.00007475859],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093488605,0.00094575936,0.4621773,0.0004426461,0.00014192764,0.00063695974,0.089938715,0.067194834,0.0031509036,0.36281326,0.0018884216,0.009734376],"study_design_scores_gemma":[0.002767701,0.00062423025,0.8921457,0.00022878606,0.0000018167722,0.000008369805,0.0008674125,0.09677768,0.00020677809,0.0041760746,0.0019499694,0.00024548805],"about_ca_topic_score_codex":0.000016391008,"about_ca_topic_score_gemma":0.000005012669,"teacher_disagreement_score":0.4299684,"about_ca_system_score_codex":0.00006020332,"about_ca_system_score_gemma":0.00009885199,"threshold_uncertainty_score":0.35644588},"labels":[],"label_agreement":null},{"id":"W3082029294","doi":"10.1016/j.ejor.2020.08.048","title":"Inferring linear feasible regions using inverse optimization","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","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 Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Feasible region; Set (abstract data type); Constraint (computer-aided design); Constrained optimization; Optimization problem; Function (biology); Algorithm; Mathematics","score_opus":0.23612361330620157,"score_gpt":0.39858356278024537,"score_spread":0.1624599494740438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082029294","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014404262,0.000051242645,0.9923411,0.003563334,0.00012502783,0.00012387741,0.0000015948561,0.000026497726,0.0023269146],"genre_scores_gemma":[0.10024989,0.00006501201,0.89844364,0.0005998658,0.000498825,7.3334405e-7,0.0000028895263,0.000025893389,0.000113227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714094,0.0009724917,0.00045402246,0.00024167923,0.0009508073,0.00024003218],"domain_scores_gemma":[0.996946,0.00015546978,0.00017182845,0.00018974887,0.0022306787,0.00030627864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017845556,0.00010106044,0.00014114058,0.0003154989,0.00038834527,0.00026775085,0.0007874076,0.00001961937,0.00007272626],"category_scores_gemma":[0.0016063337,0.000098417026,0.00006430124,0.00093659695,0.00008999852,0.0016436541,0.0003521738,0.000541989,0.000080270846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019220028,0.000036138626,0.000059108075,0.0000042215934,0.000014409819,0.00015110854,0.00067238923,0.99371755,0.0018262285,0.0021551622,0.00039035807,0.000954084],"study_design_scores_gemma":[0.0006576843,0.00020146546,0.0002031085,0.00003443745,0.0000025059667,0.000106893516,0.00009922151,0.9960894,0.00060352386,0.000051829018,0.0018484459,0.00010148696],"about_ca_topic_score_codex":0.0000018337855,"about_ca_topic_score_gemma":3.3091754e-7,"teacher_disagreement_score":0.098809466,"about_ca_system_score_codex":0.00013267041,"about_ca_system_score_gemma":0.0004789397,"threshold_uncertainty_score":0.401333},"labels":[],"label_agreement":null},{"id":"W3082900530","doi":"10.1016/j.ejor.2020.08.050","title":"Agency problems in public-private partnerships investment projects","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Public-Private Partnership Projects","field":"Business, Management and Accounting","cited_by":42,"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":"Agencia Estatal de Investigación; Ministerio de Economía y Competitividad","keywords":"Incentive; Investment (military); Moral hazard; Government (linguistics); Bailout; Business; Order (exchange); Finance; Compensation (psychology); Agency (philosophy); Private sector; Economics; Microeconomics; Industrial organization; Politics","score_opus":0.40046756833865094,"score_gpt":0.3557253928657119,"score_spread":0.044742175472939016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082900530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5531822,0.00029180362,0.00035906793,0.09373186,0.00027808297,0.0010460793,0.0000025360341,0.00006609365,0.3510423],"genre_scores_gemma":[0.99135005,0.000026084104,0.0006036633,0.0053965086,0.0022830912,0.000013700592,0.000018420867,0.000055996683,0.00025250693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955113,0.00074730883,0.0008978657,0.0003643997,0.0017966307,0.00068250153],"domain_scores_gemma":[0.9978446,0.00012892956,0.00031234403,0.00022123921,0.0013548405,0.00013807492],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009690037,0.00020723499,0.00026948875,0.0010450148,0.00025044454,0.0013934053,0.0011472574,0.0000371062,0.0005793348],"category_scores_gemma":[0.0047855284,0.00017350586,0.000097505945,0.0021648887,0.0001511638,0.0031468268,0.0005927388,0.0010561697,0.0010865056],"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.000526738,0.001257288,0.08265465,0.0008615811,0.00022424122,0.0024305682,0.0048073116,0.0018676776,0.026836088,0.68700683,0.18571855,0.0058084694],"study_design_scores_gemma":[0.0031948409,0.00039438705,0.05150432,0.00026120458,0.000014029967,0.000038778897,0.0006532789,0.007028476,0.00039190057,0.0030389328,0.93294996,0.0005298594],"about_ca_topic_score_codex":0.000009699603,"about_ca_topic_score_gemma":0.0000142979125,"teacher_disagreement_score":0.7472314,"about_ca_system_score_codex":0.00013221998,"about_ca_system_score_gemma":0.00046831823,"threshold_uncertainty_score":0.99969125},"labels":[],"label_agreement":null},{"id":"W3089996180","doi":"10.1016/j.ejor.2021.07.056","title":"Meta partial benders decomposition for the logistics service network design problem","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Benders' decomposition; Decomposition; Computer science; Benchmark (surveying); Mathematical optimization; Service (business); Reverse logistics; Network planning and design; Operations research; Product (mathematics); Supply chain; Engineering; Mathematics; Computer network; Economics; Business","score_opus":0.33625220473001965,"score_gpt":0.4159091840486648,"score_spread":0.07965697931864513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089996180","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021039156,0.0023656122,0.9933046,0.002339614,0.00062360946,0.0005661554,0.00001696305,0.000028243297,0.0005447715],"genre_scores_gemma":[0.10130088,0.0006444404,0.8953153,0.00019198352,0.002227313,0.00004205707,0.000075039774,0.00011323729,0.000089730245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941343,0.003545091,0.00080774666,0.00021489318,0.00092671916,0.00037126636],"domain_scores_gemma":[0.99406064,0.0024399934,0.00017174282,0.00030020176,0.002899079,0.00012832439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017751232,0.0002059221,0.00034550327,0.0001294637,0.00042178758,0.00072222995,0.0007313694,0.00007786166,0.00013665248],"category_scores_gemma":[0.0006750129,0.00015502555,0.0002246357,0.00032602603,0.00006336911,0.00013876248,0.00030448998,0.00155106,0.000008451757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052549287,0.000021688194,0.0000039388215,0.000101922866,0.0012583291,0.000033226544,0.0003104893,0.98993134,0.00030326718,0.00038751465,0.006430589,0.0011651164],"study_design_scores_gemma":[0.00034337642,0.00009891491,0.00009762004,0.00015136534,0.00042170857,0.000055707893,0.000102777005,0.994884,0.000461235,0.00037720968,0.0028361941,0.00016986897],"about_ca_topic_score_codex":0.0000026922698,"about_ca_topic_score_gemma":0.000002906117,"teacher_disagreement_score":0.10109049,"about_ca_system_score_codex":0.00015802801,"about_ca_system_score_gemma":0.00051397464,"threshold_uncertainty_score":0.69644797},"labels":[],"label_agreement":null},{"id":"W3092722947","doi":"10.1016/j.ejor.2020.09.054","title":"Integrated planning for electric commercial vehicle fleets: A case study for retail mid-haul logistics networks","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":66,"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":"Electrification; Software deployment; Time horizon; Computer science; Operations research; Vehicle routing problem; Routing (electronic design automation); Investment (military); Electric vehicle; Operational costs; Network planning and design; Business; Transport engineering; Electricity; Telecommunications; Engineering","score_opus":0.1289883712413711,"score_gpt":0.34931418263746133,"score_spread":0.22032581139609023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092722947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72001773,0.00095798937,0.27604613,0.0013217957,0.00022741339,0.0008837767,0.00003205257,0.000044957582,0.00046816806],"genre_scores_gemma":[0.9956255,0.0000236598,0.0026103563,0.00017714073,0.0014356754,0.000008966695,0.000015354732,0.000058082147,0.000045272413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982001,0.00034500222,0.00053458265,0.00014750796,0.00039624967,0.00037655214],"domain_scores_gemma":[0.99810696,0.00049339863,0.000064244276,0.00008869736,0.0010387043,0.00020800378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020116144,0.0001400896,0.00022766281,0.00015598309,0.00033324046,0.00020302135,0.00031388068,0.00003851468,0.000033756554],"category_scores_gemma":[0.00082828326,0.00010694206,0.00008683593,0.00051814865,0.000029285311,0.00015869089,0.000036161273,0.00091976824,0.0000036341776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009983112,0.0001397603,0.0013128886,0.00006830881,0.00032543569,0.0034972948,0.0024744107,0.8296175,0.00966196,0.00016978497,0.0958866,0.05584774],"study_design_scores_gemma":[0.0024891412,0.0041544614,0.00086773315,0.000036674945,0.00003639209,0.0006924049,0.0014073016,0.970283,0.0006182356,0.000038943188,0.019179251,0.00019647954],"about_ca_topic_score_codex":0.0000045996703,"about_ca_topic_score_gemma":0.0000030956796,"teacher_disagreement_score":0.27560776,"about_ca_system_score_codex":0.00010192212,"about_ca_system_score_gemma":0.0001435588,"threshold_uncertainty_score":0.4360971},"labels":[],"label_agreement":null},{"id":"W3093094698","doi":"10.1016/j.ejor.2023.02.014","title":"Portfolio selection: A target-distribution approach","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"HEC Montréal","funders":"Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Efficient frontier; Portfolio; Portfolio optimization; Variance (accounting); Selection (genetic algorithm); Econometrics; Computer science; Modern portfolio theory; Asset (computer security); Gaussian; Rate of return on a portfolio; Post-modern portfolio theory; Mathematical optimization; Investment strategy; Mathematics; Economics; Replicating portfolio; Finance; Market liquidity; Artificial intelligence","score_opus":0.2537355990549406,"score_gpt":0.4552823099094369,"score_spread":0.20154671085449632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093094698","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.29721174,0.0005468516,0.3971454,0.008287747,0.0015345899,0.0006390996,0.000096648495,0.00012037428,0.29441756],"genre_scores_gemma":[0.9770197,0.00034423292,0.0062121176,0.00006732229,0.001181596,0.0000028591817,0.00010700067,0.000022644563,0.015042523],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99174696,0.002439238,0.0010256137,0.00027464685,0.0041744607,0.00033906655],"domain_scores_gemma":[0.9941558,0.0005802707,0.0002664996,0.00021509809,0.0045533283,0.00022895238],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.03481383,0.00010009669,0.00019437748,0.00094884925,0.0005800039,0.0006541599,0.00074034993,0.000032968826,0.00094340387],"category_scores_gemma":[0.0059729395,0.000072155206,0.00013195841,0.0041148732,0.00012165454,0.00072173035,0.0001309419,0.00054853305,0.0017134472],"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.00014569839,0.0001224138,0.006952591,0.0000020771545,0.000033708686,0.00019772236,0.00038639578,0.123917036,0.0007036735,0.009781532,0.83994585,0.017811324],"study_design_scores_gemma":[0.00088694546,0.0005673655,0.11254235,0.000019958312,0.000007114236,0.0005560781,0.0009375247,0.083457634,0.0005269241,0.004657279,0.7956371,0.00020373976],"about_ca_topic_score_codex":0.0000027377362,"about_ca_topic_score_gemma":3.563433e-7,"teacher_disagreement_score":0.67980796,"about_ca_system_score_codex":0.00008353492,"about_ca_system_score_gemma":0.00052191835,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W3099841648","doi":"10.1016/j.ejor.2020.10.031","title":"The direct and cross effects in a supply chain with consumers sensitive to both carbon emissions and delivery time","year":2020,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Supply chain; Greenhouse gas; Carbon fibers; Business; Supply chain management; Environmental science; Environmental economics; Computer science; Economics; Marketing","score_opus":0.021336541026982507,"score_gpt":0.27312301580797227,"score_spread":0.25178647478098976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099841648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737266,0.00020807021,0.000047102403,0.015902888,0.000024926765,0.00042808434,0.0000012109373,0.0000072398243,0.009653926],"genre_scores_gemma":[0.99772656,0.00003985082,0.00016458062,0.0012045242,0.0002741346,0.0000039738907,0.0000018545355,0.000022775112,0.000561755],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9983839,0.0003496509,0.00022442194,0.00018845807,0.0005804211,0.00027314344],"domain_scores_gemma":[0.9986842,0.00056418066,0.00006473405,0.000075856544,0.0005386868,0.000072310024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035358341,0.00010437112,0.000138656,0.00025571298,0.0003634947,0.0007239679,0.00016989016,0.000010501509,0.0000146592665],"category_scores_gemma":[0.0014425571,0.00006846032,0.000017377886,0.0004765012,0.00016721347,0.00032728922,0.00033207983,0.00029568523,0.000017920594],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022581635,0.00074195844,0.5592391,0.002487112,0.0016000961,0.04778833,0.023560423,0.04328692,0.05701178,0.026772834,0.10650866,0.10842114],"study_design_scores_gemma":[0.0072839744,0.0012437919,0.780705,0.0009699767,0.000071281196,0.00009882284,0.010491331,0.063161016,0.0005370569,0.00016131563,0.13453315,0.0007432766],"about_ca_topic_score_codex":0.00007244596,"about_ca_topic_score_gemma":0.000016770298,"teacher_disagreement_score":0.22146589,"about_ca_system_score_codex":0.0000499488,"about_ca_system_score_gemma":0.000087376415,"threshold_uncertainty_score":0.69812393},"labels":[],"label_agreement":null},{"id":"W3123342669","doi":"10.1016/j.ejor.2006.09.002","title":"Calculating risk neutral probabilities and optimal portfolio policies in a dynamic investment model with downside risk control","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","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 British Columbia; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nanyang Technological University","keywords":"Downside risk; Portfolio; Economics; Investment (military); Control (management); Portfolio optimization; Econometrics; Computer science; Financial economics","score_opus":0.03392933721540386,"score_gpt":0.27303142841693795,"score_spread":0.23910209120153408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123342669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77554387,0.00085364055,0.21832882,0.0005735248,0.000011931789,0.0002059263,0.000112547124,0.0000037721622,0.004365965],"genre_scores_gemma":[0.9870244,0.00009459024,0.012539617,0.00006155993,0.00010206156,0.000014523956,0.0000044710487,0.000017508186,0.00014123751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9986737,0.00006923998,0.0006794587,0.00019712673,0.00012513454,0.0002553664],"domain_scores_gemma":[0.999118,0.00013723814,0.00030758453,0.00010677678,0.00025206388,0.000078368794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025156126,0.00009951775,0.00022531235,0.00033492033,0.00024562702,0.00014454046,0.00015148513,0.000020646925,0.000009525513],"category_scores_gemma":[0.00032994532,0.00008675155,0.00004009546,0.00024911866,0.00018212732,0.0002284106,0.000041738615,0.0004223889,0.00000953905],"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.00010305121,0.00011272231,0.027774107,0.000011665181,0.000022681277,0.000019620195,0.0005058982,0.338054,0.000042765172,0.633026,0.000075477066,0.00025198853],"study_design_scores_gemma":[0.0021260448,0.0005126926,0.44586152,0.000056267345,0.000009827191,0.000075924414,0.00024698066,0.38546428,0.00001182954,0.16504441,0.0003794306,0.0002107753],"about_ca_topic_score_codex":0.0005653717,"about_ca_topic_score_gemma":0.00012555117,"teacher_disagreement_score":0.4679816,"about_ca_system_score_codex":0.000111032576,"about_ca_system_score_gemma":0.00014833637,"threshold_uncertainty_score":0.35376254},"labels":[],"label_agreement":null},{"id":"W3124952293","doi":"10.1016/j.ejor.2011.05.034","title":"Do investors like to diversify? A study of Markowitz preferences","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":67,"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":"Agencia Nacional de Investigación e Innovación","keywords":"Diversification (marketing strategy); Economics; Financial economics; Asset allocation; Business; Microeconomics; Portfolio; Marketing","score_opus":0.2966131045794073,"score_gpt":0.31962460885901983,"score_spread":0.023011504279612516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124952293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83591115,0.00026476907,0.00004508695,0.00012768076,0.00019817364,0.00016511438,0.000012622782,0.000002090575,0.1632733],"genre_scores_gemma":[0.9978392,0.000087162516,0.001015443,0.00007651932,0.00011521271,0.0000024505566,7.8989126e-7,0.000012164494,0.00085105665],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99833745,0.00036093418,0.0007025609,0.00018069959,0.00023010607,0.00018823797],"domain_scores_gemma":[0.9989829,0.00007769199,0.00022888868,0.0001653336,0.0004077782,0.00013737242],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051069427,0.00008540814,0.00023301398,0.0005463733,0.00017054036,0.000090946356,0.00050329266,0.000016079335,0.0010285056],"category_scores_gemma":[0.0005423063,0.00007535136,0.00005676463,0.00034554512,0.00009577789,0.00037876438,0.00015042286,0.00029442337,0.00019649268],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012427202,0.0032234406,0.44977146,0.00006145864,0.0003792531,0.0002640971,0.05258376,0.00020039918,0.0003392828,0.43697992,0.0511297,0.0038245],"study_design_scores_gemma":[0.00084375264,0.005263851,0.96457124,0.00005081226,0.0000042484144,0.000006661354,0.004454207,0.000014044977,0.000051181905,0.006329134,0.01826534,0.00014554628],"about_ca_topic_score_codex":0.0001103141,"about_ca_topic_score_gemma":0.00001324213,"teacher_disagreement_score":0.5147998,"about_ca_system_score_codex":0.000044446802,"about_ca_system_score_gemma":0.00009151468,"threshold_uncertainty_score":0.99988467},"labels":[],"label_agreement":null},{"id":"W3125692962","doi":"10.1016/j.ejor.2012.02.017","title":"Highway toll pricing","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"University of Windsor","funders":"National Social Science Fund of China; Social Sciences and Humanities Research Council of Canada; Rice University; National Science Foundation","keywords":"Toll; Road pricing; Business; Computer science; Operations research; Transport engineering; Mathematics; Traffic congestion; Engineering","score_opus":0.12980381512609354,"score_gpt":0.4124041660984312,"score_spread":0.2826003509723377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125692962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4884726,0.0009700823,0.018655153,0.009002679,0.0011749886,0.00020288742,0.0000059466374,0.00003688755,0.48147875],"genre_scores_gemma":[0.9907942,0.000081896236,0.0046871062,0.00008265862,0.0012159687,3.742819e-7,0.0000049127657,0.000008540291,0.003124366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971541,0.0012969003,0.00025429597,0.00005041346,0.0010033742,0.0002408805],"domain_scores_gemma":[0.9983988,0.0002349007,0.000071099224,0.000046156278,0.0010574564,0.00019161568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010207753,0.00003737281,0.00006129754,0.00017692182,0.00058933016,0.00011541982,0.00018240347,0.00001451133,0.0004242226],"category_scores_gemma":[0.0009308275,0.000031790685,0.000029293178,0.0003325284,0.0001007783,0.0005988255,0.000008841018,0.00026101808,0.00013713431],"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.0003117938,0.0006964781,0.16646747,0.000029381763,0.00012927862,0.0002383873,0.17497928,0.026469052,0.0045821285,0.4476791,0.15071803,0.027699592],"study_design_scores_gemma":[0.0005826954,0.00016264168,0.23351105,0.00008028309,0.000008768211,0.00001951522,0.0054227645,0.00011626385,0.00031444285,0.000087717235,0.75955755,0.00013632166],"about_ca_topic_score_codex":0.000020539928,"about_ca_topic_score_gemma":0.0000069245284,"teacher_disagreement_score":0.6088395,"about_ca_system_score_codex":0.00006300836,"about_ca_system_score_gemma":0.00029886147,"threshold_uncertainty_score":0.46449402},"labels":[],"label_agreement":null},{"id":"W3128540120","doi":"10.1016/j.ejor.2021.02.009","title":"Scheduled service network design with resource management for two-tier multimodal city logistics","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":59,"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é de Montréal; Université du Québec à Montréal","funders":"Fonds de Recherche du Québec - Santé; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Integer programming; Multimodal transport; Decomposition; Network planning and design; Consolidation (business); Operations research; Linear programming; Resource allocation; Service (business); Flow network; Mathematical optimization; Transport engineering; Computer network; Engineering; Business; Mathematics","score_opus":0.14472915457814636,"score_gpt":0.3068228414253132,"score_spread":0.16209368684716682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128540120","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.0022608452,0.0004952392,0.97947115,0.00040588406,0.00013930193,0.00022238214,0.00001696333,0.000022686865,0.016965527],"genre_scores_gemma":[0.6588002,0.00006954212,0.33896005,0.00019186764,0.0008981457,0.0000054352963,0.000040505194,0.000060850245,0.0009734237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806195,0.00037151462,0.00038646432,0.00014942636,0.000673065,0.00035759198],"domain_scores_gemma":[0.99802846,0.00030767467,0.000038741862,0.00018190284,0.0012765202,0.00016670178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026425316,0.00012896954,0.00017245453,0.00009715101,0.00021198133,0.00014146288,0.00029212606,0.000022568956,0.00013116484],"category_scores_gemma":[0.00009828468,0.00010649177,0.000052179796,0.00037508408,0.000076225115,0.00009774909,0.000038155034,0.0004926385,0.000023933717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026046816,0.000062054,0.00016790966,0.00006626021,0.00018996405,0.0010579787,0.00010489361,0.9776687,0.00032715368,0.006600693,0.012473457,0.0010204513],"study_design_scores_gemma":[0.009811937,0.0012760635,0.011895854,0.0006493386,0.00021926886,0.00045565589,0.0005634211,0.6551346,0.0027380832,0.0011036055,0.31527564,0.0008764989],"about_ca_topic_score_codex":7.05788e-7,"about_ca_topic_score_gemma":0.000006243297,"teacher_disagreement_score":0.6565393,"about_ca_system_score_codex":0.00008216241,"about_ca_system_score_gemma":0.00012928322,"threshold_uncertainty_score":0.43426082},"labels":[],"label_agreement":null},{"id":"W3129328204","doi":"10.1016/j.ejor.2021.02.010","title":"Principal component analysis: A generalized Gini approach","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Methods and Models","field":"Mathematics","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; AXA Research Fund","keywords":"Principal component analysis; Outlier; Mathematics; Dimensionality reduction; Statistics; Robustness (evolution); Monte Carlo method; Variance (accounting); Curse of dimensionality; Robust principal component analysis; Econometrics; Computer science; Artificial intelligence; Economics","score_opus":0.4313328437984836,"score_gpt":0.5227266137766111,"score_spread":0.09139376997812754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129328204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044283114,0.00023940722,0.9367072,0.0006211961,0.00005946685,0.000085923275,0.00001660286,0.0000064270916,0.017980665],"genre_scores_gemma":[0.27562577,0.00004890406,0.72220963,0.00007275153,0.00026849107,0.0000022195456,0.000012716856,0.000020079882,0.0017394221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938076,0.003724708,0.00068196765,0.00021229232,0.0012990506,0.0002743668],"domain_scores_gemma":[0.9963638,0.0010496812,0.00013217422,0.0002401168,0.0019773496,0.00023686007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007750524,0.00010412884,0.0003504279,0.00026204897,0.00020902291,0.00013398557,0.00028026593,0.000019128358,0.0003803988],"category_scores_gemma":[0.0037687435,0.00008000248,0.00019357701,0.00062648143,0.0001026309,0.00013065012,0.00015194819,0.00057909224,0.000018078488],"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.00021632735,0.0008259324,0.00011772869,0.00005851473,0.0010896269,0.001486986,0.0008165723,0.012285843,0.012369196,0.96148586,0.003822393,0.0054250415],"study_design_scores_gemma":[0.012979126,0.0020505616,0.024651542,0.00039062474,0.00175038,0.0024880324,0.0030597153,0.27761602,0.009870308,0.5317878,0.13160685,0.0017490496],"about_ca_topic_score_codex":9.60743e-7,"about_ca_topic_score_gemma":0.0000010245969,"teacher_disagreement_score":0.42969805,"about_ca_system_score_codex":0.00006808984,"about_ca_system_score_gemma":0.00028122857,"threshold_uncertainty_score":0.45118102},"labels":[],"label_agreement":null},{"id":"W3133999951","doi":"10.1016/j.ejor.2021.02.045","title":"Identifying proactive ICU patient admission, transfer and diversion policies in a public-private hospital network","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Pontificia Universidad Católica de Chile","keywords":"Markov decision process; Private sector; Process (computing); Business; Public sector; Public hospital; Operations management; Computer science; Time horizon; Operations research; Markov process; Economics; Medicine; Finance; Engineering; Nursing; Statistics","score_opus":0.20694883419872678,"score_gpt":0.4582221590047205,"score_spread":0.25127332480599374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133999951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97521317,0.00046236915,0.0033395053,0.017423846,0.00031246254,0.00038186085,0.000008339522,0.000006568269,0.0028518708],"genre_scores_gemma":[0.9919969,0.00071827887,0.0060338955,0.0004018836,0.00043700964,0.000008281398,0.000023849108,0.000021826956,0.0003580708],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9930026,0.004793104,0.0007871056,0.00020649549,0.00077285693,0.00043785915],"domain_scores_gemma":[0.99647677,0.0003987966,0.000085504806,0.00012573482,0.0026161827,0.00029701187],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.005121426,0.00009908179,0.00018657403,0.00027830625,0.0014277786,0.00015521821,0.00014438621,0.000056707748,0.00036853363],"category_scores_gemma":[0.0018309852,0.00008120116,0.000042073218,0.00063383265,0.00006708856,0.00057647773,0.00017884444,0.0012087161,0.000030414547],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014681463,0.002511769,0.39667776,0.0006910993,0.00046747725,0.0035817588,0.2843488,0.034271084,0.012245032,0.14764217,0.0391331,0.07696183],"study_design_scores_gemma":[0.0054684207,0.0020995429,0.8619788,0.002723487,0.000025010768,0.00013623979,0.057808924,0.007505545,0.0006210786,0.0010544286,0.05996796,0.0006105342],"about_ca_topic_score_codex":0.000023362581,"about_ca_topic_score_gemma":0.000037380436,"teacher_disagreement_score":0.46530107,"about_ca_system_score_codex":0.00021203149,"about_ca_system_score_gemma":0.0014266875,"threshold_uncertainty_score":0.9998722},"labels":[],"label_agreement":null},{"id":"W3149471625","doi":"10.1016/j.ejor.2021.03.031","title":"An inverse optimization approach for a capacitated vehicle routing problem","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"National Natural Science Foundation of China","keywords":"Vehicle routing problem; Computer science; Mathematical optimization; Routing (electronic design automation); Operations research; Multiplicative function; Process (computing); Inverse; Mathematics","score_opus":0.0969225648087,"score_gpt":0.35160653743997106,"score_spread":0.25468397263127107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3149471625","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024809914,0.000077972945,0.96706367,0.00017883402,0.00009021744,0.00018335259,0.000009426723,0.000046603174,0.0075399987],"genre_scores_gemma":[0.28724292,0.000026285115,0.7121379,0.000037431582,0.00028332946,0.0000043783425,0.000055645887,0.000054824104,0.00015729967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968678,0.0015514129,0.000536754,0.00016846143,0.0005884015,0.00028721808],"domain_scores_gemma":[0.99691224,0.00022495078,0.000071437484,0.00016660533,0.00244731,0.00017748027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069805733,0.00010698777,0.00015931463,0.0002193676,0.00026940485,0.00028897845,0.00025489522,0.000034177443,0.000082463215],"category_scores_gemma":[0.0010215635,0.00010671478,0.00006472104,0.0005726777,0.000051960076,0.0005327595,0.00003379298,0.0004518508,0.0000054534503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002557603,0.00006491709,0.00010385974,0.000033648448,0.000036717716,0.000028596398,0.0006612891,0.9736616,0.022644997,0.00048924075,0.00081453135,0.0014350499],"study_design_scores_gemma":[0.00077693985,0.00014164158,0.0001541834,0.00003663983,0.000007733916,0.000075512275,0.00049964245,0.9939427,0.003870811,0.000020569041,0.00036330405,0.00011032198],"about_ca_topic_score_codex":7.561547e-7,"about_ca_topic_score_gemma":4.594291e-7,"teacher_disagreement_score":0.26243302,"about_ca_system_score_codex":0.00012307802,"about_ca_system_score_gemma":0.00023585049,"threshold_uncertainty_score":0.43517023},"labels":[],"label_agreement":null},{"id":"W3153609404","doi":"10.1016/j.ejor.2021.04.004","title":"Global sensitivity analysis via a statistical tolerance approach","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Probabilistic and Robust Engineering Design","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 Institute of Dental and Craniofacial Research; National Institutes of Health; Foundation for the National Institutes of Health","keywords":"Sensitivity (control systems); Parametric statistics; Mathematical optimization; Computer science; Constraint (computer-aided design); Set (abstract data type); Geometric programming; Principal component analysis; Basis (linear algebra); Mathematics; Artificial intelligence; Statistics","score_opus":0.19529053660829812,"score_gpt":0.4290408487087178,"score_spread":0.23375031210041966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153609404","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.018373797,0.000210842,0.96742684,0.0006749219,0.00012845665,0.000046258378,0.000041324478,0.0000052715345,0.013092299],"genre_scores_gemma":[0.91527075,0.000009179237,0.08355037,0.000073334886,0.00029846616,5.111307e-7,0.000009181752,0.0000071759896,0.0007810516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99011797,0.0049405443,0.00079401967,0.00033897595,0.0035230424,0.00028543992],"domain_scores_gemma":[0.9927655,0.0022511794,0.00011210522,0.00034903974,0.004242556,0.00027962573],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.026091414,0.000100306504,0.00033586015,0.00030377653,0.00023837417,0.00050232664,0.00045198365,0.000024273957,0.00050128397],"category_scores_gemma":[0.015153568,0.000071103546,0.00017332628,0.0027970884,0.00019128589,0.0002454267,0.00017103352,0.0004156695,0.00016173672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014521438,0.00037713774,0.006262691,0.000007885676,0.00037311812,0.0039010025,0.0002212581,0.9106527,0.0011662577,0.038213443,0.02285322,0.015826063],"study_design_scores_gemma":[0.0008266079,0.00026030742,0.37602916,0.000025920175,0.00010532613,0.0015333656,0.00035293348,0.60322946,0.000114792914,0.0065965345,0.010655578,0.00027001568],"about_ca_topic_score_codex":0.0000040078294,"about_ca_topic_score_gemma":0.0000047374288,"teacher_disagreement_score":0.89689696,"about_ca_system_score_codex":0.0001140713,"about_ca_system_score_gemma":0.00059755286,"threshold_uncertainty_score":0.9931422},"labels":[],"label_agreement":null},{"id":"W3173430869","doi":"10.1016/j.ejor.2021.05.055","title":"Optimal dynamic longevity hedge with basis risk","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Insurance, Mortality, Demography, Risk Management","field":"Social 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 Waterloo","funders":"","keywords":"Hedge; Stylized fact; Robustness (evolution); Generality; Longevity risk; Mathematical optimization; Computer science; Stochastic control; Discrete time and continuous time; Trading strategy; Econometrics; Mathematics; Economics; Optimal control; Pension; Finance","score_opus":0.05726869876714376,"score_gpt":0.3855672798744237,"score_spread":0.32829858110727994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173430869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9011019,0.00069939176,0.0023987684,0.003569189,0.00024305214,0.00018569188,0.00001958205,0.000013325655,0.09176909],"genre_scores_gemma":[0.9884352,0.0014162553,0.006594747,0.0000983887,0.00048204552,0.0000021815758,0.000005957183,0.000023219829,0.0029419863],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99094725,0.005484401,0.00041635823,0.00024616357,0.0024767297,0.00042907317],"domain_scores_gemma":[0.99642336,0.00029712624,0.00016201206,0.00023625184,0.002629977,0.00025126647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0143971,0.00010889443,0.00018218214,0.00027692213,0.0012190767,0.000492708,0.00055246113,0.000024367675,0.00081573863],"category_scores_gemma":[0.00095131376,0.0000897202,0.00012821324,0.00088197907,0.00057255675,0.0004819561,0.00014170397,0.00078865304,0.00016234453],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014313086,0.0027780342,0.66233605,0.00014498137,0.0018908747,0.019176913,0.032734152,0.033898417,0.0013505856,0.074010044,0.05438808,0.11586056],"study_design_scores_gemma":[0.0012222908,0.00051793817,0.84486353,0.00012140895,0.000049234764,0.00007733316,0.007819337,0.0004941078,0.00014572107,0.00023515493,0.14417297,0.0002810033],"about_ca_topic_score_codex":0.00012166179,"about_ca_topic_score_gemma":0.00082297454,"teacher_disagreement_score":0.18252747,"about_ca_system_score_codex":0.00017849794,"about_ca_system_score_gemma":0.00094022026,"threshold_uncertainty_score":0.93762755},"labels":[],"label_agreement":null},{"id":"W3183267548","doi":"10.1016/j.ejor.2021.07.032","title":"Scheduled service network design with revenue management considerations and an intermodal barge transportation illustration","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":37,"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 à Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Conseil Régional Hauts-de-France; European Regional Development Fund; Université de Montréal; European Commission; Compute Canada","keywords":"Revenue management; Revenue; Service (business); Computer science; Flow network; Schedule; Operations research; Integer programming; Network planning and design; Transport engineering; Business; Telecommunications; Marketing; Engineering; Finance","score_opus":0.09423657426933955,"score_gpt":0.30942353483651297,"score_spread":0.2151869605671734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183267548","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.19932644,0.0007322429,0.78359014,0.0023910145,0.00028927153,0.00045301332,0.000052369873,0.00003939396,0.013126128],"genre_scores_gemma":[0.9340267,0.00012350704,0.06521216,0.00009995764,0.0003004204,0.0000024349754,0.000044799333,0.000020100062,0.00016987282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998684,0.00042288305,0.00029449735,0.00009933944,0.00035621237,0.00014309958],"domain_scores_gemma":[0.99890804,0.000090116875,0.00003252716,0.000089605615,0.000774047,0.00010565663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015985557,0.00007311634,0.00009281868,0.0000699993,0.00018268455,0.00020020071,0.000060103317,0.000015705067,0.00024330894],"category_scores_gemma":[0.000045809655,0.00006495558,0.000013674671,0.00016006953,0.000038935817,0.00026870373,0.000008632077,0.00027590725,0.00000568943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009886329,0.0000806843,0.00037686565,0.00009958086,0.00014850906,0.0024052197,0.0008474346,0.9480156,0.0017288441,0.034090802,0.0079232445,0.004184377],"study_design_scores_gemma":[0.0092404755,0.003341078,0.35969818,0.0019572144,0.00037945044,0.0034676555,0.0039879647,0.5515361,0.00537611,0.012477945,0.04685351,0.0016843537],"about_ca_topic_score_codex":0.0000018140137,"about_ca_topic_score_gemma":0.0000582784,"teacher_disagreement_score":0.7347003,"about_ca_system_score_codex":0.000026119487,"about_ca_system_score_gemma":0.0001008617,"threshold_uncertainty_score":0.2664062},"labels":[],"label_agreement":null},{"id":"W3188442502","doi":"10.1016/j.ejor.2021.07.052","title":"An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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":"Université de Montréal; Computer Research Institute of Montréal","funders":"Belgian Federal Science Policy Office","keywords":"Computer science; Mathematical optimization; Solver; Bilevel optimization; Heuristic; Network planning and design; Neighbourhood (mathematics); Integer programming; Operations research; Service (business); Algorithm; Optimization problem; Mathematics; Economics; Artificial intelligence","score_opus":0.16148043410837365,"score_gpt":0.4214360052813088,"score_spread":0.25995557117293516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188442502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076829563,0.00016730421,0.98968166,0.0012085178,0.000068711706,0.00017109413,0.00001963019,0.000007843254,0.0009922602],"genre_scores_gemma":[0.29800552,0.00010120632,0.699598,0.00033089166,0.0006039175,0.000004101531,0.000041788113,0.000018982402,0.0012955886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969603,0.0017694412,0.0002924469,0.0001493949,0.0006101994,0.00021821656],"domain_scores_gemma":[0.9963079,0.00058644515,0.00008426932,0.000061344675,0.0027903968,0.00016960752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066504907,0.0000631421,0.00010379624,0.00009234179,0.00093955523,0.00036980343,0.00014705404,0.000018200886,0.000044895318],"category_scores_gemma":[0.0004271299,0.00005866123,0.000024918721,0.00036015475,0.000070984686,0.00046643725,0.000011097694,0.00022202017,0.0000030387598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050061266,0.00004203264,0.00009629775,0.0000062637246,0.000017002767,0.00006703198,0.009574198,0.9769752,0.0003486593,0.0063375044,0.00068253384,0.0058032027],"study_design_scores_gemma":[0.0007014429,0.00017155659,0.0009425328,0.00007364322,0.000009406764,0.000010292806,0.0016168779,0.9930944,0.000074970165,0.00062753726,0.0025891773,0.00008820109],"about_ca_topic_score_codex":0.000014061767,"about_ca_topic_score_gemma":0.00003386345,"teacher_disagreement_score":0.29032254,"about_ca_system_score_codex":0.000043985794,"about_ca_system_score_gemma":0.0009417322,"threshold_uncertainty_score":0.72263944},"labels":[],"label_agreement":null},{"id":"W3193825386","doi":"10.1016/j.ejor.2021.08.003","title":"Order picking optimization with rack-moving mobile robots and multiple workstations","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":70,"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":"Ministry of Science and Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Rack; Workstation; Computer science; Order (exchange); Mobile robot; Robot; Mathematical optimization; Simulation; Operations research; Real-time computing; Artificial intelligence; Operating system; Mathematics; Engineering; Business; Mechanical engineering","score_opus":0.035345477809353786,"score_gpt":0.29704294337794107,"score_spread":0.2616974655685873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193825386","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.021940792,0.0005172958,0.9751809,0.0001183347,0.00007584818,0.0000744127,0.0000028816908,0.000021439115,0.0020680754],"genre_scores_gemma":[0.7431554,0.00038004783,0.25606573,0.000013617347,0.00012808005,0.0000015632509,0.000021214308,0.000028285147,0.00020602196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.00020704762,0.00023798083,0.00010305942,0.0003523823,0.00015280007],"domain_scores_gemma":[0.9984308,0.00026669135,0.000039109225,0.000085017105,0.0010946775,0.0000837264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006777237,0.00007649692,0.00009280508,0.0001396832,0.00022508921,0.00018646786,0.0000755442,0.00001569306,0.000074947995],"category_scores_gemma":[0.00056013954,0.00006684985,0.000014212265,0.00026819258,0.00005246214,0.00032577888,0.00003468635,0.0003397364,0.000004515114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013827091,0.000017999993,0.00018256664,0.000013296533,0.000021502106,0.000096425225,0.00025890055,0.9964701,0.00049033365,0.00015849445,0.0001650399,0.0021115157],"study_design_scores_gemma":[0.0010726041,0.00018268704,0.002375311,0.00017743158,0.000013030564,0.00025141146,0.0007062759,0.9904485,0.0023506584,0.000049044476,0.0021840124,0.00018905655],"about_ca_topic_score_codex":6.8945633e-7,"about_ca_topic_score_gemma":0.0000028677105,"teacher_disagreement_score":0.72121465,"about_ca_system_score_codex":0.000052088817,"about_ca_system_score_gemma":0.000092256196,"threshold_uncertainty_score":0.27260578},"labels":[],"label_agreement":null},{"id":"W3196196980","doi":"10.1016/j.ejor.2021.08.009","title":"A subsidy policy to managing hazmat risk in railroad transportation network","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":19,"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":"Subsidy; Hazardous waste; Risk analysis (engineering); Government (linguistics); Transport engineering; Business; Population; Risk management; Operations research; Computer science; Engineering; Finance; Economics","score_opus":0.1702809601058224,"score_gpt":0.46489880623646457,"score_spread":0.2946178461306422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196196980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.848368,0.0012439196,0.03516834,0.080346495,0.00027926857,0.00018468656,0.000026467284,0.0000074995137,0.034375362],"genre_scores_gemma":[0.989318,0.00080731144,0.0058424254,0.0004410321,0.00078450836,0.0000011059233,0.0000068384534,0.000014677622,0.0027840794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99044067,0.0045501883,0.0011872519,0.00029833431,0.0031647813,0.00035875948],"domain_scores_gemma":[0.9955407,0.001232939,0.00018605465,0.0003007843,0.0024714095,0.0002681526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.028036246,0.000093325456,0.00027074106,0.0011188952,0.00035923938,0.00053968595,0.0007187978,0.000019864892,0.0006779512],"category_scores_gemma":[0.007786589,0.00007198935,0.00017535289,0.004268523,0.00006153714,0.00047474253,0.00006627318,0.00063427736,0.00054483226],"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.00046859297,0.00017007752,0.0626257,0.000004245091,0.00009059431,0.0030961323,0.0049783024,0.6782271,0.001143983,0.012224598,0.04174803,0.19522263],"study_design_scores_gemma":[0.0009935648,0.00022969602,0.87475526,0.000104702165,0.000013296458,0.00006890128,0.0024220285,0.004597494,0.00021004096,0.017000332,0.09943014,0.000174536],"about_ca_topic_score_codex":0.000058341506,"about_ca_topic_score_gemma":0.00056722143,"teacher_disagreement_score":0.81212956,"about_ca_system_score_codex":0.00007906606,"about_ca_system_score_gemma":0.00068161706,"threshold_uncertainty_score":0.97168595},"labels":[],"label_agreement":null},{"id":"W3206430016","doi":"10.1016/j.ejor.2021.10.023","title":"Procedures for ranking technical and cost efficient units: With a focus on nonconvexity","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"Western University","funders":"Grantová Agentura České Republiky","keywords":"Convexity; Ranking (information retrieval); Cost efficiency; Focus (optics); Axiom; Rank (graph theory); Computer science; Data envelopment analysis; Set (abstract data type); Mathematical optimization; Mathematical economics; Economics; Mathematics; Artificial intelligence; Financial economics","score_opus":0.22919912544216708,"score_gpt":0.4588846564421722,"score_spread":0.2296855310000051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206430016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85639215,0.0007704444,0.09959211,0.020391721,0.00015104571,0.0006031802,0.000028763789,0.000014166117,0.022056421],"genre_scores_gemma":[0.9934291,0.000015741967,0.005498814,0.0002038515,0.00020265572,0.0000036552728,0.0000020252032,0.000016003243,0.0006281159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99326026,0.0018060955,0.000720046,0.00037125373,0.0035631328,0.00027922008],"domain_scores_gemma":[0.98741853,0.0041067246,0.00019936063,0.00028358406,0.0078029796,0.0001888032],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.024088467,0.00010693714,0.0002528785,0.00055379816,0.00060496945,0.0007832277,0.00058303523,0.000023676914,0.00010274957],"category_scores_gemma":[0.031899653,0.00006527204,0.00007263593,0.0018338271,0.00034509302,0.00015695306,0.00015036699,0.00053836405,0.000035633006],"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.010196948,0.004279716,0.013731076,0.00013553415,0.0006152634,0.0069200723,0.0066338046,0.3656378,0.096900284,0.21055678,0.09920429,0.18518841],"study_design_scores_gemma":[0.03692497,0.028899064,0.26644993,0.0054130927,0.00041262034,0.013975702,0.018022597,0.19454274,0.08007078,0.02807818,0.32398364,0.0032266746],"about_ca_topic_score_codex":0.0000013157852,"about_ca_topic_score_gemma":0.000023026738,"teacher_disagreement_score":0.25271884,"about_ca_system_score_codex":0.00007819015,"about_ca_system_score_gemma":0.0014606119,"threshold_uncertainty_score":0.97625506},"labels":[],"label_agreement":null},{"id":"W3208722933","doi":"10.1016/j.ejor.2021.09.034","title":"The implications of crop minimum support price in the presence of myopic and strategic farmers","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Innovation and Socioeconomic Development","field":"Business, Management and Accounting","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":"Western University","funders":"","keywords":"Production (economics); Procurement; Agricultural science; Crop; Business; Economics; Agricultural economics; Marketing; Microeconomics; Agronomy","score_opus":0.1014925585603024,"score_gpt":0.34215678577989617,"score_spread":0.24066422721959377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208722933","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8920443,0.00008684266,0.000043302036,0.015567098,0.00006842972,0.00009656559,0.00000137588,8.080616e-7,0.09209126],"genre_scores_gemma":[0.9985763,0.00007781845,0.00014277913,0.00039436042,0.00012870898,0.0000016670498,0.000004260809,0.0000045720817,0.000669558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99884444,0.00017721557,0.00045554276,0.00007047901,0.0003424659,0.00010984802],"domain_scores_gemma":[0.99820393,0.0002475312,0.00017522645,0.00010182667,0.001264069,0.000007400284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052157985,0.000040512903,0.000075447206,0.00011952353,0.00019848166,0.00018747845,0.00029577228,0.000008470475,0.00014548271],"category_scores_gemma":[0.0003947182,0.000025153455,0.000023142473,0.00035617972,0.00014978828,0.00022746857,0.00008930553,0.00019677391,0.000012250306],"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.00007510597,0.00022238161,0.034169223,0.000099488694,0.00007316587,0.000055649067,0.0020501215,0.00024538836,0.009657713,0.9314628,0.016236614,0.005652333],"study_design_scores_gemma":[0.0010003592,0.00006980068,0.8871819,0.00006997696,0.000008406128,0.000044480104,0.01444737,0.0003956911,0.00028642497,0.0065849987,0.08979799,0.00011264482],"about_ca_topic_score_codex":0.0000065745617,"about_ca_topic_score_gemma":0.000007795099,"teacher_disagreement_score":0.9248778,"about_ca_system_score_codex":0.000016878652,"about_ca_system_score_gemma":0.00030946892,"threshold_uncertainty_score":0.18078591},"labels":[],"label_agreement":null},{"id":"W3212968564","doi":"10.1016/j.ejor.2021.11.017","title":"Insurance risk analysis of financial networks vulnerable to a shock","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Banking stability, regulation, efficiency","field":"Economics, Econometrics and Finance","cited_by":15,"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":"Universität Ulm; University of Waterloo; National Natural Science Foundation of China; Australian Research Council; University of New South Wales; Vrije Universiteit Brussel; Australian Government; Purdue University","keywords":"Shock (circulatory); Portfolio; Business; Variance (accounting); Financial market; Investment (military); Actuarial science; Financial risk; Finance; Core (optical fiber); Financial networks; Systemic risk; Economics; Financial crisis; Computer science","score_opus":0.05709744416923702,"score_gpt":0.3079555316266367,"score_spread":0.2508580874573997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212968564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95226955,0.0018621198,0.03727008,0.00065179035,0.00021063088,0.00008744198,0.00010576129,0.0000032692103,0.0075393277],"genre_scores_gemma":[0.9959124,0.0002035388,0.0029197033,0.00007698122,0.0002553958,0.0000014189586,0.000010779054,0.00001507256,0.00060473016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99724543,0.0008094481,0.0011019721,0.0002785144,0.000302768,0.00026189044],"domain_scores_gemma":[0.99732375,0.00039681155,0.00035331934,0.0003152377,0.0014891791,0.00012169337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011661755,0.00008782487,0.0004003153,0.0007979691,0.00029417453,0.00013172337,0.00038516452,0.000030503572,0.00080088817],"category_scores_gemma":[0.005785869,0.000093217524,0.0002084995,0.002809627,0.00008909127,0.00021319024,0.00011432575,0.00055765756,0.0000649283],"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.00007697581,0.00026862803,0.34363618,0.000009798701,0.00022646382,0.00004072258,0.00069930643,0.61044776,0.00015922108,0.03934437,0.0017911826,0.003299406],"study_design_scores_gemma":[0.00033615404,0.00017560943,0.96969885,0.000021979655,0.000017057282,0.0000075142307,0.000028286746,0.021491813,0.00012224066,0.00095302076,0.007044893,0.00010255556],"about_ca_topic_score_codex":0.000029285427,"about_ca_topic_score_gemma":0.0000372743,"teacher_disagreement_score":0.6260627,"about_ca_system_score_codex":0.00012048796,"about_ca_system_score_gemma":0.00023204769,"threshold_uncertainty_score":0.8769164},"labels":[],"label_agreement":null},{"id":"W3215603906","doi":"10.1016/j.ejor.2022.10.032","title":"A transformer-based model for default prediction in mid-cap corporate markets","year":2022,"lang":"en","type":"preprint","venue":"European Journal of Operational Research","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","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":"Western University","funders":"Economic and Social Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Transformer; Deep learning; Artificial intelligence; Machine learning; Credit risk; Engineering; Finance; Economics","score_opus":0.5512689731370978,"score_gpt":0.5106019976136499,"score_spread":0.04066697552344789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215603906","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.23049076,0.00039737712,0.7388837,0.0038202412,0.0014954122,0.001778893,0.00087211846,0.00002016818,0.022241358],"genre_scores_gemma":[0.890444,0.00003782406,0.100360125,0.00016318064,0.00061761827,0.00011337179,0.00011538777,0.00010737299,0.008041163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97407687,0.014110833,0.002905217,0.00087896024,0.007392725,0.00063542346],"domain_scores_gemma":[0.9853327,0.007830095,0.0011078019,0.00064751174,0.0047642253,0.00031764075],"candidate_categories":["metaresearch","metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.14834553,0.0002976619,0.00063175266,0.0027564063,0.000534734,0.000775125,0.0025974202,0.000107615866,0.0016561795],"category_scores_gemma":[0.03460386,0.00024592932,0.00047327255,0.0012087035,0.00022789573,0.00036161783,0.000475338,0.0030816582,0.000031173167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033763924,0.00024863135,0.001265792,0.000055768007,0.000051286042,0.00018879828,0.00071970513,0.9527795,0.0019654923,0.00021239009,0.018343156,0.020793088],"study_design_scores_gemma":[0.0022149358,0.00066823495,0.027123142,0.00021261467,0.000017391454,0.00006114384,0.0002212442,0.9407775,0.00014580619,0.017204318,0.011100846,0.00025285396],"about_ca_topic_score_codex":0.0000056413696,"about_ca_topic_score_gemma":0.00002187731,"teacher_disagreement_score":0.6599532,"about_ca_system_score_codex":0.0005865327,"about_ca_system_score_gemma":0.0041329847,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W3217738327","doi":"10.1016/j.ejor.2021.11.034","title":"Choice stabilities in the graph model for conflict resolution","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"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":"Computer science; Graph; Conflict resolution; Preference; Theoretical computer science; Mathematics","score_opus":0.5684971917734002,"score_gpt":0.5286760944054057,"score_spread":0.03982109736799444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217738327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8024746,0.00077303447,0.12596361,0.037544765,0.000121354155,0.00044573593,0.000065085704,0.0000047581416,0.032607038],"genre_scores_gemma":[0.9929336,0.000032600125,0.0024322758,0.00033208012,0.00023122515,0.000009612489,0.0000044147955,0.0000066941984,0.004017547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.993845,0.003387316,0.00065572537,0.00017511165,0.001747207,0.00018968033],"domain_scores_gemma":[0.99047077,0.0060759536,0.000100615536,0.00030942983,0.002979307,0.00006392289],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.037508387,0.000053430093,0.00011187094,0.0002424744,0.00037977204,0.0004237165,0.00084764085,0.000013306007,0.000177111],"category_scores_gemma":[0.014360852,0.000032246753,0.00009591435,0.0007206107,0.00019515309,0.00030926193,0.000074979136,0.00038070217,0.000055549466],"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.0003043184,0.000426734,0.0009402873,0.000009104687,0.00002397212,0.000058894162,0.011653189,0.11977631,0.012293485,0.77801317,0.06845995,0.008040575],"study_design_scores_gemma":[0.002304616,0.00055522495,0.05080397,0.00007748198,0.00001143075,0.00023084578,0.019297307,0.14131045,0.0015504067,0.34850794,0.43510872,0.00024158935],"about_ca_topic_score_codex":0.0000016936146,"about_ca_topic_score_gemma":0.000020762776,"teacher_disagreement_score":0.42950523,"about_ca_system_score_codex":0.00003056358,"about_ca_system_score_gemma":0.00042362098,"threshold_uncertainty_score":0.9939416},"labels":[],"label_agreement":null},{"id":"W4200098951","doi":"10.1016/j.ejor.2021.11.054","title":"Parallel subgradient algorithm with block dual decomposition for large-scale optimization","year":2021,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sparse and Compressive Sensing Techniques","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 Alberta","funders":"National Institute of Dental and Craniofacial Research","keywords":"Subgradient method; Mathematical optimization; Lagrangian relaxation; Block (permutation group theory); Relaxation (psychology); Optimization problem; Algorithm; Decomposition method (queueing theory); Mathematics; Block matrix; Convergence (economics); Matrix (chemical analysis); Computer science; Discrete mathematics","score_opus":0.03773537911255315,"score_gpt":0.3166255261342679,"score_spread":0.2788901470217148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200098951","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0258599,0.00042211593,0.97079694,0.00044363594,0.00010707588,0.00012979658,0.000014994339,0.00003753285,0.0021880036],"genre_scores_gemma":[0.4665468,0.00016097105,0.53254914,0.00004964829,0.0004322717,0.0000040728696,0.000048728783,0.00004007452,0.00016831224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987673,0.00024079278,0.0002482261,0.00010377653,0.00044134152,0.00019854456],"domain_scores_gemma":[0.99828553,0.00008786061,0.000034047054,0.00010300992,0.0014030145,0.00008656021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009327449,0.00007926243,0.000110894434,0.00012908969,0.00017060807,0.00013786073,0.0000988306,0.000017435288,0.000039541756],"category_scores_gemma":[0.000046573703,0.00006764323,0.000049217764,0.00016865048,0.000024213285,0.00016254897,0.000029155712,0.00024226645,0.000005872818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080568425,0.00010769314,0.000029859451,0.000009724907,0.00007667156,0.00037060844,0.0002876271,0.9762212,0.0075385757,0.00054121064,0.012192791,0.002543492],"study_design_scores_gemma":[0.0015044482,0.00068178814,0.0008358771,0.00019846584,0.000019745808,0.0008937216,0.00020280333,0.9455961,0.029464183,0.00011900913,0.020291882,0.00019199113],"about_ca_topic_score_codex":3.5250068e-7,"about_ca_topic_score_gemma":0.0000019719835,"teacher_disagreement_score":0.44068688,"about_ca_system_score_codex":0.00005753458,"about_ca_system_score_gemma":0.00008787161,"threshold_uncertainty_score":0.27584112},"labels":[],"label_agreement":null},{"id":"W4205420919","doi":"10.1016/j.ejor.2021.12.045","title":"Cardinality-constrained risk parity portfolios","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematical optimization; Portfolio; Cardinality (data modeling); Quadratic equation; Computer science; Regular polygon; Quadratic programming; Portfolio optimization; Mathematics; Finance; Economics","score_opus":0.21229404515580744,"score_gpt":0.4494858854840021,"score_spread":0.23719184032819465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205420919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82536864,0.00070712256,0.016788837,0.0055287,0.0011000821,0.0003344102,0.00016537702,0.000016656642,0.14999017],"genre_scores_gemma":[0.99315363,0.00026018138,0.0021664978,0.00013944898,0.0005156021,0.000002919581,0.000010757761,0.000016501486,0.0037344631],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98133045,0.010615694,0.0012589353,0.0002914405,0.0061945864,0.0003088598],"domain_scores_gemma":[0.9946703,0.0012617295,0.0005100484,0.00038209345,0.002919363,0.00025649279],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.07101873,0.000101812526,0.00024918193,0.000834957,0.0014736811,0.0005074424,0.0012576313,0.000014719683,0.004307944],"category_scores_gemma":[0.008504469,0.00007784872,0.00020689268,0.0014675452,0.00019517854,0.0004874988,0.0004077842,0.0012485102,0.00023277405],"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.00085925317,0.00055653276,0.13382654,0.0000025200275,0.0001760516,0.0022470073,0.002754999,0.29384917,0.00083765696,0.020157324,0.39391777,0.15081519],"study_design_scores_gemma":[0.0014220797,0.0011689095,0.17053646,0.0000087303115,0.000019648742,0.0010305425,0.003151205,0.0067717624,0.00012652569,0.008788814,0.8067424,0.00023287247],"about_ca_topic_score_codex":0.000022615866,"about_ca_topic_score_gemma":0.0000022344627,"teacher_disagreement_score":0.4128247,"about_ca_system_score_codex":0.00011492039,"about_ca_system_score_gemma":0.0007921062,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W4205537357","doi":"10.1016/j.ejor.2021.12.050","title":"A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":32,"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":"Shanghai Jiao Tong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Compute Canada; Polytechnique Montréal","keywords":"Vehicle routing problem; Branch and cut; Computer science; Mathematical optimization; Routing (electronic design automation); Integer programming; Branch and bound; Algorithm; Mathematics; Computer network","score_opus":0.05341610305665129,"score_gpt":0.3333075957489059,"score_spread":0.2798914926922546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205537357","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.13386077,0.00076336163,0.8564956,0.0029950899,0.00032606884,0.00085443206,0.00005611802,0.00006749795,0.0045810193],"genre_scores_gemma":[0.82838005,0.000007822722,0.17100352,0.00008878149,0.0002725915,0.000013603367,0.0000043408045,0.000047033456,0.00018224219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974604,0.000908238,0.00037849142,0.00012995125,0.0008483347,0.00027453073],"domain_scores_gemma":[0.99805707,0.0011197155,0.00007189066,0.000096682495,0.0005554918,0.00009917991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009783415,0.00009663709,0.00012777292,0.00015130288,0.00096872164,0.00016694098,0.0002659944,0.000008610956,0.00016773552],"category_scores_gemma":[0.00023726044,0.00007039735,0.000043667394,0.00029841333,0.00015294853,0.00016558447,0.00012446022,0.00072500424,0.0000040671616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004188344,0.000019676476,0.00014231562,0.000009001773,0.000081747196,0.00003872908,0.0005082809,0.92560154,0.00445495,0.00080211536,0.0007214073,0.06757835],"study_design_scores_gemma":[0.001638042,0.0003319413,0.00078435394,0.000050618422,0.000013708701,0.0006782102,0.00037315922,0.9931034,0.0007326948,0.000074184136,0.0020975189,0.00012215594],"about_ca_topic_score_codex":0.0000015594757,"about_ca_topic_score_gemma":4.5566156e-7,"teacher_disagreement_score":0.6945193,"about_ca_system_score_codex":0.00010976523,"about_ca_system_score_gemma":0.00017675804,"threshold_uncertainty_score":0.7450721},"labels":[],"label_agreement":null},{"id":"W4206768619","doi":"10.1016/j.ejor.2021.12.047","title":"An integrated data-driven method using deep learning for a newsvendor problem with unobservable features","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Forecasting Techniques and Applications","field":"Decision Sciences","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":"Newsvendor model; Unobservable; Computer science; Artificial intelligence; Mathematical optimization; Econometrics; Supply chain; Economics; Mathematics; Business","score_opus":0.48835605148299566,"score_gpt":0.5348500805684767,"score_spread":0.04649402908548106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206768619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06991995,0.00010275008,0.92604584,0.0019159445,0.000046500703,0.00055031927,0.00007161377,0.000026081747,0.0013209895],"genre_scores_gemma":[0.36281526,0.0000036875813,0.63580424,0.00006553213,0.00016180321,0.0000152798,0.00006202405,0.000028014661,0.0010441268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99279565,0.0036706182,0.00063174265,0.00039195735,0.0022336906,0.0002763493],"domain_scores_gemma":[0.995121,0.0013508319,0.0003236487,0.0005045483,0.0025450904,0.00015486164],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.02915474,0.00010020112,0.00019887107,0.00043261374,0.0022749056,0.0006087092,0.0023333507,0.000013029983,0.0003428807],"category_scores_gemma":[0.0023657032,0.00006645395,0.000055622306,0.0011886046,0.00009105891,0.0006498495,0.00070795417,0.00097120384,0.000005918607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005814079,0.0002254408,0.0009001211,0.000005297687,0.000048523685,0.00008057903,0.0010212143,0.904069,0.008564101,0.005987062,0.019011948,0.05950527],"study_design_scores_gemma":[0.0006371342,0.0023288042,0.0011771115,0.000032622214,0.000013786381,0.0005983496,0.0022471354,0.68430495,0.00026644315,0.0018104776,0.3064415,0.00014171175],"about_ca_topic_score_codex":0.00003658604,"about_ca_topic_score_gemma":0.00001596229,"teacher_disagreement_score":0.29289532,"about_ca_system_score_codex":0.00011051263,"about_ca_system_score_gemma":0.0005163157,"threshold_uncertainty_score":0.9996895},"labels":[],"label_agreement":null},{"id":"W4207081071","doi":"10.1016/j.ejor.2022.01.027","title":"Information disclosure in a supply chain with copycat threat","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Copycat; Supply chain; Business; Computer security; Supply chain management; Internet privacy; Computer science; Marketing","score_opus":0.04498582718321039,"score_gpt":0.27961777323592196,"score_spread":0.23463194605271157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207081071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8068171,0.0001736226,0.0005561771,0.018707788,0.00039580523,0.00059793127,0.000008968981,0.000019614461,0.172723],"genre_scores_gemma":[0.9971116,0.000011256641,0.0001122153,0.0013207754,0.00053918635,0.000013057608,0.000046268473,0.000015878039,0.00082972227],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976165,0.0002641793,0.0004001401,0.000084905776,0.0014027843,0.00023145169],"domain_scores_gemma":[0.9992195,0.00004746244,0.00014585226,0.00012014812,0.0004468219,0.00002024175],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005891145,0.0000878231,0.0001132087,0.00091469486,0.00039236023,0.0004120798,0.00043286072,0.000006483244,0.0019090399],"category_scores_gemma":[0.00014390376,0.00006827566,0.000040462066,0.0007549545,0.000059994658,0.0019566328,0.00032956494,0.0005099498,0.00017907388],"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.0030625265,0.0011053719,0.18037826,0.00028858936,0.00018340588,0.0016762209,0.0047020116,0.08660059,0.00054300734,0.26113984,0.43307903,0.027241156],"study_design_scores_gemma":[0.0026262181,0.00037960024,0.08428401,0.000079716316,0.00000911889,0.000053180374,0.0070037455,0.0043523647,0.000014219836,0.0004909221,0.90051305,0.00019385593],"about_ca_topic_score_codex":0.000046179626,"about_ca_topic_score_gemma":0.000016687854,"teacher_disagreement_score":0.46743402,"about_ca_system_score_codex":0.00014284295,"about_ca_system_score_gemma":0.00009392081,"threshold_uncertainty_score":0.99900335},"labels":[],"label_agreement":null},{"id":"W4210433482","doi":"10.1016/j.ejor.2022.01.046","title":"Estimating causal effects with optimization-based methods: A review and empirical comparison","year":2022,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Advanced Causal Inference Techniques","field":"Mathematics","cited_by":11,"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; HEC Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Causal inference; Inference; Computer science; Covariate; Causal model; Econometrics; Randomized experiment; Machine learning; Artificial intelligence; Statistics; Mathematics","score_opus":0.6049499846790904,"score_gpt":0.6345053979722219,"score_spread":0.029555413293131494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210433482","genre_codex":"review","genre_gemma":"methods","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":[2.179878e-7,0.6005214,0.39777377,0.00014544457,0.00003327463,0.00070332736,0.0000064737583,0.000022486642,0.0007935767],"genre_scores_gemma":[9.848477e-7,0.49430382,0.5053275,0.00008001678,0.00010319285,0.000043183598,0.000020514657,0.00007191756,0.000048843565],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98397577,0.012430932,0.001495465,0.00035336264,0.0014111329,0.00033335137],"domain_scores_gemma":[0.9855956,0.011973426,0.00091859436,0.0003530205,0.00093163527,0.00022775227],"candidate_categories":["metaresearch","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.016309442,0.0003621499,0.0018335765,0.00051010575,0.0003922216,0.00017858582,0.0006239891,0.00005427901,0.00052121916],"category_scores_gemma":[0.01413939,0.00024490693,0.0001827305,0.00076439226,0.00021375164,0.00021318995,0.00027345467,0.0024093261,0.000006754519],"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.000049136983,0.00039815225,0.0000070717338,0.07838028,0.00042846752,0.00084364583,0.00017791198,0.0055668512,0.000001172161,0.0026825778,0.018493406,0.89297134],"study_design_scores_gemma":[0.00050418486,0.00229745,0.0000012361298,0.07261631,0.0011210622,0.00102454,0.000024530938,0.009369678,0.0000040842647,0.0007103637,0.91175973,0.0005668446],"about_ca_topic_score_codex":6.715823e-7,"about_ca_topic_score_gemma":3.03257e-7,"teacher_disagreement_score":0.8932663,"about_ca_system_score_codex":0.00031308876,"about_ca_system_score_gemma":0.0014110473,"threshold_uncertainty_score":0.9998922},"labels":[],"label_agreement":null},{"id":"W4212808426","doi":"10.1016/j.ejor.2022.02.023","title":"A cutting plane method and a parallel algorithm for packing rectangles in a circular container","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","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":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Container (type theory); Computer science; Plane (geometry); Packing problems; Cutting-plane method; Algorithm; Parallel computing; Mathematics; Geometry; Integer programming; Engineering; Mechanical engineering","score_opus":0.06984326805810465,"score_gpt":0.3457003689317104,"score_spread":0.27585710087360577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212808426","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.015826805,0.0019643633,0.97639203,0.0009330367,0.00019545697,0.00038852086,0.00003387445,0.000024896739,0.0042410293],"genre_scores_gemma":[0.6546892,0.00018006956,0.34433568,0.0001260359,0.0002720217,0.000024745334,0.000027709197,0.00006262186,0.0002819138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982564,0.00075892167,0.0003141292,0.00009264952,0.00039481474,0.00018307894],"domain_scores_gemma":[0.99929345,0.00035372897,0.000037775215,0.000052196345,0.0001987293,0.000064113854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006269362,0.00006460291,0.00012124873,0.00030194697,0.00020752505,0.00010089018,0.00012949991,0.000009742806,0.00008964441],"category_scores_gemma":[0.00022464625,0.000062567655,0.00003192813,0.00022221856,0.0000182083,0.00011163756,0.000054041622,0.00044988914,0.0000015446407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055380522,0.000039268663,0.00044935776,0.00004026442,0.000057394718,0.00023906413,0.002111887,0.93657655,0.0027679938,0.0012434635,0.0024387373,0.05398065],"study_design_scores_gemma":[0.0021458261,0.00040921546,0.0010130622,0.000082280465,0.000005769053,0.0005402322,0.0008196651,0.94170195,0.000119561504,0.00038055636,0.052618753,0.00016311526],"about_ca_topic_score_codex":0.0000023026782,"about_ca_topic_score_gemma":0.0000011467492,"teacher_disagreement_score":0.63886243,"about_ca_system_score_codex":0.000083000494,"about_ca_system_score_gemma":0.00006261958,"threshold_uncertainty_score":0.2551435},"labels":[],"label_agreement":null},{"id":"W4220752472","doi":"10.1016/j.ejor.2022.03.048","title":"Computing equilibria for integer programming games","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Nash equilibrium; Knapsack problem; Mathematical optimization; Computer science; Mathematical economics; Stochastic game; Class (philosophy); Integer (computer science); Integer programming; Game theory; Computation; Set (abstract data type); Outcome (game theory); Mathematics; Algorithm; Artificial intelligence","score_opus":0.39841379435210134,"score_gpt":0.5235232665533408,"score_spread":0.12510947220123947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220752472","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82973933,0.0003136493,0.13417792,0.012844214,0.00047085976,0.00063584046,0.00003492326,0.000016808359,0.021766443],"genre_scores_gemma":[0.98630226,0.0000013812479,0.009321901,0.00014207896,0.00045716256,0.000009093983,0.000004242496,0.000014523651,0.0037473426],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99357,0.0028752473,0.00077540433,0.00020982746,0.0023163185,0.00025315685],"domain_scores_gemma":[0.99434,0.0032867698,0.00022023826,0.00022094008,0.0018089646,0.00012307269],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.048209913,0.00006265517,0.00014143072,0.00038871542,0.0010737116,0.0004965089,0.0012721065,0.0000064151827,0.0011023534],"category_scores_gemma":[0.0058872513,0.000047005844,0.00012553675,0.0007313333,0.00014199816,0.00024053143,0.00047599268,0.0005437194,0.00011868927],"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.000707931,0.0005321542,0.0010446563,0.000008831342,0.00007732742,0.000114425595,0.005224069,0.0271554,0.027108766,0.30769387,0.1503661,0.4799665],"study_design_scores_gemma":[0.0006972458,0.00087355654,0.0021507372,0.000015715827,0.000004343946,0.00021725627,0.005160393,0.009569791,0.00038153422,0.021636542,0.9591844,0.000108470194],"about_ca_topic_score_codex":5.4683784e-7,"about_ca_topic_score_gemma":2.6087045e-7,"teacher_disagreement_score":0.8088183,"about_ca_system_score_codex":0.000060770864,"about_ca_system_score_gemma":0.0002882079,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W4221095861","doi":"10.1016/j.ejor.2022.03.020","title":"A marginal indemnity function approach to optimal reinsurance under the Vajda condition","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Reinsurance; Indemnity; Actuarial science; Pareto principle; Risk measure; Risk management; Value (mathematics); Distortion (music); Function (biology); Economics; Econometrics; Computer science; Mathematics; Statistics; Operations management; Finance","score_opus":0.23250272962125737,"score_gpt":0.4329393514668128,"score_spread":0.2004366218455554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221095861","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6558075,0.00023422582,0.2768798,0.008640981,0.0007575409,0.000462182,0.000040772327,0.00001123053,0.05716577],"genre_scores_gemma":[0.9918773,0.000032112905,0.0027754526,0.0007447915,0.0005190976,0.000012273094,0.000018115328,0.000016362965,0.004004496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9876349,0.0059690396,0.0007891315,0.00028106198,0.0050629964,0.00026289356],"domain_scores_gemma":[0.9963213,0.00078608,0.0002574081,0.00031807148,0.0021408617,0.00017622902],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.034513477,0.00009724661,0.00015741246,0.00058926357,0.0017081065,0.0006014382,0.0011001496,0.000014996984,0.0012282658],"category_scores_gemma":[0.0015065683,0.000062230516,0.000102871956,0.0016949024,0.00013459646,0.00054687855,0.00031691388,0.0009900344,0.0002452018],"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.00075270975,0.00015704992,0.00053961255,7.2462274e-7,0.000024250961,0.00002866516,0.00088270195,0.88045806,0.00046447467,0.011376812,0.0994598,0.005855155],"study_design_scores_gemma":[0.0018316266,0.0026776895,0.30706915,0.000016107673,0.000020722551,0.0010041035,0.013852512,0.040248062,0.00013521535,0.005373854,0.62744343,0.00032749595],"about_ca_topic_score_codex":0.000005508123,"about_ca_topic_score_gemma":9.703108e-7,"teacher_disagreement_score":0.84020996,"about_ca_system_score_codex":0.00014434938,"about_ca_system_score_gemma":0.00044248902,"threshold_uncertainty_score":0.99968475},"labels":[],"label_agreement":null},{"id":"W4225114644","doi":"10.1016/j.ejor.2022.04.039","title":"Semiparametric estimation of spatial autoregressive smooth-coefficient panel stochastic frontier models","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Spatial and Panel Data Analysis","field":"Economics, Econometrics and Finance","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":"Carbon Engineering (Canada); University of Lethbridge","funders":"Russian Science Foundation","keywords":"Autoregressive model; Frontier; Econometrics; Estimation; Semiparametric model; STAR model; Mathematics; Economics; Computer science; Statistics; Autoregressive integrated moving average; Time series; Nonparametric statistics; Geography","score_opus":0.14910774679666863,"score_gpt":0.30705171692616096,"score_spread":0.15794397012949232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225114644","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.24528849,0.0022529603,0.74430054,0.0007819154,0.00052319746,0.00023232684,0.0006391902,0.000006635813,0.0059747454],"genre_scores_gemma":[0.9971748,0.000034533277,0.0018855759,0.000043877517,0.00017980901,0.000005719086,0.0000803235,0.000021339767,0.0005740058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974908,0.00047747017,0.0010125781,0.00023084057,0.00055816805,0.00023011367],"domain_scores_gemma":[0.99839246,0.00023492573,0.00057440443,0.00022642559,0.0004583619,0.00011341747],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005440162,0.00010215847,0.00033528672,0.0012175519,0.00035595454,0.00009729958,0.0005666734,0.000017394934,0.0016652835],"category_scores_gemma":[0.00093378156,0.000101594895,0.00014935239,0.0006802809,0.00009905276,0.00029388137,0.00023366176,0.0005205875,0.00009874711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011418159,0.00020390867,0.0004272806,0.000008352959,0.000084052226,0.000036961555,0.00070151995,0.981131,0.00005573681,0.010000619,0.0024419609,0.0047944123],"study_design_scores_gemma":[0.00078191975,0.00060231495,0.009212127,0.000020987498,0.000014655927,0.000031851156,0.00022763778,0.982702,0.000040052237,0.0035848555,0.0026363796,0.00014518075],"about_ca_topic_score_codex":0.0002263121,"about_ca_topic_score_gemma":0.0000026735356,"teacher_disagreement_score":0.7518863,"about_ca_system_score_codex":0.00018845717,"about_ca_system_score_gemma":0.00015572931,"threshold_uncertainty_score":0.9992473},"labels":[],"label_agreement":null},{"id":"W4280492776","doi":"10.1016/j.ejor.2022.05.023","title":"Private label sourcing for an e-tailer with agency selling and service provision","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Wilfrid Laurier University","funders":"","keywords":"Agency (philosophy); Business; Private label; Service (business); Industrial organization; Marketing; Operations research; Mathematics","score_opus":0.11939541228759884,"score_gpt":0.3399943684644191,"score_spread":0.22059895617682027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280492776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942225,0.00011611951,0.0014924755,0.001505462,0.00007445387,0.00025777792,0.000002569663,0.00000960758,0.0023190067],"genre_scores_gemma":[0.9966092,0.000008401149,0.0020221001,0.0005199754,0.0005501698,0.0000073353376,0.000014178312,0.000033752214,0.00023486733],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984259,0.00021731375,0.00027261733,0.0001642704,0.0007120753,0.00020782623],"domain_scores_gemma":[0.9987334,0.00012141839,0.00013069686,0.00009876359,0.0008861657,0.0000295466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061090286,0.00008476979,0.00010508944,0.00032691428,0.0010713984,0.0004893459,0.00027457348,0.0000069049597,0.00022905982],"category_scores_gemma":[0.00011869025,0.00006831683,0.000021806505,0.00039993934,0.000026824606,0.0009450773,0.00024541203,0.00039944003,0.000008346738],"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.00825548,0.001861923,0.21009764,0.0012772543,0.00031653512,0.001057835,0.00840368,0.026927132,0.16916767,0.018247848,0.010909154,0.54347783],"study_design_scores_gemma":[0.011149888,0.002616971,0.3061074,0.00055220886,0.00023518712,0.00050613785,0.0048785885,0.12396172,0.00038081084,0.0015502903,0.54687834,0.0011824472],"about_ca_topic_score_codex":0.0000238621,"about_ca_topic_score_gemma":0.00001075167,"teacher_disagreement_score":0.5422954,"about_ca_system_score_codex":0.000025040088,"about_ca_system_score_gemma":0.00008036704,"threshold_uncertainty_score":0.8240438},"labels":[],"label_agreement":null},{"id":"W4280493947","doi":"10.1016/j.ejor.2023.01.007","title":"Small and large neighborhood search for the park-and-loop routing problem with parking selection","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Vehicle routing problem; Computer science; City logistics; Benchmark (surveying); Routing (electronic design automation); Selection (genetic algorithm); Metaheuristic; Parking lot; Set (abstract data type); Iterated local search; Transport engineering; Operations research; Mathematical optimization; Computer network; Artificial intelligence; Engineering; Geography; Mathematics","score_opus":0.10177030843987613,"score_gpt":0.34285156255309185,"score_spread":0.24108125411321574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280493947","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.34060228,0.0004736221,0.6530633,0.0023214326,0.0000993372,0.0005904075,0.000008581982,0.000095679185,0.0027453424],"genre_scores_gemma":[0.96624774,0.0002418023,0.032763932,0.000025333053,0.0003256653,0.000007917943,0.000003446073,0.00005408557,0.00033007082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998123,0.0006718219,0.00029016388,0.00012710383,0.00045542125,0.000332482],"domain_scores_gemma":[0.99804515,0.0011059672,0.00003874309,0.00007085714,0.0006443876,0.00009487452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012250135,0.000088600194,0.00010939771,0.00021132313,0.0005863117,0.00030523783,0.00015222053,0.000019043535,0.000014311739],"category_scores_gemma":[0.0004035056,0.000060316026,0.00002406836,0.00054642116,0.000053199306,0.0001650564,0.000073719835,0.0005162191,0.0000048056922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019254477,0.000034057746,0.022815524,0.00015750778,0.00025028476,0.00004673399,0.0037356825,0.9056363,0.0065807244,0.0068639433,0.0014239403,0.052262742],"study_design_scores_gemma":[0.0010258283,0.00030757504,0.0231129,0.0001230328,0.000014539505,0.00014552819,0.0007826779,0.97068036,0.0007859881,0.000044348188,0.0028622055,0.00011499845],"about_ca_topic_score_codex":0.0000013724056,"about_ca_topic_score_gemma":0.0000030508022,"teacher_disagreement_score":0.62564546,"about_ca_system_score_codex":0.0000412075,"about_ca_system_score_gemma":0.00009103556,"threshold_uncertainty_score":0.45094946},"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":"W4281260186","doi":"10.1016/j.ejor.2022.05.027","title":"A theoretical and computational equilibria analysis of a multi-player kidney exchange program","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Organ Donation and Transplantation","field":"Medicine","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Pairwise comparison; Nash equilibrium; Computer science; Game theory; Quality (philosophy); Kidney transplant; Mathematical economics; Operations research; Microeconomics; Economics; Kidney transplantation; Transplantation; Medicine; Mathematics; Artificial intelligence","score_opus":0.07770608142900101,"score_gpt":0.4085019311814251,"score_spread":0.33079584975242404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281260186","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9833356,0.00027324766,0.0033207464,0.0074503813,0.00006957478,0.00040887584,0.00012831911,0.000011664715,0.0050015566],"genre_scores_gemma":[0.9917587,0.0000341848,0.0074483627,0.00030096996,0.000069895206,0.0000048797297,0.00014794365,0.000013134869,0.00022189942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99714804,0.0009635937,0.00040787237,0.00012039894,0.00123651,0.00012358642],"domain_scores_gemma":[0.9985859,0.00021970575,0.00009142622,0.000068903486,0.0008333712,0.00020070895],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033346291,0.000061435014,0.00019265118,0.0008178968,0.00016891753,0.00004013058,0.00010248177,0.000010466982,0.004120258],"category_scores_gemma":[0.0003565732,0.000051436513,0.00009319627,0.000809119,0.00020971842,0.00008967062,0.00006597391,0.00038250347,0.0000057780367],"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.0156001765,0.014317406,0.16239041,0.0009901357,0.0141548375,0.004947282,0.029819863,0.039650243,0.09507289,0.50066686,0.023196016,0.0991939],"study_design_scores_gemma":[0.008396382,0.0042365687,0.70539075,0.000090176734,0.000792464,0.0009461616,0.0007811152,0.26788825,0.00043298423,0.00039428732,0.0104660755,0.00018478802],"about_ca_topic_score_codex":0.0000015476434,"about_ca_topic_score_gemma":4.983121e-7,"teacher_disagreement_score":0.54300034,"about_ca_system_score_codex":0.000047966878,"about_ca_system_score_gemma":0.0003176233,"threshold_uncertainty_score":0.9967901},"labels":[],"label_agreement":null},{"id":"W4281660045","doi":"10.1016/j.ejor.2022.05.046","title":"Robust drone selective routing in humanitarian transportation network assessment","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":55,"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":"Tianjin Research Innovation Project for Postgraduate Students; Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Drone; Vehicle routing problem; Computer science; Routing (electronic design automation); Operations research; Business; Computer network; Computer security; Aeronautics; Engineering","score_opus":0.12145229903410613,"score_gpt":0.3254337177600529,"score_spread":0.20398141872594677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281660045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8819844,0.00013196797,0.009515415,0.01029434,0.0011162277,0.00072389434,0.000007661938,0.000031602358,0.096194476],"genre_scores_gemma":[0.9974252,0.000008217814,0.00062022364,0.00045227064,0.00086230435,0.0000108408285,0.00005878646,0.000017525921,0.00054461724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9973601,0.0004287129,0.0005895694,0.00017286417,0.0011746887,0.000274072],"domain_scores_gemma":[0.99911433,0.000039645372,0.00009339645,0.000097549724,0.0006373779,0.00001769818],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009931429,0.00008571901,0.00012258055,0.00047104305,0.00076556054,0.00020031867,0.0003473371,0.000007691763,0.0017316821],"category_scores_gemma":[0.00013192138,0.000087896144,0.000055477976,0.0009629308,0.00003276791,0.0007225116,0.000102600636,0.00068127696,0.00006219474],"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.000091967435,0.00023920507,0.01146504,0.000021522004,0.000032096086,0.000114360875,0.0003822748,0.8842336,0.00012692514,0.084820904,0.017059648,0.0014124563],"study_design_scores_gemma":[0.0015944456,0.00022859382,0.8192408,0.000054661712,0.000019343674,0.0000075305707,0.003930399,0.0937374,0.0000039223346,0.0011399414,0.07978924,0.0002537314],"about_ca_topic_score_codex":0.0002862401,"about_ca_topic_score_gemma":0.0006128748,"teacher_disagreement_score":0.80777574,"about_ca_system_score_codex":0.00025177328,"about_ca_system_score_gemma":0.00013319831,"threshold_uncertainty_score":0.99918085},"labels":[],"label_agreement":null},{"id":"W4281993352","doi":"10.1016/j.ejor.2022.06.002","title":"Eliminate demand information disadvantage in a supplier encroachment supply chain with information acquisition","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":58,"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; Dalhousie University","funders":"National University's Basic Research Foundation of China; China Postdoctoral Science Foundation; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Business; Competition (biology); Supply chain; Industrial organization; Channel (broadcasting); Private information retrieval; Supply chain management; Microeconomics; Marketing; Commerce; Economics; Computer science","score_opus":0.024423124140317654,"score_gpt":0.26769501142933616,"score_spread":0.2432718872890185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281993352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87015444,0.00009715697,0.005999893,0.012391289,0.00052273343,0.001248811,0.000030471081,0.0000327877,0.10952243],"genre_scores_gemma":[0.997023,0.000017426964,0.00025092188,0.0019190377,0.00032086816,0.000030280844,0.00023359558,0.00001244307,0.00019245465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971248,0.0002689962,0.0006339359,0.0000974115,0.0015897305,0.00028514545],"domain_scores_gemma":[0.99901336,0.00004807008,0.00026871098,0.00012980137,0.000512319,0.00002775186],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0067258803,0.000118025586,0.00013082613,0.0013651438,0.00047497518,0.000610937,0.00037952478,0.000010588035,0.0014520314],"category_scores_gemma":[0.00010080924,0.000099283,0.000045183224,0.0006893654,0.000058356807,0.005976663,0.00034663753,0.00046260378,0.0002186469],"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.007539091,0.0016440745,0.06940178,0.00086612935,0.00027426178,0.0010629965,0.011977389,0.28575563,0.0014241596,0.40779957,0.15001121,0.062243722],"study_design_scores_gemma":[0.0053560613,0.000682305,0.11052831,0.00013080925,0.000021894502,0.000080635706,0.012736138,0.021543536,0.00009145203,0.00062177004,0.8478315,0.00037556887],"about_ca_topic_score_codex":0.000030177896,"about_ca_topic_score_gemma":0.000004867049,"teacher_disagreement_score":0.6978203,"about_ca_system_score_codex":0.00026137548,"about_ca_system_score_gemma":0.00008101461,"threshold_uncertainty_score":0.99946076},"labels":[],"label_agreement":null},{"id":"W4283725615","doi":"10.1016/j.ejor.2022.06.052","title":"Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Centre for International Governance Innovation; University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Initialization; Population; Particle swarm optimization; Algorithm; Metaheuristic; Reservation; Mathematics","score_opus":0.48824208230378274,"score_gpt":0.48426509826174224,"score_spread":0.003976984042040499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283725615","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.08512419,0.00027923673,0.9071785,0.0043853205,0.00016627015,0.00044353958,0.00015915264,0.000006721759,0.0022570388],"genre_scores_gemma":[0.9686518,0.00001463804,0.027712073,0.00033742213,0.0003360039,0.000019358451,0.0000074633144,0.00002010897,0.0029011755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925153,0.0036954074,0.00076065917,0.00022899285,0.002537455,0.00026215945],"domain_scores_gemma":[0.9948338,0.002518378,0.0002706378,0.00032863833,0.0019274262,0.00012111394],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.04635777,0.000080672085,0.00015021501,0.00043523038,0.0025139665,0.00039014535,0.0012899764,0.000006618736,0.0003390226],"category_scores_gemma":[0.0044376347,0.00005317563,0.00016803246,0.0007026098,0.00025218105,0.00029968127,0.000356755,0.0006254679,0.000039285336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024997626,0.00015251522,0.0000190945,0.0000024407645,0.000059307276,0.000054179673,0.0017094052,0.8566182,0.009679321,0.039899975,0.08018717,0.011368388],"study_design_scores_gemma":[0.00037548275,0.00015550695,0.00009245106,0.0000053331933,0.000012328588,0.0002021293,0.0012459914,0.92403096,0.00011055758,0.025328182,0.048378613,0.00006247832],"about_ca_topic_score_codex":0.0000029455448,"about_ca_topic_score_gemma":0.0000011963418,"teacher_disagreement_score":0.8835276,"about_ca_system_score_codex":0.000097598786,"about_ca_system_score_gemma":0.00048067415,"threshold_uncertainty_score":0.9987846},"labels":[],"label_agreement":null},{"id":"W4288056540","doi":"10.1016/j.ejor.2022.07.046","title":"The graph model for composite decision makers and its application to a water resource conflict","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University; Wilfrid Laurier University","funders":"Major Project of Philosophy and Social Science Research in Colleges and Universities of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Conflict resolution; Conflict analysis; Operations research; Group decision-making; Computer science; Management science; Graph; Fuzzy logic; Resource (disambiguation); Stability (learning theory); Mathematical economics; Economics; Mathematics; Artificial intelligence; Machine learning; Theoretical computer science; Social psychology; Political science; Psychology","score_opus":0.23736606617440686,"score_gpt":0.45916537544461955,"score_spread":0.22179930927021269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288056540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7132002,0.00031408123,0.25411698,0.028317405,0.00006528198,0.0009653396,0.00006122273,0.000006938081,0.0029525426],"genre_scores_gemma":[0.9939398,0.000014564338,0.0017430681,0.00049568806,0.000099229444,0.000060503928,0.000005528072,0.000013998248,0.0036275918],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99550503,0.0014068373,0.00061720016,0.00024268805,0.001998233,0.0002299939],"domain_scores_gemma":[0.9952581,0.0028444817,0.00010094635,0.0002805994,0.0013354941,0.00018039481],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.031315822,0.000069850226,0.00011232091,0.00030519144,0.0024257572,0.0004267282,0.0010913572,0.000008620433,0.00006297456],"category_scores_gemma":[0.0013165674,0.0000388081,0.00007171244,0.00043556822,0.0000999936,0.00014295786,0.00044529012,0.0003492056,0.00009555238],"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.0031677946,0.0001771621,0.00008063224,0.0000034241712,0.000046215617,0.000014187282,0.0062340326,0.49444553,0.16302931,0.15650705,0.08241804,0.09387661],"study_design_scores_gemma":[0.0007863693,0.00045576505,0.0009259833,0.000008030403,0.0000058679384,0.00010017265,0.0013081928,0.14800663,0.0019233332,0.03615273,0.81021947,0.0001074463],"about_ca_topic_score_codex":3.8323762e-7,"about_ca_topic_score_gemma":9.947772e-7,"teacher_disagreement_score":0.72780144,"about_ca_system_score_codex":0.00004114617,"about_ca_system_score_gemma":0.000078555466,"threshold_uncertainty_score":0.99887294},"labels":[],"label_agreement":null},{"id":"W4288058431","doi":"10.1016/j.ejor.2022.06.046","title":"Dynamic investment strategies and leadership in product innovation","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"Desjardins; HEC Montréal","funders":"Deutsche Forschungsgemeinschaft","keywords":"Incentive; Industrial organization; Stock (firearms); Profit (economics); Investment (military); Business; Microeconomics; Product market; Market share; Production (economics); Economics; Marketing","score_opus":0.6157771444560106,"score_gpt":0.4654040055838923,"score_spread":0.15037313887211834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288058431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96915364,0.00027742988,0.0005250955,0.010717224,0.00019378998,0.0001433304,0.0000031310447,0.00000341585,0.018982936],"genre_scores_gemma":[0.9952716,0.00000496987,0.0011297283,0.00074111694,0.00006846531,0.0000028898182,0.000004774755,0.0000086589225,0.0027677445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9931669,0.0024806622,0.0010184475,0.00021291188,0.0029111318,0.00020990541],"domain_scores_gemma":[0.9972952,0.00044939257,0.00024276198,0.0001374939,0.0018300007,0.00004512129],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.039233476,0.00006381765,0.00011911285,0.0018996528,0.00045682324,0.0005833487,0.0004498551,0.000006790625,0.00076920673],"category_scores_gemma":[0.0051955003,0.00004955694,0.000020132027,0.0030895874,0.00013508856,0.0006973365,0.0002602772,0.00073447096,0.000027091875],"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.0006884283,0.0006485487,0.012208673,0.000028619617,0.000036695998,0.00078699435,0.0136410305,0.03150595,0.06642397,0.6707535,0.042253517,0.1610241],"study_design_scores_gemma":[0.0044470183,0.0025525137,0.5583132,0.00013299365,0.000004378361,0.0012453056,0.15318948,0.039305713,0.0006120138,0.05924361,0.18042277,0.00053099776],"about_ca_topic_score_codex":0.0000022900706,"about_ca_topic_score_gemma":0.0000040922923,"teacher_disagreement_score":0.61150986,"about_ca_system_score_codex":0.00011996297,"about_ca_system_score_gemma":0.0005441166,"threshold_uncertainty_score":0.98931134},"labels":[],"label_agreement":null},{"id":"W4290791833","doi":"10.1016/j.ejor.2022.08.003","title":"Bowley vs. Pareto optima in reinsurance contracting","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Waterloo","funders":"","keywords":"Reinsurance; Pareto principle; Mathematical economics; Pareto optimal; Competitive equilibrium; Pareto efficiency; Economics; Status quo; Mathematical optimization; Popularity; Microeconomics; Computer science; Multi-objective optimization; Mathematics; Actuarial science","score_opus":0.24601652644715927,"score_gpt":0.46849259681837346,"score_spread":0.2224760703712142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290791833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9269237,0.000723283,0.0033224418,0.007948355,0.00062014326,0.00022083758,0.000018651275,0.0000064767446,0.060216106],"genre_scores_gemma":[0.994461,0.00021166533,0.002377815,0.00019333948,0.00028418828,0.0000032399048,0.0000042423835,0.000015315,0.0024492226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.98852956,0.0054349448,0.001190402,0.000246898,0.004306416,0.00029177556],"domain_scores_gemma":[0.9958902,0.0016586365,0.00032627018,0.00023326887,0.001753981,0.00013767184],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.046300046,0.00007817273,0.0002028356,0.00083151367,0.00063662214,0.00043567026,0.0010066967,0.000011470126,0.0013521858],"category_scores_gemma":[0.008554524,0.00006230357,0.000079984165,0.0013799918,0.00008009915,0.0006694757,0.00024304404,0.0010123783,0.0001455979],"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.00097130804,0.00025115395,0.06700902,0.0000015689485,0.000019548183,0.0019272759,0.00216651,0.8107483,0.0013933299,0.0037899453,0.060277097,0.051444963],"study_design_scores_gemma":[0.0028668556,0.0014729999,0.38263658,0.000051899715,0.0000041535823,0.00087525736,0.004179414,0.048915107,0.00033708612,0.0021647145,0.5561935,0.00030242212],"about_ca_topic_score_codex":0.000011570067,"about_ca_topic_score_gemma":0.0000055609958,"teacher_disagreement_score":0.7618332,"about_ca_system_score_codex":0.00013742107,"about_ca_system_score_gemma":0.00048250266,"threshold_uncertainty_score":0.99979687},"labels":[],"label_agreement":null},{"id":"W4293108018","doi":"10.1016/j.ejor.2022.04.030","title":"Large satellite constellations and space debris: Exploratory analysis of strategic management of the space commons","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Space Satellite Systems and Control","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Constellation; Space debris; Satellite constellation; Space (punctuation); Computer science; Satellite; Order (exchange); Space environment; Dimension (graph theory); Function (biology); Operations research; Commons; Telecommunications; Business; Debris; Aerospace engineering; Mathematics; Geography; Meteorology; Geology; Engineering; Political science; Law; Physics","score_opus":0.06698386116944667,"score_gpt":0.29774943310481233,"score_spread":0.23076557193536568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293108018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95391935,0.007117247,0.00076059496,0.0006834589,0.00017482243,0.00024910495,0.00008151225,0.000007703153,0.037006214],"genre_scores_gemma":[0.99894285,0.00049553084,0.00016795752,0.000008571583,0.000036212037,0.0000026958771,0.000004031305,0.000016178987,0.00032594614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99748856,0.0009972155,0.00044765908,0.000088483765,0.0008132733,0.00016479325],"domain_scores_gemma":[0.99910647,0.0001574099,0.000117802934,0.00021155053,0.00033632995,0.000070451984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032196103,0.00008055599,0.00022155316,0.0003858,0.00022518665,0.000045501616,0.0002745833,0.00000972545,0.00018630578],"category_scores_gemma":[0.00001509243,0.000062673855,0.00012113458,0.0009971546,0.0000892048,0.00008252296,0.00014445808,0.00035435057,0.00000279084],"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.00019902327,0.00033835563,0.026380671,0.0003143559,0.007063231,0.0002605255,0.007531329,0.6949283,0.022090115,0.23562638,0.0026492274,0.0026184944],"study_design_scores_gemma":[0.00784567,0.0014800015,0.37217772,0.0007748601,0.0022434795,0.00023535546,0.20546877,0.17648007,0.0041787787,0.0010933311,0.22692072,0.0011012462],"about_ca_topic_score_codex":0.0000044110884,"about_ca_topic_score_gemma":0.000016892098,"teacher_disagreement_score":0.51844823,"about_ca_system_score_codex":0.000056100907,"about_ca_system_score_gemma":0.00006526376,"threshold_uncertainty_score":0.25557655},"labels":[],"label_agreement":null},{"id":"W4304890599","doi":"10.1016/j.ejor.2022.10.018","title":"Supermajority politics: Equilibrium range, policy diversity, utilitarian welfare, and political compromise","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Ottawa","funders":"","keywords":"Compromise; Economics; Politics; Voting; Majority rule; Welfare; Convergence (economics); Diversity (politics); Microeconomics; Mathematical economics; Law; Macroeconomics; Market economy; Political science","score_opus":0.11701423733171894,"score_gpt":0.31839188510670346,"score_spread":0.20137764777498451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304890599","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9192979,0.00058971933,0.00011387941,0.016754245,0.0002778181,0.00013902143,0.00025616353,0.000008437489,0.06256282],"genre_scores_gemma":[0.99753183,0.0000073761876,0.00012397232,0.00023978502,0.00074207725,0.000001532611,0.000007969882,0.000019598916,0.0013258429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971867,0.0011862838,0.00063797797,0.00022010766,0.00030764213,0.00046124612],"domain_scores_gemma":[0.99898165,0.00021167379,0.00012409945,0.00017851533,0.00018545597,0.00031857452],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009887485,0.00009826263,0.0002672875,0.0005843749,0.0012285264,0.00015544653,0.0005322267,0.000018205488,0.0009247292],"category_scores_gemma":[0.0007814615,0.000107498505,0.00009373533,0.00026296108,0.00023434714,0.0002602052,0.0011778631,0.00071826705,0.000097358396],"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.00006988961,0.00011007042,0.034714624,0.000019048934,0.000037182406,0.00011142867,0.00091751537,0.00006561183,0.000026548474,0.96317947,0.0007055881,0.00004303452],"study_design_scores_gemma":[0.005641007,0.002444812,0.6068228,0.000053341777,0.000015412481,0.0013227499,0.0040368913,0.0021916847,0.000041024698,0.17844583,0.19834192,0.0006425556],"about_ca_topic_score_codex":0.00032921118,"about_ca_topic_score_gemma":0.0000013262232,"teacher_disagreement_score":0.78473365,"about_ca_system_score_codex":0.00026789235,"about_ca_system_score_gemma":0.00011279585,"threshold_uncertainty_score":0.99998856},"labels":[],"label_agreement":null},{"id":"W4307815948","doi":"10.1016/j.ejor.2022.10.034","title":"Information sharing in an MTO supply chain with upstream adjustments","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"University of Calgary","funders":"Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Business; Information sharing; Profit (economics); Upstream (networking); Industrial organization; Incentive; Production (economics); Build to order; Computer science; Order (exchange); Information asymmetry; Microeconomics; Marketing; Economics; Computer network","score_opus":0.06524229279252594,"score_gpt":0.3005686911483031,"score_spread":0.23532639835577715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307815948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478136,0.000037313723,0.0001478561,0.0019981505,0.00018095355,0.00028480182,0.0000034250475,0.000011823355,0.04952212],"genre_scores_gemma":[0.9975596,0.0000053751533,0.00015316998,0.001156291,0.0005102789,0.000013083693,0.000065842694,0.000017992195,0.0005183603],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977254,0.00020512544,0.00041524967,0.00010934881,0.00129727,0.00024759208],"domain_scores_gemma":[0.9992067,0.000024391526,0.00015306644,0.00014994357,0.00043800488,0.00002789104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005538576,0.00009042053,0.00010390291,0.0010265453,0.0003926041,0.00053588883,0.00057960907,0.000006507036,0.0017554796],"category_scores_gemma":[0.00009864285,0.00007628418,0.00003106428,0.00061443844,0.000038127047,0.0032630127,0.00042215057,0.00044751144,0.00013025572],"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.0031030804,0.002062387,0.48053405,0.0002664198,0.00019090221,0.0016749382,0.006455156,0.1988594,0.0007813577,0.16391307,0.07495465,0.06720459],"study_design_scores_gemma":[0.0059798667,0.0012687183,0.33185768,0.00017207612,0.000020329799,0.00006992847,0.019169763,0.033663377,0.00004560272,0.0008490419,0.6064367,0.00046685248],"about_ca_topic_score_codex":0.000050619532,"about_ca_topic_score_gemma":0.000019139528,"teacher_disagreement_score":0.5314821,"about_ca_system_score_codex":0.00016878973,"about_ca_system_score_gemma":0.00006814823,"threshold_uncertainty_score":0.9991571},"labels":[],"label_agreement":null},{"id":"W4308195387","doi":"10.1016/j.ejor.2022.10.045","title":"Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Bayesian probability; Benchmark (surveying); Iterated function; Mathematical optimization; Operations research; Feature (linguistics); Constraint (computer-aided design); Cover (algebra); Key (lock); Routing (electronic design automation); Artificial intelligence; Mathematics; Engineering","score_opus":0.029701638751559324,"score_gpt":0.31939307167857384,"score_spread":0.2896914329270145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308195387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5007042,0.0060460498,0.49091852,0.0007640087,0.00012088315,0.0003899572,0.000005784395,0.000032612978,0.001017944],"genre_scores_gemma":[0.9834443,0.0008297282,0.015481624,0.000034696044,0.000086883265,0.000010108322,0.000009625814,0.000043056472,0.000060004182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773645,0.0009334846,0.0004172693,0.00014686775,0.0005045873,0.0002613324],"domain_scores_gemma":[0.9989613,0.0005521795,0.00007658701,0.000056166737,0.00025160587,0.00010210684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060119387,0.00009675727,0.00015426264,0.00028364532,0.00046487205,0.00009070783,0.00013194888,0.000011985703,0.00008442272],"category_scores_gemma":[0.00049855415,0.00009006873,0.0000177311,0.00037684242,0.000046161033,0.00029339944,0.00009069529,0.00077742385,7.417982e-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.00016943234,0.000018462486,0.0038316739,0.000020732456,0.000024678498,0.000027521684,0.00071539,0.95931745,0.000589482,0.0001235121,0.000048936803,0.035112727],"study_design_scores_gemma":[0.0021106254,0.0007146707,0.0060004075,0.0001048957,0.000009856349,0.00015944561,0.0008571038,0.98584694,0.00008023583,0.00006013478,0.0039157555,0.00013992823],"about_ca_topic_score_codex":7.8766277e-7,"about_ca_topic_score_gemma":0.0000032469654,"teacher_disagreement_score":0.48274004,"about_ca_system_score_codex":0.00013277345,"about_ca_system_score_gemma":0.00007339962,"threshold_uncertainty_score":0.36728963},"labels":[],"label_agreement":null},{"id":"W4308323215","doi":"10.1016/j.ejor.2022.11.003","title":"Outsourcing or reshoring? A manufacturer's sourcing strategy in the presence of government subsidy","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Global trade and economics","field":"Economics, Econometrics and Finance","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":"Wilfrid Laurier University","funders":"Science Foundation of Ministry of Education of China; Natural Science Foundation of Shandong Province","keywords":"Outsourcing; Subsidy; Business; Multinational corporation; Government (linguistics); Industrial organization; Marketing; Economics; Finance; Market economy","score_opus":0.20501313899240928,"score_gpt":0.30919446004420326,"score_spread":0.10418132105179398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308323215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9548114,0.0006661068,0.0002616473,0.0020524838,0.00014697478,0.00016986058,0.00009177629,0.000001656308,0.041798107],"genre_scores_gemma":[0.9985977,0.00008627291,0.00018779832,0.00014509329,0.00016486183,0.000004393609,0.000002095349,0.000014066923,0.0007977588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9977742,0.00050738506,0.0008876228,0.00017709892,0.0003871021,0.00026662438],"domain_scores_gemma":[0.99906504,0.00030649308,0.00030979625,0.00019948397,0.000059703383,0.00005948985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011163648,0.000081563885,0.0002162639,0.00019168404,0.00026564312,0.00013333617,0.00081925275,0.000012302845,0.0007755095],"category_scores_gemma":[0.0004286879,0.00006577456,0.00008307009,0.00027828437,0.00006146372,0.00022461882,0.00019517993,0.00074024074,0.000033197386],"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.0012229895,0.00091165584,0.10557374,0.00007260465,0.00018295321,0.0011146985,0.012659014,0.6877991,0.0006035099,0.16766526,0.019980311,0.0022141386],"study_design_scores_gemma":[0.0050857826,0.0049357973,0.598939,0.00016653126,0.000014145588,0.0009484384,0.04642543,0.018708196,0.0009848092,0.010582679,0.31247023,0.0007389323],"about_ca_topic_score_codex":0.00005648708,"about_ca_topic_score_gemma":0.000021191967,"teacher_disagreement_score":0.6690909,"about_ca_system_score_codex":0.00025202084,"about_ca_system_score_gemma":0.000084297666,"threshold_uncertainty_score":0.84912854},"labels":[],"label_agreement":null},{"id":"W4309573958","doi":"10.1016/j.ejor.2022.11.030","title":"A subgroup dominance-based benefit of the doubt method for addressing rank reversals: A case study of the human development index in Europe","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Windsor","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Planning Office of Philosophy and Social Science; Philosophy and Social Science Foundation of Hunan Province; China Postdoctoral Science Foundation","keywords":"Data envelopment analysis; Ranking (information retrieval); Weighting; Pairwise comparison; Comparability; Rank (graph theory); Econometrics; Dominance (genetics); Mathematics; Statistics; Computer science; Artificial intelligence","score_opus":0.5117664980602848,"score_gpt":0.5401859807640578,"score_spread":0.028419482703772925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309573958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99322754,0.00008437626,0.004668006,0.00060552056,0.00021976963,0.0008470319,0.000016253973,0.000001460543,0.00033001456],"genre_scores_gemma":[0.9903627,7.8425734e-7,0.008851739,0.000091449176,0.00007178471,0.000019537501,5.3432905e-7,0.00002570829,0.0005757778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.97971666,0.011582935,0.0022871268,0.0003754287,0.005746678,0.00029117102],"domain_scores_gemma":[0.9895887,0.0048492644,0.0009970148,0.0006790628,0.0038053698,0.00008059809],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.07002134,0.00013831866,0.00040374772,0.00084256235,0.0012824718,0.0002688553,0.0025791118,0.00001635686,0.0003368261],"category_scores_gemma":[0.011714623,0.0000774021,0.00016196736,0.0026171363,0.00015559905,0.00022764874,0.0012673426,0.00082789693,0.00000238845],"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.0068138186,0.00627891,0.14773032,0.00010203349,0.00028462804,0.005696761,0.079423815,0.48873824,0.08163149,0.0023321672,0.015099745,0.16586806],"study_design_scores_gemma":[0.03354813,0.003378268,0.80877376,0.0010856707,0.000054220247,0.0024951617,0.047165576,0.048217475,0.008705019,0.0012286971,0.044696294,0.0006517102],"about_ca_topic_score_codex":0.000064130276,"about_ca_topic_score_gemma":0.00017445319,"teacher_disagreement_score":0.66104347,"about_ca_system_score_codex":0.00018139211,"about_ca_system_score_gemma":0.0010244414,"threshold_uncertainty_score":0.9966101},"labels":[],"label_agreement":null},{"id":"W4310033065","doi":"10.1016/j.ejor.2022.11.040","title":"An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands","year":2022,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"","keywords":"Vehicle routing problem; Computer science; Benchmark (surveying); Integer (computer science); Mathematical optimization; TRIPS architecture; Branch and cut; Routing (electronic design automation); Operations research; Integer programming; Algorithm; Mathematics","score_opus":0.04175022239280719,"score_gpt":0.3241135125620981,"score_spread":0.2823632901692909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310033065","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.021198964,0.00019768506,0.9771648,0.0005489797,0.000053377273,0.00034097608,0.000014214317,0.00002611837,0.0004549101],"genre_scores_gemma":[0.8517485,0.000006896813,0.14749871,0.000055166904,0.00030842604,0.000020577427,0.000007840167,0.000064596825,0.0002892711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768466,0.0009708269,0.00032042255,0.00012349406,0.0006665804,0.00023404033],"domain_scores_gemma":[0.9984735,0.0007339007,0.000059221064,0.000118830874,0.0005104532,0.00010409199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00887902,0.00009160926,0.00012039819,0.00014942474,0.0007545258,0.00020800364,0.00032232623,0.0000099383915,0.00014237539],"category_scores_gemma":[0.00019946901,0.00006432672,0.00002928587,0.0002773701,0.0000710887,0.00022988032,0.0000874135,0.0006278672,0.000004642805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005679418,0.000024946774,0.00004291208,0.000005766223,0.000051490286,0.000016363798,0.0007278393,0.9705176,0.003103659,0.00015714242,0.00029669644,0.024998832],"study_design_scores_gemma":[0.0007898451,0.00062731,0.00064724335,0.000021295213,0.000011372411,0.00017289518,0.0003919677,0.9964594,0.00006708296,0.000024371337,0.0007048332,0.00008233056],"about_ca_topic_score_codex":9.781708e-7,"about_ca_topic_score_gemma":3.0497696e-7,"teacher_disagreement_score":0.83054954,"about_ca_system_score_codex":0.00008318417,"about_ca_system_score_gemma":0.000112890506,"threshold_uncertainty_score":0.58032787},"labels":[],"label_agreement":null},{"id":"W4313480064","doi":"10.1016/j.ejor.2022.12.023","title":"When can a manufacturer benefit from adding a direct sharing channel?","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory 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":"Wilfrid Laurier University","funders":"","keywords":"Profit sharing; Channel (broadcasting); Supply chain; Business; Profit (economics); Cost sharing; Channel coordination; Industrial organization; Renting; Supply chain management; Microeconomics; Computer science; Marketing; Economics; Telecommunications; Finance","score_opus":0.11438455706001319,"score_gpt":0.3114475093096978,"score_spread":0.1970629522496846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313480064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6286799,0.00024581913,0.00018510573,0.019429198,0.0012992539,0.00040765607,0.000026646034,0.00012194019,0.34960455],"genre_scores_gemma":[0.98692983,0.000030328385,0.00014002496,0.0012492981,0.004468065,0.000005169022,0.00007978824,0.000049834973,0.007047674],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997668,0.00009132407,0.0004212278,0.0002542216,0.0011779438,0.00038723237],"domain_scores_gemma":[0.998956,0.00011789265,0.00013727699,0.00019781265,0.0005448653,0.000046136665],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00437054,0.00013504282,0.00017305039,0.0009165759,0.00041169277,0.00092206546,0.0006886069,0.000018442432,0.0020338201],"category_scores_gemma":[0.00041343976,0.0001127138,0.00010449616,0.0005214488,0.000049137132,0.0008014251,0.00046324183,0.00039986728,0.001379522],"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.00039839145,0.00023446078,0.0097323535,0.0001583178,0.0005374041,0.0026925977,0.0028019992,0.016379485,0.0028599852,0.034398373,0.9092945,0.020512134],"study_design_scores_gemma":[0.0014282522,0.00008269054,0.057235576,0.00036852417,0.000033588225,0.000007640021,0.0019008563,0.015497087,0.00024787386,0.006879572,0.91595745,0.0003608881],"about_ca_topic_score_codex":0.00017290312,"about_ca_topic_score_gemma":0.000040532672,"teacher_disagreement_score":0.35824996,"about_ca_system_score_codex":0.00008492795,"about_ca_system_score_gemma":0.000034501612,"threshold_uncertainty_score":0.999398},"labels":[],"label_agreement":null},{"id":"W4317213942","doi":"10.1016/j.ejor.2023.01.018","title":"Scalable timing-aware network design via lagrangian decomposition","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Process Optimization and Integration","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 Waterloo","funders":"","keywords":"Lagrangian relaxation; Mathematical optimization; Computer science; Scalability; Flow network; Heuristic; Schedule; Linear programming; Exploit; Integer programming; Relaxation (psychology); Decomposition; Algorithm; Mathematics","score_opus":0.08843724091774977,"score_gpt":0.3469267175357162,"score_spread":0.2584894766179664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317213942","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.003869077,0.00021400627,0.98343325,0.0007366218,0.0003316677,0.00014311082,0.0000033682425,0.000107776716,0.011161127],"genre_scores_gemma":[0.9826585,0.00032897858,0.015082234,0.00010238211,0.000788983,0.0000040710033,0.00005522595,0.000051695813,0.00092792703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827415,0.00046685615,0.00034492995,0.00008581985,0.000576912,0.00025133378],"domain_scores_gemma":[0.99876934,0.0001513039,0.00003633145,0.00008195231,0.00081447087,0.00014659864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033910647,0.000082798324,0.00010002906,0.00031415315,0.00024877672,0.00019080675,0.0002210496,0.000023797958,0.00040828902],"category_scores_gemma":[0.00018694163,0.000073381154,0.000044523695,0.0007741124,0.000033277054,0.00042876013,0.000026749663,0.00035866743,0.00064443325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002623201,0.000010977045,0.0000220911,0.000010136137,0.000019695657,0.000042420626,0.00012195915,0.89530605,0.003117011,0.0002852124,0.09730627,0.0037319663],"study_design_scores_gemma":[0.00037247458,0.00019334747,0.00123288,0.000106372216,0.0000049768564,0.000058108923,0.00006123371,0.98454624,0.0022905455,0.00027174506,0.010746651,0.00011542979],"about_ca_topic_score_codex":6.3081995e-7,"about_ca_topic_score_gemma":7.776132e-7,"teacher_disagreement_score":0.97878945,"about_ca_system_score_codex":0.00007751516,"about_ca_system_score_gemma":0.00009227652,"threshold_uncertainty_score":0.8283101},"labels":[],"label_agreement":null},{"id":"W4317521089","doi":"10.1016/j.ejor.2023.01.019","title":"Survey of optimization models for power system operation and expansion planning with demand response","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Smart Grid Energy Management","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Demand response; Grid; Electric power system; Power grid; Term (time); Operations research; Dynamic demand; Power flow; Mathematical optimization; Power (physics); Electricity; Engineering; Electrical engineering","score_opus":0.09882129180671646,"score_gpt":0.3214608778252245,"score_spread":0.22263958601850803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317521089","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5670373,0.00015665872,0.43181258,0.000081947415,0.00009634865,0.0001696187,0.0000088816305,0.000023364744,0.0006133249],"genre_scores_gemma":[0.9949805,0.000042916832,0.004763509,0.00000454037,0.000056939512,0.000005046649,0.000026527525,0.00003520133,0.000084814696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810225,0.0007853194,0.00034021505,0.000097572214,0.0005280051,0.00014666136],"domain_scores_gemma":[0.99871904,0.00036789995,0.00004475019,0.000093469935,0.00070971163,0.000065138986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009107123,0.00007452254,0.00012516032,0.00040497538,0.0001267346,0.00008953329,0.000115722054,0.000015551244,0.0000071772297],"category_scores_gemma":[0.0002422329,0.000060263035,0.000016447044,0.0002789851,0.000032937307,0.00032848105,0.000040419432,0.00012093754,0.0000032331059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063039194,0.0000075644075,0.00019206712,0.00004439701,0.00003928219,0.000030366456,0.00035692524,0.99489,0.0019568177,0.00023410436,0.0015192572,0.000098867335],"study_design_scores_gemma":[0.0006664438,0.0004214263,0.038000107,0.00016246324,0.0000045101856,0.000017329985,0.0002919543,0.9597543,0.0004976898,0.0000021870294,0.00011825293,0.000063335065],"about_ca_topic_score_codex":0.000002970963,"about_ca_topic_score_gemma":0.0000011950741,"teacher_disagreement_score":0.42794323,"about_ca_system_score_codex":0.00006147997,"about_ca_system_score_gemma":0.00006704078,"threshold_uncertainty_score":0.31563655},"labels":[],"label_agreement":null},{"id":"W4318822006","doi":"10.1016/j.ejor.2023.01.041","title":"Corrigendum to “Eliminate demand information disadvantage in a supplier encroachment supply chain with information acquisition” [European Journal of Operational Research 305 (2023) 659–673]","year":2023,"lang":"en","type":"erratum","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","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":"Western University; Dalhousie University","funders":"National Key Research and Development Program of China; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Disadvantage; Business; Supply chain; Operations research; Computer science; Industrial organization; Marketing; Engineering","score_opus":0.05749762131611991,"score_gpt":0.29839612112765984,"score_spread":0.24089849981153993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318822006","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.07491169,0.0059919823,0.27910247,0.016839387,0.06666948,0.010228894,0.0076737935,0.0004045974,0.53817767],"genre_scores_gemma":[0.92912424,0.005583083,0.009612165,0.00068153825,0.008552808,0.00006561075,0.0064564818,0.00048094793,0.039443135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.989236,0.0019154096,0.0027856266,0.00024781845,0.0048776697,0.00093750784],"domain_scores_gemma":[0.9934471,0.00027213473,0.00041708676,0.00038445846,0.0049042427,0.0005749679],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.018469285,0.0004710495,0.00065654935,0.0040506413,0.0004576711,0.00100326,0.0012769224,0.00015204171,0.00062449364],"category_scores_gemma":[0.00070864084,0.0003900793,0.00017653633,0.0016375195,0.0002994047,0.0025475405,0.00020562139,0.0044879178,0.0008221751],"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.0007723308,0.00014706796,0.00034266242,0.00039431467,0.00023127958,0.0015412983,0.0042998833,0.073987775,0.00027583638,0.0020079643,0.9136057,0.0023939167],"study_design_scores_gemma":[0.0043400736,0.003699996,0.04998801,0.0025203992,0.00007181214,0.0007184691,0.0026941807,0.014347134,0.00024198514,0.00010539268,0.92032546,0.0009471085],"about_ca_topic_score_codex":0.00001843873,"about_ca_topic_score_gemma":0.000042046697,"teacher_disagreement_score":0.8542125,"about_ca_system_score_codex":0.00095337676,"about_ca_system_score_gemma":0.0013451837,"threshold_uncertainty_score":0.9999558},"labels":[],"label_agreement":null},{"id":"W4319310978","doi":"10.1016/j.ejor.2023.01.045","title":"Multi-level participation in integrative, systemic planning: The case of climate adaptation in Ghana","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainability and Climate Change Governance","field":"Environmental Science","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":"MaRS","funders":"Consortium of International Agricultural Research Centers","keywords":"Adaptation (eye); Process (computing); Corporate governance; Food security; Climate change; Environmental resource management; Process management; Knowledge management; Business; Public relations; Computer science; Agriculture; Political science; Economics; Psychology; Geography; Ecology","score_opus":0.25846669614492807,"score_gpt":0.4271970115751191,"score_spread":0.168730315430191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319310978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981382,0.00006528295,0.00021664167,0.00058200024,0.000039513903,0.0001731619,0.000010512048,0.0000023104078,0.00077237596],"genre_scores_gemma":[0.9994466,0.0000885938,0.00029502952,0.00001795771,0.00002626967,0.000007944531,0.0000037516136,0.000007718058,0.00010618207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9972762,0.0014353221,0.000482412,0.00011779272,0.00046309715,0.00022521574],"domain_scores_gemma":[0.99914914,0.00043794574,0.00013591463,0.00009964741,0.00013457614,0.000042774718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008137839,0.00006017268,0.000104831684,0.00015456803,0.00011317496,0.0000340883,0.00021207755,0.0000149716025,0.00012291255],"category_scores_gemma":[0.0014853082,0.00004048978,0.000028760445,0.0007975918,0.00015566795,0.00029101947,0.00012214303,0.00032442377,0.00006721852],"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.0007643706,0.0006284291,0.13820082,0.00015518171,0.000022037075,0.010525861,0.23969123,0.5739913,0.011180041,0.0012410315,0.0011622285,0.022437487],"study_design_scores_gemma":[0.0010005544,0.00026687497,0.7474254,0.000319005,0.0000028453787,0.00027071818,0.14871548,0.10145014,0.0002681389,0.00009026903,0.000103470906,0.000087108434],"about_ca_topic_score_codex":0.00014908751,"about_ca_topic_score_gemma":0.0007559576,"teacher_disagreement_score":0.60922456,"about_ca_system_score_codex":0.00027897087,"about_ca_system_score_gemma":0.00005467188,"threshold_uncertainty_score":0.28204286},"labels":[],"label_agreement":null},{"id":"W4319441355","doi":"10.1016/j.ejor.2023.01.066","title":"Multiple allocation hub location with service level constraints for two shipment classes","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Management Ahmedabad","keywords":"Computer science; Service (business); Context (archaeology); Constraint (computer-aided design); Network planning and design; Operations research; Service provider; Service level; Queue; Class (philosophy); Location-allocation; Total cost; Variable (mathematics); Computer network; Mathematical optimization; Business; Mathematics","score_opus":0.19997675261540043,"score_gpt":0.39961275720255024,"score_spread":0.1996360045871498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319441355","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.15278558,0.000070694856,0.8418072,0.0021573538,0.00021350403,0.00045612856,0.000024652682,0.00009629051,0.002388608],"genre_scores_gemma":[0.9001396,0.000029949748,0.09914221,0.00006609114,0.00028076174,0.000011898227,0.000054174478,0.00005054517,0.00022479071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979671,0.00054462877,0.00041039538,0.00012624805,0.0007027685,0.00024883598],"domain_scores_gemma":[0.99618495,0.00071426464,0.000065394626,0.00012388719,0.0027988898,0.00011259739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060143946,0.00009854063,0.00011778453,0.0003319542,0.000206252,0.0001659836,0.0002437714,0.000018742547,0.00003855196],"category_scores_gemma":[0.001071813,0.000086464024,0.000027697932,0.0006798411,0.00006353622,0.00030846006,0.000031960044,0.00028564234,0.00009084021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064011394,0.00002433821,0.0003432639,0.00006410786,0.000052075444,0.000017167284,0.0004900108,0.97620606,0.010234751,0.00077669474,0.0014629932,0.010264533],"study_design_scores_gemma":[0.0027359498,0.0003058135,0.025430514,0.00024289291,0.00001412959,0.00007066632,0.0009035536,0.95695204,0.009108132,0.0000819125,0.003938183,0.00021622259],"about_ca_topic_score_codex":0.0000019618928,"about_ca_topic_score_gemma":0.000010911157,"teacher_disagreement_score":0.747354,"about_ca_system_score_codex":0.00012830547,"about_ca_system_score_gemma":0.00026093374,"threshold_uncertainty_score":0.35259005},"labels":[],"label_agreement":null},{"id":"W4319991951","doi":"10.1016/j.ejor.2023.01.016","title":"Territorial design for customers with demand frequency","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Retail Behavior Studies","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Business; Industrial organization; Operations research; Mathematics","score_opus":0.1703101205989001,"score_gpt":0.36359850605028016,"score_spread":0.19328838545138005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319991951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9410234,0.00048237023,0.012725426,0.011755743,0.0027911933,0.0015907803,0.000014988348,0.00012027432,0.029495807],"genre_scores_gemma":[0.9933909,0.000024086692,0.0025074088,0.000051285675,0.0031206324,0.000015199115,0.000010416022,0.000045710087,0.0008343587],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982478,0.0001503703,0.00030416957,0.00014049522,0.0008766366,0.00028053042],"domain_scores_gemma":[0.99787617,0.00026845757,0.00010760031,0.00009618824,0.0016281458,0.000023446812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005747194,0.0000952378,0.00013895253,0.00056563376,0.00045531298,0.0004133457,0.00031314272,0.000012277579,0.00008203238],"category_scores_gemma":[0.0007440378,0.000068908754,0.00005820788,0.0005945586,0.000112676564,0.0006745605,0.000105441766,0.0002463055,0.0003497767],"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.0045064804,0.0004718111,0.32758513,0.00046955363,0.0010307479,0.0038807993,0.0012143014,0.0044941045,0.04142099,0.044271342,0.46294162,0.107713126],"study_design_scores_gemma":[0.009398182,0.001234218,0.32368943,0.0004972523,0.00024054258,0.00011341152,0.001887453,0.002330725,0.0003552567,0.0013019509,0.65809184,0.0008597302],"about_ca_topic_score_codex":0.000014032416,"about_ca_topic_score_gemma":0.000012217978,"teacher_disagreement_score":0.19515024,"about_ca_system_score_codex":0.000040756117,"about_ca_system_score_gemma":0.00013500442,"threshold_uncertainty_score":0.44957885},"labels":[],"label_agreement":null},{"id":"W4321073976","doi":"10.1016/j.ejor.2023.02.011","title":"How much is enough? Government subsidies in supporting green product development","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":77,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Sheridan College; Toronto Metropolitan University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Subsidy; Stackelberg competition; Microeconomics; Government (linguistics); Market segmentation; Product (mathematics); Industrial organization; Economics; Game theory; Business; Welfare; Social Welfare; New product development; Marketing; Market economy; Mathematics","score_opus":0.08384031922585032,"score_gpt":0.31661334399319346,"score_spread":0.23277302476734313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321073976","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8828533,0.00020384415,0.00016186095,0.08974607,0.0003331953,0.0006558774,0.0000024254705,0.00004422853,0.025999159],"genre_scores_gemma":[0.9794772,0.000029551675,0.00059126056,0.00057437574,0.001636241,0.000011771929,0.000014054837,0.000046337856,0.017619165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99563026,0.00021627097,0.00065157394,0.00029946526,0.0025691972,0.000633257],"domain_scores_gemma":[0.99833095,0.00012733601,0.00024770977,0.00019883692,0.001060924,0.00003426105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013382125,0.0001610687,0.00019817303,0.0008780589,0.00038042446,0.00096098497,0.00062633597,0.000014206233,0.00028693507],"category_scores_gemma":[0.0017067112,0.00014010184,0.00006158884,0.0014627742,0.00007000269,0.0013593966,0.00073285284,0.00044705468,0.00048102392],"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.00076144544,0.00082030805,0.11406378,0.0017883419,0.00048520873,0.013370206,0.010524853,0.003221971,0.0065054093,0.030800939,0.6163031,0.20135447],"study_design_scores_gemma":[0.0011164898,0.00007104385,0.11248391,0.00016115571,0.00000932691,0.000013580604,0.01935286,0.0014983397,0.0010974719,0.0006400582,0.8632586,0.00029717296],"about_ca_topic_score_codex":0.00003425237,"about_ca_topic_score_gemma":0.00003480693,"teacher_disagreement_score":0.24695551,"about_ca_system_score_codex":0.0003570882,"about_ca_system_score_gemma":0.00019685307,"threshold_uncertainty_score":0.92667997},"labels":[],"label_agreement":null},{"id":"W4323545972","doi":"10.1016/j.ejor.2023.03.005","title":"The impact of retail pricing leadership under manufacturer encroachment","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":32,"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":"Southwestern University of Finance and Economics; National Natural Science Foundation of China; Data Center of Management Science, National Natural Science Foundation of China - Peking University; Natural Sciences and Engineering Research Council of Canada; National Social Science Fund of China; National Office for Philosophy and Social Sciences","keywords":"Direct selling; Business; Profitability index; Channel (broadcasting); Industrial organization; Cost leadership; Retail market; Marketing; Commerce; Competitive advantage; Finance; Computer science; Telecommunications","score_opus":0.2834867631444576,"score_gpt":0.3711946275055224,"score_spread":0.08770786436106481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323545972","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8329296,0.00047189495,0.0005435343,0.021749025,0.00060718996,0.00046418174,0.0000023656598,0.00003623043,0.14319596],"genre_scores_gemma":[0.99300426,0.000060640126,0.000031170348,0.00030082985,0.0011237601,0.0000017256111,0.000007976249,0.00002306025,0.005446566],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9976149,0.00026173904,0.00046126335,0.00012343997,0.001189657,0.00034895993],"domain_scores_gemma":[0.9986757,0.00022889438,0.00019377236,0.00018493821,0.00068978174,0.000026925889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009371619,0.000102764076,0.00012608524,0.00050467614,0.00044397172,0.0004543465,0.0005632435,0.000013792459,0.00065906474],"category_scores_gemma":[0.00043649162,0.000059953498,0.00016084331,0.00064852287,0.00014468821,0.0005328664,0.00024173465,0.00036982103,0.0005013066],"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.00059188396,0.0002842076,0.013146471,0.00019496259,0.00068636175,0.00034013242,0.00089036743,0.07245621,0.006562501,0.06616307,0.8118691,0.026814777],"study_design_scores_gemma":[0.002504711,0.000532548,0.64126784,0.00034721996,0.000048689,0.000026323358,0.012253471,0.01542162,0.0007480563,0.003986124,0.3224345,0.00042889992],"about_ca_topic_score_codex":0.00003187716,"about_ca_topic_score_gemma":0.0000029445634,"teacher_disagreement_score":0.6281214,"about_ca_system_score_codex":0.00010123299,"about_ca_system_score_gemma":0.0000894178,"threshold_uncertainty_score":0.7216297},"labels":[],"label_agreement":null},{"id":"W4328100172","doi":"10.1016/j.ejor.2023.03.011","title":"The joint impact of environmental awareness and system infrastructure on e-waste collection","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Recycling and Waste Management Techniques","field":"Environmental Science","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":"Queen's University","funders":"","keywords":"Data collection; Environmental economics; Business; Environmental impact assessment; Waste collection; Sustainability; Return on investment; Environmental stewardship; Computer science; Marketing; Environmental resource management; Municipal solid waste; Environmental science; Profit (economics); Economics; Engineering","score_opus":0.04341092612213122,"score_gpt":0.3302178815292106,"score_spread":0.2868069554070794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328100172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99263376,0.000022656037,0.00012530606,0.00024181989,0.000061089,0.00012155934,0.000005389015,0.000008994638,0.006779399],"genre_scores_gemma":[0.9987649,0.00022610239,0.00010160335,0.000005941227,0.00007887384,0.0000014241056,0.000001932663,0.000010938958,0.00080829347],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9980231,0.000646413,0.0002868788,0.00010529337,0.0007884858,0.00014986178],"domain_scores_gemma":[0.9995427,0.0001472076,0.00010354335,0.00011477273,0.000026440239,0.00006530758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038728723,0.00006715048,0.00008929387,0.0001349053,0.0004609177,0.00009171613,0.00020286595,0.000012797208,0.00007244791],"category_scores_gemma":[0.00011380991,0.000039244875,0.00005709997,0.00027045983,0.00020203089,0.00010718107,0.00019220934,0.00024107989,0.000054637323],"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.001088444,0.00023743913,0.15248644,0.00008375529,0.0003243233,0.00041093936,0.0023301956,0.23726697,0.23612133,0.001797205,0.24335673,0.124496214],"study_design_scores_gemma":[0.00037992187,0.0012546239,0.98398256,0.00009928904,0.0000052415626,0.00006263492,0.001135301,0.007865803,0.0025764822,0.00010351647,0.0024568168,0.00007777803],"about_ca_topic_score_codex":0.000013770445,"about_ca_topic_score_gemma":9.803236e-7,"teacher_disagreement_score":0.8314961,"about_ca_system_score_codex":0.00022075542,"about_ca_system_score_gemma":0.000024612524,"threshold_uncertainty_score":0.3545053},"labels":[],"label_agreement":null},{"id":"W4361228973","doi":"10.1016/j.ejor.2023.03.021","title":"Revisiting degeneracy, strict feasibility, stability, in linear programming","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Waterloo; Natural Sciences and Engineering Research Council of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Linear programming; Mathematical optimization; Reduction (mathematics); Interior point method; Simplex; Mathematics; Feasible region; Duality (order theory); Simplex algorithm; Rank (graph theory); Stability (learning theory); Computer science; Discrete mathematics; Combinatorics","score_opus":0.34501571273221165,"score_gpt":0.4916102883578966,"score_spread":0.14659457562568495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361228973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94541234,0.00030551254,0.041307878,0.004704963,0.0002770618,0.0014090961,0.000022635284,0.00010893294,0.0064515932],"genre_scores_gemma":[0.74833214,0.00025764215,0.24870025,0.000031983698,0.001074094,0.0000121333505,0.000023086282,0.00010443187,0.0014642612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99080914,0.004574565,0.001197341,0.00031887667,0.0024664514,0.0006336197],"domain_scores_gemma":[0.99354964,0.0029395435,0.00018441913,0.00032888894,0.0027570408,0.00024043696],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03617419,0.00014175709,0.00028388007,0.0010253172,0.00030725801,0.00021440412,0.0006462524,0.000033981763,0.00031312864],"category_scores_gemma":[0.026573598,0.00012362504,0.00010305891,0.0025278474,0.00016317757,0.00052366353,0.00045687638,0.001249856,0.0001681004],"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.0030123866,0.004481122,0.15569443,0.0018968412,0.0004744902,0.014662367,0.015574365,0.21547866,0.029143138,0.08893307,0.029384466,0.44126466],"study_design_scores_gemma":[0.02705702,0.0064876853,0.22405314,0.0046136193,0.00007698393,0.0016077345,0.018798504,0.53532547,0.0175731,0.060713455,0.10007975,0.003613517],"about_ca_topic_score_codex":0.0000033134975,"about_ca_topic_score_gemma":0.0000054026987,"teacher_disagreement_score":0.43765113,"about_ca_system_score_codex":0.0003609838,"about_ca_system_score_gemma":0.00055481447,"threshold_uncertainty_score":0.9924615},"labels":[],"label_agreement":null},{"id":"W4361274478","doi":"10.1016/j.ejor.2023.03.027","title":"Remanufacturing with innovative features: A strategic analysis","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sustainable Supply Chain Management","field":"Business, Management and Accounting","cited_by":26,"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; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remanufacturing; Original equipment manufacturer; Business; Quality (philosophy); Industrial organization; Product (mathematics); Valuation (finance); Competitive advantage; Computer science; Manufacturing engineering; Marketing; Mathematics; Engineering","score_opus":0.0797880594139576,"score_gpt":0.3272528349518749,"score_spread":0.2474647755379173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361274478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8365675,0.000054996886,0.0011101449,0.007635892,0.00012041033,0.00032754432,0.0000022288482,0.0000628466,0.15411845],"genre_scores_gemma":[0.9942577,0.0000116337815,0.00039723775,0.00038510794,0.0011564209,0.0000039635997,0.000037122834,0.00003402776,0.0037168018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9971391,0.00022557282,0.00040772514,0.00022499086,0.0015917657,0.0004108776],"domain_scores_gemma":[0.9963444,0.00016265165,0.00020640915,0.00020768447,0.003050979,0.000027884122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075979573,0.00013767324,0.00020807981,0.003443597,0.00040858652,0.0009929399,0.00053375756,0.000015310989,0.00039694944],"category_scores_gemma":[0.0004506495,0.00009939789,0.00008114682,0.008223312,0.00010581018,0.0010119919,0.00028831436,0.0005513733,0.00039126602],"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.0018430626,0.00048457072,0.030436045,0.00065455213,0.0060183173,0.021254005,0.0020503255,0.41718936,0.0019837946,0.32834342,0.17962268,0.010119876],"study_design_scores_gemma":[0.0041765277,0.0005803281,0.7679237,0.0003338945,0.00044885426,0.000074260046,0.041906495,0.012868727,0.00027783532,0.007601557,0.162856,0.00095184654],"about_ca_topic_score_codex":0.000038992537,"about_ca_topic_score_gemma":0.000023255745,"teacher_disagreement_score":0.7374876,"about_ca_system_score_codex":0.00010077962,"about_ca_system_score_gemma":0.00014946487,"threshold_uncertainty_score":0.9574942},"labels":[],"label_agreement":null},{"id":"W4363650065","doi":"10.1016/j.ejor.2023.04.005","title":"Reinsurance games with two reinsurers: Tree versus chain","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University; York University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Michigan","keywords":"Reinsurance; Stackelberg competition; Mathematical economics; Tree (set theory); Nash equilibrium; Variance (accounting); Game theory; Computer science; Economics; Microeconomics; Mathematics; Actuarial science; Combinatorics","score_opus":0.1664640531260239,"score_gpt":0.3322198025326559,"score_spread":0.16575574940663199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4363650065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77138394,0.0010444014,0.001792929,0.0054169707,0.0006450766,0.00016416752,0.00006629431,0.000025371959,0.21946084],"genre_scores_gemma":[0.9915215,0.0004477483,0.0009849485,0.00006899408,0.000652485,0.0000031565332,0.000009472804,0.000039857678,0.006271832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983748,0.0002112258,0.0006522594,0.00024526715,0.00016980694,0.00034661288],"domain_scores_gemma":[0.99878705,0.00028301397,0.00022911544,0.00024429083,0.00031068793,0.00014587383],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007579172,0.00010772748,0.0002615226,0.00048708645,0.00022666914,0.00019603607,0.0004437771,0.00001840981,0.00035248077],"category_scores_gemma":[0.0005324279,0.00009705608,0.00008657839,0.0004506256,0.00015472803,0.00040865134,0.00008583446,0.00042085545,0.0013709279],"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.0014147041,0.000080135236,0.0033050543,0.00001892409,0.00021646569,0.00045113094,0.0013185646,0.016294133,0.0002386891,0.950914,0.019576209,0.006171936],"study_design_scores_gemma":[0.023327406,0.006352755,0.11010244,0.00035866338,0.000016881315,0.00029048312,0.0024692959,0.015725916,0.00071537,0.045235477,0.79413146,0.0012738843],"about_ca_topic_score_codex":0.000014965802,"about_ca_topic_score_gemma":0.0000120824925,"teacher_disagreement_score":0.9056786,"about_ca_system_score_codex":0.000104693194,"about_ca_system_score_gemma":0.00011148883,"threshold_uncertainty_score":0.99940664},"labels":[],"label_agreement":null},{"id":"W4365143788","doi":"10.1016/j.ejor.2023.04.001","title":"Risk-based allocation of COVID-19 personal protective equipment under supply shortages","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"University of Waterloo; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Personal protective equipment; Risk analysis (engineering); Health care; Business; Government (linguistics); Population; Supply chain; Procurement; Risk of infection; Computer science; Operations research; Actuarial science; Operations management; Economics; Disease; Medicine; Coronavirus disease 2019 (COVID-19); Environmental health; Marketing; Economic growth; Engineering; Infectious disease (medical specialty)","score_opus":0.5090305287309835,"score_gpt":0.5242321857592195,"score_spread":0.015201657028235949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365143788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83227193,0.00037362092,0.1000113,0.063411854,0.00016885738,0.0013738731,0.00012395621,0.00007795521,0.0021866604],"genre_scores_gemma":[0.99490756,0.00012372524,0.0038263407,0.00042434994,0.00024258366,0.000021611435,0.000011709309,0.000026568217,0.00041553364],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9924517,0.004395327,0.0008403213,0.00025393744,0.0017094474,0.00034924233],"domain_scores_gemma":[0.98948365,0.008257602,0.00035817942,0.00017113784,0.0014785785,0.00025086166],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.023836454,0.00014480238,0.00033332905,0.00042784578,0.0004685772,0.000055626893,0.0004184812,0.000036222118,0.0004885927],"category_scores_gemma":[0.043510817,0.00010441153,0.00016794549,0.0006441988,0.0003374176,0.00012468132,0.00021318298,0.000703449,0.00008948064],"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.0049657174,0.003229328,0.107805,0.0018651492,0.0025156692,0.0015812189,0.0198505,0.18656722,0.04922975,0.17548068,0.43326193,0.013647839],"study_design_scores_gemma":[0.0071134646,0.0072691874,0.75516737,0.00071531866,0.00016851997,0.00008417361,0.009389261,0.030148074,0.005188169,0.15199682,0.031794004,0.00096564577],"about_ca_topic_score_codex":0.000040828858,"about_ca_topic_score_gemma":0.000019630063,"teacher_disagreement_score":0.64736235,"about_ca_system_score_codex":0.00045145807,"about_ca_system_score_gemma":0.0009671582,"threshold_uncertainty_score":0.9645461},"labels":[],"label_agreement":null},{"id":"W4366525242","doi":"10.1016/j.ejor.2023.03.032","title":"Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: The case study of COVID-19","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"COVID-19 epidemiological studies","field":"Mathematics","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":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Vaccination; Solver; Mathematical optimization; Computer science; Pandemic; Lethality; Epidemic model; Medicine; Coronavirus disease 2019 (COVID-19); Mathematics; Immunology; Infectious disease (medical specialty); Environmental health; Biology; Population","score_opus":0.37814642483806876,"score_gpt":0.5073816017569092,"score_spread":0.1292351769188404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366525242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929171,0.00020591133,0.003906475,0.002317942,0.000022287535,0.0005560607,0.00003547352,0.0000120635,0.000026683354],"genre_scores_gemma":[0.9987265,0.00017792855,0.00085537875,0.00004023181,0.000054004453,0.00000830908,0.0000072549255,0.00001618538,0.00011422734],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9946238,0.0033740234,0.0008256114,0.00019787079,0.00074975623,0.00022895707],"domain_scores_gemma":[0.991254,0.007203317,0.00029203427,0.00021708022,0.0008858609,0.00014775792],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.014502318,0.0001277903,0.00040011,0.00014982982,0.00044881372,0.00004822358,0.00030080994,0.00002074803,0.000022283228],"category_scores_gemma":[0.019093499,0.00006812029,0.00006422685,0.0005424488,0.00027055157,0.00010579191,0.0003440879,0.0004243216,0.0000035008754],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017030478,0.016965758,0.4033123,0.006224515,0.0065486366,0.1747604,0.14634655,0.036570396,0.022486404,0.09329816,0.05459334,0.021863058],"study_design_scores_gemma":[0.01654152,0.007721307,0.88596743,0.00035346847,0.0002307083,0.0032330805,0.06072641,0.01515149,0.000060004466,0.008258751,0.0013187806,0.00043703816],"about_ca_topic_score_codex":0.00010536784,"about_ca_topic_score_gemma":0.0003171179,"teacher_disagreement_score":0.48265514,"about_ca_system_score_codex":0.00010666559,"about_ca_system_score_gemma":0.00016906687,"threshold_uncertainty_score":0.9891691},"labels":[],"label_agreement":null},{"id":"W4366813960","doi":"10.1016/j.ejor.2023.04.016","title":"Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Hydro-Québec; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Heuristics; Bottleneck; Computer science; Mathematical optimization; Truck; Context (archaeology); Operations research; Shortest path problem; Simulated annealing; Mathematics; Theoretical computer science; Graph; Engineering","score_opus":0.1523891100965274,"score_gpt":0.3881574141298987,"score_spread":0.2357683040333713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366813960","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.28186813,0.0002407446,0.6560927,0.0034539194,0.0006789002,0.0017347619,0.00009629726,0.0009605095,0.054874014],"genre_scores_gemma":[0.6500728,0.00006389985,0.34857187,0.000022171791,0.00018980463,0.0000057670322,0.000012038276,0.00008333159,0.0009783107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99597394,0.0012946536,0.0007984273,0.00024528187,0.0011445095,0.00054319156],"domain_scores_gemma":[0.997997,0.0003783317,0.0001244919,0.00022246553,0.0010097516,0.0002679795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0087409895,0.00019009228,0.00027200536,0.00077275623,0.0004301161,0.00037587955,0.00041215506,0.000024239725,0.0003896711],"category_scores_gemma":[0.0006377687,0.00016478245,0.00007554143,0.001047398,0.00020370065,0.0003260525,0.00011727859,0.0008571065,0.00016374944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009034594,0.00011392794,0.006619207,0.00011586799,0.00023383209,0.0013399798,0.0023815362,0.9063303,0.06783058,0.0005206637,0.0044847713,0.009939009],"study_design_scores_gemma":[0.003535887,0.00037066158,0.07960312,0.00054011244,0.000020188512,0.00046527304,0.0010384425,0.9088602,0.0021610835,0.0000071126756,0.0029945292,0.00040339128],"about_ca_topic_score_codex":0.000004870917,"about_ca_topic_score_gemma":0.000014537635,"teacher_disagreement_score":0.36820465,"about_ca_system_score_codex":0.0002608817,"about_ca_system_score_gemma":0.00023786948,"threshold_uncertainty_score":0.67196333},"labels":[],"label_agreement":null},{"id":"W4367172050","doi":"10.1016/j.ejor.2023.04.031","title":"Strategic blockchain adoption to deter deceptive counterfeiters","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":90,"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; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Quality (philosophy); Business; Product (mathematics); Computer security; Marketing; Internet privacy; Commerce; Computer science; Risk analysis (engineering); Industrial organization","score_opus":0.0959887699775385,"score_gpt":0.3563314563260558,"score_spread":0.2603426863485173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367172050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8672107,0.00005807844,0.112123944,0.01517554,0.00017294659,0.00023247337,0.0000052395176,0.00008318734,0.0049379296],"genre_scores_gemma":[0.98699296,0.000025366899,0.012170698,0.00026985334,0.00016546811,0.000007874835,0.000002074329,0.000011170608,0.00035450986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977249,0.00060172117,0.00036224103,0.00022788635,0.0007859574,0.00029730125],"domain_scores_gemma":[0.9981963,0.00019154353,0.00007038036,0.00030586906,0.0010730374,0.00016284738],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0056787464,0.00008500705,0.00010874232,0.0007413169,0.0003139459,0.00023893686,0.001210694,0.00002972125,0.000041752977],"category_scores_gemma":[0.00017349867,0.00007274455,0.00005335565,0.0014271672,0.000092665316,0.00015333774,0.0003360682,0.00050948723,0.0009094964],"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.0001533447,0.00039076325,0.00066717074,0.00002281308,0.00013596703,0.0011425135,0.006695156,0.0153727075,0.054682765,0.79263705,0.059101917,0.06899782],"study_design_scores_gemma":[0.006699175,0.012130298,0.113054916,0.00073540234,0.0000359433,0.0023596515,0.009467635,0.49599144,0.023378618,0.10019949,0.23359343,0.0023540198],"about_ca_topic_score_codex":0.0000018749495,"about_ca_topic_score_gemma":0.0000028812904,"teacher_disagreement_score":0.6924376,"about_ca_system_score_codex":0.00007619833,"about_ca_system_score_gemma":0.0001743587,"threshold_uncertainty_score":0.9998684},"labels":[],"label_agreement":null},{"id":"W4367692299","doi":"10.1016/j.ejor.2023.04.045","title":"Weather rebate contracts for different risk attitudes of supply chain members","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CVAR; Supply chain; Business; Downside risk; Risk neutral; Risk management; Extreme weather; Pareto principle; Risk aversion (psychology); Expected utility hypothesis; Microeconomics; Environmental economics; Risk analysis (engineering); Expected shortfall; Marketing; Economics; Operations management; Climate change; Finance; Financial economics","score_opus":0.09784317813104515,"score_gpt":0.33772111680214445,"score_spread":0.2398779386710993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367692299","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965432,0.00015559209,0.00054631557,0.005042607,0.00059187657,0.00057725725,0.000019893818,0.00002833251,0.027606133],"genre_scores_gemma":[0.99414504,0.00014325422,0.00017109208,0.00025907415,0.001529397,0.0000084253315,0.000028840754,0.000037910584,0.0036769463],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780077,0.00022531547,0.00053376035,0.00016249758,0.00096513587,0.00031253314],"domain_scores_gemma":[0.99824554,0.00030500896,0.0002694031,0.00015536655,0.0009903417,0.00003433755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074241776,0.00011761124,0.00020705718,0.0006816468,0.00025795875,0.0002552992,0.00043121818,0.000016927632,0.0007327836],"category_scores_gemma":[0.0010785398,0.00008893543,0.00014579219,0.00040193196,0.000101590056,0.0005052017,0.00018589993,0.00025969022,0.00019957297],"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.0017072312,0.0011747599,0.10483503,0.0007837369,0.0009236842,0.00039009392,0.00089522835,0.013268534,0.014204776,0.11383974,0.7215073,0.02646985],"study_design_scores_gemma":[0.004068047,0.00040698345,0.42280725,0.00036889597,0.000069245456,0.0000055690703,0.001026922,0.015107017,0.0006896869,0.0016435703,0.55349505,0.00031176396],"about_ca_topic_score_codex":0.000026496975,"about_ca_topic_score_gemma":0.0000143405405,"teacher_disagreement_score":0.3179722,"about_ca_system_score_codex":0.000043441618,"about_ca_system_score_gemma":0.00004053871,"threshold_uncertainty_score":0.80234665},"labels":[],"label_agreement":null},{"id":"W4376139275","doi":"10.1016/j.ejor.2023.05.013","title":"Price and quality competition while envisioning a quality-related product recall","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quality (philosophy); Product (mathematics); Recall; Competition (biology); Microeconomics; Business; Marketing; Economics; Industrial organization; Psychology","score_opus":0.1951399796858696,"score_gpt":0.39245442631980043,"score_spread":0.19731444663393083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376139275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553734,0.00018324224,0.000105923566,0.0043790755,0.0002060324,0.00015124443,0.0000022319487,0.00003417214,0.039564688],"genre_scores_gemma":[0.9974245,0.00008373287,0.00020342472,0.00014796574,0.0006460748,0.000001543343,0.000026955462,0.000021940728,0.0014438941],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9970485,0.0008617741,0.0006578282,0.00020949326,0.00097268616,0.00024974387],"domain_scores_gemma":[0.9980085,0.00049835944,0.00021140609,0.0001438562,0.001102127,0.00003577102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02294687,0.000095699565,0.00016990646,0.00056796044,0.0005159945,0.000579224,0.0002341232,0.000016601658,0.0005438442],"category_scores_gemma":[0.0024042514,0.00008186948,0.00005560808,0.000907527,0.000098471166,0.0009107328,0.00027072194,0.00054025464,0.00039359485],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014612862,0.00071608275,0.34331736,0.001006071,0.00029907632,0.0009996367,0.0029161484,0.0013112634,0.16076124,0.18302862,0.03914496,0.26503825],"study_design_scores_gemma":[0.0007752647,0.000037570215,0.91772133,0.00018688594,0.000012635319,0.000024032615,0.00037785503,0.00051519624,0.000059380105,0.00039186864,0.07973774,0.00016024108],"about_ca_topic_score_codex":0.00005992423,"about_ca_topic_score_gemma":0.00000869997,"teacher_disagreement_score":0.57440394,"about_ca_system_score_codex":0.000027952326,"about_ca_system_score_gemma":0.00007104674,"threshold_uncertainty_score":0.7952973},"labels":[],"label_agreement":null},{"id":"W4376287582","doi":"10.1016/j.ejor.2023.05.011","title":"Co-opetition or decentralization? A study of manufacturers’ sourcing and distribution strategies","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","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":"Dalhousie University; Wilfrid Laurier University","funders":"Southwestern University of Finance and Economics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Decentralization; Business; Strategic sourcing; Distribution (mathematics); Industrial organization; Insourcing; Process management; Operations management; Operations research; Computer science; Marketing; Strategic planning; Outsourcing; Economics; Mathematics; Strategic financial management","score_opus":0.10765079744909214,"score_gpt":0.36138448178057364,"score_spread":0.25373368433148147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376287582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99133074,0.000019211811,0.0020811432,0.0008984998,0.000083992585,0.00018781661,0.0000039280158,0.000015754456,0.0053789257],"genre_scores_gemma":[0.9991978,0.000027528138,0.000027457554,0.00005661358,0.0004727559,0.0000016475547,0.00011492917,0.000013061249,0.000088223176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998545,0.00015494048,0.0004386948,0.00011510443,0.00058886065,0.00015743705],"domain_scores_gemma":[0.9981591,0.000075403244,0.00020651773,0.00007266468,0.0014727449,0.00001358813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030045356,0.00007950439,0.00011937102,0.0004257328,0.0003288001,0.00052696257,0.0001444616,0.000017816428,0.00017692192],"category_scores_gemma":[0.00034942143,0.000059595448,0.00001971683,0.0009825809,0.0000738454,0.0016797503,0.000048301175,0.00020667221,0.000042258045],"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.0039808745,0.0027699326,0.1109512,0.0014148602,0.00048182192,0.0011891697,0.0040693874,0.06658576,0.034667984,0.64983416,0.11142418,0.012630702],"study_design_scores_gemma":[0.0031170577,0.0005859242,0.94268,0.0002520271,0.000039686205,0.00004203979,0.0187883,0.0050600255,0.0006412426,0.0031379662,0.025407605,0.0002481337],"about_ca_topic_score_codex":0.000025982308,"about_ca_topic_score_gemma":0.000011530176,"teacher_disagreement_score":0.8317288,"about_ca_system_score_codex":0.000022157908,"about_ca_system_score_gemma":0.00009332321,"threshold_uncertainty_score":0.50815123},"labels":[],"label_agreement":null},{"id":"W4378190962","doi":"10.1016/j.ejor.2023.05.026","title":"First-party content decision under competitive hardware/software platforms: Free vs. charge","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Monopolistic competition; Nash equilibrium; Duopoly; Computer science; Profit (economics); Software; Charge (physics); Dilemma; Microeconomics; Business; Economics; Operating system; Monopoly; Physics","score_opus":0.1435779629294998,"score_gpt":0.3003026953282514,"score_spread":0.15672473239875157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378190962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95765793,0.000050368933,0.0009502626,0.0021210522,0.00058092544,0.00019571143,0.000025520952,0.000044298693,0.038373902],"genre_scores_gemma":[0.99388987,0.00007395161,0.0005613871,0.0011208493,0.0018423088,0.00000308159,0.00008550508,0.000051752882,0.0023712805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978973,0.0000096122885,0.00059704354,0.00020064627,0.00089634967,0.00039904276],"domain_scores_gemma":[0.99795157,0.0003367217,0.00018401323,0.00021243238,0.0012538618,0.00006142406],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0036832632,0.00014298747,0.00022059045,0.00059821014,0.00059913716,0.002036726,0.00069163536,0.000026889684,0.001013889],"category_scores_gemma":[0.0016594527,0.000108594904,0.00013414335,0.0004680329,0.00012302023,0.004759664,0.00057096407,0.00041945302,0.0059414655],"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.0011771998,0.00035755304,0.0070912354,0.00012322464,0.0002094464,0.00085448805,0.0002570216,0.010222704,0.00017172415,0.5270408,0.4435676,0.008927003],"study_design_scores_gemma":[0.0055340403,0.00050772156,0.14321671,0.00078594824,0.000025113406,0.000093174756,0.0034323973,0.009148486,0.00010090718,0.051251184,0.7852293,0.0006749718],"about_ca_topic_score_codex":0.000017844408,"about_ca_topic_score_gemma":0.000044750228,"teacher_disagreement_score":0.4757896,"about_ca_system_score_codex":0.00009353158,"about_ca_system_score_gemma":0.000109532564,"threshold_uncertainty_score":0.9998993},"labels":[],"label_agreement":null},{"id":"W4378530332","doi":"10.1016/j.ejor.2023.05.025","title":"Distortion risk measure under parametric ambiguity","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CVAR; Distortion (music); Ambiguity; Measure (data warehouse); Mathematical optimization; Parametric statistics; Mathematics; Risk measure; Coherent risk measure; Computer science; Applied mathematics; Risk management; Expected shortfall; Data mining; Statistics","score_opus":0.3988349360587256,"score_gpt":0.49286997261592497,"score_spread":0.09403503655719936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378530332","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9042259,0.00038747583,0.065048896,0.0038057964,0.00085728115,0.00019302801,0.00002490278,0.000029569634,0.025427142],"genre_scores_gemma":[0.9926393,0.000978337,0.0008488716,0.0000530726,0.000521928,0.0000010437896,0.000009963786,0.000017759756,0.004929719],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9883558,0.0047352198,0.0009813339,0.0002517706,0.005390153,0.00028568282],"domain_scores_gemma":[0.99341774,0.0016295628,0.0003629608,0.00031592208,0.0040444583,0.0002293417],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.051362287,0.00009075821,0.00018177854,0.0016723844,0.00059448835,0.0006209621,0.0007887326,0.00003000673,0.00045859703],"category_scores_gemma":[0.021095432,0.000062263156,0.00013945739,0.004452422,0.00013563437,0.00062222336,0.00013256872,0.00065128173,0.002667974],"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.0002903781,0.00017824864,0.053050872,0.0000021579744,0.000069981324,0.00033129155,0.0007717316,0.3496725,0.00058809394,0.0036067278,0.37024578,0.22119223],"study_design_scores_gemma":[0.00072305085,0.0004147448,0.8901201,0.000022307508,0.000010683091,0.00006617233,0.00063574436,0.012473328,0.00018246994,0.008441912,0.086763605,0.00014590852],"about_ca_topic_score_codex":0.000011407152,"about_ca_topic_score_gemma":0.000005761816,"teacher_disagreement_score":0.8370692,"about_ca_system_score_codex":0.000097496944,"about_ca_system_score_gemma":0.00035888777,"threshold_uncertainty_score":0.99810857},"labels":[],"label_agreement":null},{"id":"W4379618761","doi":"10.1016/j.ejor.2023.06.003","title":"Risk budgeting portfolios from simulations","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Portfolio; Computer science; Stochastic gradient descent; Portfolio optimization; Asset (computer security); Econometrics; Expected shortfall; Distortion (music); Project portfolio management; Asset allocation; Mathematical optimization; Finance; Economics; Mathematics; Machine learning; Project management","score_opus":0.25663820760260064,"score_gpt":0.4776061459422727,"score_spread":0.22096793833967204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379618761","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603494,0.00016074556,0.012505555,0.0025448357,0.0005045597,0.0001313661,0.00009976011,0.00002441149,0.023679359],"genre_scores_gemma":[0.99135524,0.0005080955,0.0032749735,0.00006632685,0.0010294531,5.708665e-7,0.000037957107,0.000022268103,0.00370511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9911782,0.003311689,0.0011602239,0.00025500494,0.003813202,0.00028169443],"domain_scores_gemma":[0.99161685,0.0039657354,0.00040630417,0.00032129473,0.003471289,0.00021853566],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.025466872,0.000092062015,0.00018511483,0.0012060493,0.000753725,0.00070631347,0.0008382743,0.000026129106,0.0015509512],"category_scores_gemma":[0.021322286,0.000066516164,0.000120837656,0.0023968061,0.00011196331,0.0006702632,0.0001860219,0.0005817282,0.002909701],"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.00011335905,0.00007444665,0.07663373,5.926122e-7,0.000058826998,0.00045327345,0.0016457854,0.6574943,0.0020985892,0.001361524,0.18994354,0.07012205],"study_design_scores_gemma":[0.0010495887,0.0002966157,0.5740465,0.00003962251,0.000015519441,0.000037300004,0.0013425326,0.15143839,0.0004196008,0.015039725,0.2560611,0.00021350803],"about_ca_topic_score_codex":0.000021567272,"about_ca_topic_score_gemma":0.000006345645,"teacher_disagreement_score":0.5060559,"about_ca_system_score_codex":0.00003839286,"about_ca_system_score_gemma":0.00030937043,"threshold_uncertainty_score":0.99936175},"labels":[],"label_agreement":null},{"id":"W4380741948","doi":"10.1016/j.ejor.2023.05.038","title":"Fifty years of operational research: 1972–2022","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"HEC Montréal; Canada Research Chairs","keywords":"Medal; Operations research; Ceremony; Vehicle routing problem; Gold medal; Routing (electronic design automation); Work (physics); Presentation (obstetrics); Engineering management; Computer science; Seriation (archaeology); Operations management; Engineering; History; Computer network","score_opus":0.21609100974847759,"score_gpt":0.43141629121043973,"score_spread":0.21532528146196214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380741948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9433625,0.0007490151,0.014940215,0.003012891,0.0009356153,0.00045865975,0.00007742746,0.0001430434,0.03632063],"genre_scores_gemma":[0.9716316,0.00047397873,0.024542052,0.00003442347,0.0008147231,0.0000049485766,0.00003585223,0.00008896837,0.0023734658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9929827,0.0030357526,0.0007780364,0.00017835718,0.0025703984,0.00045477328],"domain_scores_gemma":[0.9958109,0.0013536396,0.00006354701,0.00025166906,0.0023181052,0.00020212399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026448013,0.000105926374,0.00020827493,0.0011941683,0.00027119138,0.00017155311,0.000646181,0.000041499923,0.0007186545],"category_scores_gemma":[0.00396868,0.000107559346,0.00009189303,0.001991104,0.00021510648,0.00035374783,0.00020613916,0.0012072404,0.00046055234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075061835,0.00007537558,0.00074707007,0.0000600004,0.00011092902,0.00035520206,0.0015632539,0.8361855,0.04954631,0.0051937,0.0914285,0.014659068],"study_design_scores_gemma":[0.0039155795,0.0015743435,0.17812864,0.0006342117,0.000023102535,0.0003718857,0.0020597116,0.57709134,0.019367779,0.0012149595,0.21482268,0.00079575094],"about_ca_topic_score_codex":0.0000037457405,"about_ca_topic_score_gemma":0.0000011932638,"teacher_disagreement_score":0.25909418,"about_ca_system_score_codex":0.00013958913,"about_ca_system_score_gemma":0.00038428762,"threshold_uncertainty_score":0.91664064},"labels":[],"label_agreement":null},{"id":"W4382518203","doi":"10.1016/j.ejor.2023.06.020","title":"Optimal pricing and donation policy for fresh goods","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":36,"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":"Donation; Expiration date; Newsvendor model; Quality (philosophy); Business; Economic shortage; Marketing; Economics; Microeconomics; Supply chain; Government (linguistics)","score_opus":0.11725848823505763,"score_gpt":0.36309323510626856,"score_spread":0.24583474687121093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382518203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85155004,0.0001898412,0.005604273,0.040682565,0.00062512164,0.0007221086,0.0000071573213,0.00006443556,0.10055444],"genre_scores_gemma":[0.9909084,0.000054073913,0.0010763293,0.0008207408,0.004620485,0.0000058042892,0.000025029996,0.000028651013,0.0024605093],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865156,0.00008482609,0.00028930214,0.00012332019,0.000620399,0.00023058856],"domain_scores_gemma":[0.99904853,0.00013330768,0.00009359913,0.0000741622,0.0006265136,0.000023885497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058152946,0.00007052724,0.00009003347,0.0009928301,0.00034936567,0.00050846103,0.0002213461,0.000011219064,0.000114940034],"category_scores_gemma":[0.0010697648,0.000059977392,0.00004722112,0.00063998543,0.000058231617,0.00077102886,0.00020076697,0.00016126026,0.00013612278],"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.00032215723,0.000146123,0.0039498154,0.0003184319,0.00013458784,0.00017681457,0.00061156374,0.013158756,0.0059285234,0.41606468,0.5209013,0.038287204],"study_design_scores_gemma":[0.001709638,0.00017611745,0.045164686,0.00010432338,0.00001409294,0.000011844333,0.0012256565,0.03890989,0.0001161101,0.00197708,0.91041905,0.00017154214],"about_ca_topic_score_codex":0.000014898738,"about_ca_topic_score_gemma":0.0000024357923,"teacher_disagreement_score":0.41408762,"about_ca_system_score_codex":0.000046959503,"about_ca_system_score_gemma":0.00006216787,"threshold_uncertainty_score":0.49031016},"labels":[],"label_agreement":null},{"id":"W4385076334","doi":"10.1016/j.ejor.2023.07.026","title":"A linear programming approach to difference-of-convex piecewise linear approximation","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Piecewise linear function; Polytope; Mathematical optimization; Linear programming; Mathematics; Bottleneck; Linear approximation; Approximation algorithm; Approximation error; Dimension (graph theory); Algorithm; Computer science; Discrete mathematics; Nonlinear system; Combinatorics","score_opus":0.2509848535530079,"score_gpt":0.4458775540522877,"score_spread":0.19489270049927976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385076334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07665802,0.000077766796,0.9059391,0.0019255332,0.00016870532,0.0014299764,0.000026164236,0.000092238115,0.013682476],"genre_scores_gemma":[0.2095851,0.000077544064,0.7841766,0.000038731,0.00070537906,0.00003361104,0.00004236516,0.00010501716,0.005235653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941997,0.0014038514,0.0010120191,0.00028266312,0.00259378,0.00050801015],"domain_scores_gemma":[0.99460423,0.0009210669,0.00023373717,0.00032804027,0.0035722018,0.00034070367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009447556,0.00016480288,0.0003457981,0.0011766771,0.00028188535,0.00011906307,0.0007326332,0.000043248347,0.00009162281],"category_scores_gemma":[0.008192792,0.00013550898,0.00011628615,0.002163695,0.00017696831,0.00030259136,0.00032367688,0.00082682463,0.00021816781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020979368,0.0055089896,0.0013682408,0.0020053613,0.0008140601,0.00079517235,0.028785914,0.45454544,0.035568323,0.13371438,0.036719806,0.29807636],"study_design_scores_gemma":[0.004732916,0.0029900395,0.0039558685,0.000808607,0.00004277897,0.00027253406,0.0047712037,0.9383975,0.008258068,0.009143768,0.025759058,0.00086760736],"about_ca_topic_score_codex":0.0000015521609,"about_ca_topic_score_gemma":3.6128046e-7,"teacher_disagreement_score":0.48385212,"about_ca_system_score_codex":0.00011235226,"about_ca_system_score_gemma":0.00039332334,"threshold_uncertainty_score":0.9808129},"labels":[],"label_agreement":null},{"id":"W4385597561","doi":"10.1016/j.ejor.2023.08.003","title":"Stochastic search for a parametric cost function approximation: Energy storage with rolling forecasts","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Benchmark (surveying); Computer science; Mathematical optimization; Stochastic approximation; Variance (accounting); Function (biology); Parametric statistics; Convergence (economics); Variance reduction; Stochastic modelling; Stochastic optimization; Mathematics; Statistics; Key (lock)","score_opus":0.08872406472949086,"score_gpt":0.30476245359214615,"score_spread":0.2160383888626553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385597561","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.15263306,0.00029630357,0.8419102,0.00017143709,0.000361597,0.00022519818,0.000015740296,0.00007601522,0.0043104407],"genre_scores_gemma":[0.9961775,0.00003846585,0.0022814192,0.000016180531,0.0008103708,0.000019102874,0.000049064096,0.00006690341,0.0005410121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979073,0.00027159727,0.0003775031,0.0001416512,0.00090857985,0.00039341676],"domain_scores_gemma":[0.9981321,0.0006514798,0.000047788755,0.00011333858,0.0008919307,0.00016333196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003790164,0.00012259823,0.0001567029,0.0009117847,0.0003104998,0.00020414506,0.00022059066,0.00002650202,0.000043012562],"category_scores_gemma":[0.0002455958,0.000099708624,0.00006490399,0.0013598761,0.000052405052,0.0003247682,0.00003587808,0.00040478355,0.00003800067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018251472,0.00001740637,0.000025185456,0.00003487321,0.00006490883,0.000052073523,0.00020636748,0.97285384,0.0007743076,0.0022239478,0.0021894102,0.021375144],"study_design_scores_gemma":[0.0011834153,0.0008756756,0.0006811597,0.00017932609,0.0000128095935,0.00011778494,0.00022888507,0.9862592,0.0008688026,0.000104854706,0.009320768,0.0001672853],"about_ca_topic_score_codex":0.0000018612659,"about_ca_topic_score_gemma":0.0000028305562,"teacher_disagreement_score":0.8435444,"about_ca_system_score_codex":0.00010807476,"about_ca_system_score_gemma":0.00013508598,"threshold_uncertainty_score":0.40659997},"labels":[],"label_agreement":null},{"id":"W4386024753","doi":"10.1016/j.ejor.2023.08.028","title":"Across-time risk-aware strategies for outperforming a benchmark","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stylized fact; Benchmark (surveying); Investment strategy; Time horizon; Computer science; Portfolio; Mathematical optimization; Asset allocation; Dynamic programming; Econometrics; Economics; Mathematics; Finance; Market liquidity","score_opus":0.13483838482783475,"score_gpt":0.35300099697027537,"score_spread":0.21816261214244062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386024753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9062003,0.00072453014,0.0024238136,0.0017803233,0.00051533006,0.0003521621,0.00046031905,0.000027290213,0.08751597],"genre_scores_gemma":[0.99356055,0.00045668843,0.00094514625,0.0000769348,0.0007376996,0.00000978747,0.00003556428,0.000035199166,0.004142452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981899,0.00016526926,0.0007863867,0.00021692229,0.00019656471,0.00044491954],"domain_scores_gemma":[0.9986378,0.00032238167,0.0002985125,0.00015210822,0.00048120218,0.00010797367],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.010737291,0.0001139203,0.0002592784,0.00036243076,0.0006610608,0.000587144,0.00040451248,0.000031464893,0.00047208043],"category_scores_gemma":[0.0011022091,0.00010639458,0.00014906091,0.00044208302,0.00013831802,0.0008533451,0.00009847096,0.00038497325,0.0011204926],"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.0005123146,0.00022299995,0.013991646,0.00014280762,0.00025810374,0.00019554813,0.0050551975,0.0055228816,0.0008852507,0.7657236,0.19794506,0.009544572],"study_design_scores_gemma":[0.0031710656,0.0029181507,0.27257827,0.00019774733,0.000009552515,0.000049054295,0.005440927,0.023541829,0.00015719917,0.13218889,0.5590845,0.00066282693],"about_ca_topic_score_codex":0.00001653806,"about_ca_topic_score_gemma":0.0000028478808,"teacher_disagreement_score":0.6335347,"about_ca_system_score_codex":0.00007236723,"about_ca_system_score_gemma":0.0002022488,"threshold_uncertainty_score":0.9996573},"labels":[],"label_agreement":null},{"id":"W4386170118","doi":"10.1016/j.ejor.2023.08.036","title":"Adaptive robust optimization for lot-sizing under yield uncertainty","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Robust optimization; Sizing; Computer science; Exploit; Set (abstract data type); Production (economics); Constraint (computer-aided design); Quadratic equation; Holding cost; Mathematics; Economics","score_opus":0.2622658101772879,"score_gpt":0.34095702142688816,"score_spread":0.07869121124960027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386170118","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.08458282,0.00048847275,0.5840241,0.04906483,0.0037988394,0.002641522,0.0000270181,0.0002773456,0.27509508],"genre_scores_gemma":[0.98668784,0.000049723687,0.003589672,0.0016601728,0.004123398,0.000012702198,0.00006577992,0.000058085145,0.0037526125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819636,0.00011910139,0.0003902332,0.00017198086,0.0008187591,0.00030358988],"domain_scores_gemma":[0.99804395,0.00026889914,0.00014239392,0.00011592083,0.0014003763,0.000028459375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059725996,0.000101565456,0.00012474353,0.000716023,0.00044866052,0.00050144485,0.00036268952,0.000018031313,0.00085246185],"category_scores_gemma":[0.0009194209,0.000086720574,0.00009440348,0.0007415788,0.00006761109,0.00091282325,0.00019406002,0.00024285585,0.00033425793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013282179,0.00004165027,0.000087508175,0.00003188253,0.00004369953,0.000036498852,0.000059208276,0.84078395,0.00014496599,0.033533033,0.1232326,0.0018722098],"study_design_scores_gemma":[0.0012772309,0.00019766757,0.0023130216,0.00018615012,0.000024305846,0.000005262306,0.003465967,0.85216993,0.00003230259,0.001497646,0.13861111,0.00021939882],"about_ca_topic_score_codex":0.000016702643,"about_ca_topic_score_gemma":0.000007826517,"teacher_disagreement_score":0.90210503,"about_ca_system_score_codex":0.00008400217,"about_ca_system_score_gemma":0.00007678113,"threshold_uncertainty_score":0.93338597},"labels":[],"label_agreement":null},{"id":"W4386588266","doi":"10.1016/j.ejor.2023.09.003","title":"Capacity planning with uncertainty on contract fulfillment","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","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; Université du Québec à Montréal","funders":"","keywords":"Capacity planning; Computer science; Capacity management; Operations research; Space (punctuation); Set (abstract data type); Variable (mathematics); Capacity optimization; Metaheuristic; Business; Engineering","score_opus":0.18703111863228788,"score_gpt":0.31914695755050476,"score_spread":0.13211583891821688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386588266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.921919,0.00014075117,0.0068489187,0.0007518763,0.00030112584,0.00014537248,0.000036647118,0.00008180877,0.06977452],"genre_scores_gemma":[0.9987814,0.000045546334,0.0005192161,0.000041294094,0.00032073428,9.935931e-7,0.000012867671,0.00002595035,0.00025203233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9984606,0.0001770779,0.00025264444,0.000079220394,0.0007910032,0.0002394338],"domain_scores_gemma":[0.9992151,0.00021488256,0.000022655366,0.00009199892,0.0003222372,0.0001330865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020573714,0.00008397506,0.00011186096,0.00022979667,0.00012732492,0.000073725125,0.0001811531,0.000013885318,0.00012251244],"category_scores_gemma":[0.00009472036,0.000059029328,0.000034014858,0.00026780536,0.0000819745,0.00008800726,0.000008906695,0.00058661104,0.00018727004],"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.0001697085,0.0000420534,0.0018881393,0.000019654528,0.000095991316,0.0019458618,0.0005843226,0.96310776,0.003218413,0.004126846,0.02359263,0.0012086001],"study_design_scores_gemma":[0.005483476,0.0049025775,0.6221168,0.0010028945,0.000041980806,0.00045263726,0.00067793566,0.1407725,0.0053121983,0.0003952887,0.21799451,0.0008471951],"about_ca_topic_score_codex":0.0000017391635,"about_ca_topic_score_gemma":0.0000016884386,"teacher_disagreement_score":0.82233524,"about_ca_system_score_codex":0.0000817846,"about_ca_system_score_gemma":0.000060853003,"threshold_uncertainty_score":0.25485656},"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":"W4387035833","doi":"10.1016/j.ejor.2023.09.032","title":"Efficient solution approaches for the bi-criteria <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si331.svg\" display=\"inline\" id=\"d1e2421\"><mml:mi>p</mml:mi></mml:math>-hub median and dispersion problem","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"McMaster University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pareto principle; Mathematical optimization; Algorithm; Computer science","score_opus":0.08180034375875408,"score_gpt":0.2968840408163456,"score_spread":0.21508369705759153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387035833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848621,0.00016451058,0.0025457419,0.009507106,0.00046195503,0.00014994114,0.0000166794,0.00002896826,0.0022630217],"genre_scores_gemma":[0.99727,0.00017093867,0.00061092176,0.00029960246,0.001088139,0.000045625595,0.00015077127,0.000039824892,0.0003242093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786395,0.0001147291,0.00046565256,0.00025594936,0.00094939524,0.00035034816],"domain_scores_gemma":[0.9991584,0.00016003777,0.00012821505,0.00022072195,0.0002747484,0.000057881873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045618596,0.00012932636,0.000090417445,0.00024173352,0.0009358023,0.0006153561,0.000398084,0.00004535865,0.00008316059],"category_scores_gemma":[0.00060098816,0.000109428474,0.00012349438,0.000398208,0.00018423912,0.0004393888,0.00043364373,0.00028988218,0.00067418936],"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.00017748307,0.000096680305,0.000013547582,0.00026587117,0.0000784182,0.000029280034,0.00042792252,0.017803842,0.000783652,0.96573645,0.010008369,0.0045784595],"study_design_scores_gemma":[0.00041791255,0.00010118572,0.0011507273,0.000108748485,0.00003801672,0.000012959569,0.0010040458,0.9702912,0.00006304599,0.00011601255,0.026590746,0.00010541028],"about_ca_topic_score_codex":0.00008442582,"about_ca_topic_score_gemma":0.00006977375,"teacher_disagreement_score":0.96562046,"about_ca_system_score_codex":0.000015877004,"about_ca_system_score_gemma":0.00009910826,"threshold_uncertainty_score":0.86655647},"labels":[],"label_agreement":null},{"id":"W4387087085","doi":"10.1016/j.ejor.2023.09.031","title":"Multi-attribute two-echelon location routing: Formulation and dynamic discretization discovery approach","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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é de Montréal; Transport Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Vehicle routing problem; Transshipment (information security); Routing (electronic design automation); Discretization; Integer programming; Operations research; Synchronization (alternating current); Job shop scheduling; Mathematical optimization; Distributed computing; Computer network; Mathematics; Algorithm","score_opus":0.08653340626897581,"score_gpt":0.37327542406983916,"score_spread":0.28674201780086334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387087085","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.18863913,0.00012202173,0.8100187,0.00027753922,0.00012554579,0.00017415725,0.0000074400573,0.00007482161,0.000560649],"genre_scores_gemma":[0.9356446,0.00016186232,0.06338884,0.000010917297,0.00016281962,0.0000031426425,0.00013193804,0.000054394026,0.00044146914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974211,0.00091001857,0.0005321621,0.00016808964,0.00070180907,0.00026680832],"domain_scores_gemma":[0.9986369,0.00025799978,0.000089435365,0.00013755144,0.00077186077,0.00010623472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071685174,0.000121481564,0.00014639151,0.0005018003,0.00027642053,0.00034875053,0.00019360977,0.000032512056,0.000007833151],"category_scores_gemma":[0.0011116304,0.00011246805,0.000038245187,0.0010717505,0.00005386738,0.000928299,0.00008436441,0.00044367605,0.000030208781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015063598,0.000024102737,0.0020792175,0.0000428093,0.000027028667,0.0000105247755,0.00057902705,0.97991914,0.013177967,0.00091797503,0.00021099996,0.0029961688],"study_design_scores_gemma":[0.0007049279,0.000054386353,0.074018046,0.00006437997,0.0000069031407,0.000036250574,0.00025712585,0.92419124,0.0004175746,0.000028107632,0.00011123245,0.000109834684],"about_ca_topic_score_codex":0.0000017270006,"about_ca_topic_score_gemma":0.0000010880018,"teacher_disagreement_score":0.74700546,"about_ca_system_score_codex":0.00016105406,"about_ca_system_score_gemma":0.00008413047,"threshold_uncertainty_score":0.4586314},"labels":[],"label_agreement":null},{"id":"W4388736371","doi":"10.1016/j.ejor.2023.11.016","title":"Column generation-based prototype learning for optimizing area under the receiver operating characteristic curve","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Imbalanced Data Classification Techniques","field":"Computer Science","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":"McMaster University","funders":"","keywords":"Overfitting; Ranking (information retrieval); Computer science; Maximization; Receiver operating characteristic; Artificial intelligence; Machine learning; Feature selection; Binary classification; Support vector machine; Metric (unit); Pattern recognition (psychology); Mathematics; Mathematical optimization; Artificial neural network","score_opus":0.21545877449864434,"score_gpt":0.3905772167184525,"score_spread":0.17511844221980818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388736371","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.0139646055,0.000036555084,0.9740354,0.0102414545,0.00019662632,0.0007900828,0.000009104098,0.00008445701,0.00064171344],"genre_scores_gemma":[0.9004883,0.00004253932,0.09703312,0.00047403996,0.00063495967,0.00012311913,0.000095839736,0.00003753903,0.0010705345],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963243,0.00164311,0.0005350103,0.00026463676,0.00091934716,0.00031356633],"domain_scores_gemma":[0.9962502,0.0009654693,0.00020699823,0.000333215,0.0021535861,0.00009049768],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.010727248,0.00010861552,0.00013589823,0.00031299,0.0011255905,0.0010654862,0.0012075729,0.00002446079,0.000042979773],"category_scores_gemma":[0.0020775336,0.00008009896,0.000068170455,0.000773628,0.000103027545,0.0006841703,0.0001761543,0.0006210825,0.0000836352],"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.00023500356,0.00028750164,0.0010750813,0.00009657764,0.00017129064,0.00020863133,0.0027859975,0.36426628,0.3933236,0.079970084,0.100851566,0.056728397],"study_design_scores_gemma":[0.0005484652,0.000666395,0.006561258,0.000095331656,0.000003908813,0.00003797048,0.00016014339,0.96019715,0.0075000417,0.00015513143,0.023910372,0.00016380382],"about_ca_topic_score_codex":0.0000018796848,"about_ca_topic_score_gemma":0.0000010110405,"teacher_disagreement_score":0.8865237,"about_ca_system_score_codex":0.00011794094,"about_ca_system_score_gemma":0.00059238373,"threshold_uncertainty_score":0.9999715},"labels":[],"label_agreement":null},{"id":"W4388773956","doi":"10.1016/j.ejor.2023.11.014","title":"Setting the deadline and the penalty policy for a new environmental standard","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","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":"Laurentian University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Government (linguistics); Harm; Production (economics); Set (abstract data type); Investment (military); Unit (ring theory); Economics; Business; Work (physics); Microeconomics; Industrial organization; Computer science; Politics","score_opus":0.22982181993309142,"score_gpt":0.3686006572176565,"score_spread":0.13877883728456508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388773956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70088017,0.002379779,0.00207461,0.27858022,0.00027626695,0.00065118313,0.0007462254,0.000010534185,0.014401008],"genre_scores_gemma":[0.99125,0.002088838,0.0005093383,0.00094768225,0.0021557838,0.000005698618,0.000018222609,0.00002679689,0.0029976903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890006,0.0001561603,0.00048881554,0.00011851456,0.00009066739,0.00024580906],"domain_scores_gemma":[0.9988464,0.000735313,0.00016482767,0.00012077211,0.000042439337,0.00009025237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01081253,0.00006551549,0.00015719571,0.0002163039,0.0005097843,0.00024450748,0.00029727383,0.000012957715,0.00015676001],"category_scores_gemma":[0.0012329352,0.00004249431,0.00008443592,0.00015363756,0.00019723966,0.00014656613,0.00014877645,0.0002596475,0.00022433617],"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.0012563897,0.00004396912,0.0049079005,0.00003432504,0.00020234122,0.000026683947,0.010959723,0.0015974429,0.00017627959,0.8460141,0.12040188,0.014378982],"study_design_scores_gemma":[0.007310683,0.00052571006,0.051702507,0.000041961128,0.000009522916,0.00016504714,0.002466507,0.014078987,0.00007224545,0.09111225,0.832276,0.0002385815],"about_ca_topic_score_codex":0.00003091508,"about_ca_topic_score_gemma":0.0000073421775,"teacher_disagreement_score":0.7549018,"about_ca_system_score_codex":0.000090615715,"about_ca_system_score_gemma":0.00008838375,"threshold_uncertainty_score":0.39209002},"labels":[],"label_agreement":null},{"id":"W4388948551","doi":"10.1016/j.ejor.2023.11.031","title":"Operations research approaches for improving coordination, cooperation, and collaboration in humanitarian relief chains: A framework and literature review","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":33,"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; Institut de Valorisation des Données","keywords":"Humanitarian Logistics; Humanitarian aid; Supply chain; Conceptual framework; Process management; Computer science; Management science; Knowledge management; Empirical research; Business; Operations research; Sociology; Political science; Engineering; Marketing","score_opus":0.15493986374710716,"score_gpt":0.38167541167980495,"score_spread":0.2267355479326978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388948551","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5338571,0.04436668,0.023309816,0.37933987,0.0012915557,0.00926952,0.0000743883,0.00015988403,0.008331153],"genre_scores_gemma":[0.9877032,0.005860114,0.0020561,0.0010671595,0.0011864493,0.0001226796,0.00022866316,0.00003867968,0.0017369718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973853,0.0005036434,0.00068718474,0.0003177972,0.0008023404,0.00030368537],"domain_scores_gemma":[0.99553984,0.00018687785,0.000048159214,0.00018025156,0.00400495,0.000039899136],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.018634366,0.00012681818,0.00019053645,0.0013272974,0.0009535843,0.0012572187,0.00025739716,0.000043089945,0.000048756567],"category_scores_gemma":[0.007027639,0.00011383866,0.000031279913,0.0027653216,0.00013679852,0.0016914434,0.00020798825,0.00055971666,0.000049052782],"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.00014165023,0.00024861805,0.00060924725,0.003442139,0.000047430076,0.000070254224,0.0030735573,0.01328815,0.0006701199,0.8986922,0.066018134,0.01369849],"study_design_scores_gemma":[0.0042954725,0.0008209929,0.03933274,0.008565596,0.0000759398,0.000059540656,0.012741988,0.6765171,0.00004186792,0.009353784,0.2472059,0.0009890307],"about_ca_topic_score_codex":0.00005241688,"about_ca_topic_score_gemma":0.00046341555,"teacher_disagreement_score":0.88933843,"about_ca_system_score_codex":0.000074925076,"about_ca_system_score_gemma":0.00015724088,"threshold_uncertainty_score":0.9997796},"labels":[],"label_agreement":null},{"id":"W4389219889","doi":"10.1016/j.ejor.2023.11.047","title":"A multiphase dynamic programming algorithm for the shortest path problem with resource constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Column generation; Linear subspace; Scheduling (production processes); Shortest path problem; Crew scheduling; Dynamic programming; Disjoint sets; Algorithm; Mathematics; Theoretical computer science; Graph","score_opus":0.06122002784236803,"score_gpt":0.36021484830249323,"score_spread":0.2989948204601252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389219889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058774166,0.00013790796,0.9911016,0.0008905168,0.00007251501,0.0006346723,0.000025697334,0.00009432383,0.0011653551],"genre_scores_gemma":[0.2869832,0.000060232025,0.7119371,0.000030417463,0.00029612475,0.000030913125,0.0000277734,0.00009979184,0.000534415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978116,0.00056845695,0.0004045693,0.00013018289,0.0007344742,0.0003507168],"domain_scores_gemma":[0.99775165,0.0011148811,0.000058187994,0.00014419244,0.0008082106,0.00012287966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009159861,0.00010911726,0.0001262341,0.00023519206,0.0003770803,0.00025136088,0.0003454805,0.000018875218,0.000027805761],"category_scores_gemma":[0.00056138233,0.00007173426,0.000055393266,0.0006521112,0.0001941252,0.00014583641,0.000047493428,0.0005259209,0.00002165343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026458154,0.000025259997,0.00006352948,0.00001571067,0.0000741407,0.00012788635,0.0004967756,0.58650464,0.00070450286,0.00008793553,0.001595577,0.41027758],"study_design_scores_gemma":[0.0009178501,0.00030178082,0.00089983054,0.00011549734,0.000010914567,0.00017600095,0.00063759147,0.97726053,0.00009644932,0.0000095965115,0.019472346,0.000101613216],"about_ca_topic_score_codex":4.9708757e-7,"about_ca_topic_score_gemma":8.549822e-7,"teacher_disagreement_score":0.41017595,"about_ca_system_score_codex":0.00007631991,"about_ca_system_score_gemma":0.00014971686,"threshold_uncertainty_score":0.31746435},"labels":[],"label_agreement":null},{"id":"W4389265763","doi":"10.1016/j.ejor.2023.11.030","title":"A framework for fair decision-making over time with time-invariant utilities","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":9,"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":"Canada Excellence Research Chairs, Government of Canada; National University of Singapore; Polytechnique Montréal","keywords":"Computer science; Mathematical optimization; Abstraction; Function (biology); Relaxation (psychology); Decision maker; Quality (philosophy); Contrast (vision); Operations research; Artificial intelligence; Mathematics","score_opus":0.17608458030095545,"score_gpt":0.4690230156366712,"score_spread":0.29293843533571573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389265763","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.3184356,0.00026667624,0.6417005,0.005709139,0.000513069,0.0007453504,0.000106766005,0.000057867877,0.032465015],"genre_scores_gemma":[0.8852898,0.00014896694,0.10006321,0.00024123795,0.0011163092,0.000006809166,0.000014959301,0.00005876582,0.013059926],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935146,0.0011370004,0.00089906354,0.00030239552,0.0037766898,0.00037025908],"domain_scores_gemma":[0.9855351,0.010446628,0.00025878026,0.0003372807,0.00324628,0.00017593597],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.02416322,0.00012445405,0.00025783514,0.0010185579,0.0005838985,0.0009815061,0.00089460326,0.000039558614,0.0025742438],"category_scores_gemma":[0.019599399,0.000077533245,0.00013068515,0.0017139983,0.00015963241,0.0006974743,0.00016758572,0.00043247835,0.001801524],"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.0037610268,0.0002114218,0.0040057558,0.0000085338625,0.00018638372,0.0011393407,0.0039028479,0.12849084,0.0008404044,0.04321871,0.65988225,0.15435249],"study_design_scores_gemma":[0.0027864734,0.0035376977,0.069748215,0.0011363686,0.0000339447,0.00046266062,0.0019174101,0.38407305,0.00021168194,0.24450418,0.29092735,0.0006609506],"about_ca_topic_score_codex":8.8216e-7,"about_ca_topic_score_gemma":8.1286777e-7,"teacher_disagreement_score":0.5668542,"about_ca_system_score_codex":0.00005212373,"about_ca_system_score_gemma":0.000560494,"threshold_uncertainty_score":0.9989757},"labels":[],"label_agreement":null},{"id":"W4390079318","doi":"10.1016/j.ejor.2023.12.021","title":"Leveraging decision diagrams to solve two-stage stochastic programs with binary recourse and logical linking constraints","year":2023,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","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":"University of Toronto","funders":"","keywords":"Binary decision diagram; Computer science; Mathematical optimization; Binary number; Stochastic programming; Stage (stratigraphy); Set (abstract data type); Class (philosophy); Mathematics; Algorithm; Artificial intelligence; Programming language","score_opus":0.29401581664398335,"score_gpt":0.46408445923681996,"score_spread":0.1700686425928366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390079318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80848384,0.000062649364,0.18739146,0.0018720399,0.00017410617,0.00027952783,0.000004765882,0.000016972275,0.0017146551],"genre_scores_gemma":[0.9777261,0.000103426515,0.020982968,0.00010077028,0.0003198314,0.0000034313387,0.0000111305735,0.000023237215,0.0007291155],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99423903,0.0008931114,0.00080273004,0.00037765698,0.0032904106,0.00039708227],"domain_scores_gemma":[0.9951386,0.0019350481,0.0001877982,0.00022444918,0.0020891167,0.00042500097],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.02208751,0.00013368756,0.00023781903,0.0009701444,0.00054376194,0.0011341014,0.0005675439,0.000025886162,0.00019756239],"category_scores_gemma":[0.003999024,0.00008317744,0.00006022607,0.0017665398,0.00031633867,0.0004881422,0.0002654466,0.0005599451,0.00035917395],"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.0006147108,0.00012244046,0.010812607,0.0000029872965,0.0000333747,0.0019304991,0.002466514,0.33982748,0.0006105071,0.0015323469,0.0038105173,0.638236],"study_design_scores_gemma":[0.012282556,0.016226772,0.5019175,0.0028071376,0.00006794257,0.0036155966,0.023714412,0.3646943,0.00023997977,0.014113459,0.05846894,0.001851398],"about_ca_topic_score_codex":0.0000025135641,"about_ca_topic_score_gemma":0.0000052482565,"teacher_disagreement_score":0.6363846,"about_ca_system_score_codex":0.00004566186,"about_ca_system_score_gemma":0.00032531907,"threshold_uncertainty_score":0.99990284},"labels":[],"label_agreement":null},{"id":"W4390532129","doi":"10.1016/j.ejor.2023.12.025","title":"Optimizing credit limit adjustments under adversarial goals using reinforcement learning","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":10,"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; Alliance de recherche numérique du Canada","keywords":"Reinforcement learning; Computer science; Portfolio; Artificial intelligence; Machine learning; Operations research; Economics; Finance; Mathematics","score_opus":0.09483037834868036,"score_gpt":0.3628783551221518,"score_spread":0.2680479767734714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390532129","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.030312622,0.0012359685,0.95737284,0.0034308494,0.0004546906,0.00015396261,8.1917705e-7,0.000063315536,0.0069749155],"genre_scores_gemma":[0.9545986,0.00010254745,0.04425043,0.00010822362,0.0005023547,0.000002271222,0.0000019512775,0.000015121025,0.0004184791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753225,0.00058502785,0.0004490055,0.00023740565,0.00091375166,0.00028257765],"domain_scores_gemma":[0.9987475,0.00022861634,0.000078780766,0.00022531723,0.0006143846,0.00010535662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047977827,0.00009666015,0.00012012178,0.00048143728,0.00047763632,0.000526375,0.0009067723,0.000037873902,0.000086498374],"category_scores_gemma":[0.0002153548,0.00008302735,0.00007812331,0.0005995556,0.00010462005,0.0005832034,0.0004446314,0.0010262872,0.00010788571],"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.000045941273,0.0001236027,0.000047217953,0.000030357713,0.00022405364,0.00065210817,0.0023291858,0.4371374,0.015998714,0.51560366,0.0042244866,0.023583248],"study_design_scores_gemma":[0.0006572236,0.0005893293,0.0003053349,0.00022153907,0.000014267479,0.00033390013,0.00036544155,0.9332449,0.0022669637,0.0023520626,0.05945085,0.00019821353],"about_ca_topic_score_codex":0.0000040311184,"about_ca_topic_score_gemma":3.2602324e-7,"teacher_disagreement_score":0.924286,"about_ca_system_score_codex":0.00018614084,"about_ca_system_score_gemma":0.0004168477,"threshold_uncertainty_score":0.50758463},"labels":[],"label_agreement":null},{"id":"W4390578419","doi":"10.1016/j.ejor.2023.12.024","title":"Platform financing or bank financing in agricultural supply chains: The impact of platform digital empowerment","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"FinTech, Crowdfunding, Digital Finance","field":"Business, Management and Accounting","cited_by":71,"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":"Natural Science Foundation of Zhejiang Province; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China; Zhejiang Gongshang University; Ministry of Education","keywords":"Finance; Business; Agriculture; Supply chain; Empowerment; Economics; Marketing; Economic growth","score_opus":0.06767211280481508,"score_gpt":0.33108137251412445,"score_spread":0.2634092597093094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390578419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670048,0.00045268756,0.00016389598,0.0007904161,0.00023658285,0.00025471917,0.000018832945,0.000015593885,0.031062512],"genre_scores_gemma":[0.9971288,0.00004236364,0.00006026819,0.000048629838,0.00092961284,0.000003865749,0.000020847014,0.00003516946,0.0017304542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9973933,0.000031068328,0.00084007165,0.00022663912,0.0010351137,0.00047377098],"domain_scores_gemma":[0.99861085,0.00031785507,0.00020895,0.00015130476,0.00068322103,0.000027796952],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003433734,0.00020287572,0.0002548958,0.00068506226,0.00023423228,0.0018137011,0.00063542253,0.000030971743,0.00020032751],"category_scores_gemma":[0.0013594601,0.00010691687,0.00021532743,0.0013357035,0.00014351684,0.0045952764,0.00034190828,0.00080895075,0.00018448308],"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.0043855137,0.0019195816,0.060635526,0.0020353945,0.00090333505,0.012321563,0.008666773,0.042824008,0.03529995,0.29288605,0.27091023,0.26721206],"study_design_scores_gemma":[0.001986903,0.0011434361,0.9326272,0.0047800606,0.000019889208,0.000657577,0.0022464565,0.0142075,0.0007148822,0.0020141632,0.038957372,0.0006445438],"about_ca_topic_score_codex":0.000072639,"about_ca_topic_score_gemma":0.000028690887,"teacher_disagreement_score":0.8719917,"about_ca_system_score_codex":0.00034270444,"about_ca_system_score_gemma":0.0003997234,"threshold_uncertainty_score":0.9992225},"labels":[],"label_agreement":null},{"id":"W4390862194","doi":"10.1016/j.ejor.2024.05.031","title":"A competitive heuristic algorithm for vehicle routing problems with drones","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal","funders":"China Scholarship Council; Northwestern Polytechnical University; Northwestern University","keywords":"Vehicle routing problem; Drone; Computer science; Heuristic; Routing (electronic design automation); Mathematical optimization; Algorithm; Operations research; Artificial intelligence; Mathematics; Computer network","score_opus":0.06020974464802066,"score_gpt":0.34766038793449233,"score_spread":0.2874506432864717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390862194","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.0062183756,0.00079766015,0.9835933,0.0005143378,0.00023051737,0.00025615082,0.00002095149,0.00007763385,0.008291068],"genre_scores_gemma":[0.6962597,0.00005990385,0.30223745,0.000019136434,0.0007147775,0.0000080500795,0.000009737559,0.00009008173,0.00060120266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809784,0.000531159,0.00038011873,0.00013630858,0.00059129874,0.0002632989],"domain_scores_gemma":[0.9981437,0.0007371341,0.000030584903,0.00008267469,0.0008982262,0.00010772924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005249176,0.00010390734,0.00014028895,0.00025318022,0.00018364101,0.00036942936,0.00019959717,0.000016948108,0.000055609424],"category_scores_gemma":[0.00032165044,0.00008227378,0.000051809722,0.00038553224,0.000074791285,0.00026626507,0.000032396172,0.0005037017,0.000037334532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004863769,0.000060637674,0.00009466954,0.0002517257,0.00027263854,0.00040879348,0.0020145401,0.8450232,0.007009054,0.019370008,0.0030511704,0.122394934],"study_design_scores_gemma":[0.0005041937,0.0004218122,0.00043705496,0.0004924432,0.000012393752,0.00018428713,0.00021831143,0.9807534,0.00078967115,0.00009437038,0.015968565,0.00012348461],"about_ca_topic_score_codex":8.265835e-7,"about_ca_topic_score_gemma":6.739134e-7,"teacher_disagreement_score":0.6900413,"about_ca_system_score_codex":0.00010975595,"about_ca_system_score_gemma":0.00016426592,"threshold_uncertainty_score":0.35624158},"labels":[],"label_agreement":null},{"id":"W4391069837","doi":"10.1016/j.ejor.2024.01.018","title":"A new integrated cooperative game and optimization model for the allocation of forest resources","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Forest Management and Policy","field":"Environmental Science","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":"École de Technologie Supérieure; Université de Montréal","funders":"","keywords":"Computer science; Resource allocation; Operations research; Game theory; Mathematical optimization; Microeconomics; Economics; Mathematics","score_opus":0.06399043550490957,"score_gpt":0.3384897909229491,"score_spread":0.27449935541803955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391069837","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.08681064,0.0008842171,0.88929677,0.010474765,0.00010599055,0.00061488367,0.0000150964925,0.0000105790195,0.01178706],"genre_scores_gemma":[0.9714756,0.00021597043,0.012385025,0.000071812705,0.0001647112,0.0000033833983,0.00000776922,0.000015297122,0.015660435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989317,0.00020620988,0.00024031475,0.00009745359,0.00041765996,0.00010668369],"domain_scores_gemma":[0.9993601,0.0003286761,0.000043323707,0.000070199756,0.00013867051,0.00005904284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002235235,0.00005743078,0.000064055836,0.000104309525,0.00012899122,0.00018658843,0.00021450006,0.000010615382,0.00048047153],"category_scores_gemma":[0.00037683695,0.000034441586,0.000031216066,0.0002811156,0.00016315562,0.00031069946,0.000088401925,0.00016322333,0.00003454091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007730361,0.000011634076,0.00016726658,0.000008706063,0.000024047184,0.0000028220616,0.0018172469,0.9479019,0.00042476945,0.005617339,0.038118232,0.0058287056],"study_design_scores_gemma":[0.00021113826,0.00021622921,0.0013063467,0.000045009972,0.0000099092995,0.0000069269404,0.000077761535,0.9694236,0.000036994712,0.00014851488,0.028480574,0.000037014757],"about_ca_topic_score_codex":0.000045353245,"about_ca_topic_score_gemma":0.000026310056,"teacher_disagreement_score":0.88466495,"about_ca_system_score_codex":0.000044579287,"about_ca_system_score_gemma":0.00008209077,"threshold_uncertainty_score":0.52608263},"labels":[],"label_agreement":null},{"id":"W4391480680","doi":"10.1016/j.ejor.2024.01.036","title":"Fifty Years of Location Theory - A Selective Review","year":2024,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"Fondo Nacional de Desarrollo Científico y Tecnológico; Agencia Nacional de Investigación y Desarrollo","keywords":"Regional science; Geography; Operations research; Data science; Computer science; History; Mathematics","score_opus":0.18862455261874012,"score_gpt":0.4184894361235645,"score_spread":0.22986488350482437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391480680","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.000004723189,0.9847801,0.00021450369,0.00045966616,0.00037569384,0.0005324379,0.0000065692398,0.00001046721,0.013615879],"genre_scores_gemma":[0.0003471554,0.9960223,0.000073321746,0.00024277865,0.0010674042,0.000011791412,0.0000638712,0.000046010464,0.002125356],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99622715,0.0008258295,0.0012697951,0.00024701646,0.0012255769,0.00020465555],"domain_scores_gemma":[0.99692535,0.00012666099,0.00027219477,0.00026156934,0.002389379,0.000024843617],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01430323,0.00019193062,0.0006768788,0.0009761076,0.00009817641,0.00019284224,0.0006823668,0.00003517163,0.00075435225],"category_scores_gemma":[0.0021842837,0.00014828841,0.00035079563,0.0018204906,0.00010618258,0.00051020976,0.00028806884,0.0007843688,0.0024759332],"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.000021479895,0.000096492055,4.80609e-7,0.06415131,0.00028835525,0.000057949383,0.00004218069,0.000080842954,5.094998e-7,0.029597312,0.151599,0.7540641],"study_design_scores_gemma":[0.00007598766,0.00003329549,0.00003520143,0.031374797,0.00040340665,0.00001351971,0.00002847837,0.00005817247,8.9379235e-8,0.0002525742,0.9676039,0.00012053559],"about_ca_topic_score_codex":0.000016406166,"about_ca_topic_score_gemma":0.0000052423434,"teacher_disagreement_score":0.81600493,"about_ca_system_score_codex":0.000119080265,"about_ca_system_score_gemma":0.00047653704,"threshold_uncertainty_score":0.99830073},"labels":[],"label_agreement":null},{"id":"W4391656247","doi":"10.1016/j.ejor.2024.02.002","title":"Robust insurance design with distortion risk measures","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Computer science; Risk management; Actuarial science; Distortion (music); Risk measure; Risk analysis (engineering); Econometrics; Mathematics; Business; Finance","score_opus":0.378339752836445,"score_gpt":0.4313619118091266,"score_spread":0.05302215897268159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391656247","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.08676463,0.0021440415,0.8982281,0.0014548112,0.0003943806,0.00015501335,0.000013116835,0.000015276928,0.010830623],"genre_scores_gemma":[0.9813358,0.0017177016,0.013659839,0.000024678571,0.0005392548,0.0000015258147,0.0000022431118,0.00002217023,0.0026967684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99088156,0.0039802627,0.0007175033,0.00025501018,0.003966518,0.00019912061],"domain_scores_gemma":[0.9951653,0.00133846,0.00016978156,0.00021553435,0.0029508315,0.00016013082],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.03274034,0.00009458672,0.00014848646,0.0006846075,0.0003834113,0.0012407477,0.0005626924,0.00001896647,0.00022594424],"category_scores_gemma":[0.0041409796,0.000054247437,0.00007477442,0.001250688,0.00015656643,0.000977563,0.00004337444,0.00061343814,0.0004585302],"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.0004613236,0.00006663301,0.011421566,0.0000024763099,0.000057620597,0.0006279689,0.0010279499,0.705187,0.00041298583,0.0013683967,0.06614159,0.21322446],"study_design_scores_gemma":[0.0014747492,0.003130366,0.36633635,0.00040990405,0.00003954047,0.0010933478,0.00081184995,0.09053201,0.0015228549,0.0048294924,0.52933,0.0004895151],"about_ca_topic_score_codex":0.0000064266037,"about_ca_topic_score_gemma":0.0000051598518,"teacher_disagreement_score":0.8945712,"about_ca_system_score_codex":0.00007563123,"about_ca_system_score_gemma":0.00056902296,"threshold_uncertainty_score":0.99979603},"labels":[],"label_agreement":null},{"id":"W4391672891","doi":"10.1016/j.ejor.2024.01.048","title":"Different formulations of the gray pattern problem and their optimal solutions","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Satellite Image Processing and Photogrammetry","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":"Royal Military College of Canada; Royal Ottawa Mental Health Centre","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pixel; Rectangle; Gray (unit); Colored; Mathematics; Entropy (arrow of time); Algorithm; Minification; Computer science; Mathematical optimization; Artificial intelligence; Geometry; Physics","score_opus":0.0639285242021906,"score_gpt":0.3115438907813197,"score_spread":0.24761536657912914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391672891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8285123,0.010919231,0.14978778,0.0013980477,0.00036959688,0.00020240899,0.000047817946,0.00003968213,0.008723088],"genre_scores_gemma":[0.9985927,0.00019856909,0.0009254523,0.000008873055,0.00014201103,0.0000013496237,0.0000022411039,0.000018389142,0.00011046973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990527,0.00020143113,0.00025253103,0.00006076101,0.0002909726,0.0001416016],"domain_scores_gemma":[0.9994154,0.00018802634,0.000017915436,0.00007526621,0.0002479583,0.0000554451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012056195,0.00006599855,0.00007530598,0.00015200734,0.00016619229,0.00019287638,0.000163278,0.000011539118,0.000036071186],"category_scores_gemma":[0.0000595791,0.00003618314,0.000057275123,0.00023013155,0.0000884824,0.0001453782,0.000057008696,0.00041840397,0.0000053587596],"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.00005203501,0.0002699672,0.0063616144,0.001080735,0.0006582103,0.000088486806,0.01345124,0.06359868,0.24499243,0.008782621,0.013256604,0.64740735],"study_design_scores_gemma":[0.0015615859,0.00091280346,0.11861827,0.003592332,0.00008606168,0.0011707975,0.0016196124,0.7231516,0.06979124,0.005550247,0.073251724,0.0006936981],"about_ca_topic_score_codex":0.000002045298,"about_ca_topic_score_gemma":0.0000017562404,"teacher_disagreement_score":0.65955293,"about_ca_system_score_codex":0.000026472304,"about_ca_system_score_gemma":0.000056507644,"threshold_uncertainty_score":0.18599114},"labels":[],"label_agreement":null},{"id":"W4392138130","doi":"10.1016/j.ejor.2024.02.025","title":"Improving order picking efficiency through storage assignment optimization in robotic mobile fulfillment systems","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":28,"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; National Natural Science Foundation of China","keywords":"Rack; Computer science; Order picking; Heuristic; Order (exchange); Mathematical optimization; Focus (optics); Product (mathematics); Order processing; Distribution center; Order fulfillment; Distribution (mathematics); Integer (computer science); Operations research; Supply chain; Artificial intelligence; Engineering; Mathematics; Warehouse","score_opus":0.039499131448683035,"score_gpt":0.31040866301552733,"score_spread":0.2709095315668443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392138130","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.0030902647,0.002644834,0.9908469,0.000057699304,0.00070477446,0.00020671569,0.0000019169445,0.000040724768,0.0024061722],"genre_scores_gemma":[0.97164536,0.00035779798,0.027463466,0.0000060317434,0.00028100322,0.000008704209,0.000008812983,0.000043588214,0.00018523568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816763,0.00030877793,0.00047856456,0.00015017726,0.00064897415,0.00024589422],"domain_scores_gemma":[0.9993211,0.00017665491,0.000038669496,0.000103176935,0.0002995418,0.00006087063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021006435,0.00010935773,0.00013152217,0.00031196125,0.00011442387,0.00034775518,0.00017220435,0.000023371185,0.00005804383],"category_scores_gemma":[0.00020563968,0.000094364776,0.00002970577,0.0003787288,0.000029641813,0.0004224035,0.00004419671,0.00051303813,0.000022171498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006340331,0.000029209512,0.0000052886207,0.00008729074,0.000014437443,0.00016895449,0.00045408495,0.9962781,0.00071624847,0.000704638,0.00025730507,0.0012780898],"study_design_scores_gemma":[0.00021682777,0.0001597961,0.000043044733,0.00023967912,0.0000045569836,0.000038143135,0.0002394999,0.9972734,0.00028523046,0.000016408383,0.0013843309,0.000099118464],"about_ca_topic_score_codex":0.0000050425224,"about_ca_topic_score_gemma":5.0549653e-7,"teacher_disagreement_score":0.9685551,"about_ca_system_score_codex":0.0004344311,"about_ca_system_score_gemma":0.00010961843,"threshold_uncertainty_score":0.3848084},"labels":[],"label_agreement":null},{"id":"W4392519718","doi":"10.1016/j.ejor.2024.03.010","title":"A novel model for transfer synchronization in transit networks and a Lagrangian-based heuristic solution method","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation Planning and Optimization","field":"Social Sciences","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 Toronto","funders":"","keywords":"Lagrangian relaxation; Computer science; Dwell time; Synchronizing; Headway; Mathematical optimization; Heuristic; Scheduling (production processes); Transfer (computing); Relaxation (psychology); Synchronization (alternating current); Heuristics; Integer programming; Operations research; Simulation; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.10085208267917678,"score_gpt":0.40374504069390316,"score_spread":0.3028929580147264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392519718","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.002485283,0.0005814389,0.9929652,0.0031657747,0.00008257911,0.00020827402,0.000017209382,0.000012475792,0.0004817281],"genre_scores_gemma":[0.9619602,0.0001263076,0.037352867,0.00006130599,0.00019578688,0.0000048973607,0.000032603348,0.000016570557,0.00024948025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982651,0.0006025457,0.00031959708,0.00013717986,0.00048898946,0.00018662441],"domain_scores_gemma":[0.9987929,0.0005284016,0.000019043242,0.000033103657,0.0005393527,0.00008718337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0071415366,0.00006006697,0.00009306982,0.00033665818,0.00030515407,0.00022265073,0.0000968385,0.00003562361,0.000021500475],"category_scores_gemma":[0.0002702814,0.000055986096,0.00004618029,0.0004325815,0.00008589928,0.00029519535,0.0000019475374,0.00026443368,0.0000012868139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010974082,0.000039161547,0.00006155535,0.000033290115,0.000010500479,0.000015719166,0.0048886263,0.9772058,0.00045773093,0.011512492,0.0002476633,0.0054176957],"study_design_scores_gemma":[0.0005947747,0.000088171655,0.0010536707,0.0001744956,0.00001244393,0.0000041154544,0.00019127566,0.9965364,0.000010055688,0.00010415657,0.0011707913,0.000059650363],"about_ca_topic_score_codex":0.000030644722,"about_ca_topic_score_gemma":0.00021131898,"teacher_disagreement_score":0.9594749,"about_ca_system_score_codex":0.000082359555,"about_ca_system_score_gemma":0.0005840409,"threshold_uncertainty_score":0.24751283},"labels":[],"label_agreement":null},{"id":"W4392697211","doi":"10.1016/j.ejor.2024.03.016","title":"Worst-case risk measures of stop-loss and limited loss random variables under distribution uncertainty with applications to robust reinsurance","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinsurance; Random variable; Variable (mathematics); Mathematics; Distribution (mathematics); Statistics; Econometrics; Actuarial science; Economics","score_opus":0.1696763661460953,"score_gpt":0.4025862293248418,"score_spread":0.23290986317874648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392697211","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.21265364,0.0009637905,0.7828013,0.0020956143,0.00007825408,0.00034350294,0.00018019616,0.0000092386135,0.0008744844],"genre_scores_gemma":[0.9918282,0.0012746295,0.006094096,0.000030071087,0.00024087049,0.000008874508,0.000024460689,0.000017680984,0.00048114022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99463713,0.00178707,0.0008530567,0.00032828128,0.0021810199,0.00021343678],"domain_scores_gemma":[0.9933681,0.0021235358,0.0002108905,0.00028232613,0.0037743475,0.00024083274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01740459,0.00012145947,0.0002432987,0.0004911113,0.00046450712,0.0006791964,0.00038921615,0.000030368086,0.00006583527],"category_scores_gemma":[0.0028016309,0.00007654612,0.00006624904,0.0018415124,0.000276995,0.0004975779,0.000084869156,0.0004598464,0.00003682991],"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.0011900334,0.00009966507,0.0030919402,0.000010117293,0.00010007042,0.00065815035,0.00069056946,0.9315757,0.0003005038,0.01755088,0.0051151956,0.039617136],"study_design_scores_gemma":[0.014059077,0.0051474646,0.13478957,0.0017468558,0.00037439866,0.016369177,0.0073956377,0.28328237,0.0020036753,0.03168871,0.50149345,0.001649596],"about_ca_topic_score_codex":0.000033266882,"about_ca_topic_score_gemma":0.000024690074,"teacher_disagreement_score":0.77917457,"about_ca_system_score_codex":0.000071821676,"about_ca_system_score_gemma":0.0004283658,"threshold_uncertainty_score":0.6549506},"labels":[],"label_agreement":null},{"id":"W4392868640","doi":"10.1016/j.ejor.2024.03.020","title":"A survey of contextual optimization methods for decision-making under uncertainty","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":122,"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; HEC Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Canada First Research Excellence Fund; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Variety (cybernetics); Stochastic programming; Stochastic optimization; Machine learning; Field (mathematics); Artificial intelligence; Terminology; Optimization problem; Reinforcement learning; Management science; Operations research; Mathematical optimization; Mathematics","score_opus":0.369427914832771,"score_gpt":0.5759235784793887,"score_spread":0.2064956636466177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392868640","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.007402139,0.0015164178,0.9876135,0.0004898262,0.0005686052,0.00020674834,0.00004613188,0.0000059084396,0.0021507523],"genre_scores_gemma":[0.75042313,0.00024575702,0.24848075,0.00005252215,0.0002190973,0.000001910918,0.000013712505,0.000023722516,0.0005393653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989949,0.005763729,0.0015334189,0.00029876863,0.0022247029,0.00023037539],"domain_scores_gemma":[0.96407926,0.026682258,0.00027851382,0.00024377825,0.008593755,0.00012245003],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.08121918,0.00010721632,0.00029206838,0.0010588093,0.00024814202,0.00076309853,0.00074296043,0.000037891572,0.0007345286],"category_scores_gemma":[0.049936518,0.000072252915,0.00016224581,0.0016592743,0.00016457893,0.0006359196,0.00011681211,0.00034051097,0.00003665455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002898971,0.000032060067,0.00019285076,0.0000030020412,0.00003453687,0.000011906919,0.00026873473,0.74511534,0.00013537533,0.0031580164,0.013362379,0.23739591],"study_design_scores_gemma":[0.00041594674,0.0005276947,0.009296055,0.00023312744,0.000010985578,0.000050019305,0.00038717088,0.96716154,0.000068966256,0.004914017,0.016823908,0.00011056962],"about_ca_topic_score_codex":0.0000107893065,"about_ca_topic_score_gemma":0.000012903353,"teacher_disagreement_score":0.743021,"about_ca_system_score_codex":0.00007839719,"about_ca_system_score_gemma":0.0009468156,"threshold_uncertainty_score":0.9580663},"labels":[],"label_agreement":null},{"id":"W4393029310","doi":"10.1016/j.ejor.2024.03.025","title":"Trust exploration- and leadership incubation- based opinion dynamics model for social network group decision-making: A quantum theory perspective","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"University of Alberta","funders":"","keywords":"Perspective (graphical); Group decision-making; Management science; Social network (sociolinguistics); Group (periodic table); Psychology; Knowledge management; Social psychology; Computer science; Sociology; Operations research; Artificial intelligence; Economics; Mathematics; Social media; Physics","score_opus":0.17722525231309247,"score_gpt":0.41472576973006825,"score_spread":0.23750051741697578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393029310","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.008858981,0.00043342897,0.9846476,0.0038082618,0.00033485406,0.0002441612,0.000086887136,0.000009639203,0.0015762295],"genre_scores_gemma":[0.99232733,0.000021654914,0.005382604,0.00008812459,0.0019228705,0.000012532094,0.000046606205,0.0000354186,0.00016286943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980036,0.0005726195,0.00040699303,0.0002168399,0.0005420883,0.0002578354],"domain_scores_gemma":[0.9972361,0.0014431634,0.00009319902,0.00007554305,0.0010661305,0.000085895175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004301572,0.00012060811,0.00015561449,0.00019315451,0.0007427664,0.0005798972,0.00021409002,0.000028988745,0.000051397543],"category_scores_gemma":[0.00028524056,0.000107715154,0.00013049073,0.00028301583,0.00016796296,0.0005488615,0.000054711116,0.0004637118,0.000008045319],"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.00017600073,0.000049663086,0.0001563722,0.000018320588,0.000055367756,0.0000031302795,0.0021143223,0.058004424,0.000009397306,0.9300133,0.0020620096,0.0073376815],"study_design_scores_gemma":[0.00027362525,0.00012985177,0.0003036651,0.00014945015,0.0000061087912,0.0000011128235,0.0032273752,0.6820953,5.035239e-7,0.31338775,0.0003407452,0.00008454972],"about_ca_topic_score_codex":0.0000028472693,"about_ca_topic_score_gemma":0.0000037924146,"teacher_disagreement_score":0.98346835,"about_ca_system_score_codex":0.0001634246,"about_ca_system_score_gemma":0.00052506826,"threshold_uncertainty_score":0.5712834},"labels":[],"label_agreement":null},{"id":"W4393128897","doi":"10.1016/j.ejor.2024.03.031","title":"Vehicle routing with stochastic demand, service and waiting times — The case of food bank collection problems","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":true,"ca_institutions":"HEC Montréal","funders":"HORIZON EUROPE Framework Programme","keywords":"Vehicle routing problem; Computer science; Service (business); Operations research; Routing (electronic design automation); Limit (mathematics); Set (abstract data type); Plan (archaeology); Variety (cybernetics); Mathematical optimization; Business; Marketing; Computer network; Mathematics","score_opus":0.050957089695265,"score_gpt":0.31425548329844916,"score_spread":0.26329839360318413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393128897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.855931,0.0012462756,0.13908948,0.0009950144,0.000093665076,0.00022252653,0.0000054049547,0.00003751348,0.0023791178],"genre_scores_gemma":[0.9921849,0.000022430508,0.0074931365,0.000012089894,0.00017076526,0.0000020749717,0.0000010471625,0.00003788109,0.00007568519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998266,0.00075562386,0.00035512532,0.00009996555,0.00035966164,0.00016364167],"domain_scores_gemma":[0.9983995,0.0007408914,0.000045757024,0.00007891728,0.0006702785,0.00006468091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057128794,0.000080956794,0.00010679028,0.000187806,0.00031808196,0.00023593634,0.000117483476,0.000015586873,0.000033935554],"category_scores_gemma":[0.00034350398,0.000054206972,0.00002264771,0.00065500726,0.000057955887,0.00022925866,0.0000473688,0.00049204443,0.000004826034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000222631,0.000009547867,0.000042182754,0.00012543406,0.000091952556,0.00019981769,0.00213764,0.9886537,0.003934674,0.0013271812,0.00015895617,0.0032966088],"study_design_scores_gemma":[0.0002933924,0.00028005356,0.00023707423,0.0003580544,0.000016600832,0.0025657692,0.0006239969,0.9946058,0.00082676613,0.00004084275,0.00008783676,0.000063845306],"about_ca_topic_score_codex":0.0000068212175,"about_ca_topic_score_gemma":0.000014658362,"teacher_disagreement_score":0.13625388,"about_ca_system_score_codex":0.00005077331,"about_ca_system_score_gemma":0.000097930664,"threshold_uncertainty_score":0.24464615},"labels":[],"label_agreement":null},{"id":"W4394693707","doi":"10.1016/j.ejor.2024.04.007","title":"An exact method for a last-mile delivery routing problem with multiple deliverymen","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Université Laval","funders":"Alliance de recherche numérique du Canada; 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; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Mile; Computer science; Last mile (transportation); Routing (electronic design automation); Mathematical optimization; Operations research; Mathematics; Computer network; Geography","score_opus":0.06314009654853942,"score_gpt":0.3729746432483227,"score_spread":0.3098345466997833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394693707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049577493,0.0003678884,0.9466432,0.00020326718,0.000121546625,0.00028629377,0.000020183707,0.00009460531,0.0026855739],"genre_scores_gemma":[0.44636765,0.000030998017,0.55294394,0.00001917871,0.00039228253,0.0000064475153,0.000010321599,0.000073050796,0.00015608298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706227,0.0012443261,0.0004704147,0.00020282809,0.0006828247,0.00033733662],"domain_scores_gemma":[0.9973205,0.00121892,0.000041460004,0.00014578605,0.0010922528,0.00018112505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010227422,0.00013780335,0.00017178229,0.0003721526,0.00022997783,0.00049659936,0.00032758876,0.00002787591,0.00007255447],"category_scores_gemma":[0.00040358966,0.00011069813,0.00007068932,0.00042983194,0.00004041821,0.000656154,0.000039836894,0.00058579125,0.000025448908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108455824,0.000038052876,0.0002552815,0.000093611096,0.00012897405,0.00013792104,0.0010326728,0.92532194,0.034508437,0.00064039504,0.0017741341,0.035960123],"study_design_scores_gemma":[0.0006007204,0.000601595,0.00062250724,0.00024203195,0.000015885129,0.00016826906,0.00024346015,0.9861265,0.0026000012,0.0000312828,0.008601885,0.00014589762],"about_ca_topic_score_codex":0.0000037177872,"about_ca_topic_score_gemma":0.0000044747485,"teacher_disagreement_score":0.39679018,"about_ca_system_score_codex":0.00015032676,"about_ca_system_score_gemma":0.00024889057,"threshold_uncertainty_score":0.4788719},"labels":[],"label_agreement":null},{"id":"W4394910141","doi":"10.1016/j.ejor.2024.04.011","title":"A hybrid genetic search and dynamic programming-based split algorithm for the multi-trip time-dependent vehicle routing problem","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"HEC Montréal; Polytechnique Montréal","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; Ministry of Education - Singapore","keywords":"Vehicle routing problem; Solver; Computer science; Algorithm; Monotone polygon; Queue; Mathematical optimization; Genetic algorithm; Computation; Routing (electronic design automation); Dynamic programming; Mathematics","score_opus":0.046085922399229394,"score_gpt":0.34650779066864007,"score_spread":0.3004218682694107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394910141","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02088133,0.0025001725,0.9748149,0.00083673006,0.00012721159,0.0006346604,0.00002195121,0.00007215312,0.00011091887],"genre_scores_gemma":[0.41469133,0.0000840395,0.5842236,0.000021769372,0.00027491784,0.000019071647,0.00000749957,0.000096647156,0.0005811087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972157,0.00087141834,0.00050157355,0.00021161493,0.00080485956,0.000394826],"domain_scores_gemma":[0.99795485,0.0010499783,0.000029126479,0.0001490757,0.0006716401,0.00014532442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01032474,0.00013751356,0.00014584386,0.0002740086,0.00036072612,0.0007856217,0.00034133715,0.000022488577,0.000046273934],"category_scores_gemma":[0.00034106176,0.00010281748,0.00007983228,0.0002971829,0.000108067645,0.00016891725,0.00008244923,0.00073301,0.0000425129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015421594,0.000029051398,0.00004031116,0.00008359244,0.00007739665,0.000107972744,0.00023482108,0.5921427,0.0027441443,0.000041152856,0.00018628736,0.40429717],"study_design_scores_gemma":[0.0006197063,0.00019465931,0.000729633,0.00014866472,0.00001679465,0.00013740455,0.000056449655,0.99480957,0.0007330181,0.000011357673,0.002434824,0.00010794595],"about_ca_topic_score_codex":0.000002757106,"about_ca_topic_score_gemma":7.366639e-7,"teacher_disagreement_score":0.40418923,"about_ca_system_score_codex":0.00015884773,"about_ca_system_score_gemma":0.00024976832,"threshold_uncertainty_score":0.7575768},"labels":[],"label_agreement":null},{"id":"W4394987813","doi":"10.1016/j.ejor.2024.04.017","title":"Constructing order-2 information granules of linguistic expressions with the aid of the principle of justifiable granularity","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Granularity; Computer science; Mathematics; Linguistics; Natural language processing; Data mining; Artificial intelligence; Theoretical computer science","score_opus":0.23223501163687857,"score_gpt":0.4724556413174244,"score_spread":0.24022062968054583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394987813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372855,0.00031119242,0.05089511,0.0015484415,0.0005467558,0.00032976054,0.00007320841,0.0000050993044,0.009004936],"genre_scores_gemma":[0.99054414,0.000010041956,0.009081355,0.000020814165,0.00011447645,0.0000010803716,0.0000015564267,0.000009674864,0.00021684179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99190164,0.0020628858,0.0015094691,0.00014573286,0.0042031407,0.00017714885],"domain_scores_gemma":[0.9876684,0.0044344026,0.0006095612,0.00046686656,0.006748544,0.000072201314],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.020237718,0.00009517455,0.00025585445,0.00051488477,0.00034376123,0.00038612337,0.0013750038,0.000022543327,0.00030744146],"category_scores_gemma":[0.027308954,0.000042064323,0.000120142075,0.0014760315,0.0006713779,0.00058103557,0.00040642696,0.00061222375,0.00001813227],"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.002291718,0.00056702207,0.023481065,0.000733226,0.00044052486,0.00021398344,0.03340343,0.08019771,0.12980779,0.6161982,0.019776793,0.09288859],"study_design_scores_gemma":[0.008323321,0.0031615882,0.13763136,0.013592665,0.00028475025,0.0019970143,0.04230536,0.20962355,0.13916951,0.046376236,0.39642447,0.0011101655],"about_ca_topic_score_codex":0.000010037313,"about_ca_topic_score_gemma":0.00000652702,"teacher_disagreement_score":0.5698219,"about_ca_system_score_codex":0.00003466099,"about_ca_system_score_gemma":0.00090335275,"threshold_uncertainty_score":0.98088443},"labels":[],"label_agreement":null},{"id":"W4395704223","doi":"10.1016/j.ejor.2024.04.031","title":"Determinism versus uncertainty: Examining the worst-case expected performance of data-driven policies","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"HEC Montréal","funders":"Hong Kong Polytechnic University; Research Grants Council, University Grants Committee; National Natural Science Foundation of China","keywords":"Determinism; Computer science; Econometrics; Economics; Epistemology; Philosophy","score_opus":0.5115057049763427,"score_gpt":0.5065944696810811,"score_spread":0.004911235295261607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395704223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98698384,0.0006740023,0.0015322267,0.0015054543,0.00055645505,0.000107305954,0.00003356765,0.000007895156,0.008599264],"genre_scores_gemma":[0.99575204,0.0006020824,0.0019183701,0.00003561528,0.0006216451,9.739724e-7,0.000011296428,0.000016423786,0.0010415522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99419045,0.0018836332,0.0009435107,0.00024998415,0.0025096138,0.00022279104],"domain_scores_gemma":[0.99383867,0.0036141544,0.00019623314,0.00056742836,0.0016720415,0.00011146619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017130144,0.000095995965,0.00017420486,0.00062446314,0.00041293728,0.0008036367,0.0015627843,0.000020075731,0.00031767137],"category_scores_gemma":[0.0040267105,0.000053060015,0.000058510443,0.0012071162,0.00029930408,0.001135623,0.00041619194,0.0005017516,0.0001295074],"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.0015784743,0.00015207804,0.003387008,0.000023702407,0.00029004941,0.006447091,0.019176545,0.34265134,0.0022340456,0.0048073656,0.09760452,0.5216478],"study_design_scores_gemma":[0.0017728474,0.0029460152,0.021515723,0.00036296094,0.000055008953,0.004370713,0.011739607,0.75612986,0.00055473903,0.0002410602,0.19997399,0.00033746017],"about_ca_topic_score_codex":0.000013082695,"about_ca_topic_score_gemma":0.000010119952,"teacher_disagreement_score":0.5213103,"about_ca_system_score_codex":0.000040364335,"about_ca_system_score_gemma":0.0005832094,"threshold_uncertainty_score":0.7749487},"labels":[],"label_agreement":null},{"id":"W4396668190","doi":"10.1016/j.ejor.2024.04.037","title":"Dynamic rebalancing optimization for bike-sharing systems: A modeling framework and empirical comparison","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":23,"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é du Québec à Montréal; Polytechnique Montréal; Transport Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Flexibility (engineering); Set (abstract data type); Operations research; Variety (cybernetics); Mathematical optimization; Integer programming; Interdependence; TRIPS architecture; Event (particle physics); Industrial engineering; Artificial intelligence","score_opus":0.13384685511076894,"score_gpt":0.4194569935858371,"score_spread":0.28561013847506816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396668190","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.13736889,0.0014545416,0.85985655,0.00044252368,0.0002890788,0.00015005296,0.000012626244,0.00004429684,0.00038147043],"genre_scores_gemma":[0.96714914,0.00009663672,0.032464042,0.000016215876,0.00016274724,0.0000063966095,0.000024414529,0.00003174127,0.000048670794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.00008373005,0.0005203847,0.00012013815,0.0003497752,0.00015019254],"domain_scores_gemma":[0.9991026,0.00023231834,0.000020071086,0.00007485387,0.00049609103,0.00007407727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022568523,0.00007294383,0.00011904326,0.00033669014,0.00014941672,0.00037123653,0.000112136804,0.000028017936,0.000021520143],"category_scores_gemma":[0.00022418961,0.000066769535,0.000036367273,0.00032692627,0.000025764486,0.0002715926,0.000012544735,0.0004688163,0.0000050240064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012552483,0.000010914437,0.00029570353,0.00013609527,0.000037325266,0.000010485173,0.00068944105,0.9930386,0.0003319651,0.0041946466,0.0005269366,0.00071534177],"study_design_scores_gemma":[0.00014239407,0.00006137382,0.00038695848,0.00036341086,0.000008665866,0.000024129382,0.00038281598,0.99687886,0.000008126959,0.00012934092,0.0015503303,0.00006361143],"about_ca_topic_score_codex":9.587254e-7,"about_ca_topic_score_gemma":0.000001067403,"teacher_disagreement_score":0.8297803,"about_ca_system_score_codex":0.00009270254,"about_ca_system_score_gemma":0.00008291943,"threshold_uncertainty_score":0.35798424},"labels":[],"label_agreement":null},{"id":"W4396744001","doi":"10.1016/j.ejor.2024.05.003","title":"Consensus adjustment for multi-attribute group decision making based on cross-allocation","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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 Alberta","funders":"Humanities and Social Science Fund of Ministry of Education of China; Nanjing University of Information Science and Technology; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Group decision-making; Group (periodic table); Computer science; Operations research; Psychology; Mathematics; Social psychology","score_opus":0.5106377270280633,"score_gpt":0.5767042496599998,"score_spread":0.06606652263193646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396744001","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.12603217,0.0010911019,0.8643298,0.0039051394,0.002741454,0.0007136454,0.00012564484,0.000031019772,0.0010300175],"genre_scores_gemma":[0.878531,0.000018803525,0.11915888,0.0003863186,0.0009055609,0.00001019981,0.000010225598,0.000051218976,0.00092780805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98795086,0.0027295738,0.0019590221,0.00068761106,0.006198209,0.00047472422],"domain_scores_gemma":[0.97649395,0.017005248,0.00027449662,0.0005547351,0.005418819,0.00025275655],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.053283263,0.00021596093,0.00032213016,0.0018982474,0.0006359809,0.0031879367,0.00134961,0.00005699068,0.0008082573],"category_scores_gemma":[0.03291533,0.00014990768,0.0003178713,0.0010189797,0.0002114946,0.00049569766,0.0002300264,0.0007050693,0.000779966],"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.0028078258,0.0006227953,0.0012684645,0.000047081143,0.00008497946,0.0014354938,0.0005371027,0.11496085,0.012832434,0.01435184,0.13054147,0.72050965],"study_design_scores_gemma":[0.0030000778,0.00139502,0.067317195,0.0011847939,0.00001325313,0.00017258259,0.00028286595,0.8021139,0.00046158765,0.001694104,0.12207775,0.00028689468],"about_ca_topic_score_codex":9.116964e-7,"about_ca_topic_score_gemma":0.00000298453,"teacher_disagreement_score":0.7524988,"about_ca_system_score_codex":0.00034718664,"about_ca_system_score_gemma":0.00061534706,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W4396768746","doi":"10.1016/j.ejor.2024.05.012","title":"A disaggregated integer L-shaped method for stochastic vehicle routing problems with monotonic recourse","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Monotonic function; Integer programming; Integer (computer science); Mathematical optimization; Computer science; Routing (electronic design automation); Mathematics; Computer network","score_opus":0.0710932116016096,"score_gpt":0.3777479419120455,"score_spread":0.30665473031043594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396768746","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.010029918,0.00067601696,0.986299,0.0010438038,0.00021315098,0.0003754183,0.000010865996,0.000098100274,0.0012537733],"genre_scores_gemma":[0.7332157,0.000028217331,0.2655423,0.000022700568,0.00042752747,0.000017213733,0.000007954009,0.00012629812,0.0006121242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971717,0.0010056095,0.0005665119,0.00021023976,0.0006692408,0.00037668238],"domain_scores_gemma":[0.99742836,0.001210923,0.000057658857,0.00014541698,0.0009935908,0.00016405348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010349891,0.00015555813,0.0002074479,0.00039876133,0.0001948607,0.00045039397,0.0003033333,0.00003212985,0.00009711836],"category_scores_gemma":[0.0010112125,0.00011995061,0.000085453365,0.00065633014,0.00006204787,0.000389764,0.000045965087,0.00084227504,0.00004011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008441635,0.000025768051,0.000012203561,0.000090824906,0.00014989682,0.00006387277,0.0009527795,0.9651281,0.012393346,0.0009967652,0.0010978662,0.01900413],"study_design_scores_gemma":[0.00060442486,0.000369671,0.00011562767,0.0006122266,0.000023124103,0.00016643011,0.00015686566,0.9950687,0.00056560215,0.00010138334,0.0020714886,0.00014442962],"about_ca_topic_score_codex":0.0000017390747,"about_ca_topic_score_gemma":0.0000016936614,"teacher_disagreement_score":0.7231857,"about_ca_system_score_codex":0.00019082769,"about_ca_system_score_gemma":0.0002842791,"threshold_uncertainty_score":0.48914438},"labels":[],"label_agreement":null},{"id":"W4396807394","doi":"10.1016/j.ejor.2024.05.008","title":"The future of transport: Coordination in a new field between public and private transport","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Transportation and Mobility Innovations","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":"Public transport; Field (mathematics); Business; Industrial organization; Transport engineering; Engineering; Mathematics","score_opus":0.052208767578920005,"score_gpt":0.3252113714085458,"score_spread":0.27300260382962577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396807394","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96159565,0.0022615849,0.012789684,0.020538814,0.0002283235,0.00017100437,0.000019936755,0.000020577267,0.0023744123],"genre_scores_gemma":[0.99869263,0.00034803487,0.00036983215,0.000015943482,0.00027075838,0.0000011217342,0.000015357084,0.000013602235,0.0002727401],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99880606,0.0001005097,0.00049700745,0.00007029473,0.0004015573,0.0001245691],"domain_scores_gemma":[0.9993662,0.00022131474,0.000020547448,0.00006899693,0.00025171906,0.000071206756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022851794,0.000059063572,0.00009243925,0.00028867446,0.00007178335,0.00005665614,0.00014965881,0.00002245488,0.00005334359],"category_scores_gemma":[0.00004633058,0.00004352618,0.000038454076,0.00054300425,0.000050096936,0.00028068415,0.0000032188912,0.00048075506,0.0000030487265],"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.00018079593,0.00013548612,0.15104437,0.00057148567,0.00048079639,0.0004042015,0.01014494,0.008018489,0.017630264,0.32440704,0.024719838,0.4622623],"study_design_scores_gemma":[0.0005284829,0.00017493372,0.7407166,0.0001439771,0.0000109407265,0.000016515452,0.0003032047,0.00076762895,0.0007896666,0.00053751207,0.2559217,0.00008889004],"about_ca_topic_score_codex":0.000003587396,"about_ca_topic_score_gemma":0.00006618999,"teacher_disagreement_score":0.5896722,"about_ca_system_score_codex":0.00002598017,"about_ca_system_score_gemma":0.00021602755,"threshold_uncertainty_score":0.20886682},"labels":[],"label_agreement":null},{"id":"W4397031293","doi":"10.1016/j.ejor.2024.05.034","title":"Worst-case Conditional Value at Risk for asset liability management: A framework for general loss functions","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Dalhousie University","funders":"","keywords":"Liability; Actuarial science; Value (mathematics); Risk management; Asset (computer security); Value at risk; Business; Computer science; Econometrics; Economics; Mathematics; Finance; Statistics; Computer security","score_opus":0.20360037111206564,"score_gpt":0.48741996012274114,"score_spread":0.2838195890106755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397031293","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.08056865,0.00037870646,0.9097917,0.003290945,0.0010014961,0.00063633866,0.00094903284,0.000015057562,0.0033680403],"genre_scores_gemma":[0.76876986,0.00038392158,0.20852783,0.00020303015,0.0030945046,0.00006846922,0.00023317717,0.000058107587,0.018661093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946126,0.0014376447,0.0010512378,0.00044581413,0.0021165512,0.00033616132],"domain_scores_gemma":[0.99055284,0.005899008,0.0002030781,0.0003185681,0.0027832163,0.00024331182],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.026326057,0.0001383539,0.00020795787,0.0007341874,0.0011988851,0.0011596741,0.0005194098,0.000049516893,0.00085503067],"category_scores_gemma":[0.006892547,0.00010124305,0.00032576054,0.00089413795,0.000201976,0.00065746106,0.00015255342,0.00051871384,0.00035571464],"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.0008061744,0.00019788662,0.0014788201,0.000031175867,0.00025519717,0.0012411001,0.00044669077,0.10356861,0.00005705333,0.5737603,0.29417726,0.023979768],"study_design_scores_gemma":[0.00092227367,0.0006436242,0.0066008456,0.00007128455,0.00006003507,0.0011411133,0.0003105855,0.09223331,0.000047772,0.2579656,0.6398186,0.00018495774],"about_ca_topic_score_codex":0.0000022367133,"about_ca_topic_score_gemma":0.0000034985292,"teacher_disagreement_score":0.7012639,"about_ca_system_score_codex":0.00018242354,"about_ca_system_score_gemma":0.00029890068,"threshold_uncertainty_score":0.9998772},"labels":[],"label_agreement":null},{"id":"W4399534518","doi":"10.1016/j.ejor.2024.06.016","title":"A review of recent advances in time-dependent vehicle routing","year":2024,"lang":"en","type":"review","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"Ministero dell'Istruzione e del Merito; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vehicle routing problem; Computer science; Discretization; Routing (electronic design automation); Field (mathematics); Travel time; Operations research; Graph; Data science; Machine learning; Artificial intelligence; Theoretical computer science; Transport engineering; Computer network; Mathematics; Engineering","score_opus":0.13910451194393095,"score_gpt":0.45000431415672326,"score_spread":0.31089980221279234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399534518","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.0000014440776,0.99073076,0.0008497368,0.00008571701,0.00022351598,0.00033310935,0.000015913252,0.000019030824,0.0077407937],"genre_scores_gemma":[0.0000059645618,0.9945803,0.004681071,0.00002149816,0.00032990074,0.0000057257294,0.000015173182,0.00011189026,0.00024843626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99249464,0.0037392224,0.0019634557,0.00020904129,0.0012925906,0.0003010362],"domain_scores_gemma":[0.998014,0.0005706127,0.00025339675,0.00022664874,0.0008176788,0.00011766721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020840226,0.00023379714,0.0010366165,0.0007124441,0.000047571622,0.000106490486,0.00071688613,0.00005408491,0.0004419102],"category_scores_gemma":[0.002178096,0.00018259634,0.0002438181,0.001215003,0.000052712207,0.0002492466,0.0001803744,0.0017094829,0.00028748403],"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.0000041614007,0.000030809635,0.0000013464439,0.052968815,0.000076605575,0.00016236244,0.000050838375,0.009190721,0.000008774328,0.000060153714,0.0026322014,0.9348132],"study_design_scores_gemma":[0.000114778864,0.00006374613,0.0000011369895,0.16421455,0.0000718702,0.00011749105,0.0000062437025,0.001988664,0.000004748898,0.0000065878003,0.83327734,0.0001328263],"about_ca_topic_score_codex":2.6363912e-7,"about_ca_topic_score_gemma":2.4449406e-7,"teacher_disagreement_score":0.9346804,"about_ca_system_score_codex":0.00035543603,"about_ca_system_score_gemma":0.0004925172,"threshold_uncertainty_score":0.74460626},"labels":[],"label_agreement":null},{"id":"W4400026546","doi":"10.1016/j.ejor.2024.06.035","title":"Strategic flood impact mitigation in developing countries’ urban road networks: Application to Hanoi","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"HEC Montréal","funders":"Engineering and Physical Sciences Research Council; British Academy","keywords":"Flood myth; Developing country; Environmental planning; Business; Flood mitigation; Environmental resource management; Geography; Environmental science; Economic growth; Economics","score_opus":0.07073657842893145,"score_gpt":0.34955435448670347,"score_spread":0.278817776057772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400026546","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.854181,0.0010933705,0.08442617,0.029563075,0.0009679863,0.0009410396,0.0000057550214,0.000069671485,0.028751923],"genre_scores_gemma":[0.99692965,0.00009980465,0.0003080237,0.00078738015,0.0014764596,0.000011038402,0.000042612897,0.00002270106,0.0003223243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979089,0.00015860521,0.0005988691,0.00022542596,0.0008260119,0.00028217942],"domain_scores_gemma":[0.99882436,0.00003816539,0.000040355906,0.0001363161,0.0009225435,0.00003824844],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0056739985,0.0001200798,0.000125254,0.00091654586,0.00018884387,0.000988877,0.00033510113,0.000020633852,0.00033905992],"category_scores_gemma":[0.00016602917,0.0001028593,0.00006302073,0.0013663103,0.000036173467,0.0011406968,0.0001098854,0.00031668108,0.0011105085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025429187,0.00017725692,0.0052214875,0.00038408118,0.000120114375,0.00021681789,0.00068711565,0.5711254,0.001133767,0.33222172,0.06869558,0.019762393],"study_design_scores_gemma":[0.00073782686,0.00013804325,0.12968382,0.0006021388,0.000020217827,0.000016516306,0.0006498006,0.5851216,0.000044595927,0.0010773891,0.2815065,0.0004015893],"about_ca_topic_score_codex":0.00018078124,"about_ca_topic_score_gemma":0.00015335475,"teacher_disagreement_score":0.33114433,"about_ca_system_score_codex":0.00024966933,"about_ca_system_score_gemma":0.00022625703,"threshold_uncertainty_score":0.9996672},"labels":[],"label_agreement":null},{"id":"W4400345555","doi":"10.1016/j.ejor.2024.07.003","title":"Navigating supplier encroachment: Game-theoretic insights for outsourcing strategies","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Western University","funders":"","keywords":"Outsourcing; Game theory; Business; Industrial organization; Computer science; Process management; Knowledge management; Microeconomics; Economics; Marketing","score_opus":0.07199894293832874,"score_gpt":0.3528335797959026,"score_spread":0.2808346368575738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400345555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574319,0.004734187,0.06326519,0.016995817,0.0033109882,0.0015766894,0.00001177451,0.0001757065,0.3524978],"genre_scores_gemma":[0.99402124,0.000035279987,0.000618889,0.00043980297,0.00399579,0.0000101489295,0.000023736275,0.000049037088,0.0008060677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978857,0.00014539812,0.00051746867,0.00022475379,0.00090429303,0.000322358],"domain_scores_gemma":[0.9988127,0.00023066737,0.00009650008,0.00012937024,0.00069814874,0.00003263361],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0049446733,0.0001391143,0.00014915325,0.0003425971,0.000343338,0.0025507247,0.0004264848,0.000018737765,0.0005961311],"category_scores_gemma":[0.00029437675,0.000108401444,0.00013164069,0.00041390766,0.00013095354,0.0016439733,0.00017974403,0.0005724919,0.00033083584],"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.00011755263,0.00010173989,0.00014362257,0.00060818484,0.00013873757,0.00037260097,0.0018398212,0.00574348,0.0028920707,0.9328139,0.033486698,0.021741582],"study_design_scores_gemma":[0.0010120864,0.00020736987,0.0007504255,0.0010161338,0.000049633672,0.000028853754,0.0069782822,0.05693782,0.0003094176,0.023223452,0.90917724,0.00030926202],"about_ca_topic_score_codex":0.000007182977,"about_ca_topic_score_gemma":0.0000016480641,"teacher_disagreement_score":0.9095905,"about_ca_system_score_codex":0.000082368366,"about_ca_system_score_gemma":0.00009592996,"threshold_uncertainty_score":0.99848473},"labels":[],"label_agreement":null},{"id":"W4400612448","doi":"10.1016/j.ejor.2024.07.013","title":"An exact method for trilevel hub location problem with interdiction","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interdiction; Computer science; Mathematical optimization; Operations research; Mathematics; Engineering","score_opus":0.11989462850418424,"score_gpt":0.39619546540385914,"score_spread":0.2763008368996749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400612448","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.015617132,0.00017903971,0.9580208,0.008710679,0.0004974527,0.00058122596,0.000004325559,0.00005183911,0.016337482],"genre_scores_gemma":[0.98131007,0.000016359629,0.014646174,0.0003354764,0.0019163531,0.000018145873,0.000054113312,0.000033114517,0.0016701984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830157,0.0001962981,0.0004140278,0.00020514417,0.0007022997,0.00018064301],"domain_scores_gemma":[0.997781,0.00006400446,0.000043596603,0.00013005118,0.0019538342,0.000027540425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008309565,0.00009473629,0.00010111527,0.0006332528,0.00025668426,0.0008462132,0.00027648293,0.000013823911,0.0003402048],"category_scores_gemma":[0.0002078361,0.00006988851,0.000052479674,0.0006472258,0.000038199592,0.0018893878,0.000046888075,0.00024545813,0.0002178606],"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.0014246375,0.0006864398,0.00031309546,0.0015617593,0.0003917349,0.00010543734,0.0011823727,0.21083058,0.007634769,0.2814819,0.15731353,0.33707374],"study_design_scores_gemma":[0.0008753122,0.0005376215,0.005617218,0.0003325663,0.000047684836,0.000028289965,0.0008401908,0.49938747,0.00012858905,0.001131619,0.49087328,0.00020016193],"about_ca_topic_score_codex":0.000052993604,"about_ca_topic_score_gemma":0.000043865344,"teacher_disagreement_score":0.96569294,"about_ca_system_score_codex":0.0000765421,"about_ca_system_score_gemma":0.00013220304,"threshold_uncertainty_score":0.81600535},"labels":[],"label_agreement":null},{"id":"W4401047045","doi":"10.1016/j.ejor.2024.07.024","title":"Decision-focused neural adaptive search and diving for optimizing mining complexes","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Mining Techniques and Economics","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":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Institut de Valorisation des Données","keywords":"Computer science; Heuristics; Robustness (evolution); Mathematical optimization; Heuristic; Machine learning; Context (archaeology); Decision tree; Artificial neural network; Artificial intelligence; Data mining; Mathematics","score_opus":0.14691644036628485,"score_gpt":0.3561576719259006,"score_spread":0.20924123155961574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401047045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8236261,0.0018476534,0.17158757,0.00030144321,0.0002204991,0.00016040484,0.000018592278,0.00005631095,0.0021814138],"genre_scores_gemma":[0.8441633,0.0001496261,0.15519126,0.000012494746,0.0003609678,0.0000024394756,0.0000018618182,0.000041502848,0.00007652981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988858,0.00012961365,0.00034251672,0.00012560481,0.00028041916,0.00023602562],"domain_scores_gemma":[0.9986436,0.0009204367,0.000012822296,0.000063551364,0.00024584625,0.00011374295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037643898,0.0000866987,0.00013332887,0.0003181301,0.00018646017,0.00046687305,0.00020633699,0.000017795224,0.00005388861],"category_scores_gemma":[0.00016580375,0.00007612537,0.000054895707,0.000119108896,0.000059240898,0.00031930878,0.00009717328,0.00039079587,0.000008770663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037759452,0.000041593863,0.00041962514,0.00025791966,0.00029230674,0.0005780745,0.0061390516,0.5541599,0.02748307,0.01623466,0.048568223,0.345448],"study_design_scores_gemma":[0.0002794359,0.00039481814,0.0008409524,0.00033268033,0.0000052156106,0.0001435446,0.00033356837,0.99169135,0.0008022341,0.00019580011,0.0048674676,0.00011295837],"about_ca_topic_score_codex":0.0000012280718,"about_ca_topic_score_gemma":0.0000012762571,"teacher_disagreement_score":0.43753144,"about_ca_system_score_codex":0.00007224077,"about_ca_system_score_gemma":0.00005976226,"threshold_uncertainty_score":0.45020676},"labels":[],"label_agreement":null},{"id":"W4401116280","doi":"10.1016/j.ejor.2024.07.032","title":"The impact of the correlation coefficient of interarrival and service times on queueing performance: The M/M/1 case","year":2024,"lang":"lv","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queueing theory; Correlation coefficient; Mathematics; Computer science; Discrete mathematics; Statistics","score_opus":0.03912774083259004,"score_gpt":0.34208057404994663,"score_spread":0.3029528332173566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401116280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98732215,0.0016566768,0.00029808542,0.0052564424,0.000338382,0.00020370996,0.000007267007,0.0000038554804,0.004913442],"genre_scores_gemma":[0.99817383,0.00017170943,0.000015526586,0.00009204471,0.0006437986,7.831059e-7,0.0000020691027,0.00002617454,0.0008740446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702346,0.0010505896,0.00068383396,0.00015369212,0.0008702863,0.0002181074],"domain_scores_gemma":[0.9961269,0.0015383551,0.00037058612,0.00027893676,0.0016613993,0.00002384011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011052588,0.0001448094,0.00017674989,0.00029491546,0.0010587604,0.00068322604,0.0005911054,0.000020841082,0.00018067185],"category_scores_gemma":[0.001273591,0.00006371651,0.00019350629,0.0011157553,0.0003812971,0.0006739387,0.0004007442,0.00090975116,0.00005132208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013029957,0.00018841978,0.0018230744,0.00046505386,0.0008634524,0.0005004931,0.0038096542,0.8986513,0.0023114022,0.05260751,0.0058325706,0.031644087],"study_design_scores_gemma":[0.0004723375,0.00036328434,0.010429393,0.0020699373,0.0001529584,0.00047452262,0.002681735,0.97792685,0.00025921874,0.0007443924,0.004290892,0.00013450602],"about_ca_topic_score_codex":0.000064062944,"about_ca_topic_score_gemma":0.000011683121,"teacher_disagreement_score":0.07927554,"about_ca_system_score_codex":0.000094186464,"about_ca_system_score_gemma":0.00021974882,"threshold_uncertainty_score":0.81432366},"labels":[],"label_agreement":null},{"id":"W4401360965","doi":"10.1016/j.ejor.2024.08.006","title":"A value-at-risk based approach to the routing problem of multi-hazmat railcars","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","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":"McMaster University; Memorial University of Newfoundland","funders":"","keywords":"Consolidation (business); Computer science; Operations research; Routing (electronic design automation); Heuristic; Vehicle routing problem; Mathematical optimization; Risk analysis (engineering); Engineering; Business; Mathematics","score_opus":0.26036987565083997,"score_gpt":0.4503271222721118,"score_spread":0.18995724662127184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401360965","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.23098402,0.004106223,0.6302926,0.04751592,0.00049313647,0.0009799289,0.00013190068,0.000029771505,0.08546652],"genre_scores_gemma":[0.958985,0.000089263696,0.035401348,0.00012057809,0.00029402718,0.0000028130164,0.000002847433,0.000021358663,0.005082815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98749155,0.005863787,0.0012826817,0.00034806735,0.0047133514,0.00030059184],"domain_scores_gemma":[0.9939257,0.0030340615,0.00021881254,0.00040708703,0.0021988787,0.0002154976],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.06320465,0.0001159994,0.00027468108,0.0008265061,0.0006282122,0.00074995414,0.0015487297,0.000022183185,0.00029280546],"category_scores_gemma":[0.006789071,0.000059875027,0.0003311478,0.002234242,0.00017625673,0.00031295142,0.0003341378,0.00075575494,0.00063927576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003388665,0.00028924408,0.0028467656,0.000022404496,0.00024112016,0.00016436349,0.0069973413,0.80001277,0.0038252308,0.008418939,0.059605923,0.11723701],"study_design_scores_gemma":[0.0009364799,0.0005628524,0.022353262,0.00022638396,0.00005942485,0.00012784387,0.0027905111,0.79003215,0.00093364366,0.0012501036,0.1805043,0.00022306555],"about_ca_topic_score_codex":0.000022183083,"about_ca_topic_score_gemma":0.000009737091,"teacher_disagreement_score":0.72800094,"about_ca_system_score_codex":0.0001037516,"about_ca_system_score_gemma":0.00053574744,"threshold_uncertainty_score":0.9646279},"labels":[],"label_agreement":null},{"id":"W4401800953","doi":"10.1016/j.ejor.2024.08.019","title":"Evaluation of counterparty credit risk under netting agreements","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","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":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de Recherche du Québec-Société et Culture","keywords":"Netting; Credit risk; Business; Credit valuation adjustment; Risk management; Counterparty; Actuarial science; Risk analysis (engineering); Computer science; Finance; Credit reference","score_opus":0.22361206701232308,"score_gpt":0.3885214138056383,"score_spread":0.16490934679331523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401800953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92012644,0.007861257,0.01782958,0.0010536863,0.0010856515,0.00019626542,0.00016243568,0.0000070476217,0.051677663],"genre_scores_gemma":[0.9974856,0.00033277972,0.0006144499,0.000008356408,0.000947597,0.0000020191928,0.000011439701,0.000018402965,0.0005793595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976749,0.00044990945,0.0008637263,0.00016899355,0.00067005923,0.00017243112],"domain_scores_gemma":[0.99798995,0.00021447579,0.000246188,0.00013769713,0.0013402967,0.00007137771],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02517965,0.00007106099,0.0001665709,0.0005107599,0.00018220574,0.0001847349,0.00022653717,0.000022783363,0.0010119602],"category_scores_gemma":[0.0017477018,0.0000680361,0.000108632696,0.00039664976,0.00009094162,0.00039366074,0.00005558138,0.00039506916,0.00035176115],"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.00015838051,0.00052019325,0.058399122,0.00009703735,0.00083255704,0.00009825787,0.004497975,0.08067102,0.0015314707,0.6261561,0.09241517,0.13462274],"study_design_scores_gemma":[0.001273908,0.00055174844,0.6900307,0.00027056722,0.000058690806,0.000037208185,0.00035568915,0.1299441,0.00017460411,0.038503006,0.13858612,0.00021365394],"about_ca_topic_score_codex":0.00002673536,"about_ca_topic_score_gemma":0.0000068643308,"teacher_disagreement_score":0.63163155,"about_ca_system_score_codex":0.00020756916,"about_ca_system_score_gemma":0.00032709268,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W4402118037","doi":"10.1016/j.ejor.2024.08.030","title":"End-to-end, decision-based, cardinality-constrained portfolio optimization","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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 Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cardinality (data modeling); Computer science; Portfolio; End-to-end principle; Mathematical optimization; Portfolio optimization; Operations research; Branch and bound; Business; Mathematics; Algorithm; Artificial intelligence; Data mining; Finance","score_opus":0.14955321770607521,"score_gpt":0.4483302913334653,"score_spread":0.2987770736273901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402118037","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.024653273,0.0008149778,0.9030114,0.006672477,0.0013040038,0.0003087538,0.00006116904,0.00003231808,0.06314163],"genre_scores_gemma":[0.9290251,0.00023357957,0.06552546,0.00035449502,0.0010834108,0.0000036357421,0.00002582272,0.000044746146,0.0037037092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.988996,0.0024561293,0.0016553154,0.00050648075,0.0059803706,0.0004056866],"domain_scores_gemma":[0.9906459,0.0033961316,0.00018762569,0.0004585051,0.004795882,0.0005159994],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch","insufficient_payload"],"category_scores_codex":[0.037447184,0.00018519694,0.00032211456,0.002411415,0.00045050756,0.002243495,0.0011291718,0.00004868127,0.005564064],"category_scores_gemma":[0.010457462,0.00013199603,0.0002739761,0.0030613584,0.0002046234,0.00094481243,0.0001573363,0.00070160825,0.001311183],"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.00017706622,0.00005262776,0.00068608276,0.0000027636518,0.00003307453,0.0007569973,0.00021893893,0.80369455,0.00018680663,0.003858053,0.052453306,0.13787973],"study_design_scores_gemma":[0.0011261817,0.0011046707,0.008434458,0.00033840272,0.000034331824,0.0006520059,0.00059240736,0.40341008,0.00045029886,0.0028280076,0.5805998,0.00042934812],"about_ca_topic_score_codex":0.000006975129,"about_ca_topic_score_gemma":0.0000029503965,"teacher_disagreement_score":0.90437186,"about_ca_system_score_codex":0.00015486065,"about_ca_system_score_gemma":0.0017196974,"threshold_uncertainty_score":0.9994664},"labels":[],"label_agreement":null},{"id":"W4402547213","doi":"10.1016/j.ejor.2024.09.025","title":"Attention-based dynamic multilayer graph neural networks for loan default prediction","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Distress and Bankruptcy Prediction","field":"Business, Management and Accounting","cited_by":38,"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":"Economic and Social Research Council; Alliance de recherche numérique du Canada; Icelandic Centre for Research; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Loan; Artificial neural network; Graph; Artificial intelligence; Econometrics; Machine learning; Finance; Business; Economics; Theoretical computer science","score_opus":0.04369009283269483,"score_gpt":0.3155599658831095,"score_spread":0.27186987305041466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402547213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5669361,0.0016366425,0.41436565,0.0064592534,0.004715209,0.0008430672,0.00008569562,0.00014847952,0.00480991],"genre_scores_gemma":[0.99574256,0.000019214209,0.0002658456,0.00020344165,0.0032690305,0.000010817963,0.00014211351,0.00003876947,0.00030822385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982751,0.00010221637,0.0004657655,0.00020564038,0.00068582286,0.0002654316],"domain_scores_gemma":[0.99841356,0.0001391283,0.00009437603,0.000098563214,0.0012277778,0.00002661991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028071732,0.000115971394,0.000117449934,0.000562131,0.00042145918,0.0009375271,0.00023472842,0.000032777116,0.00011795926],"category_scores_gemma":[0.00031310922,0.00009445425,0.00018511027,0.0005134928,0.00007725027,0.0010752059,0.000048837544,0.00043859455,0.000057987465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018427793,0.00072489516,0.013217745,0.0010043661,0.00030231057,0.0006960155,0.00012106639,0.60322076,0.011618427,0.031157486,0.15596013,0.18013401],"study_design_scores_gemma":[0.00059890794,0.0001141023,0.06511914,0.00019185539,0.00002733182,0.000009828567,0.00003081393,0.90324676,0.0000069108273,0.00022947844,0.030338032,0.00008681173],"about_ca_topic_score_codex":0.000015073051,"about_ca_topic_score_gemma":0.000013628978,"teacher_disagreement_score":0.42880645,"about_ca_system_score_codex":0.00006447979,"about_ca_system_score_gemma":0.000074763804,"threshold_uncertainty_score":0.9040595},"labels":[],"label_agreement":null},{"id":"W4403286383","doi":"10.1016/j.ejor.2024.10.002","title":"A new lattice approach for risk-minimization hedging under generalized autoregressive conditional heteroskedasticity models","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Risk and Volatility Modeling","field":"Economics, Econometrics and Finance","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":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Heteroscedasticity; Autoregressive model; Econometrics; Minification; Autoregressive conditional heteroskedasticity; Mathematics; Computer science; Economics; Mathematical optimization; Volatility (finance)","score_opus":0.2020527431029314,"score_gpt":0.35051977132124723,"score_spread":0.14846702821831584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403286383","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.03393044,0.0026955593,0.958921,0.0006628121,0.00026923543,0.00021577872,0.00020922211,0.000014919262,0.0030810297],"genre_scores_gemma":[0.88356745,0.00018271858,0.11378947,0.00007696508,0.0011386998,0.0000068177624,0.000087911736,0.000041188152,0.0011087703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804366,0.00026218488,0.00083878654,0.0003212993,0.00025237512,0.00028168393],"domain_scores_gemma":[0.9985733,0.0003720292,0.00021475721,0.00012533662,0.00055706955,0.00015752362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046788976,0.00012623113,0.00026076287,0.00045958397,0.00037792546,0.0004707733,0.00026946008,0.000044747838,0.000155295],"category_scores_gemma":[0.0008341992,0.00012297343,0.00017798963,0.000240191,0.00006816899,0.00076862273,0.0000615108,0.0005249902,0.000056754416],"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.00012220567,0.000057481648,0.0002634826,0.0000404549,0.00009154043,0.000011147899,0.00071558426,0.4615519,0.00005443935,0.529852,0.0057354104,0.0015043761],"study_design_scores_gemma":[0.0007017451,0.00014881189,0.0016628462,0.00005236284,0.000009462877,0.000022908354,0.000047889698,0.88568693,0.000027457492,0.10736174,0.0041536936,0.00012413996],"about_ca_topic_score_codex":0.000031000905,"about_ca_topic_score_gemma":0.0000015042091,"teacher_disagreement_score":0.84963703,"about_ca_system_score_codex":0.00017486124,"about_ca_system_score_gemma":0.00033701333,"threshold_uncertainty_score":0.5014711},"labels":[],"label_agreement":null},{"id":"W4403364360","doi":"10.1016/j.ejor.2024.10.014","title":"Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mediation; Inverse; Mathematical optimization; Conflict resolution; Graph; Path (computing); Theoretical computer science; Operations research; Mathematics; Political science; Computer network","score_opus":0.6142092893936134,"score_gpt":0.4791714146721988,"score_spread":0.1350378747214146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403364360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64708585,0.00032116557,0.29533854,0.05108382,0.00068340806,0.0006941489,0.000029071189,0.000023059334,0.0047409604],"genre_scores_gemma":[0.9939458,0.0000758924,0.0035297421,0.00057218154,0.00062428886,0.000037218288,0.0000023317034,0.000018134337,0.0011944615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9927264,0.0031910853,0.00079296896,0.00026181468,0.0027936248,0.00023410362],"domain_scores_gemma":[0.99165773,0.006113956,0.00012643271,0.00044923235,0.0014585112,0.00019413106],"candidate_categories":["metaresearch","scholarly_communication","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.041213542,0.00009935241,0.000120561126,0.00042813364,0.0009173428,0.0011881314,0.0013202601,0.00001908167,0.0000993231],"category_scores_gemma":[0.013712638,0.000048741418,0.00010979743,0.0017430921,0.00027621878,0.000668706,0.00019241005,0.0009440017,0.00078642205],"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.00035567416,0.00008155061,0.000055803204,0.0000067789383,0.000062288455,0.000080574566,0.030206632,0.37454757,0.010086926,0.4959829,0.072726555,0.015806759],"study_design_scores_gemma":[0.00053826225,0.00058941904,0.006864678,0.00045679635,0.000033899923,0.00015008493,0.013863794,0.6474032,0.001570951,0.21003923,0.118155666,0.0003340434],"about_ca_topic_score_codex":0.0000021769297,"about_ca_topic_score_gemma":0.000007139074,"teacher_disagreement_score":0.34685993,"about_ca_system_score_codex":0.0000744035,"about_ca_system_score_gemma":0.00042957795,"threshold_uncertainty_score":0.9999916},"labels":[],"label_agreement":null},{"id":"W4403822217","doi":"10.1016/j.ejor.2024.10.035","title":"Interrelationships of Non-cooperative, Classical and Pareto coalitional stability definitions","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University; University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Pareto principle; Stability (learning theory); Mathematical economics; Pareto optimal; Mathematical optimization; Computer science; Mathematics; Multi-objective optimization; Machine learning","score_opus":0.5622902772644344,"score_gpt":0.5054436516394628,"score_spread":0.05684662562497156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403822217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951903,0.0005065366,0.046381492,0.0118014645,0.00017939712,0.00021138995,0.00018965013,0.000009846781,0.045529913],"genre_scores_gemma":[0.99703175,0.000045729143,0.002020838,0.00004510205,0.0002060403,0.000005210338,0.00001146661,0.000010562085,0.00062329194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99412644,0.0027144374,0.0010197632,0.00025764902,0.0017216832,0.00016005313],"domain_scores_gemma":[0.9907907,0.0062430105,0.000105432104,0.00022895164,0.0024479171,0.00018395424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.019721817,0.000087607914,0.00019035563,0.0004702909,0.00035880817,0.00046951618,0.00046611845,0.000025768228,0.0015245533],"category_scores_gemma":[0.0062499144,0.000061140534,0.00010075792,0.0008536394,0.00074253866,0.000567389,0.0001561098,0.00069967925,0.00032292184],"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.00014035877,0.0002708973,0.0029494006,0.000020636842,0.00006423312,0.000067929876,0.0023738083,0.0005450113,0.014322848,0.95100904,0.020807391,0.0074284226],"study_design_scores_gemma":[0.0017580657,0.0021544956,0.35893583,0.0008020234,0.00006115724,0.0010801791,0.01073129,0.025097061,0.006986925,0.4668062,0.1250448,0.0005419913],"about_ca_topic_score_codex":0.0000011623399,"about_ca_topic_score_gemma":0.000005345573,"teacher_disagreement_score":0.48420286,"about_ca_system_score_codex":0.000046987832,"about_ca_system_score_gemma":0.0005367072,"threshold_uncertainty_score":0.9993882},"labels":[],"label_agreement":null},{"id":"W4404056536","doi":"10.1016/j.ejor.2024.10.033","title":"On the valuation of legacy power production in liberalized markets via option-pricing","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Electric Power System Optimization","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":"Impact","funders":"","keywords":"Valuation (finance); Production (economics); Economics; Microeconomics; Business; Variable pricing; Industrial organization; Financial economics; Finance","score_opus":0.05150839692378708,"score_gpt":0.3160417182370171,"score_spread":0.26453332131323004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404056536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88941604,0.001901697,0.0802357,0.003748351,0.0014623924,0.000609217,0.0000019829906,0.000047038004,0.022577574],"genre_scores_gemma":[0.99855125,0.00010753104,0.00069765595,0.000013467135,0.00018718865,0.000004053222,0.0000032485773,0.00003175329,0.00040382415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701625,0.0012553986,0.00054057734,0.00011252419,0.00092037336,0.00015489006],"domain_scores_gemma":[0.99877906,0.00046045933,0.00004831398,0.00013069533,0.000545199,0.000036281526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009118427,0.00008109359,0.00011051747,0.0006020275,0.00007103299,0.0001699057,0.00018916732,0.000019022786,0.00016806231],"category_scores_gemma":[0.0009874161,0.000057976133,0.00004718898,0.0007933844,0.000029343924,0.0005273349,0.000018949942,0.000514422,0.000064179956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019048835,0.00009432283,0.00007224285,0.000116533345,0.000119532815,0.00009910905,0.0024453765,0.8947515,0.061485678,0.016051117,0.013739791,0.010834312],"study_design_scores_gemma":[0.0013001653,0.0009525371,0.02290135,0.0025169898,0.000025546424,0.00039479672,0.0003464306,0.9368571,0.026376639,0.003224738,0.0047295447,0.00037417954],"about_ca_topic_score_codex":0.0000018242188,"about_ca_topic_score_gemma":7.2066945e-7,"teacher_disagreement_score":0.109135225,"about_ca_system_score_codex":0.00021724029,"about_ca_system_score_gemma":0.0001256695,"threshold_uncertainty_score":0.31602827},"labels":[],"label_agreement":null},{"id":"W4404212697","doi":"10.1016/j.ejor.2024.11.014","title":"Cap-and-trade under a dual-channel setting in the presence of information asymmetry","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","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":"Wilfrid Laurier University; Western University","funders":"Social Sciences and Humanities Research Council; Social Sciences and Humanities Research Council of Canada; Canada Research Chairs; CRC Health Group","keywords":"Dual (grammatical number); Information asymmetry; Asymmetry; Channel (broadcasting); Computer science; Economics; Mathematics; Telecommunications; Physics; Microeconomics; Linguistics; Philosophy","score_opus":0.19332780208832512,"score_gpt":0.4589287300325435,"score_spread":0.26560092794421836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404212697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87522566,0.0012237658,0.025479766,0.06211145,0.00020128269,0.00036246504,0.00003043658,0.000007820863,0.03535738],"genre_scores_gemma":[0.9989941,0.00003632971,0.00043284963,0.00020177159,0.00011787573,0.0000020034597,0.0000015289478,0.000004025376,0.00020948544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99498063,0.0021748843,0.00073356257,0.00010346707,0.0018710443,0.00013639394],"domain_scores_gemma":[0.99515474,0.0040905434,0.00010247104,0.00016528215,0.00043198207,0.000054976594],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.034552425,0.00005133817,0.0000918001,0.00054164365,0.00016023911,0.00055256666,0.00051323645,0.000013817351,0.00007544781],"category_scores_gemma":[0.00421597,0.000028986819,0.00004603198,0.0010062665,0.00017705366,0.0008856798,0.000105411586,0.0005124315,0.00010076372],"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.00014629809,0.00016047228,0.0006326378,0.00005073548,0.000053006577,0.00016392353,0.033035293,0.021716647,0.007563571,0.8102045,0.051549014,0.07472389],"study_design_scores_gemma":[0.001631193,0.0011462297,0.31937867,0.00092219247,0.000028689114,0.0021437982,0.075242825,0.05952329,0.003637506,0.35136667,0.18454283,0.00043611185],"about_ca_topic_score_codex":0.0000033092883,"about_ca_topic_score_gemma":0.0000014927067,"teacher_disagreement_score":0.45883784,"about_ca_system_score_codex":0.0000179577,"about_ca_system_score_gemma":0.00018584743,"threshold_uncertainty_score":0.99413145},"labels":[],"label_agreement":null},{"id":"W4404212701","doi":"10.1016/j.ejor.2024.11.012","title":"Where to plan shared streets: Development and application of a multicriteria spatial decision support tool","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Geographic Information Systems Studies","field":"Social Sciences","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; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Plan (archaeology); Computer science; Decision support system; Operations research; Development (topology); Development plan; Process management; Artificial intelligence; Business; Engineering; Geography; Mathematics; Civil engineering","score_opus":0.07864304042390954,"score_gpt":0.39741384303541266,"score_spread":0.31877080261150315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404212701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92141634,0.0007681026,0.051974017,0.004160567,0.0005345787,0.0009082631,0.000051885927,0.000025622066,0.020160612],"genre_scores_gemma":[0.9903407,0.00006531077,0.009011745,0.00003300623,0.00024792153,0.000006772457,0.000005242122,0.000007643568,0.0002816266],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99750274,0.00034915857,0.00060500304,0.00010795505,0.0012698114,0.00016534682],"domain_scores_gemma":[0.99819773,0.00029376135,0.00007220056,0.00006904836,0.0012526393,0.00011461028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007400201,0.000060551785,0.00011517111,0.000404697,0.00040210577,0.0002967231,0.00021774007,0.000018430002,0.00015317099],"category_scores_gemma":[0.00064085104,0.000049425762,0.00003019987,0.00034454683,0.00011030868,0.0003766523,0.00010576315,0.00015860856,0.000108353306],"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.00046161044,0.00013994068,0.016168715,0.00032671323,0.00023468825,0.00016099632,0.26416114,0.00033046067,0.00447622,0.02677261,0.0390159,0.64775103],"study_design_scores_gemma":[0.0004936444,0.0003305455,0.08622899,0.0005913423,0.000006383401,0.00002857036,0.012743691,0.0005568996,0.00024662892,0.00010080397,0.8985272,0.00014528756],"about_ca_topic_score_codex":0.00009251602,"about_ca_topic_score_gemma":0.00036679098,"teacher_disagreement_score":0.8595113,"about_ca_system_score_codex":0.00007598356,"about_ca_system_score_gemma":0.00043435374,"threshold_uncertainty_score":0.30927134},"labels":[],"label_agreement":null},{"id":"W4404504296","doi":"10.1016/j.ejor.2024.11.017","title":"Optimal capacity planning for cloud service providers with periodic, time-varying demand","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Council of University Libraries","funders":"Schulich School of Business, York University","keywords":"Cloud computing; Service provider; Computer science; Capacity planning; Service (business); On demand; Capacity management; Operations research; Business; Computer network; Marketing; Mathematics","score_opus":0.06802386906212089,"score_gpt":0.32605111162478256,"score_spread":0.2580272425626617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404504296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995839,0.0006120389,0.07716297,0.008081474,0.000253793,0.00041746118,0.000007844383,0.00007071315,0.013809795],"genre_scores_gemma":[0.986129,0.000003773818,0.009008837,0.00059791893,0.0033075407,0.000005911211,0.000017929835,0.00006246141,0.000866614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820393,0.00018082636,0.00036041494,0.00022568776,0.00073424866,0.00029488408],"domain_scores_gemma":[0.997964,0.00036620654,0.00011285952,0.0001184263,0.0014032787,0.00003520468],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0059309434,0.00013153868,0.0001762165,0.0004996324,0.00058530836,0.0013233076,0.00035113207,0.000017473067,0.00024281844],"category_scores_gemma":[0.000611706,0.00009826414,0.000085675194,0.00065248035,0.00010386198,0.0019032847,0.00010883716,0.00049320096,0.0002330742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021418282,0.00013223545,0.00054850936,0.0008872179,0.0006802257,0.0012994955,0.0021398664,0.9241026,0.018100826,0.024532076,0.02212416,0.0033109765],"study_design_scores_gemma":[0.0023541711,0.0004735351,0.0007154578,0.0021629583,0.00026790844,0.00033508783,0.0017189526,0.6752111,0.0007625969,0.002517388,0.3127924,0.00068850705],"about_ca_topic_score_codex":0.0000066639045,"about_ca_topic_score_gemma":0.0000018282748,"teacher_disagreement_score":0.29066822,"about_ca_system_score_codex":0.00006622066,"about_ca_system_score_gemma":0.00015106426,"threshold_uncertainty_score":0.9997134},"labels":[],"label_agreement":null},{"id":"W4404555313","doi":"10.1016/j.ejor.2024.11.022","title":"Integration of support vector machines and mean-variance optimization for capital allocation","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Stock Market Forecasting Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Capital allocation line; Computer science; Variance (accounting); Mathematical optimization; Support vector machine; Operations research; Econometrics; Mathematics; Economics; Microeconomics; Artificial intelligence","score_opus":0.2452412994750062,"score_gpt":0.4910051631740254,"score_spread":0.24576386369901923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404555313","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.12807606,0.00048258624,0.8645354,0.0026639397,0.0006375337,0.0002804743,0.000029041279,0.000008713532,0.0032862439],"genre_scores_gemma":[0.8264657,0.00004014971,0.17133775,0.00002282078,0.000434359,0.0000037732154,0.00001149536,0.000019755735,0.0016641768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949978,0.0019245122,0.0009247835,0.0002517801,0.001749544,0.00015155945],"domain_scores_gemma":[0.9917427,0.004288209,0.00019618675,0.00015824927,0.0035181656,0.00009654291],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.035189126,0.000088759356,0.00018288742,0.00067561574,0.00016638769,0.0005274562,0.0003923524,0.000024341776,0.00039521678],"category_scores_gemma":[0.022131389,0.00006182526,0.00008323452,0.0006547258,0.00014255215,0.00070436526,0.000079265694,0.0002708492,0.000015585745],"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.0010339619,0.00016072004,0.0006535917,0.00011529022,0.00014133421,0.000085467196,0.008480062,0.054355633,0.12953241,0.06620263,0.03184985,0.70738906],"study_design_scores_gemma":[0.0009492107,0.0020591915,0.023468789,0.0003498415,0.000030017603,0.00037303386,0.0008929312,0.9447707,0.004400644,0.010336344,0.012150709,0.00021858639],"about_ca_topic_score_codex":0.0000036555507,"about_ca_topic_score_gemma":0.0000034511907,"teacher_disagreement_score":0.8904151,"about_ca_system_score_codex":0.00005531539,"about_ca_system_score_gemma":0.00039873185,"threshold_uncertainty_score":0.99347585},"labels":[],"label_agreement":null},{"id":"W4404734405","doi":"10.1016/j.ejor.2024.11.031","title":"Optimal co-development contracts for companion diagnostics","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Pharmaceutical Economics and Policy","field":"Economics, Econometrics and Finance","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Business; Process management; Operations research; Mathematics","score_opus":0.2772292910362888,"score_gpt":0.4276035565451992,"score_spread":0.15037426550891042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404734405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6023257,0.02707568,0.06726126,0.039465882,0.0025807542,0.0011674298,0.0006514106,0.000049102044,0.25942284],"genre_scores_gemma":[0.99190426,0.0008220013,0.0041125803,0.00051697553,0.0011538643,0.000005824658,0.000025149378,0.000034768957,0.0014245945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985879,0.000090318055,0.0007751411,0.00016905121,0.00010227853,0.00027530157],"domain_scores_gemma":[0.9986934,0.00070604234,0.00009466711,0.00007972561,0.00023310899,0.00019305763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0061736167,0.0000847169,0.00020052042,0.00035099016,0.00018427761,0.00042718032,0.00027076135,0.000021699936,0.0005323067],"category_scores_gemma":[0.0007362943,0.00008351142,0.00009489176,0.00011301551,0.00007134631,0.00025757423,0.000045017812,0.00039603078,0.0012619809],"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.00013627791,0.00024027108,0.0008701208,0.00008929535,0.00026989888,0.00018094463,0.0011094657,0.004112391,0.0003611123,0.6000675,0.38154754,0.011015159],"study_design_scores_gemma":[0.0005190613,0.00016607251,0.0031809853,0.000045762157,0.0000021165301,0.00003239152,0.000021240843,0.009198409,0.00041982287,0.0016614787,0.98465025,0.0001024049],"about_ca_topic_score_codex":0.0000013745496,"about_ca_topic_score_gemma":3.572241e-7,"teacher_disagreement_score":0.6031027,"about_ca_system_score_codex":0.00015666921,"about_ca_system_score_gemma":0.00023514035,"threshold_uncertainty_score":0.99951565},"labels":[],"label_agreement":null},{"id":"W4404815012","doi":"10.1016/j.ejor.2024.11.030","title":"Estimating non-overfitted convex production technologies: A stochastic machine learning approach","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":5,"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 Regional Development Fund; Agencia Estatal de Investigación; Generalitat Valenciana; Queen's University; Queen's University Belfast","keywords":"Computer science; Production (economics); Regular polygon; Mathematical optimization; Artificial intelligence; Machine learning; Mathematics; Economics; Microeconomics","score_opus":0.17513625434883215,"score_gpt":0.44022778845282196,"score_spread":0.2650915341039898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404815012","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.19522265,0.0020320094,0.7861645,0.0076789926,0.00095158356,0.00027971124,0.0000052990454,0.00011642308,0.007548789],"genre_scores_gemma":[0.97489184,0.000011282261,0.021717474,0.000019086403,0.00052023266,0.0000023800394,0.000004778249,0.00002831619,0.0028046004],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913001,0.0021523766,0.0011492767,0.00053395826,0.0045142896,0.00034997723],"domain_scores_gemma":[0.9947542,0.0018186681,0.0002370268,0.00035659436,0.0027335142,0.00010000307],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.043723855,0.0001469628,0.00029285756,0.0019433005,0.00067855505,0.0015368342,0.0011827023,0.000037478694,0.0001774592],"category_scores_gemma":[0.046656672,0.000098637094,0.00015075754,0.0034745536,0.00037230394,0.0007289742,0.00029281573,0.001822811,0.0006029199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006292233,0.00012473752,0.0002360028,0.000023496865,0.00008379874,0.0002494652,0.0014771753,0.93028545,0.010654454,0.0011625779,0.008008205,0.047631726],"study_design_scores_gemma":[0.000166182,0.00029676565,0.00041670847,0.00018555057,0.000015015034,0.0003842844,0.001071539,0.9924617,0.00027248045,0.00091090554,0.003702414,0.0001164506],"about_ca_topic_score_codex":0.0000041400795,"about_ca_topic_score_gemma":7.142745e-7,"teacher_disagreement_score":0.7796692,"about_ca_system_score_codex":0.00014418089,"about_ca_system_score_gemma":0.00050077884,"threshold_uncertainty_score":0.9994997},"labels":[],"label_agreement":null},{"id":"W4405041883","doi":"10.1016/j.ejor.2024.11.047","title":"An incremental preference elicitation-based approach to learning potentially non-monotonic preferences in multi-criteria sorting","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","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":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Scientific Research Fund of Liaoning Provincial Education Department; Ministry of Education of the People's Republic of China; Humanities and Social Science Fund of Ministry of Education of China; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Preference elicitation; Sorting; Preference; Monotonic function; Computer science; Preference learning; Artificial intelligence; Machine learning; Operations research; Mathematics; Statistics; Algorithm","score_opus":0.17571597149618515,"score_gpt":0.39436117930329884,"score_spread":0.2186452078071137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405041883","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.29899043,0.0001198049,0.6902833,0.0005791821,0.00017606255,0.00025037793,0.0000020429595,0.00002632142,0.009572496],"genre_scores_gemma":[0.83436984,0.000014690399,0.16532508,0.00007901063,0.00013345855,0.000006650852,0.000007643156,0.000013476157,0.000050185754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608445,0.0015748185,0.0005901264,0.00036998792,0.0010418594,0.00033878023],"domain_scores_gemma":[0.998816,0.00021256236,0.00007291386,0.00018071124,0.000524994,0.00019283424],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.007090473,0.00012246108,0.00014847146,0.0006576733,0.00028497016,0.0015701225,0.001169748,0.00002266108,0.000030174782],"category_scores_gemma":[0.00038933713,0.00009723246,0.000051651437,0.0007590276,0.000049954582,0.0010334167,0.00018081014,0.0007558696,0.00006873666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023564798,0.0014622693,0.004510253,0.00016766436,0.000085631575,0.0008350287,0.016697831,0.5747218,0.117866255,0.010607083,0.0009820267,0.2718285],"study_design_scores_gemma":[0.00046461873,0.0010176973,0.03480445,0.0002108691,0.0000021959008,0.00002800794,0.00038871611,0.9617463,0.0005049755,0.00011742628,0.0005581264,0.00015664025],"about_ca_topic_score_codex":0.000025171852,"about_ca_topic_score_gemma":0.0000070748124,"teacher_disagreement_score":0.5353794,"about_ca_system_score_codex":0.00010838021,"about_ca_system_score_gemma":0.0005584677,"threshold_uncertainty_score":0.99946636},"labels":[],"label_agreement":null},{"id":"W4405287396","doi":"10.1016/j.ejor.2024.12.008","title":"Differential quantile-based sensitivity in discontinuous models","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Probabilistic and Robust Engineering Design","field":"Decision Sciences","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 Toronto","funders":"Canadian Statistical Sciences Institute; Natural Sciences and Engineering Research Council of Canada","keywords":"Sensitivity (control systems); Quantile; Computer science; Differential (mechanical device); Econometrics; Mathematical optimization; Mathematics; Physics","score_opus":0.29282658539964224,"score_gpt":0.43266200402375077,"score_spread":0.13983541862410853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405287396","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.23942257,0.00031444788,0.7540231,0.0020802915,0.0006477127,0.00010709196,0.000011953888,0.000012101424,0.003380774],"genre_scores_gemma":[0.996064,0.000009659499,0.002450653,0.000019323146,0.00048572317,8.6482214e-7,0.000001865986,0.000017232736,0.00095068786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942023,0.0021219214,0.0007337984,0.00025203638,0.0024340237,0.00025589953],"domain_scores_gemma":[0.9961154,0.0026504525,0.000049723523,0.00020034956,0.0008467518,0.00013736277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020449601,0.00009593453,0.00020644019,0.00083850673,0.00010601825,0.0008095174,0.00044169766,0.000022167445,0.00028216178],"category_scores_gemma":[0.0035352418,0.000060931357,0.00011505437,0.0007344475,0.0001318618,0.00047093284,0.00009283238,0.0007031498,0.00019796312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019688014,0.00018184546,0.00029273762,0.000019155705,0.000026587157,0.0029944582,0.0004559931,0.9166982,0.0075022564,0.0397036,0.017019242,0.014909046],"study_design_scores_gemma":[0.00039784456,0.00019990587,0.007388608,0.0002024109,0.0000035540304,0.000106930194,0.000094165895,0.9830353,0.00022632042,0.004885444,0.0033531068,0.00010638263],"about_ca_topic_score_codex":0.0000045171055,"about_ca_topic_score_gemma":0.000005951537,"teacher_disagreement_score":0.7566414,"about_ca_system_score_codex":0.00008193082,"about_ca_system_score_gemma":0.0004990104,"threshold_uncertainty_score":0.7806195},"labels":[],"label_agreement":null},{"id":"W4405355673","doi":"10.1016/j.ejor.2024.12.011","title":"Integrated differentiated time slot pricing and order dispatching with uncertain customer demand in on-demand food delivery","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Order (exchange); Food delivery; On demand; Consumer demand; Computer science; Demand management; Business; Demand forecasting; Operations research; Marketing; Economics; Microeconomics; Commerce; Mathematics; Finance","score_opus":0.029997170618847855,"score_gpt":0.27946270237995113,"score_spread":0.24946553176110328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405355673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85506046,0.0007947538,0.14073314,0.00015414694,0.00008487189,0.00012504839,0.000008186962,0.00004089911,0.0029984901],"genre_scores_gemma":[0.9958349,0.00024184058,0.00353776,0.000012485019,0.00008501103,0.0000013687371,0.000014733154,0.00003868813,0.00023322146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879724,0.00026161195,0.0002567787,0.00013100024,0.00036703402,0.00018630904],"domain_scores_gemma":[0.9993387,0.00027423076,0.000019454823,0.000061001625,0.0002299234,0.00007669937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010318747,0.00011330784,0.00012738988,0.00041184196,0.000095479816,0.00020932149,0.00009492544,0.000019535935,0.000043615782],"category_scores_gemma":[0.00015616413,0.0000789741,0.000015388632,0.00031658716,0.000049669903,0.00021918342,0.000028051112,0.0006369131,0.00002217536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008723818,0.00002255528,0.00009884926,0.00004601416,0.00005712453,0.00021088526,0.00041211804,0.99417037,0.0016978362,0.0005151992,0.00023897737,0.0024428074],"study_design_scores_gemma":[0.0012419862,0.00086717546,0.007277296,0.0013541109,0.000018982673,0.00013187643,0.0001834608,0.98498195,0.0017170887,0.00022904093,0.0017115421,0.00028549388],"about_ca_topic_score_codex":0.000002957989,"about_ca_topic_score_gemma":0.0000055075134,"teacher_disagreement_score":0.14077441,"about_ca_system_score_codex":0.00009664276,"about_ca_system_score_gemma":0.00006291732,"threshold_uncertainty_score":0.32204705},"labels":[],"label_agreement":null},{"id":"W4405506994","doi":"10.1016/j.ejor.2024.12.021","title":"Degree reduction techniques for polynomial optimization problems","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degree (music); Reduction (mathematics); Polynomial; Mathematics; Mathematical optimization; Degree of a polynomial; Computer science","score_opus":0.2434671354178104,"score_gpt":0.456043609627804,"score_spread":0.2125764742099936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405506994","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003639462,0.00042561535,0.9886832,0.0029609322,0.0003085936,0.00072245154,0.000017864655,0.00007031024,0.0064470684],"genre_scores_gemma":[0.045154493,0.00038681654,0.9454105,0.000022054599,0.0025975897,0.00004615847,0.000031169086,0.00013244119,0.006218766],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967454,0.00080985826,0.00069762155,0.00023746924,0.0011931907,0.00031643323],"domain_scores_gemma":[0.9960238,0.0007320804,0.00010504933,0.00017061588,0.002822864,0.00014562572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008323474,0.00012499628,0.00017261317,0.00079539604,0.00032051734,0.0004553477,0.00036601597,0.000042106498,0.00028531885],"category_scores_gemma":[0.0027423017,0.00010344778,0.00011596992,0.0006220909,0.00014519128,0.00076100044,0.000087772736,0.0006491442,0.000029198267],"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.00084134936,0.00063780474,0.000008683835,0.0008171489,0.0003836367,0.00028577162,0.0024104272,0.2950952,0.026797645,0.06702246,0.34786674,0.25783312],"study_design_scores_gemma":[0.0024283773,0.0037994462,0.000041788117,0.0016222061,0.000066410066,0.0017738254,0.000799784,0.6453969,0.020153668,0.026629813,0.29654488,0.000742937],"about_ca_topic_score_codex":8.697637e-7,"about_ca_topic_score_gemma":4.1057513e-7,"teacher_disagreement_score":0.35030168,"about_ca_system_score_codex":0.00026595706,"about_ca_system_score_gemma":0.0005357088,"threshold_uncertainty_score":0.43909281},"labels":[],"label_agreement":null},{"id":"W4405801393","doi":"10.1016/j.ejor.2024.12.022","title":"Blockchain adoption and coordination strategies for green supply chains considering consumer privacy concern","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Science Foundation of Zhejiang Province; Zhejiang Gongshang University; National Natural Science Foundation of China; Foundation for Innovative Research Groups of the National Natural Science Foundation of China; National Social Science Fund of China; National Office for Philosophy and Social Sciences; Canada Research Chairs","keywords":"Blockchain; Supply chain; Business; Consumer privacy; Supply chain management; Computer science; Information privacy; Process management; Industrial organization; Computer security; Marketing","score_opus":0.08319208273093841,"score_gpt":0.3541993074653098,"score_spread":0.2710072247343714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405801393","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.221779,0.00344748,0.7405645,0.031681262,0.00019873187,0.000492447,0.000018358636,0.00009092211,0.0017272442],"genre_scores_gemma":[0.98108685,0.0001026035,0.018002909,0.000065974644,0.00017395263,0.000013680292,0.0000031680638,0.000012564744,0.0005382766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849826,0.0003257292,0.00034842122,0.00023288697,0.00039451558,0.00020021177],"domain_scores_gemma":[0.99836546,0.00047297942,0.00006235706,0.0001757175,0.000839527,0.000083957246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038418616,0.00008902921,0.00011823659,0.0003732173,0.00033460488,0.0005401841,0.0004647921,0.000037158054,0.000023030805],"category_scores_gemma":[0.00019985551,0.00007744747,0.00004393017,0.0003301966,0.00023143434,0.0003803245,0.00018259653,0.00043025834,0.00001283365],"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.000014793605,0.000035594843,0.00010686056,0.00004521768,0.0000450506,0.000066250665,0.0014900138,0.00017153323,0.00633901,0.9343132,0.0039031,0.053469386],"study_design_scores_gemma":[0.0020288927,0.0014311516,0.004958263,0.00043516638,0.000027482962,0.0013974662,0.001694835,0.60090864,0.0032531528,0.07566267,0.3077101,0.00049218856],"about_ca_topic_score_codex":0.0000071664954,"about_ca_topic_score_gemma":0.000004318706,"teacher_disagreement_score":0.8586505,"about_ca_system_score_codex":0.000052680476,"about_ca_system_score_gemma":0.00039519975,"threshold_uncertainty_score":0.5209008},"labels":[],"label_agreement":null},{"id":"W4405861097","doi":"10.1016/j.ejor.2024.12.030","title":"Approximating <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.svg\" display=\"inline\" id=\"d1e1380\"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>/</mml:mo> <mml:mi>G</mml:mi> <mml:mi>I</mml:mi> <mml:mo>/</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> queues with deep learning","year":2024,"lang":"lv","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Scalable Vector Graphics; Algorithm; World Wide Web","score_opus":0.026562535343178536,"score_gpt":0.2735914420981636,"score_spread":0.24702890675498507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405861097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62724483,0.006402697,0.0074156285,0.0034882056,0.0050868155,0.0002663665,0.0006807121,0.00092977355,0.34848496],"genre_scores_gemma":[0.96749836,0.0032096263,0.0075811883,0.0030620254,0.010360467,0.0014138467,0.002769547,0.002822479,0.0012824567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9701066,0.0029220907,0.006106931,0.004836544,0.009623777,0.0064040734],"domain_scores_gemma":[0.9806803,0.0055314954,0.0058202716,0.0036759626,0.0017843194,0.0025076652],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.014574654,0.0026585297,0.0012371257,0.0030162332,0.007280865,0.0096259415,0.0068730125,0.0032878234,0.14299852],"category_scores_gemma":[0.01019278,0.0045036385,0.0044213994,0.005232201,0.004629627,0.007694095,0.006449306,0.00833665,0.007877664],"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.004863631,0.0010138178,0.000054823897,0.003429932,0.0058344505,0.007202011,0.0035954297,0.029373469,0.006264704,0.7297781,0.20004098,0.008548633],"study_design_scores_gemma":[0.006822487,0.005449404,0.00016091764,0.00879369,0.006137729,0.0070600505,0.011731921,0.2066529,0.70470566,0.0045056157,0.031282693,0.0066969437],"about_ca_topic_score_codex":0.0022123386,"about_ca_topic_score_gemma":0.0016312847,"teacher_disagreement_score":0.7252725,"about_ca_system_score_codex":0.00013354624,"about_ca_system_score_gemma":0.0040083057,"threshold_uncertainty_score":0.9986149},"labels":[],"label_agreement":null},{"id":"W4406387750","doi":"10.1016/j.ejor.2025.01.005","title":"Flexibility-based price discrimination in a competitive context considering consumers’ socioeconomic status","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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 Calgary","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Socioeconomic status; Flexibility (engineering); Context (archaeology); Computer science; Price discrimination; Econometrics; Economics; Business; Microeconomics; Statistics; Mathematics; Sociology; Geography; Demography","score_opus":0.08732115602309216,"score_gpt":0.35497901395711023,"score_spread":0.2676578579340181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406387750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9206876,0.00031217487,0.0008134032,0.0038197024,0.00026425798,0.00028700675,0.000003974704,0.000011277155,0.07380057],"genre_scores_gemma":[0.99853325,0.000019374944,0.00028623478,0.0007806001,0.000119385506,0.00000489945,0.000012011258,0.0000140315115,0.00023020172],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981245,0.0004183322,0.00058709516,0.00019036511,0.00038773913,0.00029197065],"domain_scores_gemma":[0.9979728,0.0006987712,0.0001573863,0.000120143355,0.0010259104,0.000025019628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00579746,0.00010897702,0.00019737975,0.000947373,0.00024715994,0.00044684194,0.00023372433,0.000019808971,0.00065201585],"category_scores_gemma":[0.0011026455,0.00010431292,0.00007182791,0.00035523175,0.00019239513,0.00073680124,0.00013631574,0.0005361684,0.000111088986],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011529376,0.00055273424,0.76206446,0.0003797397,0.00011287154,0.0004249302,0.0009154045,0.0012764304,0.006933751,0.12756726,0.0043546064,0.09426487],"study_design_scores_gemma":[0.0039624604,0.000054110318,0.8779501,0.00060045166,0.000037754955,0.000007454192,0.0044761165,0.0049124816,0.00038393572,0.0009564727,0.10640365,0.00025501836],"about_ca_topic_score_codex":0.00013916513,"about_ca_topic_score_gemma":0.00024125293,"teacher_disagreement_score":0.12661079,"about_ca_system_score_codex":0.00019665372,"about_ca_system_score_gemma":0.00047831563,"threshold_uncertainty_score":0.71391165},"labels":[],"label_agreement":null},{"id":"W4406505324","doi":"10.1016/j.ejor.2025.01.017","title":"Strategic decentralization of self-branded and contract manufacturing businesses","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Southwestern University of Finance and Economics; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Decentralization; Business; Industrial organization; Process management; Marketing; Economics; Market economy","score_opus":0.0668068812835068,"score_gpt":0.31356089814638055,"score_spread":0.24675401686287374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406505324","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93354344,0.00037848033,0.00073167816,0.0023041584,0.000262046,0.00019083462,8.8982256e-7,0.000012464255,0.06257598],"genre_scores_gemma":[0.99862355,0.00016200577,0.00021719854,0.00034761918,0.0003702314,8.637729e-7,0.0000065339336,0.000010257113,0.00026175068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99869746,0.00012818679,0.00040967859,0.00011101851,0.0004950867,0.00015856548],"domain_scores_gemma":[0.9988382,0.00008993082,0.00014923135,0.000085641164,0.0008210912,0.000015922966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002482501,0.00008202348,0.00013772275,0.0005475497,0.00017134658,0.00036089355,0.00021339073,0.0000138385285,0.0002846203],"category_scores_gemma":[0.00019458783,0.00006714464,0.000038026712,0.00030698214,0.00006730116,0.000715985,0.000113572474,0.00016397548,0.000016205227],"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.0010973441,0.0012447214,0.04995257,0.0022558908,0.0007581527,0.0004396181,0.0005669209,0.007337495,0.015161448,0.862833,0.038613655,0.019739186],"study_design_scores_gemma":[0.008649462,0.0002472363,0.63117003,0.0013260992,0.00019350127,0.00003524867,0.0026944478,0.018048968,0.0074684606,0.0123919295,0.31721717,0.000557434],"about_ca_topic_score_codex":0.00001644491,"about_ca_topic_score_gemma":0.0000038858575,"teacher_disagreement_score":0.8504411,"about_ca_system_score_codex":0.000029746443,"about_ca_system_score_gemma":0.000078135396,"threshold_uncertainty_score":0.34801048},"labels":[],"label_agreement":null},{"id":"W4406505333","doi":"10.1016/j.ejor.2025.01.019","title":"Biform game consensus analysis of group decision making with unconnected social network","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","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":"Humanities and Social Science Fund of Ministry of Education of China; Natural Science Foundation of Hunan Province; National Office for Philosophy and Social Sciences; National Natural Science Foundation of China","keywords":"Group decision-making; Group (periodic table); Computer science; Social network analysis; Game theory; Mathematical economics; Operations research; Management science; Microeconomics; Psychology; Economics; Mathematics; Social psychology; Social media; World Wide Web; Chemistry","score_opus":0.037815181625109134,"score_gpt":0.3840903963267911,"score_spread":0.346275214701682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406505333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.949377,0.00006205367,0.0329384,0.0005033596,0.00010299475,0.00009125983,0.000028454046,0.0000027722701,0.016893733],"genre_scores_gemma":[0.9969364,0.0000045383936,0.0025486946,0.00004227387,0.0003135766,7.7800746e-7,0.000012721781,0.000008386456,0.00013265401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998131,0.0004765586,0.00048633092,0.00011509152,0.0005965146,0.00019452772],"domain_scores_gemma":[0.99773794,0.0005472314,0.0001879257,0.00009155213,0.0013876158,0.00004772984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002426318,0.00007733311,0.00024871036,0.0003832184,0.00030331747,0.000117392185,0.00024603304,0.000014633055,0.00020370127],"category_scores_gemma":[0.000082712344,0.000060087637,0.00014352078,0.0015503186,0.00015458293,0.00007482076,0.00007892331,0.00035055558,0.0000040311024],"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.0011306823,0.00033093063,0.15372005,0.00001710982,0.003754493,0.00006161095,0.0011929789,0.12570278,0.00075380097,0.6607182,0.00549908,0.04711827],"study_design_scores_gemma":[0.0025651788,0.00069302146,0.93430126,0.00060352363,0.0003856074,0.0000040881846,0.0018946992,0.037463553,0.000045292745,0.013472606,0.008251489,0.00031966393],"about_ca_topic_score_codex":0.000016930673,"about_ca_topic_score_gemma":0.000012303176,"teacher_disagreement_score":0.78058124,"about_ca_system_score_codex":0.0000446415,"about_ca_system_score_gemma":0.00029324833,"threshold_uncertainty_score":0.24503027},"labels":[],"label_agreement":null},{"id":"W4406692044","doi":"10.1016/j.ejor.2025.01.031","title":"The interplay between charitable donation strategies and sales mode selection in the platform","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Digital Marketing and Social Media","field":"Social Sciences","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Donation; Selection (genetic algorithm); Business; Marketing; Operations research; Computer science; Operations management; Economics; Advertising; Engineering; Artificial intelligence; Economic growth","score_opus":0.08040221146808829,"score_gpt":0.4383431444716945,"score_spread":0.3579409330036062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406692044","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77757365,0.00029723666,0.00019014378,0.012923913,0.00010999606,0.00012912187,0.0000012608642,0.000003988059,0.20877068],"genre_scores_gemma":[0.99807703,0.00027613147,0.000040610932,0.000044763743,0.00035071277,0.0000020021887,0.0000014053418,0.0000029854532,0.0012043465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9971857,0.0016623415,0.00022848119,0.00006386294,0.0006881756,0.00017145052],"domain_scores_gemma":[0.9974578,0.0019962206,0.000045082656,0.000030653347,0.00043611706,0.000034132558],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.015504072,0.00003801965,0.00005996086,0.00012631626,0.001112353,0.0012412567,0.0003054204,0.000017452181,0.0000056173294],"category_scores_gemma":[0.0026933555,0.000022477578,0.000021137033,0.0003776441,0.00028803665,0.00062383636,0.000035321696,0.00040117244,0.0000043745827],"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.00016183294,0.000071161114,0.01825137,0.0000146385855,0.000050849572,0.000017448592,0.043762602,0.00020002009,0.00029495955,0.8270821,0.009138594,0.10095444],"study_design_scores_gemma":[0.0009046007,0.00042663197,0.5341888,0.00036404646,0.000012948957,0.000009056632,0.20761648,0.00066623726,0.000051204748,0.062464807,0.19312496,0.00017019376],"about_ca_topic_score_codex":0.00012986851,"about_ca_topic_score_gemma":0.0007726849,"teacher_disagreement_score":0.76461726,"about_ca_system_score_codex":0.00008239944,"about_ca_system_score_gemma":0.00057616574,"threshold_uncertainty_score":0.99979556},"labels":[],"label_agreement":null},{"id":"W4406999253","doi":"10.1016/j.ejor.2025.01.032","title":"A branch-and-price algorithm for fast and equitable last-mile relief aid distribution","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Facility Location and Emergency Management","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":"Polytechnique Montréal","funders":"","keywords":"Mile; Distribution (mathematics); Computer science; Last mile (transportation); Operations research; Algorithm; Economics; Mathematical optimization; Mathematics; Geography; Geodesy","score_opus":0.05133052850249088,"score_gpt":0.3253133373805396,"score_spread":0.2739828088780487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406999253","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.12694897,0.0020614334,0.7707231,0.03198177,0.0010787569,0.0011473021,0.00006543306,0.00004566234,0.06594761],"genre_scores_gemma":[0.9853849,0.00032076892,0.0029801289,0.0010655315,0.0010344425,0.000015343381,0.000107336054,0.000018794155,0.009072776],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99880767,0.00007952649,0.00033919534,0.00015622449,0.0003942455,0.00022313005],"domain_scores_gemma":[0.9987245,0.00006915855,0.00004169918,0.00008868621,0.0010520646,0.000023867993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042663068,0.00007816626,0.00010899635,0.00024216107,0.00046490534,0.00040654337,0.00017253794,0.00001385701,0.00011951191],"category_scores_gemma":[0.0006244016,0.0000684065,0.000037089765,0.00035183184,0.00007341102,0.00068533386,0.00024414586,0.00017637234,0.000051204417],"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.00033435426,0.00039771307,0.0021501465,0.0006495794,0.00019119926,0.000025385967,0.00019077637,0.004471859,0.001458915,0.21543284,0.3622665,0.41243073],"study_design_scores_gemma":[0.0017342566,0.000107994914,0.028869942,0.0001407041,0.000026704154,0.000006324191,0.00039116715,0.08777036,0.000049295664,0.0012454351,0.8795134,0.00014441271],"about_ca_topic_score_codex":0.000032377695,"about_ca_topic_score_gemma":0.000015814026,"teacher_disagreement_score":0.8584359,"about_ca_system_score_codex":0.000039806997,"about_ca_system_score_gemma":0.000058071862,"threshold_uncertainty_score":0.3920307},"labels":[],"label_agreement":null},{"id":"W4407196798","doi":"10.1016/j.ejor.2025.01.039","title":"Diversification for infinite-mean Pareto models without risk aversion","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Diversification (marketing strategy); Pareto principle; Risk aversion (psychology); Economics; Econometrics; Mathematics; Mathematical economics; Expected utility hypothesis; Operations management; Business; Marketing","score_opus":0.28008259968338517,"score_gpt":0.46949841627973804,"score_spread":0.18941581659635287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407196798","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.17863704,0.0002654917,0.7726084,0.0032269459,0.0005662154,0.00044158637,0.00005308761,0.000010617289,0.044190586],"genre_scores_gemma":[0.98277056,0.0007179824,0.010125979,0.00011450222,0.00024267515,0.000002499936,0.00001670755,0.000010892215,0.0059981816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946656,0.0019224142,0.00086374674,0.00025941498,0.002078212,0.0002105875],"domain_scores_gemma":[0.99210024,0.0016897791,0.0003441666,0.00030151336,0.0054317247,0.00013260008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.022748198,0.00009188075,0.00018280321,0.0010181804,0.0007345068,0.00052355474,0.000836978,0.000031958803,0.000118258526],"category_scores_gemma":[0.006239142,0.00006696218,0.00013249369,0.0009502437,0.00011811667,0.00089021795,0.0001367225,0.0003669857,0.00013339563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016044595,0.0002514008,0.040978465,0.000008662032,0.000116715695,0.000029987053,0.003677863,0.5286595,0.000929644,0.042847015,0.2518588,0.12903747],"study_design_scores_gemma":[0.0036303862,0.0010042528,0.054263663,0.0001442073,0.000052340238,0.00002284437,0.003111049,0.4540673,0.00096103817,0.058549594,0.42389792,0.0002954201],"about_ca_topic_score_codex":0.000008583797,"about_ca_topic_score_gemma":0.0000041318194,"teacher_disagreement_score":0.80413353,"about_ca_system_score_codex":0.00008383164,"about_ca_system_score_gemma":0.0004461515,"threshold_uncertainty_score":0.7884117},"labels":[],"label_agreement":null},{"id":"W4408104635","doi":"10.1016/j.ejor.2025.02.014","title":"Adaptation, comparison and practical implementation of fairness schemes in Kidney Exchange Programs","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Organ Donation and Transplantation","field":"Medicine","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":"McGill University; Université de Montréal; Mila - Quebec Artificial Intelligence Institute; Computer Research Institute of Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; Google","keywords":"Adaptation (eye); Computer science; Psychology","score_opus":0.157876204448473,"score_gpt":0.48461155877733014,"score_spread":0.32673535432885714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408104635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965425,0.0003901589,0.0127890045,0.017192308,0.00009081493,0.0004915477,0.0000070027004,0.0000059603494,0.003608199],"genre_scores_gemma":[0.99346477,0.00017162619,0.0059187687,0.00013880937,0.0000559599,0.0000027830406,0.00004324575,0.00000698115,0.0001970722],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982221,0.00048784923,0.0005065948,0.00009167892,0.00058878,0.00010297503],"domain_scores_gemma":[0.9985801,0.00013391786,0.00009665149,0.000051640993,0.0010472413,0.00009047193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025269364,0.000052351606,0.00014147616,0.00047042058,0.000057226353,0.00004381158,0.00004123554,0.000016547936,0.00015330061],"category_scores_gemma":[0.00043894417,0.000044754597,0.000023721466,0.00039017224,0.00008209014,0.00022361055,0.000018559065,0.00027725394,0.0000045097754],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002485282,0.0017393146,0.6722917,0.001347448,0.00030549333,0.00045254373,0.012150069,0.00010662574,0.024247222,0.055162806,0.007205135,0.22250637],"study_design_scores_gemma":[0.0073666847,0.0011885769,0.9538922,0.00082362356,0.00005046968,0.00016431698,0.0067957547,0.0018562081,0.010801404,0.00017134527,0.016800094,0.00008936429],"about_ca_topic_score_codex":0.0000134409465,"about_ca_topic_score_gemma":0.000022342889,"teacher_disagreement_score":0.28160048,"about_ca_system_score_codex":0.000049001348,"about_ca_system_score_gemma":0.0006021317,"threshold_uncertainty_score":0.18250394},"labels":[],"label_agreement":null},{"id":"W4408818067","doi":"10.1016/j.ejor.2025.03.011","title":"The multi-armed bandit problem under the mean-variance setting","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","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é du Québec à Montréal; Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variance (accounting); Computer science; Mathematical optimization; Mathematics; Statistics; Econometrics; Economics","score_opus":0.23597087264581235,"score_gpt":0.5101706528117763,"score_spread":0.27419978016596397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408818067","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.014770206,0.0045847245,0.74995077,0.18640475,0.0014809994,0.0013793552,0.000025325959,0.000026866323,0.041376986],"genre_scores_gemma":[0.91289824,0.00037456217,0.015272261,0.00076658657,0.0010566043,0.0000174902,0.0000023024256,0.000040116596,0.06957184],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9839002,0.0077276663,0.0013117146,0.0003857359,0.0060195355,0.0006551803],"domain_scores_gemma":[0.9795485,0.013628357,0.0002764408,0.00066691067,0.0057097925,0.0001700051],"candidate_categories":["metaresearch","sts","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.06914407,0.00014068147,0.00020448676,0.0004587345,0.0028429558,0.0021141593,0.0034124604,0.000028227674,0.0002930494],"category_scores_gemma":[0.01746732,0.00006324543,0.00014777579,0.0019114567,0.0008737456,0.00059109356,0.0007124274,0.0017113968,0.0004576506],"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.0010786166,0.00048150937,0.0019211228,0.000022132317,0.000477686,0.00070373167,0.0036369069,0.14391619,0.0072662137,0.07279627,0.42159826,0.34610137],"study_design_scores_gemma":[0.0030277306,0.00043353744,0.055218667,0.00023107967,0.000012789184,0.00020638615,0.009538206,0.036959168,0.0016123593,0.042368177,0.8501132,0.00027870192],"about_ca_topic_score_codex":0.000004694528,"about_ca_topic_score_gemma":0.000029013316,"teacher_disagreement_score":0.89812803,"about_ca_system_score_codex":0.00019590155,"about_ca_system_score_gemma":0.0012898933,"threshold_uncertainty_score":0.99892175},"labels":[],"label_agreement":null},{"id":"W4408960189","doi":"10.1016/j.ejor.2025.03.020","title":"Pareto-optimal insurance under robust distortion risk measures","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":2,"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; Alberta Innovates","keywords":"Distortion (music); Pareto principle; Actuarial science; Econometrics; Computer science; Risk management; Pareto optimal; Economics; Mathematical optimization; Multi-objective optimization; Mathematics; Finance","score_opus":0.2285720716164106,"score_gpt":0.4435861146798621,"score_spread":0.21501404306345148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408960189","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.45999435,0.0013617721,0.4912242,0.0038612692,0.0008001223,0.00017898936,0.000025696327,0.000011862395,0.04254176],"genre_scores_gemma":[0.98879325,0.0015538634,0.0038135294,0.0001261799,0.0003433332,0.0000014566662,0.0000050823937,0.000012477134,0.0053508505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99099034,0.004001179,0.0011122623,0.00027535303,0.0033678564,0.00025302096],"domain_scores_gemma":[0.9935358,0.0011168257,0.00034727907,0.0003209827,0.004528109,0.00015099155],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.026226513,0.00010934211,0.00021224137,0.0008443258,0.0006517787,0.0006698572,0.0008626539,0.000033484954,0.00024312176],"category_scores_gemma":[0.0093135135,0.00007654512,0.00013220348,0.0013385951,0.00020267008,0.0007131426,0.00011950259,0.00069680274,0.00024322115],"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.00033456463,0.00012226512,0.07382379,0.0000014954909,0.000055056353,0.00006558499,0.00035234363,0.7469425,0.0003237379,0.0049296143,0.08004088,0.093008146],"study_design_scores_gemma":[0.0010099392,0.00031032428,0.8124523,0.00006789154,0.00001324174,0.000044701635,0.00067410676,0.009278195,0.00041328534,0.004009155,0.17156756,0.00015927068],"about_ca_topic_score_codex":0.000011334131,"about_ca_topic_score_gemma":0.000013733566,"teacher_disagreement_score":0.73862857,"about_ca_system_score_codex":0.000114933115,"about_ca_system_score_gemma":0.00056891405,"threshold_uncertainty_score":0.9990315},"labels":[],"label_agreement":null},{"id":"W4409529366","doi":"10.1016/j.ejor.2025.04.017","title":"Robust elicitable functionals","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Fuzzy Systems and Optimization","field":"Mathematics","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":"Canadian Statistical Sciences Institute; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Econometrics; Mathematics; Mathematical economics","score_opus":0.249401360316722,"score_gpt":0.4098757849836145,"score_spread":0.1604744246668925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409529366","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.09275754,0.0014035082,0.17722811,0.011306389,0.0014064417,0.0005412639,0.00002115836,0.000036638994,0.71529895],"genre_scores_gemma":[0.8864043,0.00011213383,0.041957527,0.0003386293,0.0012633842,0.0000050746035,0.000010011523,0.000042654705,0.06986633],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730825,0.0009786513,0.00056084734,0.00011240501,0.0008558448,0.00018401592],"domain_scores_gemma":[0.9968122,0.00064385217,0.00010550495,0.00014733248,0.002216626,0.00007444257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00782624,0.00007304437,0.00015080228,0.00040597754,0.000291217,0.0001787689,0.0002640893,0.000021117083,0.00052434125],"category_scores_gemma":[0.0026029549,0.000057039557,0.000071730676,0.00046124574,0.000053281834,0.00025478518,0.00007206168,0.000364232,0.00007126814],"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.00013714991,0.0002250812,0.00054981327,0.00008222366,0.00013069152,0.00008447601,0.00023811207,0.019814316,0.0019213083,0.35178053,0.6230687,0.0019676168],"study_design_scores_gemma":[0.0073295985,0.0017254794,0.02510686,0.0024620232,0.0001043923,0.00052456366,0.0026010966,0.021210799,0.0034080339,0.100776054,0.8339871,0.00076399493],"about_ca_topic_score_codex":0.0000030416309,"about_ca_topic_score_gemma":0.000001785454,"teacher_disagreement_score":0.7936467,"about_ca_system_score_codex":0.000095766234,"about_ca_system_score_gemma":0.00035836516,"threshold_uncertainty_score":0.5741169},"labels":[],"label_agreement":null},{"id":"W4410194343","doi":"10.1016/j.ejor.2025.04.040","title":"Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Toronto","funders":"","keywords":"Computer science; Queueing theory; Tandem; Queueing system; State (computer science); Steady state (chemistry); Artificial intelligence; Operations research; Mathematical optimization; Computer network; Mathematics; Algorithm","score_opus":0.03541767423282903,"score_gpt":0.3070689699914559,"score_spread":0.27165129575862684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410194343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286865,0.00023192796,0.0032729125,0.00062436826,0.00008364442,0.0003898857,0.0000021642911,0.000007819022,0.066700764],"genre_scores_gemma":[0.99925077,0.0000041856943,0.00025417705,0.000035023197,0.00012704906,0.0000021902822,0.0000014221005,0.000013651321,0.0003115206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995428,0.002332073,0.00092420186,0.00012810282,0.0009973878,0.00019022387],"domain_scores_gemma":[0.9970674,0.00085127674,0.00066381326,0.0002359749,0.001174355,0.0000071944605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019780135,0.000103378756,0.00029198817,0.00031516267,0.0004025158,0.00012004736,0.00090771366,0.000014315999,0.000008318717],"category_scores_gemma":[0.0013558485,0.000051652645,0.00014721097,0.0013743188,0.00030718403,0.0002946796,0.00031295963,0.0006776699,0.000003237992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022546001,0.00013175342,0.040364478,0.0019442354,0.00022940757,0.000018920593,0.0036078487,0.5941385,0.0010890005,0.35717502,0.000100191675,0.00097521185],"study_design_scores_gemma":[0.002763057,0.00010354144,0.034314223,0.008528129,0.00026903782,0.00012996359,0.12716737,0.82107514,0.00044591245,0.0020207819,0.0028324109,0.00035040654],"about_ca_topic_score_codex":0.000121956706,"about_ca_topic_score_gemma":0.000010881502,"teacher_disagreement_score":0.35515422,"about_ca_system_score_codex":0.00008811613,"about_ca_system_score_gemma":0.00012422926,"threshold_uncertainty_score":0.68554395},"labels":[],"label_agreement":null},{"id":"W4410218205","doi":"10.1016/j.ejor.2025.05.008","title":"Deep reinforcement learning for the real-time inventory rack storage assignment and replenishment problem","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Manufacturing and Logistics Optimization","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":"Polytechnique Montréal","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek","keywords":"Rack; Reinforcement learning; Computer science; Reinforcement; Operations research; Artificial intelligence; Industrial engineering; Mathematics; Engineering","score_opus":0.03503178622339971,"score_gpt":0.3085593448250698,"score_spread":0.2735275586016701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410218205","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.0015441019,0.0005489831,0.9825855,0.00079328485,0.00011922032,0.00034295846,5.4550327e-7,0.000020991594,0.014044434],"genre_scores_gemma":[0.98066,0.0012944266,0.012031116,0.000034308876,0.00017543824,0.000015663503,0.000010444482,0.000023361397,0.0057552448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889034,0.00020820528,0.00030871364,0.00008791502,0.00034498167,0.00015984394],"domain_scores_gemma":[0.9991648,0.00034164212,0.000049453054,0.0000921527,0.0002985942,0.00005336475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027568277,0.00007284184,0.000087318665,0.00011999057,0.0003213212,0.00011870258,0.00014146253,0.000013026007,0.000041123276],"category_scores_gemma":[0.00032132125,0.000053101303,0.00002977816,0.00007674224,0.000054600507,0.000110056695,0.000059511265,0.0003143835,0.000005859489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042768053,0.000009094901,0.000013830783,0.000032510907,0.00004861077,0.000005997704,0.00021274277,0.98951936,0.00087324006,0.0015608879,0.004447389,0.003233559],"study_design_scores_gemma":[0.0007381467,0.00030730607,0.0005889967,0.000105016836,0.000016727314,0.0000068770187,0.00019703397,0.9498884,0.00096831884,0.00033015924,0.046763204,0.000089782785],"about_ca_topic_score_codex":0.00000103297,"about_ca_topic_score_gemma":3.334714e-7,"teacher_disagreement_score":0.9791159,"about_ca_system_score_codex":0.00015489219,"about_ca_system_score_gemma":0.000056540466,"threshold_uncertainty_score":0.24713753},"labels":[],"label_agreement":null},{"id":"W4410252793","doi":"10.1016/j.ejor.2025.04.019","title":"First-improvement or best-improvement? An in-depth local search computational study to elucidate a dominance claim","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; 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":"Dominance (genetics); Stochastic dominance; Computer science; Mathematical optimization; Operations research; Mathematics; Biology","score_opus":0.07134054237777429,"score_gpt":0.39701539868102026,"score_spread":0.325674856303246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410252793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5824058,0.000049903316,0.4134726,0.00089053554,0.00018523446,0.0007336844,0.000008580843,0.000024944895,0.0022287355],"genre_scores_gemma":[0.94256777,0.000025629453,0.05624395,0.00016948301,0.00016465153,0.00001584047,0.0000068299046,0.000046918958,0.0007589514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957632,0.0011766864,0.00096687087,0.00030684442,0.0013230128,0.00046337905],"domain_scores_gemma":[0.9978011,0.00042468993,0.000052928444,0.00026296912,0.0012218998,0.00023636129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009837165,0.00018228732,0.00027060354,0.00094603345,0.0002781178,0.0002968927,0.0006640172,0.000026643283,0.00016604498],"category_scores_gemma":[0.000505674,0.00016157348,0.000047150683,0.001255713,0.00007939692,0.00040397194,0.00023786197,0.00085172587,0.000074568925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003218151,0.00055789563,0.0012532839,0.00004109326,0.000057735753,0.0001939997,0.0013283584,0.9533833,0.0012368965,0.00029483406,0.00067237293,0.040658392],"study_design_scores_gemma":[0.00489296,0.0060557984,0.046932384,0.0004030535,0.0000163805,0.000030659474,0.004644086,0.93212646,0.0017076959,0.00012565524,0.002694157,0.0003706967],"about_ca_topic_score_codex":0.000022434464,"about_ca_topic_score_gemma":0.000117643685,"teacher_disagreement_score":0.36016196,"about_ca_system_score_codex":0.0004803448,"about_ca_system_score_gemma":0.0004622283,"threshold_uncertainty_score":0.65887755},"labels":[],"label_agreement":null},{"id":"W4410478308","doi":"10.1016/j.ejor.2025.05.027","title":"Government’s optimal inter-temporal subsidy and manufacturer’s dynamic pricing in the presence of strategic consumers","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Energy, Environment, and Transportation Policies","field":"Energy","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":"National Social Science Fund of China; Social Sciences and Humanities Research Council of Canada; Major Program of National Fund of Philosophy and Social Science of China; Hainan Provincial Department of Science and Technology; Hainan University; Natural Science Foundation of Hainan Province","keywords":"Subsidy; Dynamic pricing; Business; Government (linguistics); Industrial organization; Dynamic capabilities; Economics; Microeconomics; Operations research; Marketing; Market economy; Mathematics","score_opus":0.04941170529521289,"score_gpt":0.32832352752778415,"score_spread":0.27891182223257127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410478308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97524995,0.00033087356,0.00046709375,0.0013048452,0.00004907866,0.000081105085,0.000008064917,0.0000017235179,0.022507288],"genre_scores_gemma":[0.998248,0.0002860033,0.00039686362,0.000102860206,0.000021415155,0.0000017074088,0.0000062339304,0.0000087870585,0.00092812045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9977379,0.00080304925,0.00045485265,0.000116459785,0.00072229665,0.0001654663],"domain_scores_gemma":[0.9992987,0.00034052588,0.000105308834,0.000120018245,0.00009163235,0.000043816053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023406108,0.000084626095,0.00012811339,0.00014951582,0.000102340324,0.00007458388,0.00030734923,0.0000177259,0.00009160549],"category_scores_gemma":[0.00010433845,0.000059031732,0.000040139137,0.00016797167,0.00025462484,0.0001673792,0.00003638743,0.00038563722,0.00000334644],"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.0016776151,0.0011862762,0.10940964,0.00034897824,0.00066591514,0.0012523313,0.018254187,0.30653903,0.057600416,0.4879801,0.0020238983,0.013061617],"study_design_scores_gemma":[0.0030878054,0.00076761463,0.9507121,0.00044940697,0.000040661045,0.00008693704,0.01743632,0.004823768,0.006595598,0.001914435,0.0138243,0.00026104858],"about_ca_topic_score_codex":0.00014495628,"about_ca_topic_score_gemma":0.0002861512,"teacher_disagreement_score":0.84130245,"about_ca_system_score_codex":0.000062102416,"about_ca_system_score_gemma":0.0000966036,"threshold_uncertainty_score":0.24072441},"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":"W4411690650","doi":"10.1016/j.ejor.2025.06.014","title":"Beyond fifty years of vehicle routing: Insights into the history and the future","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":10,"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":"Vehicle routing problem; Computer science; Operations research; Routing (electronic design automation); History; Engineering; Computer network","score_opus":0.02854984090072116,"score_gpt":0.31013046177736303,"score_spread":0.2815806208766419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411690650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88709944,0.030488743,0.018296018,0.010657494,0.0016179616,0.00037250863,0.0000016931128,0.00003137228,0.051434737],"genre_scores_gemma":[0.99312085,0.0006259604,0.004962216,0.00014990866,0.00032089156,0.000001094363,7.227316e-7,0.000016168946,0.00080220285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973862,0.0016016709,0.00036117944,0.00007202873,0.00046787638,0.00011103749],"domain_scores_gemma":[0.99849826,0.0007707592,0.000055896442,0.00015925545,0.00047474666,0.00004106409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063369367,0.000060547736,0.00012122216,0.00015199375,0.0001651654,0.00005643256,0.00035322303,0.000019835617,0.000037663194],"category_scores_gemma":[0.0007242944,0.00003705936,0.00004611983,0.00026910336,0.0002936571,0.00011516398,0.00009869354,0.0005881024,0.000004503288],"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.00060877285,0.00011235651,0.0016661059,0.00016454245,0.000556845,0.000112530724,0.06107828,0.412911,0.022364417,0.23785272,0.09016076,0.17241165],"study_design_scores_gemma":[0.005982108,0.00027074426,0.106857575,0.00033184706,0.000065339045,0.000058566995,0.004181482,0.36562005,0.0023606392,0.0036375928,0.510315,0.0003190455],"about_ca_topic_score_codex":0.0000034369548,"about_ca_topic_score_gemma":0.0000023709788,"teacher_disagreement_score":0.42015424,"about_ca_system_score_codex":0.0001043553,"about_ca_system_score_gemma":0.00015884051,"threshold_uncertainty_score":0.2555045},"labels":[],"label_agreement":null},{"id":"W4412452392","doi":"10.1016/j.ejor.2025.06.031","title":"Impact of technology spillovers and subsidies on innovation consortia dynamics","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"Wilfrid Laurier University","funders":"Natural Science Foundation of Hunan Province","keywords":"Subsidy; Business; Industrial organization; Dynamics (music); Economic geography; Economics; Market economy","score_opus":0.19916304098409873,"score_gpt":0.492636892511699,"score_spread":0.2934738515276003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412452392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9578063,0.00004647809,0.0022741335,0.0032516525,0.0001115955,0.00006885733,0.000008687084,0.0000032701819,0.036429036],"genre_scores_gemma":[0.9973113,0.00001813681,0.00078517746,0.00009174266,0.0000373808,3.1966766e-7,0.0000025256436,0.000005259307,0.001748187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99695605,0.00046734043,0.0010064866,0.00014971678,0.0012770195,0.000143369],"domain_scores_gemma":[0.9922076,0.00080775504,0.00033321526,0.00016377722,0.006455002,0.0000326674],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.011600662,0.00007127021,0.00018016109,0.0034851437,0.00020836148,0.00015911311,0.00038395805,0.00002948369,0.00021477122],"category_scores_gemma":[0.018234983,0.000047188365,0.000050605613,0.00386209,0.0003449735,0.00020377635,0.00014397275,0.0004227067,0.000025182697],"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.0004521914,0.00015960603,0.13166785,0.000007064099,0.00008191374,0.000050215724,0.00027888262,0.001156432,0.017709495,0.6826583,0.01675971,0.14901832],"study_design_scores_gemma":[0.0023711226,0.0024893577,0.9381471,0.0003022293,0.000007817842,0.00012759615,0.002942423,0.014261781,0.0031246552,0.02714768,0.008890663,0.00018753298],"about_ca_topic_score_codex":0.0000021438705,"about_ca_topic_score_gemma":0.0000018652763,"teacher_disagreement_score":0.8064793,"about_ca_system_score_codex":0.00009799897,"about_ca_system_score_gemma":0.00042410078,"threshold_uncertainty_score":0.9900348},"labels":[],"label_agreement":null},{"id":"W4412456327","doi":"10.1016/j.ejor.2025.07.007","title":"Robot-aided electric vehicle routing problem with lockers and prime customers prioritization","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"École Nationale d'Administration Publique; Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Gina Cody School of Engineering and Computer Science, Concordia University; Qatar National Research Fund; Qatar Research, Development and Innovation Council","keywords":"Prioritization; Vehicle routing problem; Computer science; Prime (order theory); Routing (electronic design automation); Robot; Electric vehicle; Operations research; City logistics; Artificial intelligence; Business; Computer network; Transport engineering; Engineering; Mathematics; Combinatorics","score_opus":0.026315521792389274,"score_gpt":0.3180905560652358,"score_spread":0.2917750342728465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412456327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4919739,0.0012278956,0.4630639,0.0018557754,0.00017676209,0.0006051693,0.000002372189,0.00013367397,0.04096054],"genre_scores_gemma":[0.93775284,0.00011978447,0.06141842,0.000039331775,0.00010358181,0.0000018987417,0.0000027508136,0.000037114907,0.00052424736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774283,0.0008298019,0.00043363814,0.00014326983,0.0005769397,0.00027353913],"domain_scores_gemma":[0.99857366,0.00025826163,0.000063987754,0.00010532158,0.0008929138,0.000105864296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004462243,0.00011042162,0.00015296826,0.00052027433,0.00025174484,0.00023121168,0.00019015255,0.000026616945,0.00002540337],"category_scores_gemma":[0.0004520275,0.00009666733,0.000025581943,0.001059613,0.00006131961,0.00032210778,0.000048287824,0.0005758411,0.000013100837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001070505,0.000041515552,0.004638409,0.00007980235,0.00013597033,0.00006775331,0.0006206422,0.8691187,0.084473185,0.0016576638,0.0013481347,0.03771116],"study_design_scores_gemma":[0.0032652675,0.00064725144,0.062245373,0.00074353354,0.000048276193,0.00020658417,0.00043985914,0.90201265,0.025475746,0.00010999917,0.004378958,0.00042650962],"about_ca_topic_score_codex":0.0000014518148,"about_ca_topic_score_gemma":6.681432e-7,"teacher_disagreement_score":0.44577897,"about_ca_system_score_codex":0.00016238134,"about_ca_system_score_gemma":0.00025199764,"threshold_uncertainty_score":0.39419794},"labels":[],"label_agreement":null},{"id":"W4412569399","doi":"10.1016/j.ejor.2025.07.047","title":"Cost management with default risk in large-scale group decision making: A method based on cooperative bargaining game","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Auction Theory and Applications","field":"Decision Sciences","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 Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing; Central University of Finance and Economics; National Natural Science Foundation of China","keywords":"Group (periodic table); Group decision-making; Scale (ratio); Bargaining power; Computer science; Microeconomics; Bargaining problem; Default risk; Game theory; Cooperative game theory; Risk management; Operations research; Economics; Actuarial science; Operations management; Business; Mathematics; Finance; Psychology; Credit risk","score_opus":0.15494197535472223,"score_gpt":0.5004214638071997,"score_spread":0.34547948845247745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412569399","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.025493475,0.000037759382,0.9114881,0.0012170414,0.00006965262,0.00038885753,0.000019053183,0.0000064758783,0.06127958],"genre_scores_gemma":[0.9145605,0.000017908586,0.083204694,0.00054762093,0.000077810946,0.000019618717,0.0000034594607,0.000014571677,0.0015538262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99045783,0.005485036,0.00092013564,0.00042731146,0.0024087229,0.00030096844],"domain_scores_gemma":[0.9923687,0.0052639674,0.00023848552,0.00041165564,0.0015965349,0.00012064156],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.039026536,0.00013463937,0.00024359979,0.0013914335,0.0006042931,0.00050299184,0.00089159026,0.00002689992,0.0006253215],"category_scores_gemma":[0.003767874,0.000088270135,0.000081815444,0.002425839,0.00013785713,0.00032823844,0.00017838611,0.0008780468,0.00023856908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037372997,0.0008525873,0.0058459407,0.0000055894675,0.0000719042,0.00036219347,0.001394109,0.6486699,0.00018998525,0.14222722,0.010273687,0.1863696],"study_design_scores_gemma":[0.010882206,0.0023874473,0.26766586,0.0016805188,0.00004554478,0.00009370715,0.017034585,0.45300943,0.0005887641,0.052211545,0.19384313,0.0005572641],"about_ca_topic_score_codex":0.000001128728,"about_ca_topic_score_gemma":0.000018341878,"teacher_disagreement_score":0.889067,"about_ca_system_score_codex":0.0001535331,"about_ca_system_score_gemma":0.00023340933,"threshold_uncertainty_score":0.9895244},"labels":[],"label_agreement":null},{"id":"W4412736304","doi":"10.1016/j.ejor.2025.07.041","title":"A disaggregated integer L-shaped method for the bike sharing rebalancing problem with stochastic demands","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban Transport and Accessibility","field":"Social Sciences","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; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Integer (computer science); Integer programming; Mathematical optimization; Computer science; Bike sharing; Operations research; Mathematics; Engineering; Transport engineering","score_opus":0.08635635572309876,"score_gpt":0.4323346054435496,"score_spread":0.3459782497204509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412736304","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.084229,0.0006597731,0.88145715,0.015488828,0.00018397857,0.00086476404,0.000007773704,0.000019191837,0.01708954],"genre_scores_gemma":[0.9878431,0.000013950354,0.007889747,0.00011808617,0.0003359138,0.000011034069,0.000002818088,0.000011921625,0.003773435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976133,0.0007338676,0.00039055553,0.0001808396,0.0007913448,0.0002901031],"domain_scores_gemma":[0.99697185,0.0012543426,0.00010301813,0.00012941967,0.0014474186,0.00009392823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014991166,0.00007764849,0.00013996889,0.00016588734,0.001243183,0.0003817896,0.0006686606,0.000019496156,0.00011837404],"category_scores_gemma":[0.001175808,0.00004397549,0.00007259332,0.0006195685,0.00025859615,0.00032291914,0.000055552042,0.00048725217,0.000004083739],"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.012143108,0.0017948647,0.2971787,0.0007178961,0.0029055304,0.0005363866,0.09203954,0.05828664,0.013997582,0.33250493,0.029743351,0.1581515],"study_design_scores_gemma":[0.016753262,0.0035881249,0.54872996,0.0068451827,0.00069776026,0.00006460295,0.037330613,0.19615369,0.0011657287,0.033772968,0.15325528,0.001642837],"about_ca_topic_score_codex":0.00009214159,"about_ca_topic_score_gemma":0.0003250791,"teacher_disagreement_score":0.9036141,"about_ca_system_score_codex":0.0001073436,"about_ca_system_score_gemma":0.00079649023,"threshold_uncertainty_score":0.9561685},"labels":[],"label_agreement":null},{"id":"W4412736476","doi":"10.1016/j.ejor.2025.07.048","title":"Subsidizing a new technology: An impulse Stackelberg game approach","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Innovation Diffusion and Forecasting","field":"Decision Sciences","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stackelberg competition; Subsidy; Computer science; Impulse (physics); Game theory; Mathematical optimization; Mathematical economics; Operations research; Economics; Mathematics; Market economy","score_opus":0.3111299833936028,"score_gpt":0.4901077725797046,"score_spread":0.1789777891861018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412736476","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74088174,0.0003198225,0.0908405,0.011908559,0.00044262098,0.00021673081,0.0000044523927,0.00002796927,0.1553576],"genre_scores_gemma":[0.9597726,0.000012555927,0.021963395,0.00042236334,0.00040092441,9.737729e-7,0.0000038346534,0.000015560714,0.017407808],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9939045,0.0014473769,0.0012508134,0.00033398272,0.0027207856,0.00034254926],"domain_scores_gemma":[0.99379176,0.00054669,0.0002590513,0.0004106761,0.0047934405,0.00019840569],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.025747715,0.000115327486,0.0002347492,0.0028046127,0.0004665146,0.00088003126,0.0015135646,0.00004638802,0.0006383132],"category_scores_gemma":[0.013283742,0.000081807295,0.000086073196,0.0042694374,0.00021360455,0.00071316044,0.00035092994,0.00095894036,0.0002323366],"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.00041086477,0.0005071948,0.008037075,0.00000978687,0.00006668342,0.00028873153,0.002551582,0.002707049,0.034778822,0.25169712,0.14192544,0.55701965],"study_design_scores_gemma":[0.0056172293,0.0017327538,0.047425646,0.00033817382,0.000018960178,0.00079116394,0.01864763,0.031532533,0.0064287097,0.065975815,0.82085407,0.00063731096],"about_ca_topic_score_codex":0.0000030707972,"about_ca_topic_score_gemma":0.0000023118496,"teacher_disagreement_score":0.6789286,"about_ca_system_score_codex":0.000085397165,"about_ca_system_score_gemma":0.0011164307,"threshold_uncertainty_score":0.9950278},"labels":[],"label_agreement":null},{"id":"W4413042661","doi":"10.1016/j.ejor.2025.07.022","title":"Strategies for units incentivization: Assessing influence by maximizing loss/gain in centrally managed systems","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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":"McGill University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Operations management; Operations research; Mathematics; Economics","score_opus":0.18563622169092178,"score_gpt":0.46456384255537087,"score_spread":0.2789276208644491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413042661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59192514,0.0012362583,0.3881148,0.0038311803,0.00036696563,0.00037857893,0.000014861294,0.000010069085,0.014122123],"genre_scores_gemma":[0.99655056,0.00003982206,0.0015906123,0.00013284125,0.0000887305,0.000002890168,0.0000071643244,0.000012499368,0.0015748751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99072057,0.0043334197,0.0014732729,0.00035068172,0.0027295097,0.00039252886],"domain_scores_gemma":[0.99044913,0.0030576303,0.00034083315,0.000287223,0.005765626,0.00009957008],"candidate_categories":["metaresearch","scholarly_communication"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03726785,0.00012406248,0.0002955944,0.0014756365,0.00057457783,0.00376118,0.0013433994,0.000032768712,0.00003075966],"category_scores_gemma":[0.012014934,0.0000979483,0.00007351571,0.004026006,0.00022693991,0.0018179924,0.00016707498,0.0005478728,0.000024519513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015287328,0.00022412503,0.01381716,0.00004989831,0.000069709575,0.00027063576,0.00095573184,0.8669008,0.013843619,0.07157383,0.025762256,0.006379361],"study_design_scores_gemma":[0.0068732114,0.00080499094,0.14919375,0.0038070874,0.00007544144,0.00014570155,0.049700923,0.6259215,0.0019986562,0.02167426,0.13873926,0.0010652038],"about_ca_topic_score_codex":0.000015143121,"about_ca_topic_score_gemma":0.000009746905,"teacher_disagreement_score":0.40462542,"about_ca_system_score_codex":0.00021148822,"about_ca_system_score_gemma":0.0015044576,"threshold_uncertainty_score":0.997273},"labels":[],"label_agreement":null},{"id":"W4413119066","doi":"10.1016/j.ejor.2025.07.057","title":"Worst-case values of target semi-variances with applications to robust portfolio selection","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"Actua; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Selection (genetic algorithm); Portfolio; Computer science; Econometrics; Mathematical optimization; Mathematics; Statistics; Economics; Artificial intelligence; Financial economics","score_opus":0.14466597772328801,"score_gpt":0.4422429272366033,"score_spread":0.29757694951331526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413119066","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.05317756,0.000292953,0.88769156,0.0024364947,0.00014057671,0.00041595867,0.000015791411,0.0000089400955,0.05582017],"genre_scores_gemma":[0.9154616,0.00013348016,0.076256506,0.000134314,0.00031780227,0.000009899898,0.0000058755477,0.000014825657,0.0076656984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953434,0.0011150254,0.0010088291,0.00027519028,0.0020452894,0.00021229054],"domain_scores_gemma":[0.9926734,0.0007570396,0.00030722353,0.00026668987,0.005819575,0.00017604881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012940877,0.00010400442,0.00023393329,0.0013226954,0.00046493913,0.00037712176,0.0006129198,0.00002586258,0.0003837635],"category_scores_gemma":[0.001982517,0.00007069533,0.00007167196,0.0033207764,0.00014033611,0.00052081817,0.00009784144,0.00035093914,0.00007536728],"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.0005990867,0.00031299147,0.017066747,0.000009473249,0.00011590501,0.00038900145,0.00075794064,0.82926625,0.001480736,0.036072962,0.08849659,0.025432331],"study_design_scores_gemma":[0.0041548493,0.0046006106,0.098263055,0.0006599783,0.00012255082,0.0050606825,0.0076040816,0.04842064,0.012687708,0.02657444,0.7909337,0.0009176885],"about_ca_topic_score_codex":0.00001400525,"about_ca_topic_score_gemma":0.000011567644,"teacher_disagreement_score":0.86228406,"about_ca_system_score_codex":0.000060272854,"about_ca_system_score_gemma":0.0009450194,"threshold_uncertainty_score":0.44850755},"labels":[],"label_agreement":null},{"id":"W4413203420","doi":"10.1016/j.ejor.2025.07.009","title":"Optimal ordering policy for perishable products by incorporating demand forecasts","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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":"Hamilton Health Sciences; University of Calgary; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Newsvendor model; Operations research; Computer science; Business; Supply chain; Marketing; Mathematics","score_opus":0.06754646761133612,"score_gpt":0.33366017731474845,"score_spread":0.2661137097034123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413203420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50754344,0.0015787636,0.05406353,0.071261615,0.0016814083,0.0022608114,0.000017139791,0.000078664,0.3615146],"genre_scores_gemma":[0.98239607,0.000017148026,0.0043484215,0.0012868503,0.003334031,0.000014524058,0.000029556215,0.000033440905,0.008539932],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99832577,0.000112397596,0.00047326353,0.00020251711,0.00057254,0.0003134966],"domain_scores_gemma":[0.9979736,0.00008955385,0.00016697778,0.00013663778,0.0016095729,0.000023646604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005538134,0.00011699074,0.0001543075,0.0007410835,0.00055583636,0.00082822476,0.00043917279,0.000016085207,0.00009643334],"category_scores_gemma":[0.0019661493,0.00010213369,0.00006381369,0.0007865537,0.00008221067,0.0010653052,0.00028968026,0.00025723007,0.00004521912],"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.00034774106,0.0002481055,0.001550861,0.0005015999,0.00014245184,0.00005359121,0.00015483201,0.009892178,0.00977814,0.09390004,0.8677006,0.015729887],"study_design_scores_gemma":[0.0014566313,0.00013419043,0.0011102426,0.00020939877,0.00001618721,0.000006431096,0.0004946944,0.020538708,0.0008698435,0.0010120696,0.9739832,0.00016836775],"about_ca_topic_score_codex":0.000022820888,"about_ca_topic_score_gemma":0.0000025473123,"teacher_disagreement_score":0.47485262,"about_ca_system_score_codex":0.00009658362,"about_ca_system_score_gemma":0.00023636137,"threshold_uncertainty_score":0.798659},"labels":[],"label_agreement":null},{"id":"W4413751356","doi":"10.1016/j.ejor.2025.08.015","title":"Partial vertical ownership cooperation between manufacturers and sharing economy platforms","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Sharing Economy and Platforms","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":"University of Windsor","funders":"Natural Science Basic Research Program of Shaanxi Province; National Natural Science Foundation of China; Chengdu University of Information Technology","keywords":"Sharing economy; Business; Industrial organization; Gig economy; Vertical integration; Computer science; Commerce; Market economy; Economics; Service economy; World Wide Web","score_opus":0.1015149502540236,"score_gpt":0.32354393896012984,"score_spread":0.22202898870610624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413751356","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208096,0.000069981535,0.0015626593,0.003042609,0.00018549759,0.00012824604,0.0000010746768,0.000012132046,0.07418817],"genre_scores_gemma":[0.99697137,0.000008739066,0.00011044192,0.0008074904,0.0015977512,0.0000016906989,0.000018753686,0.000012019363,0.0004717327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886274,0.00002575179,0.0004478846,0.00018423407,0.00023614557,0.00024323544],"domain_scores_gemma":[0.9992456,0.00016467055,0.00006207599,0.00011105725,0.00037962073,0.00003700396],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0037656373,0.00010319513,0.0001606942,0.00045742176,0.00040148728,0.0010493945,0.0003175185,0.000032654174,0.00028751354],"category_scores_gemma":[0.00043264515,0.000077731136,0.000048517955,0.00020639843,0.00009365743,0.0019045692,0.0002110009,0.00049459806,0.00017137076],"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.00062208733,0.000116784424,0.3153856,0.00024153003,0.00033719288,0.00016280533,0.00026253404,0.002227247,0.0004947784,0.62619156,0.021140974,0.032816883],"study_design_scores_gemma":[0.00454422,0.0002322037,0.44105953,0.00049690454,0.00010749735,0.0000469521,0.00058252405,0.017129136,0.002522983,0.037891943,0.4947488,0.0006372829],"about_ca_topic_score_codex":0.00001147318,"about_ca_topic_score_gemma":0.0000043059053,"teacher_disagreement_score":0.58829963,"about_ca_system_score_codex":0.00005052266,"about_ca_system_score_gemma":0.00008676623,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W4413751435","doi":"10.1016/j.ejor.2025.08.025","title":"Efficient resource sharing for strategic disaster preparedness","year":2025,"lang":"en","type":"article","venue":"European Journal of 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":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preparedness; Disaster preparedness; Business; Resource (disambiguation); Emergency management; Operations research; Process management; Computer science; Operations management; Knowledge management; Management; Economics; Engineering; Economic growth","score_opus":0.14454768834517473,"score_gpt":0.36384076504502544,"score_spread":0.2192930766998507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413751435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7860406,0.00015189504,0.008057082,0.006935148,0.00055182114,0.00048166487,0.000003276161,0.000020562427,0.19775797],"genre_scores_gemma":[0.9909918,0.0000030311098,0.00024914966,0.00058993296,0.0006592085,0.000008099715,0.0000137038005,0.00001271918,0.0074723917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841595,0.00008541892,0.00047877402,0.00019693984,0.00059415365,0.00022878015],"domain_scores_gemma":[0.99850184,0.000055544213,0.0000517716,0.0001844026,0.0011871152,0.000019312069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005612565,0.00008704055,0.00011119012,0.00049674336,0.00036441363,0.00052794174,0.0005209424,0.0000122475985,0.0003011905],"category_scores_gemma":[0.00045437238,0.00007283732,0.000083404346,0.00047718905,0.000051648138,0.00022852766,0.00025687664,0.00019063738,0.00015047789],"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.000716046,0.0005308532,0.00072096154,0.00067242637,0.00015719228,0.000036079364,0.00063015014,0.49113244,0.0011921594,0.3984993,0.10107527,0.0046370965],"study_design_scores_gemma":[0.0020552087,0.00010098094,0.0048960135,0.00032597253,0.00004186717,0.000004141344,0.004994961,0.39437398,0.00004345203,0.002309571,0.59059656,0.00025726412],"about_ca_topic_score_codex":0.000021284091,"about_ca_topic_score_gemma":0.00001500262,"teacher_disagreement_score":0.4895213,"about_ca_system_score_codex":0.000088390814,"about_ca_system_score_gemma":0.00008251651,"threshold_uncertainty_score":0.50909543},"labels":[],"label_agreement":null},{"id":"W4413854123","doi":"10.1016/j.ejor.2025.08.052","title":"Strategic inventory of original products amid new product launches","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Product Development and Customization","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":"Western University","funders":"National Natural Science Foundation of China","keywords":"Business; Product (mathematics); Operations research; Computer science; Industrial organization; Operations management; Economics; Engineering; Mathematics","score_opus":0.11005429009124591,"score_gpt":0.32572684248635453,"score_spread":0.21567255239510863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413854123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7722875,0.0015428825,0.00036357902,0.019782,0.0011726668,0.00046909653,0.0000010399771,0.000027201679,0.20435406],"genre_scores_gemma":[0.9846047,0.00004440077,0.0010305798,0.00021671188,0.0029029965,0.0000011660251,0.000016440124,0.00001714262,0.011165821],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998014,0.0001616194,0.0005439046,0.00020674257,0.00086254993,0.00021120739],"domain_scores_gemma":[0.9970421,0.00003175262,0.00022363532,0.00017139078,0.0025095993,0.00002149775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049909544,0.00010749213,0.00016767812,0.0007717885,0.0001879486,0.00027232102,0.00045303247,0.000013740063,0.0002616585],"category_scores_gemma":[0.0011556194,0.00008786416,0.00004441072,0.0012061258,0.0001045797,0.0010144286,0.00013768653,0.00033342588,0.00015256477],"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.00092665316,0.0005893379,0.028666943,0.00079828413,0.00027961214,0.00014087852,0.0004105087,0.0016391275,0.05304534,0.39705625,0.4953742,0.021072872],"study_design_scores_gemma":[0.0030846496,0.00017953198,0.06756182,0.0008368281,0.00007865469,0.000030506446,0.0007274161,0.0007002364,0.016629836,0.015079014,0.8946233,0.0004682086],"about_ca_topic_score_codex":0.000016569666,"about_ca_topic_score_gemma":0.0000034404788,"teacher_disagreement_score":0.3992491,"about_ca_system_score_codex":0.00005866636,"about_ca_system_score_gemma":0.0011482567,"threshold_uncertainty_score":0.35829964},"labels":[],"label_agreement":null},{"id":"W4414038062","doi":"10.1016/j.ejor.2025.09.002","title":"Optimistic and pessimistic approaches for cooperative games","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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 Windsor","funders":"Social Sciences and Humanities Research Council; Departament de Salut, Generalitat de Catalunya; Social Sciences and Humanities Research Council of Canada; Ministerio de Ciencia e Innovación; Generalitat de Catalunya; National Science Foundation","keywords":"Pessimism; Computer science; Operations research; Mathematical economics; Economics; Mathematics; Epistemology; Philosophy","score_opus":0.24358349397966222,"score_gpt":0.3496985167450292,"score_spread":0.106115022765367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414038062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3425462,0.011436172,0.3046449,0.0069162725,0.00094625965,0.0009567085,0.00017870132,0.000018570325,0.33235618],"genre_scores_gemma":[0.9897017,0.000049479953,0.0020368828,0.000067306704,0.00021423596,0.0000058808564,0.0000034771629,0.000011696783,0.007909341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99870837,0.0003403062,0.000548575,0.00016685446,0.000070220616,0.00016566584],"domain_scores_gemma":[0.998714,0.0006471959,0.000131971,0.00009609907,0.00034403134,0.000066673456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00848766,0.00007339106,0.00021955928,0.00028947,0.00026574382,0.0002189727,0.00021113985,0.00002046104,0.000073957075],"category_scores_gemma":[0.0027528016,0.00006694276,0.000050067178,0.00016239307,0.00014542561,0.00013288931,0.000049750448,0.0002635204,0.000037592086],"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.00011550205,0.000061352264,0.0011239067,0.00007050602,0.000078507204,0.000010458855,0.0005500892,0.0019218803,0.00006213555,0.99058205,0.0038971994,0.0015264144],"study_design_scores_gemma":[0.014654382,0.0065350085,0.10898513,0.0019888398,0.000084508865,0.00043243272,0.008242717,0.14086346,0.0012829507,0.24916977,0.4661787,0.0015820988],"about_ca_topic_score_codex":0.0000014556884,"about_ca_topic_score_gemma":3.5926757e-7,"teacher_disagreement_score":0.7414123,"about_ca_system_score_codex":0.000044500557,"about_ca_system_score_gemma":0.000086679225,"threshold_uncertainty_score":0.32955596},"labels":[],"label_agreement":null},{"id":"W4414121061","doi":"10.1016/j.ejor.2025.08.029","title":"Artificial intelligence for optimization: Unleashing the potential of parameter generation, model formulation, and solution methods","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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 British Columbia; Ivey Foundation; Simon Fraser University; Huawei Technologies (Canada)","funders":"","keywords":"Applications of artificial intelligence; Optimization problem; Optimization algorithm; Multitude; Engineering optimization; Mathematical model","score_opus":0.4907273405827899,"score_gpt":0.5660354031579511,"score_spread":0.0753080625751612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414121061","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.006880991,0.00011577143,0.9846114,0.0073947855,0.000083630315,0.00032602993,0.000007898667,0.0000043187592,0.00057518977],"genre_scores_gemma":[0.6383294,0.000025177527,0.36103395,0.00009658436,0.00014224583,0.0000076087463,0.0000049164464,0.000005458857,0.0003547101],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963783,0.0011714111,0.001195337,0.00019382764,0.0009317855,0.00012934061],"domain_scores_gemma":[0.99244577,0.0023099622,0.0002822299,0.00023892736,0.0046728,0.000050333827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020952217,0.00007082272,0.00014402732,0.00041819157,0.0006632343,0.0004160974,0.0004934716,0.00002920474,0.000057607103],"category_scores_gemma":[0.0071780677,0.00004616463,0.00008952765,0.0007051623,0.0001606554,0.0004120175,0.00011518031,0.000200642,0.000002052663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044275137,0.000027869046,0.000025180567,0.0000021466362,0.000011715621,1.9746562e-7,0.0001454933,0.77272695,0.0052823927,0.13965017,0.0020233563,0.080060236],"study_design_scores_gemma":[0.00007028537,0.00006761566,0.0002449438,0.000011645896,0.000008968502,0.000004453808,0.00013290638,0.9044626,0.004905863,0.08888069,0.0011720364,0.00003804016],"about_ca_topic_score_codex":0.000001383592,"about_ca_topic_score_gemma":0.0000011205734,"teacher_disagreement_score":0.6314484,"about_ca_system_score_codex":0.000033868124,"about_ca_system_score_gemma":0.00026523715,"threshold_uncertainty_score":0.8593336},"labels":[],"label_agreement":null},{"id":"W4414230345","doi":"10.1016/j.ejor.2025.09.014","title":"Graph model for multiple composite decision makers with large-scale groups: Probability-hesitant fuzzy preference modeling and application","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","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":"Toronto Metropolitan University; Wilfrid Laurier University","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Fuzzy logic; Graph; Preference; Decision model; Decision theory; Decision-making models","score_opus":0.2626252537878989,"score_gpt":0.44407243618941006,"score_spread":0.18144718240151114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414230345","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.4015775,0.00013065171,0.5967173,0.00057800766,0.000046477093,0.0004867598,0.000024447212,0.0000063509588,0.00043248662],"genre_scores_gemma":[0.7808588,0.000020847174,0.2187335,0.000101084275,0.00006291154,0.000019427293,0.00000540668,0.00001818878,0.00017979542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99349654,0.0011353958,0.0013880912,0.00065509224,0.002937395,0.00038746456],"domain_scores_gemma":[0.989974,0.003764459,0.00025478099,0.0005442321,0.005245515,0.00021696973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024280876,0.00018205078,0.00035557052,0.0009744635,0.00080855057,0.00097241206,0.0010758834,0.000045389283,0.000014980739],"category_scores_gemma":[0.005386815,0.00012196211,0.000110940244,0.0009530361,0.00016791602,0.00076256297,0.00038042525,0.0004951803,0.000017767532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0061059836,0.0004909795,0.009129131,0.00004571008,0.000067222754,0.000024700525,0.0021887424,0.86338544,0.025252584,0.011452231,0.001888208,0.07996904],"study_design_scores_gemma":[0.0019561055,0.0002421619,0.005662537,0.00019359318,0.000009678197,0.000025527765,0.00047301533,0.9450542,0.00012419205,0.045419067,0.0007183784,0.00012159134],"about_ca_topic_score_codex":0.0000025095305,"about_ca_topic_score_gemma":0.000038343453,"teacher_disagreement_score":0.37928134,"about_ca_system_score_codex":0.00010586892,"about_ca_system_score_gemma":0.00035456475,"threshold_uncertainty_score":0.93769914},"labels":[],"label_agreement":null},{"id":"W4414800634","doi":"10.1016/j.ejor.2025.08.016","title":"A two-step large neighborhood search for a collaborative two-tier city logistics system","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Urban and Freight Transport Logistics","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":"Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Bayerische Forschungsallianz; Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec; Université de Montréal; Deutsche Forschungsgemeinschaft","keywords":"Order (exchange); Service (business); Routing (electronic design automation); Plan (archaeology); Network planning and design; City logistics; Vehicle routing problem; Service provider; Humanitarian Logistics","score_opus":0.09599235311619658,"score_gpt":0.33904604984755216,"score_spread":0.24305369673135557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414800634","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.004459554,0.0014376901,0.86001647,0.00035248295,0.0006594924,0.0005174969,0.00037289655,0.00005163007,0.13213228],"genre_scores_gemma":[0.9903562,0.00007046123,0.0076734712,0.000055130007,0.00060670904,0.000008811606,0.000028087768,0.000041400435,0.0011597186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973643,0.00053619227,0.00065465784,0.00017903195,0.0007871781,0.00047866112],"domain_scores_gemma":[0.996323,0.00052166084,0.000046050325,0.00020459485,0.002717682,0.00018704773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00461202,0.00016698039,0.00029057928,0.000420442,0.000334958,0.00021510232,0.00045841362,0.00003672732,0.00007540545],"category_scores_gemma":[0.00030728473,0.00014364714,0.00010506793,0.00070554775,0.0001454112,0.00015756159,0.000054573327,0.0007675365,0.000038926926],"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.0005655324,0.00027424208,0.0035138594,0.00048602902,0.0005847462,0.0007544371,0.00084715127,0.08659156,0.0023610939,0.8568554,0.04553256,0.0016333906],"study_design_scores_gemma":[0.019991463,0.00211892,0.009495868,0.0014465784,0.00023530076,0.0001777442,0.0053592017,0.68618125,0.006084378,0.0009976287,0.26679718,0.0011145121],"about_ca_topic_score_codex":0.00000276448,"about_ca_topic_score_gemma":0.000011171172,"teacher_disagreement_score":0.98589665,"about_ca_system_score_codex":0.00029734464,"about_ca_system_score_gemma":0.0005611665,"threshold_uncertainty_score":0.58577603},"labels":[],"label_agreement":null},{"id":"W4414978162","doi":"10.1016/j.ejor.2025.10.006","title":"The Weber problem with demand uniformly generated in discs","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Evacuation and Crowd Dynamics","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":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"On demand; Production (economics); Supply and demand","score_opus":0.025772095708001264,"score_gpt":0.3100768913060421,"score_spread":0.28430479559804084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414978162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.802351,0.0013296552,0.022846218,0.0076667196,0.00019920614,0.0003374079,0.000004992085,0.000026266072,0.16523851],"genre_scores_gemma":[0.9954191,0.0002546348,0.0012501122,0.000056607143,0.0000658318,0.0000023711573,0.0000035664762,0.000014360929,0.0029334284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874973,0.0003371968,0.0002914983,0.000054824224,0.0004064739,0.00016025748],"domain_scores_gemma":[0.9992316,0.00014030373,0.000019817237,0.00008388967,0.0004782327,0.000046185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029047146,0.000058333575,0.00006685972,0.00017835987,0.00018081114,0.00020815442,0.0002201755,0.000011744934,0.000026041122],"category_scores_gemma":[0.00009615925,0.00003392416,0.00001773756,0.0004555672,0.00006259813,0.00015157173,0.000027637703,0.0004474363,0.000020730315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022490502,0.00007437987,0.0043844,0.000040412146,0.000140975,0.00021105185,0.00059837056,0.8931262,0.0065797754,0.06162025,0.022277001,0.010722307],"study_design_scores_gemma":[0.005457897,0.0007076215,0.20242113,0.000774498,0.000022295957,0.00020208018,0.0014495755,0.5728533,0.0030032988,0.0019532142,0.2106838,0.0004712635],"about_ca_topic_score_codex":9.755565e-7,"about_ca_topic_score_gemma":0.000060224826,"teacher_disagreement_score":0.32027283,"about_ca_system_score_codex":0.00008427767,"about_ca_system_score_gemma":0.00020040832,"threshold_uncertainty_score":0.20072378},"labels":[],"label_agreement":null},{"id":"W4415043667","doi":"10.1016/j.ejor.2025.10.007","title":"Robust valuation and optimal harvesting of forestry resources in the presence of catastrophe risk and parameter uncertainty","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","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":"Western University","funders":"","keywords":"Valuation (finance); Lease; Convenience yield; Estimation theory; Stochastic differential equation; Stochastic modelling; Poisson distribution; Kalman filter; Present value","score_opus":0.11878446205745734,"score_gpt":0.30791835786065774,"score_spread":0.1891338958032004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415043667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931546,0.004423431,0.0006590748,0.000614976,0.00001596618,0.00009080791,0.000020380667,4.3291405e-7,0.0010203202],"genre_scores_gemma":[0.9959453,0.0010217212,0.002805167,0.000017453951,0.00003143083,0.0000014691959,0.0000031619943,0.0000034885668,0.00017085313],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99858475,0.0005023682,0.0005654491,0.00011081724,0.00014047674,0.00009613908],"domain_scores_gemma":[0.9986229,0.00077165326,0.00024601788,0.00011987845,0.00021168744,0.000027885533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00728386,0.00004891022,0.00016117682,0.00035297708,0.00009688919,0.00010299563,0.00023237344,0.000014057631,0.000026747837],"category_scores_gemma":[0.002826697,0.000035657395,0.000039999555,0.00029751027,0.00022286567,0.0002046827,0.000096806325,0.00025307975,0.0000015916446],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032641817,0.00026785996,0.67149276,0.0001223906,0.00023761345,0.000026053218,0.007718904,0.19197716,0.00051441207,0.11886452,0.0022467112,0.006205209],"study_design_scores_gemma":[0.00066698284,0.00031662482,0.89465207,0.00011723309,0.000015370144,0.000008458737,0.0016765277,0.09054013,0.00007866421,0.011373856,0.00049031206,0.000063736916],"about_ca_topic_score_codex":0.00032837244,"about_ca_topic_score_gemma":0.000024067982,"teacher_disagreement_score":0.22315936,"about_ca_system_score_codex":0.00001744474,"about_ca_system_score_gemma":0.000036886984,"threshold_uncertainty_score":0.33840245},"labels":[],"label_agreement":null},{"id":"W4415045487","doi":"10.1016/j.ejor.2025.10.009","title":"Revisiting the inverse transformation of undesirable factors in data envelopment analysis: A novel iterative algorithm","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","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 New Brunswick","funders":"","keywords":"Data envelopment analysis; Production (economics); Convergence (economics); Iterative method; Set (abstract data type); Transformation (genetics); Inverse; Linear programming","score_opus":0.3468908455021079,"score_gpt":0.4804841326248528,"score_spread":0.13359328712274487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415045487","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.3117769,0.00044889355,0.6548389,0.013691502,0.0001448034,0.00034969393,0.000088157314,0.00000483455,0.018656299],"genre_scores_gemma":[0.9914852,0.00004610868,0.0074677174,0.00010555783,0.000060361293,5.919254e-7,0.00002330261,0.000004896439,0.0008062931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912318,0.003369006,0.0017497892,0.00029077823,0.0031394637,0.00021914665],"domain_scores_gemma":[0.9936839,0.0029578297,0.00038569243,0.00056950026,0.0023416663,0.00006145537],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.055210326,0.00009958907,0.00033902837,0.0023749568,0.00035574357,0.0004858547,0.0020669282,0.000019850168,0.00012083453],"category_scores_gemma":[0.007946736,0.000057430992,0.0001428141,0.006494165,0.00020964316,0.00095087866,0.00027980213,0.0005450157,0.000017332317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045158845,0.0011106532,0.046768155,0.000056476358,0.0031990162,0.00017155541,0.047919594,0.61739856,0.020114362,0.022682603,0.01516614,0.22496128],"study_design_scores_gemma":[0.0014008376,0.00013588644,0.17536546,0.00037491665,0.00020415697,0.000011601721,0.01865716,0.7777025,0.002444996,0.00070468656,0.022788333,0.00020946283],"about_ca_topic_score_codex":0.00003201843,"about_ca_topic_score_gemma":0.000058429767,"teacher_disagreement_score":0.6797083,"about_ca_system_score_codex":0.00012647771,"about_ca_system_score_gemma":0.0007211082,"threshold_uncertainty_score":0.9728598},"labels":[],"label_agreement":null},{"id":"W4415973050","doi":"10.1016/j.ejor.2025.10.045","title":"Environmental standards: Examining a regulator’s strategy for setting a deadline","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Regulation and Compliance Studies","field":"Business, Management and Accounting","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":"Ontario Tech University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Key (lock); Production (economics); Scheduling (production processes)","score_opus":0.11071732136658825,"score_gpt":0.37036728223540843,"score_spread":0.2596499608688202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415973050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8557114,0.0013144646,0.021316998,0.0071100895,0.00051540806,0.0006177092,0.00002773482,0.000030715506,0.11335549],"genre_scores_gemma":[0.9957785,0.00001585881,0.00095125067,0.00041354165,0.0011645567,0.000004571879,0.000009077443,0.000015263864,0.001647405],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983847,0.00009694999,0.00042487777,0.00014175325,0.00074428355,0.00020744825],"domain_scores_gemma":[0.9988809,0.00014616146,0.00013918529,0.00009436183,0.00072459655,0.000014754453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048887976,0.00008953094,0.00013642553,0.00035120908,0.0005301424,0.0004323784,0.00024237475,0.000012394504,0.00021331824],"category_scores_gemma":[0.0005559805,0.00007535299,0.000062172636,0.00024124506,0.00009534733,0.0005566361,0.00013769923,0.00019863999,0.000021714299],"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.0016751963,0.00048153472,0.046290144,0.00044919713,0.00056817237,0.00018524595,0.00041984871,0.016408464,0.026386194,0.22446887,0.37281013,0.309857],"study_design_scores_gemma":[0.0028514266,0.00018695736,0.42380068,0.00039178654,0.000030944553,0.000012289585,0.0019328546,0.010263228,0.00019227805,0.0033541354,0.5567633,0.00022014536],"about_ca_topic_score_codex":0.0000020508478,"about_ca_topic_score_gemma":0.0000022845004,"teacher_disagreement_score":0.37751052,"about_ca_system_score_codex":0.00009212279,"about_ca_system_score_gemma":0.00013773877,"threshold_uncertainty_score":0.41694352},"labels":[],"label_agreement":null},{"id":"W4416398624","doi":"10.1016/j.ejor.2025.11.015","title":"Credit selection in collateralized loan obligation: Efficient approximation through linearization and clustering","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","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":"HEC Montréal","funders":"HEC Montréal; Belgian Federal Science Policy Office; Fonds De La Recherche Scientifique - FNRS","keywords":"Loan; Cluster analysis; Optimization problem; Collateralized debt obligation; Securitization; Bailout; Piecewise linear function; Linearization","score_opus":0.14211217299464257,"score_gpt":0.4449334478302602,"score_spread":0.3028212748356176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416398624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56048024,0.00024026912,0.41925088,0.004914002,0.00037368128,0.0003620915,0.0000029944504,0.000009802778,0.01436605],"genre_scores_gemma":[0.9872796,0.00023370689,0.010810824,0.00009314826,0.00021501101,0.0000027240874,0.000008332972,0.000008913776,0.001347729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995246,0.0017999992,0.0010340408,0.00023349597,0.0015157437,0.00017073484],"domain_scores_gemma":[0.996807,0.0005467494,0.00023224678,0.00010654404,0.0022476043,0.000059867874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012664121,0.000086593274,0.0001767716,0.0010341074,0.00032706812,0.0007336109,0.00026888272,0.00003592637,0.00008780105],"category_scores_gemma":[0.0033025742,0.00006856942,0.00003871002,0.0021519596,0.00008579344,0.00066245045,0.00010090127,0.0003173701,0.00002472851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004468536,0.0001425674,0.015700223,0.000012563294,0.000022109709,0.000028132841,0.0025659262,0.93791664,0.0052164495,0.012684103,0.0054303263,0.019834083],"study_design_scores_gemma":[0.0019876978,0.00026056104,0.11906256,0.0001608049,0.0000069842754,0.0000611548,0.0006008766,0.85824853,0.001426986,0.0051698782,0.012886403,0.0001275915],"about_ca_topic_score_codex":0.000013159862,"about_ca_topic_score_gemma":0.000012447948,"teacher_disagreement_score":0.4267994,"about_ca_system_score_codex":0.00011611036,"about_ca_system_score_gemma":0.0003005416,"threshold_uncertainty_score":0.7074227},"labels":[],"label_agreement":null},{"id":"W4416529793","doi":"10.1016/j.ejor.2025.11.022","title":"Multi-output shrunken regression trees","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Remote Sensing in Agriculture","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":"HEC Montréal","funders":"Hong Kong Polytechnic University; National Natural Science Foundation of China","keywords":"Estimator; Regression; Sample (material); Regression analysis; Outlier; Mean squared error; Linear regression; Shrinkage estimator","score_opus":0.06401209818678301,"score_gpt":0.3552140312243561,"score_spread":0.2912019330375731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416529793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73313636,0.0003956239,0.0047590937,0.011681698,0.00056830427,0.00027373133,0.0000032899043,0.000020352074,0.24916157],"genre_scores_gemma":[0.9556833,0.000067897636,0.01666916,0.00022819439,0.0002045607,1.7614386e-7,0.0000026640043,0.000011454588,0.027132591],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9970926,0.001118824,0.00035047118,0.00017271396,0.0010468621,0.00021855299],"domain_scores_gemma":[0.9992683,0.00016467608,0.000077076795,0.00016394339,0.00021242106,0.00011356741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033807207,0.0000914008,0.000114955394,0.00013024882,0.00032147288,0.00014676068,0.00048644826,0.000025399591,0.0005141163],"category_scores_gemma":[0.00087036623,0.00005598102,0.00006886809,0.0004455207,0.00020973563,0.00025236415,0.00028088604,0.000584904,0.00061550207],"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.0001629936,0.00032520757,0.010592794,0.000008989986,0.00005261676,0.00064739503,0.0008797601,0.012392978,0.31955805,0.0003386322,0.5833549,0.07168566],"study_design_scores_gemma":[0.0008977946,0.00021111939,0.7425051,0.0002566127,0.0000070347946,0.00013139879,0.000240066,0.003103498,0.0038646415,0.00010728941,0.24854504,0.00013042816],"about_ca_topic_score_codex":0.000011778122,"about_ca_topic_score_gemma":0.000012836242,"teacher_disagreement_score":0.7319123,"about_ca_system_score_codex":0.0001923084,"about_ca_system_score_gemma":0.00006703393,"threshold_uncertainty_score":0.7911239},"labels":[],"label_agreement":null},{"id":"W4416731099","doi":"10.1016/j.ejor.2025.11.021","title":"Large neighborhood and hybrid genetic search for inventory routing problems","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","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":"Polytechnique Montréal","funders":"Shenzhen Research Institute of Big Data; National Natural Science Foundation of China; Scale AI","keywords":"Benchmark (surveying); Routing (electronic design automation); Vehicle routing problem; Heuristic; Genetic algorithm; Operator (biology); Local search (optimization); Preprocessor","score_opus":0.06201460042252724,"score_gpt":0.3530211286014591,"score_spread":0.2910065281789319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416731099","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.19302285,0.0015686909,0.7930748,0.00076020585,0.00024229973,0.00037245854,0.000012571321,0.000034571593,0.01091159],"genre_scores_gemma":[0.9646808,0.0001547861,0.03427858,0.00005901216,0.00025867703,0.0000044368917,0.0000044290928,0.000037573383,0.00052171614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978163,0.000819959,0.00046170875,0.00013116753,0.00045135888,0.0003194629],"domain_scores_gemma":[0.99852115,0.0003707032,0.000033759556,0.00011311602,0.00084723724,0.00011401356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007993861,0.00009089341,0.00014044356,0.0003695991,0.00027089182,0.00019922908,0.00024267362,0.000017785698,0.000035654866],"category_scores_gemma":[0.00069633935,0.00008651333,0.000047295063,0.0002835074,0.000053219745,0.00016023418,0.000099166995,0.00047228046,0.0000075024227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001027727,0.00013923466,0.015413515,0.0004966206,0.00028365388,0.00009574831,0.001930204,0.90113384,0.016542682,0.01968602,0.01064901,0.033526726],"study_design_scores_gemma":[0.0020115662,0.00023837789,0.012034115,0.00029383288,0.000014402068,0.000073832176,0.00027133813,0.97155726,0.0029246707,0.00040574736,0.010011667,0.00016321953],"about_ca_topic_score_codex":4.9287183e-7,"about_ca_topic_score_gemma":3.6067468e-7,"teacher_disagreement_score":0.77165794,"about_ca_system_score_codex":0.00008916228,"about_ca_system_score_gemma":0.000183695,"threshold_uncertainty_score":0.35279113},"labels":[],"label_agreement":null},{"id":"W4417057052","doi":"10.1016/j.ejor.2025.11.037","title":"A Tetris Beam Search algorithm for the distributor’s pallet loading problem","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Packing Problems","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; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Politecnico di Milano","keywords":"Pallet; Beam search; Heuristic; Constructive; Set (abstract data type); Homogeneous; Search algorithm; Heuristics","score_opus":0.05447559080304888,"score_gpt":0.33480267635893635,"score_spread":0.2803270855558875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417057052","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.0010924094,0.0017536737,0.9722786,0.0041277967,0.00047368175,0.00055495143,0.000055614666,0.00003834375,0.019624919],"genre_scores_gemma":[0.91213363,0.0013252819,0.07450824,0.00026197583,0.0012366306,0.000034710527,0.00006127054,0.00010066225,0.010337569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983671,0.0002806713,0.00039741403,0.000101694815,0.00057374605,0.00027939212],"domain_scores_gemma":[0.997891,0.00078111904,0.000028369794,0.00013274113,0.0010828244,0.00008390698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005141392,0.000090930334,0.00011827251,0.0002695647,0.00041980945,0.00035826195,0.0004355745,0.00002225288,0.00011225028],"category_scores_gemma":[0.00032654076,0.0000638286,0.00008109935,0.0005259962,0.00007554932,0.00014668902,0.00006605541,0.00057561457,0.00003159437],"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.000055386507,0.00008679934,0.00019733694,0.00011852137,0.000340322,0.000039385977,0.0007282037,0.6554008,0.0026699689,0.0060234834,0.17983016,0.1545096],"study_design_scores_gemma":[0.0017102681,0.00030672646,0.0012709099,0.0002997345,0.0000219936,0.00004595269,0.00040039996,0.45470968,0.0034637982,0.00022676226,0.5373499,0.00019390567],"about_ca_topic_score_codex":0.0000018008288,"about_ca_topic_score_gemma":7.198159e-7,"teacher_disagreement_score":0.91104126,"about_ca_system_score_codex":0.00011496435,"about_ca_system_score_gemma":0.0001960108,"threshold_uncertainty_score":0.34547284},"labels":[],"label_agreement":null},{"id":"W583457983","doi":"10.1016/j.ejor.2004.08.002","title":"Lot streaming for quality control in two-stage batch production","year":2004,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Statistical Process Monitoring","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":"McMaster University; University of Waterloo","funders":"","keywords":"Quality (philosophy); Control (management); Business; Computer science; Marketing; Operations management; Engineering; Artificial intelligence; Physics","score_opus":0.4404311080290821,"score_gpt":0.594754287773503,"score_spread":0.15432317974442095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W583457983","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.37422046,0.00012355631,0.618744,0.00428826,0.0004894365,0.00033751933,0.00002807228,0.000005668362,0.0017629885],"genre_scores_gemma":[0.97517174,0.000006018699,0.02306006,0.00004678844,0.00081258116,0.000004729837,0.0000015847806,0.000016095586,0.00088037574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9936493,0.0016329933,0.0012280864,0.00032562675,0.0028367348,0.00032727118],"domain_scores_gemma":[0.992374,0.0035344898,0.0002493745,0.00020551788,0.0034761943,0.00016040452],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.034034815,0.00009145337,0.0002342887,0.00043876644,0.00029378268,0.00031120484,0.0005897273,0.000012067139,0.00006499411],"category_scores_gemma":[0.059886828,0.00006862393,0.00006434236,0.0006090714,0.00015460016,0.0008249653,0.00006601927,0.00055621576,0.0000646167],"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.0024123427,0.00065222156,0.0149772605,0.00005034527,0.000047186888,0.00044705774,0.0024842718,0.69099057,0.06768104,0.086280115,0.0013530413,0.13262458],"study_design_scores_gemma":[0.037679188,0.0044273436,0.48829532,0.0010520053,0.000025615152,0.0003743159,0.017307812,0.01378945,0.026083183,0.3694164,0.040177967,0.0013714142],"about_ca_topic_score_codex":0.0000148642575,"about_ca_topic_score_gemma":0.000037591424,"teacher_disagreement_score":0.6772011,"about_ca_system_score_codex":0.00025061716,"about_ca_system_score_gemma":0.00042917242,"threshold_uncertainty_score":0.99466443},"labels":[],"label_agreement":null},{"id":"W7082444861","doi":"10.1016/j.ejor.2025.08.032","title":"Continuous-time optimal investment with portfolio constraints: A reinforcement learning approach","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","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":"Natural Sciences and Engineering Research Council of Canada; Associated Medical Services; American Mathematical Society","keywords":"Reinforcement learning; Portfolio; Investment (military); Investment strategy; Reinforcement; Portfolio optimization","score_opus":0.03340948782876183,"score_gpt":0.28972507732951414,"score_spread":0.2563155895007523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082444861","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.007269334,0.000082949846,0.29624507,0.0031978032,0.000037571983,0.00013840216,2.8804274e-7,0.000015977686,0.6930126],"genre_scores_gemma":[0.91624814,0.0000133759595,0.041460566,0.00040053975,0.0001001223,0.000003898223,0.0000059474055,0.0000033051226,0.04176412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975525,0.0006937309,0.00042447707,0.00021722548,0.00081739697,0.00029468458],"domain_scores_gemma":[0.9980746,0.0001393686,0.00013188655,0.00020000058,0.0013231377,0.00013103375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005172185,0.00010607098,0.00016543617,0.00022828642,0.00031914303,0.00032492913,0.00079068076,0.00001923449,0.00021791426],"category_scores_gemma":[0.00057841005,0.000078236066,0.00005017094,0.00040405933,0.00024726716,0.00029936148,0.0003047024,0.00065915106,0.000043766828],"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.00026906913,0.00037395812,0.0011669645,0.000077329794,0.00039272607,0.0014586354,0.0016790599,0.6356129,0.011907093,0.2928663,0.043831572,0.010364397],"study_design_scores_gemma":[0.006466414,0.0043752086,0.0060905553,0.0009685223,0.00003501268,0.0025407665,0.002046886,0.3066967,0.009553707,0.0010356376,0.6594217,0.00076887576],"about_ca_topic_score_codex":0.0000011748881,"about_ca_topic_score_gemma":2.7506973e-8,"teacher_disagreement_score":0.9089788,"about_ca_system_score_codex":0.000067195266,"about_ca_system_score_gemma":0.0006323001,"threshold_uncertainty_score":0.3190374},"labels":[],"label_agreement":null},{"id":"W7082970495","doi":"10.1016/j.ejor.2025.09.013","title":"Markov decision processes: Monotonicity of optimal policy in exponential and quasi-hyperbolic discounting parameters","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Amorfix (Canada)","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; AXA Research Fund","keywords":"Discounting; Monotonic function; Markov decision process; Maximization; Hyperbolic discounting; Submodular set function; Dynamic programming; Exponential function; Function (biology)","score_opus":0.03818840304925745,"score_gpt":0.3458590615771783,"score_spread":0.3076706585279208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7082970495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92900014,0.0002951242,0.059217893,0.0038952804,0.000048729205,0.000089440604,9.916594e-7,0.0000032776131,0.0074491054],"genre_scores_gemma":[0.97364926,0.00010622719,0.025891187,0.000047829362,0.000055829652,0.0000012760518,5.7041296e-7,0.0000017331116,0.00024605604],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99812734,0.00046312774,0.00048426844,0.00018508681,0.00052954495,0.00021063144],"domain_scores_gemma":[0.9984444,0.0005355169,0.00010724013,0.0001519294,0.00069752213,0.00006340858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004388692,0.00007355787,0.00015928844,0.00041753912,0.0001312557,0.00018575783,0.00066495035,0.00002017284,0.00000912387],"category_scores_gemma":[0.0038691454,0.000060366103,0.000032986623,0.00077971857,0.00012386768,0.00040735464,0.0004204182,0.00035464452,0.00000193616],"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.002783954,0.0029120296,0.11837634,0.0017480556,0.00035199252,0.0015266498,0.016850775,0.12277646,0.14227481,0.14251196,0.005610211,0.44227675],"study_design_scores_gemma":[0.011987818,0.0030699251,0.57280314,0.0052957805,0.000025979698,0.0008453446,0.0040084566,0.27691582,0.07147726,0.023200402,0.029156312,0.0012137542],"about_ca_topic_score_codex":0.000025422143,"about_ca_topic_score_gemma":0.0000039428805,"teacher_disagreement_score":0.45442683,"about_ca_system_score_codex":0.000040888095,"about_ca_system_score_gemma":0.0006356115,"threshold_uncertainty_score":0.46320078},"labels":[],"label_agreement":null},{"id":"W7093340838","doi":"10.1016/j.ejor.2025.10.034","title":"Managing returns by selling and pricing strategies with online product reviews","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Product (mathematics); Pricing strategies; Revenue management; E-commerce; New product development","score_opus":0.07075442362666412,"score_gpt":0.345895042863153,"score_spread":0.27514061923648886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093340838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90382177,0.012210833,0.004649665,0.010824883,0.00022839477,0.0005146715,0.0000024960495,0.000026129117,0.067721166],"genre_scores_gemma":[0.9951485,0.0011466955,0.0013511096,0.0003861471,0.00058622425,0.0000014628512,0.00001098078,0.000019970705,0.0013489433],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984966,0.00022332702,0.00042817974,0.00018692328,0.00045369237,0.00021130944],"domain_scores_gemma":[0.9988798,0.00011212913,0.00014706091,0.00012429713,0.0007174405,0.000019271649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055396575,0.00011333256,0.00018567585,0.00045504273,0.00036749788,0.00093816296,0.00024192578,0.00000907776,0.00007418656],"category_scores_gemma":[0.00031023685,0.00008115934,0.00003214421,0.0006083138,0.00008366265,0.0011182363,0.0001348946,0.0005211204,0.000011537756],"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.001042512,0.0005259786,0.10503565,0.001959991,0.00028255818,0.0007324855,0.0010407205,0.0012644836,0.050053824,0.015614602,0.09775973,0.72468746],"study_design_scores_gemma":[0.0018797708,0.00014770466,0.08526063,0.0032518678,0.00016588872,0.00010712206,0.003181077,0.0032078042,0.00030474464,0.0008488555,0.9011545,0.0004900252],"about_ca_topic_score_codex":0.000029162886,"about_ca_topic_score_gemma":0.000022705799,"teacher_disagreement_score":0.8033948,"about_ca_system_score_codex":0.000023088953,"about_ca_system_score_gemma":0.00010349947,"threshold_uncertainty_score":0.9046727},"labels":[],"label_agreement":null},{"id":"W7106312712","doi":"10.1016/j.ejor.2025.11.028","title":"A hybrid multi-layered ensemble model based on heterogeneous information network for small and medium-sized enterprise default prediction","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Financial Distress and Bankruptcy Prediction","field":"Business, Management and Accounting","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":"Southwestern University of Finance and Economics; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Boosting (machine learning); Gradient boosting; Decision tree; Artificial neural network; Construct (python library); Enterprise private network; Credit risk; Component (thermodynamics); Graph","score_opus":0.047207827721673104,"score_gpt":0.2908680964868873,"score_spread":0.24366026876521418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106312712","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.21283856,0.0001122771,0.77851945,0.002688534,0.0006441968,0.0006893725,0.0000634584,0.00003447821,0.0044096797],"genre_scores_gemma":[0.99427146,0.00002692961,0.0036932193,0.0009763181,0.0007632439,0.000017410524,0.00010625315,0.0000139492395,0.0001312408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985662,0.00009714935,0.00050877634,0.00013474056,0.00046532697,0.00022779674],"domain_scores_gemma":[0.9983148,0.00012146026,0.00017051077,0.00010539972,0.001261927,0.000025921547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024490904,0.00011339079,0.00014441283,0.00041117606,0.0004478242,0.00048724032,0.00018802515,0.000026990421,0.000011697342],"category_scores_gemma":[0.0007964787,0.00009709261,0.000079812475,0.00019042783,0.00004755223,0.000808711,0.00007586761,0.0002546684,0.00001531559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036707837,0.00030927733,0.0021129423,0.0002819669,0.000077118675,0.000034380857,0.00006231006,0.8976074,0.001614557,0.005508154,0.03589561,0.052825503],"study_design_scores_gemma":[0.0025723223,0.0001247213,0.011328256,0.00025108503,0.00002154904,0.000004656582,0.000018965851,0.9735998,0.00014624819,0.0006014985,0.01125155,0.00007934236],"about_ca_topic_score_codex":0.000010440604,"about_ca_topic_score_gemma":0.0000093155795,"teacher_disagreement_score":0.78143287,"about_ca_system_score_codex":0.000060614417,"about_ca_system_score_gemma":0.00017800766,"threshold_uncertainty_score":0.46984696},"labels":[],"label_agreement":null},{"id":"W7115008376","doi":"10.1016/j.ejor.2025.12.020","title":"Graph model for conflict resolution of large-scale group with overlapping coalitions based on meta-clustering under big data","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Conflict Management and Negotiation","field":"Social Sciences","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":"Humanities and Social Science Fund of Ministry of Education of China; Graduate Research and Innovation Projects of Jiangsu Province; Ministry of Industry and Information Technology of the People's Republic of China; National Natural Science Foundation of China","keywords":"Conflict analysis; Conflict resolution; Preprocessor; Graph; Fuzzy logic; Big data; Design structure matrix; Group decision-making; Stakeholder","score_opus":0.3882401630904367,"score_gpt":0.4393567967295778,"score_spread":0.051116633639141096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115008376","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.0046217213,0.00012453078,0.9513785,0.010684131,0.00012053225,0.00043763648,0.00008395631,0.0000090931135,0.032539852],"genre_scores_gemma":[0.9912981,0.000074105985,0.005497819,0.00038872368,0.00022511758,0.000007428036,0.00007265363,0.000011295232,0.002424784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741477,0.0008848354,0.000354181,0.00017428555,0.0009498004,0.00022215872],"domain_scores_gemma":[0.9981412,0.0005156333,0.00012846827,0.0002616656,0.00088703976,0.000065965476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010024274,0.00007124793,0.00015860038,0.00048877107,0.00070408965,0.00015276697,0.00055965,0.000019284898,0.000055807726],"category_scores_gemma":[0.00062909495,0.00005773717,0.00008073011,0.00047758807,0.00013920963,0.00035406297,0.00014441542,0.00019871606,0.000002018864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022384967,0.0009718199,0.000659116,0.00019047665,0.0014270415,0.000017298637,0.006983902,0.56897116,0.004001665,0.3701817,0.039868012,0.0044893054],"study_design_scores_gemma":[0.0020146717,0.00037825716,0.004677404,0.00022235677,0.00021287946,5.8730893e-7,0.0021009438,0.91437125,0.000044001623,0.000716329,0.07513468,0.00012665609],"about_ca_topic_score_codex":0.000039050577,"about_ca_topic_score_gemma":0.00064677023,"teacher_disagreement_score":0.98667634,"about_ca_system_score_codex":0.00007543344,"about_ca_system_score_gemma":0.00040470492,"threshold_uncertainty_score":0.541536},"labels":[],"label_agreement":null},{"id":"W7117310587","doi":"10.1016/j.ejor.2025.12.035","title":"Probabilistic price promotions without obligations","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lottery; Probabilistic logic; Duopoly; Product (mathematics); Oligopoly; Promotion (chess); Bayesian game; Value (mathematics); Free entry","score_opus":0.08969530748704,"score_gpt":0.36027181744098263,"score_spread":0.27057650995394267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117310587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7985237,0.00009054821,0.0032062985,0.008255619,0.0002964301,0.00030414475,0.0000013724609,0.000022604672,0.18929926],"genre_scores_gemma":[0.9968815,0.000005513198,0.0007728058,0.00024978374,0.0004598116,0.0000053609633,0.000005010828,0.000011964279,0.0016082795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984673,0.0002243008,0.00041519443,0.00013265603,0.00056736235,0.00019314747],"domain_scores_gemma":[0.9974877,0.00015932358,0.00010697749,0.00014778806,0.0020771448,0.000021025568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049160263,0.00007974879,0.000110126,0.00066379114,0.0005046282,0.0006685959,0.00036795865,0.000013245367,0.0003185579],"category_scores_gemma":[0.0015862867,0.000066965054,0.000062364306,0.00089483935,0.00010389016,0.00072248885,0.00023462529,0.00046273577,0.00013493258],"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.00035554726,0.0013061854,0.31579813,0.00046727288,0.00022070292,0.00027650825,0.00052090856,0.0036696002,0.017306184,0.56238014,0.041404333,0.056294464],"study_design_scores_gemma":[0.0010472795,0.000052077987,0.9009928,0.000415759,0.00007162739,0.000027502187,0.000256585,0.00474678,0.00008626404,0.00929217,0.08281848,0.00019268054],"about_ca_topic_score_codex":0.000015521147,"about_ca_topic_score_gemma":0.000008884986,"teacher_disagreement_score":0.58519465,"about_ca_system_score_codex":0.00004471573,"about_ca_system_score_gemma":0.00026318635,"threshold_uncertainty_score":0.6447286},"labels":[],"label_agreement":null}]}